java -ea -Xmx8000000000 -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Bitvector.epf -i ../../../trunk/examples/svcomp/list-simple/dll2n_update_all_true-unreach-call_true-valid-memsafety.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-18e5b2d-m [2018-11-18 22:03:17,827 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-18 22:03:17,829 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-18 22:03:17,846 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-18 22:03:17,846 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-18 22:03:17,848 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-18 22:03:17,849 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-18 22:03:17,851 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-18 22:03:17,854 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-18 22:03:17,855 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-18 22:03:17,857 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-18 22:03:17,858 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-18 22:03:17,859 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-18 22:03:17,860 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-18 22:03:17,869 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-18 22:03:17,870 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-18 22:03:17,871 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-18 22:03:17,872 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-18 22:03:17,876 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-18 22:03:17,878 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-18 22:03:17,880 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-18 22:03:17,881 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-18 22:03:17,884 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-18 22:03:17,884 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-18 22:03:17,884 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-18 22:03:17,888 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-18 22:03:17,890 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-18 22:03:17,891 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-18 22:03:17,892 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-18 22:03:17,895 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-18 22:03:17,895 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-18 22:03:17,896 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-18 22:03:17,896 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-18 22:03:17,897 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-18 22:03:17,897 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-18 22:03:17,899 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-18 22:03:17,900 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Bitvector.epf [2018-11-18 22:03:17,926 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-18 22:03:17,926 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-18 22:03:17,930 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-18 22:03:17,930 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-11-18 22:03:17,932 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-18 22:03:17,932 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-18 22:03:17,932 INFO L133 SettingsManager]: * Use SBE=true [2018-11-18 22:03:17,932 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-18 22:03:17,933 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-18 22:03:17,933 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-18 22:03:17,933 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-18 22:03:17,933 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-18 22:03:17,933 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-18 22:03:17,933 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-18 22:03:17,934 INFO L133 SettingsManager]: * Use bitvectors instead of ints=true [2018-11-18 22:03:17,934 INFO L133 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2018-11-18 22:03:17,934 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-18 22:03:17,934 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-18 22:03:17,934 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-18 22:03:17,936 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-18 22:03:17,936 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-18 22:03:17,936 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-18 22:03:17,937 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-18 22:03:17,937 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-18 22:03:17,937 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-18 22:03:17,937 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-18 22:03:17,937 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-18 22:03:17,938 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-18 22:03:17,938 INFO L133 SettingsManager]: * Trace refinement strategy=WOLF [2018-11-18 22:03:17,938 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-18 22:03:17,938 INFO L133 SettingsManager]: * Command for external solver=cvc4nyu --tear-down-incremental --rewrite-divk --print-success --lang smt [2018-11-18 22:03:17,939 INFO L133 SettingsManager]: * Logic for external solver=AUFBV [2018-11-18 22:03:17,939 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-18 22:03:17,989 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-18 22:03:18,011 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-18 22:03:18,015 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-18 22:03:18,016 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-18 22:03:18,017 INFO L276 PluginConnector]: CDTParser initialized [2018-11-18 22:03:18,018 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/list-simple/dll2n_update_all_true-unreach-call_true-valid-memsafety.i [2018-11-18 22:03:18,089 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/73c271393/d731285ffc47494590ee3d08f6c6f735/FLAGf2ae5daa4 [2018-11-18 22:03:18,606 INFO L307 CDTParser]: Found 1 translation units. [2018-11-18 22:03:18,606 INFO L161 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/list-simple/dll2n_update_all_true-unreach-call_true-valid-memsafety.i [2018-11-18 22:03:18,620 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/73c271393/d731285ffc47494590ee3d08f6c6f735/FLAGf2ae5daa4 [2018-11-18 22:03:18,902 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/73c271393/d731285ffc47494590ee3d08f6c6f735 [2018-11-18 22:03:18,913 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-18 22:03:18,915 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-11-18 22:03:18,916 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-18 22:03:18,916 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-18 22:03:18,920 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-18 22:03:18,921 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 10:03:18" (1/1) ... [2018-11-18 22:03:18,924 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4096a9ee and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 10:03:18, skipping insertion in model container [2018-11-18 22:03:18,925 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 10:03:18" (1/1) ... [2018-11-18 22:03:18,936 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-18 22:03:18,999 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-18 22:03:19,501 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-18 22:03:19,519 INFO L191 MainTranslator]: Completed pre-run [2018-11-18 22:03:19,614 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-18 22:03:19,775 INFO L195 MainTranslator]: Completed translation [2018-11-18 22:03:19,775 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 10:03:19 WrapperNode [2018-11-18 22:03:19,776 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-18 22:03:19,776 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-18 22:03:19,776 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-18 22:03:19,777 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-18 22:03:19,789 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 10:03:19" (1/1) ... [2018-11-18 22:03:19,789 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 10:03:19" (1/1) ... [2018-11-18 22:03:19,807 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 10:03:19" (1/1) ... [2018-11-18 22:03:19,808 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 10:03:19" (1/1) ... [2018-11-18 22:03:19,839 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 10:03:19" (1/1) ... [2018-11-18 22:03:19,847 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 10:03:19" (1/1) ... [2018-11-18 22:03:19,851 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 10:03:19" (1/1) ... [2018-11-18 22:03:19,861 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-18 22:03:19,862 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-18 22:03:19,862 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-18 22:03:19,862 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-18 22:03:19,863 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 10:03:19" (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 [2018-11-18 22:03:19,936 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-18 22:03:19,937 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-18 22:03:19,937 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_32 [2018-11-18 22:03:19,937 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_64 [2018-11-18 22:03:19,938 INFO L138 BoogieDeclarations]: Found implementation of procedure exit [2018-11-18 22:03:19,938 INFO L138 BoogieDeclarations]: Found implementation of procedure node_create [2018-11-18 22:03:19,938 INFO L138 BoogieDeclarations]: Found implementation of procedure dll_create [2018-11-18 22:03:19,938 INFO L138 BoogieDeclarations]: Found implementation of procedure dll_destroy [2018-11-18 22:03:19,938 INFO L138 BoogieDeclarations]: Found implementation of procedure dll_get_data_at [2018-11-18 22:03:19,939 INFO L138 BoogieDeclarations]: Found implementation of procedure dll_update_at [2018-11-18 22:03:19,939 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-18 22:03:19,939 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2018-11-18 22:03:19,939 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_32 [2018-11-18 22:03:19,940 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_64 [2018-11-18 22:03:19,940 INFO L130 BoogieDeclarations]: Found specification of procedure __ctype_get_mb_cur_max [2018-11-18 22:03:19,940 INFO L130 BoogieDeclarations]: Found specification of procedure atof [2018-11-18 22:03:19,940 INFO L130 BoogieDeclarations]: Found specification of procedure atoi [2018-11-18 22:03:19,940 INFO L130 BoogieDeclarations]: Found specification of procedure atol [2018-11-18 22:03:19,941 INFO L130 BoogieDeclarations]: Found specification of procedure atoll [2018-11-18 22:03:19,941 INFO L130 BoogieDeclarations]: Found specification of procedure strtod [2018-11-18 22:03:19,941 INFO L130 BoogieDeclarations]: Found specification of procedure strtof [2018-11-18 22:03:19,941 INFO L130 BoogieDeclarations]: Found specification of procedure strtold [2018-11-18 22:03:19,941 INFO L130 BoogieDeclarations]: Found specification of procedure strtol [2018-11-18 22:03:19,941 INFO L130 BoogieDeclarations]: Found specification of procedure strtoul [2018-11-18 22:03:19,942 INFO L130 BoogieDeclarations]: Found specification of procedure strtoq [2018-11-18 22:03:19,942 INFO L130 BoogieDeclarations]: Found specification of procedure strtouq [2018-11-18 22:03:19,942 INFO L130 BoogieDeclarations]: Found specification of procedure strtoll [2018-11-18 22:03:19,942 INFO L130 BoogieDeclarations]: Found specification of procedure strtoull [2018-11-18 22:03:19,942 INFO L130 BoogieDeclarations]: Found specification of procedure l64a [2018-11-18 22:03:19,942 INFO L130 BoogieDeclarations]: Found specification of procedure a64l [2018-11-18 22:03:19,942 INFO L130 BoogieDeclarations]: Found specification of procedure select [2018-11-18 22:03:19,942 INFO L130 BoogieDeclarations]: Found specification of procedure pselect [2018-11-18 22:03:19,943 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_major [2018-11-18 22:03:19,943 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_minor [2018-11-18 22:03:19,943 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_makedev [2018-11-18 22:03:19,943 INFO L130 BoogieDeclarations]: Found specification of procedure random [2018-11-18 22:03:19,943 INFO L130 BoogieDeclarations]: Found specification of procedure srandom [2018-11-18 22:03:19,943 INFO L130 BoogieDeclarations]: Found specification of procedure initstate [2018-11-18 22:03:19,944 INFO L130 BoogieDeclarations]: Found specification of procedure setstate [2018-11-18 22:03:19,944 INFO L130 BoogieDeclarations]: Found specification of procedure random_r [2018-11-18 22:03:19,944 INFO L130 BoogieDeclarations]: Found specification of procedure srandom_r [2018-11-18 22:03:19,944 INFO L130 BoogieDeclarations]: Found specification of procedure initstate_r [2018-11-18 22:03:19,944 INFO L130 BoogieDeclarations]: Found specification of procedure setstate_r [2018-11-18 22:03:19,944 INFO L130 BoogieDeclarations]: Found specification of procedure rand [2018-11-18 22:03:19,945 INFO L130 BoogieDeclarations]: Found specification of procedure srand [2018-11-18 22:03:19,945 INFO L130 BoogieDeclarations]: Found specification of procedure rand_r [2018-11-18 22:03:19,945 INFO L130 BoogieDeclarations]: Found specification of procedure drand48 [2018-11-18 22:03:19,945 INFO L130 BoogieDeclarations]: Found specification of procedure erand48 [2018-11-18 22:03:19,945 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48 [2018-11-18 22:03:19,945 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48 [2018-11-18 22:03:19,946 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48 [2018-11-18 22:03:19,946 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48 [2018-11-18 22:03:19,946 INFO L130 BoogieDeclarations]: Found specification of procedure srand48 [2018-11-18 22:03:19,946 INFO L130 BoogieDeclarations]: Found specification of procedure seed48 [2018-11-18 22:03:19,946 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48 [2018-11-18 22:03:19,947 INFO L130 BoogieDeclarations]: Found specification of procedure drand48_r [2018-11-18 22:03:19,947 INFO L130 BoogieDeclarations]: Found specification of procedure erand48_r [2018-11-18 22:03:19,947 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48_r [2018-11-18 22:03:19,947 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48_r [2018-11-18 22:03:19,947 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48_r [2018-11-18 22:03:19,947 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48_r [2018-11-18 22:03:19,948 INFO L130 BoogieDeclarations]: Found specification of procedure srand48_r [2018-11-18 22:03:19,948 INFO L130 BoogieDeclarations]: Found specification of procedure seed48_r [2018-11-18 22:03:19,948 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48_r [2018-11-18 22:03:19,948 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2018-11-18 22:03:19,948 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2018-11-18 22:03:19,948 INFO L130 BoogieDeclarations]: Found specification of procedure realloc [2018-11-18 22:03:19,949 INFO L130 BoogieDeclarations]: Found specification of procedure free [2018-11-18 22:03:19,949 INFO L130 BoogieDeclarations]: Found specification of procedure cfree [2018-11-18 22:03:19,949 INFO L130 BoogieDeclarations]: Found specification of procedure alloca [2018-11-18 22:03:19,949 INFO L130 BoogieDeclarations]: Found specification of procedure valloc [2018-11-18 22:03:19,949 INFO L130 BoogieDeclarations]: Found specification of procedure posix_memalign [2018-11-18 22:03:19,950 INFO L130 BoogieDeclarations]: Found specification of procedure aligned_alloc [2018-11-18 22:03:19,950 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2018-11-18 22:03:19,950 INFO L130 BoogieDeclarations]: Found specification of procedure atexit [2018-11-18 22:03:19,950 INFO L130 BoogieDeclarations]: Found specification of procedure at_quick_exit [2018-11-18 22:03:19,951 INFO L130 BoogieDeclarations]: Found specification of procedure on_exit [2018-11-18 22:03:19,951 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2018-11-18 22:03:19,951 INFO L130 BoogieDeclarations]: Found specification of procedure quick_exit [2018-11-18 22:03:19,951 INFO L130 BoogieDeclarations]: Found specification of procedure _Exit [2018-11-18 22:03:19,951 INFO L130 BoogieDeclarations]: Found specification of procedure getenv [2018-11-18 22:03:19,952 INFO L130 BoogieDeclarations]: Found specification of procedure putenv [2018-11-18 22:03:19,952 INFO L130 BoogieDeclarations]: Found specification of procedure setenv [2018-11-18 22:03:19,952 INFO L130 BoogieDeclarations]: Found specification of procedure unsetenv [2018-11-18 22:03:19,952 INFO L130 BoogieDeclarations]: Found specification of procedure clearenv [2018-11-18 22:03:19,952 INFO L130 BoogieDeclarations]: Found specification of procedure mktemp [2018-11-18 22:03:19,952 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemp [2018-11-18 22:03:19,952 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemps [2018-11-18 22:03:19,953 INFO L130 BoogieDeclarations]: Found specification of procedure mkdtemp [2018-11-18 22:03:19,953 INFO L130 BoogieDeclarations]: Found specification of procedure system [2018-11-18 22:03:19,953 INFO L130 BoogieDeclarations]: Found specification of procedure realpath [2018-11-18 22:03:19,953 INFO L130 BoogieDeclarations]: Found specification of procedure bsearch [2018-11-18 22:03:19,953 INFO L130 BoogieDeclarations]: Found specification of procedure qsort [2018-11-18 22:03:19,953 INFO L130 BoogieDeclarations]: Found specification of procedure abs [2018-11-18 22:03:19,953 INFO L130 BoogieDeclarations]: Found specification of procedure labs [2018-11-18 22:03:19,954 INFO L130 BoogieDeclarations]: Found specification of procedure llabs [2018-11-18 22:03:19,954 INFO L130 BoogieDeclarations]: Found specification of procedure div [2018-11-18 22:03:19,954 INFO L130 BoogieDeclarations]: Found specification of procedure ldiv [2018-11-18 22:03:19,954 INFO L130 BoogieDeclarations]: Found specification of procedure lldiv [2018-11-18 22:03:19,954 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt [2018-11-18 22:03:19,954 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt [2018-11-18 22:03:19,954 INFO L130 BoogieDeclarations]: Found specification of procedure gcvt [2018-11-18 22:03:19,955 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt [2018-11-18 22:03:19,955 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt [2018-11-18 22:03:19,955 INFO L130 BoogieDeclarations]: Found specification of procedure qgcvt [2018-11-18 22:03:19,955 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt_r [2018-11-18 22:03:19,955 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt_r [2018-11-18 22:03:19,955 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt_r [2018-11-18 22:03:19,956 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt_r [2018-11-18 22:03:19,956 INFO L130 BoogieDeclarations]: Found specification of procedure mblen [2018-11-18 22:03:19,956 INFO L130 BoogieDeclarations]: Found specification of procedure mbtowc [2018-11-18 22:03:19,956 INFO L130 BoogieDeclarations]: Found specification of procedure wctomb [2018-11-18 22:03:19,956 INFO L130 BoogieDeclarations]: Found specification of procedure mbstowcs [2018-11-18 22:03:19,956 INFO L130 BoogieDeclarations]: Found specification of procedure wcstombs [2018-11-18 22:03:19,956 INFO L130 BoogieDeclarations]: Found specification of procedure rpmatch [2018-11-18 22:03:19,957 INFO L130 BoogieDeclarations]: Found specification of procedure getsubopt [2018-11-18 22:03:19,957 INFO L130 BoogieDeclarations]: Found specification of procedure getloadavg [2018-11-18 22:03:19,957 INFO L130 BoogieDeclarations]: Found specification of procedure node_create [2018-11-18 22:03:19,957 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-18 22:03:19,957 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-11-18 22:03:19,957 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2018-11-18 22:03:19,957 INFO L130 BoogieDeclarations]: Found specification of procedure dll_create [2018-11-18 22:03:19,958 INFO L130 BoogieDeclarations]: Found specification of procedure dll_destroy [2018-11-18 22:03:19,958 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-11-18 22:03:19,958 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-18 22:03:19,958 INFO L130 BoogieDeclarations]: Found specification of procedure dll_get_data_at [2018-11-18 22:03:19,958 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2018-11-18 22:03:19,958 INFO L130 BoogieDeclarations]: Found specification of procedure dll_update_at [2018-11-18 22:03:19,958 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-18 22:03:19,959 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-18 22:03:19,959 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-18 22:03:19,959 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE4 [2018-11-18 22:03:21,104 INFO L280 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-18 22:03:21,105 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 10:03:21 BoogieIcfgContainer [2018-11-18 22:03:21,105 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-18 22:03:21,106 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-18 22:03:21,106 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-18 22:03:21,109 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-18 22:03:21,110 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.11 10:03:18" (1/3) ... [2018-11-18 22:03:21,111 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@289534fc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.11 10:03:21, skipping insertion in model container [2018-11-18 22:03:21,111 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 10:03:19" (2/3) ... [2018-11-18 22:03:21,111 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@289534fc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.11 10:03:21, skipping insertion in model container [2018-11-18 22:03:21,111 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 10:03:21" (3/3) ... [2018-11-18 22:03:21,113 INFO L112 eAbstractionObserver]: Analyzing ICFG dll2n_update_all_true-unreach-call_true-valid-memsafety.i [2018-11-18 22:03:21,123 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-18 22:03:21,132 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-18 22:03:21,149 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-18 22:03:21,182 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-18 22:03:21,183 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-18 22:03:21,183 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-18 22:03:21,183 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-18 22:03:21,183 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-18 22:03:21,183 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-18 22:03:21,183 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-18 22:03:21,184 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-18 22:03:21,184 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-18 22:03:21,205 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states. [2018-11-18 22:03:21,214 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-11-18 22:03:21,214 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 22:03:21,215 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 22:03:21,218 INFO L423 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 22:03:21,228 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 22:03:21,228 INFO L82 PathProgramCache]: Analyzing trace with hash -151826432, now seen corresponding path program 1 times [2018-11-18 22:03:21,233 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-18 22:03:21,233 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 2 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-18 22:03:21,263 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 22:03:21,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 22:03:21,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 22:03:21,340 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 22:03:21,755 INFO L256 TraceCheckUtils]: 0: Hoare triple {59#true} call ULTIMATE.init(); {59#true} is VALID [2018-11-18 22:03:21,759 INFO L273 TraceCheckUtils]: 1: Hoare triple {59#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {59#true} is VALID [2018-11-18 22:03:21,760 INFO L273 TraceCheckUtils]: 2: Hoare triple {59#true} assume true; {59#true} is VALID [2018-11-18 22:03:21,760 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {59#true} {59#true} #158#return; {59#true} is VALID [2018-11-18 22:03:21,761 INFO L256 TraceCheckUtils]: 4: Hoare triple {59#true} call #t~ret15 := main(); {59#true} is VALID [2018-11-18 22:03:21,761 INFO L273 TraceCheckUtils]: 5: Hoare triple {59#true} ~len~0 := 2bv32;~data~0 := 1bv32; {59#true} is VALID [2018-11-18 22:03:21,761 INFO L256 TraceCheckUtils]: 6: Hoare triple {59#true} call #t~ret11.base, #t~ret11.offset := dll_create(~len~0, ~data~0); {59#true} is VALID [2018-11-18 22:03:21,763 INFO L273 TraceCheckUtils]: 7: Hoare triple {59#true} ~len := #in~len;~data := #in~data;~head~0.base, ~head~0.offset := 0bv32, 0bv32; {59#true} is VALID [2018-11-18 22:03:21,778 INFO L273 TraceCheckUtils]: 8: Hoare triple {59#true} assume !true; {60#false} is VALID [2018-11-18 22:03:21,779 INFO L273 TraceCheckUtils]: 9: Hoare triple {60#false} #res.base, #res.offset := ~head~0.base, ~head~0.offset; {60#false} is VALID [2018-11-18 22:03:21,779 INFO L273 TraceCheckUtils]: 10: Hoare triple {60#false} assume true; {60#false} is VALID [2018-11-18 22:03:21,779 INFO L268 TraceCheckUtils]: 11: Hoare quadruple {60#false} {59#true} #148#return; {60#false} is VALID [2018-11-18 22:03:21,782 INFO L273 TraceCheckUtils]: 12: Hoare triple {60#false} ~s~0.base, ~s~0.offset := #t~ret11.base, #t~ret11.offset;havoc #t~ret11.base, #t~ret11.offset;havoc ~i~0;~i~0 := 0bv32; {60#false} is VALID [2018-11-18 22:03:21,782 INFO L273 TraceCheckUtils]: 13: Hoare triple {60#false} assume !true; {60#false} is VALID [2018-11-18 22:03:21,783 INFO L273 TraceCheckUtils]: 14: Hoare triple {60#false} ~i~0 := 0bv32; {60#false} is VALID [2018-11-18 22:03:21,783 INFO L273 TraceCheckUtils]: 15: Hoare triple {60#false} assume true; {60#false} is VALID [2018-11-18 22:03:21,783 INFO L273 TraceCheckUtils]: 16: Hoare triple {60#false} assume !!~bvslt32(~i~0, ~len~0);~expected~0 := ~bvadd32(~i~0, ~len~0); {60#false} is VALID [2018-11-18 22:03:21,786 INFO L256 TraceCheckUtils]: 17: Hoare triple {60#false} call #t~ret14 := dll_get_data_at(~s~0.base, ~s~0.offset, ~i~0); {60#false} is VALID [2018-11-18 22:03:21,786 INFO L273 TraceCheckUtils]: 18: Hoare triple {60#false} ~head.base, ~head.offset := #in~head.base, #in~head.offset;~index := #in~index; {60#false} is VALID [2018-11-18 22:03:21,787 INFO L273 TraceCheckUtils]: 19: Hoare triple {60#false} assume !true; {60#false} is VALID [2018-11-18 22:03:21,787 INFO L273 TraceCheckUtils]: 20: Hoare triple {60#false} call #t~mem8 := read~intINTTYPE4(~head.base, ~head.offset, 4bv32);#res := #t~mem8;havoc #t~mem8; {60#false} is VALID [2018-11-18 22:03:21,787 INFO L273 TraceCheckUtils]: 21: Hoare triple {60#false} assume true; {60#false} is VALID [2018-11-18 22:03:21,788 INFO L268 TraceCheckUtils]: 22: Hoare quadruple {60#false} {60#false} #152#return; {60#false} is VALID [2018-11-18 22:03:21,788 INFO L273 TraceCheckUtils]: 23: Hoare triple {60#false} assume ~expected~0 != #t~ret14;havoc #t~ret14; {60#false} is VALID [2018-11-18 22:03:21,788 INFO L273 TraceCheckUtils]: 24: Hoare triple {60#false} assume !false; {60#false} is VALID [2018-11-18 22:03:21,796 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 22:03:21,796 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-18 22:03:21,808 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 22:03:21,808 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-18 22:03:21,816 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 25 [2018-11-18 22:03:21,823 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-18 22:03:21,828 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states. [2018-11-18 22:03:22,033 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 25 edges. 25 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 22:03:22,034 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-11-18 22:03:22,044 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-11-18 22:03:22,045 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-18 22:03:22,047 INFO L87 Difference]: Start difference. First operand 56 states. Second operand 2 states. [2018-11-18 22:03:22,388 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:03:22,388 INFO L93 Difference]: Finished difference Result 95 states and 121 transitions. [2018-11-18 22:03:22,389 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-11-18 22:03:22,389 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 25 [2018-11-18 22:03:22,389 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 22:03:22,391 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2018-11-18 22:03:22,404 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 121 transitions. [2018-11-18 22:03:22,404 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2018-11-18 22:03:22,411 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 121 transitions. [2018-11-18 22:03:22,412 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states and 121 transitions. [2018-11-18 22:03:22,759 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 121 edges. 121 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 22:03:22,773 INFO L225 Difference]: With dead ends: 95 [2018-11-18 22:03:22,774 INFO L226 Difference]: Without dead ends: 42 [2018-11-18 22:03:22,778 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-18 22:03:22,796 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2018-11-18 22:03:22,850 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 42. [2018-11-18 22:03:22,851 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-18 22:03:22,852 INFO L82 GeneralOperation]: Start isEquivalent. First operand 42 states. Second operand 42 states. [2018-11-18 22:03:22,852 INFO L74 IsIncluded]: Start isIncluded. First operand 42 states. Second operand 42 states. [2018-11-18 22:03:22,852 INFO L87 Difference]: Start difference. First operand 42 states. Second operand 42 states. [2018-11-18 22:03:22,858 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:03:22,858 INFO L93 Difference]: Finished difference Result 42 states and 47 transitions. [2018-11-18 22:03:22,859 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 47 transitions. [2018-11-18 22:03:22,859 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 22:03:22,860 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 22:03:22,860 INFO L74 IsIncluded]: Start isIncluded. First operand 42 states. Second operand 42 states. [2018-11-18 22:03:22,860 INFO L87 Difference]: Start difference. First operand 42 states. Second operand 42 states. [2018-11-18 22:03:22,864 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:03:22,865 INFO L93 Difference]: Finished difference Result 42 states and 47 transitions. [2018-11-18 22:03:22,865 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 47 transitions. [2018-11-18 22:03:22,866 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 22:03:22,866 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 22:03:22,866 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-18 22:03:22,867 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-18 22:03:22,867 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2018-11-18 22:03:22,870 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 47 transitions. [2018-11-18 22:03:22,872 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 47 transitions. Word has length 25 [2018-11-18 22:03:22,872 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 22:03:22,872 INFO L480 AbstractCegarLoop]: Abstraction has 42 states and 47 transitions. [2018-11-18 22:03:22,873 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-11-18 22:03:22,873 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 47 transitions. [2018-11-18 22:03:22,874 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-11-18 22:03:22,874 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 22:03:22,875 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 22:03:22,875 INFO L423 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 22:03:22,875 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 22:03:22,875 INFO L82 PathProgramCache]: Analyzing trace with hash -369111295, now seen corresponding path program 1 times [2018-11-18 22:03:22,876 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-18 22:03:22,876 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 3 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-18 22:03:22,902 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 22:03:22,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 22:03:22,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 22:03:22,984 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 22:03:23,223 INFO L256 TraceCheckUtils]: 0: Hoare triple {405#true} call ULTIMATE.init(); {405#true} is VALID [2018-11-18 22:03:23,223 INFO L273 TraceCheckUtils]: 1: Hoare triple {405#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {405#true} is VALID [2018-11-18 22:03:23,224 INFO L273 TraceCheckUtils]: 2: Hoare triple {405#true} assume true; {405#true} is VALID [2018-11-18 22:03:23,224 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {405#true} {405#true} #158#return; {405#true} is VALID [2018-11-18 22:03:23,224 INFO L256 TraceCheckUtils]: 4: Hoare triple {405#true} call #t~ret15 := main(); {405#true} is VALID [2018-11-18 22:03:23,229 INFO L273 TraceCheckUtils]: 5: Hoare triple {405#true} ~len~0 := 2bv32;~data~0 := 1bv32; {425#(= (bvadd main_~len~0 (_ bv4294967294 32)) (_ bv0 32))} is VALID [2018-11-18 22:03:23,229 INFO L256 TraceCheckUtils]: 6: Hoare triple {425#(= (bvadd main_~len~0 (_ bv4294967294 32)) (_ bv0 32))} call #t~ret11.base, #t~ret11.offset := dll_create(~len~0, ~data~0); {405#true} is VALID [2018-11-18 22:03:23,230 INFO L273 TraceCheckUtils]: 7: Hoare triple {405#true} ~len := #in~len;~data := #in~data;~head~0.base, ~head~0.offset := 0bv32, 0bv32; {432#(= dll_create_~len |dll_create_#in~len|)} is VALID [2018-11-18 22:03:23,231 INFO L273 TraceCheckUtils]: 8: Hoare triple {432#(= dll_create_~len |dll_create_#in~len|)} assume true; {432#(= dll_create_~len |dll_create_#in~len|)} is VALID [2018-11-18 22:03:23,232 INFO L273 TraceCheckUtils]: 9: Hoare triple {432#(= dll_create_~len |dll_create_#in~len|)} assume !~bvsgt32(~len, 0bv32); {439#(not (bvsgt |dll_create_#in~len| (_ bv0 32)))} is VALID [2018-11-18 22:03:23,232 INFO L273 TraceCheckUtils]: 10: Hoare triple {439#(not (bvsgt |dll_create_#in~len| (_ bv0 32)))} #res.base, #res.offset := ~head~0.base, ~head~0.offset; {439#(not (bvsgt |dll_create_#in~len| (_ bv0 32)))} is VALID [2018-11-18 22:03:23,234 INFO L273 TraceCheckUtils]: 11: Hoare triple {439#(not (bvsgt |dll_create_#in~len| (_ bv0 32)))} assume true; {439#(not (bvsgt |dll_create_#in~len| (_ bv0 32)))} is VALID [2018-11-18 22:03:23,241 INFO L268 TraceCheckUtils]: 12: Hoare quadruple {439#(not (bvsgt |dll_create_#in~len| (_ bv0 32)))} {425#(= (bvadd main_~len~0 (_ bv4294967294 32)) (_ bv0 32))} #148#return; {406#false} is VALID [2018-11-18 22:03:23,241 INFO L273 TraceCheckUtils]: 13: Hoare triple {406#false} ~s~0.base, ~s~0.offset := #t~ret11.base, #t~ret11.offset;havoc #t~ret11.base, #t~ret11.offset;havoc ~i~0;~i~0 := 0bv32; {406#false} is VALID [2018-11-18 22:03:23,242 INFO L273 TraceCheckUtils]: 14: Hoare triple {406#false} assume true; {406#false} is VALID [2018-11-18 22:03:23,242 INFO L273 TraceCheckUtils]: 15: Hoare triple {406#false} assume !~bvslt32(~i~0, ~len~0); {406#false} is VALID [2018-11-18 22:03:23,242 INFO L273 TraceCheckUtils]: 16: Hoare triple {406#false} ~i~0 := 0bv32; {406#false} is VALID [2018-11-18 22:03:23,243 INFO L273 TraceCheckUtils]: 17: Hoare triple {406#false} assume true; {406#false} is VALID [2018-11-18 22:03:23,243 INFO L273 TraceCheckUtils]: 18: Hoare triple {406#false} assume !!~bvslt32(~i~0, ~len~0);~expected~0 := ~bvadd32(~i~0, ~len~0); {406#false} is VALID [2018-11-18 22:03:23,243 INFO L256 TraceCheckUtils]: 19: Hoare triple {406#false} call #t~ret14 := dll_get_data_at(~s~0.base, ~s~0.offset, ~i~0); {406#false} is VALID [2018-11-18 22:03:23,244 INFO L273 TraceCheckUtils]: 20: Hoare triple {406#false} ~head.base, ~head.offset := #in~head.base, #in~head.offset;~index := #in~index; {406#false} is VALID [2018-11-18 22:03:23,244 INFO L273 TraceCheckUtils]: 21: Hoare triple {406#false} assume true; {406#false} is VALID [2018-11-18 22:03:23,244 INFO L273 TraceCheckUtils]: 22: Hoare triple {406#false} assume !~bvsgt32(~index, 0bv32); {406#false} is VALID [2018-11-18 22:03:23,245 INFO L273 TraceCheckUtils]: 23: Hoare triple {406#false} call #t~mem8 := read~intINTTYPE4(~head.base, ~head.offset, 4bv32);#res := #t~mem8;havoc #t~mem8; {406#false} is VALID [2018-11-18 22:03:23,245 INFO L273 TraceCheckUtils]: 24: Hoare triple {406#false} assume true; {406#false} is VALID [2018-11-18 22:03:23,245 INFO L268 TraceCheckUtils]: 25: Hoare quadruple {406#false} {406#false} #152#return; {406#false} is VALID [2018-11-18 22:03:23,246 INFO L273 TraceCheckUtils]: 26: Hoare triple {406#false} assume ~expected~0 != #t~ret14;havoc #t~ret14; {406#false} is VALID [2018-11-18 22:03:23,246 INFO L273 TraceCheckUtils]: 27: Hoare triple {406#false} assume !false; {406#false} is VALID [2018-11-18 22:03:23,248 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 22:03:23,249 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-18 22:03:23,252 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 22:03:23,252 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-18 22:03:23,254 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 28 [2018-11-18 22:03:23,255 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-18 22:03:23,255 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2018-11-18 22:03:23,313 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 28 edges. 28 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 22:03:23,314 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-18 22:03:23,314 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-18 22:03:23,314 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-18 22:03:23,314 INFO L87 Difference]: Start difference. First operand 42 states and 47 transitions. Second operand 5 states. [2018-11-18 22:03:23,848 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:03:23,848 INFO L93 Difference]: Finished difference Result 76 states and 86 transitions. [2018-11-18 22:03:23,848 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-18 22:03:23,848 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 28 [2018-11-18 22:03:23,849 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 22:03:23,849 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-18 22:03:23,854 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 86 transitions. [2018-11-18 22:03:23,854 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-18 22:03:23,858 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 86 transitions. [2018-11-18 22:03:23,858 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 86 transitions. [2018-11-18 22:03:24,059 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 86 edges. 86 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 22:03:24,063 INFO L225 Difference]: With dead ends: 76 [2018-11-18 22:03:24,063 INFO L226 Difference]: Without dead ends: 48 [2018-11-18 22:03:24,064 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-11-18 22:03:24,064 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2018-11-18 22:03:24,092 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 44. [2018-11-18 22:03:24,093 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-18 22:03:24,093 INFO L82 GeneralOperation]: Start isEquivalent. First operand 48 states. Second operand 44 states. [2018-11-18 22:03:24,093 INFO L74 IsIncluded]: Start isIncluded. First operand 48 states. Second operand 44 states. [2018-11-18 22:03:24,093 INFO L87 Difference]: Start difference. First operand 48 states. Second operand 44 states. [2018-11-18 22:03:24,098 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:03:24,098 INFO L93 Difference]: Finished difference Result 48 states and 54 transitions. [2018-11-18 22:03:24,098 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 54 transitions. [2018-11-18 22:03:24,099 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 22:03:24,099 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 22:03:24,099 INFO L74 IsIncluded]: Start isIncluded. First operand 44 states. Second operand 48 states. [2018-11-18 22:03:24,100 INFO L87 Difference]: Start difference. First operand 44 states. Second operand 48 states. [2018-11-18 22:03:24,103 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:03:24,103 INFO L93 Difference]: Finished difference Result 48 states and 54 transitions. [2018-11-18 22:03:24,103 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 54 transitions. [2018-11-18 22:03:24,104 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 22:03:24,104 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 22:03:24,104 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-18 22:03:24,105 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-18 22:03:24,105 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2018-11-18 22:03:24,107 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 49 transitions. [2018-11-18 22:03:24,108 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 49 transitions. Word has length 28 [2018-11-18 22:03:24,108 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 22:03:24,108 INFO L480 AbstractCegarLoop]: Abstraction has 44 states and 49 transitions. [2018-11-18 22:03:24,108 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-18 22:03:24,108 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 49 transitions. [2018-11-18 22:03:24,109 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-11-18 22:03:24,110 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 22:03:24,110 INFO L375 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 22:03:24,110 INFO L423 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 22:03:24,110 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 22:03:24,111 INFO L82 PathProgramCache]: Analyzing trace with hash 2013669645, now seen corresponding path program 1 times [2018-11-18 22:03:24,111 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-18 22:03:24,112 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 4 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-18 22:03:24,139 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 22:03:24,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 22:03:24,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 22:03:24,203 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 22:03:24,283 INFO L256 TraceCheckUtils]: 0: Hoare triple {754#true} call ULTIMATE.init(); {754#true} is VALID [2018-11-18 22:03:24,283 INFO L273 TraceCheckUtils]: 1: Hoare triple {754#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {754#true} is VALID [2018-11-18 22:03:24,284 INFO L273 TraceCheckUtils]: 2: Hoare triple {754#true} assume true; {754#true} is VALID [2018-11-18 22:03:24,284 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {754#true} {754#true} #158#return; {754#true} is VALID [2018-11-18 22:03:24,285 INFO L256 TraceCheckUtils]: 4: Hoare triple {754#true} call #t~ret15 := main(); {754#true} is VALID [2018-11-18 22:03:24,285 INFO L273 TraceCheckUtils]: 5: Hoare triple {754#true} ~len~0 := 2bv32;~data~0 := 1bv32; {754#true} is VALID [2018-11-18 22:03:24,285 INFO L256 TraceCheckUtils]: 6: Hoare triple {754#true} call #t~ret11.base, #t~ret11.offset := dll_create(~len~0, ~data~0); {754#true} is VALID [2018-11-18 22:03:24,290 INFO L273 TraceCheckUtils]: 7: Hoare triple {754#true} ~len := #in~len;~data := #in~data;~head~0.base, ~head~0.offset := 0bv32, 0bv32; {780#(and (= (_ bv0 32) dll_create_~head~0.base) (= (_ bv0 32) dll_create_~head~0.offset))} is VALID [2018-11-18 22:03:24,291 INFO L273 TraceCheckUtils]: 8: Hoare triple {780#(and (= (_ bv0 32) dll_create_~head~0.base) (= (_ bv0 32) dll_create_~head~0.offset))} assume true; {780#(and (= (_ bv0 32) dll_create_~head~0.base) (= (_ bv0 32) dll_create_~head~0.offset))} is VALID [2018-11-18 22:03:24,293 INFO L273 TraceCheckUtils]: 9: Hoare triple {780#(and (= (_ bv0 32) dll_create_~head~0.base) (= (_ bv0 32) dll_create_~head~0.offset))} assume !!~bvsgt32(~len, 0bv32);call #t~malloc3.base, #t~malloc3.offset := #Ultimate.alloc(12bv32);~new_head~0.base, ~new_head~0.offset := #t~malloc3.base, #t~malloc3.offset; {780#(and (= (_ bv0 32) dll_create_~head~0.base) (= (_ bv0 32) dll_create_~head~0.offset))} is VALID [2018-11-18 22:03:24,298 INFO L273 TraceCheckUtils]: 10: Hoare triple {780#(and (= (_ bv0 32) dll_create_~head~0.base) (= (_ bv0 32) dll_create_~head~0.offset))} assume !(0bv32 == ~new_head~0.base && 0bv32 == ~new_head~0.offset); {780#(and (= (_ bv0 32) dll_create_~head~0.base) (= (_ bv0 32) dll_create_~head~0.offset))} is VALID [2018-11-18 22:03:24,300 INFO L273 TraceCheckUtils]: 11: Hoare triple {780#(and (= (_ bv0 32) dll_create_~head~0.base) (= (_ bv0 32) dll_create_~head~0.offset))} call write~intINTTYPE4(~data, ~new_head~0.base, ~new_head~0.offset, 4bv32);call write~$Pointer$(~head~0.base, ~head~0.offset, ~new_head~0.base, ~bvadd32(4bv32, ~new_head~0.offset), 4bv32);call write~$Pointer$(0bv32, 0bv32, ~new_head~0.base, ~bvadd32(8bv32, ~new_head~0.offset), 4bv32); {780#(and (= (_ bv0 32) dll_create_~head~0.base) (= (_ bv0 32) dll_create_~head~0.offset))} is VALID [2018-11-18 22:03:24,300 INFO L273 TraceCheckUtils]: 12: Hoare triple {780#(and (= (_ bv0 32) dll_create_~head~0.base) (= (_ bv0 32) dll_create_~head~0.offset))} assume ~head~0.base != 0bv32 || ~head~0.offset != 0bv32;call write~$Pointer$(~new_head~0.base, ~new_head~0.offset, ~head~0.base, ~bvadd32(8bv32, ~head~0.offset), 4bv32); {755#false} is VALID [2018-11-18 22:03:24,301 INFO L273 TraceCheckUtils]: 13: Hoare triple {755#false} ~head~0.base, ~head~0.offset := ~new_head~0.base, ~new_head~0.offset;#t~post4 := ~len;~len := ~bvsub32(#t~post4, 1bv32);havoc #t~post4; {755#false} is VALID [2018-11-18 22:03:24,301 INFO L273 TraceCheckUtils]: 14: Hoare triple {755#false} assume true; {755#false} is VALID [2018-11-18 22:03:24,302 INFO L273 TraceCheckUtils]: 15: Hoare triple {755#false} assume !~bvsgt32(~len, 0bv32); {755#false} is VALID [2018-11-18 22:03:24,302 INFO L273 TraceCheckUtils]: 16: Hoare triple {755#false} #res.base, #res.offset := ~head~0.base, ~head~0.offset; {755#false} is VALID [2018-11-18 22:03:24,303 INFO L273 TraceCheckUtils]: 17: Hoare triple {755#false} assume true; {755#false} is VALID [2018-11-18 22:03:24,303 INFO L268 TraceCheckUtils]: 18: Hoare quadruple {755#false} {754#true} #148#return; {755#false} is VALID [2018-11-18 22:03:24,303 INFO L273 TraceCheckUtils]: 19: Hoare triple {755#false} ~s~0.base, ~s~0.offset := #t~ret11.base, #t~ret11.offset;havoc #t~ret11.base, #t~ret11.offset;havoc ~i~0;~i~0 := 0bv32; {755#false} is VALID [2018-11-18 22:03:24,304 INFO L273 TraceCheckUtils]: 20: Hoare triple {755#false} assume true; {755#false} is VALID [2018-11-18 22:03:24,304 INFO L273 TraceCheckUtils]: 21: Hoare triple {755#false} assume !~bvslt32(~i~0, ~len~0); {755#false} is VALID [2018-11-18 22:03:24,304 INFO L273 TraceCheckUtils]: 22: Hoare triple {755#false} ~i~0 := 0bv32; {755#false} is VALID [2018-11-18 22:03:24,304 INFO L273 TraceCheckUtils]: 23: Hoare triple {755#false} assume true; {755#false} is VALID [2018-11-18 22:03:24,305 INFO L273 TraceCheckUtils]: 24: Hoare triple {755#false} assume !!~bvslt32(~i~0, ~len~0);~expected~0 := ~bvadd32(~i~0, ~len~0); {755#false} is VALID [2018-11-18 22:03:24,305 INFO L256 TraceCheckUtils]: 25: Hoare triple {755#false} call #t~ret14 := dll_get_data_at(~s~0.base, ~s~0.offset, ~i~0); {755#false} is VALID [2018-11-18 22:03:24,305 INFO L273 TraceCheckUtils]: 26: Hoare triple {755#false} ~head.base, ~head.offset := #in~head.base, #in~head.offset;~index := #in~index; {755#false} is VALID [2018-11-18 22:03:24,306 INFO L273 TraceCheckUtils]: 27: Hoare triple {755#false} assume true; {755#false} is VALID [2018-11-18 22:03:24,306 INFO L273 TraceCheckUtils]: 28: Hoare triple {755#false} assume !~bvsgt32(~index, 0bv32); {755#false} is VALID [2018-11-18 22:03:24,306 INFO L273 TraceCheckUtils]: 29: Hoare triple {755#false} call #t~mem8 := read~intINTTYPE4(~head.base, ~head.offset, 4bv32);#res := #t~mem8;havoc #t~mem8; {755#false} is VALID [2018-11-18 22:03:24,307 INFO L273 TraceCheckUtils]: 30: Hoare triple {755#false} assume true; {755#false} is VALID [2018-11-18 22:03:24,307 INFO L268 TraceCheckUtils]: 31: Hoare quadruple {755#false} {755#false} #152#return; {755#false} is VALID [2018-11-18 22:03:24,307 INFO L273 TraceCheckUtils]: 32: Hoare triple {755#false} assume ~expected~0 != #t~ret14;havoc #t~ret14; {755#false} is VALID [2018-11-18 22:03:24,307 INFO L273 TraceCheckUtils]: 33: Hoare triple {755#false} assume !false; {755#false} is VALID [2018-11-18 22:03:24,310 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 22:03:24,310 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-18 22:03:24,312 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 22:03:24,312 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 22:03:24,313 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 34 [2018-11-18 22:03:24,313 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-18 22:03:24,313 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-11-18 22:03:24,366 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 34 edges. 34 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 22:03:24,366 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-18 22:03:24,366 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 22:03:24,366 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 22:03:24,367 INFO L87 Difference]: Start difference. First operand 44 states and 49 transitions. Second operand 3 states. [2018-11-18 22:03:24,604 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:03:24,604 INFO L93 Difference]: Finished difference Result 82 states and 93 transitions. [2018-11-18 22:03:24,604 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 22:03:24,604 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 34 [2018-11-18 22:03:24,605 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 22:03:24,605 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-18 22:03:24,608 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 93 transitions. [2018-11-18 22:03:24,609 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-18 22:03:24,612 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 93 transitions. [2018-11-18 22:03:24,612 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 93 transitions. [2018-11-18 22:03:24,757 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 93 edges. 93 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 22:03:24,760 INFO L225 Difference]: With dead ends: 82 [2018-11-18 22:03:24,760 INFO L226 Difference]: Without dead ends: 48 [2018-11-18 22:03:24,761 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 22:03:24,761 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2018-11-18 22:03:24,804 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 47. [2018-11-18 22:03:24,805 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-18 22:03:24,805 INFO L82 GeneralOperation]: Start isEquivalent. First operand 48 states. Second operand 47 states. [2018-11-18 22:03:24,805 INFO L74 IsIncluded]: Start isIncluded. First operand 48 states. Second operand 47 states. [2018-11-18 22:03:24,805 INFO L87 Difference]: Start difference. First operand 48 states. Second operand 47 states. [2018-11-18 22:03:24,808 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:03:24,808 INFO L93 Difference]: Finished difference Result 48 states and 53 transitions. [2018-11-18 22:03:24,808 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 53 transitions. [2018-11-18 22:03:24,809 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 22:03:24,809 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 22:03:24,810 INFO L74 IsIncluded]: Start isIncluded. First operand 47 states. Second operand 48 states. [2018-11-18 22:03:24,810 INFO L87 Difference]: Start difference. First operand 47 states. Second operand 48 states. [2018-11-18 22:03:24,812 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:03:24,813 INFO L93 Difference]: Finished difference Result 48 states and 53 transitions. [2018-11-18 22:03:24,813 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 53 transitions. [2018-11-18 22:03:24,814 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 22:03:24,814 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 22:03:24,814 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-18 22:03:24,814 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-18 22:03:24,814 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2018-11-18 22:03:24,817 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 52 transitions. [2018-11-18 22:03:24,817 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 52 transitions. Word has length 34 [2018-11-18 22:03:24,817 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 22:03:24,817 INFO L480 AbstractCegarLoop]: Abstraction has 47 states and 52 transitions. [2018-11-18 22:03:24,817 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-18 22:03:24,818 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 52 transitions. [2018-11-18 22:03:24,819 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-11-18 22:03:24,819 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 22:03:24,819 INFO L375 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 22:03:24,819 INFO L423 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 22:03:24,820 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 22:03:24,820 INFO L82 PathProgramCache]: Analyzing trace with hash -2062442933, now seen corresponding path program 1 times [2018-11-18 22:03:24,820 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-18 22:03:24,820 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 5 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-18 22:03:24,844 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 22:03:24,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 22:03:24,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 22:03:24,929 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 22:03:25,168 INFO L256 TraceCheckUtils]: 0: Hoare triple {1127#true} call ULTIMATE.init(); {1127#true} is VALID [2018-11-18 22:03:25,169 INFO L273 TraceCheckUtils]: 1: Hoare triple {1127#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {1127#true} is VALID [2018-11-18 22:03:25,169 INFO L273 TraceCheckUtils]: 2: Hoare triple {1127#true} assume true; {1127#true} is VALID [2018-11-18 22:03:25,169 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1127#true} {1127#true} #158#return; {1127#true} is VALID [2018-11-18 22:03:25,170 INFO L256 TraceCheckUtils]: 4: Hoare triple {1127#true} call #t~ret15 := main(); {1127#true} is VALID [2018-11-18 22:03:25,170 INFO L273 TraceCheckUtils]: 5: Hoare triple {1127#true} ~len~0 := 2bv32;~data~0 := 1bv32; {1147#(= (bvadd main_~len~0 (_ bv4294967294 32)) (_ bv0 32))} is VALID [2018-11-18 22:03:25,171 INFO L256 TraceCheckUtils]: 6: Hoare triple {1147#(= (bvadd main_~len~0 (_ bv4294967294 32)) (_ bv0 32))} call #t~ret11.base, #t~ret11.offset := dll_create(~len~0, ~data~0); {1127#true} is VALID [2018-11-18 22:03:25,171 INFO L273 TraceCheckUtils]: 7: Hoare triple {1127#true} ~len := #in~len;~data := #in~data;~head~0.base, ~head~0.offset := 0bv32, 0bv32; {1154#(= dll_create_~len |dll_create_#in~len|)} is VALID [2018-11-18 22:03:25,171 INFO L273 TraceCheckUtils]: 8: Hoare triple {1154#(= dll_create_~len |dll_create_#in~len|)} assume true; {1154#(= dll_create_~len |dll_create_#in~len|)} is VALID [2018-11-18 22:03:25,172 INFO L273 TraceCheckUtils]: 9: Hoare triple {1154#(= dll_create_~len |dll_create_#in~len|)} assume !!~bvsgt32(~len, 0bv32);call #t~malloc3.base, #t~malloc3.offset := #Ultimate.alloc(12bv32);~new_head~0.base, ~new_head~0.offset := #t~malloc3.base, #t~malloc3.offset; {1154#(= dll_create_~len |dll_create_#in~len|)} is VALID [2018-11-18 22:03:25,175 INFO L273 TraceCheckUtils]: 10: Hoare triple {1154#(= dll_create_~len |dll_create_#in~len|)} assume !(0bv32 == ~new_head~0.base && 0bv32 == ~new_head~0.offset); {1154#(= dll_create_~len |dll_create_#in~len|)} is VALID [2018-11-18 22:03:25,175 INFO L273 TraceCheckUtils]: 11: Hoare triple {1154#(= dll_create_~len |dll_create_#in~len|)} call write~intINTTYPE4(~data, ~new_head~0.base, ~new_head~0.offset, 4bv32);call write~$Pointer$(~head~0.base, ~head~0.offset, ~new_head~0.base, ~bvadd32(4bv32, ~new_head~0.offset), 4bv32);call write~$Pointer$(0bv32, 0bv32, ~new_head~0.base, ~bvadd32(8bv32, ~new_head~0.offset), 4bv32); {1154#(= dll_create_~len |dll_create_#in~len|)} is VALID [2018-11-18 22:03:25,177 INFO L273 TraceCheckUtils]: 12: Hoare triple {1154#(= dll_create_~len |dll_create_#in~len|)} assume !(~head~0.base != 0bv32 || ~head~0.offset != 0bv32); {1154#(= dll_create_~len |dll_create_#in~len|)} is VALID [2018-11-18 22:03:25,187 INFO L273 TraceCheckUtils]: 13: Hoare triple {1154#(= dll_create_~len |dll_create_#in~len|)} ~head~0.base, ~head~0.offset := ~new_head~0.base, ~new_head~0.offset;#t~post4 := ~len;~len := ~bvsub32(#t~post4, 1bv32);havoc #t~post4; {1173#(= (bvadd dll_create_~len (_ bv1 32)) |dll_create_#in~len|)} is VALID [2018-11-18 22:03:25,188 INFO L273 TraceCheckUtils]: 14: Hoare triple {1173#(= (bvadd dll_create_~len (_ bv1 32)) |dll_create_#in~len|)} assume true; {1173#(= (bvadd dll_create_~len (_ bv1 32)) |dll_create_#in~len|)} is VALID [2018-11-18 22:03:25,188 INFO L273 TraceCheckUtils]: 15: Hoare triple {1173#(= (bvadd dll_create_~len (_ bv1 32)) |dll_create_#in~len|)} assume !~bvsgt32(~len, 0bv32); {1180#(not (bvsgt (bvadd |dll_create_#in~len| (_ bv4294967295 32)) (_ bv0 32)))} is VALID [2018-11-18 22:03:25,189 INFO L273 TraceCheckUtils]: 16: Hoare triple {1180#(not (bvsgt (bvadd |dll_create_#in~len| (_ bv4294967295 32)) (_ bv0 32)))} #res.base, #res.offset := ~head~0.base, ~head~0.offset; {1180#(not (bvsgt (bvadd |dll_create_#in~len| (_ bv4294967295 32)) (_ bv0 32)))} is VALID [2018-11-18 22:03:25,194 INFO L273 TraceCheckUtils]: 17: Hoare triple {1180#(not (bvsgt (bvadd |dll_create_#in~len| (_ bv4294967295 32)) (_ bv0 32)))} assume true; {1180#(not (bvsgt (bvadd |dll_create_#in~len| (_ bv4294967295 32)) (_ bv0 32)))} is VALID [2018-11-18 22:03:25,203 INFO L268 TraceCheckUtils]: 18: Hoare quadruple {1180#(not (bvsgt (bvadd |dll_create_#in~len| (_ bv4294967295 32)) (_ bv0 32)))} {1147#(= (bvadd main_~len~0 (_ bv4294967294 32)) (_ bv0 32))} #148#return; {1128#false} is VALID [2018-11-18 22:03:25,204 INFO L273 TraceCheckUtils]: 19: Hoare triple {1128#false} ~s~0.base, ~s~0.offset := #t~ret11.base, #t~ret11.offset;havoc #t~ret11.base, #t~ret11.offset;havoc ~i~0;~i~0 := 0bv32; {1128#false} is VALID [2018-11-18 22:03:25,204 INFO L273 TraceCheckUtils]: 20: Hoare triple {1128#false} assume true; {1128#false} is VALID [2018-11-18 22:03:25,205 INFO L273 TraceCheckUtils]: 21: Hoare triple {1128#false} assume !~bvslt32(~i~0, ~len~0); {1128#false} is VALID [2018-11-18 22:03:25,205 INFO L273 TraceCheckUtils]: 22: Hoare triple {1128#false} ~i~0 := 0bv32; {1128#false} is VALID [2018-11-18 22:03:25,205 INFO L273 TraceCheckUtils]: 23: Hoare triple {1128#false} assume true; {1128#false} is VALID [2018-11-18 22:03:25,205 INFO L273 TraceCheckUtils]: 24: Hoare triple {1128#false} assume !!~bvslt32(~i~0, ~len~0);~expected~0 := ~bvadd32(~i~0, ~len~0); {1128#false} is VALID [2018-11-18 22:03:25,206 INFO L256 TraceCheckUtils]: 25: Hoare triple {1128#false} call #t~ret14 := dll_get_data_at(~s~0.base, ~s~0.offset, ~i~0); {1128#false} is VALID [2018-11-18 22:03:25,206 INFO L273 TraceCheckUtils]: 26: Hoare triple {1128#false} ~head.base, ~head.offset := #in~head.base, #in~head.offset;~index := #in~index; {1128#false} is VALID [2018-11-18 22:03:25,206 INFO L273 TraceCheckUtils]: 27: Hoare triple {1128#false} assume true; {1128#false} is VALID [2018-11-18 22:03:25,207 INFO L273 TraceCheckUtils]: 28: Hoare triple {1128#false} assume !~bvsgt32(~index, 0bv32); {1128#false} is VALID [2018-11-18 22:03:25,207 INFO L273 TraceCheckUtils]: 29: Hoare triple {1128#false} call #t~mem8 := read~intINTTYPE4(~head.base, ~head.offset, 4bv32);#res := #t~mem8;havoc #t~mem8; {1128#false} is VALID [2018-11-18 22:03:25,207 INFO L273 TraceCheckUtils]: 30: Hoare triple {1128#false} assume true; {1128#false} is VALID [2018-11-18 22:03:25,207 INFO L268 TraceCheckUtils]: 31: Hoare quadruple {1128#false} {1128#false} #152#return; {1128#false} is VALID [2018-11-18 22:03:25,208 INFO L273 TraceCheckUtils]: 32: Hoare triple {1128#false} assume ~expected~0 != #t~ret14;havoc #t~ret14; {1128#false} is VALID [2018-11-18 22:03:25,208 INFO L273 TraceCheckUtils]: 33: Hoare triple {1128#false} assume !false; {1128#false} is VALID [2018-11-18 22:03:25,211 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 22:03:25,211 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-18 22:03:25,675 INFO L273 TraceCheckUtils]: 33: Hoare triple {1128#false} assume !false; {1128#false} is VALID [2018-11-18 22:03:25,675 INFO L273 TraceCheckUtils]: 32: Hoare triple {1128#false} assume ~expected~0 != #t~ret14;havoc #t~ret14; {1128#false} is VALID [2018-11-18 22:03:25,676 INFO L268 TraceCheckUtils]: 31: Hoare quadruple {1127#true} {1128#false} #152#return; {1128#false} is VALID [2018-11-18 22:03:25,676 INFO L273 TraceCheckUtils]: 30: Hoare triple {1127#true} assume true; {1127#true} is VALID [2018-11-18 22:03:25,676 INFO L273 TraceCheckUtils]: 29: Hoare triple {1127#true} call #t~mem8 := read~intINTTYPE4(~head.base, ~head.offset, 4bv32);#res := #t~mem8;havoc #t~mem8; {1127#true} is VALID [2018-11-18 22:03:25,677 INFO L273 TraceCheckUtils]: 28: Hoare triple {1127#true} assume !~bvsgt32(~index, 0bv32); {1127#true} is VALID [2018-11-18 22:03:25,677 INFO L273 TraceCheckUtils]: 27: Hoare triple {1127#true} assume true; {1127#true} is VALID [2018-11-18 22:03:25,677 INFO L273 TraceCheckUtils]: 26: Hoare triple {1127#true} ~head.base, ~head.offset := #in~head.base, #in~head.offset;~index := #in~index; {1127#true} is VALID [2018-11-18 22:03:25,677 INFO L256 TraceCheckUtils]: 25: Hoare triple {1128#false} call #t~ret14 := dll_get_data_at(~s~0.base, ~s~0.offset, ~i~0); {1127#true} is VALID [2018-11-18 22:03:25,678 INFO L273 TraceCheckUtils]: 24: Hoare triple {1128#false} assume !!~bvslt32(~i~0, ~len~0);~expected~0 := ~bvadd32(~i~0, ~len~0); {1128#false} is VALID [2018-11-18 22:03:25,678 INFO L273 TraceCheckUtils]: 23: Hoare triple {1128#false} assume true; {1128#false} is VALID [2018-11-18 22:03:25,678 INFO L273 TraceCheckUtils]: 22: Hoare triple {1128#false} ~i~0 := 0bv32; {1128#false} is VALID [2018-11-18 22:03:25,679 INFO L273 TraceCheckUtils]: 21: Hoare triple {1128#false} assume !~bvslt32(~i~0, ~len~0); {1128#false} is VALID [2018-11-18 22:03:25,679 INFO L273 TraceCheckUtils]: 20: Hoare triple {1128#false} assume true; {1128#false} is VALID [2018-11-18 22:03:25,679 INFO L273 TraceCheckUtils]: 19: Hoare triple {1128#false} ~s~0.base, ~s~0.offset := #t~ret11.base, #t~ret11.offset;havoc #t~ret11.base, #t~ret11.offset;havoc ~i~0;~i~0 := 0bv32; {1128#false} is VALID [2018-11-18 22:03:25,697 INFO L268 TraceCheckUtils]: 18: Hoare quadruple {1180#(not (bvsgt (bvadd |dll_create_#in~len| (_ bv4294967295 32)) (_ bv0 32)))} {1280#(bvsgt (bvadd main_~len~0 (_ bv4294967295 32)) (_ bv0 32))} #148#return; {1128#false} is VALID [2018-11-18 22:03:25,708 INFO L273 TraceCheckUtils]: 17: Hoare triple {1180#(not (bvsgt (bvadd |dll_create_#in~len| (_ bv4294967295 32)) (_ bv0 32)))} assume true; {1180#(not (bvsgt (bvadd |dll_create_#in~len| (_ bv4294967295 32)) (_ bv0 32)))} is VALID [2018-11-18 22:03:25,723 INFO L273 TraceCheckUtils]: 16: Hoare triple {1180#(not (bvsgt (bvadd |dll_create_#in~len| (_ bv4294967295 32)) (_ bv0 32)))} #res.base, #res.offset := ~head~0.base, ~head~0.offset; {1180#(not (bvsgt (bvadd |dll_create_#in~len| (_ bv4294967295 32)) (_ bv0 32)))} is VALID [2018-11-18 22:03:25,729 INFO L273 TraceCheckUtils]: 15: Hoare triple {1293#(or (bvsgt dll_create_~len (_ bv0 32)) (not (bvsgt (bvadd |dll_create_#in~len| (_ bv4294967295 32)) (_ bv0 32))))} assume !~bvsgt32(~len, 0bv32); {1180#(not (bvsgt (bvadd |dll_create_#in~len| (_ bv4294967295 32)) (_ bv0 32)))} is VALID [2018-11-18 22:03:25,730 INFO L273 TraceCheckUtils]: 14: Hoare triple {1293#(or (bvsgt dll_create_~len (_ bv0 32)) (not (bvsgt (bvadd |dll_create_#in~len| (_ bv4294967295 32)) (_ bv0 32))))} assume true; {1293#(or (bvsgt dll_create_~len (_ bv0 32)) (not (bvsgt (bvadd |dll_create_#in~len| (_ bv4294967295 32)) (_ bv0 32))))} is VALID [2018-11-18 22:03:25,732 INFO L273 TraceCheckUtils]: 13: Hoare triple {1300#(or (bvsgt (bvadd dll_create_~len (_ bv4294967295 32)) (_ bv0 32)) (not (bvsgt (bvadd |dll_create_#in~len| (_ bv4294967295 32)) (_ bv0 32))))} ~head~0.base, ~head~0.offset := ~new_head~0.base, ~new_head~0.offset;#t~post4 := ~len;~len := ~bvsub32(#t~post4, 1bv32);havoc #t~post4; {1293#(or (bvsgt dll_create_~len (_ bv0 32)) (not (bvsgt (bvadd |dll_create_#in~len| (_ bv4294967295 32)) (_ bv0 32))))} is VALID [2018-11-18 22:03:25,732 INFO L273 TraceCheckUtils]: 12: Hoare triple {1300#(or (bvsgt (bvadd dll_create_~len (_ bv4294967295 32)) (_ bv0 32)) (not (bvsgt (bvadd |dll_create_#in~len| (_ bv4294967295 32)) (_ bv0 32))))} assume !(~head~0.base != 0bv32 || ~head~0.offset != 0bv32); {1300#(or (bvsgt (bvadd dll_create_~len (_ bv4294967295 32)) (_ bv0 32)) (not (bvsgt (bvadd |dll_create_#in~len| (_ bv4294967295 32)) (_ bv0 32))))} is VALID [2018-11-18 22:03:25,733 INFO L273 TraceCheckUtils]: 11: Hoare triple {1300#(or (bvsgt (bvadd dll_create_~len (_ bv4294967295 32)) (_ bv0 32)) (not (bvsgt (bvadd |dll_create_#in~len| (_ bv4294967295 32)) (_ bv0 32))))} call write~intINTTYPE4(~data, ~new_head~0.base, ~new_head~0.offset, 4bv32);call write~$Pointer$(~head~0.base, ~head~0.offset, ~new_head~0.base, ~bvadd32(4bv32, ~new_head~0.offset), 4bv32);call write~$Pointer$(0bv32, 0bv32, ~new_head~0.base, ~bvadd32(8bv32, ~new_head~0.offset), 4bv32); {1300#(or (bvsgt (bvadd dll_create_~len (_ bv4294967295 32)) (_ bv0 32)) (not (bvsgt (bvadd |dll_create_#in~len| (_ bv4294967295 32)) (_ bv0 32))))} is VALID [2018-11-18 22:03:25,733 INFO L273 TraceCheckUtils]: 10: Hoare triple {1300#(or (bvsgt (bvadd dll_create_~len (_ bv4294967295 32)) (_ bv0 32)) (not (bvsgt (bvadd |dll_create_#in~len| (_ bv4294967295 32)) (_ bv0 32))))} assume !(0bv32 == ~new_head~0.base && 0bv32 == ~new_head~0.offset); {1300#(or (bvsgt (bvadd dll_create_~len (_ bv4294967295 32)) (_ bv0 32)) (not (bvsgt (bvadd |dll_create_#in~len| (_ bv4294967295 32)) (_ bv0 32))))} is VALID [2018-11-18 22:03:25,734 INFO L273 TraceCheckUtils]: 9: Hoare triple {1300#(or (bvsgt (bvadd dll_create_~len (_ bv4294967295 32)) (_ bv0 32)) (not (bvsgt (bvadd |dll_create_#in~len| (_ bv4294967295 32)) (_ bv0 32))))} assume !!~bvsgt32(~len, 0bv32);call #t~malloc3.base, #t~malloc3.offset := #Ultimate.alloc(12bv32);~new_head~0.base, ~new_head~0.offset := #t~malloc3.base, #t~malloc3.offset; {1300#(or (bvsgt (bvadd dll_create_~len (_ bv4294967295 32)) (_ bv0 32)) (not (bvsgt (bvadd |dll_create_#in~len| (_ bv4294967295 32)) (_ bv0 32))))} is VALID [2018-11-18 22:03:25,734 INFO L273 TraceCheckUtils]: 8: Hoare triple {1300#(or (bvsgt (bvadd dll_create_~len (_ bv4294967295 32)) (_ bv0 32)) (not (bvsgt (bvadd |dll_create_#in~len| (_ bv4294967295 32)) (_ bv0 32))))} assume true; {1300#(or (bvsgt (bvadd dll_create_~len (_ bv4294967295 32)) (_ bv0 32)) (not (bvsgt (bvadd |dll_create_#in~len| (_ bv4294967295 32)) (_ bv0 32))))} is VALID [2018-11-18 22:03:25,736 INFO L273 TraceCheckUtils]: 7: Hoare triple {1127#true} ~len := #in~len;~data := #in~data;~head~0.base, ~head~0.offset := 0bv32, 0bv32; {1300#(or (bvsgt (bvadd dll_create_~len (_ bv4294967295 32)) (_ bv0 32)) (not (bvsgt (bvadd |dll_create_#in~len| (_ bv4294967295 32)) (_ bv0 32))))} is VALID [2018-11-18 22:03:25,736 INFO L256 TraceCheckUtils]: 6: Hoare triple {1280#(bvsgt (bvadd main_~len~0 (_ bv4294967295 32)) (_ bv0 32))} call #t~ret11.base, #t~ret11.offset := dll_create(~len~0, ~data~0); {1127#true} is VALID [2018-11-18 22:03:25,737 INFO L273 TraceCheckUtils]: 5: Hoare triple {1127#true} ~len~0 := 2bv32;~data~0 := 1bv32; {1280#(bvsgt (bvadd main_~len~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-18 22:03:25,737 INFO L256 TraceCheckUtils]: 4: Hoare triple {1127#true} call #t~ret15 := main(); {1127#true} is VALID [2018-11-18 22:03:25,737 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1127#true} {1127#true} #158#return; {1127#true} is VALID [2018-11-18 22:03:25,738 INFO L273 TraceCheckUtils]: 2: Hoare triple {1127#true} assume true; {1127#true} is VALID [2018-11-18 22:03:25,738 INFO L273 TraceCheckUtils]: 1: Hoare triple {1127#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {1127#true} is VALID [2018-11-18 22:03:25,738 INFO L256 TraceCheckUtils]: 0: Hoare triple {1127#true} call ULTIMATE.init(); {1127#true} is VALID [2018-11-18 22:03:25,742 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 22:03:25,745 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-18 22:03:25,745 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 9 [2018-11-18 22:03:25,745 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 34 [2018-11-18 22:03:25,746 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-18 22:03:25,746 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 9 states. [2018-11-18 22:03:25,876 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 53 edges. 53 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 22:03:25,877 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-11-18 22:03:25,877 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-18 22:03:25,877 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2018-11-18 22:03:25,877 INFO L87 Difference]: Start difference. First operand 47 states and 52 transitions. Second operand 9 states. [2018-11-18 22:03:26,923 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:03:26,923 INFO L93 Difference]: Finished difference Result 82 states and 92 transitions. [2018-11-18 22:03:26,923 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-18 22:03:26,924 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 34 [2018-11-18 22:03:26,924 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 22:03:26,924 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2018-11-18 22:03:26,928 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 92 transitions. [2018-11-18 22:03:26,928 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2018-11-18 22:03:26,931 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 92 transitions. [2018-11-18 22:03:26,931 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states and 92 transitions. [2018-11-18 22:03:27,141 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 92 edges. 92 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 22:03:27,144 INFO L225 Difference]: With dead ends: 82 [2018-11-18 22:03:27,145 INFO L226 Difference]: Without dead ends: 54 [2018-11-18 22:03:27,146 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 60 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2018-11-18 22:03:27,146 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2018-11-18 22:03:27,167 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 50. [2018-11-18 22:03:27,167 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-18 22:03:27,167 INFO L82 GeneralOperation]: Start isEquivalent. First operand 54 states. Second operand 50 states. [2018-11-18 22:03:27,167 INFO L74 IsIncluded]: Start isIncluded. First operand 54 states. Second operand 50 states. [2018-11-18 22:03:27,168 INFO L87 Difference]: Start difference. First operand 54 states. Second operand 50 states. [2018-11-18 22:03:27,171 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:03:27,171 INFO L93 Difference]: Finished difference Result 54 states and 60 transitions. [2018-11-18 22:03:27,171 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 60 transitions. [2018-11-18 22:03:27,172 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 22:03:27,172 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 22:03:27,172 INFO L74 IsIncluded]: Start isIncluded. First operand 50 states. Second operand 54 states. [2018-11-18 22:03:27,172 INFO L87 Difference]: Start difference. First operand 50 states. Second operand 54 states. [2018-11-18 22:03:27,175 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:03:27,175 INFO L93 Difference]: Finished difference Result 54 states and 60 transitions. [2018-11-18 22:03:27,176 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 60 transitions. [2018-11-18 22:03:27,176 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 22:03:27,177 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 22:03:27,177 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-18 22:03:27,177 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-18 22:03:27,177 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2018-11-18 22:03:27,179 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 55 transitions. [2018-11-18 22:03:27,180 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 55 transitions. Word has length 34 [2018-11-18 22:03:27,180 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 22:03:27,180 INFO L480 AbstractCegarLoop]: Abstraction has 50 states and 55 transitions. [2018-11-18 22:03:27,180 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-11-18 22:03:27,180 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 55 transitions. [2018-11-18 22:03:27,181 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2018-11-18 22:03:27,182 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 22:03:27,182 INFO L375 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 22:03:27,182 INFO L423 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 22:03:27,182 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 22:03:27,182 INFO L82 PathProgramCache]: Analyzing trace with hash 919460055, now seen corresponding path program 1 times [2018-11-18 22:03:27,183 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-18 22:03:27,183 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 6 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-18 22:03:27,208 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 22:03:27,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 22:03:27,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 22:03:27,292 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 22:03:27,368 INFO L256 TraceCheckUtils]: 0: Hoare triple {1628#true} call ULTIMATE.init(); {1628#true} is VALID [2018-11-18 22:03:27,369 INFO L273 TraceCheckUtils]: 1: Hoare triple {1628#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {1628#true} is VALID [2018-11-18 22:03:27,369 INFO L273 TraceCheckUtils]: 2: Hoare triple {1628#true} assume true; {1628#true} is VALID [2018-11-18 22:03:27,370 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1628#true} {1628#true} #158#return; {1628#true} is VALID [2018-11-18 22:03:27,370 INFO L256 TraceCheckUtils]: 4: Hoare triple {1628#true} call #t~ret15 := main(); {1628#true} is VALID [2018-11-18 22:03:27,371 INFO L273 TraceCheckUtils]: 5: Hoare triple {1628#true} ~len~0 := 2bv32;~data~0 := 1bv32; {1648#(= (bvadd main_~len~0 (_ bv4294967294 32)) (_ bv0 32))} is VALID [2018-11-18 22:03:27,371 INFO L256 TraceCheckUtils]: 6: Hoare triple {1648#(= (bvadd main_~len~0 (_ bv4294967294 32)) (_ bv0 32))} call #t~ret11.base, #t~ret11.offset := dll_create(~len~0, ~data~0); {1628#true} is VALID [2018-11-18 22:03:27,372 INFO L273 TraceCheckUtils]: 7: Hoare triple {1628#true} ~len := #in~len;~data := #in~data;~head~0.base, ~head~0.offset := 0bv32, 0bv32; {1628#true} is VALID [2018-11-18 22:03:27,372 INFO L273 TraceCheckUtils]: 8: Hoare triple {1628#true} assume true; {1628#true} is VALID [2018-11-18 22:03:27,372 INFO L273 TraceCheckUtils]: 9: Hoare triple {1628#true} assume !!~bvsgt32(~len, 0bv32);call #t~malloc3.base, #t~malloc3.offset := #Ultimate.alloc(12bv32);~new_head~0.base, ~new_head~0.offset := #t~malloc3.base, #t~malloc3.offset; {1628#true} is VALID [2018-11-18 22:03:27,372 INFO L273 TraceCheckUtils]: 10: Hoare triple {1628#true} assume !(0bv32 == ~new_head~0.base && 0bv32 == ~new_head~0.offset); {1628#true} is VALID [2018-11-18 22:03:27,373 INFO L273 TraceCheckUtils]: 11: Hoare triple {1628#true} call write~intINTTYPE4(~data, ~new_head~0.base, ~new_head~0.offset, 4bv32);call write~$Pointer$(~head~0.base, ~head~0.offset, ~new_head~0.base, ~bvadd32(4bv32, ~new_head~0.offset), 4bv32);call write~$Pointer$(0bv32, 0bv32, ~new_head~0.base, ~bvadd32(8bv32, ~new_head~0.offset), 4bv32); {1628#true} is VALID [2018-11-18 22:03:27,373 INFO L273 TraceCheckUtils]: 12: Hoare triple {1628#true} assume !(~head~0.base != 0bv32 || ~head~0.offset != 0bv32); {1628#true} is VALID [2018-11-18 22:03:27,373 INFO L273 TraceCheckUtils]: 13: Hoare triple {1628#true} ~head~0.base, ~head~0.offset := ~new_head~0.base, ~new_head~0.offset;#t~post4 := ~len;~len := ~bvsub32(#t~post4, 1bv32);havoc #t~post4; {1628#true} is VALID [2018-11-18 22:03:27,373 INFO L273 TraceCheckUtils]: 14: Hoare triple {1628#true} assume true; {1628#true} is VALID [2018-11-18 22:03:27,374 INFO L273 TraceCheckUtils]: 15: Hoare triple {1628#true} assume !!~bvsgt32(~len, 0bv32);call #t~malloc3.base, #t~malloc3.offset := #Ultimate.alloc(12bv32);~new_head~0.base, ~new_head~0.offset := #t~malloc3.base, #t~malloc3.offset; {1628#true} is VALID [2018-11-18 22:03:27,374 INFO L273 TraceCheckUtils]: 16: Hoare triple {1628#true} assume !(0bv32 == ~new_head~0.base && 0bv32 == ~new_head~0.offset); {1628#true} is VALID [2018-11-18 22:03:27,374 INFO L273 TraceCheckUtils]: 17: Hoare triple {1628#true} call write~intINTTYPE4(~data, ~new_head~0.base, ~new_head~0.offset, 4bv32);call write~$Pointer$(~head~0.base, ~head~0.offset, ~new_head~0.base, ~bvadd32(4bv32, ~new_head~0.offset), 4bv32);call write~$Pointer$(0bv32, 0bv32, ~new_head~0.base, ~bvadd32(8bv32, ~new_head~0.offset), 4bv32); {1628#true} is VALID [2018-11-18 22:03:27,374 INFO L273 TraceCheckUtils]: 18: Hoare triple {1628#true} assume ~head~0.base != 0bv32 || ~head~0.offset != 0bv32;call write~$Pointer$(~new_head~0.base, ~new_head~0.offset, ~head~0.base, ~bvadd32(8bv32, ~head~0.offset), 4bv32); {1628#true} is VALID [2018-11-18 22:03:27,375 INFO L273 TraceCheckUtils]: 19: Hoare triple {1628#true} ~head~0.base, ~head~0.offset := ~new_head~0.base, ~new_head~0.offset;#t~post4 := ~len;~len := ~bvsub32(#t~post4, 1bv32);havoc #t~post4; {1628#true} is VALID [2018-11-18 22:03:27,375 INFO L273 TraceCheckUtils]: 20: Hoare triple {1628#true} assume true; {1628#true} is VALID [2018-11-18 22:03:27,375 INFO L273 TraceCheckUtils]: 21: Hoare triple {1628#true} assume !~bvsgt32(~len, 0bv32); {1628#true} is VALID [2018-11-18 22:03:27,376 INFO L273 TraceCheckUtils]: 22: Hoare triple {1628#true} #res.base, #res.offset := ~head~0.base, ~head~0.offset; {1628#true} is VALID [2018-11-18 22:03:27,376 INFO L273 TraceCheckUtils]: 23: Hoare triple {1628#true} assume true; {1628#true} is VALID [2018-11-18 22:03:27,382 INFO L268 TraceCheckUtils]: 24: Hoare quadruple {1628#true} {1648#(= (bvadd main_~len~0 (_ bv4294967294 32)) (_ bv0 32))} #148#return; {1648#(= (bvadd main_~len~0 (_ bv4294967294 32)) (_ bv0 32))} is VALID [2018-11-18 22:03:27,384 INFO L273 TraceCheckUtils]: 25: Hoare triple {1648#(= (bvadd main_~len~0 (_ bv4294967294 32)) (_ bv0 32))} ~s~0.base, ~s~0.offset := #t~ret11.base, #t~ret11.offset;havoc #t~ret11.base, #t~ret11.offset;havoc ~i~0;~i~0 := 0bv32; {1709#(and (= main_~i~0 (_ bv0 32)) (= (bvadd main_~len~0 (_ bv4294967294 32)) (_ bv0 32)))} is VALID [2018-11-18 22:03:27,384 INFO L273 TraceCheckUtils]: 26: Hoare triple {1709#(and (= main_~i~0 (_ bv0 32)) (= (bvadd main_~len~0 (_ bv4294967294 32)) (_ bv0 32)))} assume true; {1709#(and (= main_~i~0 (_ bv0 32)) (= (bvadd main_~len~0 (_ bv4294967294 32)) (_ bv0 32)))} is VALID [2018-11-18 22:03:27,385 INFO L273 TraceCheckUtils]: 27: Hoare triple {1709#(and (= main_~i~0 (_ bv0 32)) (= (bvadd main_~len~0 (_ bv4294967294 32)) (_ bv0 32)))} assume !~bvslt32(~i~0, ~len~0); {1629#false} is VALID [2018-11-18 22:03:27,386 INFO L273 TraceCheckUtils]: 28: Hoare triple {1629#false} ~i~0 := 0bv32; {1629#false} is VALID [2018-11-18 22:03:27,386 INFO L273 TraceCheckUtils]: 29: Hoare triple {1629#false} assume true; {1629#false} is VALID [2018-11-18 22:03:27,386 INFO L273 TraceCheckUtils]: 30: Hoare triple {1629#false} assume !!~bvslt32(~i~0, ~len~0);~expected~0 := ~bvadd32(~i~0, ~len~0); {1629#false} is VALID [2018-11-18 22:03:27,387 INFO L256 TraceCheckUtils]: 31: Hoare triple {1629#false} call #t~ret14 := dll_get_data_at(~s~0.base, ~s~0.offset, ~i~0); {1629#false} is VALID [2018-11-18 22:03:27,387 INFO L273 TraceCheckUtils]: 32: Hoare triple {1629#false} ~head.base, ~head.offset := #in~head.base, #in~head.offset;~index := #in~index; {1629#false} is VALID [2018-11-18 22:03:27,388 INFO L273 TraceCheckUtils]: 33: Hoare triple {1629#false} assume true; {1629#false} is VALID [2018-11-18 22:03:27,388 INFO L273 TraceCheckUtils]: 34: Hoare triple {1629#false} assume !~bvsgt32(~index, 0bv32); {1629#false} is VALID [2018-11-18 22:03:27,388 INFO L273 TraceCheckUtils]: 35: Hoare triple {1629#false} call #t~mem8 := read~intINTTYPE4(~head.base, ~head.offset, 4bv32);#res := #t~mem8;havoc #t~mem8; {1629#false} is VALID [2018-11-18 22:03:27,389 INFO L273 TraceCheckUtils]: 36: Hoare triple {1629#false} assume true; {1629#false} is VALID [2018-11-18 22:03:27,389 INFO L268 TraceCheckUtils]: 37: Hoare quadruple {1629#false} {1629#false} #152#return; {1629#false} is VALID [2018-11-18 22:03:27,389 INFO L273 TraceCheckUtils]: 38: Hoare triple {1629#false} assume ~expected~0 != #t~ret14;havoc #t~ret14; {1629#false} is VALID [2018-11-18 22:03:27,389 INFO L273 TraceCheckUtils]: 39: Hoare triple {1629#false} assume !false; {1629#false} is VALID [2018-11-18 22:03:27,392 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2018-11-18 22:03:27,392 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-18 22:03:27,399 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 22:03:27,399 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-18 22:03:27,400 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 40 [2018-11-18 22:03:27,400 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-18 22:03:27,400 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states. [2018-11-18 22:03:27,469 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 34 edges. 34 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 22:03:27,469 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-18 22:03:27,470 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-18 22:03:27,470 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-18 22:03:27,470 INFO L87 Difference]: Start difference. First operand 50 states and 55 transitions. Second operand 4 states. [2018-11-18 22:03:27,751 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:03:27,751 INFO L93 Difference]: Finished difference Result 75 states and 84 transitions. [2018-11-18 22:03:27,751 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-18 22:03:27,751 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 40 [2018-11-18 22:03:27,752 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 22:03:27,752 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-18 22:03:27,755 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 76 transitions. [2018-11-18 22:03:27,755 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-18 22:03:27,757 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 76 transitions. [2018-11-18 22:03:27,758 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 76 transitions. [2018-11-18 22:03:27,940 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 76 edges. 76 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 22:03:27,942 INFO L225 Difference]: With dead ends: 75 [2018-11-18 22:03:27,942 INFO L226 Difference]: Without dead ends: 61 [2018-11-18 22:03:27,943 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-18 22:03:27,943 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2018-11-18 22:03:27,984 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 52. [2018-11-18 22:03:27,984 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-18 22:03:27,984 INFO L82 GeneralOperation]: Start isEquivalent. First operand 61 states. Second operand 52 states. [2018-11-18 22:03:27,985 INFO L74 IsIncluded]: Start isIncluded. First operand 61 states. Second operand 52 states. [2018-11-18 22:03:27,985 INFO L87 Difference]: Start difference. First operand 61 states. Second operand 52 states. [2018-11-18 22:03:27,990 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:03:27,990 INFO L93 Difference]: Finished difference Result 61 states and 68 transitions. [2018-11-18 22:03:27,990 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 68 transitions. [2018-11-18 22:03:27,991 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 22:03:27,991 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 22:03:27,991 INFO L74 IsIncluded]: Start isIncluded. First operand 52 states. Second operand 61 states. [2018-11-18 22:03:27,991 INFO L87 Difference]: Start difference. First operand 52 states. Second operand 61 states. [2018-11-18 22:03:27,994 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:03:27,995 INFO L93 Difference]: Finished difference Result 61 states and 68 transitions. [2018-11-18 22:03:27,995 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 68 transitions. [2018-11-18 22:03:27,995 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 22:03:27,995 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 22:03:27,995 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-18 22:03:27,996 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-18 22:03:27,996 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2018-11-18 22:03:27,998 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 57 transitions. [2018-11-18 22:03:27,998 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 57 transitions. Word has length 40 [2018-11-18 22:03:27,998 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 22:03:27,998 INFO L480 AbstractCegarLoop]: Abstraction has 52 states and 57 transitions. [2018-11-18 22:03:27,998 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-18 22:03:27,999 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 57 transitions. [2018-11-18 22:03:28,000 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2018-11-18 22:03:28,000 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 22:03:28,000 INFO L375 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 22:03:28,000 INFO L423 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 22:03:28,001 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 22:03:28,001 INFO L82 PathProgramCache]: Analyzing trace with hash -1792772172, now seen corresponding path program 1 times [2018-11-18 22:03:28,001 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-18 22:03:28,001 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 7 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-18 22:03:28,022 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 22:03:28,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 22:03:28,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 22:03:28,137 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 22:03:28,271 INFO L256 TraceCheckUtils]: 0: Hoare triple {2047#true} call ULTIMATE.init(); {2047#true} is VALID [2018-11-18 22:03:28,272 INFO L273 TraceCheckUtils]: 1: Hoare triple {2047#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {2047#true} is VALID [2018-11-18 22:03:28,272 INFO L273 TraceCheckUtils]: 2: Hoare triple {2047#true} assume true; {2047#true} is VALID [2018-11-18 22:03:28,272 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {2047#true} {2047#true} #158#return; {2047#true} is VALID [2018-11-18 22:03:28,273 INFO L256 TraceCheckUtils]: 4: Hoare triple {2047#true} call #t~ret15 := main(); {2047#true} is VALID [2018-11-18 22:03:28,273 INFO L273 TraceCheckUtils]: 5: Hoare triple {2047#true} ~len~0 := 2bv32;~data~0 := 1bv32; {2067#(= (bvadd main_~len~0 (_ bv4294967294 32)) (_ bv0 32))} is VALID [2018-11-18 22:03:28,273 INFO L256 TraceCheckUtils]: 6: Hoare triple {2067#(= (bvadd main_~len~0 (_ bv4294967294 32)) (_ bv0 32))} call #t~ret11.base, #t~ret11.offset := dll_create(~len~0, ~data~0); {2047#true} is VALID [2018-11-18 22:03:28,274 INFO L273 TraceCheckUtils]: 7: Hoare triple {2047#true} ~len := #in~len;~data := #in~data;~head~0.base, ~head~0.offset := 0bv32, 0bv32; {2047#true} is VALID [2018-11-18 22:03:28,274 INFO L273 TraceCheckUtils]: 8: Hoare triple {2047#true} assume true; {2047#true} is VALID [2018-11-18 22:03:28,274 INFO L273 TraceCheckUtils]: 9: Hoare triple {2047#true} assume !!~bvsgt32(~len, 0bv32);call #t~malloc3.base, #t~malloc3.offset := #Ultimate.alloc(12bv32);~new_head~0.base, ~new_head~0.offset := #t~malloc3.base, #t~malloc3.offset; {2047#true} is VALID [2018-11-18 22:03:28,274 INFO L273 TraceCheckUtils]: 10: Hoare triple {2047#true} assume !(0bv32 == ~new_head~0.base && 0bv32 == ~new_head~0.offset); {2047#true} is VALID [2018-11-18 22:03:28,275 INFO L273 TraceCheckUtils]: 11: Hoare triple {2047#true} call write~intINTTYPE4(~data, ~new_head~0.base, ~new_head~0.offset, 4bv32);call write~$Pointer$(~head~0.base, ~head~0.offset, ~new_head~0.base, ~bvadd32(4bv32, ~new_head~0.offset), 4bv32);call write~$Pointer$(0bv32, 0bv32, ~new_head~0.base, ~bvadd32(8bv32, ~new_head~0.offset), 4bv32); {2047#true} is VALID [2018-11-18 22:03:28,275 INFO L273 TraceCheckUtils]: 12: Hoare triple {2047#true} assume !(~head~0.base != 0bv32 || ~head~0.offset != 0bv32); {2047#true} is VALID [2018-11-18 22:03:28,275 INFO L273 TraceCheckUtils]: 13: Hoare triple {2047#true} ~head~0.base, ~head~0.offset := ~new_head~0.base, ~new_head~0.offset;#t~post4 := ~len;~len := ~bvsub32(#t~post4, 1bv32);havoc #t~post4; {2047#true} is VALID [2018-11-18 22:03:28,276 INFO L273 TraceCheckUtils]: 14: Hoare triple {2047#true} assume true; {2047#true} is VALID [2018-11-18 22:03:28,276 INFO L273 TraceCheckUtils]: 15: Hoare triple {2047#true} assume !!~bvsgt32(~len, 0bv32);call #t~malloc3.base, #t~malloc3.offset := #Ultimate.alloc(12bv32);~new_head~0.base, ~new_head~0.offset := #t~malloc3.base, #t~malloc3.offset; {2047#true} is VALID [2018-11-18 22:03:28,276 INFO L273 TraceCheckUtils]: 16: Hoare triple {2047#true} assume !(0bv32 == ~new_head~0.base && 0bv32 == ~new_head~0.offset); {2047#true} is VALID [2018-11-18 22:03:28,276 INFO L273 TraceCheckUtils]: 17: Hoare triple {2047#true} call write~intINTTYPE4(~data, ~new_head~0.base, ~new_head~0.offset, 4bv32);call write~$Pointer$(~head~0.base, ~head~0.offset, ~new_head~0.base, ~bvadd32(4bv32, ~new_head~0.offset), 4bv32);call write~$Pointer$(0bv32, 0bv32, ~new_head~0.base, ~bvadd32(8bv32, ~new_head~0.offset), 4bv32); {2047#true} is VALID [2018-11-18 22:03:28,277 INFO L273 TraceCheckUtils]: 18: Hoare triple {2047#true} assume ~head~0.base != 0bv32 || ~head~0.offset != 0bv32;call write~$Pointer$(~new_head~0.base, ~new_head~0.offset, ~head~0.base, ~bvadd32(8bv32, ~head~0.offset), 4bv32); {2047#true} is VALID [2018-11-18 22:03:28,277 INFO L273 TraceCheckUtils]: 19: Hoare triple {2047#true} ~head~0.base, ~head~0.offset := ~new_head~0.base, ~new_head~0.offset;#t~post4 := ~len;~len := ~bvsub32(#t~post4, 1bv32);havoc #t~post4; {2047#true} is VALID [2018-11-18 22:03:28,277 INFO L273 TraceCheckUtils]: 20: Hoare triple {2047#true} assume true; {2047#true} is VALID [2018-11-18 22:03:28,277 INFO L273 TraceCheckUtils]: 21: Hoare triple {2047#true} assume !~bvsgt32(~len, 0bv32); {2047#true} is VALID [2018-11-18 22:03:28,278 INFO L273 TraceCheckUtils]: 22: Hoare triple {2047#true} #res.base, #res.offset := ~head~0.base, ~head~0.offset; {2047#true} is VALID [2018-11-18 22:03:28,278 INFO L273 TraceCheckUtils]: 23: Hoare triple {2047#true} assume true; {2047#true} is VALID [2018-11-18 22:03:28,281 INFO L268 TraceCheckUtils]: 24: Hoare quadruple {2047#true} {2067#(= (bvadd main_~len~0 (_ bv4294967294 32)) (_ bv0 32))} #148#return; {2067#(= (bvadd main_~len~0 (_ bv4294967294 32)) (_ bv0 32))} is VALID [2018-11-18 22:03:28,282 INFO L273 TraceCheckUtils]: 25: Hoare triple {2067#(= (bvadd main_~len~0 (_ bv4294967294 32)) (_ bv0 32))} ~s~0.base, ~s~0.offset := #t~ret11.base, #t~ret11.offset;havoc #t~ret11.base, #t~ret11.offset;havoc ~i~0;~i~0 := 0bv32; {2128#(and (= main_~i~0 (_ bv0 32)) (= (bvadd main_~len~0 (_ bv4294967294 32)) (_ bv0 32)))} is VALID [2018-11-18 22:03:28,283 INFO L273 TraceCheckUtils]: 26: Hoare triple {2128#(and (= main_~i~0 (_ bv0 32)) (= (bvadd main_~len~0 (_ bv4294967294 32)) (_ bv0 32)))} assume true; {2128#(and (= main_~i~0 (_ bv0 32)) (= (bvadd main_~len~0 (_ bv4294967294 32)) (_ bv0 32)))} is VALID [2018-11-18 22:03:28,283 INFO L273 TraceCheckUtils]: 27: Hoare triple {2128#(and (= main_~i~0 (_ bv0 32)) (= (bvadd main_~len~0 (_ bv4294967294 32)) (_ bv0 32)))} assume !!~bvslt32(~i~0, ~len~0);~new_data~0 := ~bvadd32(~i~0, ~len~0); {2128#(and (= main_~i~0 (_ bv0 32)) (= (bvadd main_~len~0 (_ bv4294967294 32)) (_ bv0 32)))} is VALID [2018-11-18 22:03:28,284 INFO L256 TraceCheckUtils]: 28: Hoare triple {2128#(and (= main_~i~0 (_ bv0 32)) (= (bvadd main_~len~0 (_ bv4294967294 32)) (_ bv0 32)))} call dll_update_at(~s~0.base, ~s~0.offset, ~new_data~0, ~i~0); {2047#true} is VALID [2018-11-18 22:03:28,284 INFO L273 TraceCheckUtils]: 29: Hoare triple {2047#true} ~head.base, ~head.offset := #in~head.base, #in~head.offset;~data := #in~data;~index := #in~index; {2047#true} is VALID [2018-11-18 22:03:28,284 INFO L273 TraceCheckUtils]: 30: Hoare triple {2047#true} assume true; {2047#true} is VALID [2018-11-18 22:03:28,285 INFO L273 TraceCheckUtils]: 31: Hoare triple {2047#true} assume !~bvsgt32(~index, 0bv32); {2047#true} is VALID [2018-11-18 22:03:28,285 INFO L273 TraceCheckUtils]: 32: Hoare triple {2047#true} call write~intINTTYPE4(~data, ~head.base, ~head.offset, 4bv32); {2047#true} is VALID [2018-11-18 22:03:28,286 INFO L273 TraceCheckUtils]: 33: Hoare triple {2047#true} assume true; {2047#true} is VALID [2018-11-18 22:03:28,287 INFO L268 TraceCheckUtils]: 34: Hoare quadruple {2047#true} {2128#(and (= main_~i~0 (_ bv0 32)) (= (bvadd main_~len~0 (_ bv4294967294 32)) (_ bv0 32)))} #150#return; {2128#(and (= main_~i~0 (_ bv0 32)) (= (bvadd main_~len~0 (_ bv4294967294 32)) (_ bv0 32)))} is VALID [2018-11-18 22:03:28,289 INFO L273 TraceCheckUtils]: 35: Hoare triple {2128#(and (= main_~i~0 (_ bv0 32)) (= (bvadd main_~len~0 (_ bv4294967294 32)) (_ bv0 32)))} #t~post12 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post12);havoc #t~post12; {2159#(and (= (bvadd main_~len~0 (_ bv4294967294 32)) (_ bv0 32)) (= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32)))} is VALID [2018-11-18 22:03:28,291 INFO L273 TraceCheckUtils]: 36: Hoare triple {2159#(and (= (bvadd main_~len~0 (_ bv4294967294 32)) (_ bv0 32)) (= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32)))} assume true; {2159#(and (= (bvadd main_~len~0 (_ bv4294967294 32)) (_ bv0 32)) (= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32)))} is VALID [2018-11-18 22:03:28,292 INFO L273 TraceCheckUtils]: 37: Hoare triple {2159#(and (= (bvadd main_~len~0 (_ bv4294967294 32)) (_ bv0 32)) (= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32)))} assume !~bvslt32(~i~0, ~len~0); {2048#false} is VALID [2018-11-18 22:03:28,292 INFO L273 TraceCheckUtils]: 38: Hoare triple {2048#false} ~i~0 := 0bv32; {2048#false} is VALID [2018-11-18 22:03:28,292 INFO L273 TraceCheckUtils]: 39: Hoare triple {2048#false} assume true; {2048#false} is VALID [2018-11-18 22:03:28,293 INFO L273 TraceCheckUtils]: 40: Hoare triple {2048#false} assume !!~bvslt32(~i~0, ~len~0);~expected~0 := ~bvadd32(~i~0, ~len~0); {2048#false} is VALID [2018-11-18 22:03:28,293 INFO L256 TraceCheckUtils]: 41: Hoare triple {2048#false} call #t~ret14 := dll_get_data_at(~s~0.base, ~s~0.offset, ~i~0); {2048#false} is VALID [2018-11-18 22:03:28,293 INFO L273 TraceCheckUtils]: 42: Hoare triple {2048#false} ~head.base, ~head.offset := #in~head.base, #in~head.offset;~index := #in~index; {2048#false} is VALID [2018-11-18 22:03:28,293 INFO L273 TraceCheckUtils]: 43: Hoare triple {2048#false} assume true; {2048#false} is VALID [2018-11-18 22:03:28,293 INFO L273 TraceCheckUtils]: 44: Hoare triple {2048#false} assume !~bvsgt32(~index, 0bv32); {2048#false} is VALID [2018-11-18 22:03:28,294 INFO L273 TraceCheckUtils]: 45: Hoare triple {2048#false} call #t~mem8 := read~intINTTYPE4(~head.base, ~head.offset, 4bv32);#res := #t~mem8;havoc #t~mem8; {2048#false} is VALID [2018-11-18 22:03:28,294 INFO L273 TraceCheckUtils]: 46: Hoare triple {2048#false} assume true; {2048#false} is VALID [2018-11-18 22:03:28,294 INFO L268 TraceCheckUtils]: 47: Hoare quadruple {2048#false} {2048#false} #152#return; {2048#false} is VALID [2018-11-18 22:03:28,294 INFO L273 TraceCheckUtils]: 48: Hoare triple {2048#false} assume ~expected~0 != #t~ret14;havoc #t~ret14; {2048#false} is VALID [2018-11-18 22:03:28,294 INFO L273 TraceCheckUtils]: 49: Hoare triple {2048#false} assume !false; {2048#false} is VALID [2018-11-18 22:03:28,298 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2018-11-18 22:03:28,298 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-18 22:03:28,480 INFO L273 TraceCheckUtils]: 49: Hoare triple {2048#false} assume !false; {2048#false} is VALID [2018-11-18 22:03:28,480 INFO L273 TraceCheckUtils]: 48: Hoare triple {2048#false} assume ~expected~0 != #t~ret14;havoc #t~ret14; {2048#false} is VALID [2018-11-18 22:03:28,480 INFO L268 TraceCheckUtils]: 47: Hoare quadruple {2047#true} {2048#false} #152#return; {2048#false} is VALID [2018-11-18 22:03:28,481 INFO L273 TraceCheckUtils]: 46: Hoare triple {2047#true} assume true; {2047#true} is VALID [2018-11-18 22:03:28,481 INFO L273 TraceCheckUtils]: 45: Hoare triple {2047#true} call #t~mem8 := read~intINTTYPE4(~head.base, ~head.offset, 4bv32);#res := #t~mem8;havoc #t~mem8; {2047#true} is VALID [2018-11-18 22:03:28,481 INFO L273 TraceCheckUtils]: 44: Hoare triple {2047#true} assume !~bvsgt32(~index, 0bv32); {2047#true} is VALID [2018-11-18 22:03:28,481 INFO L273 TraceCheckUtils]: 43: Hoare triple {2047#true} assume true; {2047#true} is VALID [2018-11-18 22:03:28,482 INFO L273 TraceCheckUtils]: 42: Hoare triple {2047#true} ~head.base, ~head.offset := #in~head.base, #in~head.offset;~index := #in~index; {2047#true} is VALID [2018-11-18 22:03:28,482 INFO L256 TraceCheckUtils]: 41: Hoare triple {2048#false} call #t~ret14 := dll_get_data_at(~s~0.base, ~s~0.offset, ~i~0); {2047#true} is VALID [2018-11-18 22:03:28,482 INFO L273 TraceCheckUtils]: 40: Hoare triple {2048#false} assume !!~bvslt32(~i~0, ~len~0);~expected~0 := ~bvadd32(~i~0, ~len~0); {2048#false} is VALID [2018-11-18 22:03:28,482 INFO L273 TraceCheckUtils]: 39: Hoare triple {2048#false} assume true; {2048#false} is VALID [2018-11-18 22:03:28,482 INFO L273 TraceCheckUtils]: 38: Hoare triple {2048#false} ~i~0 := 0bv32; {2048#false} is VALID [2018-11-18 22:03:28,484 INFO L273 TraceCheckUtils]: 37: Hoare triple {2238#(bvslt main_~i~0 main_~len~0)} assume !~bvslt32(~i~0, ~len~0); {2048#false} is VALID [2018-11-18 22:03:28,484 INFO L273 TraceCheckUtils]: 36: Hoare triple {2238#(bvslt main_~i~0 main_~len~0)} assume true; {2238#(bvslt main_~i~0 main_~len~0)} is VALID [2018-11-18 22:03:28,485 INFO L273 TraceCheckUtils]: 35: Hoare triple {2245#(bvslt (bvadd main_~i~0 (_ bv1 32)) main_~len~0)} #t~post12 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post12);havoc #t~post12; {2238#(bvslt main_~i~0 main_~len~0)} is VALID [2018-11-18 22:03:28,487 INFO L268 TraceCheckUtils]: 34: Hoare quadruple {2047#true} {2245#(bvslt (bvadd main_~i~0 (_ bv1 32)) main_~len~0)} #150#return; {2245#(bvslt (bvadd main_~i~0 (_ bv1 32)) main_~len~0)} is VALID [2018-11-18 22:03:28,487 INFO L273 TraceCheckUtils]: 33: Hoare triple {2047#true} assume true; {2047#true} is VALID [2018-11-18 22:03:28,487 INFO L273 TraceCheckUtils]: 32: Hoare triple {2047#true} call write~intINTTYPE4(~data, ~head.base, ~head.offset, 4bv32); {2047#true} is VALID [2018-11-18 22:03:28,488 INFO L273 TraceCheckUtils]: 31: Hoare triple {2047#true} assume !~bvsgt32(~index, 0bv32); {2047#true} is VALID [2018-11-18 22:03:28,488 INFO L273 TraceCheckUtils]: 30: Hoare triple {2047#true} assume true; {2047#true} is VALID [2018-11-18 22:03:28,488 INFO L273 TraceCheckUtils]: 29: Hoare triple {2047#true} ~head.base, ~head.offset := #in~head.base, #in~head.offset;~data := #in~data;~index := #in~index; {2047#true} is VALID [2018-11-18 22:03:28,489 INFO L256 TraceCheckUtils]: 28: Hoare triple {2245#(bvslt (bvadd main_~i~0 (_ bv1 32)) main_~len~0)} call dll_update_at(~s~0.base, ~s~0.offset, ~new_data~0, ~i~0); {2047#true} is VALID [2018-11-18 22:03:28,494 INFO L273 TraceCheckUtils]: 27: Hoare triple {2245#(bvslt (bvadd main_~i~0 (_ bv1 32)) main_~len~0)} assume !!~bvslt32(~i~0, ~len~0);~new_data~0 := ~bvadd32(~i~0, ~len~0); {2245#(bvslt (bvadd main_~i~0 (_ bv1 32)) main_~len~0)} is VALID [2018-11-18 22:03:28,494 INFO L273 TraceCheckUtils]: 26: Hoare triple {2245#(bvslt (bvadd main_~i~0 (_ bv1 32)) main_~len~0)} assume true; {2245#(bvslt (bvadd main_~i~0 (_ bv1 32)) main_~len~0)} is VALID [2018-11-18 22:03:28,495 INFO L273 TraceCheckUtils]: 25: Hoare triple {2276#(bvslt (_ bv1 32) main_~len~0)} ~s~0.base, ~s~0.offset := #t~ret11.base, #t~ret11.offset;havoc #t~ret11.base, #t~ret11.offset;havoc ~i~0;~i~0 := 0bv32; {2245#(bvslt (bvadd main_~i~0 (_ bv1 32)) main_~len~0)} is VALID [2018-11-18 22:03:28,495 INFO L268 TraceCheckUtils]: 24: Hoare quadruple {2047#true} {2276#(bvslt (_ bv1 32) main_~len~0)} #148#return; {2276#(bvslt (_ bv1 32) main_~len~0)} is VALID [2018-11-18 22:03:28,496 INFO L273 TraceCheckUtils]: 23: Hoare triple {2047#true} assume true; {2047#true} is VALID [2018-11-18 22:03:28,496 INFO L273 TraceCheckUtils]: 22: Hoare triple {2047#true} #res.base, #res.offset := ~head~0.base, ~head~0.offset; {2047#true} is VALID [2018-11-18 22:03:28,496 INFO L273 TraceCheckUtils]: 21: Hoare triple {2047#true} assume !~bvsgt32(~len, 0bv32); {2047#true} is VALID [2018-11-18 22:03:28,496 INFO L273 TraceCheckUtils]: 20: Hoare triple {2047#true} assume true; {2047#true} is VALID [2018-11-18 22:03:28,496 INFO L273 TraceCheckUtils]: 19: Hoare triple {2047#true} ~head~0.base, ~head~0.offset := ~new_head~0.base, ~new_head~0.offset;#t~post4 := ~len;~len := ~bvsub32(#t~post4, 1bv32);havoc #t~post4; {2047#true} is VALID [2018-11-18 22:03:28,497 INFO L273 TraceCheckUtils]: 18: Hoare triple {2047#true} assume ~head~0.base != 0bv32 || ~head~0.offset != 0bv32;call write~$Pointer$(~new_head~0.base, ~new_head~0.offset, ~head~0.base, ~bvadd32(8bv32, ~head~0.offset), 4bv32); {2047#true} is VALID [2018-11-18 22:03:28,497 INFO L273 TraceCheckUtils]: 17: Hoare triple {2047#true} call write~intINTTYPE4(~data, ~new_head~0.base, ~new_head~0.offset, 4bv32);call write~$Pointer$(~head~0.base, ~head~0.offset, ~new_head~0.base, ~bvadd32(4bv32, ~new_head~0.offset), 4bv32);call write~$Pointer$(0bv32, 0bv32, ~new_head~0.base, ~bvadd32(8bv32, ~new_head~0.offset), 4bv32); {2047#true} is VALID [2018-11-18 22:03:28,497 INFO L273 TraceCheckUtils]: 16: Hoare triple {2047#true} assume !(0bv32 == ~new_head~0.base && 0bv32 == ~new_head~0.offset); {2047#true} is VALID [2018-11-18 22:03:28,497 INFO L273 TraceCheckUtils]: 15: Hoare triple {2047#true} assume !!~bvsgt32(~len, 0bv32);call #t~malloc3.base, #t~malloc3.offset := #Ultimate.alloc(12bv32);~new_head~0.base, ~new_head~0.offset := #t~malloc3.base, #t~malloc3.offset; {2047#true} is VALID [2018-11-18 22:03:28,497 INFO L273 TraceCheckUtils]: 14: Hoare triple {2047#true} assume true; {2047#true} is VALID [2018-11-18 22:03:28,498 INFO L273 TraceCheckUtils]: 13: Hoare triple {2047#true} ~head~0.base, ~head~0.offset := ~new_head~0.base, ~new_head~0.offset;#t~post4 := ~len;~len := ~bvsub32(#t~post4, 1bv32);havoc #t~post4; {2047#true} is VALID [2018-11-18 22:03:28,498 INFO L273 TraceCheckUtils]: 12: Hoare triple {2047#true} assume !(~head~0.base != 0bv32 || ~head~0.offset != 0bv32); {2047#true} is VALID [2018-11-18 22:03:28,498 INFO L273 TraceCheckUtils]: 11: Hoare triple {2047#true} call write~intINTTYPE4(~data, ~new_head~0.base, ~new_head~0.offset, 4bv32);call write~$Pointer$(~head~0.base, ~head~0.offset, ~new_head~0.base, ~bvadd32(4bv32, ~new_head~0.offset), 4bv32);call write~$Pointer$(0bv32, 0bv32, ~new_head~0.base, ~bvadd32(8bv32, ~new_head~0.offset), 4bv32); {2047#true} is VALID [2018-11-18 22:03:28,498 INFO L273 TraceCheckUtils]: 10: Hoare triple {2047#true} assume !(0bv32 == ~new_head~0.base && 0bv32 == ~new_head~0.offset); {2047#true} is VALID [2018-11-18 22:03:28,498 INFO L273 TraceCheckUtils]: 9: Hoare triple {2047#true} assume !!~bvsgt32(~len, 0bv32);call #t~malloc3.base, #t~malloc3.offset := #Ultimate.alloc(12bv32);~new_head~0.base, ~new_head~0.offset := #t~malloc3.base, #t~malloc3.offset; {2047#true} is VALID [2018-11-18 22:03:28,499 INFO L273 TraceCheckUtils]: 8: Hoare triple {2047#true} assume true; {2047#true} is VALID [2018-11-18 22:03:28,499 INFO L273 TraceCheckUtils]: 7: Hoare triple {2047#true} ~len := #in~len;~data := #in~data;~head~0.base, ~head~0.offset := 0bv32, 0bv32; {2047#true} is VALID [2018-11-18 22:03:28,499 INFO L256 TraceCheckUtils]: 6: Hoare triple {2276#(bvslt (_ bv1 32) main_~len~0)} call #t~ret11.base, #t~ret11.offset := dll_create(~len~0, ~data~0); {2047#true} is VALID [2018-11-18 22:03:28,499 INFO L273 TraceCheckUtils]: 5: Hoare triple {2047#true} ~len~0 := 2bv32;~data~0 := 1bv32; {2276#(bvslt (_ bv1 32) main_~len~0)} is VALID [2018-11-18 22:03:28,500 INFO L256 TraceCheckUtils]: 4: Hoare triple {2047#true} call #t~ret15 := main(); {2047#true} is VALID [2018-11-18 22:03:28,500 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {2047#true} {2047#true} #158#return; {2047#true} is VALID [2018-11-18 22:03:28,500 INFO L273 TraceCheckUtils]: 2: Hoare triple {2047#true} assume true; {2047#true} is VALID [2018-11-18 22:03:28,500 INFO L273 TraceCheckUtils]: 1: Hoare triple {2047#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {2047#true} is VALID [2018-11-18 22:03:28,500 INFO L256 TraceCheckUtils]: 0: Hoare triple {2047#true} call ULTIMATE.init(); {2047#true} is VALID [2018-11-18 22:03:28,502 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2018-11-18 22:03:28,505 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-18 22:03:28,506 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2018-11-18 22:03:28,506 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 50 [2018-11-18 22:03:28,507 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-18 22:03:28,507 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states. [2018-11-18 22:03:28,622 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 62 edges. 62 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 22:03:28,622 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-11-18 22:03:28,622 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-18 22:03:28,623 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2018-11-18 22:03:28,623 INFO L87 Difference]: Start difference. First operand 52 states and 57 transitions. Second operand 8 states. [2018-11-18 22:03:29,532 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:03:29,533 INFO L93 Difference]: Finished difference Result 86 states and 97 transitions. [2018-11-18 22:03:29,533 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-18 22:03:29,533 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 50 [2018-11-18 22:03:29,533 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 22:03:29,534 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2018-11-18 22:03:29,536 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 89 transitions. [2018-11-18 22:03:29,536 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2018-11-18 22:03:29,539 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 89 transitions. [2018-11-18 22:03:29,539 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 89 transitions. [2018-11-18 22:03:29,705 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 89 edges. 89 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 22:03:29,708 INFO L225 Difference]: With dead ends: 86 [2018-11-18 22:03:29,709 INFO L226 Difference]: Without dead ends: 72 [2018-11-18 22:03:29,709 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 100 GetRequests, 93 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2018-11-18 22:03:29,710 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2018-11-18 22:03:29,746 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 56. [2018-11-18 22:03:29,746 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-18 22:03:29,746 INFO L82 GeneralOperation]: Start isEquivalent. First operand 72 states. Second operand 56 states. [2018-11-18 22:03:29,747 INFO L74 IsIncluded]: Start isIncluded. First operand 72 states. Second operand 56 states. [2018-11-18 22:03:29,747 INFO L87 Difference]: Start difference. First operand 72 states. Second operand 56 states. [2018-11-18 22:03:29,751 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:03:29,751 INFO L93 Difference]: Finished difference Result 72 states and 81 transitions. [2018-11-18 22:03:29,751 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 81 transitions. [2018-11-18 22:03:29,751 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 22:03:29,752 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 22:03:29,752 INFO L74 IsIncluded]: Start isIncluded. First operand 56 states. Second operand 72 states. [2018-11-18 22:03:29,752 INFO L87 Difference]: Start difference. First operand 56 states. Second operand 72 states. [2018-11-18 22:03:29,755 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:03:29,755 INFO L93 Difference]: Finished difference Result 72 states and 81 transitions. [2018-11-18 22:03:29,755 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 81 transitions. [2018-11-18 22:03:29,756 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 22:03:29,756 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 22:03:29,756 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-18 22:03:29,757 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-18 22:03:29,757 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2018-11-18 22:03:29,759 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 62 transitions. [2018-11-18 22:03:29,759 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 62 transitions. Word has length 50 [2018-11-18 22:03:29,760 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 22:03:29,760 INFO L480 AbstractCegarLoop]: Abstraction has 56 states and 62 transitions. [2018-11-18 22:03:29,760 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-11-18 22:03:29,760 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 62 transitions. [2018-11-18 22:03:29,761 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2018-11-18 22:03:29,761 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 22:03:29,761 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 22:03:29,762 INFO L423 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 22:03:29,762 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 22:03:29,762 INFO L82 PathProgramCache]: Analyzing trace with hash 800843345, now seen corresponding path program 2 times [2018-11-18 22:03:29,762 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-18 22:03:29,763 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 8 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-18 22:03:29,790 INFO L101 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2018-11-18 22:03:29,914 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-18 22:03:29,915 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-18 22:03:29,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 22:03:29,976 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 22:03:30,411 INFO L256 TraceCheckUtils]: 0: Hoare triple {2696#true} call ULTIMATE.init(); {2696#true} is VALID [2018-11-18 22:03:30,411 INFO L273 TraceCheckUtils]: 1: Hoare triple {2696#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {2696#true} is VALID [2018-11-18 22:03:30,411 INFO L273 TraceCheckUtils]: 2: Hoare triple {2696#true} assume true; {2696#true} is VALID [2018-11-18 22:03:30,412 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {2696#true} {2696#true} #158#return; {2696#true} is VALID [2018-11-18 22:03:30,412 INFO L256 TraceCheckUtils]: 4: Hoare triple {2696#true} call #t~ret15 := main(); {2696#true} is VALID [2018-11-18 22:03:30,412 INFO L273 TraceCheckUtils]: 5: Hoare triple {2696#true} ~len~0 := 2bv32;~data~0 := 1bv32; {2696#true} is VALID [2018-11-18 22:03:30,412 INFO L256 TraceCheckUtils]: 6: Hoare triple {2696#true} call #t~ret11.base, #t~ret11.offset := dll_create(~len~0, ~data~0); {2696#true} is VALID [2018-11-18 22:03:30,412 INFO L273 TraceCheckUtils]: 7: Hoare triple {2696#true} ~len := #in~len;~data := #in~data;~head~0.base, ~head~0.offset := 0bv32, 0bv32; {2696#true} is VALID [2018-11-18 22:03:30,412 INFO L273 TraceCheckUtils]: 8: Hoare triple {2696#true} assume true; {2696#true} is VALID [2018-11-18 22:03:30,413 INFO L273 TraceCheckUtils]: 9: Hoare triple {2696#true} assume !!~bvsgt32(~len, 0bv32);call #t~malloc3.base, #t~malloc3.offset := #Ultimate.alloc(12bv32);~new_head~0.base, ~new_head~0.offset := #t~malloc3.base, #t~malloc3.offset; {2696#true} is VALID [2018-11-18 22:03:30,413 INFO L273 TraceCheckUtils]: 10: Hoare triple {2696#true} assume !(0bv32 == ~new_head~0.base && 0bv32 == ~new_head~0.offset); {2696#true} is VALID [2018-11-18 22:03:30,413 INFO L273 TraceCheckUtils]: 11: Hoare triple {2696#true} call write~intINTTYPE4(~data, ~new_head~0.base, ~new_head~0.offset, 4bv32);call write~$Pointer$(~head~0.base, ~head~0.offset, ~new_head~0.base, ~bvadd32(4bv32, ~new_head~0.offset), 4bv32);call write~$Pointer$(0bv32, 0bv32, ~new_head~0.base, ~bvadd32(8bv32, ~new_head~0.offset), 4bv32); {2696#true} is VALID [2018-11-18 22:03:30,413 INFO L273 TraceCheckUtils]: 12: Hoare triple {2696#true} assume !(~head~0.base != 0bv32 || ~head~0.offset != 0bv32); {2696#true} is VALID [2018-11-18 22:03:30,413 INFO L273 TraceCheckUtils]: 13: Hoare triple {2696#true} ~head~0.base, ~head~0.offset := ~new_head~0.base, ~new_head~0.offset;#t~post4 := ~len;~len := ~bvsub32(#t~post4, 1bv32);havoc #t~post4; {2696#true} is VALID [2018-11-18 22:03:30,414 INFO L273 TraceCheckUtils]: 14: Hoare triple {2696#true} assume true; {2696#true} is VALID [2018-11-18 22:03:30,414 INFO L273 TraceCheckUtils]: 15: Hoare triple {2696#true} assume !!~bvsgt32(~len, 0bv32);call #t~malloc3.base, #t~malloc3.offset := #Ultimate.alloc(12bv32);~new_head~0.base, ~new_head~0.offset := #t~malloc3.base, #t~malloc3.offset; {2696#true} is VALID [2018-11-18 22:03:30,414 INFO L273 TraceCheckUtils]: 16: Hoare triple {2696#true} assume !(0bv32 == ~new_head~0.base && 0bv32 == ~new_head~0.offset); {2696#true} is VALID [2018-11-18 22:03:30,414 INFO L273 TraceCheckUtils]: 17: Hoare triple {2696#true} call write~intINTTYPE4(~data, ~new_head~0.base, ~new_head~0.offset, 4bv32);call write~$Pointer$(~head~0.base, ~head~0.offset, ~new_head~0.base, ~bvadd32(4bv32, ~new_head~0.offset), 4bv32);call write~$Pointer$(0bv32, 0bv32, ~new_head~0.base, ~bvadd32(8bv32, ~new_head~0.offset), 4bv32); {2696#true} is VALID [2018-11-18 22:03:30,415 INFO L273 TraceCheckUtils]: 18: Hoare triple {2696#true} assume ~head~0.base != 0bv32 || ~head~0.offset != 0bv32;call write~$Pointer$(~new_head~0.base, ~new_head~0.offset, ~head~0.base, ~bvadd32(8bv32, ~head~0.offset), 4bv32); {2696#true} is VALID [2018-11-18 22:03:30,415 INFO L273 TraceCheckUtils]: 19: Hoare triple {2696#true} ~head~0.base, ~head~0.offset := ~new_head~0.base, ~new_head~0.offset;#t~post4 := ~len;~len := ~bvsub32(#t~post4, 1bv32);havoc #t~post4; {2696#true} is VALID [2018-11-18 22:03:30,415 INFO L273 TraceCheckUtils]: 20: Hoare triple {2696#true} assume true; {2696#true} is VALID [2018-11-18 22:03:30,415 INFO L273 TraceCheckUtils]: 21: Hoare triple {2696#true} assume !~bvsgt32(~len, 0bv32); {2696#true} is VALID [2018-11-18 22:03:30,416 INFO L273 TraceCheckUtils]: 22: Hoare triple {2696#true} #res.base, #res.offset := ~head~0.base, ~head~0.offset; {2696#true} is VALID [2018-11-18 22:03:30,416 INFO L273 TraceCheckUtils]: 23: Hoare triple {2696#true} assume true; {2696#true} is VALID [2018-11-18 22:03:30,416 INFO L268 TraceCheckUtils]: 24: Hoare quadruple {2696#true} {2696#true} #148#return; {2696#true} is VALID [2018-11-18 22:03:30,417 INFO L273 TraceCheckUtils]: 25: Hoare triple {2696#true} ~s~0.base, ~s~0.offset := #t~ret11.base, #t~ret11.offset;havoc #t~ret11.base, #t~ret11.offset;havoc ~i~0;~i~0 := 0bv32; {2776#(= main_~i~0 (_ bv0 32))} is VALID [2018-11-18 22:03:30,418 INFO L273 TraceCheckUtils]: 26: Hoare triple {2776#(= main_~i~0 (_ bv0 32))} assume true; {2776#(= main_~i~0 (_ bv0 32))} is VALID [2018-11-18 22:03:30,420 INFO L273 TraceCheckUtils]: 27: Hoare triple {2776#(= main_~i~0 (_ bv0 32))} assume !!~bvslt32(~i~0, ~len~0);~new_data~0 := ~bvadd32(~i~0, ~len~0); {2776#(= main_~i~0 (_ bv0 32))} is VALID [2018-11-18 22:03:30,420 INFO L256 TraceCheckUtils]: 28: Hoare triple {2776#(= main_~i~0 (_ bv0 32))} call dll_update_at(~s~0.base, ~s~0.offset, ~new_data~0, ~i~0); {2696#true} is VALID [2018-11-18 22:03:30,420 INFO L273 TraceCheckUtils]: 29: Hoare triple {2696#true} ~head.base, ~head.offset := #in~head.base, #in~head.offset;~data := #in~data;~index := #in~index; {2696#true} is VALID [2018-11-18 22:03:30,420 INFO L273 TraceCheckUtils]: 30: Hoare triple {2696#true} assume true; {2696#true} is VALID [2018-11-18 22:03:30,420 INFO L273 TraceCheckUtils]: 31: Hoare triple {2696#true} assume !~bvsgt32(~index, 0bv32); {2696#true} is VALID [2018-11-18 22:03:30,420 INFO L273 TraceCheckUtils]: 32: Hoare triple {2696#true} call write~intINTTYPE4(~data, ~head.base, ~head.offset, 4bv32); {2696#true} is VALID [2018-11-18 22:03:30,421 INFO L273 TraceCheckUtils]: 33: Hoare triple {2696#true} assume true; {2696#true} is VALID [2018-11-18 22:03:30,422 INFO L268 TraceCheckUtils]: 34: Hoare quadruple {2696#true} {2776#(= main_~i~0 (_ bv0 32))} #150#return; {2776#(= main_~i~0 (_ bv0 32))} is VALID [2018-11-18 22:03:30,423 INFO L273 TraceCheckUtils]: 35: Hoare triple {2776#(= main_~i~0 (_ bv0 32))} #t~post12 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post12);havoc #t~post12; {2807#(= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-18 22:03:30,423 INFO L273 TraceCheckUtils]: 36: Hoare triple {2807#(= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32))} assume true; {2807#(= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-18 22:03:30,425 INFO L273 TraceCheckUtils]: 37: Hoare triple {2807#(= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32))} assume !!~bvslt32(~i~0, ~len~0);~new_data~0 := ~bvadd32(~i~0, ~len~0); {2807#(= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-18 22:03:30,425 INFO L256 TraceCheckUtils]: 38: Hoare triple {2807#(= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32))} call dll_update_at(~s~0.base, ~s~0.offset, ~new_data~0, ~i~0); {2696#true} is VALID [2018-11-18 22:03:30,427 INFO L273 TraceCheckUtils]: 39: Hoare triple {2696#true} ~head.base, ~head.offset := #in~head.base, #in~head.offset;~data := #in~data;~index := #in~index; {2820#(= dll_update_at_~index |dll_update_at_#in~index|)} is VALID [2018-11-18 22:03:30,427 INFO L273 TraceCheckUtils]: 40: Hoare triple {2820#(= dll_update_at_~index |dll_update_at_#in~index|)} assume true; {2820#(= dll_update_at_~index |dll_update_at_#in~index|)} is VALID [2018-11-18 22:03:30,429 INFO L273 TraceCheckUtils]: 41: Hoare triple {2820#(= dll_update_at_~index |dll_update_at_#in~index|)} assume !~bvsgt32(~index, 0bv32); {2827#(not (bvsgt |dll_update_at_#in~index| (_ bv0 32)))} is VALID [2018-11-18 22:03:30,429 INFO L273 TraceCheckUtils]: 42: Hoare triple {2827#(not (bvsgt |dll_update_at_#in~index| (_ bv0 32)))} call write~intINTTYPE4(~data, ~head.base, ~head.offset, 4bv32); {2827#(not (bvsgt |dll_update_at_#in~index| (_ bv0 32)))} is VALID [2018-11-18 22:03:30,431 INFO L273 TraceCheckUtils]: 43: Hoare triple {2827#(not (bvsgt |dll_update_at_#in~index| (_ bv0 32)))} assume true; {2827#(not (bvsgt |dll_update_at_#in~index| (_ bv0 32)))} is VALID [2018-11-18 22:03:30,432 INFO L268 TraceCheckUtils]: 44: Hoare quadruple {2827#(not (bvsgt |dll_update_at_#in~index| (_ bv0 32)))} {2807#(= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32))} #150#return; {2697#false} is VALID [2018-11-18 22:03:30,432 INFO L273 TraceCheckUtils]: 45: Hoare triple {2697#false} #t~post12 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post12);havoc #t~post12; {2697#false} is VALID [2018-11-18 22:03:30,432 INFO L273 TraceCheckUtils]: 46: Hoare triple {2697#false} assume true; {2697#false} is VALID [2018-11-18 22:03:30,433 INFO L273 TraceCheckUtils]: 47: Hoare triple {2697#false} assume !~bvslt32(~i~0, ~len~0); {2697#false} is VALID [2018-11-18 22:03:30,433 INFO L273 TraceCheckUtils]: 48: Hoare triple {2697#false} ~i~0 := 0bv32; {2697#false} is VALID [2018-11-18 22:03:30,433 INFO L273 TraceCheckUtils]: 49: Hoare triple {2697#false} assume true; {2697#false} is VALID [2018-11-18 22:03:30,433 INFO L273 TraceCheckUtils]: 50: Hoare triple {2697#false} assume !!~bvslt32(~i~0, ~len~0);~expected~0 := ~bvadd32(~i~0, ~len~0); {2697#false} is VALID [2018-11-18 22:03:30,433 INFO L256 TraceCheckUtils]: 51: Hoare triple {2697#false} call #t~ret14 := dll_get_data_at(~s~0.base, ~s~0.offset, ~i~0); {2697#false} is VALID [2018-11-18 22:03:30,433 INFO L273 TraceCheckUtils]: 52: Hoare triple {2697#false} ~head.base, ~head.offset := #in~head.base, #in~head.offset;~index := #in~index; {2697#false} is VALID [2018-11-18 22:03:30,433 INFO L273 TraceCheckUtils]: 53: Hoare triple {2697#false} assume true; {2697#false} is VALID [2018-11-18 22:03:30,434 INFO L273 TraceCheckUtils]: 54: Hoare triple {2697#false} assume !~bvsgt32(~index, 0bv32); {2697#false} is VALID [2018-11-18 22:03:30,434 INFO L273 TraceCheckUtils]: 55: Hoare triple {2697#false} call #t~mem8 := read~intINTTYPE4(~head.base, ~head.offset, 4bv32);#res := #t~mem8;havoc #t~mem8; {2697#false} is VALID [2018-11-18 22:03:30,434 INFO L273 TraceCheckUtils]: 56: Hoare triple {2697#false} assume true; {2697#false} is VALID [2018-11-18 22:03:30,435 INFO L268 TraceCheckUtils]: 57: Hoare quadruple {2697#false} {2697#false} #152#return; {2697#false} is VALID [2018-11-18 22:03:30,435 INFO L273 TraceCheckUtils]: 58: Hoare triple {2697#false} assume ~expected~0 != #t~ret14;havoc #t~ret14; {2697#false} is VALID [2018-11-18 22:03:30,435 INFO L273 TraceCheckUtils]: 59: Hoare triple {2697#false} assume !false; {2697#false} is VALID [2018-11-18 22:03:30,438 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 10 proven. 3 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2018-11-18 22:03:30,438 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-18 22:03:30,727 INFO L273 TraceCheckUtils]: 59: Hoare triple {2697#false} assume !false; {2697#false} is VALID [2018-11-18 22:03:30,728 INFO L273 TraceCheckUtils]: 58: Hoare triple {2697#false} assume ~expected~0 != #t~ret14;havoc #t~ret14; {2697#false} is VALID [2018-11-18 22:03:30,728 INFO L268 TraceCheckUtils]: 57: Hoare quadruple {2696#true} {2697#false} #152#return; {2697#false} is VALID [2018-11-18 22:03:30,728 INFO L273 TraceCheckUtils]: 56: Hoare triple {2696#true} assume true; {2696#true} is VALID [2018-11-18 22:03:30,728 INFO L273 TraceCheckUtils]: 55: Hoare triple {2696#true} call #t~mem8 := read~intINTTYPE4(~head.base, ~head.offset, 4bv32);#res := #t~mem8;havoc #t~mem8; {2696#true} is VALID [2018-11-18 22:03:30,728 INFO L273 TraceCheckUtils]: 54: Hoare triple {2696#true} assume !~bvsgt32(~index, 0bv32); {2696#true} is VALID [2018-11-18 22:03:30,729 INFO L273 TraceCheckUtils]: 53: Hoare triple {2696#true} assume true; {2696#true} is VALID [2018-11-18 22:03:30,729 INFO L273 TraceCheckUtils]: 52: Hoare triple {2696#true} ~head.base, ~head.offset := #in~head.base, #in~head.offset;~index := #in~index; {2696#true} is VALID [2018-11-18 22:03:30,729 INFO L256 TraceCheckUtils]: 51: Hoare triple {2697#false} call #t~ret14 := dll_get_data_at(~s~0.base, ~s~0.offset, ~i~0); {2696#true} is VALID [2018-11-18 22:03:30,729 INFO L273 TraceCheckUtils]: 50: Hoare triple {2697#false} assume !!~bvslt32(~i~0, ~len~0);~expected~0 := ~bvadd32(~i~0, ~len~0); {2697#false} is VALID [2018-11-18 22:03:30,729 INFO L273 TraceCheckUtils]: 49: Hoare triple {2697#false} assume true; {2697#false} is VALID [2018-11-18 22:03:30,729 INFO L273 TraceCheckUtils]: 48: Hoare triple {2697#false} ~i~0 := 0bv32; {2697#false} is VALID [2018-11-18 22:03:30,729 INFO L273 TraceCheckUtils]: 47: Hoare triple {2697#false} assume !~bvslt32(~i~0, ~len~0); {2697#false} is VALID [2018-11-18 22:03:30,730 INFO L273 TraceCheckUtils]: 46: Hoare triple {2697#false} assume true; {2697#false} is VALID [2018-11-18 22:03:30,730 INFO L273 TraceCheckUtils]: 45: Hoare triple {2697#false} #t~post12 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post12);havoc #t~post12; {2697#false} is VALID [2018-11-18 22:03:30,731 INFO L268 TraceCheckUtils]: 44: Hoare quadruple {2827#(not (bvsgt |dll_update_at_#in~index| (_ bv0 32)))} {2927#(bvsgt main_~i~0 (_ bv0 32))} #150#return; {2697#false} is VALID [2018-11-18 22:03:30,731 INFO L273 TraceCheckUtils]: 43: Hoare triple {2827#(not (bvsgt |dll_update_at_#in~index| (_ bv0 32)))} assume true; {2827#(not (bvsgt |dll_update_at_#in~index| (_ bv0 32)))} is VALID [2018-11-18 22:03:30,732 INFO L273 TraceCheckUtils]: 42: Hoare triple {2827#(not (bvsgt |dll_update_at_#in~index| (_ bv0 32)))} call write~intINTTYPE4(~data, ~head.base, ~head.offset, 4bv32); {2827#(not (bvsgt |dll_update_at_#in~index| (_ bv0 32)))} is VALID [2018-11-18 22:03:30,732 INFO L273 TraceCheckUtils]: 41: Hoare triple {2940#(or (bvsgt dll_update_at_~index (_ bv0 32)) (not (bvsgt |dll_update_at_#in~index| (_ bv0 32))))} assume !~bvsgt32(~index, 0bv32); {2827#(not (bvsgt |dll_update_at_#in~index| (_ bv0 32)))} is VALID [2018-11-18 22:03:30,733 INFO L273 TraceCheckUtils]: 40: Hoare triple {2940#(or (bvsgt dll_update_at_~index (_ bv0 32)) (not (bvsgt |dll_update_at_#in~index| (_ bv0 32))))} assume true; {2940#(or (bvsgt dll_update_at_~index (_ bv0 32)) (not (bvsgt |dll_update_at_#in~index| (_ bv0 32))))} is VALID [2018-11-18 22:03:30,734 INFO L273 TraceCheckUtils]: 39: Hoare triple {2696#true} ~head.base, ~head.offset := #in~head.base, #in~head.offset;~data := #in~data;~index := #in~index; {2940#(or (bvsgt dll_update_at_~index (_ bv0 32)) (not (bvsgt |dll_update_at_#in~index| (_ bv0 32))))} is VALID [2018-11-18 22:03:30,734 INFO L256 TraceCheckUtils]: 38: Hoare triple {2927#(bvsgt main_~i~0 (_ bv0 32))} call dll_update_at(~s~0.base, ~s~0.offset, ~new_data~0, ~i~0); {2696#true} is VALID [2018-11-18 22:03:30,735 INFO L273 TraceCheckUtils]: 37: Hoare triple {2927#(bvsgt main_~i~0 (_ bv0 32))} assume !!~bvslt32(~i~0, ~len~0);~new_data~0 := ~bvadd32(~i~0, ~len~0); {2927#(bvsgt main_~i~0 (_ bv0 32))} is VALID [2018-11-18 22:03:30,736 INFO L273 TraceCheckUtils]: 36: Hoare triple {2927#(bvsgt main_~i~0 (_ bv0 32))} assume true; {2927#(bvsgt main_~i~0 (_ bv0 32))} is VALID [2018-11-18 22:03:30,737 INFO L273 TraceCheckUtils]: 35: Hoare triple {2956#(bvsgt (bvadd main_~i~0 (_ bv1 32)) (_ bv0 32))} #t~post12 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post12);havoc #t~post12; {2927#(bvsgt main_~i~0 (_ bv0 32))} is VALID [2018-11-18 22:03:30,738 INFO L268 TraceCheckUtils]: 34: Hoare quadruple {2696#true} {2956#(bvsgt (bvadd main_~i~0 (_ bv1 32)) (_ bv0 32))} #150#return; {2956#(bvsgt (bvadd main_~i~0 (_ bv1 32)) (_ bv0 32))} is VALID [2018-11-18 22:03:30,738 INFO L273 TraceCheckUtils]: 33: Hoare triple {2696#true} assume true; {2696#true} is VALID [2018-11-18 22:03:30,738 INFO L273 TraceCheckUtils]: 32: Hoare triple {2696#true} call write~intINTTYPE4(~data, ~head.base, ~head.offset, 4bv32); {2696#true} is VALID [2018-11-18 22:03:30,738 INFO L273 TraceCheckUtils]: 31: Hoare triple {2696#true} assume !~bvsgt32(~index, 0bv32); {2696#true} is VALID [2018-11-18 22:03:30,739 INFO L273 TraceCheckUtils]: 30: Hoare triple {2696#true} assume true; {2696#true} is VALID [2018-11-18 22:03:30,739 INFO L273 TraceCheckUtils]: 29: Hoare triple {2696#true} ~head.base, ~head.offset := #in~head.base, #in~head.offset;~data := #in~data;~index := #in~index; {2696#true} is VALID [2018-11-18 22:03:30,739 INFO L256 TraceCheckUtils]: 28: Hoare triple {2956#(bvsgt (bvadd main_~i~0 (_ bv1 32)) (_ bv0 32))} call dll_update_at(~s~0.base, ~s~0.offset, ~new_data~0, ~i~0); {2696#true} is VALID [2018-11-18 22:03:30,746 INFO L273 TraceCheckUtils]: 27: Hoare triple {2956#(bvsgt (bvadd main_~i~0 (_ bv1 32)) (_ bv0 32))} assume !!~bvslt32(~i~0, ~len~0);~new_data~0 := ~bvadd32(~i~0, ~len~0); {2956#(bvsgt (bvadd main_~i~0 (_ bv1 32)) (_ bv0 32))} is VALID [2018-11-18 22:03:30,746 INFO L273 TraceCheckUtils]: 26: Hoare triple {2956#(bvsgt (bvadd main_~i~0 (_ bv1 32)) (_ bv0 32))} assume true; {2956#(bvsgt (bvadd main_~i~0 (_ bv1 32)) (_ bv0 32))} is VALID [2018-11-18 22:03:30,747 INFO L273 TraceCheckUtils]: 25: Hoare triple {2696#true} ~s~0.base, ~s~0.offset := #t~ret11.base, #t~ret11.offset;havoc #t~ret11.base, #t~ret11.offset;havoc ~i~0;~i~0 := 0bv32; {2956#(bvsgt (bvadd main_~i~0 (_ bv1 32)) (_ bv0 32))} is VALID [2018-11-18 22:03:30,747 INFO L268 TraceCheckUtils]: 24: Hoare quadruple {2696#true} {2696#true} #148#return; {2696#true} is VALID [2018-11-18 22:03:30,747 INFO L273 TraceCheckUtils]: 23: Hoare triple {2696#true} assume true; {2696#true} is VALID [2018-11-18 22:03:30,747 INFO L273 TraceCheckUtils]: 22: Hoare triple {2696#true} #res.base, #res.offset := ~head~0.base, ~head~0.offset; {2696#true} is VALID [2018-11-18 22:03:30,748 INFO L273 TraceCheckUtils]: 21: Hoare triple {2696#true} assume !~bvsgt32(~len, 0bv32); {2696#true} is VALID [2018-11-18 22:03:30,748 INFO L273 TraceCheckUtils]: 20: Hoare triple {2696#true} assume true; {2696#true} is VALID [2018-11-18 22:03:30,748 INFO L273 TraceCheckUtils]: 19: Hoare triple {2696#true} ~head~0.base, ~head~0.offset := ~new_head~0.base, ~new_head~0.offset;#t~post4 := ~len;~len := ~bvsub32(#t~post4, 1bv32);havoc #t~post4; {2696#true} is VALID [2018-11-18 22:03:30,748 INFO L273 TraceCheckUtils]: 18: Hoare triple {2696#true} assume ~head~0.base != 0bv32 || ~head~0.offset != 0bv32;call write~$Pointer$(~new_head~0.base, ~new_head~0.offset, ~head~0.base, ~bvadd32(8bv32, ~head~0.offset), 4bv32); {2696#true} is VALID [2018-11-18 22:03:30,748 INFO L273 TraceCheckUtils]: 17: Hoare triple {2696#true} call write~intINTTYPE4(~data, ~new_head~0.base, ~new_head~0.offset, 4bv32);call write~$Pointer$(~head~0.base, ~head~0.offset, ~new_head~0.base, ~bvadd32(4bv32, ~new_head~0.offset), 4bv32);call write~$Pointer$(0bv32, 0bv32, ~new_head~0.base, ~bvadd32(8bv32, ~new_head~0.offset), 4bv32); {2696#true} is VALID [2018-11-18 22:03:30,748 INFO L273 TraceCheckUtils]: 16: Hoare triple {2696#true} assume !(0bv32 == ~new_head~0.base && 0bv32 == ~new_head~0.offset); {2696#true} is VALID [2018-11-18 22:03:30,749 INFO L273 TraceCheckUtils]: 15: Hoare triple {2696#true} assume !!~bvsgt32(~len, 0bv32);call #t~malloc3.base, #t~malloc3.offset := #Ultimate.alloc(12bv32);~new_head~0.base, ~new_head~0.offset := #t~malloc3.base, #t~malloc3.offset; {2696#true} is VALID [2018-11-18 22:03:30,749 INFO L273 TraceCheckUtils]: 14: Hoare triple {2696#true} assume true; {2696#true} is VALID [2018-11-18 22:03:30,749 INFO L273 TraceCheckUtils]: 13: Hoare triple {2696#true} ~head~0.base, ~head~0.offset := ~new_head~0.base, ~new_head~0.offset;#t~post4 := ~len;~len := ~bvsub32(#t~post4, 1bv32);havoc #t~post4; {2696#true} is VALID [2018-11-18 22:03:30,749 INFO L273 TraceCheckUtils]: 12: Hoare triple {2696#true} assume !(~head~0.base != 0bv32 || ~head~0.offset != 0bv32); {2696#true} is VALID [2018-11-18 22:03:30,749 INFO L273 TraceCheckUtils]: 11: Hoare triple {2696#true} call write~intINTTYPE4(~data, ~new_head~0.base, ~new_head~0.offset, 4bv32);call write~$Pointer$(~head~0.base, ~head~0.offset, ~new_head~0.base, ~bvadd32(4bv32, ~new_head~0.offset), 4bv32);call write~$Pointer$(0bv32, 0bv32, ~new_head~0.base, ~bvadd32(8bv32, ~new_head~0.offset), 4bv32); {2696#true} is VALID [2018-11-18 22:03:30,750 INFO L273 TraceCheckUtils]: 10: Hoare triple {2696#true} assume !(0bv32 == ~new_head~0.base && 0bv32 == ~new_head~0.offset); {2696#true} is VALID [2018-11-18 22:03:30,750 INFO L273 TraceCheckUtils]: 9: Hoare triple {2696#true} assume !!~bvsgt32(~len, 0bv32);call #t~malloc3.base, #t~malloc3.offset := #Ultimate.alloc(12bv32);~new_head~0.base, ~new_head~0.offset := #t~malloc3.base, #t~malloc3.offset; {2696#true} is VALID [2018-11-18 22:03:30,750 INFO L273 TraceCheckUtils]: 8: Hoare triple {2696#true} assume true; {2696#true} is VALID [2018-11-18 22:03:30,750 INFO L273 TraceCheckUtils]: 7: Hoare triple {2696#true} ~len := #in~len;~data := #in~data;~head~0.base, ~head~0.offset := 0bv32, 0bv32; {2696#true} is VALID [2018-11-18 22:03:30,750 INFO L256 TraceCheckUtils]: 6: Hoare triple {2696#true} call #t~ret11.base, #t~ret11.offset := dll_create(~len~0, ~data~0); {2696#true} is VALID [2018-11-18 22:03:30,751 INFO L273 TraceCheckUtils]: 5: Hoare triple {2696#true} ~len~0 := 2bv32;~data~0 := 1bv32; {2696#true} is VALID [2018-11-18 22:03:30,751 INFO L256 TraceCheckUtils]: 4: Hoare triple {2696#true} call #t~ret15 := main(); {2696#true} is VALID [2018-11-18 22:03:30,751 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {2696#true} {2696#true} #158#return; {2696#true} is VALID [2018-11-18 22:03:30,751 INFO L273 TraceCheckUtils]: 2: Hoare triple {2696#true} assume true; {2696#true} is VALID [2018-11-18 22:03:30,751 INFO L273 TraceCheckUtils]: 1: Hoare triple {2696#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {2696#true} is VALID [2018-11-18 22:03:30,752 INFO L256 TraceCheckUtils]: 0: Hoare triple {2696#true} call ULTIMATE.init(); {2696#true} is VALID [2018-11-18 22:03:30,754 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 10 proven. 3 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2018-11-18 22:03:30,760 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-18 22:03:30,760 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 9 [2018-11-18 22:03:30,761 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 60 [2018-11-18 22:03:30,762 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-18 22:03:30,762 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 9 states. [2018-11-18 22:03:30,909 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 74 edges. 74 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 22:03:30,910 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-11-18 22:03:30,910 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-18 22:03:30,910 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2018-11-18 22:03:30,910 INFO L87 Difference]: Start difference. First operand 56 states and 62 transitions. Second operand 9 states. [2018-11-18 22:03:32,389 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:03:32,389 INFO L93 Difference]: Finished difference Result 112 states and 129 transitions. [2018-11-18 22:03:32,390 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-18 22:03:32,390 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 60 [2018-11-18 22:03:32,390 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 22:03:32,390 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2018-11-18 22:03:32,394 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 118 transitions. [2018-11-18 22:03:32,394 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2018-11-18 22:03:32,397 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 118 transitions. [2018-11-18 22:03:32,398 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 9 states and 118 transitions. [2018-11-18 22:03:32,608 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 118 edges. 118 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 22:03:32,614 INFO L225 Difference]: With dead ends: 112 [2018-11-18 22:03:32,614 INFO L226 Difference]: Without dead ends: 85 [2018-11-18 22:03:32,615 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 121 GetRequests, 112 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2018-11-18 22:03:32,615 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2018-11-18 22:03:32,697 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 64. [2018-11-18 22:03:32,697 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-18 22:03:32,698 INFO L82 GeneralOperation]: Start isEquivalent. First operand 85 states. Second operand 64 states. [2018-11-18 22:03:32,698 INFO L74 IsIncluded]: Start isIncluded. First operand 85 states. Second operand 64 states. [2018-11-18 22:03:32,698 INFO L87 Difference]: Start difference. First operand 85 states. Second operand 64 states. [2018-11-18 22:03:32,702 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:03:32,702 INFO L93 Difference]: Finished difference Result 85 states and 95 transitions. [2018-11-18 22:03:32,702 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 95 transitions. [2018-11-18 22:03:32,703 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 22:03:32,703 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 22:03:32,703 INFO L74 IsIncluded]: Start isIncluded. First operand 64 states. Second operand 85 states. [2018-11-18 22:03:32,703 INFO L87 Difference]: Start difference. First operand 64 states. Second operand 85 states. [2018-11-18 22:03:32,708 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:03:32,708 INFO L93 Difference]: Finished difference Result 85 states and 95 transitions. [2018-11-18 22:03:32,708 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 95 transitions. [2018-11-18 22:03:32,709 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 22:03:32,709 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 22:03:32,709 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-18 22:03:32,709 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-18 22:03:32,709 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64 states. [2018-11-18 22:03:32,711 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 70 transitions. [2018-11-18 22:03:32,712 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 70 transitions. Word has length 60 [2018-11-18 22:03:32,712 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 22:03:32,712 INFO L480 AbstractCegarLoop]: Abstraction has 64 states and 70 transitions. [2018-11-18 22:03:32,712 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-11-18 22:03:32,712 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 70 transitions. [2018-11-18 22:03:32,714 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2018-11-18 22:03:32,714 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 22:03:32,714 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 22:03:32,715 INFO L423 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 22:03:32,715 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 22:03:32,715 INFO L82 PathProgramCache]: Analyzing trace with hash -1863532425, now seen corresponding path program 1 times [2018-11-18 22:03:32,715 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-18 22:03:32,715 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 9 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-18 22:03:32,738 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 22:03:32,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 22:03:32,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 22:03:32,923 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 22:03:32,963 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-11-18 22:03:32,975 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-18 22:03:32,979 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 22:03:32,979 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-11-18 22:03:32,982 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-18 22:03:33,032 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 22:03:33,034 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 22:03:33,036 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 4 [2018-11-18 22:03:33,037 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-18 22:03:33,043 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 22:03:33,043 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:8 [2018-11-18 22:03:33,082 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 15 [2018-11-18 22:03:33,103 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 18 [2018-11-18 22:03:33,111 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 22:03:33,114 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 27 [2018-11-18 22:03:33,116 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-18 22:03:33,125 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 22:03:33,134 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 22:03:33,152 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-18 22:03:33,153 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 1 variables, input treesize:26, output treesize:26 [2018-11-18 22:03:33,254 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 39 [2018-11-18 22:03:33,263 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 15 [2018-11-18 22:03:33,265 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 22:03:33,280 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 22:03:33,303 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-18 22:03:33,303 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:48, output treesize:38 [2018-11-18 22:03:33,319 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-18 22:03:34,235 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-11-18 22:03:34,242 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-11-18 22:03:34,243 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 22:03:34,251 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 22:03:34,276 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-11-18 22:03:34,276 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:40, output treesize:36 [2018-11-18 22:03:34,840 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 7 [2018-11-18 22:03:34,843 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-18 22:03:34,866 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-11-18 22:03:34,867 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:41, output treesize:32 [2018-11-18 22:03:34,875 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-18 22:04:03,468 WARN L180 SmtUtils]: Spent 2.02 s on a formula simplification that was a NOOP. DAG size: 33 [2018-11-18 22:04:03,536 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 22:04:03,559 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 32 [2018-11-18 22:04:03,571 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 13 [2018-11-18 22:04:03,573 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 22:04:03,594 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 22:04:03,817 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 6 new quantified variables, introduced 4 case distinctions, treesize of input 70 treesize of output 90 [2018-11-18 22:04:04,080 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 66 treesize of output 64 [2018-11-18 22:04:04,089 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 2 xjuncts. [2018-11-18 22:04:05,510 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 39 [2018-11-18 22:04:05,520 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-11-18 22:04:05,525 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 36 [2018-11-18 22:04:05,530 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-11-18 22:04:06,871 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 66 treesize of output 59 [2018-11-18 22:04:06,881 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-11-18 22:04:08,212 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 59 treesize of output 50 [2018-11-18 22:04:08,218 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-11-18 22:04:09,483 INFO L682 Elim1Store]: detected equality via solver [2018-11-18 22:04:09,627 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 22:04:09,641 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 22:04:09,650 INFO L303 Elim1Store]: Index analysis took 184 ms [2018-11-18 22:04:09,679 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 7 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 58 treesize of output 76 [2018-11-18 22:04:09,692 INFO L267 ElimStorePlain]: Start of recursive call 10: 4 dim-0 vars, End of recursive call: 4 dim-0 vars, and 4 xjuncts. [2018-11-18 22:04:11,469 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 72 treesize of output 65 [2018-11-18 22:04:11,473 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2018-11-18 22:04:13,303 INFO L682 Elim1Store]: detected equality via solver [2018-11-18 22:04:13,311 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 58 treesize of output 52 [2018-11-18 22:04:13,319 INFO L267 ElimStorePlain]: Start of recursive call 12: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-18 22:04:14,938 INFO L682 Elim1Store]: detected equality via solver [2018-11-18 22:04:14,947 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 35 [2018-11-18 22:04:14,952 INFO L267 ElimStorePlain]: Start of recursive call 13: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-18 22:04:16,723 INFO L682 Elim1Store]: detected equality via solver [2018-11-18 22:04:16,770 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 64 treesize of output 56 [2018-11-18 22:04:16,783 INFO L267 ElimStorePlain]: Start of recursive call 14: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-18 22:04:18,485 INFO L303 Elim1Store]: Index analysis took 139 ms [2018-11-18 22:04:18,628 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 60 treesize of output 64 [2018-11-18 22:04:18,646 INFO L267 ElimStorePlain]: Start of recursive call 15: End of recursive call: and 4 xjuncts. [2018-11-18 22:04:20,502 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 42 [2018-11-18 22:04:20,526 INFO L267 ElimStorePlain]: Start of recursive call 16: End of recursive call: and 1 xjuncts. [2018-11-18 22:04:22,203 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 22:04:22,242 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 22:04:22,243 INFO L682 Elim1Store]: detected equality via solver [2018-11-18 22:04:22,252 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 22:04:22,287 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 7 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 47 treesize of output 73 [2018-11-18 22:04:22,300 INFO L267 ElimStorePlain]: Start of recursive call 17: 4 dim-0 vars, End of recursive call: 4 dim-0 vars, and 4 xjuncts. [2018-11-18 22:04:24,453 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 22:04:24,455 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 22:04:24,456 INFO L303 Elim1Store]: Index analysis took 138 ms [2018-11-18 22:04:24,456 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 28 [2018-11-18 22:04:24,458 INFO L267 ElimStorePlain]: Start of recursive call 18: End of recursive call: and 1 xjuncts. [2018-11-18 22:04:26,344 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 22:04:26,347 INFO L682 Elim1Store]: detected equality via solver [2018-11-18 22:04:26,369 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 40 treesize of output 49 [2018-11-18 22:04:26,376 INFO L267 ElimStorePlain]: Start of recursive call 19: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2018-11-18 22:04:28,399 INFO L682 Elim1Store]: detected equality via solver [2018-11-18 22:04:28,406 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 65 treesize of output 55 [2018-11-18 22:04:28,413 INFO L267 ElimStorePlain]: Start of recursive call 20: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-18 22:04:30,429 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 39 [2018-11-18 22:04:30,435 INFO L267 ElimStorePlain]: Start of recursive call 21: End of recursive call: and 1 xjuncts. [2018-11-18 22:04:32,248 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 20 [2018-11-18 22:04:32,254 INFO L267 ElimStorePlain]: Start of recursive call 22: End of recursive call: and 1 xjuncts. [2018-11-18 22:04:34,215 INFO L682 Elim1Store]: detected equality via solver [2018-11-18 22:04:34,222 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 33 [2018-11-18 22:04:34,226 INFO L267 ElimStorePlain]: Start of recursive call 23: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-18 22:04:34,231 INFO L682 Elim1Store]: detected equality via solver [2018-11-18 22:04:34,233 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 22:04:34,234 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 34 [2018-11-18 22:04:34,237 INFO L267 ElimStorePlain]: Start of recursive call 24: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-18 22:04:36,226 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 22:04:36,228 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 60 treesize of output 57 [2018-11-18 22:04:36,233 INFO L267 ElimStorePlain]: Start of recursive call 25: End of recursive call: and 1 xjuncts. [2018-11-18 22:04:36,245 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 63 treesize of output 56 [2018-11-18 22:04:36,250 INFO L267 ElimStorePlain]: Start of recursive call 26: End of recursive call: and 1 xjuncts. [2018-11-18 22:04:36,260 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 60 treesize of output 53 [2018-11-18 22:04:36,265 INFO L267 ElimStorePlain]: Start of recursive call 27: End of recursive call: and 1 xjuncts. [2018-11-18 22:04:38,237 INFO L682 Elim1Store]: detected equality via solver [2018-11-18 22:04:38,325 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 3 case distinctions, treesize of input 40 treesize of output 49 [2018-11-18 22:04:38,341 INFO L267 ElimStorePlain]: Start of recursive call 28: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 4 xjuncts. [2018-11-18 22:04:38,358 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 22:04:38,358 INFO L682 Elim1Store]: detected equality via solver [2018-11-18 22:04:38,368 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 22:04:38,370 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 22:04:38,382 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 37 treesize of output 50 [2018-11-18 22:04:38,392 INFO L267 ElimStorePlain]: Start of recursive call 29: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-11-18 22:04:40,561 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 28 [2018-11-18 22:04:40,564 INFO L267 ElimStorePlain]: Start of recursive call 30: End of recursive call: and 2 xjuncts. [2018-11-18 22:04:42,712 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 22:04:42,723 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 22:04:42,757 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 47 treesize of output 64 [2018-11-18 22:04:42,764 INFO L267 ElimStorePlain]: Start of recursive call 31: End of recursive call: and 4 xjuncts. [2018-11-18 22:04:44,954 INFO L682 Elim1Store]: detected equality via solver [2018-11-18 22:04:45,041 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 3 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 5 case distinctions, treesize of input 37 treesize of output 67 [2018-11-18 22:04:45,056 INFO L267 ElimStorePlain]: Start of recursive call 32: 8 dim-0 vars, End of recursive call: 8 dim-0 vars, and 12 xjuncts. [2018-11-18 22:04:48,174 INFO L267 ElimStorePlain]: Start of recursive call 4: 23 dim-1 vars, End of recursive call: 28 dim-0 vars, and 31 xjuncts. [2018-11-18 22:04:51,670 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 2 dim-2 vars, End of recursive call: and 3 xjuncts. [2018-11-18 22:04:51,670 INFO L202 ElimStorePlain]: Needed 32 recursive calls to eliminate 7 variables, input treesize:95, output treesize:56 [2018-11-18 22:04:51,687 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-18 22:04:52,356 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 31 [2018-11-18 22:04:52,372 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 11 [2018-11-18 22:04:52,381 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 22:04:52,423 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 9 [2018-11-18 22:04:52,424 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-18 22:04:52,442 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 22:04:52,452 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-18 22:04:52,452 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:31, output treesize:9 [2018-11-18 22:04:52,456 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-18 22:04:52,524 INFO L256 TraceCheckUtils]: 0: Hoare triple {3481#true} call ULTIMATE.init(); {3481#true} is VALID [2018-11-18 22:04:52,524 INFO L273 TraceCheckUtils]: 1: Hoare triple {3481#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {3481#true} is VALID [2018-11-18 22:04:52,524 INFO L273 TraceCheckUtils]: 2: Hoare triple {3481#true} assume true; {3481#true} is VALID [2018-11-18 22:04:52,525 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {3481#true} {3481#true} #158#return; {3481#true} is VALID [2018-11-18 22:04:52,525 INFO L256 TraceCheckUtils]: 4: Hoare triple {3481#true} call #t~ret15 := main(); {3481#true} is VALID [2018-11-18 22:04:52,526 INFO L273 TraceCheckUtils]: 5: Hoare triple {3481#true} ~len~0 := 2bv32;~data~0 := 1bv32; {3501#(= (bvadd main_~len~0 (_ bv4294967294 32)) (_ bv0 32))} is VALID [2018-11-18 22:04:52,526 INFO L256 TraceCheckUtils]: 6: Hoare triple {3501#(= (bvadd main_~len~0 (_ bv4294967294 32)) (_ bv0 32))} call #t~ret11.base, #t~ret11.offset := dll_create(~len~0, ~data~0); {3481#true} is VALID [2018-11-18 22:04:52,526 INFO L273 TraceCheckUtils]: 7: Hoare triple {3481#true} ~len := #in~len;~data := #in~data;~head~0.base, ~head~0.offset := 0bv32, 0bv32; {3481#true} is VALID [2018-11-18 22:04:52,526 INFO L273 TraceCheckUtils]: 8: Hoare triple {3481#true} assume true; {3481#true} is VALID [2018-11-18 22:04:52,527 INFO L273 TraceCheckUtils]: 9: Hoare triple {3481#true} assume !!~bvsgt32(~len, 0bv32);call #t~malloc3.base, #t~malloc3.offset := #Ultimate.alloc(12bv32);~new_head~0.base, ~new_head~0.offset := #t~malloc3.base, #t~malloc3.offset; {3514#(= (_ bv1 1) (select |#valid| dll_create_~new_head~0.base))} is VALID [2018-11-18 22:04:52,528 INFO L273 TraceCheckUtils]: 10: Hoare triple {3514#(= (_ bv1 1) (select |#valid| dll_create_~new_head~0.base))} assume !(0bv32 == ~new_head~0.base && 0bv32 == ~new_head~0.offset); {3514#(= (_ bv1 1) (select |#valid| dll_create_~new_head~0.base))} is VALID [2018-11-18 22:04:52,528 INFO L273 TraceCheckUtils]: 11: Hoare triple {3514#(= (_ bv1 1) (select |#valid| dll_create_~new_head~0.base))} call write~intINTTYPE4(~data, ~new_head~0.base, ~new_head~0.offset, 4bv32);call write~$Pointer$(~head~0.base, ~head~0.offset, ~new_head~0.base, ~bvadd32(4bv32, ~new_head~0.offset), 4bv32);call write~$Pointer$(0bv32, 0bv32, ~new_head~0.base, ~bvadd32(8bv32, ~new_head~0.offset), 4bv32); {3514#(= (_ bv1 1) (select |#valid| dll_create_~new_head~0.base))} is VALID [2018-11-18 22:04:52,528 INFO L273 TraceCheckUtils]: 12: Hoare triple {3514#(= (_ bv1 1) (select |#valid| dll_create_~new_head~0.base))} assume !(~head~0.base != 0bv32 || ~head~0.offset != 0bv32); {3514#(= (_ bv1 1) (select |#valid| dll_create_~new_head~0.base))} is VALID [2018-11-18 22:04:52,530 INFO L273 TraceCheckUtils]: 13: Hoare triple {3514#(= (_ bv1 1) (select |#valid| dll_create_~new_head~0.base))} ~head~0.base, ~head~0.offset := ~new_head~0.base, ~new_head~0.offset;#t~post4 := ~len;~len := ~bvsub32(#t~post4, 1bv32);havoc #t~post4; {3527#(= (bvadd (select |#valid| dll_create_~head~0.base) (_ bv1 1)) (_ bv0 1))} is VALID [2018-11-18 22:04:52,530 INFO L273 TraceCheckUtils]: 14: Hoare triple {3527#(= (bvadd (select |#valid| dll_create_~head~0.base) (_ bv1 1)) (_ bv0 1))} assume true; {3527#(= (bvadd (select |#valid| dll_create_~head~0.base) (_ bv1 1)) (_ bv0 1))} is VALID [2018-11-18 22:04:52,531 INFO L273 TraceCheckUtils]: 15: Hoare triple {3527#(= (bvadd (select |#valid| dll_create_~head~0.base) (_ bv1 1)) (_ bv0 1))} assume !!~bvsgt32(~len, 0bv32);call #t~malloc3.base, #t~malloc3.offset := #Ultimate.alloc(12bv32);~new_head~0.base, ~new_head~0.offset := #t~malloc3.base, #t~malloc3.offset; {3534#(and (= (_ bv0 32) dll_create_~new_head~0.offset) (not (= dll_create_~new_head~0.base dll_create_~head~0.base)))} is VALID [2018-11-18 22:04:52,532 INFO L273 TraceCheckUtils]: 16: Hoare triple {3534#(and (= (_ bv0 32) dll_create_~new_head~0.offset) (not (= dll_create_~new_head~0.base dll_create_~head~0.base)))} assume !(0bv32 == ~new_head~0.base && 0bv32 == ~new_head~0.offset); {3534#(and (= (_ bv0 32) dll_create_~new_head~0.offset) (not (= dll_create_~new_head~0.base dll_create_~head~0.base)))} is VALID [2018-11-18 22:04:52,533 INFO L273 TraceCheckUtils]: 17: Hoare triple {3534#(and (= (_ bv0 32) dll_create_~new_head~0.offset) (not (= dll_create_~new_head~0.base dll_create_~head~0.base)))} call write~intINTTYPE4(~data, ~new_head~0.base, ~new_head~0.offset, 4bv32);call write~$Pointer$(~head~0.base, ~head~0.offset, ~new_head~0.base, ~bvadd32(4bv32, ~new_head~0.offset), 4bv32);call write~$Pointer$(0bv32, 0bv32, ~new_head~0.base, ~bvadd32(8bv32, ~new_head~0.offset), 4bv32); {3541#(and (= (_ bv0 32) dll_create_~new_head~0.offset) (= (select (select |#memory_$Pointer$.base| dll_create_~new_head~0.base) (bvadd dll_create_~new_head~0.offset (_ bv4 32))) dll_create_~head~0.base) (not (= dll_create_~new_head~0.base dll_create_~head~0.base)) (= (_ bv0 32) (select (select |#memory_$Pointer$.base| dll_create_~new_head~0.base) (bvadd dll_create_~new_head~0.offset (_ bv8 32)))))} is VALID [2018-11-18 22:04:52,535 INFO L273 TraceCheckUtils]: 18: Hoare triple {3541#(and (= (_ bv0 32) dll_create_~new_head~0.offset) (= (select (select |#memory_$Pointer$.base| dll_create_~new_head~0.base) (bvadd dll_create_~new_head~0.offset (_ bv4 32))) dll_create_~head~0.base) (not (= dll_create_~new_head~0.base dll_create_~head~0.base)) (= (_ bv0 32) (select (select |#memory_$Pointer$.base| dll_create_~new_head~0.base) (bvadd dll_create_~new_head~0.offset (_ bv8 32)))))} assume ~head~0.base != 0bv32 || ~head~0.offset != 0bv32;call write~$Pointer$(~new_head~0.base, ~new_head~0.offset, ~head~0.base, ~bvadd32(8bv32, ~head~0.offset), 4bv32); {3545#(and (= (_ bv0 32) dll_create_~new_head~0.offset) (exists ((dll_create_~head~0.offset (_ BitVec 32))) (= dll_create_~new_head~0.base (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| dll_create_~new_head~0.base) (bvadd dll_create_~new_head~0.offset (_ bv4 32)))) (bvadd dll_create_~head~0.offset (_ bv8 32))))) (not (= dll_create_~new_head~0.base (select (select |#memory_$Pointer$.base| dll_create_~new_head~0.base) (bvadd dll_create_~new_head~0.offset (_ bv4 32))))) (= (_ bv0 32) (select (select |#memory_$Pointer$.base| dll_create_~new_head~0.base) (bvadd dll_create_~new_head~0.offset (_ bv8 32)))))} is VALID [2018-11-18 22:04:52,539 INFO L273 TraceCheckUtils]: 19: Hoare triple {3545#(and (= (_ bv0 32) dll_create_~new_head~0.offset) (exists ((dll_create_~head~0.offset (_ BitVec 32))) (= dll_create_~new_head~0.base (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| dll_create_~new_head~0.base) (bvadd dll_create_~new_head~0.offset (_ bv4 32)))) (bvadd dll_create_~head~0.offset (_ bv8 32))))) (not (= dll_create_~new_head~0.base (select (select |#memory_$Pointer$.base| dll_create_~new_head~0.base) (bvadd dll_create_~new_head~0.offset (_ bv4 32))))) (= (_ bv0 32) (select (select |#memory_$Pointer$.base| dll_create_~new_head~0.base) (bvadd dll_create_~new_head~0.offset (_ bv8 32)))))} ~head~0.base, ~head~0.offset := ~new_head~0.base, ~new_head~0.offset;#t~post4 := ~len;~len := ~bvsub32(#t~post4, 1bv32);havoc #t~post4; {3549#(and (= (_ bv0 32) (select (select |#memory_$Pointer$.base| dll_create_~head~0.base) (bvadd dll_create_~head~0.offset (_ bv8 32)))) (= (_ bv0 32) dll_create_~head~0.offset) (exists ((v_subst_1 (_ BitVec 32))) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| dll_create_~head~0.base) (bvadd dll_create_~head~0.offset (_ bv4 32)))) (bvadd v_subst_1 (_ bv8 32))) dll_create_~head~0.base)) (not (= (select (select |#memory_$Pointer$.base| dll_create_~head~0.base) (bvadd dll_create_~head~0.offset (_ bv4 32))) dll_create_~head~0.base)))} is VALID [2018-11-18 22:04:52,540 INFO L273 TraceCheckUtils]: 20: Hoare triple {3549#(and (= (_ bv0 32) (select (select |#memory_$Pointer$.base| dll_create_~head~0.base) (bvadd dll_create_~head~0.offset (_ bv8 32)))) (= (_ bv0 32) dll_create_~head~0.offset) (exists ((v_subst_1 (_ BitVec 32))) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| dll_create_~head~0.base) (bvadd dll_create_~head~0.offset (_ bv4 32)))) (bvadd v_subst_1 (_ bv8 32))) dll_create_~head~0.base)) (not (= (select (select |#memory_$Pointer$.base| dll_create_~head~0.base) (bvadd dll_create_~head~0.offset (_ bv4 32))) dll_create_~head~0.base)))} assume true; {3549#(and (= (_ bv0 32) (select (select |#memory_$Pointer$.base| dll_create_~head~0.base) (bvadd dll_create_~head~0.offset (_ bv8 32)))) (= (_ bv0 32) dll_create_~head~0.offset) (exists ((v_subst_1 (_ BitVec 32))) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| dll_create_~head~0.base) (bvadd dll_create_~head~0.offset (_ bv4 32)))) (bvadd v_subst_1 (_ bv8 32))) dll_create_~head~0.base)) (not (= (select (select |#memory_$Pointer$.base| dll_create_~head~0.base) (bvadd dll_create_~head~0.offset (_ bv4 32))) dll_create_~head~0.base)))} is VALID [2018-11-18 22:04:52,540 INFO L273 TraceCheckUtils]: 21: Hoare triple {3549#(and (= (_ bv0 32) (select (select |#memory_$Pointer$.base| dll_create_~head~0.base) (bvadd dll_create_~head~0.offset (_ bv8 32)))) (= (_ bv0 32) dll_create_~head~0.offset) (exists ((v_subst_1 (_ BitVec 32))) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| dll_create_~head~0.base) (bvadd dll_create_~head~0.offset (_ bv4 32)))) (bvadd v_subst_1 (_ bv8 32))) dll_create_~head~0.base)) (not (= (select (select |#memory_$Pointer$.base| dll_create_~head~0.base) (bvadd dll_create_~head~0.offset (_ bv4 32))) dll_create_~head~0.base)))} assume !~bvsgt32(~len, 0bv32); {3549#(and (= (_ bv0 32) (select (select |#memory_$Pointer$.base| dll_create_~head~0.base) (bvadd dll_create_~head~0.offset (_ bv8 32)))) (= (_ bv0 32) dll_create_~head~0.offset) (exists ((v_subst_1 (_ BitVec 32))) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| dll_create_~head~0.base) (bvadd dll_create_~head~0.offset (_ bv4 32)))) (bvadd v_subst_1 (_ bv8 32))) dll_create_~head~0.base)) (not (= (select (select |#memory_$Pointer$.base| dll_create_~head~0.base) (bvadd dll_create_~head~0.offset (_ bv4 32))) dll_create_~head~0.base)))} is VALID [2018-11-18 22:04:52,542 INFO L273 TraceCheckUtils]: 22: Hoare triple {3549#(and (= (_ bv0 32) (select (select |#memory_$Pointer$.base| dll_create_~head~0.base) (bvadd dll_create_~head~0.offset (_ bv8 32)))) (= (_ bv0 32) dll_create_~head~0.offset) (exists ((v_subst_1 (_ BitVec 32))) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| dll_create_~head~0.base) (bvadd dll_create_~head~0.offset (_ bv4 32)))) (bvadd v_subst_1 (_ bv8 32))) dll_create_~head~0.base)) (not (= (select (select |#memory_$Pointer$.base| dll_create_~head~0.base) (bvadd dll_create_~head~0.offset (_ bv4 32))) dll_create_~head~0.base)))} #res.base, #res.offset := ~head~0.base, ~head~0.offset; {3559#(and (= |dll_create_#res.offset| (_ bv0 32)) (not (= (select (select |#memory_$Pointer$.base| |dll_create_#res.base|) (bvadd |dll_create_#res.offset| (_ bv4 32))) |dll_create_#res.base|)) (= (_ bv0 32) (select (select |#memory_$Pointer$.base| |dll_create_#res.base|) (bvadd |dll_create_#res.offset| (_ bv8 32)))) (exists ((v_subst_1 (_ BitVec 32))) (= |dll_create_#res.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |dll_create_#res.base|) (bvadd |dll_create_#res.offset| (_ bv4 32)))) (bvadd v_subst_1 (_ bv8 32))))))} is VALID [2018-11-18 22:04:52,544 INFO L273 TraceCheckUtils]: 23: Hoare triple {3559#(and (= |dll_create_#res.offset| (_ bv0 32)) (not (= (select (select |#memory_$Pointer$.base| |dll_create_#res.base|) (bvadd |dll_create_#res.offset| (_ bv4 32))) |dll_create_#res.base|)) (= (_ bv0 32) (select (select |#memory_$Pointer$.base| |dll_create_#res.base|) (bvadd |dll_create_#res.offset| (_ bv8 32)))) (exists ((v_subst_1 (_ BitVec 32))) (= |dll_create_#res.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |dll_create_#res.base|) (bvadd |dll_create_#res.offset| (_ bv4 32)))) (bvadd v_subst_1 (_ bv8 32))))))} assume true; {3559#(and (= |dll_create_#res.offset| (_ bv0 32)) (not (= (select (select |#memory_$Pointer$.base| |dll_create_#res.base|) (bvadd |dll_create_#res.offset| (_ bv4 32))) |dll_create_#res.base|)) (= (_ bv0 32) (select (select |#memory_$Pointer$.base| |dll_create_#res.base|) (bvadd |dll_create_#res.offset| (_ bv8 32)))) (exists ((v_subst_1 (_ BitVec 32))) (= |dll_create_#res.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |dll_create_#res.base|) (bvadd |dll_create_#res.offset| (_ bv4 32)))) (bvadd v_subst_1 (_ bv8 32))))))} is VALID [2018-11-18 22:04:52,547 INFO L268 TraceCheckUtils]: 24: Hoare quadruple {3559#(and (= |dll_create_#res.offset| (_ bv0 32)) (not (= (select (select |#memory_$Pointer$.base| |dll_create_#res.base|) (bvadd |dll_create_#res.offset| (_ bv4 32))) |dll_create_#res.base|)) (= (_ bv0 32) (select (select |#memory_$Pointer$.base| |dll_create_#res.base|) (bvadd |dll_create_#res.offset| (_ bv8 32)))) (exists ((v_subst_1 (_ BitVec 32))) (= |dll_create_#res.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |dll_create_#res.base|) (bvadd |dll_create_#res.offset| (_ bv4 32)))) (bvadd v_subst_1 (_ bv8 32))))))} {3501#(= (bvadd main_~len~0 (_ bv4294967294 32)) (_ bv0 32))} #148#return; {3566#(and (not (= |main_#t~ret11.base| (select (select |#memory_$Pointer$.base| |main_#t~ret11.base|) (bvadd |main_#t~ret11.offset| (_ bv4 32))))) (= |main_#t~ret11.offset| (_ bv0 32)) (= (bvadd main_~len~0 (_ bv4294967294 32)) (_ bv0 32)) (exists ((v_subst_1 (_ BitVec 32))) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_#t~ret11.base|) (bvadd |main_#t~ret11.offset| (_ bv4 32)))) (bvadd v_subst_1 (_ bv8 32))) |main_#t~ret11.base|)) (= (_ bv0 32) (select (select |#memory_$Pointer$.base| |main_#t~ret11.base|) (bvadd |main_#t~ret11.offset| (_ bv8 32)))))} is VALID [2018-11-18 22:04:52,548 INFO L273 TraceCheckUtils]: 25: Hoare triple {3566#(and (not (= |main_#t~ret11.base| (select (select |#memory_$Pointer$.base| |main_#t~ret11.base|) (bvadd |main_#t~ret11.offset| (_ bv4 32))))) (= |main_#t~ret11.offset| (_ bv0 32)) (= (bvadd main_~len~0 (_ bv4294967294 32)) (_ bv0 32)) (exists ((v_subst_1 (_ BitVec 32))) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_#t~ret11.base|) (bvadd |main_#t~ret11.offset| (_ bv4 32)))) (bvadd v_subst_1 (_ bv8 32))) |main_#t~ret11.base|)) (= (_ bv0 32) (select (select |#memory_$Pointer$.base| |main_#t~ret11.base|) (bvadd |main_#t~ret11.offset| (_ bv8 32)))))} ~s~0.base, ~s~0.offset := #t~ret11.base, #t~ret11.offset;havoc #t~ret11.base, #t~ret11.offset;havoc ~i~0;~i~0 := 0bv32; {3570#(and (not (= (select (select |#memory_$Pointer$.base| main_~s~0.base) (_ bv4 32)) main_~s~0.base)) (exists ((v_subst_1 (_ BitVec 32))) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~s~0.base) (_ bv4 32))) (bvadd v_subst_1 (_ bv8 32))) main_~s~0.base)) (= main_~s~0.offset (_ bv0 32)) (= main_~i~0 (_ bv0 32)) (= (bvadd main_~len~0 (_ bv4294967294 32)) (_ bv0 32)) (= (_ bv0 32) (select (select |#memory_$Pointer$.base| main_~s~0.base) (_ bv8 32))))} is VALID [2018-11-18 22:04:52,549 INFO L273 TraceCheckUtils]: 26: Hoare triple {3570#(and (not (= (select (select |#memory_$Pointer$.base| main_~s~0.base) (_ bv4 32)) main_~s~0.base)) (exists ((v_subst_1 (_ BitVec 32))) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~s~0.base) (_ bv4 32))) (bvadd v_subst_1 (_ bv8 32))) main_~s~0.base)) (= main_~s~0.offset (_ bv0 32)) (= main_~i~0 (_ bv0 32)) (= (bvadd main_~len~0 (_ bv4294967294 32)) (_ bv0 32)) (= (_ bv0 32) (select (select |#memory_$Pointer$.base| main_~s~0.base) (_ bv8 32))))} assume true; {3570#(and (not (= (select (select |#memory_$Pointer$.base| main_~s~0.base) (_ bv4 32)) main_~s~0.base)) (exists ((v_subst_1 (_ BitVec 32))) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~s~0.base) (_ bv4 32))) (bvadd v_subst_1 (_ bv8 32))) main_~s~0.base)) (= main_~s~0.offset (_ bv0 32)) (= main_~i~0 (_ bv0 32)) (= (bvadd main_~len~0 (_ bv4294967294 32)) (_ bv0 32)) (= (_ bv0 32) (select (select |#memory_$Pointer$.base| main_~s~0.base) (_ bv8 32))))} is VALID [2018-11-18 22:04:52,550 INFO L273 TraceCheckUtils]: 27: Hoare triple {3570#(and (not (= (select (select |#memory_$Pointer$.base| main_~s~0.base) (_ bv4 32)) main_~s~0.base)) (exists ((v_subst_1 (_ BitVec 32))) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~s~0.base) (_ bv4 32))) (bvadd v_subst_1 (_ bv8 32))) main_~s~0.base)) (= main_~s~0.offset (_ bv0 32)) (= main_~i~0 (_ bv0 32)) (= (bvadd main_~len~0 (_ bv4294967294 32)) (_ bv0 32)) (= (_ bv0 32) (select (select |#memory_$Pointer$.base| main_~s~0.base) (_ bv8 32))))} assume !!~bvslt32(~i~0, ~len~0);~new_data~0 := ~bvadd32(~i~0, ~len~0); {3577#(and (not (= (select (select |#memory_$Pointer$.base| main_~s~0.base) (_ bv4 32)) main_~s~0.base)) (exists ((v_subst_1 (_ BitVec 32))) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~s~0.base) (_ bv4 32))) (bvadd v_subst_1 (_ bv8 32))) main_~s~0.base)) (= main_~len~0 main_~new_data~0) (= main_~s~0.offset (_ bv0 32)) (= (bvadd main_~len~0 (_ bv4294967294 32)) (_ bv0 32)) (= (_ bv0 32) (select (select |#memory_$Pointer$.base| main_~s~0.base) (_ bv8 32))))} is VALID [2018-11-18 22:04:52,553 INFO L256 TraceCheckUtils]: 28: Hoare triple {3577#(and (not (= (select (select |#memory_$Pointer$.base| main_~s~0.base) (_ bv4 32)) main_~s~0.base)) (exists ((v_subst_1 (_ BitVec 32))) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~s~0.base) (_ bv4 32))) (bvadd v_subst_1 (_ bv8 32))) main_~s~0.base)) (= main_~len~0 main_~new_data~0) (= main_~s~0.offset (_ bv0 32)) (= (bvadd main_~len~0 (_ bv4294967294 32)) (_ bv0 32)) (= (_ bv0 32) (select (select |#memory_$Pointer$.base| main_~s~0.base) (_ bv8 32))))} call dll_update_at(~s~0.base, ~s~0.offset, ~new_data~0, ~i~0); {3581#(exists ((v_subst_1 (_ BitVec 32)) (v_main_~s~0.base_BEFORE_CALL_1 (_ BitVec 32))) (and (= (select (select |#memory_$Pointer$.base| v_main_~s~0.base_BEFORE_CALL_1) (_ bv8 32)) (_ bv0 32)) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| v_main_~s~0.base_BEFORE_CALL_1) (_ bv4 32))) (bvadd v_subst_1 (_ bv8 32))) v_main_~s~0.base_BEFORE_CALL_1) (not (= (select (select |#memory_$Pointer$.base| v_main_~s~0.base_BEFORE_CALL_1) (_ bv4 32)) v_main_~s~0.base_BEFORE_CALL_1))))} is VALID [2018-11-18 22:04:52,555 INFO L273 TraceCheckUtils]: 29: Hoare triple {3581#(exists ((v_subst_1 (_ BitVec 32)) (v_main_~s~0.base_BEFORE_CALL_1 (_ BitVec 32))) (and (= (select (select |#memory_$Pointer$.base| v_main_~s~0.base_BEFORE_CALL_1) (_ bv8 32)) (_ bv0 32)) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| v_main_~s~0.base_BEFORE_CALL_1) (_ bv4 32))) (bvadd v_subst_1 (_ bv8 32))) v_main_~s~0.base_BEFORE_CALL_1) (not (= (select (select |#memory_$Pointer$.base| v_main_~s~0.base_BEFORE_CALL_1) (_ bv4 32)) v_main_~s~0.base_BEFORE_CALL_1))))} ~head.base, ~head.offset := #in~head.base, #in~head.offset;~data := #in~data;~index := #in~index; {3585#(and (exists ((v_subst_1 (_ BitVec 32)) (v_main_~s~0.base_BEFORE_CALL_1 (_ BitVec 32))) (and (= (select (select |#memory_$Pointer$.base| v_main_~s~0.base_BEFORE_CALL_1) (_ bv8 32)) (_ bv0 32)) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| v_main_~s~0.base_BEFORE_CALL_1) (_ bv4 32))) (bvadd v_subst_1 (_ bv8 32))) v_main_~s~0.base_BEFORE_CALL_1) (not (= (select (select |#memory_$Pointer$.base| v_main_~s~0.base_BEFORE_CALL_1) (_ bv4 32)) v_main_~s~0.base_BEFORE_CALL_1)))) (= dll_update_at_~data |dll_update_at_#in~data|) (= dll_update_at_~head.offset |dll_update_at_#in~head.offset|) (= |dll_update_at_#in~head.base| dll_update_at_~head.base))} is VALID [2018-11-18 22:04:52,556 INFO L273 TraceCheckUtils]: 30: Hoare triple {3585#(and (exists ((v_subst_1 (_ BitVec 32)) (v_main_~s~0.base_BEFORE_CALL_1 (_ BitVec 32))) (and (= (select (select |#memory_$Pointer$.base| v_main_~s~0.base_BEFORE_CALL_1) (_ bv8 32)) (_ bv0 32)) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| v_main_~s~0.base_BEFORE_CALL_1) (_ bv4 32))) (bvadd v_subst_1 (_ bv8 32))) v_main_~s~0.base_BEFORE_CALL_1) (not (= (select (select |#memory_$Pointer$.base| v_main_~s~0.base_BEFORE_CALL_1) (_ bv4 32)) v_main_~s~0.base_BEFORE_CALL_1)))) (= dll_update_at_~data |dll_update_at_#in~data|) (= dll_update_at_~head.offset |dll_update_at_#in~head.offset|) (= |dll_update_at_#in~head.base| dll_update_at_~head.base))} assume true; {3585#(and (exists ((v_subst_1 (_ BitVec 32)) (v_main_~s~0.base_BEFORE_CALL_1 (_ BitVec 32))) (and (= (select (select |#memory_$Pointer$.base| v_main_~s~0.base_BEFORE_CALL_1) (_ bv8 32)) (_ bv0 32)) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| v_main_~s~0.base_BEFORE_CALL_1) (_ bv4 32))) (bvadd v_subst_1 (_ bv8 32))) v_main_~s~0.base_BEFORE_CALL_1) (not (= (select (select |#memory_$Pointer$.base| v_main_~s~0.base_BEFORE_CALL_1) (_ bv4 32)) v_main_~s~0.base_BEFORE_CALL_1)))) (= dll_update_at_~data |dll_update_at_#in~data|) (= dll_update_at_~head.offset |dll_update_at_#in~head.offset|) (= |dll_update_at_#in~head.base| dll_update_at_~head.base))} is VALID [2018-11-18 22:04:52,557 INFO L273 TraceCheckUtils]: 31: Hoare triple {3585#(and (exists ((v_subst_1 (_ BitVec 32)) (v_main_~s~0.base_BEFORE_CALL_1 (_ BitVec 32))) (and (= (select (select |#memory_$Pointer$.base| v_main_~s~0.base_BEFORE_CALL_1) (_ bv8 32)) (_ bv0 32)) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| v_main_~s~0.base_BEFORE_CALL_1) (_ bv4 32))) (bvadd v_subst_1 (_ bv8 32))) v_main_~s~0.base_BEFORE_CALL_1) (not (= (select (select |#memory_$Pointer$.base| v_main_~s~0.base_BEFORE_CALL_1) (_ bv4 32)) v_main_~s~0.base_BEFORE_CALL_1)))) (= dll_update_at_~data |dll_update_at_#in~data|) (= dll_update_at_~head.offset |dll_update_at_#in~head.offset|) (= |dll_update_at_#in~head.base| dll_update_at_~head.base))} assume !~bvsgt32(~index, 0bv32); {3585#(and (exists ((v_subst_1 (_ BitVec 32)) (v_main_~s~0.base_BEFORE_CALL_1 (_ BitVec 32))) (and (= (select (select |#memory_$Pointer$.base| v_main_~s~0.base_BEFORE_CALL_1) (_ bv8 32)) (_ bv0 32)) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| v_main_~s~0.base_BEFORE_CALL_1) (_ bv4 32))) (bvadd v_subst_1 (_ bv8 32))) v_main_~s~0.base_BEFORE_CALL_1) (not (= (select (select |#memory_$Pointer$.base| v_main_~s~0.base_BEFORE_CALL_1) (_ bv4 32)) v_main_~s~0.base_BEFORE_CALL_1)))) (= dll_update_at_~data |dll_update_at_#in~data|) (= dll_update_at_~head.offset |dll_update_at_#in~head.offset|) (= |dll_update_at_#in~head.base| dll_update_at_~head.base))} is VALID [2018-11-18 22:04:52,559 INFO L273 TraceCheckUtils]: 32: Hoare triple {3585#(and (exists ((v_subst_1 (_ BitVec 32)) (v_main_~s~0.base_BEFORE_CALL_1 (_ BitVec 32))) (and (= (select (select |#memory_$Pointer$.base| v_main_~s~0.base_BEFORE_CALL_1) (_ bv8 32)) (_ bv0 32)) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| v_main_~s~0.base_BEFORE_CALL_1) (_ bv4 32))) (bvadd v_subst_1 (_ bv8 32))) v_main_~s~0.base_BEFORE_CALL_1) (not (= (select (select |#memory_$Pointer$.base| v_main_~s~0.base_BEFORE_CALL_1) (_ bv4 32)) v_main_~s~0.base_BEFORE_CALL_1)))) (= dll_update_at_~data |dll_update_at_#in~data|) (= dll_update_at_~head.offset |dll_update_at_#in~head.offset|) (= |dll_update_at_#in~head.base| dll_update_at_~head.base))} call write~intINTTYPE4(~data, ~head.base, ~head.offset, 4bv32); {3595#(and (exists ((v_subst_1 (_ BitVec 32)) (v_main_~s~0.base_BEFORE_CALL_1 (_ BitVec 32))) (and (= (select (select |#memory_$Pointer$.base| v_main_~s~0.base_BEFORE_CALL_1) (_ bv8 32)) (_ bv0 32)) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| v_main_~s~0.base_BEFORE_CALL_1) (_ bv4 32))) (bvadd v_subst_1 (_ bv8 32))) v_main_~s~0.base_BEFORE_CALL_1) (not (= (select (select |#memory_$Pointer$.base| v_main_~s~0.base_BEFORE_CALL_1) (_ bv4 32)) v_main_~s~0.base_BEFORE_CALL_1)))) (= (select (select |#memory_int| |dll_update_at_#in~head.base|) |dll_update_at_#in~head.offset|) |dll_update_at_#in~data|))} is VALID [2018-11-18 22:04:52,580 INFO L273 TraceCheckUtils]: 33: Hoare triple {3595#(and (exists ((v_subst_1 (_ BitVec 32)) (v_main_~s~0.base_BEFORE_CALL_1 (_ BitVec 32))) (and (= (select (select |#memory_$Pointer$.base| v_main_~s~0.base_BEFORE_CALL_1) (_ bv8 32)) (_ bv0 32)) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| v_main_~s~0.base_BEFORE_CALL_1) (_ bv4 32))) (bvadd v_subst_1 (_ bv8 32))) v_main_~s~0.base_BEFORE_CALL_1) (not (= (select (select |#memory_$Pointer$.base| v_main_~s~0.base_BEFORE_CALL_1) (_ bv4 32)) v_main_~s~0.base_BEFORE_CALL_1)))) (= (select (select |#memory_int| |dll_update_at_#in~head.base|) |dll_update_at_#in~head.offset|) |dll_update_at_#in~data|))} assume true; {3595#(and (exists ((v_subst_1 (_ BitVec 32)) (v_main_~s~0.base_BEFORE_CALL_1 (_ BitVec 32))) (and (= (select (select |#memory_$Pointer$.base| v_main_~s~0.base_BEFORE_CALL_1) (_ bv8 32)) (_ bv0 32)) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| v_main_~s~0.base_BEFORE_CALL_1) (_ bv4 32))) (bvadd v_subst_1 (_ bv8 32))) v_main_~s~0.base_BEFORE_CALL_1) (not (= (select (select |#memory_$Pointer$.base| v_main_~s~0.base_BEFORE_CALL_1) (_ bv4 32)) v_main_~s~0.base_BEFORE_CALL_1)))) (= (select (select |#memory_int| |dll_update_at_#in~head.base|) |dll_update_at_#in~head.offset|) |dll_update_at_#in~data|))} is VALID [2018-11-18 22:04:52,588 INFO L268 TraceCheckUtils]: 34: Hoare quadruple {3595#(and (exists ((v_subst_1 (_ BitVec 32)) (v_main_~s~0.base_BEFORE_CALL_1 (_ BitVec 32))) (and (= (select (select |#memory_$Pointer$.base| v_main_~s~0.base_BEFORE_CALL_1) (_ bv8 32)) (_ bv0 32)) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| v_main_~s~0.base_BEFORE_CALL_1) (_ bv4 32))) (bvadd v_subst_1 (_ bv8 32))) v_main_~s~0.base_BEFORE_CALL_1) (not (= (select (select |#memory_$Pointer$.base| v_main_~s~0.base_BEFORE_CALL_1) (_ bv4 32)) v_main_~s~0.base_BEFORE_CALL_1)))) (= (select (select |#memory_int| |dll_update_at_#in~head.base|) |dll_update_at_#in~head.offset|) |dll_update_at_#in~data|))} {3577#(and (not (= (select (select |#memory_$Pointer$.base| main_~s~0.base) (_ bv4 32)) main_~s~0.base)) (exists ((v_subst_1 (_ BitVec 32))) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~s~0.base) (_ bv4 32))) (bvadd v_subst_1 (_ bv8 32))) main_~s~0.base)) (= main_~len~0 main_~new_data~0) (= main_~s~0.offset (_ bv0 32)) (= (bvadd main_~len~0 (_ bv4294967294 32)) (_ bv0 32)) (= (_ bv0 32) (select (select |#memory_$Pointer$.base| main_~s~0.base) (_ bv8 32))))} #150#return; {3602#(and (not (= (select (select |#memory_$Pointer$.base| main_~s~0.base) (_ bv4 32)) main_~s~0.base)) (exists ((v_subst_1 (_ BitVec 32))) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~s~0.base) (_ bv4 32))) (bvadd v_subst_1 (_ bv8 32))) main_~s~0.base)) (= main_~s~0.offset (_ bv0 32)) (= (bvadd main_~len~0 (_ bv4294967294 32)) (_ bv0 32)) (= main_~len~0 (select (select |#memory_int| main_~s~0.base) main_~s~0.offset)) (= (_ bv0 32) (select (select |#memory_$Pointer$.base| main_~s~0.base) (_ bv8 32))))} is VALID [2018-11-18 22:04:52,589 INFO L273 TraceCheckUtils]: 35: Hoare triple {3602#(and (not (= (select (select |#memory_$Pointer$.base| main_~s~0.base) (_ bv4 32)) main_~s~0.base)) (exists ((v_subst_1 (_ BitVec 32))) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~s~0.base) (_ bv4 32))) (bvadd v_subst_1 (_ bv8 32))) main_~s~0.base)) (= main_~s~0.offset (_ bv0 32)) (= (bvadd main_~len~0 (_ bv4294967294 32)) (_ bv0 32)) (= main_~len~0 (select (select |#memory_int| main_~s~0.base) main_~s~0.offset)) (= (_ bv0 32) (select (select |#memory_$Pointer$.base| main_~s~0.base) (_ bv8 32))))} #t~post12 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post12);havoc #t~post12; {3602#(and (not (= (select (select |#memory_$Pointer$.base| main_~s~0.base) (_ bv4 32)) main_~s~0.base)) (exists ((v_subst_1 (_ BitVec 32))) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~s~0.base) (_ bv4 32))) (bvadd v_subst_1 (_ bv8 32))) main_~s~0.base)) (= main_~s~0.offset (_ bv0 32)) (= (bvadd main_~len~0 (_ bv4294967294 32)) (_ bv0 32)) (= main_~len~0 (select (select |#memory_int| main_~s~0.base) main_~s~0.offset)) (= (_ bv0 32) (select (select |#memory_$Pointer$.base| main_~s~0.base) (_ bv8 32))))} is VALID [2018-11-18 22:04:52,590 INFO L273 TraceCheckUtils]: 36: Hoare triple {3602#(and (not (= (select (select |#memory_$Pointer$.base| main_~s~0.base) (_ bv4 32)) main_~s~0.base)) (exists ((v_subst_1 (_ BitVec 32))) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~s~0.base) (_ bv4 32))) (bvadd v_subst_1 (_ bv8 32))) main_~s~0.base)) (= main_~s~0.offset (_ bv0 32)) (= (bvadd main_~len~0 (_ bv4294967294 32)) (_ bv0 32)) (= main_~len~0 (select (select |#memory_int| main_~s~0.base) main_~s~0.offset)) (= (_ bv0 32) (select (select |#memory_$Pointer$.base| main_~s~0.base) (_ bv8 32))))} assume true; {3602#(and (not (= (select (select |#memory_$Pointer$.base| main_~s~0.base) (_ bv4 32)) main_~s~0.base)) (exists ((v_subst_1 (_ BitVec 32))) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~s~0.base) (_ bv4 32))) (bvadd v_subst_1 (_ bv8 32))) main_~s~0.base)) (= main_~s~0.offset (_ bv0 32)) (= (bvadd main_~len~0 (_ bv4294967294 32)) (_ bv0 32)) (= main_~len~0 (select (select |#memory_int| main_~s~0.base) main_~s~0.offset)) (= (_ bv0 32) (select (select |#memory_$Pointer$.base| main_~s~0.base) (_ bv8 32))))} is VALID [2018-11-18 22:04:52,590 INFO L273 TraceCheckUtils]: 37: Hoare triple {3602#(and (not (= (select (select |#memory_$Pointer$.base| main_~s~0.base) (_ bv4 32)) main_~s~0.base)) (exists ((v_subst_1 (_ BitVec 32))) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~s~0.base) (_ bv4 32))) (bvadd v_subst_1 (_ bv8 32))) main_~s~0.base)) (= main_~s~0.offset (_ bv0 32)) (= (bvadd main_~len~0 (_ bv4294967294 32)) (_ bv0 32)) (= main_~len~0 (select (select |#memory_int| main_~s~0.base) main_~s~0.offset)) (= (_ bv0 32) (select (select |#memory_$Pointer$.base| main_~s~0.base) (_ bv8 32))))} assume !!~bvslt32(~i~0, ~len~0);~new_data~0 := ~bvadd32(~i~0, ~len~0); {3602#(and (not (= (select (select |#memory_$Pointer$.base| main_~s~0.base) (_ bv4 32)) main_~s~0.base)) (exists ((v_subst_1 (_ BitVec 32))) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~s~0.base) (_ bv4 32))) (bvadd v_subst_1 (_ bv8 32))) main_~s~0.base)) (= main_~s~0.offset (_ bv0 32)) (= (bvadd main_~len~0 (_ bv4294967294 32)) (_ bv0 32)) (= main_~len~0 (select (select |#memory_int| main_~s~0.base) main_~s~0.offset)) (= (_ bv0 32) (select (select |#memory_$Pointer$.base| main_~s~0.base) (_ bv8 32))))} is VALID [2018-11-18 22:04:52,593 INFO L256 TraceCheckUtils]: 38: Hoare triple {3602#(and (not (= (select (select |#memory_$Pointer$.base| main_~s~0.base) (_ bv4 32)) main_~s~0.base)) (exists ((v_subst_1 (_ BitVec 32))) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~s~0.base) (_ bv4 32))) (bvadd v_subst_1 (_ bv8 32))) main_~s~0.base)) (= main_~s~0.offset (_ bv0 32)) (= (bvadd main_~len~0 (_ bv4294967294 32)) (_ bv0 32)) (= main_~len~0 (select (select |#memory_int| main_~s~0.base) main_~s~0.offset)) (= (_ bv0 32) (select (select |#memory_$Pointer$.base| main_~s~0.base) (_ bv8 32))))} call dll_update_at(~s~0.base, ~s~0.offset, ~new_data~0, ~i~0); {3615#(and (= |old(#memory_int)| |#memory_int|) (exists ((v_subst_1 (_ BitVec 32)) (v_main_~s~0.base_BEFORE_CALL_2 (_ BitVec 32))) (and (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| v_main_~s~0.base_BEFORE_CALL_2) (_ bv4 32))) (bvadd v_subst_1 (_ bv8 32))) v_main_~s~0.base_BEFORE_CALL_2) (not (= (select (select |#memory_$Pointer$.base| v_main_~s~0.base_BEFORE_CALL_2) (_ bv4 32)) v_main_~s~0.base_BEFORE_CALL_2)) (= (select (select |#memory_$Pointer$.base| v_main_~s~0.base_BEFORE_CALL_2) (_ bv8 32)) (_ bv0 32)))))} is VALID [2018-11-18 22:04:52,595 INFO L273 TraceCheckUtils]: 39: Hoare triple {3615#(and (= |old(#memory_int)| |#memory_int|) (exists ((v_subst_1 (_ BitVec 32)) (v_main_~s~0.base_BEFORE_CALL_2 (_ BitVec 32))) (and (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| v_main_~s~0.base_BEFORE_CALL_2) (_ bv4 32))) (bvadd v_subst_1 (_ bv8 32))) v_main_~s~0.base_BEFORE_CALL_2) (not (= (select (select |#memory_$Pointer$.base| v_main_~s~0.base_BEFORE_CALL_2) (_ bv4 32)) v_main_~s~0.base_BEFORE_CALL_2)) (= (select (select |#memory_$Pointer$.base| v_main_~s~0.base_BEFORE_CALL_2) (_ bv8 32)) (_ bv0 32)))))} ~head.base, ~head.offset := #in~head.base, #in~head.offset;~data := #in~data;~index := #in~index; {3619#(and (= |old(#memory_int)| |#memory_int|) (exists ((v_subst_1 (_ BitVec 32)) (v_main_~s~0.base_BEFORE_CALL_2 (_ BitVec 32))) (and (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| v_main_~s~0.base_BEFORE_CALL_2) (_ bv4 32))) (bvadd v_subst_1 (_ bv8 32))) v_main_~s~0.base_BEFORE_CALL_2) (not (= (select (select |#memory_$Pointer$.base| v_main_~s~0.base_BEFORE_CALL_2) (_ bv4 32)) v_main_~s~0.base_BEFORE_CALL_2)) (= (select (select |#memory_$Pointer$.base| v_main_~s~0.base_BEFORE_CALL_2) (_ bv8 32)) (_ bv0 32)))) (= dll_update_at_~head.offset |dll_update_at_#in~head.offset|) (= |dll_update_at_#in~head.base| dll_update_at_~head.base))} is VALID [2018-11-18 22:04:52,596 INFO L273 TraceCheckUtils]: 40: Hoare triple {3619#(and (= |old(#memory_int)| |#memory_int|) (exists ((v_subst_1 (_ BitVec 32)) (v_main_~s~0.base_BEFORE_CALL_2 (_ BitVec 32))) (and (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| v_main_~s~0.base_BEFORE_CALL_2) (_ bv4 32))) (bvadd v_subst_1 (_ bv8 32))) v_main_~s~0.base_BEFORE_CALL_2) (not (= (select (select |#memory_$Pointer$.base| v_main_~s~0.base_BEFORE_CALL_2) (_ bv4 32)) v_main_~s~0.base_BEFORE_CALL_2)) (= (select (select |#memory_$Pointer$.base| v_main_~s~0.base_BEFORE_CALL_2) (_ bv8 32)) (_ bv0 32)))) (= dll_update_at_~head.offset |dll_update_at_#in~head.offset|) (= |dll_update_at_#in~head.base| dll_update_at_~head.base))} assume true; {3619#(and (= |old(#memory_int)| |#memory_int|) (exists ((v_subst_1 (_ BitVec 32)) (v_main_~s~0.base_BEFORE_CALL_2 (_ BitVec 32))) (and (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| v_main_~s~0.base_BEFORE_CALL_2) (_ bv4 32))) (bvadd v_subst_1 (_ bv8 32))) v_main_~s~0.base_BEFORE_CALL_2) (not (= (select (select |#memory_$Pointer$.base| v_main_~s~0.base_BEFORE_CALL_2) (_ bv4 32)) v_main_~s~0.base_BEFORE_CALL_2)) (= (select (select |#memory_$Pointer$.base| v_main_~s~0.base_BEFORE_CALL_2) (_ bv8 32)) (_ bv0 32)))) (= dll_update_at_~head.offset |dll_update_at_#in~head.offset|) (= |dll_update_at_#in~head.base| dll_update_at_~head.base))} is VALID [2018-11-18 22:04:52,598 INFO L273 TraceCheckUtils]: 41: Hoare triple {3619#(and (= |old(#memory_int)| |#memory_int|) (exists ((v_subst_1 (_ BitVec 32)) (v_main_~s~0.base_BEFORE_CALL_2 (_ BitVec 32))) (and (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| v_main_~s~0.base_BEFORE_CALL_2) (_ bv4 32))) (bvadd v_subst_1 (_ bv8 32))) v_main_~s~0.base_BEFORE_CALL_2) (not (= (select (select |#memory_$Pointer$.base| v_main_~s~0.base_BEFORE_CALL_2) (_ bv4 32)) v_main_~s~0.base_BEFORE_CALL_2)) (= (select (select |#memory_$Pointer$.base| v_main_~s~0.base_BEFORE_CALL_2) (_ bv8 32)) (_ bv0 32)))) (= dll_update_at_~head.offset |dll_update_at_#in~head.offset|) (= |dll_update_at_#in~head.base| dll_update_at_~head.base))} assume !!~bvsgt32(~index, 0bv32);call #t~mem9.base, #t~mem9.offset := read~$Pointer$(~head.base, ~bvadd32(4bv32, ~head.offset), 4bv32);~head.base, ~head.offset := #t~mem9.base, #t~mem9.offset;havoc #t~mem9.base, #t~mem9.offset;#t~post10 := ~index;~index := ~bvsub32(#t~post10, 1bv32);havoc #t~post10; {3626#(and (= |old(#memory_int)| |#memory_int|) (exists ((v_subst_1 (_ BitVec 32)) (v_main_~s~0.base_BEFORE_CALL_2 (_ BitVec 32))) (and (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| v_main_~s~0.base_BEFORE_CALL_2) (_ bv4 32))) (bvadd v_subst_1 (_ bv8 32))) v_main_~s~0.base_BEFORE_CALL_2) (not (= (select (select |#memory_$Pointer$.base| v_main_~s~0.base_BEFORE_CALL_2) (_ bv4 32)) v_main_~s~0.base_BEFORE_CALL_2)) (= (select (select |#memory_$Pointer$.base| v_main_~s~0.base_BEFORE_CALL_2) (_ bv8 32)) (_ bv0 32)))) (= dll_update_at_~head.base (select (select |#memory_$Pointer$.base| |dll_update_at_#in~head.base|) (bvadd |dll_update_at_#in~head.offset| (_ bv4 32)))))} is VALID [2018-11-18 22:04:52,599 INFO L273 TraceCheckUtils]: 42: Hoare triple {3626#(and (= |old(#memory_int)| |#memory_int|) (exists ((v_subst_1 (_ BitVec 32)) (v_main_~s~0.base_BEFORE_CALL_2 (_ BitVec 32))) (and (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| v_main_~s~0.base_BEFORE_CALL_2) (_ bv4 32))) (bvadd v_subst_1 (_ bv8 32))) v_main_~s~0.base_BEFORE_CALL_2) (not (= (select (select |#memory_$Pointer$.base| v_main_~s~0.base_BEFORE_CALL_2) (_ bv4 32)) v_main_~s~0.base_BEFORE_CALL_2)) (= (select (select |#memory_$Pointer$.base| v_main_~s~0.base_BEFORE_CALL_2) (_ bv8 32)) (_ bv0 32)))) (= dll_update_at_~head.base (select (select |#memory_$Pointer$.base| |dll_update_at_#in~head.base|) (bvadd |dll_update_at_#in~head.offset| (_ bv4 32)))))} assume true; {3626#(and (= |old(#memory_int)| |#memory_int|) (exists ((v_subst_1 (_ BitVec 32)) (v_main_~s~0.base_BEFORE_CALL_2 (_ BitVec 32))) (and (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| v_main_~s~0.base_BEFORE_CALL_2) (_ bv4 32))) (bvadd v_subst_1 (_ bv8 32))) v_main_~s~0.base_BEFORE_CALL_2) (not (= (select (select |#memory_$Pointer$.base| v_main_~s~0.base_BEFORE_CALL_2) (_ bv4 32)) v_main_~s~0.base_BEFORE_CALL_2)) (= (select (select |#memory_$Pointer$.base| v_main_~s~0.base_BEFORE_CALL_2) (_ bv8 32)) (_ bv0 32)))) (= dll_update_at_~head.base (select (select |#memory_$Pointer$.base| |dll_update_at_#in~head.base|) (bvadd |dll_update_at_#in~head.offset| (_ bv4 32)))))} is VALID [2018-11-18 22:04:52,600 INFO L273 TraceCheckUtils]: 43: Hoare triple {3626#(and (= |old(#memory_int)| |#memory_int|) (exists ((v_subst_1 (_ BitVec 32)) (v_main_~s~0.base_BEFORE_CALL_2 (_ BitVec 32))) (and (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| v_main_~s~0.base_BEFORE_CALL_2) (_ bv4 32))) (bvadd v_subst_1 (_ bv8 32))) v_main_~s~0.base_BEFORE_CALL_2) (not (= (select (select |#memory_$Pointer$.base| v_main_~s~0.base_BEFORE_CALL_2) (_ bv4 32)) v_main_~s~0.base_BEFORE_CALL_2)) (= (select (select |#memory_$Pointer$.base| v_main_~s~0.base_BEFORE_CALL_2) (_ bv8 32)) (_ bv0 32)))) (= dll_update_at_~head.base (select (select |#memory_$Pointer$.base| |dll_update_at_#in~head.base|) (bvadd |dll_update_at_#in~head.offset| (_ bv4 32)))))} assume !~bvsgt32(~index, 0bv32); {3626#(and (= |old(#memory_int)| |#memory_int|) (exists ((v_subst_1 (_ BitVec 32)) (v_main_~s~0.base_BEFORE_CALL_2 (_ BitVec 32))) (and (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| v_main_~s~0.base_BEFORE_CALL_2) (_ bv4 32))) (bvadd v_subst_1 (_ bv8 32))) v_main_~s~0.base_BEFORE_CALL_2) (not (= (select (select |#memory_$Pointer$.base| v_main_~s~0.base_BEFORE_CALL_2) (_ bv4 32)) v_main_~s~0.base_BEFORE_CALL_2)) (= (select (select |#memory_$Pointer$.base| v_main_~s~0.base_BEFORE_CALL_2) (_ bv8 32)) (_ bv0 32)))) (= dll_update_at_~head.base (select (select |#memory_$Pointer$.base| |dll_update_at_#in~head.base|) (bvadd |dll_update_at_#in~head.offset| (_ bv4 32)))))} is VALID [2018-11-18 22:04:52,602 INFO L273 TraceCheckUtils]: 44: Hoare triple {3626#(and (= |old(#memory_int)| |#memory_int|) (exists ((v_subst_1 (_ BitVec 32)) (v_main_~s~0.base_BEFORE_CALL_2 (_ BitVec 32))) (and (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| v_main_~s~0.base_BEFORE_CALL_2) (_ bv4 32))) (bvadd v_subst_1 (_ bv8 32))) v_main_~s~0.base_BEFORE_CALL_2) (not (= (select (select |#memory_$Pointer$.base| v_main_~s~0.base_BEFORE_CALL_2) (_ bv4 32)) v_main_~s~0.base_BEFORE_CALL_2)) (= (select (select |#memory_$Pointer$.base| v_main_~s~0.base_BEFORE_CALL_2) (_ bv8 32)) (_ bv0 32)))) (= dll_update_at_~head.base (select (select |#memory_$Pointer$.base| |dll_update_at_#in~head.base|) (bvadd |dll_update_at_#in~head.offset| (_ bv4 32)))))} call write~intINTTYPE4(~data, ~head.base, ~head.offset, 4bv32); {3636#(and (exists ((v_subst_1 (_ BitVec 32)) (v_main_~s~0.base_BEFORE_CALL_2 (_ BitVec 32))) (and (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| v_main_~s~0.base_BEFORE_CALL_2) (_ bv4 32))) (bvadd v_subst_1 (_ bv8 32))) v_main_~s~0.base_BEFORE_CALL_2) (not (= (select (select |#memory_$Pointer$.base| v_main_~s~0.base_BEFORE_CALL_2) (_ bv4 32)) v_main_~s~0.base_BEFORE_CALL_2)) (= (select (select |#memory_$Pointer$.base| v_main_~s~0.base_BEFORE_CALL_2) (_ bv8 32)) (_ bv0 32)))) (exists ((dll_update_at_~head.offset (_ BitVec 32)) (dll_update_at_~data (_ BitVec 32))) (= |#memory_int| (store |old(#memory_int)| (select (select |#memory_$Pointer$.base| |dll_update_at_#in~head.base|) (bvadd |dll_update_at_#in~head.offset| (_ bv4 32))) (store (select |old(#memory_int)| (select (select |#memory_$Pointer$.base| |dll_update_at_#in~head.base|) (bvadd |dll_update_at_#in~head.offset| (_ bv4 32)))) dll_update_at_~head.offset dll_update_at_~data)))))} is VALID [2018-11-18 22:04:52,603 INFO L273 TraceCheckUtils]: 45: Hoare triple {3636#(and (exists ((v_subst_1 (_ BitVec 32)) (v_main_~s~0.base_BEFORE_CALL_2 (_ BitVec 32))) (and (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| v_main_~s~0.base_BEFORE_CALL_2) (_ bv4 32))) (bvadd v_subst_1 (_ bv8 32))) v_main_~s~0.base_BEFORE_CALL_2) (not (= (select (select |#memory_$Pointer$.base| v_main_~s~0.base_BEFORE_CALL_2) (_ bv4 32)) v_main_~s~0.base_BEFORE_CALL_2)) (= (select (select |#memory_$Pointer$.base| v_main_~s~0.base_BEFORE_CALL_2) (_ bv8 32)) (_ bv0 32)))) (exists ((dll_update_at_~head.offset (_ BitVec 32)) (dll_update_at_~data (_ BitVec 32))) (= |#memory_int| (store |old(#memory_int)| (select (select |#memory_$Pointer$.base| |dll_update_at_#in~head.base|) (bvadd |dll_update_at_#in~head.offset| (_ bv4 32))) (store (select |old(#memory_int)| (select (select |#memory_$Pointer$.base| |dll_update_at_#in~head.base|) (bvadd |dll_update_at_#in~head.offset| (_ bv4 32)))) dll_update_at_~head.offset dll_update_at_~data)))))} assume true; {3636#(and (exists ((v_subst_1 (_ BitVec 32)) (v_main_~s~0.base_BEFORE_CALL_2 (_ BitVec 32))) (and (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| v_main_~s~0.base_BEFORE_CALL_2) (_ bv4 32))) (bvadd v_subst_1 (_ bv8 32))) v_main_~s~0.base_BEFORE_CALL_2) (not (= (select (select |#memory_$Pointer$.base| v_main_~s~0.base_BEFORE_CALL_2) (_ bv4 32)) v_main_~s~0.base_BEFORE_CALL_2)) (= (select (select |#memory_$Pointer$.base| v_main_~s~0.base_BEFORE_CALL_2) (_ bv8 32)) (_ bv0 32)))) (exists ((dll_update_at_~head.offset (_ BitVec 32)) (dll_update_at_~data (_ BitVec 32))) (= |#memory_int| (store |old(#memory_int)| (select (select |#memory_$Pointer$.base| |dll_update_at_#in~head.base|) (bvadd |dll_update_at_#in~head.offset| (_ bv4 32))) (store (select |old(#memory_int)| (select (select |#memory_$Pointer$.base| |dll_update_at_#in~head.base|) (bvadd |dll_update_at_#in~head.offset| (_ bv4 32)))) dll_update_at_~head.offset dll_update_at_~data)))))} is VALID [2018-11-18 22:04:52,606 INFO L268 TraceCheckUtils]: 46: Hoare quadruple {3636#(and (exists ((v_subst_1 (_ BitVec 32)) (v_main_~s~0.base_BEFORE_CALL_2 (_ BitVec 32))) (and (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| v_main_~s~0.base_BEFORE_CALL_2) (_ bv4 32))) (bvadd v_subst_1 (_ bv8 32))) v_main_~s~0.base_BEFORE_CALL_2) (not (= (select (select |#memory_$Pointer$.base| v_main_~s~0.base_BEFORE_CALL_2) (_ bv4 32)) v_main_~s~0.base_BEFORE_CALL_2)) (= (select (select |#memory_$Pointer$.base| v_main_~s~0.base_BEFORE_CALL_2) (_ bv8 32)) (_ bv0 32)))) (exists ((dll_update_at_~head.offset (_ BitVec 32)) (dll_update_at_~data (_ BitVec 32))) (= |#memory_int| (store |old(#memory_int)| (select (select |#memory_$Pointer$.base| |dll_update_at_#in~head.base|) (bvadd |dll_update_at_#in~head.offset| (_ bv4 32))) (store (select |old(#memory_int)| (select (select |#memory_$Pointer$.base| |dll_update_at_#in~head.base|) (bvadd |dll_update_at_#in~head.offset| (_ bv4 32)))) dll_update_at_~head.offset dll_update_at_~data)))))} {3602#(and (not (= (select (select |#memory_$Pointer$.base| main_~s~0.base) (_ bv4 32)) main_~s~0.base)) (exists ((v_subst_1 (_ BitVec 32))) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~s~0.base) (_ bv4 32))) (bvadd v_subst_1 (_ bv8 32))) main_~s~0.base)) (= main_~s~0.offset (_ bv0 32)) (= (bvadd main_~len~0 (_ bv4294967294 32)) (_ bv0 32)) (= main_~len~0 (select (select |#memory_int| main_~s~0.base) main_~s~0.offset)) (= (_ bv0 32) (select (select |#memory_$Pointer$.base| main_~s~0.base) (_ bv8 32))))} #150#return; {3643#(and (= main_~s~0.offset (_ bv0 32)) (= (bvadd main_~len~0 (_ bv4294967294 32)) (_ bv0 32)) (= main_~len~0 (select (select |#memory_int| main_~s~0.base) main_~s~0.offset)))} is VALID [2018-11-18 22:04:52,608 INFO L273 TraceCheckUtils]: 47: Hoare triple {3643#(and (= main_~s~0.offset (_ bv0 32)) (= (bvadd main_~len~0 (_ bv4294967294 32)) (_ bv0 32)) (= main_~len~0 (select (select |#memory_int| main_~s~0.base) main_~s~0.offset)))} #t~post12 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post12);havoc #t~post12; {3643#(and (= main_~s~0.offset (_ bv0 32)) (= (bvadd main_~len~0 (_ bv4294967294 32)) (_ bv0 32)) (= main_~len~0 (select (select |#memory_int| main_~s~0.base) main_~s~0.offset)))} is VALID [2018-11-18 22:04:52,609 INFO L273 TraceCheckUtils]: 48: Hoare triple {3643#(and (= main_~s~0.offset (_ bv0 32)) (= (bvadd main_~len~0 (_ bv4294967294 32)) (_ bv0 32)) (= main_~len~0 (select (select |#memory_int| main_~s~0.base) main_~s~0.offset)))} assume true; {3643#(and (= main_~s~0.offset (_ bv0 32)) (= (bvadd main_~len~0 (_ bv4294967294 32)) (_ bv0 32)) (= main_~len~0 (select (select |#memory_int| main_~s~0.base) main_~s~0.offset)))} is VALID [2018-11-18 22:04:52,609 INFO L273 TraceCheckUtils]: 49: Hoare triple {3643#(and (= main_~s~0.offset (_ bv0 32)) (= (bvadd main_~len~0 (_ bv4294967294 32)) (_ bv0 32)) (= main_~len~0 (select (select |#memory_int| main_~s~0.base) main_~s~0.offset)))} assume !~bvslt32(~i~0, ~len~0); {3643#(and (= main_~s~0.offset (_ bv0 32)) (= (bvadd main_~len~0 (_ bv4294967294 32)) (_ bv0 32)) (= main_~len~0 (select (select |#memory_int| main_~s~0.base) main_~s~0.offset)))} is VALID [2018-11-18 22:04:52,610 INFO L273 TraceCheckUtils]: 50: Hoare triple {3643#(and (= main_~s~0.offset (_ bv0 32)) (= (bvadd main_~len~0 (_ bv4294967294 32)) (_ bv0 32)) (= main_~len~0 (select (select |#memory_int| main_~s~0.base) main_~s~0.offset)))} ~i~0 := 0bv32; {3656#(and (= main_~s~0.offset (_ bv0 32)) (= main_~i~0 (_ bv0 32)) (= (bvadd main_~len~0 (_ bv4294967294 32)) (_ bv0 32)) (= main_~len~0 (select (select |#memory_int| main_~s~0.base) main_~s~0.offset)))} is VALID [2018-11-18 22:04:52,610 INFO L273 TraceCheckUtils]: 51: Hoare triple {3656#(and (= main_~s~0.offset (_ bv0 32)) (= main_~i~0 (_ bv0 32)) (= (bvadd main_~len~0 (_ bv4294967294 32)) (_ bv0 32)) (= main_~len~0 (select (select |#memory_int| main_~s~0.base) main_~s~0.offset)))} assume true; {3656#(and (= main_~s~0.offset (_ bv0 32)) (= main_~i~0 (_ bv0 32)) (= (bvadd main_~len~0 (_ bv4294967294 32)) (_ bv0 32)) (= main_~len~0 (select (select |#memory_int| main_~s~0.base) main_~s~0.offset)))} is VALID [2018-11-18 22:04:52,611 INFO L273 TraceCheckUtils]: 52: Hoare triple {3656#(and (= main_~s~0.offset (_ bv0 32)) (= main_~i~0 (_ bv0 32)) (= (bvadd main_~len~0 (_ bv4294967294 32)) (_ bv0 32)) (= main_~len~0 (select (select |#memory_int| main_~s~0.base) main_~s~0.offset)))} assume !!~bvslt32(~i~0, ~len~0);~expected~0 := ~bvadd32(~i~0, ~len~0); {3663#(and (= (bvadd (select (select |#memory_int| main_~s~0.base) main_~s~0.offset) (_ bv4294967294 32)) (_ bv0 32)) (= main_~s~0.offset (_ bv0 32)) (= main_~expected~0 (select (select |#memory_int| main_~s~0.base) main_~s~0.offset)))} is VALID [2018-11-18 22:04:52,613 INFO L256 TraceCheckUtils]: 53: Hoare triple {3663#(and (= (bvadd (select (select |#memory_int| main_~s~0.base) main_~s~0.offset) (_ bv4294967294 32)) (_ bv0 32)) (= main_~s~0.offset (_ bv0 32)) (= main_~expected~0 (select (select |#memory_int| main_~s~0.base) main_~s~0.offset)))} call #t~ret14 := dll_get_data_at(~s~0.base, ~s~0.offset, ~i~0); {3667#(exists ((v_main_~s~0.base_BEFORE_CALL_3 (_ BitVec 32))) (= (bvadd (select (select |#memory_int| v_main_~s~0.base_BEFORE_CALL_3) (_ bv0 32)) (_ bv4294967294 32)) (_ bv0 32)))} is VALID [2018-11-18 22:04:52,620 INFO L273 TraceCheckUtils]: 54: Hoare triple {3667#(exists ((v_main_~s~0.base_BEFORE_CALL_3 (_ BitVec 32))) (= (bvadd (select (select |#memory_int| v_main_~s~0.base_BEFORE_CALL_3) (_ bv0 32)) (_ bv4294967294 32)) (_ bv0 32)))} ~head.base, ~head.offset := #in~head.base, #in~head.offset;~index := #in~index; {3671#(and (exists ((v_main_~s~0.base_BEFORE_CALL_3 (_ BitVec 32))) (= (bvadd (select (select |#memory_int| v_main_~s~0.base_BEFORE_CALL_3) (_ bv0 32)) (_ bv4294967294 32)) (_ bv0 32))) (= dll_get_data_at_~head.offset |dll_get_data_at_#in~head.offset|) (= |dll_get_data_at_#in~head.base| dll_get_data_at_~head.base))} is VALID [2018-11-18 22:04:52,620 INFO L273 TraceCheckUtils]: 55: Hoare triple {3671#(and (exists ((v_main_~s~0.base_BEFORE_CALL_3 (_ BitVec 32))) (= (bvadd (select (select |#memory_int| v_main_~s~0.base_BEFORE_CALL_3) (_ bv0 32)) (_ bv4294967294 32)) (_ bv0 32))) (= dll_get_data_at_~head.offset |dll_get_data_at_#in~head.offset|) (= |dll_get_data_at_#in~head.base| dll_get_data_at_~head.base))} assume true; {3671#(and (exists ((v_main_~s~0.base_BEFORE_CALL_3 (_ BitVec 32))) (= (bvadd (select (select |#memory_int| v_main_~s~0.base_BEFORE_CALL_3) (_ bv0 32)) (_ bv4294967294 32)) (_ bv0 32))) (= dll_get_data_at_~head.offset |dll_get_data_at_#in~head.offset|) (= |dll_get_data_at_#in~head.base| dll_get_data_at_~head.base))} is VALID [2018-11-18 22:04:52,622 INFO L273 TraceCheckUtils]: 56: Hoare triple {3671#(and (exists ((v_main_~s~0.base_BEFORE_CALL_3 (_ BitVec 32))) (= (bvadd (select (select |#memory_int| v_main_~s~0.base_BEFORE_CALL_3) (_ bv0 32)) (_ bv4294967294 32)) (_ bv0 32))) (= dll_get_data_at_~head.offset |dll_get_data_at_#in~head.offset|) (= |dll_get_data_at_#in~head.base| dll_get_data_at_~head.base))} assume !~bvsgt32(~index, 0bv32); {3671#(and (exists ((v_main_~s~0.base_BEFORE_CALL_3 (_ BitVec 32))) (= (bvadd (select (select |#memory_int| v_main_~s~0.base_BEFORE_CALL_3) (_ bv0 32)) (_ bv4294967294 32)) (_ bv0 32))) (= dll_get_data_at_~head.offset |dll_get_data_at_#in~head.offset|) (= |dll_get_data_at_#in~head.base| dll_get_data_at_~head.base))} is VALID [2018-11-18 22:04:52,622 INFO L273 TraceCheckUtils]: 57: Hoare triple {3671#(and (exists ((v_main_~s~0.base_BEFORE_CALL_3 (_ BitVec 32))) (= (bvadd (select (select |#memory_int| v_main_~s~0.base_BEFORE_CALL_3) (_ bv0 32)) (_ bv4294967294 32)) (_ bv0 32))) (= dll_get_data_at_~head.offset |dll_get_data_at_#in~head.offset|) (= |dll_get_data_at_#in~head.base| dll_get_data_at_~head.base))} call #t~mem8 := read~intINTTYPE4(~head.base, ~head.offset, 4bv32);#res := #t~mem8;havoc #t~mem8; {3681#(and (exists ((v_main_~s~0.base_BEFORE_CALL_3 (_ BitVec 32))) (= (bvadd (select (select |#memory_int| v_main_~s~0.base_BEFORE_CALL_3) (_ bv0 32)) (_ bv4294967294 32)) (_ bv0 32))) (= |dll_get_data_at_#res| (select (select |#memory_int| |dll_get_data_at_#in~head.base|) |dll_get_data_at_#in~head.offset|)))} is VALID [2018-11-18 22:04:52,623 INFO L273 TraceCheckUtils]: 58: Hoare triple {3681#(and (exists ((v_main_~s~0.base_BEFORE_CALL_3 (_ BitVec 32))) (= (bvadd (select (select |#memory_int| v_main_~s~0.base_BEFORE_CALL_3) (_ bv0 32)) (_ bv4294967294 32)) (_ bv0 32))) (= |dll_get_data_at_#res| (select (select |#memory_int| |dll_get_data_at_#in~head.base|) |dll_get_data_at_#in~head.offset|)))} assume true; {3681#(and (exists ((v_main_~s~0.base_BEFORE_CALL_3 (_ BitVec 32))) (= (bvadd (select (select |#memory_int| v_main_~s~0.base_BEFORE_CALL_3) (_ bv0 32)) (_ bv4294967294 32)) (_ bv0 32))) (= |dll_get_data_at_#res| (select (select |#memory_int| |dll_get_data_at_#in~head.base|) |dll_get_data_at_#in~head.offset|)))} is VALID [2018-11-18 22:04:52,644 INFO L268 TraceCheckUtils]: 59: Hoare quadruple {3681#(and (exists ((v_main_~s~0.base_BEFORE_CALL_3 (_ BitVec 32))) (= (bvadd (select (select |#memory_int| v_main_~s~0.base_BEFORE_CALL_3) (_ bv0 32)) (_ bv4294967294 32)) (_ bv0 32))) (= |dll_get_data_at_#res| (select (select |#memory_int| |dll_get_data_at_#in~head.base|) |dll_get_data_at_#in~head.offset|)))} {3663#(and (= (bvadd (select (select |#memory_int| main_~s~0.base) main_~s~0.offset) (_ bv4294967294 32)) (_ bv0 32)) (= main_~s~0.offset (_ bv0 32)) (= main_~expected~0 (select (select |#memory_int| main_~s~0.base) main_~s~0.offset)))} #152#return; {3688#(and (= (bvadd |main_#t~ret14| (_ bv4294967294 32)) (_ bv0 32)) (= |main_#t~ret14| main_~expected~0))} is VALID [2018-11-18 22:04:52,659 INFO L273 TraceCheckUtils]: 60: Hoare triple {3688#(and (= (bvadd |main_#t~ret14| (_ bv4294967294 32)) (_ bv0 32)) (= |main_#t~ret14| main_~expected~0))} assume ~expected~0 != #t~ret14;havoc #t~ret14; {3482#false} is VALID [2018-11-18 22:04:52,659 INFO L273 TraceCheckUtils]: 61: Hoare triple {3482#false} assume !false; {3482#false} is VALID [2018-11-18 22:04:52,688 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 5 proven. 23 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 22:04:52,689 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-18 22:04:55,760 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 22:04:55,760 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FPBP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-18 22:04:55,771 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 22:04:55,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 22:04:55,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 22:04:55,854 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 22:04:55,940 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-11-18 22:04:55,943 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-18 22:04:55,946 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 22:04:55,946 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-11-18 22:04:55,949 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-18 22:04:55,966 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 22:04:55,967 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 22:04:55,967 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 4 [2018-11-18 22:04:55,969 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-18 22:04:55,976 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 22:04:55,976 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:8 [2018-11-18 22:04:55,997 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 15 [2018-11-18 22:04:56,002 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 18 [2018-11-18 22:04:56,009 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 22:04:56,011 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 27 [2018-11-18 22:04:56,013 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-18 22:04:56,024 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 22:04:56,031 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 22:04:56,047 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-18 22:04:56,048 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 1 variables, input treesize:26, output treesize:26 [2018-11-18 22:04:56,096 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 39 [2018-11-18 22:04:56,103 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 15 [2018-11-18 22:04:56,104 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 22:04:56,119 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 22:04:56,145 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-18 22:04:56,145 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:48, output treesize:38 [2018-11-18 22:04:56,161 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-18 22:04:56,535 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-11-18 22:04:56,542 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-11-18 22:04:56,543 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 22:04:56,548 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 22:04:56,574 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-11-18 22:04:56,574 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:40, output treesize:36 [2018-11-18 22:04:56,943 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 7 [2018-11-18 22:04:56,944 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-18 22:04:56,966 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-11-18 22:04:56,966 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:41, output treesize:32 [2018-11-18 22:04:56,973 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-18 22:04:57,225 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 22:04:57,243 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 32 [2018-11-18 22:04:57,252 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 13 [2018-11-18 22:04:57,253 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 22:04:57,274 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 22:04:57,483 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 6 new quantified variables, introduced 4 case distinctions, treesize of input 70 treesize of output 90 [2018-11-18 22:04:57,687 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 66 treesize of output 59 [2018-11-18 22:04:57,714 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-18 22:04:59,299 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 66 treesize of output 57 [2018-11-18 22:04:59,305 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-11-18 22:05:00,624 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 40 [2018-11-18 22:05:00,626 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-11-18 22:05:01,741 INFO L682 Elim1Store]: detected equality via solver [2018-11-18 22:05:01,800 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 5 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 3 case distinctions, treesize of input 43 treesize of output 65 [2018-11-18 22:05:01,815 INFO L267 ElimStorePlain]: Start of recursive call 8: 8 dim-0 vars, End of recursive call: 8 dim-0 vars, and 8 xjuncts. [2018-11-18 22:05:04,333 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 72 treesize of output 61 [2018-11-18 22:05:04,338 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-11-18 22:05:06,565 INFO L682 Elim1Store]: detected equality via solver [2018-11-18 22:05:06,589 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 40 treesize of output 41 [2018-11-18 22:05:06,596 INFO L267 ElimStorePlain]: Start of recursive call 10: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2018-11-18 22:05:09,048 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 22:05:09,051 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 22:05:09,052 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 64 treesize of output 58 [2018-11-18 22:05:09,062 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2018-11-18 22:05:11,631 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 59 treesize of output 57 [2018-11-18 22:05:11,654 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 2 xjuncts. [2018-11-18 22:05:14,113 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 43 treesize of output 41 [2018-11-18 22:05:14,116 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 2 xjuncts. [2018-11-18 22:05:16,594 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 58 treesize of output 49 [2018-11-18 22:05:16,597 INFO L267 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 1 xjuncts. [2018-11-18 22:05:18,999 INFO L682 Elim1Store]: detected equality via solver [2018-11-18 22:05:19,007 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 33 [2018-11-18 22:05:19,010 INFO L267 ElimStorePlain]: Start of recursive call 15: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-18 22:05:19,015 INFO L682 Elim1Store]: detected equality via solver [2018-11-18 22:05:19,017 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 22:05:19,018 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 34 [2018-11-18 22:05:19,033 INFO L267 ElimStorePlain]: Start of recursive call 16: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-18 22:05:21,489 INFO L682 Elim1Store]: detected equality via solver [2018-11-18 22:05:21,498 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 39 [2018-11-18 22:05:21,502 INFO L267 ElimStorePlain]: Start of recursive call 17: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-18 22:05:24,002 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 60 treesize of output 64 [2018-11-18 22:05:24,011 INFO L267 ElimStorePlain]: Start of recursive call 18: End of recursive call: and 4 xjuncts. [2018-11-18 22:05:26,428 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 27 [2018-11-18 22:05:26,430 INFO L267 ElimStorePlain]: Start of recursive call 19: End of recursive call: and 1 xjuncts. [2018-11-18 22:05:28,845 INFO L682 Elim1Store]: detected equality via solver [2018-11-18 22:05:28,935 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 22:05:28,951 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 22:05:28,952 INFO L303 Elim1Store]: Index analysis took 115 ms [2018-11-18 22:05:28,977 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 7 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 47 treesize of output 65 [2018-11-18 22:05:29,012 INFO L267 ElimStorePlain]: Start of recursive call 20: 4 dim-0 vars, End of recursive call: 4 dim-0 vars, and 4 xjuncts. [2018-11-18 22:05:32,365 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 58 treesize of output 51 [2018-11-18 22:05:32,368 INFO L267 ElimStorePlain]: Start of recursive call 21: End of recursive call: and 1 xjuncts. [2018-11-18 22:05:35,010 INFO L682 Elim1Store]: detected equality via solver [2018-11-18 22:05:35,020 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 58 treesize of output 52 [2018-11-18 22:05:35,025 INFO L267 ElimStorePlain]: Start of recursive call 22: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-18 22:05:37,882 INFO L682 Elim1Store]: detected equality via solver [2018-11-18 22:05:37,942 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 22:05:37,961 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 22:05:37,987 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 7 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 47 treesize of output 65 [2018-11-18 22:05:38,000 INFO L267 ElimStorePlain]: Start of recursive call 23: 4 dim-0 vars, End of recursive call: 4 dim-0 vars, and 4 xjuncts. [2018-11-18 22:05:41,458 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 22:05:41,472 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 22:05:41,497 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 47 treesize of output 64 [2018-11-18 22:05:41,503 INFO L267 ElimStorePlain]: Start of recursive call 24: End of recursive call: and 4 xjuncts. [2018-11-18 22:05:44,667 INFO L682 Elim1Store]: detected equality via solver [2018-11-18 22:05:44,674 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 20 [2018-11-18 22:05:44,678 INFO L267 ElimStorePlain]: Start of recursive call 25: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-18 22:05:44,685 INFO L682 Elim1Store]: detected equality via solver [2018-11-18 22:05:44,691 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 29 [2018-11-18 22:05:44,698 INFO L267 ElimStorePlain]: Start of recursive call 26: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-18 22:05:48,057 INFO L682 Elim1Store]: detected equality via solver [2018-11-18 22:05:48,066 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 33 [2018-11-18 22:05:48,070 INFO L267 ElimStorePlain]: Start of recursive call 27: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-18 22:05:51,343 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 20 [2018-11-18 22:05:51,344 INFO L267 ElimStorePlain]: Start of recursive call 28: End of recursive call: and 1 xjuncts. [2018-11-18 22:05:54,528 INFO L682 Elim1Store]: detected equality via solver [2018-11-18 22:05:54,536 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 22:05:54,538 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 22:05:54,546 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 22:05:54,555 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 37 treesize of output 50 [2018-11-18 22:05:54,563 INFO L267 ElimStorePlain]: Start of recursive call 29: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-11-18 22:05:54,569 INFO L682 Elim1Store]: detected equality via solver [2018-11-18 22:05:54,626 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 3 case distinctions, treesize of input 40 treesize of output 49 [2018-11-18 22:05:54,644 INFO L267 ElimStorePlain]: Start of recursive call 30: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 4 xjuncts. [2018-11-18 22:05:57,935 INFO L267 ElimStorePlain]: Start of recursive call 4: 23 dim-1 vars, End of recursive call: 28 dim-0 vars, and 31 xjuncts. [2018-11-18 22:06:01,720 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 2 dim-2 vars, End of recursive call: and 3 xjuncts. [2018-11-18 22:06:01,721 INFO L202 ElimStorePlain]: Needed 30 recursive calls to eliminate 7 variables, input treesize:95, output treesize:56 [2018-11-18 22:06:01,746 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-18 22:06:01,908 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 31 [2018-11-18 22:06:01,917 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 11 [2018-11-18 22:06:01,931 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 22:06:01,957 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 9 [2018-11-18 22:06:01,959 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-18 22:06:01,970 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 22:06:01,976 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-18 22:06:01,976 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:31, output treesize:9 [2018-11-18 22:06:01,982 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-18 22:06:01,983 INFO L256 TraceCheckUtils]: 0: Hoare triple {3481#true} call ULTIMATE.init(); {3481#true} is VALID [2018-11-18 22:06:01,983 INFO L273 TraceCheckUtils]: 1: Hoare triple {3481#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {3481#true} is VALID [2018-11-18 22:06:01,984 INFO L273 TraceCheckUtils]: 2: Hoare triple {3481#true} assume true; {3481#true} is VALID [2018-11-18 22:06:01,984 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {3481#true} {3481#true} #158#return; {3481#true} is VALID [2018-11-18 22:06:01,984 INFO L256 TraceCheckUtils]: 4: Hoare triple {3481#true} call #t~ret15 := main(); {3481#true} is VALID [2018-11-18 22:06:01,984 INFO L273 TraceCheckUtils]: 5: Hoare triple {3481#true} ~len~0 := 2bv32;~data~0 := 1bv32; {3501#(= (bvadd main_~len~0 (_ bv4294967294 32)) (_ bv0 32))} is VALID [2018-11-18 22:06:01,984 INFO L256 TraceCheckUtils]: 6: Hoare triple {3501#(= (bvadd main_~len~0 (_ bv4294967294 32)) (_ bv0 32))} call #t~ret11.base, #t~ret11.offset := dll_create(~len~0, ~data~0); {3481#true} is VALID [2018-11-18 22:06:01,985 INFO L273 TraceCheckUtils]: 7: Hoare triple {3481#true} ~len := #in~len;~data := #in~data;~head~0.base, ~head~0.offset := 0bv32, 0bv32; {3481#true} is VALID [2018-11-18 22:06:01,985 INFO L273 TraceCheckUtils]: 8: Hoare triple {3481#true} assume true; {3481#true} is VALID [2018-11-18 22:06:01,986 INFO L273 TraceCheckUtils]: 9: Hoare triple {3481#true} assume !!~bvsgt32(~len, 0bv32);call #t~malloc3.base, #t~malloc3.offset := #Ultimate.alloc(12bv32);~new_head~0.base, ~new_head~0.offset := #t~malloc3.base, #t~malloc3.offset; {3514#(= (_ bv1 1) (select |#valid| dll_create_~new_head~0.base))} is VALID [2018-11-18 22:06:01,986 INFO L273 TraceCheckUtils]: 10: Hoare triple {3514#(= (_ bv1 1) (select |#valid| dll_create_~new_head~0.base))} assume !(0bv32 == ~new_head~0.base && 0bv32 == ~new_head~0.offset); {3514#(= (_ bv1 1) (select |#valid| dll_create_~new_head~0.base))} is VALID [2018-11-18 22:06:01,987 INFO L273 TraceCheckUtils]: 11: Hoare triple {3514#(= (_ bv1 1) (select |#valid| dll_create_~new_head~0.base))} call write~intINTTYPE4(~data, ~new_head~0.base, ~new_head~0.offset, 4bv32);call write~$Pointer$(~head~0.base, ~head~0.offset, ~new_head~0.base, ~bvadd32(4bv32, ~new_head~0.offset), 4bv32);call write~$Pointer$(0bv32, 0bv32, ~new_head~0.base, ~bvadd32(8bv32, ~new_head~0.offset), 4bv32); {3514#(= (_ bv1 1) (select |#valid| dll_create_~new_head~0.base))} is VALID [2018-11-18 22:06:01,987 INFO L273 TraceCheckUtils]: 12: Hoare triple {3514#(= (_ bv1 1) (select |#valid| dll_create_~new_head~0.base))} assume !(~head~0.base != 0bv32 || ~head~0.offset != 0bv32); {3514#(= (_ bv1 1) (select |#valid| dll_create_~new_head~0.base))} is VALID [2018-11-18 22:06:01,989 INFO L273 TraceCheckUtils]: 13: Hoare triple {3514#(= (_ bv1 1) (select |#valid| dll_create_~new_head~0.base))} ~head~0.base, ~head~0.offset := ~new_head~0.base, ~new_head~0.offset;#t~post4 := ~len;~len := ~bvsub32(#t~post4, 1bv32);havoc #t~post4; {3527#(= (bvadd (select |#valid| dll_create_~head~0.base) (_ bv1 1)) (_ bv0 1))} is VALID [2018-11-18 22:06:01,990 INFO L273 TraceCheckUtils]: 14: Hoare triple {3527#(= (bvadd (select |#valid| dll_create_~head~0.base) (_ bv1 1)) (_ bv0 1))} assume true; {3527#(= (bvadd (select |#valid| dll_create_~head~0.base) (_ bv1 1)) (_ bv0 1))} is VALID [2018-11-18 22:06:01,991 INFO L273 TraceCheckUtils]: 15: Hoare triple {3527#(= (bvadd (select |#valid| dll_create_~head~0.base) (_ bv1 1)) (_ bv0 1))} assume !!~bvsgt32(~len, 0bv32);call #t~malloc3.base, #t~malloc3.offset := #Ultimate.alloc(12bv32);~new_head~0.base, ~new_head~0.offset := #t~malloc3.base, #t~malloc3.offset; {3534#(and (= (_ bv0 32) dll_create_~new_head~0.offset) (not (= dll_create_~new_head~0.base dll_create_~head~0.base)))} is VALID [2018-11-18 22:06:01,992 INFO L273 TraceCheckUtils]: 16: Hoare triple {3534#(and (= (_ bv0 32) dll_create_~new_head~0.offset) (not (= dll_create_~new_head~0.base dll_create_~head~0.base)))} assume !(0bv32 == ~new_head~0.base && 0bv32 == ~new_head~0.offset); {3534#(and (= (_ bv0 32) dll_create_~new_head~0.offset) (not (= dll_create_~new_head~0.base dll_create_~head~0.base)))} is VALID [2018-11-18 22:06:01,994 INFO L273 TraceCheckUtils]: 17: Hoare triple {3534#(and (= (_ bv0 32) dll_create_~new_head~0.offset) (not (= dll_create_~new_head~0.base dll_create_~head~0.base)))} call write~intINTTYPE4(~data, ~new_head~0.base, ~new_head~0.offset, 4bv32);call write~$Pointer$(~head~0.base, ~head~0.offset, ~new_head~0.base, ~bvadd32(4bv32, ~new_head~0.offset), 4bv32);call write~$Pointer$(0bv32, 0bv32, ~new_head~0.base, ~bvadd32(8bv32, ~new_head~0.offset), 4bv32); {3541#(and (= (_ bv0 32) dll_create_~new_head~0.offset) (= (select (select |#memory_$Pointer$.base| dll_create_~new_head~0.base) (bvadd dll_create_~new_head~0.offset (_ bv4 32))) dll_create_~head~0.base) (not (= dll_create_~new_head~0.base dll_create_~head~0.base)) (= (_ bv0 32) (select (select |#memory_$Pointer$.base| dll_create_~new_head~0.base) (bvadd dll_create_~new_head~0.offset (_ bv8 32)))))} is VALID [2018-11-18 22:06:01,996 INFO L273 TraceCheckUtils]: 18: Hoare triple {3541#(and (= (_ bv0 32) dll_create_~new_head~0.offset) (= (select (select |#memory_$Pointer$.base| dll_create_~new_head~0.base) (bvadd dll_create_~new_head~0.offset (_ bv4 32))) dll_create_~head~0.base) (not (= dll_create_~new_head~0.base dll_create_~head~0.base)) (= (_ bv0 32) (select (select |#memory_$Pointer$.base| dll_create_~new_head~0.base) (bvadd dll_create_~new_head~0.offset (_ bv8 32)))))} assume ~head~0.base != 0bv32 || ~head~0.offset != 0bv32;call write~$Pointer$(~new_head~0.base, ~new_head~0.offset, ~head~0.base, ~bvadd32(8bv32, ~head~0.offset), 4bv32); {3545#(and (= (_ bv0 32) dll_create_~new_head~0.offset) (exists ((dll_create_~head~0.offset (_ BitVec 32))) (= dll_create_~new_head~0.base (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| dll_create_~new_head~0.base) (bvadd dll_create_~new_head~0.offset (_ bv4 32)))) (bvadd dll_create_~head~0.offset (_ bv8 32))))) (not (= dll_create_~new_head~0.base (select (select |#memory_$Pointer$.base| dll_create_~new_head~0.base) (bvadd dll_create_~new_head~0.offset (_ bv4 32))))) (= (_ bv0 32) (select (select |#memory_$Pointer$.base| dll_create_~new_head~0.base) (bvadd dll_create_~new_head~0.offset (_ bv8 32)))))} is VALID [2018-11-18 22:06:01,999 INFO L273 TraceCheckUtils]: 19: Hoare triple {3545#(and (= (_ bv0 32) dll_create_~new_head~0.offset) (exists ((dll_create_~head~0.offset (_ BitVec 32))) (= dll_create_~new_head~0.base (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| dll_create_~new_head~0.base) (bvadd dll_create_~new_head~0.offset (_ bv4 32)))) (bvadd dll_create_~head~0.offset (_ bv8 32))))) (not (= dll_create_~new_head~0.base (select (select |#memory_$Pointer$.base| dll_create_~new_head~0.base) (bvadd dll_create_~new_head~0.offset (_ bv4 32))))) (= (_ bv0 32) (select (select |#memory_$Pointer$.base| dll_create_~new_head~0.base) (bvadd dll_create_~new_head~0.offset (_ bv8 32)))))} ~head~0.base, ~head~0.offset := ~new_head~0.base, ~new_head~0.offset;#t~post4 := ~len;~len := ~bvsub32(#t~post4, 1bv32);havoc #t~post4; {3549#(and (= (_ bv0 32) (select (select |#memory_$Pointer$.base| dll_create_~head~0.base) (bvadd dll_create_~head~0.offset (_ bv8 32)))) (= (_ bv0 32) dll_create_~head~0.offset) (exists ((v_subst_1 (_ BitVec 32))) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| dll_create_~head~0.base) (bvadd dll_create_~head~0.offset (_ bv4 32)))) (bvadd v_subst_1 (_ bv8 32))) dll_create_~head~0.base)) (not (= (select (select |#memory_$Pointer$.base| dll_create_~head~0.base) (bvadd dll_create_~head~0.offset (_ bv4 32))) dll_create_~head~0.base)))} is VALID [2018-11-18 22:06:02,000 INFO L273 TraceCheckUtils]: 20: Hoare triple {3549#(and (= (_ bv0 32) (select (select |#memory_$Pointer$.base| dll_create_~head~0.base) (bvadd dll_create_~head~0.offset (_ bv8 32)))) (= (_ bv0 32) dll_create_~head~0.offset) (exists ((v_subst_1 (_ BitVec 32))) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| dll_create_~head~0.base) (bvadd dll_create_~head~0.offset (_ bv4 32)))) (bvadd v_subst_1 (_ bv8 32))) dll_create_~head~0.base)) (not (= (select (select |#memory_$Pointer$.base| dll_create_~head~0.base) (bvadd dll_create_~head~0.offset (_ bv4 32))) dll_create_~head~0.base)))} assume true; {3549#(and (= (_ bv0 32) (select (select |#memory_$Pointer$.base| dll_create_~head~0.base) (bvadd dll_create_~head~0.offset (_ bv8 32)))) (= (_ bv0 32) dll_create_~head~0.offset) (exists ((v_subst_1 (_ BitVec 32))) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| dll_create_~head~0.base) (bvadd dll_create_~head~0.offset (_ bv4 32)))) (bvadd v_subst_1 (_ bv8 32))) dll_create_~head~0.base)) (not (= (select (select |#memory_$Pointer$.base| dll_create_~head~0.base) (bvadd dll_create_~head~0.offset (_ bv4 32))) dll_create_~head~0.base)))} is VALID [2018-11-18 22:06:02,001 INFO L273 TraceCheckUtils]: 21: Hoare triple {3549#(and (= (_ bv0 32) (select (select |#memory_$Pointer$.base| dll_create_~head~0.base) (bvadd dll_create_~head~0.offset (_ bv8 32)))) (= (_ bv0 32) dll_create_~head~0.offset) (exists ((v_subst_1 (_ BitVec 32))) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| dll_create_~head~0.base) (bvadd dll_create_~head~0.offset (_ bv4 32)))) (bvadd v_subst_1 (_ bv8 32))) dll_create_~head~0.base)) (not (= (select (select |#memory_$Pointer$.base| dll_create_~head~0.base) (bvadd dll_create_~head~0.offset (_ bv4 32))) dll_create_~head~0.base)))} assume !~bvsgt32(~len, 0bv32); {3549#(and (= (_ bv0 32) (select (select |#memory_$Pointer$.base| dll_create_~head~0.base) (bvadd dll_create_~head~0.offset (_ bv8 32)))) (= (_ bv0 32) dll_create_~head~0.offset) (exists ((v_subst_1 (_ BitVec 32))) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| dll_create_~head~0.base) (bvadd dll_create_~head~0.offset (_ bv4 32)))) (bvadd v_subst_1 (_ bv8 32))) dll_create_~head~0.base)) (not (= (select (select |#memory_$Pointer$.base| dll_create_~head~0.base) (bvadd dll_create_~head~0.offset (_ bv4 32))) dll_create_~head~0.base)))} is VALID [2018-11-18 22:06:02,003 INFO L273 TraceCheckUtils]: 22: Hoare triple {3549#(and (= (_ bv0 32) (select (select |#memory_$Pointer$.base| dll_create_~head~0.base) (bvadd dll_create_~head~0.offset (_ bv8 32)))) (= (_ bv0 32) dll_create_~head~0.offset) (exists ((v_subst_1 (_ BitVec 32))) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| dll_create_~head~0.base) (bvadd dll_create_~head~0.offset (_ bv4 32)))) (bvadd v_subst_1 (_ bv8 32))) dll_create_~head~0.base)) (not (= (select (select |#memory_$Pointer$.base| dll_create_~head~0.base) (bvadd dll_create_~head~0.offset (_ bv4 32))) dll_create_~head~0.base)))} #res.base, #res.offset := ~head~0.base, ~head~0.offset; {3559#(and (= |dll_create_#res.offset| (_ bv0 32)) (not (= (select (select |#memory_$Pointer$.base| |dll_create_#res.base|) (bvadd |dll_create_#res.offset| (_ bv4 32))) |dll_create_#res.base|)) (= (_ bv0 32) (select (select |#memory_$Pointer$.base| |dll_create_#res.base|) (bvadd |dll_create_#res.offset| (_ bv8 32)))) (exists ((v_subst_1 (_ BitVec 32))) (= |dll_create_#res.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |dll_create_#res.base|) (bvadd |dll_create_#res.offset| (_ bv4 32)))) (bvadd v_subst_1 (_ bv8 32))))))} is VALID [2018-11-18 22:06:02,006 INFO L273 TraceCheckUtils]: 23: Hoare triple {3559#(and (= |dll_create_#res.offset| (_ bv0 32)) (not (= (select (select |#memory_$Pointer$.base| |dll_create_#res.base|) (bvadd |dll_create_#res.offset| (_ bv4 32))) |dll_create_#res.base|)) (= (_ bv0 32) (select (select |#memory_$Pointer$.base| |dll_create_#res.base|) (bvadd |dll_create_#res.offset| (_ bv8 32)))) (exists ((v_subst_1 (_ BitVec 32))) (= |dll_create_#res.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |dll_create_#res.base|) (bvadd |dll_create_#res.offset| (_ bv4 32)))) (bvadd v_subst_1 (_ bv8 32))))))} assume true; {3559#(and (= |dll_create_#res.offset| (_ bv0 32)) (not (= (select (select |#memory_$Pointer$.base| |dll_create_#res.base|) (bvadd |dll_create_#res.offset| (_ bv4 32))) |dll_create_#res.base|)) (= (_ bv0 32) (select (select |#memory_$Pointer$.base| |dll_create_#res.base|) (bvadd |dll_create_#res.offset| (_ bv8 32)))) (exists ((v_subst_1 (_ BitVec 32))) (= |dll_create_#res.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |dll_create_#res.base|) (bvadd |dll_create_#res.offset| (_ bv4 32)))) (bvadd v_subst_1 (_ bv8 32))))))} is VALID [2018-11-18 22:06:02,009 INFO L268 TraceCheckUtils]: 24: Hoare quadruple {3559#(and (= |dll_create_#res.offset| (_ bv0 32)) (not (= (select (select |#memory_$Pointer$.base| |dll_create_#res.base|) (bvadd |dll_create_#res.offset| (_ bv4 32))) |dll_create_#res.base|)) (= (_ bv0 32) (select (select |#memory_$Pointer$.base| |dll_create_#res.base|) (bvadd |dll_create_#res.offset| (_ bv8 32)))) (exists ((v_subst_1 (_ BitVec 32))) (= |dll_create_#res.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |dll_create_#res.base|) (bvadd |dll_create_#res.offset| (_ bv4 32)))) (bvadd v_subst_1 (_ bv8 32))))))} {3501#(= (bvadd main_~len~0 (_ bv4294967294 32)) (_ bv0 32))} #148#return; {3566#(and (not (= |main_#t~ret11.base| (select (select |#memory_$Pointer$.base| |main_#t~ret11.base|) (bvadd |main_#t~ret11.offset| (_ bv4 32))))) (= |main_#t~ret11.offset| (_ bv0 32)) (= (bvadd main_~len~0 (_ bv4294967294 32)) (_ bv0 32)) (exists ((v_subst_1 (_ BitVec 32))) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_#t~ret11.base|) (bvadd |main_#t~ret11.offset| (_ bv4 32)))) (bvadd v_subst_1 (_ bv8 32))) |main_#t~ret11.base|)) (= (_ bv0 32) (select (select |#memory_$Pointer$.base| |main_#t~ret11.base|) (bvadd |main_#t~ret11.offset| (_ bv8 32)))))} is VALID [2018-11-18 22:06:02,011 INFO L273 TraceCheckUtils]: 25: Hoare triple {3566#(and (not (= |main_#t~ret11.base| (select (select |#memory_$Pointer$.base| |main_#t~ret11.base|) (bvadd |main_#t~ret11.offset| (_ bv4 32))))) (= |main_#t~ret11.offset| (_ bv0 32)) (= (bvadd main_~len~0 (_ bv4294967294 32)) (_ bv0 32)) (exists ((v_subst_1 (_ BitVec 32))) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_#t~ret11.base|) (bvadd |main_#t~ret11.offset| (_ bv4 32)))) (bvadd v_subst_1 (_ bv8 32))) |main_#t~ret11.base|)) (= (_ bv0 32) (select (select |#memory_$Pointer$.base| |main_#t~ret11.base|) (bvadd |main_#t~ret11.offset| (_ bv8 32)))))} ~s~0.base, ~s~0.offset := #t~ret11.base, #t~ret11.offset;havoc #t~ret11.base, #t~ret11.offset;havoc ~i~0;~i~0 := 0bv32; {3570#(and (not (= (select (select |#memory_$Pointer$.base| main_~s~0.base) (_ bv4 32)) main_~s~0.base)) (exists ((v_subst_1 (_ BitVec 32))) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~s~0.base) (_ bv4 32))) (bvadd v_subst_1 (_ bv8 32))) main_~s~0.base)) (= main_~s~0.offset (_ bv0 32)) (= main_~i~0 (_ bv0 32)) (= (bvadd main_~len~0 (_ bv4294967294 32)) (_ bv0 32)) (= (_ bv0 32) (select (select |#memory_$Pointer$.base| main_~s~0.base) (_ bv8 32))))} is VALID [2018-11-18 22:06:02,012 INFO L273 TraceCheckUtils]: 26: Hoare triple {3570#(and (not (= (select (select |#memory_$Pointer$.base| main_~s~0.base) (_ bv4 32)) main_~s~0.base)) (exists ((v_subst_1 (_ BitVec 32))) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~s~0.base) (_ bv4 32))) (bvadd v_subst_1 (_ bv8 32))) main_~s~0.base)) (= main_~s~0.offset (_ bv0 32)) (= main_~i~0 (_ bv0 32)) (= (bvadd main_~len~0 (_ bv4294967294 32)) (_ bv0 32)) (= (_ bv0 32) (select (select |#memory_$Pointer$.base| main_~s~0.base) (_ bv8 32))))} assume true; {3570#(and (not (= (select (select |#memory_$Pointer$.base| main_~s~0.base) (_ bv4 32)) main_~s~0.base)) (exists ((v_subst_1 (_ BitVec 32))) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~s~0.base) (_ bv4 32))) (bvadd v_subst_1 (_ bv8 32))) main_~s~0.base)) (= main_~s~0.offset (_ bv0 32)) (= main_~i~0 (_ bv0 32)) (= (bvadd main_~len~0 (_ bv4294967294 32)) (_ bv0 32)) (= (_ bv0 32) (select (select |#memory_$Pointer$.base| main_~s~0.base) (_ bv8 32))))} is VALID [2018-11-18 22:06:02,013 INFO L273 TraceCheckUtils]: 27: Hoare triple {3570#(and (not (= (select (select |#memory_$Pointer$.base| main_~s~0.base) (_ bv4 32)) main_~s~0.base)) (exists ((v_subst_1 (_ BitVec 32))) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~s~0.base) (_ bv4 32))) (bvadd v_subst_1 (_ bv8 32))) main_~s~0.base)) (= main_~s~0.offset (_ bv0 32)) (= main_~i~0 (_ bv0 32)) (= (bvadd main_~len~0 (_ bv4294967294 32)) (_ bv0 32)) (= (_ bv0 32) (select (select |#memory_$Pointer$.base| main_~s~0.base) (_ bv8 32))))} assume !!~bvslt32(~i~0, ~len~0);~new_data~0 := ~bvadd32(~i~0, ~len~0); {3577#(and (not (= (select (select |#memory_$Pointer$.base| main_~s~0.base) (_ bv4 32)) main_~s~0.base)) (exists ((v_subst_1 (_ BitVec 32))) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~s~0.base) (_ bv4 32))) (bvadd v_subst_1 (_ bv8 32))) main_~s~0.base)) (= main_~len~0 main_~new_data~0) (= main_~s~0.offset (_ bv0 32)) (= (bvadd main_~len~0 (_ bv4294967294 32)) (_ bv0 32)) (= (_ bv0 32) (select (select |#memory_$Pointer$.base| main_~s~0.base) (_ bv8 32))))} is VALID [2018-11-18 22:06:02,017 INFO L256 TraceCheckUtils]: 28: Hoare triple {3577#(and (not (= (select (select |#memory_$Pointer$.base| main_~s~0.base) (_ bv4 32)) main_~s~0.base)) (exists ((v_subst_1 (_ BitVec 32))) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~s~0.base) (_ bv4 32))) (bvadd v_subst_1 (_ bv8 32))) main_~s~0.base)) (= main_~len~0 main_~new_data~0) (= main_~s~0.offset (_ bv0 32)) (= (bvadd main_~len~0 (_ bv4294967294 32)) (_ bv0 32)) (= (_ bv0 32) (select (select |#memory_$Pointer$.base| main_~s~0.base) (_ bv8 32))))} call dll_update_at(~s~0.base, ~s~0.offset, ~new_data~0, ~i~0); {3581#(exists ((v_subst_1 (_ BitVec 32)) (v_main_~s~0.base_BEFORE_CALL_1 (_ BitVec 32))) (and (= (select (select |#memory_$Pointer$.base| v_main_~s~0.base_BEFORE_CALL_1) (_ bv8 32)) (_ bv0 32)) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| v_main_~s~0.base_BEFORE_CALL_1) (_ bv4 32))) (bvadd v_subst_1 (_ bv8 32))) v_main_~s~0.base_BEFORE_CALL_1) (not (= (select (select |#memory_$Pointer$.base| v_main_~s~0.base_BEFORE_CALL_1) (_ bv4 32)) v_main_~s~0.base_BEFORE_CALL_1))))} is VALID [2018-11-18 22:06:02,018 INFO L273 TraceCheckUtils]: 29: Hoare triple {3581#(exists ((v_subst_1 (_ BitVec 32)) (v_main_~s~0.base_BEFORE_CALL_1 (_ BitVec 32))) (and (= (select (select |#memory_$Pointer$.base| v_main_~s~0.base_BEFORE_CALL_1) (_ bv8 32)) (_ bv0 32)) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| v_main_~s~0.base_BEFORE_CALL_1) (_ bv4 32))) (bvadd v_subst_1 (_ bv8 32))) v_main_~s~0.base_BEFORE_CALL_1) (not (= (select (select |#memory_$Pointer$.base| v_main_~s~0.base_BEFORE_CALL_1) (_ bv4 32)) v_main_~s~0.base_BEFORE_CALL_1))))} ~head.base, ~head.offset := #in~head.base, #in~head.offset;~data := #in~data;~index := #in~index; {3585#(and (exists ((v_subst_1 (_ BitVec 32)) (v_main_~s~0.base_BEFORE_CALL_1 (_ BitVec 32))) (and (= (select (select |#memory_$Pointer$.base| v_main_~s~0.base_BEFORE_CALL_1) (_ bv8 32)) (_ bv0 32)) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| v_main_~s~0.base_BEFORE_CALL_1) (_ bv4 32))) (bvadd v_subst_1 (_ bv8 32))) v_main_~s~0.base_BEFORE_CALL_1) (not (= (select (select |#memory_$Pointer$.base| v_main_~s~0.base_BEFORE_CALL_1) (_ bv4 32)) v_main_~s~0.base_BEFORE_CALL_1)))) (= dll_update_at_~data |dll_update_at_#in~data|) (= dll_update_at_~head.offset |dll_update_at_#in~head.offset|) (= |dll_update_at_#in~head.base| dll_update_at_~head.base))} is VALID [2018-11-18 22:06:02,019 INFO L273 TraceCheckUtils]: 30: Hoare triple {3585#(and (exists ((v_subst_1 (_ BitVec 32)) (v_main_~s~0.base_BEFORE_CALL_1 (_ BitVec 32))) (and (= (select (select |#memory_$Pointer$.base| v_main_~s~0.base_BEFORE_CALL_1) (_ bv8 32)) (_ bv0 32)) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| v_main_~s~0.base_BEFORE_CALL_1) (_ bv4 32))) (bvadd v_subst_1 (_ bv8 32))) v_main_~s~0.base_BEFORE_CALL_1) (not (= (select (select |#memory_$Pointer$.base| v_main_~s~0.base_BEFORE_CALL_1) (_ bv4 32)) v_main_~s~0.base_BEFORE_CALL_1)))) (= dll_update_at_~data |dll_update_at_#in~data|) (= dll_update_at_~head.offset |dll_update_at_#in~head.offset|) (= |dll_update_at_#in~head.base| dll_update_at_~head.base))} assume true; {3585#(and (exists ((v_subst_1 (_ BitVec 32)) (v_main_~s~0.base_BEFORE_CALL_1 (_ BitVec 32))) (and (= (select (select |#memory_$Pointer$.base| v_main_~s~0.base_BEFORE_CALL_1) (_ bv8 32)) (_ bv0 32)) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| v_main_~s~0.base_BEFORE_CALL_1) (_ bv4 32))) (bvadd v_subst_1 (_ bv8 32))) v_main_~s~0.base_BEFORE_CALL_1) (not (= (select (select |#memory_$Pointer$.base| v_main_~s~0.base_BEFORE_CALL_1) (_ bv4 32)) v_main_~s~0.base_BEFORE_CALL_1)))) (= dll_update_at_~data |dll_update_at_#in~data|) (= dll_update_at_~head.offset |dll_update_at_#in~head.offset|) (= |dll_update_at_#in~head.base| dll_update_at_~head.base))} is VALID [2018-11-18 22:06:02,019 INFO L273 TraceCheckUtils]: 31: Hoare triple {3585#(and (exists ((v_subst_1 (_ BitVec 32)) (v_main_~s~0.base_BEFORE_CALL_1 (_ BitVec 32))) (and (= (select (select |#memory_$Pointer$.base| v_main_~s~0.base_BEFORE_CALL_1) (_ bv8 32)) (_ bv0 32)) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| v_main_~s~0.base_BEFORE_CALL_1) (_ bv4 32))) (bvadd v_subst_1 (_ bv8 32))) v_main_~s~0.base_BEFORE_CALL_1) (not (= (select (select |#memory_$Pointer$.base| v_main_~s~0.base_BEFORE_CALL_1) (_ bv4 32)) v_main_~s~0.base_BEFORE_CALL_1)))) (= dll_update_at_~data |dll_update_at_#in~data|) (= dll_update_at_~head.offset |dll_update_at_#in~head.offset|) (= |dll_update_at_#in~head.base| dll_update_at_~head.base))} assume !~bvsgt32(~index, 0bv32); {3585#(and (exists ((v_subst_1 (_ BitVec 32)) (v_main_~s~0.base_BEFORE_CALL_1 (_ BitVec 32))) (and (= (select (select |#memory_$Pointer$.base| v_main_~s~0.base_BEFORE_CALL_1) (_ bv8 32)) (_ bv0 32)) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| v_main_~s~0.base_BEFORE_CALL_1) (_ bv4 32))) (bvadd v_subst_1 (_ bv8 32))) v_main_~s~0.base_BEFORE_CALL_1) (not (= (select (select |#memory_$Pointer$.base| v_main_~s~0.base_BEFORE_CALL_1) (_ bv4 32)) v_main_~s~0.base_BEFORE_CALL_1)))) (= dll_update_at_~data |dll_update_at_#in~data|) (= dll_update_at_~head.offset |dll_update_at_#in~head.offset|) (= |dll_update_at_#in~head.base| dll_update_at_~head.base))} is VALID [2018-11-18 22:06:02,021 INFO L273 TraceCheckUtils]: 32: Hoare triple {3585#(and (exists ((v_subst_1 (_ BitVec 32)) (v_main_~s~0.base_BEFORE_CALL_1 (_ BitVec 32))) (and (= (select (select |#memory_$Pointer$.base| v_main_~s~0.base_BEFORE_CALL_1) (_ bv8 32)) (_ bv0 32)) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| v_main_~s~0.base_BEFORE_CALL_1) (_ bv4 32))) (bvadd v_subst_1 (_ bv8 32))) v_main_~s~0.base_BEFORE_CALL_1) (not (= (select (select |#memory_$Pointer$.base| v_main_~s~0.base_BEFORE_CALL_1) (_ bv4 32)) v_main_~s~0.base_BEFORE_CALL_1)))) (= dll_update_at_~data |dll_update_at_#in~data|) (= dll_update_at_~head.offset |dll_update_at_#in~head.offset|) (= |dll_update_at_#in~head.base| dll_update_at_~head.base))} call write~intINTTYPE4(~data, ~head.base, ~head.offset, 4bv32); {3595#(and (exists ((v_subst_1 (_ BitVec 32)) (v_main_~s~0.base_BEFORE_CALL_1 (_ BitVec 32))) (and (= (select (select |#memory_$Pointer$.base| v_main_~s~0.base_BEFORE_CALL_1) (_ bv8 32)) (_ bv0 32)) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| v_main_~s~0.base_BEFORE_CALL_1) (_ bv4 32))) (bvadd v_subst_1 (_ bv8 32))) v_main_~s~0.base_BEFORE_CALL_1) (not (= (select (select |#memory_$Pointer$.base| v_main_~s~0.base_BEFORE_CALL_1) (_ bv4 32)) v_main_~s~0.base_BEFORE_CALL_1)))) (= (select (select |#memory_int| |dll_update_at_#in~head.base|) |dll_update_at_#in~head.offset|) |dll_update_at_#in~data|))} is VALID [2018-11-18 22:06:02,023 INFO L273 TraceCheckUtils]: 33: Hoare triple {3595#(and (exists ((v_subst_1 (_ BitVec 32)) (v_main_~s~0.base_BEFORE_CALL_1 (_ BitVec 32))) (and (= (select (select |#memory_$Pointer$.base| v_main_~s~0.base_BEFORE_CALL_1) (_ bv8 32)) (_ bv0 32)) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| v_main_~s~0.base_BEFORE_CALL_1) (_ bv4 32))) (bvadd v_subst_1 (_ bv8 32))) v_main_~s~0.base_BEFORE_CALL_1) (not (= (select (select |#memory_$Pointer$.base| v_main_~s~0.base_BEFORE_CALL_1) (_ bv4 32)) v_main_~s~0.base_BEFORE_CALL_1)))) (= (select (select |#memory_int| |dll_update_at_#in~head.base|) |dll_update_at_#in~head.offset|) |dll_update_at_#in~data|))} assume true; {3595#(and (exists ((v_subst_1 (_ BitVec 32)) (v_main_~s~0.base_BEFORE_CALL_1 (_ BitVec 32))) (and (= (select (select |#memory_$Pointer$.base| v_main_~s~0.base_BEFORE_CALL_1) (_ bv8 32)) (_ bv0 32)) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| v_main_~s~0.base_BEFORE_CALL_1) (_ bv4 32))) (bvadd v_subst_1 (_ bv8 32))) v_main_~s~0.base_BEFORE_CALL_1) (not (= (select (select |#memory_$Pointer$.base| v_main_~s~0.base_BEFORE_CALL_1) (_ bv4 32)) v_main_~s~0.base_BEFORE_CALL_1)))) (= (select (select |#memory_int| |dll_update_at_#in~head.base|) |dll_update_at_#in~head.offset|) |dll_update_at_#in~data|))} is VALID [2018-11-18 22:06:02,024 INFO L268 TraceCheckUtils]: 34: Hoare quadruple {3595#(and (exists ((v_subst_1 (_ BitVec 32)) (v_main_~s~0.base_BEFORE_CALL_1 (_ BitVec 32))) (and (= (select (select |#memory_$Pointer$.base| v_main_~s~0.base_BEFORE_CALL_1) (_ bv8 32)) (_ bv0 32)) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| v_main_~s~0.base_BEFORE_CALL_1) (_ bv4 32))) (bvadd v_subst_1 (_ bv8 32))) v_main_~s~0.base_BEFORE_CALL_1) (not (= (select (select |#memory_$Pointer$.base| v_main_~s~0.base_BEFORE_CALL_1) (_ bv4 32)) v_main_~s~0.base_BEFORE_CALL_1)))) (= (select (select |#memory_int| |dll_update_at_#in~head.base|) |dll_update_at_#in~head.offset|) |dll_update_at_#in~data|))} {3577#(and (not (= (select (select |#memory_$Pointer$.base| main_~s~0.base) (_ bv4 32)) main_~s~0.base)) (exists ((v_subst_1 (_ BitVec 32))) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~s~0.base) (_ bv4 32))) (bvadd v_subst_1 (_ bv8 32))) main_~s~0.base)) (= main_~len~0 main_~new_data~0) (= main_~s~0.offset (_ bv0 32)) (= (bvadd main_~len~0 (_ bv4294967294 32)) (_ bv0 32)) (= (_ bv0 32) (select (select |#memory_$Pointer$.base| main_~s~0.base) (_ bv8 32))))} #150#return; {3602#(and (not (= (select (select |#memory_$Pointer$.base| main_~s~0.base) (_ bv4 32)) main_~s~0.base)) (exists ((v_subst_1 (_ BitVec 32))) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~s~0.base) (_ bv4 32))) (bvadd v_subst_1 (_ bv8 32))) main_~s~0.base)) (= main_~s~0.offset (_ bv0 32)) (= (bvadd main_~len~0 (_ bv4294967294 32)) (_ bv0 32)) (= main_~len~0 (select (select |#memory_int| main_~s~0.base) main_~s~0.offset)) (= (_ bv0 32) (select (select |#memory_$Pointer$.base| main_~s~0.base) (_ bv8 32))))} is VALID [2018-11-18 22:06:02,039 INFO L273 TraceCheckUtils]: 35: Hoare triple {3602#(and (not (= (select (select |#memory_$Pointer$.base| main_~s~0.base) (_ bv4 32)) main_~s~0.base)) (exists ((v_subst_1 (_ BitVec 32))) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~s~0.base) (_ bv4 32))) (bvadd v_subst_1 (_ bv8 32))) main_~s~0.base)) (= main_~s~0.offset (_ bv0 32)) (= (bvadd main_~len~0 (_ bv4294967294 32)) (_ bv0 32)) (= main_~len~0 (select (select |#memory_int| main_~s~0.base) main_~s~0.offset)) (= (_ bv0 32) (select (select |#memory_$Pointer$.base| main_~s~0.base) (_ bv8 32))))} #t~post12 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post12);havoc #t~post12; {3602#(and (not (= (select (select |#memory_$Pointer$.base| main_~s~0.base) (_ bv4 32)) main_~s~0.base)) (exists ((v_subst_1 (_ BitVec 32))) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~s~0.base) (_ bv4 32))) (bvadd v_subst_1 (_ bv8 32))) main_~s~0.base)) (= main_~s~0.offset (_ bv0 32)) (= (bvadd main_~len~0 (_ bv4294967294 32)) (_ bv0 32)) (= main_~len~0 (select (select |#memory_int| main_~s~0.base) main_~s~0.offset)) (= (_ bv0 32) (select (select |#memory_$Pointer$.base| main_~s~0.base) (_ bv8 32))))} is VALID [2018-11-18 22:06:02,040 INFO L273 TraceCheckUtils]: 36: Hoare triple {3602#(and (not (= (select (select |#memory_$Pointer$.base| main_~s~0.base) (_ bv4 32)) main_~s~0.base)) (exists ((v_subst_1 (_ BitVec 32))) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~s~0.base) (_ bv4 32))) (bvadd v_subst_1 (_ bv8 32))) main_~s~0.base)) (= main_~s~0.offset (_ bv0 32)) (= (bvadd main_~len~0 (_ bv4294967294 32)) (_ bv0 32)) (= main_~len~0 (select (select |#memory_int| main_~s~0.base) main_~s~0.offset)) (= (_ bv0 32) (select (select |#memory_$Pointer$.base| main_~s~0.base) (_ bv8 32))))} assume true; {3602#(and (not (= (select (select |#memory_$Pointer$.base| main_~s~0.base) (_ bv4 32)) main_~s~0.base)) (exists ((v_subst_1 (_ BitVec 32))) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~s~0.base) (_ bv4 32))) (bvadd v_subst_1 (_ bv8 32))) main_~s~0.base)) (= main_~s~0.offset (_ bv0 32)) (= (bvadd main_~len~0 (_ bv4294967294 32)) (_ bv0 32)) (= main_~len~0 (select (select |#memory_int| main_~s~0.base) main_~s~0.offset)) (= (_ bv0 32) (select (select |#memory_$Pointer$.base| main_~s~0.base) (_ bv8 32))))} is VALID [2018-11-18 22:06:02,041 INFO L273 TraceCheckUtils]: 37: Hoare triple {3602#(and (not (= (select (select |#memory_$Pointer$.base| main_~s~0.base) (_ bv4 32)) main_~s~0.base)) (exists ((v_subst_1 (_ BitVec 32))) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~s~0.base) (_ bv4 32))) (bvadd v_subst_1 (_ bv8 32))) main_~s~0.base)) (= main_~s~0.offset (_ bv0 32)) (= (bvadd main_~len~0 (_ bv4294967294 32)) (_ bv0 32)) (= main_~len~0 (select (select |#memory_int| main_~s~0.base) main_~s~0.offset)) (= (_ bv0 32) (select (select |#memory_$Pointer$.base| main_~s~0.base) (_ bv8 32))))} assume !!~bvslt32(~i~0, ~len~0);~new_data~0 := ~bvadd32(~i~0, ~len~0); {3602#(and (not (= (select (select |#memory_$Pointer$.base| main_~s~0.base) (_ bv4 32)) main_~s~0.base)) (exists ((v_subst_1 (_ BitVec 32))) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~s~0.base) (_ bv4 32))) (bvadd v_subst_1 (_ bv8 32))) main_~s~0.base)) (= main_~s~0.offset (_ bv0 32)) (= (bvadd main_~len~0 (_ bv4294967294 32)) (_ bv0 32)) (= main_~len~0 (select (select |#memory_int| main_~s~0.base) main_~s~0.offset)) (= (_ bv0 32) (select (select |#memory_$Pointer$.base| main_~s~0.base) (_ bv8 32))))} is VALID [2018-11-18 22:06:02,044 INFO L256 TraceCheckUtils]: 38: Hoare triple {3602#(and (not (= (select (select |#memory_$Pointer$.base| main_~s~0.base) (_ bv4 32)) main_~s~0.base)) (exists ((v_subst_1 (_ BitVec 32))) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~s~0.base) (_ bv4 32))) (bvadd v_subst_1 (_ bv8 32))) main_~s~0.base)) (= main_~s~0.offset (_ bv0 32)) (= (bvadd main_~len~0 (_ bv4294967294 32)) (_ bv0 32)) (= main_~len~0 (select (select |#memory_int| main_~s~0.base) main_~s~0.offset)) (= (_ bv0 32) (select (select |#memory_$Pointer$.base| main_~s~0.base) (_ bv8 32))))} call dll_update_at(~s~0.base, ~s~0.offset, ~new_data~0, ~i~0); {3615#(and (= |old(#memory_int)| |#memory_int|) (exists ((v_subst_1 (_ BitVec 32)) (v_main_~s~0.base_BEFORE_CALL_2 (_ BitVec 32))) (and (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| v_main_~s~0.base_BEFORE_CALL_2) (_ bv4 32))) (bvadd v_subst_1 (_ bv8 32))) v_main_~s~0.base_BEFORE_CALL_2) (not (= (select (select |#memory_$Pointer$.base| v_main_~s~0.base_BEFORE_CALL_2) (_ bv4 32)) v_main_~s~0.base_BEFORE_CALL_2)) (= (select (select |#memory_$Pointer$.base| v_main_~s~0.base_BEFORE_CALL_2) (_ bv8 32)) (_ bv0 32)))))} is VALID [2018-11-18 22:06:02,045 INFO L273 TraceCheckUtils]: 39: Hoare triple {3615#(and (= |old(#memory_int)| |#memory_int|) (exists ((v_subst_1 (_ BitVec 32)) (v_main_~s~0.base_BEFORE_CALL_2 (_ BitVec 32))) (and (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| v_main_~s~0.base_BEFORE_CALL_2) (_ bv4 32))) (bvadd v_subst_1 (_ bv8 32))) v_main_~s~0.base_BEFORE_CALL_2) (not (= (select (select |#memory_$Pointer$.base| v_main_~s~0.base_BEFORE_CALL_2) (_ bv4 32)) v_main_~s~0.base_BEFORE_CALL_2)) (= (select (select |#memory_$Pointer$.base| v_main_~s~0.base_BEFORE_CALL_2) (_ bv8 32)) (_ bv0 32)))))} ~head.base, ~head.offset := #in~head.base, #in~head.offset;~data := #in~data;~index := #in~index; {3619#(and (= |old(#memory_int)| |#memory_int|) (exists ((v_subst_1 (_ BitVec 32)) (v_main_~s~0.base_BEFORE_CALL_2 (_ BitVec 32))) (and (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| v_main_~s~0.base_BEFORE_CALL_2) (_ bv4 32))) (bvadd v_subst_1 (_ bv8 32))) v_main_~s~0.base_BEFORE_CALL_2) (not (= (select (select |#memory_$Pointer$.base| v_main_~s~0.base_BEFORE_CALL_2) (_ bv4 32)) v_main_~s~0.base_BEFORE_CALL_2)) (= (select (select |#memory_$Pointer$.base| v_main_~s~0.base_BEFORE_CALL_2) (_ bv8 32)) (_ bv0 32)))) (= dll_update_at_~head.offset |dll_update_at_#in~head.offset|) (= |dll_update_at_#in~head.base| dll_update_at_~head.base))} is VALID [2018-11-18 22:06:02,046 INFO L273 TraceCheckUtils]: 40: Hoare triple {3619#(and (= |old(#memory_int)| |#memory_int|) (exists ((v_subst_1 (_ BitVec 32)) (v_main_~s~0.base_BEFORE_CALL_2 (_ BitVec 32))) (and (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| v_main_~s~0.base_BEFORE_CALL_2) (_ bv4 32))) (bvadd v_subst_1 (_ bv8 32))) v_main_~s~0.base_BEFORE_CALL_2) (not (= (select (select |#memory_$Pointer$.base| v_main_~s~0.base_BEFORE_CALL_2) (_ bv4 32)) v_main_~s~0.base_BEFORE_CALL_2)) (= (select (select |#memory_$Pointer$.base| v_main_~s~0.base_BEFORE_CALL_2) (_ bv8 32)) (_ bv0 32)))) (= dll_update_at_~head.offset |dll_update_at_#in~head.offset|) (= |dll_update_at_#in~head.base| dll_update_at_~head.base))} assume true; {3619#(and (= |old(#memory_int)| |#memory_int|) (exists ((v_subst_1 (_ BitVec 32)) (v_main_~s~0.base_BEFORE_CALL_2 (_ BitVec 32))) (and (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| v_main_~s~0.base_BEFORE_CALL_2) (_ bv4 32))) (bvadd v_subst_1 (_ bv8 32))) v_main_~s~0.base_BEFORE_CALL_2) (not (= (select (select |#memory_$Pointer$.base| v_main_~s~0.base_BEFORE_CALL_2) (_ bv4 32)) v_main_~s~0.base_BEFORE_CALL_2)) (= (select (select |#memory_$Pointer$.base| v_main_~s~0.base_BEFORE_CALL_2) (_ bv8 32)) (_ bv0 32)))) (= dll_update_at_~head.offset |dll_update_at_#in~head.offset|) (= |dll_update_at_#in~head.base| dll_update_at_~head.base))} is VALID [2018-11-18 22:06:02,049 INFO L273 TraceCheckUtils]: 41: Hoare triple {3619#(and (= |old(#memory_int)| |#memory_int|) (exists ((v_subst_1 (_ BitVec 32)) (v_main_~s~0.base_BEFORE_CALL_2 (_ BitVec 32))) (and (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| v_main_~s~0.base_BEFORE_CALL_2) (_ bv4 32))) (bvadd v_subst_1 (_ bv8 32))) v_main_~s~0.base_BEFORE_CALL_2) (not (= (select (select |#memory_$Pointer$.base| v_main_~s~0.base_BEFORE_CALL_2) (_ bv4 32)) v_main_~s~0.base_BEFORE_CALL_2)) (= (select (select |#memory_$Pointer$.base| v_main_~s~0.base_BEFORE_CALL_2) (_ bv8 32)) (_ bv0 32)))) (= dll_update_at_~head.offset |dll_update_at_#in~head.offset|) (= |dll_update_at_#in~head.base| dll_update_at_~head.base))} assume !!~bvsgt32(~index, 0bv32);call #t~mem9.base, #t~mem9.offset := read~$Pointer$(~head.base, ~bvadd32(4bv32, ~head.offset), 4bv32);~head.base, ~head.offset := #t~mem9.base, #t~mem9.offset;havoc #t~mem9.base, #t~mem9.offset;#t~post10 := ~index;~index := ~bvsub32(#t~post10, 1bv32);havoc #t~post10; {3626#(and (= |old(#memory_int)| |#memory_int|) (exists ((v_subst_1 (_ BitVec 32)) (v_main_~s~0.base_BEFORE_CALL_2 (_ BitVec 32))) (and (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| v_main_~s~0.base_BEFORE_CALL_2) (_ bv4 32))) (bvadd v_subst_1 (_ bv8 32))) v_main_~s~0.base_BEFORE_CALL_2) (not (= (select (select |#memory_$Pointer$.base| v_main_~s~0.base_BEFORE_CALL_2) (_ bv4 32)) v_main_~s~0.base_BEFORE_CALL_2)) (= (select (select |#memory_$Pointer$.base| v_main_~s~0.base_BEFORE_CALL_2) (_ bv8 32)) (_ bv0 32)))) (= dll_update_at_~head.base (select (select |#memory_$Pointer$.base| |dll_update_at_#in~head.base|) (bvadd |dll_update_at_#in~head.offset| (_ bv4 32)))))} is VALID [2018-11-18 22:06:02,050 INFO L273 TraceCheckUtils]: 42: Hoare triple {3626#(and (= |old(#memory_int)| |#memory_int|) (exists ((v_subst_1 (_ BitVec 32)) (v_main_~s~0.base_BEFORE_CALL_2 (_ BitVec 32))) (and (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| v_main_~s~0.base_BEFORE_CALL_2) (_ bv4 32))) (bvadd v_subst_1 (_ bv8 32))) v_main_~s~0.base_BEFORE_CALL_2) (not (= (select (select |#memory_$Pointer$.base| v_main_~s~0.base_BEFORE_CALL_2) (_ bv4 32)) v_main_~s~0.base_BEFORE_CALL_2)) (= (select (select |#memory_$Pointer$.base| v_main_~s~0.base_BEFORE_CALL_2) (_ bv8 32)) (_ bv0 32)))) (= dll_update_at_~head.base (select (select |#memory_$Pointer$.base| |dll_update_at_#in~head.base|) (bvadd |dll_update_at_#in~head.offset| (_ bv4 32)))))} assume true; {3626#(and (= |old(#memory_int)| |#memory_int|) (exists ((v_subst_1 (_ BitVec 32)) (v_main_~s~0.base_BEFORE_CALL_2 (_ BitVec 32))) (and (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| v_main_~s~0.base_BEFORE_CALL_2) (_ bv4 32))) (bvadd v_subst_1 (_ bv8 32))) v_main_~s~0.base_BEFORE_CALL_2) (not (= (select (select |#memory_$Pointer$.base| v_main_~s~0.base_BEFORE_CALL_2) (_ bv4 32)) v_main_~s~0.base_BEFORE_CALL_2)) (= (select (select |#memory_$Pointer$.base| v_main_~s~0.base_BEFORE_CALL_2) (_ bv8 32)) (_ bv0 32)))) (= dll_update_at_~head.base (select (select |#memory_$Pointer$.base| |dll_update_at_#in~head.base|) (bvadd |dll_update_at_#in~head.offset| (_ bv4 32)))))} is VALID [2018-11-18 22:06:02,051 INFO L273 TraceCheckUtils]: 43: Hoare triple {3626#(and (= |old(#memory_int)| |#memory_int|) (exists ((v_subst_1 (_ BitVec 32)) (v_main_~s~0.base_BEFORE_CALL_2 (_ BitVec 32))) (and (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| v_main_~s~0.base_BEFORE_CALL_2) (_ bv4 32))) (bvadd v_subst_1 (_ bv8 32))) v_main_~s~0.base_BEFORE_CALL_2) (not (= (select (select |#memory_$Pointer$.base| v_main_~s~0.base_BEFORE_CALL_2) (_ bv4 32)) v_main_~s~0.base_BEFORE_CALL_2)) (= (select (select |#memory_$Pointer$.base| v_main_~s~0.base_BEFORE_CALL_2) (_ bv8 32)) (_ bv0 32)))) (= dll_update_at_~head.base (select (select |#memory_$Pointer$.base| |dll_update_at_#in~head.base|) (bvadd |dll_update_at_#in~head.offset| (_ bv4 32)))))} assume !~bvsgt32(~index, 0bv32); {3626#(and (= |old(#memory_int)| |#memory_int|) (exists ((v_subst_1 (_ BitVec 32)) (v_main_~s~0.base_BEFORE_CALL_2 (_ BitVec 32))) (and (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| v_main_~s~0.base_BEFORE_CALL_2) (_ bv4 32))) (bvadd v_subst_1 (_ bv8 32))) v_main_~s~0.base_BEFORE_CALL_2) (not (= (select (select |#memory_$Pointer$.base| v_main_~s~0.base_BEFORE_CALL_2) (_ bv4 32)) v_main_~s~0.base_BEFORE_CALL_2)) (= (select (select |#memory_$Pointer$.base| v_main_~s~0.base_BEFORE_CALL_2) (_ bv8 32)) (_ bv0 32)))) (= dll_update_at_~head.base (select (select |#memory_$Pointer$.base| |dll_update_at_#in~head.base|) (bvadd |dll_update_at_#in~head.offset| (_ bv4 32)))))} is VALID [2018-11-18 22:06:02,053 INFO L273 TraceCheckUtils]: 44: Hoare triple {3626#(and (= |old(#memory_int)| |#memory_int|) (exists ((v_subst_1 (_ BitVec 32)) (v_main_~s~0.base_BEFORE_CALL_2 (_ BitVec 32))) (and (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| v_main_~s~0.base_BEFORE_CALL_2) (_ bv4 32))) (bvadd v_subst_1 (_ bv8 32))) v_main_~s~0.base_BEFORE_CALL_2) (not (= (select (select |#memory_$Pointer$.base| v_main_~s~0.base_BEFORE_CALL_2) (_ bv4 32)) v_main_~s~0.base_BEFORE_CALL_2)) (= (select (select |#memory_$Pointer$.base| v_main_~s~0.base_BEFORE_CALL_2) (_ bv8 32)) (_ bv0 32)))) (= dll_update_at_~head.base (select (select |#memory_$Pointer$.base| |dll_update_at_#in~head.base|) (bvadd |dll_update_at_#in~head.offset| (_ bv4 32)))))} call write~intINTTYPE4(~data, ~head.base, ~head.offset, 4bv32); {3636#(and (exists ((v_subst_1 (_ BitVec 32)) (v_main_~s~0.base_BEFORE_CALL_2 (_ BitVec 32))) (and (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| v_main_~s~0.base_BEFORE_CALL_2) (_ bv4 32))) (bvadd v_subst_1 (_ bv8 32))) v_main_~s~0.base_BEFORE_CALL_2) (not (= (select (select |#memory_$Pointer$.base| v_main_~s~0.base_BEFORE_CALL_2) (_ bv4 32)) v_main_~s~0.base_BEFORE_CALL_2)) (= (select (select |#memory_$Pointer$.base| v_main_~s~0.base_BEFORE_CALL_2) (_ bv8 32)) (_ bv0 32)))) (exists ((dll_update_at_~head.offset (_ BitVec 32)) (dll_update_at_~data (_ BitVec 32))) (= |#memory_int| (store |old(#memory_int)| (select (select |#memory_$Pointer$.base| |dll_update_at_#in~head.base|) (bvadd |dll_update_at_#in~head.offset| (_ bv4 32))) (store (select |old(#memory_int)| (select (select |#memory_$Pointer$.base| |dll_update_at_#in~head.base|) (bvadd |dll_update_at_#in~head.offset| (_ bv4 32)))) dll_update_at_~head.offset dll_update_at_~data)))))} is VALID [2018-11-18 22:06:02,054 INFO L273 TraceCheckUtils]: 45: Hoare triple {3636#(and (exists ((v_subst_1 (_ BitVec 32)) (v_main_~s~0.base_BEFORE_CALL_2 (_ BitVec 32))) (and (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| v_main_~s~0.base_BEFORE_CALL_2) (_ bv4 32))) (bvadd v_subst_1 (_ bv8 32))) v_main_~s~0.base_BEFORE_CALL_2) (not (= (select (select |#memory_$Pointer$.base| v_main_~s~0.base_BEFORE_CALL_2) (_ bv4 32)) v_main_~s~0.base_BEFORE_CALL_2)) (= (select (select |#memory_$Pointer$.base| v_main_~s~0.base_BEFORE_CALL_2) (_ bv8 32)) (_ bv0 32)))) (exists ((dll_update_at_~head.offset (_ BitVec 32)) (dll_update_at_~data (_ BitVec 32))) (= |#memory_int| (store |old(#memory_int)| (select (select |#memory_$Pointer$.base| |dll_update_at_#in~head.base|) (bvadd |dll_update_at_#in~head.offset| (_ bv4 32))) (store (select |old(#memory_int)| (select (select |#memory_$Pointer$.base| |dll_update_at_#in~head.base|) (bvadd |dll_update_at_#in~head.offset| (_ bv4 32)))) dll_update_at_~head.offset dll_update_at_~data)))))} assume true; {3636#(and (exists ((v_subst_1 (_ BitVec 32)) (v_main_~s~0.base_BEFORE_CALL_2 (_ BitVec 32))) (and (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| v_main_~s~0.base_BEFORE_CALL_2) (_ bv4 32))) (bvadd v_subst_1 (_ bv8 32))) v_main_~s~0.base_BEFORE_CALL_2) (not (= (select (select |#memory_$Pointer$.base| v_main_~s~0.base_BEFORE_CALL_2) (_ bv4 32)) v_main_~s~0.base_BEFORE_CALL_2)) (= (select (select |#memory_$Pointer$.base| v_main_~s~0.base_BEFORE_CALL_2) (_ bv8 32)) (_ bv0 32)))) (exists ((dll_update_at_~head.offset (_ BitVec 32)) (dll_update_at_~data (_ BitVec 32))) (= |#memory_int| (store |old(#memory_int)| (select (select |#memory_$Pointer$.base| |dll_update_at_#in~head.base|) (bvadd |dll_update_at_#in~head.offset| (_ bv4 32))) (store (select |old(#memory_int)| (select (select |#memory_$Pointer$.base| |dll_update_at_#in~head.base|) (bvadd |dll_update_at_#in~head.offset| (_ bv4 32)))) dll_update_at_~head.offset dll_update_at_~data)))))} is VALID [2018-11-18 22:06:02,058 INFO L268 TraceCheckUtils]: 46: Hoare quadruple {3636#(and (exists ((v_subst_1 (_ BitVec 32)) (v_main_~s~0.base_BEFORE_CALL_2 (_ BitVec 32))) (and (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| v_main_~s~0.base_BEFORE_CALL_2) (_ bv4 32))) (bvadd v_subst_1 (_ bv8 32))) v_main_~s~0.base_BEFORE_CALL_2) (not (= (select (select |#memory_$Pointer$.base| v_main_~s~0.base_BEFORE_CALL_2) (_ bv4 32)) v_main_~s~0.base_BEFORE_CALL_2)) (= (select (select |#memory_$Pointer$.base| v_main_~s~0.base_BEFORE_CALL_2) (_ bv8 32)) (_ bv0 32)))) (exists ((dll_update_at_~head.offset (_ BitVec 32)) (dll_update_at_~data (_ BitVec 32))) (= |#memory_int| (store |old(#memory_int)| (select (select |#memory_$Pointer$.base| |dll_update_at_#in~head.base|) (bvadd |dll_update_at_#in~head.offset| (_ bv4 32))) (store (select |old(#memory_int)| (select (select |#memory_$Pointer$.base| |dll_update_at_#in~head.base|) (bvadd |dll_update_at_#in~head.offset| (_ bv4 32)))) dll_update_at_~head.offset dll_update_at_~data)))))} {3602#(and (not (= (select (select |#memory_$Pointer$.base| main_~s~0.base) (_ bv4 32)) main_~s~0.base)) (exists ((v_subst_1 (_ BitVec 32))) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~s~0.base) (_ bv4 32))) (bvadd v_subst_1 (_ bv8 32))) main_~s~0.base)) (= main_~s~0.offset (_ bv0 32)) (= (bvadd main_~len~0 (_ bv4294967294 32)) (_ bv0 32)) (= main_~len~0 (select (select |#memory_int| main_~s~0.base) main_~s~0.offset)) (= (_ bv0 32) (select (select |#memory_$Pointer$.base| main_~s~0.base) (_ bv8 32))))} #150#return; {3643#(and (= main_~s~0.offset (_ bv0 32)) (= (bvadd main_~len~0 (_ bv4294967294 32)) (_ bv0 32)) (= main_~len~0 (select (select |#memory_int| main_~s~0.base) main_~s~0.offset)))} is VALID [2018-11-18 22:06:02,059 INFO L273 TraceCheckUtils]: 47: Hoare triple {3643#(and (= main_~s~0.offset (_ bv0 32)) (= (bvadd main_~len~0 (_ bv4294967294 32)) (_ bv0 32)) (= main_~len~0 (select (select |#memory_int| main_~s~0.base) main_~s~0.offset)))} #t~post12 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post12);havoc #t~post12; {3643#(and (= main_~s~0.offset (_ bv0 32)) (= (bvadd main_~len~0 (_ bv4294967294 32)) (_ bv0 32)) (= main_~len~0 (select (select |#memory_int| main_~s~0.base) main_~s~0.offset)))} is VALID [2018-11-18 22:06:02,060 INFO L273 TraceCheckUtils]: 48: Hoare triple {3643#(and (= main_~s~0.offset (_ bv0 32)) (= (bvadd main_~len~0 (_ bv4294967294 32)) (_ bv0 32)) (= main_~len~0 (select (select |#memory_int| main_~s~0.base) main_~s~0.offset)))} assume true; {3643#(and (= main_~s~0.offset (_ bv0 32)) (= (bvadd main_~len~0 (_ bv4294967294 32)) (_ bv0 32)) (= main_~len~0 (select (select |#memory_int| main_~s~0.base) main_~s~0.offset)))} is VALID [2018-11-18 22:06:02,060 INFO L273 TraceCheckUtils]: 49: Hoare triple {3643#(and (= main_~s~0.offset (_ bv0 32)) (= (bvadd main_~len~0 (_ bv4294967294 32)) (_ bv0 32)) (= main_~len~0 (select (select |#memory_int| main_~s~0.base) main_~s~0.offset)))} assume !~bvslt32(~i~0, ~len~0); {3643#(and (= main_~s~0.offset (_ bv0 32)) (= (bvadd main_~len~0 (_ bv4294967294 32)) (_ bv0 32)) (= main_~len~0 (select (select |#memory_int| main_~s~0.base) main_~s~0.offset)))} is VALID [2018-11-18 22:06:02,061 INFO L273 TraceCheckUtils]: 50: Hoare triple {3643#(and (= main_~s~0.offset (_ bv0 32)) (= (bvadd main_~len~0 (_ bv4294967294 32)) (_ bv0 32)) (= main_~len~0 (select (select |#memory_int| main_~s~0.base) main_~s~0.offset)))} ~i~0 := 0bv32; {3656#(and (= main_~s~0.offset (_ bv0 32)) (= main_~i~0 (_ bv0 32)) (= (bvadd main_~len~0 (_ bv4294967294 32)) (_ bv0 32)) (= main_~len~0 (select (select |#memory_int| main_~s~0.base) main_~s~0.offset)))} is VALID [2018-11-18 22:06:02,061 INFO L273 TraceCheckUtils]: 51: Hoare triple {3656#(and (= main_~s~0.offset (_ bv0 32)) (= main_~i~0 (_ bv0 32)) (= (bvadd main_~len~0 (_ bv4294967294 32)) (_ bv0 32)) (= main_~len~0 (select (select |#memory_int| main_~s~0.base) main_~s~0.offset)))} assume true; {3656#(and (= main_~s~0.offset (_ bv0 32)) (= main_~i~0 (_ bv0 32)) (= (bvadd main_~len~0 (_ bv4294967294 32)) (_ bv0 32)) (= main_~len~0 (select (select |#memory_int| main_~s~0.base) main_~s~0.offset)))} is VALID [2018-11-18 22:06:02,062 INFO L273 TraceCheckUtils]: 52: Hoare triple {3656#(and (= main_~s~0.offset (_ bv0 32)) (= main_~i~0 (_ bv0 32)) (= (bvadd main_~len~0 (_ bv4294967294 32)) (_ bv0 32)) (= main_~len~0 (select (select |#memory_int| main_~s~0.base) main_~s~0.offset)))} assume !!~bvslt32(~i~0, ~len~0);~expected~0 := ~bvadd32(~i~0, ~len~0); {3663#(and (= (bvadd (select (select |#memory_int| main_~s~0.base) main_~s~0.offset) (_ bv4294967294 32)) (_ bv0 32)) (= main_~s~0.offset (_ bv0 32)) (= main_~expected~0 (select (select |#memory_int| main_~s~0.base) main_~s~0.offset)))} is VALID [2018-11-18 22:06:02,064 INFO L256 TraceCheckUtils]: 53: Hoare triple {3663#(and (= (bvadd (select (select |#memory_int| main_~s~0.base) main_~s~0.offset) (_ bv4294967294 32)) (_ bv0 32)) (= main_~s~0.offset (_ bv0 32)) (= main_~expected~0 (select (select |#memory_int| main_~s~0.base) main_~s~0.offset)))} call #t~ret14 := dll_get_data_at(~s~0.base, ~s~0.offset, ~i~0); {3667#(exists ((v_main_~s~0.base_BEFORE_CALL_3 (_ BitVec 32))) (= (bvadd (select (select |#memory_int| v_main_~s~0.base_BEFORE_CALL_3) (_ bv0 32)) (_ bv4294967294 32)) (_ bv0 32)))} is VALID [2018-11-18 22:06:02,065 INFO L273 TraceCheckUtils]: 54: Hoare triple {3667#(exists ((v_main_~s~0.base_BEFORE_CALL_3 (_ BitVec 32))) (= (bvadd (select (select |#memory_int| v_main_~s~0.base_BEFORE_CALL_3) (_ bv0 32)) (_ bv4294967294 32)) (_ bv0 32)))} ~head.base, ~head.offset := #in~head.base, #in~head.offset;~index := #in~index; {3671#(and (exists ((v_main_~s~0.base_BEFORE_CALL_3 (_ BitVec 32))) (= (bvadd (select (select |#memory_int| v_main_~s~0.base_BEFORE_CALL_3) (_ bv0 32)) (_ bv4294967294 32)) (_ bv0 32))) (= dll_get_data_at_~head.offset |dll_get_data_at_#in~head.offset|) (= |dll_get_data_at_#in~head.base| dll_get_data_at_~head.base))} is VALID [2018-11-18 22:06:02,066 INFO L273 TraceCheckUtils]: 55: Hoare triple {3671#(and (exists ((v_main_~s~0.base_BEFORE_CALL_3 (_ BitVec 32))) (= (bvadd (select (select |#memory_int| v_main_~s~0.base_BEFORE_CALL_3) (_ bv0 32)) (_ bv4294967294 32)) (_ bv0 32))) (= dll_get_data_at_~head.offset |dll_get_data_at_#in~head.offset|) (= |dll_get_data_at_#in~head.base| dll_get_data_at_~head.base))} assume true; {3671#(and (exists ((v_main_~s~0.base_BEFORE_CALL_3 (_ BitVec 32))) (= (bvadd (select (select |#memory_int| v_main_~s~0.base_BEFORE_CALL_3) (_ bv0 32)) (_ bv4294967294 32)) (_ bv0 32))) (= dll_get_data_at_~head.offset |dll_get_data_at_#in~head.offset|) (= |dll_get_data_at_#in~head.base| dll_get_data_at_~head.base))} is VALID [2018-11-18 22:06:02,067 INFO L273 TraceCheckUtils]: 56: Hoare triple {3671#(and (exists ((v_main_~s~0.base_BEFORE_CALL_3 (_ BitVec 32))) (= (bvadd (select (select |#memory_int| v_main_~s~0.base_BEFORE_CALL_3) (_ bv0 32)) (_ bv4294967294 32)) (_ bv0 32))) (= dll_get_data_at_~head.offset |dll_get_data_at_#in~head.offset|) (= |dll_get_data_at_#in~head.base| dll_get_data_at_~head.base))} assume !~bvsgt32(~index, 0bv32); {3671#(and (exists ((v_main_~s~0.base_BEFORE_CALL_3 (_ BitVec 32))) (= (bvadd (select (select |#memory_int| v_main_~s~0.base_BEFORE_CALL_3) (_ bv0 32)) (_ bv4294967294 32)) (_ bv0 32))) (= dll_get_data_at_~head.offset |dll_get_data_at_#in~head.offset|) (= |dll_get_data_at_#in~head.base| dll_get_data_at_~head.base))} is VALID [2018-11-18 22:06:02,068 INFO L273 TraceCheckUtils]: 57: Hoare triple {3671#(and (exists ((v_main_~s~0.base_BEFORE_CALL_3 (_ BitVec 32))) (= (bvadd (select (select |#memory_int| v_main_~s~0.base_BEFORE_CALL_3) (_ bv0 32)) (_ bv4294967294 32)) (_ bv0 32))) (= dll_get_data_at_~head.offset |dll_get_data_at_#in~head.offset|) (= |dll_get_data_at_#in~head.base| dll_get_data_at_~head.base))} call #t~mem8 := read~intINTTYPE4(~head.base, ~head.offset, 4bv32);#res := #t~mem8;havoc #t~mem8; {3681#(and (exists ((v_main_~s~0.base_BEFORE_CALL_3 (_ BitVec 32))) (= (bvadd (select (select |#memory_int| v_main_~s~0.base_BEFORE_CALL_3) (_ bv0 32)) (_ bv4294967294 32)) (_ bv0 32))) (= |dll_get_data_at_#res| (select (select |#memory_int| |dll_get_data_at_#in~head.base|) |dll_get_data_at_#in~head.offset|)))} is VALID [2018-11-18 22:06:02,068 INFO L273 TraceCheckUtils]: 58: Hoare triple {3681#(and (exists ((v_main_~s~0.base_BEFORE_CALL_3 (_ BitVec 32))) (= (bvadd (select (select |#memory_int| v_main_~s~0.base_BEFORE_CALL_3) (_ bv0 32)) (_ bv4294967294 32)) (_ bv0 32))) (= |dll_get_data_at_#res| (select (select |#memory_int| |dll_get_data_at_#in~head.base|) |dll_get_data_at_#in~head.offset|)))} assume true; {3681#(and (exists ((v_main_~s~0.base_BEFORE_CALL_3 (_ BitVec 32))) (= (bvadd (select (select |#memory_int| v_main_~s~0.base_BEFORE_CALL_3) (_ bv0 32)) (_ bv4294967294 32)) (_ bv0 32))) (= |dll_get_data_at_#res| (select (select |#memory_int| |dll_get_data_at_#in~head.base|) |dll_get_data_at_#in~head.offset|)))} is VALID [2018-11-18 22:06:02,071 INFO L268 TraceCheckUtils]: 59: Hoare quadruple {3681#(and (exists ((v_main_~s~0.base_BEFORE_CALL_3 (_ BitVec 32))) (= (bvadd (select (select |#memory_int| v_main_~s~0.base_BEFORE_CALL_3) (_ bv0 32)) (_ bv4294967294 32)) (_ bv0 32))) (= |dll_get_data_at_#res| (select (select |#memory_int| |dll_get_data_at_#in~head.base|) |dll_get_data_at_#in~head.offset|)))} {3663#(and (= (bvadd (select (select |#memory_int| main_~s~0.base) main_~s~0.offset) (_ bv4294967294 32)) (_ bv0 32)) (= main_~s~0.offset (_ bv0 32)) (= main_~expected~0 (select (select |#memory_int| main_~s~0.base) main_~s~0.offset)))} #152#return; {3688#(and (= (bvadd |main_#t~ret14| (_ bv4294967294 32)) (_ bv0 32)) (= |main_#t~ret14| main_~expected~0))} is VALID [2018-11-18 22:06:02,072 INFO L273 TraceCheckUtils]: 60: Hoare triple {3688#(and (= (bvadd |main_#t~ret14| (_ bv4294967294 32)) (_ bv0 32)) (= |main_#t~ret14| main_~expected~0))} assume ~expected~0 != #t~ret14;havoc #t~ret14; {3482#false} is VALID [2018-11-18 22:06:02,072 INFO L273 TraceCheckUtils]: 61: Hoare triple {3482#false} assume !false; {3482#false} is VALID [2018-11-18 22:06:02,096 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 5 proven. 23 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 22:06:02,096 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-18 22:06:04,739 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-18 22:06:04,739 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 28] total 28 [2018-11-18 22:06:04,740 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 62 [2018-11-18 22:06:04,740 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-18 22:06:04,740 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 28 states. [2018-11-18 22:06:04,948 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 62 edges. 62 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 22:06:04,948 INFO L459 AbstractCegarLoop]: Interpolant automaton has 28 states [2018-11-18 22:06:04,949 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2018-11-18 22:06:04,949 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=107, Invalid=1069, Unknown=14, NotChecked=0, Total=1190 [2018-11-18 22:06:04,950 INFO L87 Difference]: Start difference. First operand 64 states and 70 transitions. Second operand 28 states. [2018-11-18 22:06:54,741 WARN L180 SmtUtils]: Spent 133.00 ms on a formula simplification that was a NOOP. DAG size: 60