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_prepend_equal_true-unreach-call_true-valid-memsafety.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-18e5b2d-m [2018-11-18 22:02:04,016 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-18 22:02:04,018 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-18 22:02:04,035 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-18 22:02:04,035 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-18 22:02:04,037 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-18 22:02:04,039 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-18 22:02:04,042 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-18 22:02:04,043 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-18 22:02:04,044 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-18 22:02:04,047 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-18 22:02:04,047 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-18 22:02:04,048 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-18 22:02:04,049 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-18 22:02:04,053 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-18 22:02:04,054 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-18 22:02:04,056 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-18 22:02:04,058 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-18 22:02:04,064 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-18 22:02:04,069 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-18 22:02:04,070 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-18 22:02:04,074 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-18 22:02:04,078 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-18 22:02:04,078 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-18 22:02:04,078 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-18 22:02:04,079 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-18 22:02:04,081 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-18 22:02:04,082 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-18 22:02:04,085 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-18 22:02:04,086 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-18 22:02:04,086 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-18 22:02:04,087 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-18 22:02:04,087 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-18 22:02:04,087 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-18 22:02:04,088 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-18 22:02:04,089 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-18 22:02:04,089 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:02:04,110 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-18 22:02:04,111 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-18 22:02:04,112 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-18 22:02:04,112 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-11-18 22:02:04,113 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-18 22:02:04,113 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-18 22:02:04,113 INFO L133 SettingsManager]: * Use SBE=true [2018-11-18 22:02:04,113 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-18 22:02:04,114 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-18 22:02:04,114 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-18 22:02:04,114 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-18 22:02:04,114 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-18 22:02:04,114 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-18 22:02:04,115 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-18 22:02:04,115 INFO L133 SettingsManager]: * Use bitvectors instead of ints=true [2018-11-18 22:02:04,115 INFO L133 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2018-11-18 22:02:04,115 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-18 22:02:04,115 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-18 22:02:04,116 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-18 22:02:04,116 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-18 22:02:04,116 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-18 22:02:04,116 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-18 22:02:04,116 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-18 22:02:04,117 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-18 22:02:04,117 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-18 22:02:04,117 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-18 22:02:04,117 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-18 22:02:04,117 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-18 22:02:04,118 INFO L133 SettingsManager]: * Trace refinement strategy=WOLF [2018-11-18 22:02:04,118 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-18 22:02:04,118 INFO L133 SettingsManager]: * Command for external solver=cvc4nyu --tear-down-incremental --rewrite-divk --print-success --lang smt [2018-11-18 22:02:04,118 INFO L133 SettingsManager]: * Logic for external solver=AUFBV [2018-11-18 22:02:04,118 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-18 22:02:04,169 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-18 22:02:04,180 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-18 22:02:04,184 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-18 22:02:04,186 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-18 22:02:04,186 INFO L276 PluginConnector]: CDTParser initialized [2018-11-18 22:02:04,187 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/list-simple/dll2n_prepend_equal_true-unreach-call_true-valid-memsafety.i [2018-11-18 22:02:04,244 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/771bb2cc3/ac90b8f07b234a93aae21ccc5cd5822a/FLAG106d42ea7 [2018-11-18 22:02:04,737 INFO L307 CDTParser]: Found 1 translation units. [2018-11-18 22:02:04,738 INFO L161 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/list-simple/dll2n_prepend_equal_true-unreach-call_true-valid-memsafety.i [2018-11-18 22:02:04,755 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/771bb2cc3/ac90b8f07b234a93aae21ccc5cd5822a/FLAG106d42ea7 [2018-11-18 22:02:05,045 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/771bb2cc3/ac90b8f07b234a93aae21ccc5cd5822a [2018-11-18 22:02:05,055 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-18 22:02:05,056 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-11-18 22:02:05,057 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-18 22:02:05,057 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-18 22:02:05,061 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-18 22:02:05,063 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 10:02:05" (1/1) ... [2018-11-18 22:02:05,066 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3cafa473 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 10:02:05, skipping insertion in model container [2018-11-18 22:02:05,066 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 10:02:05" (1/1) ... [2018-11-18 22:02:05,076 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-18 22:02:05,139 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-18 22:02:05,525 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-18 22:02:05,549 INFO L191 MainTranslator]: Completed pre-run [2018-11-18 22:02:05,614 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-18 22:02:05,765 INFO L195 MainTranslator]: Completed translation [2018-11-18 22:02:05,766 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 10:02:05 WrapperNode [2018-11-18 22:02:05,766 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-18 22:02:05,767 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-18 22:02:05,767 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-18 22:02:05,767 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-18 22:02:05,782 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 10:02:05" (1/1) ... [2018-11-18 22:02:05,783 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 10:02:05" (1/1) ... [2018-11-18 22:02:05,804 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 10:02:05" (1/1) ... [2018-11-18 22:02:05,805 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 10:02:05" (1/1) ... [2018-11-18 22:02:05,859 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 10:02:05" (1/1) ... [2018-11-18 22:02:05,867 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 10:02:05" (1/1) ... [2018-11-18 22:02:05,871 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 10:02:05" (1/1) ... [2018-11-18 22:02:05,880 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-18 22:02:05,881 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-18 22:02:05,881 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-18 22:02:05,881 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-18 22:02:05,882 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 10:02:05" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-18 22:02:05,947 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-18 22:02:05,947 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-18 22:02:05,947 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_32 [2018-11-18 22:02:05,947 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_64 [2018-11-18 22:02:05,948 INFO L138 BoogieDeclarations]: Found implementation of procedure exit [2018-11-18 22:02:05,948 INFO L138 BoogieDeclarations]: Found implementation of procedure node_create [2018-11-18 22:02:05,948 INFO L138 BoogieDeclarations]: Found implementation of procedure dll_create [2018-11-18 22:02:05,948 INFO L138 BoogieDeclarations]: Found implementation of procedure dll_destroy [2018-11-18 22:02:05,948 INFO L138 BoogieDeclarations]: Found implementation of procedure dll_prepend [2018-11-18 22:02:05,948 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-18 22:02:05,948 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2018-11-18 22:02:05,949 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_32 [2018-11-18 22:02:05,949 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_64 [2018-11-18 22:02:05,949 INFO L130 BoogieDeclarations]: Found specification of procedure __ctype_get_mb_cur_max [2018-11-18 22:02:05,949 INFO L130 BoogieDeclarations]: Found specification of procedure atof [2018-11-18 22:02:05,949 INFO L130 BoogieDeclarations]: Found specification of procedure atoi [2018-11-18 22:02:05,949 INFO L130 BoogieDeclarations]: Found specification of procedure atol [2018-11-18 22:02:05,950 INFO L130 BoogieDeclarations]: Found specification of procedure atoll [2018-11-18 22:02:05,950 INFO L130 BoogieDeclarations]: Found specification of procedure strtod [2018-11-18 22:02:05,950 INFO L130 BoogieDeclarations]: Found specification of procedure strtof [2018-11-18 22:02:05,950 INFO L130 BoogieDeclarations]: Found specification of procedure strtold [2018-11-18 22:02:05,950 INFO L130 BoogieDeclarations]: Found specification of procedure strtol [2018-11-18 22:02:05,950 INFO L130 BoogieDeclarations]: Found specification of procedure strtoul [2018-11-18 22:02:05,951 INFO L130 BoogieDeclarations]: Found specification of procedure strtoq [2018-11-18 22:02:05,951 INFO L130 BoogieDeclarations]: Found specification of procedure strtouq [2018-11-18 22:02:05,951 INFO L130 BoogieDeclarations]: Found specification of procedure strtoll [2018-11-18 22:02:05,951 INFO L130 BoogieDeclarations]: Found specification of procedure strtoull [2018-11-18 22:02:05,951 INFO L130 BoogieDeclarations]: Found specification of procedure l64a [2018-11-18 22:02:05,951 INFO L130 BoogieDeclarations]: Found specification of procedure a64l [2018-11-18 22:02:05,951 INFO L130 BoogieDeclarations]: Found specification of procedure select [2018-11-18 22:02:05,952 INFO L130 BoogieDeclarations]: Found specification of procedure pselect [2018-11-18 22:02:05,952 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_major [2018-11-18 22:02:05,952 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_minor [2018-11-18 22:02:05,952 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_makedev [2018-11-18 22:02:05,952 INFO L130 BoogieDeclarations]: Found specification of procedure random [2018-11-18 22:02:05,952 INFO L130 BoogieDeclarations]: Found specification of procedure srandom [2018-11-18 22:02:05,952 INFO L130 BoogieDeclarations]: Found specification of procedure initstate [2018-11-18 22:02:05,953 INFO L130 BoogieDeclarations]: Found specification of procedure setstate [2018-11-18 22:02:05,953 INFO L130 BoogieDeclarations]: Found specification of procedure random_r [2018-11-18 22:02:05,953 INFO L130 BoogieDeclarations]: Found specification of procedure srandom_r [2018-11-18 22:02:05,953 INFO L130 BoogieDeclarations]: Found specification of procedure initstate_r [2018-11-18 22:02:05,953 INFO L130 BoogieDeclarations]: Found specification of procedure setstate_r [2018-11-18 22:02:05,953 INFO L130 BoogieDeclarations]: Found specification of procedure rand [2018-11-18 22:02:05,953 INFO L130 BoogieDeclarations]: Found specification of procedure srand [2018-11-18 22:02:05,954 INFO L130 BoogieDeclarations]: Found specification of procedure rand_r [2018-11-18 22:02:05,954 INFO L130 BoogieDeclarations]: Found specification of procedure drand48 [2018-11-18 22:02:05,954 INFO L130 BoogieDeclarations]: Found specification of procedure erand48 [2018-11-18 22:02:05,954 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48 [2018-11-18 22:02:05,954 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48 [2018-11-18 22:02:05,954 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48 [2018-11-18 22:02:05,954 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48 [2018-11-18 22:02:05,955 INFO L130 BoogieDeclarations]: Found specification of procedure srand48 [2018-11-18 22:02:05,955 INFO L130 BoogieDeclarations]: Found specification of procedure seed48 [2018-11-18 22:02:05,955 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48 [2018-11-18 22:02:05,955 INFO L130 BoogieDeclarations]: Found specification of procedure drand48_r [2018-11-18 22:02:05,955 INFO L130 BoogieDeclarations]: Found specification of procedure erand48_r [2018-11-18 22:02:05,955 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48_r [2018-11-18 22:02:05,955 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48_r [2018-11-18 22:02:05,956 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48_r [2018-11-18 22:02:05,956 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48_r [2018-11-18 22:02:05,956 INFO L130 BoogieDeclarations]: Found specification of procedure srand48_r [2018-11-18 22:02:05,956 INFO L130 BoogieDeclarations]: Found specification of procedure seed48_r [2018-11-18 22:02:05,956 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48_r [2018-11-18 22:02:05,956 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2018-11-18 22:02:05,956 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2018-11-18 22:02:05,957 INFO L130 BoogieDeclarations]: Found specification of procedure realloc [2018-11-18 22:02:05,957 INFO L130 BoogieDeclarations]: Found specification of procedure free [2018-11-18 22:02:05,957 INFO L130 BoogieDeclarations]: Found specification of procedure cfree [2018-11-18 22:02:05,957 INFO L130 BoogieDeclarations]: Found specification of procedure alloca [2018-11-18 22:02:05,957 INFO L130 BoogieDeclarations]: Found specification of procedure valloc [2018-11-18 22:02:05,957 INFO L130 BoogieDeclarations]: Found specification of procedure posix_memalign [2018-11-18 22:02:05,957 INFO L130 BoogieDeclarations]: Found specification of procedure aligned_alloc [2018-11-18 22:02:05,958 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2018-11-18 22:02:05,958 INFO L130 BoogieDeclarations]: Found specification of procedure atexit [2018-11-18 22:02:05,958 INFO L130 BoogieDeclarations]: Found specification of procedure at_quick_exit [2018-11-18 22:02:05,958 INFO L130 BoogieDeclarations]: Found specification of procedure on_exit [2018-11-18 22:02:05,958 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2018-11-18 22:02:05,958 INFO L130 BoogieDeclarations]: Found specification of procedure quick_exit [2018-11-18 22:02:05,958 INFO L130 BoogieDeclarations]: Found specification of procedure _Exit [2018-11-18 22:02:05,959 INFO L130 BoogieDeclarations]: Found specification of procedure getenv [2018-11-18 22:02:05,959 INFO L130 BoogieDeclarations]: Found specification of procedure putenv [2018-11-18 22:02:05,959 INFO L130 BoogieDeclarations]: Found specification of procedure setenv [2018-11-18 22:02:05,959 INFO L130 BoogieDeclarations]: Found specification of procedure unsetenv [2018-11-18 22:02:05,959 INFO L130 BoogieDeclarations]: Found specification of procedure clearenv [2018-11-18 22:02:05,959 INFO L130 BoogieDeclarations]: Found specification of procedure mktemp [2018-11-18 22:02:05,959 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemp [2018-11-18 22:02:05,960 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemps [2018-11-18 22:02:05,960 INFO L130 BoogieDeclarations]: Found specification of procedure mkdtemp [2018-11-18 22:02:05,960 INFO L130 BoogieDeclarations]: Found specification of procedure system [2018-11-18 22:02:05,960 INFO L130 BoogieDeclarations]: Found specification of procedure realpath [2018-11-18 22:02:05,960 INFO L130 BoogieDeclarations]: Found specification of procedure bsearch [2018-11-18 22:02:05,960 INFO L130 BoogieDeclarations]: Found specification of procedure qsort [2018-11-18 22:02:05,961 INFO L130 BoogieDeclarations]: Found specification of procedure abs [2018-11-18 22:02:05,961 INFO L130 BoogieDeclarations]: Found specification of procedure labs [2018-11-18 22:02:05,961 INFO L130 BoogieDeclarations]: Found specification of procedure llabs [2018-11-18 22:02:05,961 INFO L130 BoogieDeclarations]: Found specification of procedure div [2018-11-18 22:02:05,961 INFO L130 BoogieDeclarations]: Found specification of procedure ldiv [2018-11-18 22:02:05,961 INFO L130 BoogieDeclarations]: Found specification of procedure lldiv [2018-11-18 22:02:05,961 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt [2018-11-18 22:02:05,962 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt [2018-11-18 22:02:05,962 INFO L130 BoogieDeclarations]: Found specification of procedure gcvt [2018-11-18 22:02:05,962 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt [2018-11-18 22:02:05,962 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt [2018-11-18 22:02:05,962 INFO L130 BoogieDeclarations]: Found specification of procedure qgcvt [2018-11-18 22:02:05,962 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt_r [2018-11-18 22:02:05,962 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt_r [2018-11-18 22:02:05,963 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt_r [2018-11-18 22:02:05,963 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt_r [2018-11-18 22:02:05,963 INFO L130 BoogieDeclarations]: Found specification of procedure mblen [2018-11-18 22:02:05,963 INFO L130 BoogieDeclarations]: Found specification of procedure mbtowc [2018-11-18 22:02:05,963 INFO L130 BoogieDeclarations]: Found specification of procedure wctomb [2018-11-18 22:02:05,963 INFO L130 BoogieDeclarations]: Found specification of procedure mbstowcs [2018-11-18 22:02:05,963 INFO L130 BoogieDeclarations]: Found specification of procedure wcstombs [2018-11-18 22:02:05,964 INFO L130 BoogieDeclarations]: Found specification of procedure rpmatch [2018-11-18 22:02:05,964 INFO L130 BoogieDeclarations]: Found specification of procedure getsubopt [2018-11-18 22:02:05,964 INFO L130 BoogieDeclarations]: Found specification of procedure getloadavg [2018-11-18 22:02:05,964 INFO L130 BoogieDeclarations]: Found specification of procedure node_create [2018-11-18 22:02:05,964 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-18 22:02:05,964 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-11-18 22:02:05,964 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2018-11-18 22:02:05,965 INFO L130 BoogieDeclarations]: Found specification of procedure dll_create [2018-11-18 22:02:05,965 INFO L130 BoogieDeclarations]: Found specification of procedure dll_destroy [2018-11-18 22:02:05,965 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-11-18 22:02:05,965 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-18 22:02:05,965 INFO L130 BoogieDeclarations]: Found specification of procedure dll_prepend [2018-11-18 22:02:05,965 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-18 22:02:05,965 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2018-11-18 22:02:05,966 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-18 22:02:05,966 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-18 22:02:05,966 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE4 [2018-11-18 22:02:07,246 INFO L280 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-18 22:02:07,247 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 10:02:07 BoogieIcfgContainer [2018-11-18 22:02:07,247 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-18 22:02:07,248 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-18 22:02:07,248 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-18 22:02:07,252 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-18 22:02:07,252 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.11 10:02:05" (1/3) ... [2018-11-18 22:02:07,253 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@390f89b0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.11 10:02:07, skipping insertion in model container [2018-11-18 22:02:07,253 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 10:02:05" (2/3) ... [2018-11-18 22:02:07,254 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@390f89b0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.11 10:02:07, skipping insertion in model container [2018-11-18 22:02:07,254 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 10:02:07" (3/3) ... [2018-11-18 22:02:07,256 INFO L112 eAbstractionObserver]: Analyzing ICFG dll2n_prepend_equal_true-unreach-call_true-valid-memsafety.i [2018-11-18 22:02:07,266 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-18 22:02:07,276 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-18 22:02:07,294 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-18 22:02:07,325 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-18 22:02:07,326 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-18 22:02:07,326 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-18 22:02:07,326 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-18 22:02:07,327 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-18 22:02:07,327 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-18 22:02:07,327 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-18 22:02:07,327 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-18 22:02:07,327 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-18 22:02:07,347 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states. [2018-11-18 22:02:07,355 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-11-18 22:02:07,356 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 22:02:07,357 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, 1, 1] [2018-11-18 22:02:07,359 INFO L423 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 22:02:07,366 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 22:02:07,366 INFO L82 PathProgramCache]: Analyzing trace with hash 1705755525, now seen corresponding path program 1 times [2018-11-18 22:02:07,372 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-18 22:02:07,373 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:02:07,406 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 22:02:07,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 22:02:07,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 22:02:07,560 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 22:02:07,797 INFO L256 TraceCheckUtils]: 0: Hoare triple {56#true} call ULTIMATE.init(); {56#true} is VALID [2018-11-18 22:02:07,800 INFO L273 TraceCheckUtils]: 1: Hoare triple {56#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {56#true} is VALID [2018-11-18 22:02:07,801 INFO L273 TraceCheckUtils]: 2: Hoare triple {56#true} assume true; {56#true} is VALID [2018-11-18 22:02:07,802 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {56#true} {56#true} #126#return; {56#true} is VALID [2018-11-18 22:02:07,802 INFO L256 TraceCheckUtils]: 4: Hoare triple {56#true} call #t~ret16 := main(); {56#true} is VALID [2018-11-18 22:02:07,803 INFO L273 TraceCheckUtils]: 5: Hoare triple {56#true} ~len~0 := 2bv32;~data~0 := 1bv32;call ~#s~0.base, ~#s~0.offset := #Ultimate.alloc(4bv32);call write~$Pointer$(0bv32, 0bv32, ~#s~0.base, ~#s~0.offset, 4bv32); {56#true} is VALID [2018-11-18 22:02:07,803 INFO L256 TraceCheckUtils]: 6: Hoare triple {56#true} call #t~ret10.base, #t~ret10.offset := dll_create(~len~0, ~data~0); {56#true} is VALID [2018-11-18 22:02:07,803 INFO L273 TraceCheckUtils]: 7: Hoare triple {56#true} ~len := #in~len;~data := #in~data;~head~0.base, ~head~0.offset := 0bv32, 0bv32; {56#true} is VALID [2018-11-18 22:02:07,806 INFO L273 TraceCheckUtils]: 8: Hoare triple {56#true} assume !true; {57#false} is VALID [2018-11-18 22:02:07,806 INFO L273 TraceCheckUtils]: 9: Hoare triple {57#false} #res.base, #res.offset := ~head~0.base, ~head~0.offset; {57#false} is VALID [2018-11-18 22:02:07,806 INFO L273 TraceCheckUtils]: 10: Hoare triple {57#false} assume true; {57#false} is VALID [2018-11-18 22:02:07,807 INFO L268 TraceCheckUtils]: 11: Hoare quadruple {57#false} {56#true} #116#return; {57#false} is VALID [2018-11-18 22:02:07,807 INFO L273 TraceCheckUtils]: 12: Hoare triple {57#false} call write~$Pointer$(#t~ret10.base, #t~ret10.offset, ~#s~0.base, ~#s~0.offset, 4bv32);havoc #t~ret10.base, #t~ret10.offset; {57#false} is VALID [2018-11-18 22:02:07,807 INFO L256 TraceCheckUtils]: 13: Hoare triple {57#false} call dll_prepend(~#s~0.base, ~#s~0.offset, ~data~0); {57#false} is VALID [2018-11-18 22:02:07,808 INFO L273 TraceCheckUtils]: 14: Hoare triple {57#false} ~head.base, ~head.offset := #in~head.base, #in~head.offset;~data := #in~data; {57#false} is VALID [2018-11-18 22:02:07,808 INFO L256 TraceCheckUtils]: 15: Hoare triple {57#false} call #t~ret6.base, #t~ret6.offset := node_create(~data); {57#false} is VALID [2018-11-18 22:02:07,809 INFO L273 TraceCheckUtils]: 16: Hoare triple {57#false} ~data := #in~data;call #t~malloc2.base, #t~malloc2.offset := #Ultimate.alloc(12bv32);~temp~0.base, ~temp~0.offset := #t~malloc2.base, #t~malloc2.offset; {57#false} is VALID [2018-11-18 22:02:07,809 INFO L273 TraceCheckUtils]: 17: Hoare triple {57#false} assume !(0bv32 == ~temp~0.base && 0bv32 == ~temp~0.offset); {57#false} is VALID [2018-11-18 22:02:07,810 INFO L273 TraceCheckUtils]: 18: Hoare triple {57#false} call write~$Pointer$(0bv32, 0bv32, ~temp~0.base, ~bvadd32(4bv32, ~temp~0.offset), 4bv32);call write~$Pointer$(0bv32, 0bv32, ~temp~0.base, ~bvadd32(8bv32, ~temp~0.offset), 4bv32);call write~intINTTYPE4(~data, ~temp~0.base, ~temp~0.offset, 4bv32);#res.base, #res.offset := ~temp~0.base, ~temp~0.offset; {57#false} is VALID [2018-11-18 22:02:07,810 INFO L273 TraceCheckUtils]: 19: Hoare triple {57#false} assume true; {57#false} is VALID [2018-11-18 22:02:07,811 INFO L268 TraceCheckUtils]: 20: Hoare quadruple {57#false} {57#false} #124#return; {57#false} is VALID [2018-11-18 22:02:07,811 INFO L273 TraceCheckUtils]: 21: Hoare triple {57#false} ~new_head~1.base, ~new_head~1.offset := #t~ret6.base, #t~ret6.offset;havoc #t~ret6.base, #t~ret6.offset;call #t~mem7.base, #t~mem7.offset := read~$Pointer$(~head.base, ~head.offset, 4bv32);call write~$Pointer$(#t~mem7.base, #t~mem7.offset, ~new_head~1.base, ~bvadd32(4bv32, ~new_head~1.offset), 4bv32);havoc #t~mem7.base, #t~mem7.offset;call #t~mem8.base, #t~mem8.offset := read~$Pointer$(~head.base, ~head.offset, 4bv32); {57#false} is VALID [2018-11-18 22:02:07,811 INFO L273 TraceCheckUtils]: 22: Hoare triple {57#false} assume #t~mem8.base != 0bv32 || #t~mem8.offset != 0bv32;havoc #t~mem8.base, #t~mem8.offset;call #t~mem9.base, #t~mem9.offset := read~$Pointer$(~head.base, ~head.offset, 4bv32);call write~$Pointer$(~new_head~1.base, ~new_head~1.offset, #t~mem9.base, ~bvadd32(8bv32, #t~mem9.offset), 4bv32);havoc #t~mem9.base, #t~mem9.offset; {57#false} is VALID [2018-11-18 22:02:07,812 INFO L273 TraceCheckUtils]: 23: Hoare triple {57#false} call write~$Pointer$(~new_head~1.base, ~new_head~1.offset, ~head.base, ~head.offset, 4bv32); {57#false} is VALID [2018-11-18 22:02:07,812 INFO L273 TraceCheckUtils]: 24: Hoare triple {57#false} assume true; {57#false} is VALID [2018-11-18 22:02:07,813 INFO L268 TraceCheckUtils]: 25: Hoare quadruple {57#false} {57#false} #118#return; {57#false} is VALID [2018-11-18 22:02:07,813 INFO L273 TraceCheckUtils]: 26: Hoare triple {57#false} call #t~mem11.base, #t~mem11.offset := read~$Pointer$(~#s~0.base, ~#s~0.offset, 4bv32);~ptr~0.base, ~ptr~0.offset := #t~mem11.base, #t~mem11.offset;havoc #t~mem11.base, #t~mem11.offset;~count~0 := 0bv32; {57#false} is VALID [2018-11-18 22:02:07,813 INFO L273 TraceCheckUtils]: 27: Hoare triple {57#false} assume !true; {57#false} is VALID [2018-11-18 22:02:07,814 INFO L273 TraceCheckUtils]: 28: Hoare triple {57#false} assume ~count~0 != ~bvadd32(1bv32, ~len~0); {57#false} is VALID [2018-11-18 22:02:07,814 INFO L273 TraceCheckUtils]: 29: Hoare triple {57#false} assume !false; {57#false} is VALID [2018-11-18 22:02:07,821 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:02:07,822 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-18 22:02:07,827 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 22:02:07,828 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-18 22:02:07,833 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 30 [2018-11-18 22:02:07,836 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-18 22:02:07,841 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states. [2018-11-18 22:02:08,210 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 30 edges. 30 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 22:02:08,211 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-11-18 22:02:08,223 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-11-18 22:02:08,224 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-18 22:02:08,227 INFO L87 Difference]: Start difference. First operand 53 states. Second operand 2 states. [2018-11-18 22:02:08,859 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:02:08,860 INFO L93 Difference]: Finished difference Result 91 states and 108 transitions. [2018-11-18 22:02:08,860 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-11-18 22:02:08,860 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 30 [2018-11-18 22:02:08,860 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 22:02:08,862 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2018-11-18 22:02:08,875 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 108 transitions. [2018-11-18 22:02:08,875 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2018-11-18 22:02:08,882 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 108 transitions. [2018-11-18 22:02:08,883 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states and 108 transitions. [2018-11-18 22:02:09,219 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 108 edges. 108 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 22:02:09,234 INFO L225 Difference]: With dead ends: 91 [2018-11-18 22:02:09,234 INFO L226 Difference]: Without dead ends: 38 [2018-11-18 22:02:09,240 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 29 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:02:09,260 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2018-11-18 22:02:09,306 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 38. [2018-11-18 22:02:09,307 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-18 22:02:09,307 INFO L82 GeneralOperation]: Start isEquivalent. First operand 38 states. Second operand 38 states. [2018-11-18 22:02:09,308 INFO L74 IsIncluded]: Start isIncluded. First operand 38 states. Second operand 38 states. [2018-11-18 22:02:09,308 INFO L87 Difference]: Start difference. First operand 38 states. Second operand 38 states. [2018-11-18 22:02:09,313 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:02:09,314 INFO L93 Difference]: Finished difference Result 38 states and 42 transitions. [2018-11-18 22:02:09,314 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 42 transitions. [2018-11-18 22:02:09,314 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 22:02:09,315 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 22:02:09,315 INFO L74 IsIncluded]: Start isIncluded. First operand 38 states. Second operand 38 states. [2018-11-18 22:02:09,315 INFO L87 Difference]: Start difference. First operand 38 states. Second operand 38 states. [2018-11-18 22:02:09,320 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:02:09,320 INFO L93 Difference]: Finished difference Result 38 states and 42 transitions. [2018-11-18 22:02:09,321 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 42 transitions. [2018-11-18 22:02:09,321 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 22:02:09,322 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 22:02:09,322 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-18 22:02:09,322 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-18 22:02:09,322 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2018-11-18 22:02:09,326 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 42 transitions. [2018-11-18 22:02:09,328 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 42 transitions. Word has length 30 [2018-11-18 22:02:09,328 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 22:02:09,328 INFO L480 AbstractCegarLoop]: Abstraction has 38 states and 42 transitions. [2018-11-18 22:02:09,329 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-11-18 22:02:09,329 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 42 transitions. [2018-11-18 22:02:09,330 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-11-18 22:02:09,330 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 22:02:09,330 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, 1, 1, 1, 1] [2018-11-18 22:02:09,331 INFO L423 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 22:02:09,331 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 22:02:09,331 INFO L82 PathProgramCache]: Analyzing trace with hash -374766804, now seen corresponding path program 1 times [2018-11-18 22:02:09,332 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-18 22:02:09,332 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:02:09,349 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 22:02:09,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 22:02:09,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 22:02:09,457 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 22:02:09,627 INFO L256 TraceCheckUtils]: 0: Hoare triple {395#true} call ULTIMATE.init(); {395#true} is VALID [2018-11-18 22:02:09,628 INFO L273 TraceCheckUtils]: 1: Hoare triple {395#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {395#true} is VALID [2018-11-18 22:02:09,628 INFO L273 TraceCheckUtils]: 2: Hoare triple {395#true} assume true; {395#true} is VALID [2018-11-18 22:02:09,629 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {395#true} {395#true} #126#return; {395#true} is VALID [2018-11-18 22:02:09,629 INFO L256 TraceCheckUtils]: 4: Hoare triple {395#true} call #t~ret16 := main(); {395#true} is VALID [2018-11-18 22:02:09,639 INFO L273 TraceCheckUtils]: 5: Hoare triple {395#true} ~len~0 := 2bv32;~data~0 := 1bv32;call ~#s~0.base, ~#s~0.offset := #Ultimate.alloc(4bv32);call write~$Pointer$(0bv32, 0bv32, ~#s~0.base, ~#s~0.offset, 4bv32); {415#(= (bvadd main_~len~0 (_ bv4294967294 32)) (_ bv0 32))} is VALID [2018-11-18 22:02:09,639 INFO L256 TraceCheckUtils]: 6: Hoare triple {415#(= (bvadd main_~len~0 (_ bv4294967294 32)) (_ bv0 32))} call #t~ret10.base, #t~ret10.offset := dll_create(~len~0, ~data~0); {395#true} is VALID [2018-11-18 22:02:09,653 INFO L273 TraceCheckUtils]: 7: Hoare triple {395#true} ~len := #in~len;~data := #in~data;~head~0.base, ~head~0.offset := 0bv32, 0bv32; {422#(= dll_create_~len |dll_create_#in~len|)} is VALID [2018-11-18 22:02:09,669 INFO L273 TraceCheckUtils]: 8: Hoare triple {422#(= dll_create_~len |dll_create_#in~len|)} assume true; {422#(= dll_create_~len |dll_create_#in~len|)} is VALID [2018-11-18 22:02:09,674 INFO L273 TraceCheckUtils]: 9: Hoare triple {422#(= dll_create_~len |dll_create_#in~len|)} assume !~bvsgt32(~len, 0bv32); {429#(not (bvsgt |dll_create_#in~len| (_ bv0 32)))} is VALID [2018-11-18 22:02:09,675 INFO L273 TraceCheckUtils]: 10: Hoare triple {429#(not (bvsgt |dll_create_#in~len| (_ bv0 32)))} #res.base, #res.offset := ~head~0.base, ~head~0.offset; {429#(not (bvsgt |dll_create_#in~len| (_ bv0 32)))} is VALID [2018-11-18 22:02:09,682 INFO L273 TraceCheckUtils]: 11: Hoare triple {429#(not (bvsgt |dll_create_#in~len| (_ bv0 32)))} assume true; {429#(not (bvsgt |dll_create_#in~len| (_ bv0 32)))} is VALID [2018-11-18 22:02:09,687 INFO L268 TraceCheckUtils]: 12: Hoare quadruple {429#(not (bvsgt |dll_create_#in~len| (_ bv0 32)))} {415#(= (bvadd main_~len~0 (_ bv4294967294 32)) (_ bv0 32))} #116#return; {396#false} is VALID [2018-11-18 22:02:09,688 INFO L273 TraceCheckUtils]: 13: Hoare triple {396#false} call write~$Pointer$(#t~ret10.base, #t~ret10.offset, ~#s~0.base, ~#s~0.offset, 4bv32);havoc #t~ret10.base, #t~ret10.offset; {396#false} is VALID [2018-11-18 22:02:09,688 INFO L256 TraceCheckUtils]: 14: Hoare triple {396#false} call dll_prepend(~#s~0.base, ~#s~0.offset, ~data~0); {396#false} is VALID [2018-11-18 22:02:09,689 INFO L273 TraceCheckUtils]: 15: Hoare triple {396#false} ~head.base, ~head.offset := #in~head.base, #in~head.offset;~data := #in~data; {396#false} is VALID [2018-11-18 22:02:09,689 INFO L256 TraceCheckUtils]: 16: Hoare triple {396#false} call #t~ret6.base, #t~ret6.offset := node_create(~data); {396#false} is VALID [2018-11-18 22:02:09,689 INFO L273 TraceCheckUtils]: 17: Hoare triple {396#false} ~data := #in~data;call #t~malloc2.base, #t~malloc2.offset := #Ultimate.alloc(12bv32);~temp~0.base, ~temp~0.offset := #t~malloc2.base, #t~malloc2.offset; {396#false} is VALID [2018-11-18 22:02:09,689 INFO L273 TraceCheckUtils]: 18: Hoare triple {396#false} assume !(0bv32 == ~temp~0.base && 0bv32 == ~temp~0.offset); {396#false} is VALID [2018-11-18 22:02:09,690 INFO L273 TraceCheckUtils]: 19: Hoare triple {396#false} call write~$Pointer$(0bv32, 0bv32, ~temp~0.base, ~bvadd32(4bv32, ~temp~0.offset), 4bv32);call write~$Pointer$(0bv32, 0bv32, ~temp~0.base, ~bvadd32(8bv32, ~temp~0.offset), 4bv32);call write~intINTTYPE4(~data, ~temp~0.base, ~temp~0.offset, 4bv32);#res.base, #res.offset := ~temp~0.base, ~temp~0.offset; {396#false} is VALID [2018-11-18 22:02:09,691 INFO L273 TraceCheckUtils]: 20: Hoare triple {396#false} assume true; {396#false} is VALID [2018-11-18 22:02:09,691 INFO L268 TraceCheckUtils]: 21: Hoare quadruple {396#false} {396#false} #124#return; {396#false} is VALID [2018-11-18 22:02:09,691 INFO L273 TraceCheckUtils]: 22: Hoare triple {396#false} ~new_head~1.base, ~new_head~1.offset := #t~ret6.base, #t~ret6.offset;havoc #t~ret6.base, #t~ret6.offset;call #t~mem7.base, #t~mem7.offset := read~$Pointer$(~head.base, ~head.offset, 4bv32);call write~$Pointer$(#t~mem7.base, #t~mem7.offset, ~new_head~1.base, ~bvadd32(4bv32, ~new_head~1.offset), 4bv32);havoc #t~mem7.base, #t~mem7.offset;call #t~mem8.base, #t~mem8.offset := read~$Pointer$(~head.base, ~head.offset, 4bv32); {396#false} is VALID [2018-11-18 22:02:09,692 INFO L273 TraceCheckUtils]: 23: Hoare triple {396#false} assume #t~mem8.base != 0bv32 || #t~mem8.offset != 0bv32;havoc #t~mem8.base, #t~mem8.offset;call #t~mem9.base, #t~mem9.offset := read~$Pointer$(~head.base, ~head.offset, 4bv32);call write~$Pointer$(~new_head~1.base, ~new_head~1.offset, #t~mem9.base, ~bvadd32(8bv32, #t~mem9.offset), 4bv32);havoc #t~mem9.base, #t~mem9.offset; {396#false} is VALID [2018-11-18 22:02:09,692 INFO L273 TraceCheckUtils]: 24: Hoare triple {396#false} call write~$Pointer$(~new_head~1.base, ~new_head~1.offset, ~head.base, ~head.offset, 4bv32); {396#false} is VALID [2018-11-18 22:02:09,692 INFO L273 TraceCheckUtils]: 25: Hoare triple {396#false} assume true; {396#false} is VALID [2018-11-18 22:02:09,693 INFO L268 TraceCheckUtils]: 26: Hoare quadruple {396#false} {396#false} #118#return; {396#false} is VALID [2018-11-18 22:02:09,693 INFO L273 TraceCheckUtils]: 27: Hoare triple {396#false} call #t~mem11.base, #t~mem11.offset := read~$Pointer$(~#s~0.base, ~#s~0.offset, 4bv32);~ptr~0.base, ~ptr~0.offset := #t~mem11.base, #t~mem11.offset;havoc #t~mem11.base, #t~mem11.offset;~count~0 := 0bv32; {396#false} is VALID [2018-11-18 22:02:09,693 INFO L273 TraceCheckUtils]: 28: Hoare triple {396#false} assume true; {396#false} is VALID [2018-11-18 22:02:09,694 INFO L273 TraceCheckUtils]: 29: Hoare triple {396#false} assume !(~ptr~0.base != 0bv32 || ~ptr~0.offset != 0bv32); {396#false} is VALID [2018-11-18 22:02:09,694 INFO L273 TraceCheckUtils]: 30: Hoare triple {396#false} assume ~count~0 != ~bvadd32(1bv32, ~len~0); {396#false} is VALID [2018-11-18 22:02:09,694 INFO L273 TraceCheckUtils]: 31: Hoare triple {396#false} assume !false; {396#false} is VALID [2018-11-18 22:02:09,697 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:02:09,697 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-18 22:02:09,698 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 22:02:09,699 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-18 22:02:09,700 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 32 [2018-11-18 22:02:09,702 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-18 22:02:09,702 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2018-11-18 22:02:09,788 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 32 edges. 32 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 22:02:09,788 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-18 22:02:09,789 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-18 22:02:09,789 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-18 22:02:09,789 INFO L87 Difference]: Start difference. First operand 38 states and 42 transitions. Second operand 5 states. [2018-11-18 22:02:10,384 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:02:10,385 INFO L93 Difference]: Finished difference Result 68 states and 76 transitions. [2018-11-18 22:02:10,385 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-18 22:02:10,385 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 32 [2018-11-18 22:02:10,386 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 22:02:10,386 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-18 22:02:10,390 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 76 transitions. [2018-11-18 22:02:10,391 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-18 22:02:10,394 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 76 transitions. [2018-11-18 22:02:10,395 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 76 transitions. [2018-11-18 22:02:10,595 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:02:10,598 INFO L225 Difference]: With dead ends: 68 [2018-11-18 22:02:10,598 INFO L226 Difference]: Without dead ends: 44 [2018-11-18 22:02:10,600 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-11-18 22:02:10,600 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2018-11-18 22:02:10,626 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 40. [2018-11-18 22:02:10,626 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-18 22:02:10,626 INFO L82 GeneralOperation]: Start isEquivalent. First operand 44 states. Second operand 40 states. [2018-11-18 22:02:10,627 INFO L74 IsIncluded]: Start isIncluded. First operand 44 states. Second operand 40 states. [2018-11-18 22:02:10,627 INFO L87 Difference]: Start difference. First operand 44 states. Second operand 40 states. [2018-11-18 22:02:10,630 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:02:10,630 INFO L93 Difference]: Finished difference Result 44 states and 49 transitions. [2018-11-18 22:02:10,630 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 49 transitions. [2018-11-18 22:02:10,631 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 22:02:10,631 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 22:02:10,631 INFO L74 IsIncluded]: Start isIncluded. First operand 40 states. Second operand 44 states. [2018-11-18 22:02:10,632 INFO L87 Difference]: Start difference. First operand 40 states. Second operand 44 states. [2018-11-18 22:02:10,635 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:02:10,635 INFO L93 Difference]: Finished difference Result 44 states and 49 transitions. [2018-11-18 22:02:10,635 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 49 transitions. [2018-11-18 22:02:10,636 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 22:02:10,636 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 22:02:10,636 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-18 22:02:10,636 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-18 22:02:10,637 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2018-11-18 22:02:10,639 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 44 transitions. [2018-11-18 22:02:10,639 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 44 transitions. Word has length 32 [2018-11-18 22:02:10,640 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 22:02:10,640 INFO L480 AbstractCegarLoop]: Abstraction has 40 states and 44 transitions. [2018-11-18 22:02:10,640 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-18 22:02:10,640 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 44 transitions. [2018-11-18 22:02:10,641 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2018-11-18 22:02:10,641 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 22:02:10,642 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, 1, 1, 1, 1] [2018-11-18 22:02:10,642 INFO L423 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 22:02:10,642 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 22:02:10,642 INFO L82 PathProgramCache]: Analyzing trace with hash 11961176, now seen corresponding path program 1 times [2018-11-18 22:02:10,643 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-18 22:02:10,643 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:02:10,661 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 22:02:10,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 22:02:10,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 22:02:10,748 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 22:02:10,826 INFO L256 TraceCheckUtils]: 0: Hoare triple {727#true} call ULTIMATE.init(); {727#true} is VALID [2018-11-18 22:02:10,827 INFO L273 TraceCheckUtils]: 1: Hoare triple {727#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {727#true} is VALID [2018-11-18 22:02:10,828 INFO L273 TraceCheckUtils]: 2: Hoare triple {727#true} assume true; {727#true} is VALID [2018-11-18 22:02:10,828 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {727#true} {727#true} #126#return; {727#true} is VALID [2018-11-18 22:02:10,829 INFO L256 TraceCheckUtils]: 4: Hoare triple {727#true} call #t~ret16 := main(); {727#true} is VALID [2018-11-18 22:02:10,829 INFO L273 TraceCheckUtils]: 5: Hoare triple {727#true} ~len~0 := 2bv32;~data~0 := 1bv32;call ~#s~0.base, ~#s~0.offset := #Ultimate.alloc(4bv32);call write~$Pointer$(0bv32, 0bv32, ~#s~0.base, ~#s~0.offset, 4bv32); {727#true} is VALID [2018-11-18 22:02:10,830 INFO L256 TraceCheckUtils]: 6: Hoare triple {727#true} call #t~ret10.base, #t~ret10.offset := dll_create(~len~0, ~data~0); {727#true} is VALID [2018-11-18 22:02:10,831 INFO L273 TraceCheckUtils]: 7: Hoare triple {727#true} ~len := #in~len;~data := #in~data;~head~0.base, ~head~0.offset := 0bv32, 0bv32; {753#(and (= (_ bv0 32) dll_create_~head~0.base) (= (_ bv0 32) dll_create_~head~0.offset))} is VALID [2018-11-18 22:02:10,831 INFO L273 TraceCheckUtils]: 8: Hoare triple {753#(and (= (_ bv0 32) dll_create_~head~0.base) (= (_ bv0 32) dll_create_~head~0.offset))} assume true; {753#(and (= (_ bv0 32) dll_create_~head~0.base) (= (_ bv0 32) dll_create_~head~0.offset))} is VALID [2018-11-18 22:02:10,835 INFO L273 TraceCheckUtils]: 9: Hoare triple {753#(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; {753#(and (= (_ bv0 32) dll_create_~head~0.base) (= (_ bv0 32) dll_create_~head~0.offset))} is VALID [2018-11-18 22:02:10,835 INFO L273 TraceCheckUtils]: 10: Hoare triple {753#(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); {753#(and (= (_ bv0 32) dll_create_~head~0.base) (= (_ bv0 32) dll_create_~head~0.offset))} is VALID [2018-11-18 22:02:10,837 INFO L273 TraceCheckUtils]: 11: Hoare triple {753#(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); {753#(and (= (_ bv0 32) dll_create_~head~0.base) (= (_ bv0 32) dll_create_~head~0.offset))} is VALID [2018-11-18 22:02:10,839 INFO L273 TraceCheckUtils]: 12: Hoare triple {753#(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); {728#false} is VALID [2018-11-18 22:02:10,839 INFO L273 TraceCheckUtils]: 13: Hoare triple {728#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; {728#false} is VALID [2018-11-18 22:02:10,839 INFO L273 TraceCheckUtils]: 14: Hoare triple {728#false} assume true; {728#false} is VALID [2018-11-18 22:02:10,839 INFO L273 TraceCheckUtils]: 15: Hoare triple {728#false} assume !~bvsgt32(~len, 0bv32); {728#false} is VALID [2018-11-18 22:02:10,840 INFO L273 TraceCheckUtils]: 16: Hoare triple {728#false} #res.base, #res.offset := ~head~0.base, ~head~0.offset; {728#false} is VALID [2018-11-18 22:02:10,840 INFO L273 TraceCheckUtils]: 17: Hoare triple {728#false} assume true; {728#false} is VALID [2018-11-18 22:02:10,840 INFO L268 TraceCheckUtils]: 18: Hoare quadruple {728#false} {727#true} #116#return; {728#false} is VALID [2018-11-18 22:02:10,840 INFO L273 TraceCheckUtils]: 19: Hoare triple {728#false} call write~$Pointer$(#t~ret10.base, #t~ret10.offset, ~#s~0.base, ~#s~0.offset, 4bv32);havoc #t~ret10.base, #t~ret10.offset; {728#false} is VALID [2018-11-18 22:02:10,841 INFO L256 TraceCheckUtils]: 20: Hoare triple {728#false} call dll_prepend(~#s~0.base, ~#s~0.offset, ~data~0); {728#false} is VALID [2018-11-18 22:02:10,841 INFO L273 TraceCheckUtils]: 21: Hoare triple {728#false} ~head.base, ~head.offset := #in~head.base, #in~head.offset;~data := #in~data; {728#false} is VALID [2018-11-18 22:02:10,841 INFO L256 TraceCheckUtils]: 22: Hoare triple {728#false} call #t~ret6.base, #t~ret6.offset := node_create(~data); {728#false} is VALID [2018-11-18 22:02:10,842 INFO L273 TraceCheckUtils]: 23: Hoare triple {728#false} ~data := #in~data;call #t~malloc2.base, #t~malloc2.offset := #Ultimate.alloc(12bv32);~temp~0.base, ~temp~0.offset := #t~malloc2.base, #t~malloc2.offset; {728#false} is VALID [2018-11-18 22:02:10,842 INFO L273 TraceCheckUtils]: 24: Hoare triple {728#false} assume !(0bv32 == ~temp~0.base && 0bv32 == ~temp~0.offset); {728#false} is VALID [2018-11-18 22:02:10,842 INFO L273 TraceCheckUtils]: 25: Hoare triple {728#false} call write~$Pointer$(0bv32, 0bv32, ~temp~0.base, ~bvadd32(4bv32, ~temp~0.offset), 4bv32);call write~$Pointer$(0bv32, 0bv32, ~temp~0.base, ~bvadd32(8bv32, ~temp~0.offset), 4bv32);call write~intINTTYPE4(~data, ~temp~0.base, ~temp~0.offset, 4bv32);#res.base, #res.offset := ~temp~0.base, ~temp~0.offset; {728#false} is VALID [2018-11-18 22:02:10,842 INFO L273 TraceCheckUtils]: 26: Hoare triple {728#false} assume true; {728#false} is VALID [2018-11-18 22:02:10,843 INFO L268 TraceCheckUtils]: 27: Hoare quadruple {728#false} {728#false} #124#return; {728#false} is VALID [2018-11-18 22:02:10,843 INFO L273 TraceCheckUtils]: 28: Hoare triple {728#false} ~new_head~1.base, ~new_head~1.offset := #t~ret6.base, #t~ret6.offset;havoc #t~ret6.base, #t~ret6.offset;call #t~mem7.base, #t~mem7.offset := read~$Pointer$(~head.base, ~head.offset, 4bv32);call write~$Pointer$(#t~mem7.base, #t~mem7.offset, ~new_head~1.base, ~bvadd32(4bv32, ~new_head~1.offset), 4bv32);havoc #t~mem7.base, #t~mem7.offset;call #t~mem8.base, #t~mem8.offset := read~$Pointer$(~head.base, ~head.offset, 4bv32); {728#false} is VALID [2018-11-18 22:02:10,843 INFO L273 TraceCheckUtils]: 29: Hoare triple {728#false} assume #t~mem8.base != 0bv32 || #t~mem8.offset != 0bv32;havoc #t~mem8.base, #t~mem8.offset;call #t~mem9.base, #t~mem9.offset := read~$Pointer$(~head.base, ~head.offset, 4bv32);call write~$Pointer$(~new_head~1.base, ~new_head~1.offset, #t~mem9.base, ~bvadd32(8bv32, #t~mem9.offset), 4bv32);havoc #t~mem9.base, #t~mem9.offset; {728#false} is VALID [2018-11-18 22:02:10,843 INFO L273 TraceCheckUtils]: 30: Hoare triple {728#false} call write~$Pointer$(~new_head~1.base, ~new_head~1.offset, ~head.base, ~head.offset, 4bv32); {728#false} is VALID [2018-11-18 22:02:10,844 INFO L273 TraceCheckUtils]: 31: Hoare triple {728#false} assume true; {728#false} is VALID [2018-11-18 22:02:10,844 INFO L268 TraceCheckUtils]: 32: Hoare quadruple {728#false} {728#false} #118#return; {728#false} is VALID [2018-11-18 22:02:10,844 INFO L273 TraceCheckUtils]: 33: Hoare triple {728#false} call #t~mem11.base, #t~mem11.offset := read~$Pointer$(~#s~0.base, ~#s~0.offset, 4bv32);~ptr~0.base, ~ptr~0.offset := #t~mem11.base, #t~mem11.offset;havoc #t~mem11.base, #t~mem11.offset;~count~0 := 0bv32; {728#false} is VALID [2018-11-18 22:02:10,844 INFO L273 TraceCheckUtils]: 34: Hoare triple {728#false} assume true; {728#false} is VALID [2018-11-18 22:02:10,844 INFO L273 TraceCheckUtils]: 35: Hoare triple {728#false} assume !(~ptr~0.base != 0bv32 || ~ptr~0.offset != 0bv32); {728#false} is VALID [2018-11-18 22:02:10,845 INFO L273 TraceCheckUtils]: 36: Hoare triple {728#false} assume ~count~0 != ~bvadd32(1bv32, ~len~0); {728#false} is VALID [2018-11-18 22:02:10,845 INFO L273 TraceCheckUtils]: 37: Hoare triple {728#false} assume !false; {728#false} is VALID [2018-11-18 22:02:10,848 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:02:10,848 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-18 22:02:10,850 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 22:02:10,850 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 22:02:10,851 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 38 [2018-11-18 22:02:10,852 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-18 22:02:10,852 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-11-18 22:02:10,920 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 38 edges. 38 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 22:02:10,921 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-18 22:02:10,921 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 22:02:10,921 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 22:02:10,922 INFO L87 Difference]: Start difference. First operand 40 states and 44 transitions. Second operand 3 states. [2018-11-18 22:02:11,184 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:02:11,185 INFO L93 Difference]: Finished difference Result 74 states and 83 transitions. [2018-11-18 22:02:11,185 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 22:02:11,185 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 38 [2018-11-18 22:02:11,185 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 22:02:11,186 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-18 22:02:11,189 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 83 transitions. [2018-11-18 22:02:11,189 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-18 22:02:11,193 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 83 transitions. [2018-11-18 22:02:11,193 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 83 transitions. [2018-11-18 22:02:11,399 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 83 edges. 83 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 22:02:11,403 INFO L225 Difference]: With dead ends: 74 [2018-11-18 22:02:11,403 INFO L226 Difference]: Without dead ends: 44 [2018-11-18 22:02:11,404 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 36 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:02:11,404 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2018-11-18 22:02:11,429 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 43. [2018-11-18 22:02:11,429 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-18 22:02:11,430 INFO L82 GeneralOperation]: Start isEquivalent. First operand 44 states. Second operand 43 states. [2018-11-18 22:02:11,430 INFO L74 IsIncluded]: Start isIncluded. First operand 44 states. Second operand 43 states. [2018-11-18 22:02:11,430 INFO L87 Difference]: Start difference. First operand 44 states. Second operand 43 states. [2018-11-18 22:02:11,434 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:02:11,434 INFO L93 Difference]: Finished difference Result 44 states and 48 transitions. [2018-11-18 22:02:11,434 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 48 transitions. [2018-11-18 22:02:11,435 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 22:02:11,435 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 22:02:11,435 INFO L74 IsIncluded]: Start isIncluded. First operand 43 states. Second operand 44 states. [2018-11-18 22:02:11,435 INFO L87 Difference]: Start difference. First operand 43 states. Second operand 44 states. [2018-11-18 22:02:11,438 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:02:11,438 INFO L93 Difference]: Finished difference Result 44 states and 48 transitions. [2018-11-18 22:02:11,438 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 48 transitions. [2018-11-18 22:02:11,439 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 22:02:11,439 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 22:02:11,439 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-18 22:02:11,440 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-18 22:02:11,440 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2018-11-18 22:02:11,442 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 47 transitions. [2018-11-18 22:02:11,442 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 47 transitions. Word has length 38 [2018-11-18 22:02:11,443 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 22:02:11,443 INFO L480 AbstractCegarLoop]: Abstraction has 43 states and 47 transitions. [2018-11-18 22:02:11,443 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-18 22:02:11,443 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 47 transitions. [2018-11-18 22:02:11,444 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2018-11-18 22:02:11,444 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 22:02:11,445 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, 1, 1, 1, 1] [2018-11-18 22:02:11,445 INFO L423 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 22:02:11,445 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 22:02:11,445 INFO L82 PathProgramCache]: Analyzing trace with hash 74000790, now seen corresponding path program 1 times [2018-11-18 22:02:11,446 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-18 22:02:11,446 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:02:11,475 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 22:02:11,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 22:02:11,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 22:02:11,606 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 22:02:11,813 INFO L256 TraceCheckUtils]: 0: Hoare triple {1083#true} call ULTIMATE.init(); {1083#true} is VALID [2018-11-18 22:02:11,813 INFO L273 TraceCheckUtils]: 1: Hoare triple {1083#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {1083#true} is VALID [2018-11-18 22:02:11,814 INFO L273 TraceCheckUtils]: 2: Hoare triple {1083#true} assume true; {1083#true} is VALID [2018-11-18 22:02:11,814 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1083#true} {1083#true} #126#return; {1083#true} is VALID [2018-11-18 22:02:11,815 INFO L256 TraceCheckUtils]: 4: Hoare triple {1083#true} call #t~ret16 := main(); {1083#true} is VALID [2018-11-18 22:02:11,821 INFO L273 TraceCheckUtils]: 5: Hoare triple {1083#true} ~len~0 := 2bv32;~data~0 := 1bv32;call ~#s~0.base, ~#s~0.offset := #Ultimate.alloc(4bv32);call write~$Pointer$(0bv32, 0bv32, ~#s~0.base, ~#s~0.offset, 4bv32); {1103#(= (bvadd main_~len~0 (_ bv4294967294 32)) (_ bv0 32))} is VALID [2018-11-18 22:02:11,821 INFO L256 TraceCheckUtils]: 6: Hoare triple {1103#(= (bvadd main_~len~0 (_ bv4294967294 32)) (_ bv0 32))} call #t~ret10.base, #t~ret10.offset := dll_create(~len~0, ~data~0); {1083#true} is VALID [2018-11-18 22:02:11,822 INFO L273 TraceCheckUtils]: 7: Hoare triple {1083#true} ~len := #in~len;~data := #in~data;~head~0.base, ~head~0.offset := 0bv32, 0bv32; {1110#(= dll_create_~len |dll_create_#in~len|)} is VALID [2018-11-18 22:02:11,822 INFO L273 TraceCheckUtils]: 8: Hoare triple {1110#(= dll_create_~len |dll_create_#in~len|)} assume true; {1110#(= dll_create_~len |dll_create_#in~len|)} is VALID [2018-11-18 22:02:11,823 INFO L273 TraceCheckUtils]: 9: Hoare triple {1110#(= 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; {1110#(= dll_create_~len |dll_create_#in~len|)} is VALID [2018-11-18 22:02:11,823 INFO L273 TraceCheckUtils]: 10: Hoare triple {1110#(= dll_create_~len |dll_create_#in~len|)} assume !(0bv32 == ~new_head~0.base && 0bv32 == ~new_head~0.offset); {1110#(= dll_create_~len |dll_create_#in~len|)} is VALID [2018-11-18 22:02:11,824 INFO L273 TraceCheckUtils]: 11: Hoare triple {1110#(= 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); {1110#(= dll_create_~len |dll_create_#in~len|)} is VALID [2018-11-18 22:02:11,845 INFO L273 TraceCheckUtils]: 12: Hoare triple {1110#(= dll_create_~len |dll_create_#in~len|)} assume !(~head~0.base != 0bv32 || ~head~0.offset != 0bv32); {1110#(= dll_create_~len |dll_create_#in~len|)} is VALID [2018-11-18 22:02:11,859 INFO L273 TraceCheckUtils]: 13: Hoare triple {1110#(= 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; {1129#(= (bvadd dll_create_~len (_ bv1 32)) |dll_create_#in~len|)} is VALID [2018-11-18 22:02:11,875 INFO L273 TraceCheckUtils]: 14: Hoare triple {1129#(= (bvadd dll_create_~len (_ bv1 32)) |dll_create_#in~len|)} assume true; {1129#(= (bvadd dll_create_~len (_ bv1 32)) |dll_create_#in~len|)} is VALID [2018-11-18 22:02:11,889 INFO L273 TraceCheckUtils]: 15: Hoare triple {1129#(= (bvadd dll_create_~len (_ bv1 32)) |dll_create_#in~len|)} assume !~bvsgt32(~len, 0bv32); {1136#(not (bvsgt (bvadd |dll_create_#in~len| (_ bv4294967295 32)) (_ bv0 32)))} is VALID [2018-11-18 22:02:11,889 INFO L273 TraceCheckUtils]: 16: Hoare triple {1136#(not (bvsgt (bvadd |dll_create_#in~len| (_ bv4294967295 32)) (_ bv0 32)))} #res.base, #res.offset := ~head~0.base, ~head~0.offset; {1136#(not (bvsgt (bvadd |dll_create_#in~len| (_ bv4294967295 32)) (_ bv0 32)))} is VALID [2018-11-18 22:02:11,894 INFO L273 TraceCheckUtils]: 17: Hoare triple {1136#(not (bvsgt (bvadd |dll_create_#in~len| (_ bv4294967295 32)) (_ bv0 32)))} assume true; {1136#(not (bvsgt (bvadd |dll_create_#in~len| (_ bv4294967295 32)) (_ bv0 32)))} is VALID [2018-11-18 22:02:11,896 INFO L268 TraceCheckUtils]: 18: Hoare quadruple {1136#(not (bvsgt (bvadd |dll_create_#in~len| (_ bv4294967295 32)) (_ bv0 32)))} {1103#(= (bvadd main_~len~0 (_ bv4294967294 32)) (_ bv0 32))} #116#return; {1084#false} is VALID [2018-11-18 22:02:11,896 INFO L273 TraceCheckUtils]: 19: Hoare triple {1084#false} call write~$Pointer$(#t~ret10.base, #t~ret10.offset, ~#s~0.base, ~#s~0.offset, 4bv32);havoc #t~ret10.base, #t~ret10.offset; {1084#false} is VALID [2018-11-18 22:02:11,896 INFO L256 TraceCheckUtils]: 20: Hoare triple {1084#false} call dll_prepend(~#s~0.base, ~#s~0.offset, ~data~0); {1084#false} is VALID [2018-11-18 22:02:11,897 INFO L273 TraceCheckUtils]: 21: Hoare triple {1084#false} ~head.base, ~head.offset := #in~head.base, #in~head.offset;~data := #in~data; {1084#false} is VALID [2018-11-18 22:02:11,897 INFO L256 TraceCheckUtils]: 22: Hoare triple {1084#false} call #t~ret6.base, #t~ret6.offset := node_create(~data); {1084#false} is VALID [2018-11-18 22:02:11,897 INFO L273 TraceCheckUtils]: 23: Hoare triple {1084#false} ~data := #in~data;call #t~malloc2.base, #t~malloc2.offset := #Ultimate.alloc(12bv32);~temp~0.base, ~temp~0.offset := #t~malloc2.base, #t~malloc2.offset; {1084#false} is VALID [2018-11-18 22:02:11,897 INFO L273 TraceCheckUtils]: 24: Hoare triple {1084#false} assume !(0bv32 == ~temp~0.base && 0bv32 == ~temp~0.offset); {1084#false} is VALID [2018-11-18 22:02:11,898 INFO L273 TraceCheckUtils]: 25: Hoare triple {1084#false} call write~$Pointer$(0bv32, 0bv32, ~temp~0.base, ~bvadd32(4bv32, ~temp~0.offset), 4bv32);call write~$Pointer$(0bv32, 0bv32, ~temp~0.base, ~bvadd32(8bv32, ~temp~0.offset), 4bv32);call write~intINTTYPE4(~data, ~temp~0.base, ~temp~0.offset, 4bv32);#res.base, #res.offset := ~temp~0.base, ~temp~0.offset; {1084#false} is VALID [2018-11-18 22:02:11,898 INFO L273 TraceCheckUtils]: 26: Hoare triple {1084#false} assume true; {1084#false} is VALID [2018-11-18 22:02:11,898 INFO L268 TraceCheckUtils]: 27: Hoare quadruple {1084#false} {1084#false} #124#return; {1084#false} is VALID [2018-11-18 22:02:11,899 INFO L273 TraceCheckUtils]: 28: Hoare triple {1084#false} ~new_head~1.base, ~new_head~1.offset := #t~ret6.base, #t~ret6.offset;havoc #t~ret6.base, #t~ret6.offset;call #t~mem7.base, #t~mem7.offset := read~$Pointer$(~head.base, ~head.offset, 4bv32);call write~$Pointer$(#t~mem7.base, #t~mem7.offset, ~new_head~1.base, ~bvadd32(4bv32, ~new_head~1.offset), 4bv32);havoc #t~mem7.base, #t~mem7.offset;call #t~mem8.base, #t~mem8.offset := read~$Pointer$(~head.base, ~head.offset, 4bv32); {1084#false} is VALID [2018-11-18 22:02:11,899 INFO L273 TraceCheckUtils]: 29: Hoare triple {1084#false} assume #t~mem8.base != 0bv32 || #t~mem8.offset != 0bv32;havoc #t~mem8.base, #t~mem8.offset;call #t~mem9.base, #t~mem9.offset := read~$Pointer$(~head.base, ~head.offset, 4bv32);call write~$Pointer$(~new_head~1.base, ~new_head~1.offset, #t~mem9.base, ~bvadd32(8bv32, #t~mem9.offset), 4bv32);havoc #t~mem9.base, #t~mem9.offset; {1084#false} is VALID [2018-11-18 22:02:11,899 INFO L273 TraceCheckUtils]: 30: Hoare triple {1084#false} call write~$Pointer$(~new_head~1.base, ~new_head~1.offset, ~head.base, ~head.offset, 4bv32); {1084#false} is VALID [2018-11-18 22:02:11,900 INFO L273 TraceCheckUtils]: 31: Hoare triple {1084#false} assume true; {1084#false} is VALID [2018-11-18 22:02:11,900 INFO L268 TraceCheckUtils]: 32: Hoare quadruple {1084#false} {1084#false} #118#return; {1084#false} is VALID [2018-11-18 22:02:11,900 INFO L273 TraceCheckUtils]: 33: Hoare triple {1084#false} call #t~mem11.base, #t~mem11.offset := read~$Pointer$(~#s~0.base, ~#s~0.offset, 4bv32);~ptr~0.base, ~ptr~0.offset := #t~mem11.base, #t~mem11.offset;havoc #t~mem11.base, #t~mem11.offset;~count~0 := 0bv32; {1084#false} is VALID [2018-11-18 22:02:11,901 INFO L273 TraceCheckUtils]: 34: Hoare triple {1084#false} assume true; {1084#false} is VALID [2018-11-18 22:02:11,901 INFO L273 TraceCheckUtils]: 35: Hoare triple {1084#false} assume !(~ptr~0.base != 0bv32 || ~ptr~0.offset != 0bv32); {1084#false} is VALID [2018-11-18 22:02:11,901 INFO L273 TraceCheckUtils]: 36: Hoare triple {1084#false} assume ~count~0 != ~bvadd32(1bv32, ~len~0); {1084#false} is VALID [2018-11-18 22:02:11,901 INFO L273 TraceCheckUtils]: 37: Hoare triple {1084#false} assume !false; {1084#false} is VALID [2018-11-18 22:02:11,904 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:02:11,914 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-18 22:02:12,361 INFO L273 TraceCheckUtils]: 37: Hoare triple {1084#false} assume !false; {1084#false} is VALID [2018-11-18 22:02:12,362 INFO L273 TraceCheckUtils]: 36: Hoare triple {1084#false} assume ~count~0 != ~bvadd32(1bv32, ~len~0); {1084#false} is VALID [2018-11-18 22:02:12,362 INFO L273 TraceCheckUtils]: 35: Hoare triple {1084#false} assume !(~ptr~0.base != 0bv32 || ~ptr~0.offset != 0bv32); {1084#false} is VALID [2018-11-18 22:02:12,363 INFO L273 TraceCheckUtils]: 34: Hoare triple {1084#false} assume true; {1084#false} is VALID [2018-11-18 22:02:12,363 INFO L273 TraceCheckUtils]: 33: Hoare triple {1084#false} call #t~mem11.base, #t~mem11.offset := read~$Pointer$(~#s~0.base, ~#s~0.offset, 4bv32);~ptr~0.base, ~ptr~0.offset := #t~mem11.base, #t~mem11.offset;havoc #t~mem11.base, #t~mem11.offset;~count~0 := 0bv32; {1084#false} is VALID [2018-11-18 22:02:12,363 INFO L268 TraceCheckUtils]: 32: Hoare quadruple {1083#true} {1084#false} #118#return; {1084#false} is VALID [2018-11-18 22:02:12,364 INFO L273 TraceCheckUtils]: 31: Hoare triple {1083#true} assume true; {1083#true} is VALID [2018-11-18 22:02:12,364 INFO L273 TraceCheckUtils]: 30: Hoare triple {1083#true} call write~$Pointer$(~new_head~1.base, ~new_head~1.offset, ~head.base, ~head.offset, 4bv32); {1083#true} is VALID [2018-11-18 22:02:12,364 INFO L273 TraceCheckUtils]: 29: Hoare triple {1083#true} assume #t~mem8.base != 0bv32 || #t~mem8.offset != 0bv32;havoc #t~mem8.base, #t~mem8.offset;call #t~mem9.base, #t~mem9.offset := read~$Pointer$(~head.base, ~head.offset, 4bv32);call write~$Pointer$(~new_head~1.base, ~new_head~1.offset, #t~mem9.base, ~bvadd32(8bv32, #t~mem9.offset), 4bv32);havoc #t~mem9.base, #t~mem9.offset; {1083#true} is VALID [2018-11-18 22:02:12,365 INFO L273 TraceCheckUtils]: 28: Hoare triple {1083#true} ~new_head~1.base, ~new_head~1.offset := #t~ret6.base, #t~ret6.offset;havoc #t~ret6.base, #t~ret6.offset;call #t~mem7.base, #t~mem7.offset := read~$Pointer$(~head.base, ~head.offset, 4bv32);call write~$Pointer$(#t~mem7.base, #t~mem7.offset, ~new_head~1.base, ~bvadd32(4bv32, ~new_head~1.offset), 4bv32);havoc #t~mem7.base, #t~mem7.offset;call #t~mem8.base, #t~mem8.offset := read~$Pointer$(~head.base, ~head.offset, 4bv32); {1083#true} is VALID [2018-11-18 22:02:12,365 INFO L268 TraceCheckUtils]: 27: Hoare quadruple {1083#true} {1083#true} #124#return; {1083#true} is VALID [2018-11-18 22:02:12,365 INFO L273 TraceCheckUtils]: 26: Hoare triple {1083#true} assume true; {1083#true} is VALID [2018-11-18 22:02:12,365 INFO L273 TraceCheckUtils]: 25: Hoare triple {1083#true} call write~$Pointer$(0bv32, 0bv32, ~temp~0.base, ~bvadd32(4bv32, ~temp~0.offset), 4bv32);call write~$Pointer$(0bv32, 0bv32, ~temp~0.base, ~bvadd32(8bv32, ~temp~0.offset), 4bv32);call write~intINTTYPE4(~data, ~temp~0.base, ~temp~0.offset, 4bv32);#res.base, #res.offset := ~temp~0.base, ~temp~0.offset; {1083#true} is VALID [2018-11-18 22:02:12,366 INFO L273 TraceCheckUtils]: 24: Hoare triple {1083#true} assume !(0bv32 == ~temp~0.base && 0bv32 == ~temp~0.offset); {1083#true} is VALID [2018-11-18 22:02:12,366 INFO L273 TraceCheckUtils]: 23: Hoare triple {1083#true} ~data := #in~data;call #t~malloc2.base, #t~malloc2.offset := #Ultimate.alloc(12bv32);~temp~0.base, ~temp~0.offset := #t~malloc2.base, #t~malloc2.offset; {1083#true} is VALID [2018-11-18 22:02:12,366 INFO L256 TraceCheckUtils]: 22: Hoare triple {1083#true} call #t~ret6.base, #t~ret6.offset := node_create(~data); {1083#true} is VALID [2018-11-18 22:02:12,366 INFO L273 TraceCheckUtils]: 21: Hoare triple {1083#true} ~head.base, ~head.offset := #in~head.base, #in~head.offset;~data := #in~data; {1083#true} is VALID [2018-11-18 22:02:12,366 INFO L256 TraceCheckUtils]: 20: Hoare triple {1084#false} call dll_prepend(~#s~0.base, ~#s~0.offset, ~data~0); {1083#true} is VALID [2018-11-18 22:02:12,367 INFO L273 TraceCheckUtils]: 19: Hoare triple {1084#false} call write~$Pointer$(#t~ret10.base, #t~ret10.offset, ~#s~0.base, ~#s~0.offset, 4bv32);havoc #t~ret10.base, #t~ret10.offset; {1084#false} is VALID [2018-11-18 22:02:12,368 INFO L268 TraceCheckUtils]: 18: Hoare quadruple {1136#(not (bvsgt (bvadd |dll_create_#in~len| (_ bv4294967295 32)) (_ bv0 32)))} {1260#(bvsgt (bvadd main_~len~0 (_ bv4294967295 32)) (_ bv0 32))} #116#return; {1084#false} is VALID [2018-11-18 22:02:12,368 INFO L273 TraceCheckUtils]: 17: Hoare triple {1136#(not (bvsgt (bvadd |dll_create_#in~len| (_ bv4294967295 32)) (_ bv0 32)))} assume true; {1136#(not (bvsgt (bvadd |dll_create_#in~len| (_ bv4294967295 32)) (_ bv0 32)))} is VALID [2018-11-18 22:02:12,369 INFO L273 TraceCheckUtils]: 16: Hoare triple {1136#(not (bvsgt (bvadd |dll_create_#in~len| (_ bv4294967295 32)) (_ bv0 32)))} #res.base, #res.offset := ~head~0.base, ~head~0.offset; {1136#(not (bvsgt (bvadd |dll_create_#in~len| (_ bv4294967295 32)) (_ bv0 32)))} is VALID [2018-11-18 22:02:12,370 INFO L273 TraceCheckUtils]: 15: Hoare triple {1273#(or (bvsgt dll_create_~len (_ bv0 32)) (not (bvsgt (bvadd |dll_create_#in~len| (_ bv4294967295 32)) (_ bv0 32))))} assume !~bvsgt32(~len, 0bv32); {1136#(not (bvsgt (bvadd |dll_create_#in~len| (_ bv4294967295 32)) (_ bv0 32)))} is VALID [2018-11-18 22:02:12,370 INFO L273 TraceCheckUtils]: 14: Hoare triple {1273#(or (bvsgt dll_create_~len (_ bv0 32)) (not (bvsgt (bvadd |dll_create_#in~len| (_ bv4294967295 32)) (_ bv0 32))))} assume true; {1273#(or (bvsgt dll_create_~len (_ bv0 32)) (not (bvsgt (bvadd |dll_create_#in~len| (_ bv4294967295 32)) (_ bv0 32))))} is VALID [2018-11-18 22:02:12,374 INFO L273 TraceCheckUtils]: 13: Hoare triple {1280#(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; {1273#(or (bvsgt dll_create_~len (_ bv0 32)) (not (bvsgt (bvadd |dll_create_#in~len| (_ bv4294967295 32)) (_ bv0 32))))} is VALID [2018-11-18 22:02:12,375 INFO L273 TraceCheckUtils]: 12: Hoare triple {1280#(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); {1280#(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:02:12,375 INFO L273 TraceCheckUtils]: 11: Hoare triple {1280#(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); {1280#(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:02:12,378 INFO L273 TraceCheckUtils]: 10: Hoare triple {1280#(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); {1280#(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:02:12,378 INFO L273 TraceCheckUtils]: 9: Hoare triple {1280#(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; {1280#(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:02:12,380 INFO L273 TraceCheckUtils]: 8: Hoare triple {1280#(or (bvsgt (bvadd dll_create_~len (_ bv4294967295 32)) (_ bv0 32)) (not (bvsgt (bvadd |dll_create_#in~len| (_ bv4294967295 32)) (_ bv0 32))))} assume true; {1280#(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:02:12,382 INFO L273 TraceCheckUtils]: 7: Hoare triple {1083#true} ~len := #in~len;~data := #in~data;~head~0.base, ~head~0.offset := 0bv32, 0bv32; {1280#(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:02:12,382 INFO L256 TraceCheckUtils]: 6: Hoare triple {1260#(bvsgt (bvadd main_~len~0 (_ bv4294967295 32)) (_ bv0 32))} call #t~ret10.base, #t~ret10.offset := dll_create(~len~0, ~data~0); {1083#true} is VALID [2018-11-18 22:02:12,387 INFO L273 TraceCheckUtils]: 5: Hoare triple {1083#true} ~len~0 := 2bv32;~data~0 := 1bv32;call ~#s~0.base, ~#s~0.offset := #Ultimate.alloc(4bv32);call write~$Pointer$(0bv32, 0bv32, ~#s~0.base, ~#s~0.offset, 4bv32); {1260#(bvsgt (bvadd main_~len~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-18 22:02:12,387 INFO L256 TraceCheckUtils]: 4: Hoare triple {1083#true} call #t~ret16 := main(); {1083#true} is VALID [2018-11-18 22:02:12,388 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1083#true} {1083#true} #126#return; {1083#true} is VALID [2018-11-18 22:02:12,388 INFO L273 TraceCheckUtils]: 2: Hoare triple {1083#true} assume true; {1083#true} is VALID [2018-11-18 22:02:12,388 INFO L273 TraceCheckUtils]: 1: Hoare triple {1083#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {1083#true} is VALID [2018-11-18 22:02:12,388 INFO L256 TraceCheckUtils]: 0: Hoare triple {1083#true} call ULTIMATE.init(); {1083#true} is VALID [2018-11-18 22:02:12,392 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [MP cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (5)] Exception during sending of exit command (exit): Broken pipe [2018-11-18 22:02:12,397 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-18 22:02:12,398 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 9 [2018-11-18 22:02:12,398 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 38 [2018-11-18 22:02:12,400 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-18 22:02:12,401 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 9 states. [2018-11-18 22:02:12,575 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 63 edges. 63 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 22:02:12,575 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-11-18 22:02:12,576 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-18 22:02:12,576 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2018-11-18 22:02:12,576 INFO L87 Difference]: Start difference. First operand 43 states and 47 transitions. Second operand 9 states. [2018-11-18 22:02:13,601 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:02:13,601 INFO L93 Difference]: Finished difference Result 74 states and 82 transitions. [2018-11-18 22:02:13,602 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-18 22:02:13,602 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 38 [2018-11-18 22:02:13,602 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 22:02:13,603 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2018-11-18 22:02:13,606 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 82 transitions. [2018-11-18 22:02:13,606 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2018-11-18 22:02:13,610 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 82 transitions. [2018-11-18 22:02:13,610 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states and 82 transitions. [2018-11-18 22:02:13,862 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 82 edges. 82 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 22:02:13,864 INFO L225 Difference]: With dead ends: 74 [2018-11-18 22:02:13,864 INFO L226 Difference]: Without dead ends: 50 [2018-11-18 22:02:13,865 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 68 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:02:13,865 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2018-11-18 22:02:13,878 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 46. [2018-11-18 22:02:13,879 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-18 22:02:13,879 INFO L82 GeneralOperation]: Start isEquivalent. First operand 50 states. Second operand 46 states. [2018-11-18 22:02:13,879 INFO L74 IsIncluded]: Start isIncluded. First operand 50 states. Second operand 46 states. [2018-11-18 22:02:13,879 INFO L87 Difference]: Start difference. First operand 50 states. Second operand 46 states. [2018-11-18 22:02:13,882 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:02:13,882 INFO L93 Difference]: Finished difference Result 50 states and 55 transitions. [2018-11-18 22:02:13,883 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 55 transitions. [2018-11-18 22:02:13,883 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 22:02:13,883 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 22:02:13,884 INFO L74 IsIncluded]: Start isIncluded. First operand 46 states. Second operand 50 states. [2018-11-18 22:02:13,884 INFO L87 Difference]: Start difference. First operand 46 states. Second operand 50 states. [2018-11-18 22:02:13,886 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:02:13,886 INFO L93 Difference]: Finished difference Result 50 states and 55 transitions. [2018-11-18 22:02:13,887 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 55 transitions. [2018-11-18 22:02:13,887 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 22:02:13,887 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 22:02:13,888 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-18 22:02:13,888 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-18 22:02:13,888 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2018-11-18 22:02:13,890 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 50 transitions. [2018-11-18 22:02:13,890 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 50 transitions. Word has length 38 [2018-11-18 22:02:13,890 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 22:02:13,890 INFO L480 AbstractCegarLoop]: Abstraction has 46 states and 50 transitions. [2018-11-18 22:02:13,890 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-11-18 22:02:13,891 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 50 transitions. [2018-11-18 22:02:13,892 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2018-11-18 22:02:13,892 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 22:02:13,892 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, 1, 1, 1, 1] [2018-11-18 22:02:13,892 INFO L423 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 22:02:13,892 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 22:02:13,893 INFO L82 PathProgramCache]: Analyzing trace with hash 32911938, now seen corresponding path program 1 times [2018-11-18 22:02:13,893 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-18 22:02:13,893 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:02:13,917 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 22:02:14,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 22:02:14,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 22:02:14,046 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 22:02:14,271 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:02:14,281 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-11-18 22:02:14,282 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 22:02:14,287 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 22:02:14,296 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-18 22:02:14,296 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:8 [2018-11-18 22:02:14,305 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-18 22:02:14,411 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 16 treesize of output 12 [2018-11-18 22:02:14,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, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 4 [2018-11-18 22:02:14,495 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 22:02:14,532 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 22:02:14,569 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-18 22:02:14,570 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:4 [2018-11-18 22:02:14,583 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-18 22:02:14,633 INFO L256 TraceCheckUtils]: 0: Hoare triple {1579#true} call ULTIMATE.init(); {1579#true} is VALID [2018-11-18 22:02:14,633 INFO L273 TraceCheckUtils]: 1: Hoare triple {1579#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {1579#true} is VALID [2018-11-18 22:02:14,634 INFO L273 TraceCheckUtils]: 2: Hoare triple {1579#true} assume true; {1579#true} is VALID [2018-11-18 22:02:14,634 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1579#true} {1579#true} #126#return; {1579#true} is VALID [2018-11-18 22:02:14,634 INFO L256 TraceCheckUtils]: 4: Hoare triple {1579#true} call #t~ret16 := main(); {1579#true} is VALID [2018-11-18 22:02:14,635 INFO L273 TraceCheckUtils]: 5: Hoare triple {1579#true} ~len~0 := 2bv32;~data~0 := 1bv32;call ~#s~0.base, ~#s~0.offset := #Ultimate.alloc(4bv32);call write~$Pointer$(0bv32, 0bv32, ~#s~0.base, ~#s~0.offset, 4bv32); {1599#(= |main_~#s~0.offset| (_ bv0 32))} is VALID [2018-11-18 22:02:14,635 INFO L256 TraceCheckUtils]: 6: Hoare triple {1599#(= |main_~#s~0.offset| (_ bv0 32))} call #t~ret10.base, #t~ret10.offset := dll_create(~len~0, ~data~0); {1579#true} is VALID [2018-11-18 22:02:14,635 INFO L273 TraceCheckUtils]: 7: Hoare triple {1579#true} ~len := #in~len;~data := #in~data;~head~0.base, ~head~0.offset := 0bv32, 0bv32; {1579#true} is VALID [2018-11-18 22:02:14,635 INFO L273 TraceCheckUtils]: 8: Hoare triple {1579#true} assume true; {1579#true} is VALID [2018-11-18 22:02:14,635 INFO L273 TraceCheckUtils]: 9: Hoare triple {1579#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; {1579#true} is VALID [2018-11-18 22:02:14,636 INFO L273 TraceCheckUtils]: 10: Hoare triple {1579#true} assume !(0bv32 == ~new_head~0.base && 0bv32 == ~new_head~0.offset); {1579#true} is VALID [2018-11-18 22:02:14,636 INFO L273 TraceCheckUtils]: 11: Hoare triple {1579#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); {1579#true} is VALID [2018-11-18 22:02:14,636 INFO L273 TraceCheckUtils]: 12: Hoare triple {1579#true} assume !(~head~0.base != 0bv32 || ~head~0.offset != 0bv32); {1579#true} is VALID [2018-11-18 22:02:14,636 INFO L273 TraceCheckUtils]: 13: Hoare triple {1579#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; {1579#true} is VALID [2018-11-18 22:02:14,637 INFO L273 TraceCheckUtils]: 14: Hoare triple {1579#true} assume true; {1579#true} is VALID [2018-11-18 22:02:14,637 INFO L273 TraceCheckUtils]: 15: Hoare triple {1579#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; {1579#true} is VALID [2018-11-18 22:02:14,637 INFO L273 TraceCheckUtils]: 16: Hoare triple {1579#true} assume !(0bv32 == ~new_head~0.base && 0bv32 == ~new_head~0.offset); {1579#true} is VALID [2018-11-18 22:02:14,637 INFO L273 TraceCheckUtils]: 17: Hoare triple {1579#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); {1579#true} is VALID [2018-11-18 22:02:14,637 INFO L273 TraceCheckUtils]: 18: Hoare triple {1579#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); {1579#true} is VALID [2018-11-18 22:02:14,638 INFO L273 TraceCheckUtils]: 19: Hoare triple {1579#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; {1579#true} is VALID [2018-11-18 22:02:14,638 INFO L273 TraceCheckUtils]: 20: Hoare triple {1579#true} assume true; {1579#true} is VALID [2018-11-18 22:02:14,638 INFO L273 TraceCheckUtils]: 21: Hoare triple {1579#true} assume !~bvsgt32(~len, 0bv32); {1579#true} is VALID [2018-11-18 22:02:14,639 INFO L273 TraceCheckUtils]: 22: Hoare triple {1579#true} #res.base, #res.offset := ~head~0.base, ~head~0.offset; {1579#true} is VALID [2018-11-18 22:02:14,639 INFO L273 TraceCheckUtils]: 23: Hoare triple {1579#true} assume true; {1579#true} is VALID [2018-11-18 22:02:14,648 INFO L268 TraceCheckUtils]: 24: Hoare quadruple {1579#true} {1599#(= |main_~#s~0.offset| (_ bv0 32))} #116#return; {1599#(= |main_~#s~0.offset| (_ bv0 32))} is VALID [2018-11-18 22:02:14,657 INFO L273 TraceCheckUtils]: 25: Hoare triple {1599#(= |main_~#s~0.offset| (_ bv0 32))} call write~$Pointer$(#t~ret10.base, #t~ret10.offset, ~#s~0.base, ~#s~0.offset, 4bv32);havoc #t~ret10.base, #t~ret10.offset; {1599#(= |main_~#s~0.offset| (_ bv0 32))} is VALID [2018-11-18 22:02:14,658 INFO L256 TraceCheckUtils]: 26: Hoare triple {1599#(= |main_~#s~0.offset| (_ bv0 32))} call dll_prepend(~#s~0.base, ~#s~0.offset, ~data~0); {1579#true} is VALID [2018-11-18 22:02:14,664 INFO L273 TraceCheckUtils]: 27: Hoare triple {1579#true} ~head.base, ~head.offset := #in~head.base, #in~head.offset;~data := #in~data; {1666#(and (= dll_prepend_~head.offset |dll_prepend_#in~head.offset|) (= |dll_prepend_#in~head.base| dll_prepend_~head.base))} is VALID [2018-11-18 22:02:14,664 INFO L256 TraceCheckUtils]: 28: Hoare triple {1666#(and (= dll_prepend_~head.offset |dll_prepend_#in~head.offset|) (= |dll_prepend_#in~head.base| dll_prepend_~head.base))} call #t~ret6.base, #t~ret6.offset := node_create(~data); {1579#true} is VALID [2018-11-18 22:02:14,666 INFO L273 TraceCheckUtils]: 29: Hoare triple {1579#true} ~data := #in~data;call #t~malloc2.base, #t~malloc2.offset := #Ultimate.alloc(12bv32);~temp~0.base, ~temp~0.offset := #t~malloc2.base, #t~malloc2.offset; {1673#(not (= (_ bv0 32) node_create_~temp~0.base))} is VALID [2018-11-18 22:02:14,666 INFO L273 TraceCheckUtils]: 30: Hoare triple {1673#(not (= (_ bv0 32) node_create_~temp~0.base))} assume !(0bv32 == ~temp~0.base && 0bv32 == ~temp~0.offset); {1673#(not (= (_ bv0 32) node_create_~temp~0.base))} is VALID [2018-11-18 22:02:14,667 INFO L273 TraceCheckUtils]: 31: Hoare triple {1673#(not (= (_ bv0 32) node_create_~temp~0.base))} call write~$Pointer$(0bv32, 0bv32, ~temp~0.base, ~bvadd32(4bv32, ~temp~0.offset), 4bv32);call write~$Pointer$(0bv32, 0bv32, ~temp~0.base, ~bvadd32(8bv32, ~temp~0.offset), 4bv32);call write~intINTTYPE4(~data, ~temp~0.base, ~temp~0.offset, 4bv32);#res.base, #res.offset := ~temp~0.base, ~temp~0.offset; {1680#(not (= (_ bv0 32) |node_create_#res.base|))} is VALID [2018-11-18 22:02:14,667 INFO L273 TraceCheckUtils]: 32: Hoare triple {1680#(not (= (_ bv0 32) |node_create_#res.base|))} assume true; {1680#(not (= (_ bv0 32) |node_create_#res.base|))} is VALID [2018-11-18 22:02:14,669 INFO L268 TraceCheckUtils]: 33: Hoare quadruple {1680#(not (= (_ bv0 32) |node_create_#res.base|))} {1666#(and (= dll_prepend_~head.offset |dll_prepend_#in~head.offset|) (= |dll_prepend_#in~head.base| dll_prepend_~head.base))} #124#return; {1687#(and (= dll_prepend_~head.offset |dll_prepend_#in~head.offset|) (= |dll_prepend_#in~head.base| dll_prepend_~head.base) (not (= (_ bv0 32) |dll_prepend_#t~ret6.base|)))} is VALID [2018-11-18 22:02:14,688 INFO L273 TraceCheckUtils]: 34: Hoare triple {1687#(and (= dll_prepend_~head.offset |dll_prepend_#in~head.offset|) (= |dll_prepend_#in~head.base| dll_prepend_~head.base) (not (= (_ bv0 32) |dll_prepend_#t~ret6.base|)))} ~new_head~1.base, ~new_head~1.offset := #t~ret6.base, #t~ret6.offset;havoc #t~ret6.base, #t~ret6.offset;call #t~mem7.base, #t~mem7.offset := read~$Pointer$(~head.base, ~head.offset, 4bv32);call write~$Pointer$(#t~mem7.base, #t~mem7.offset, ~new_head~1.base, ~bvadd32(4bv32, ~new_head~1.offset), 4bv32);havoc #t~mem7.base, #t~mem7.offset;call #t~mem8.base, #t~mem8.offset := read~$Pointer$(~head.base, ~head.offset, 4bv32); {1691#(and (not (= dll_prepend_~new_head~1.base (_ bv0 32))) (= dll_prepend_~head.offset |dll_prepend_#in~head.offset|) (= |dll_prepend_#in~head.base| dll_prepend_~head.base))} is VALID [2018-11-18 22:02:14,704 INFO L273 TraceCheckUtils]: 35: Hoare triple {1691#(and (not (= dll_prepend_~new_head~1.base (_ bv0 32))) (= dll_prepend_~head.offset |dll_prepend_#in~head.offset|) (= |dll_prepend_#in~head.base| dll_prepend_~head.base))} assume #t~mem8.base != 0bv32 || #t~mem8.offset != 0bv32;havoc #t~mem8.base, #t~mem8.offset;call #t~mem9.base, #t~mem9.offset := read~$Pointer$(~head.base, ~head.offset, 4bv32);call write~$Pointer$(~new_head~1.base, ~new_head~1.offset, #t~mem9.base, ~bvadd32(8bv32, #t~mem9.offset), 4bv32);havoc #t~mem9.base, #t~mem9.offset; {1691#(and (not (= dll_prepend_~new_head~1.base (_ bv0 32))) (= dll_prepend_~head.offset |dll_prepend_#in~head.offset|) (= |dll_prepend_#in~head.base| dll_prepend_~head.base))} is VALID [2018-11-18 22:02:14,718 INFO L273 TraceCheckUtils]: 36: Hoare triple {1691#(and (not (= dll_prepend_~new_head~1.base (_ bv0 32))) (= dll_prepend_~head.offset |dll_prepend_#in~head.offset|) (= |dll_prepend_#in~head.base| dll_prepend_~head.base))} call write~$Pointer$(~new_head~1.base, ~new_head~1.offset, ~head.base, ~head.offset, 4bv32); {1698#(not (= (select (select |#memory_$Pointer$.base| |dll_prepend_#in~head.base|) |dll_prepend_#in~head.offset|) (_ bv0 32)))} is VALID [2018-11-18 22:02:14,719 INFO L273 TraceCheckUtils]: 37: Hoare triple {1698#(not (= (select (select |#memory_$Pointer$.base| |dll_prepend_#in~head.base|) |dll_prepend_#in~head.offset|) (_ bv0 32)))} assume true; {1698#(not (= (select (select |#memory_$Pointer$.base| |dll_prepend_#in~head.base|) |dll_prepend_#in~head.offset|) (_ bv0 32)))} is VALID [2018-11-18 22:02:14,724 INFO L268 TraceCheckUtils]: 38: Hoare quadruple {1698#(not (= (select (select |#memory_$Pointer$.base| |dll_prepend_#in~head.base|) |dll_prepend_#in~head.offset|) (_ bv0 32)))} {1599#(= |main_~#s~0.offset| (_ bv0 32))} #118#return; {1705#(and (= |main_~#s~0.offset| (_ bv0 32)) (not (= (_ bv0 32) (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|))))} is VALID [2018-11-18 22:02:14,726 INFO L273 TraceCheckUtils]: 39: Hoare triple {1705#(and (= |main_~#s~0.offset| (_ bv0 32)) (not (= (_ bv0 32) (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|))))} call #t~mem11.base, #t~mem11.offset := read~$Pointer$(~#s~0.base, ~#s~0.offset, 4bv32);~ptr~0.base, ~ptr~0.offset := #t~mem11.base, #t~mem11.offset;havoc #t~mem11.base, #t~mem11.offset;~count~0 := 0bv32; {1709#(not (= (_ bv0 32) main_~ptr~0.base))} is VALID [2018-11-18 22:02:14,726 INFO L273 TraceCheckUtils]: 40: Hoare triple {1709#(not (= (_ bv0 32) main_~ptr~0.base))} assume true; {1709#(not (= (_ bv0 32) main_~ptr~0.base))} is VALID [2018-11-18 22:02:14,728 INFO L273 TraceCheckUtils]: 41: Hoare triple {1709#(not (= (_ bv0 32) main_~ptr~0.base))} assume !(~ptr~0.base != 0bv32 || ~ptr~0.offset != 0bv32); {1580#false} is VALID [2018-11-18 22:02:14,728 INFO L273 TraceCheckUtils]: 42: Hoare triple {1580#false} assume ~count~0 != ~bvadd32(1bv32, ~len~0); {1580#false} is VALID [2018-11-18 22:02:14,728 INFO L273 TraceCheckUtils]: 43: Hoare triple {1580#false} assume !false; {1580#false} is VALID [2018-11-18 22:02:14,732 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:02:14,732 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-18 22:02:14,735 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 22:02:14,736 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2018-11-18 22:02:14,736 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 44 [2018-11-18 22:02:14,736 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-18 22:02:14,737 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 11 states. [2018-11-18 22:02:14,830 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 38 edges. 38 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 22:02:14,830 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-11-18 22:02:14,830 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-11-18 22:02:14,831 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2018-11-18 22:02:14,831 INFO L87 Difference]: Start difference. First operand 46 states and 50 transitions. Second operand 11 states. [2018-11-18 22:02:16,196 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:02:16,196 INFO L93 Difference]: Finished difference Result 54 states and 58 transitions. [2018-11-18 22:02:16,196 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-11-18 22:02:16,196 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 44 [2018-11-18 22:02:16,197 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 22:02:16,197 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2018-11-18 22:02:16,199 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 50 transitions. [2018-11-18 22:02:16,200 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2018-11-18 22:02:16,202 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 50 transitions. [2018-11-18 22:02:16,202 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 11 states and 50 transitions. [2018-11-18 22:02:16,314 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 50 edges. 50 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 22:02:16,315 INFO L225 Difference]: With dead ends: 54 [2018-11-18 22:02:16,316 INFO L226 Difference]: Without dead ends: 51 [2018-11-18 22:02:16,316 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=36, Invalid=146, Unknown=0, NotChecked=0, Total=182 [2018-11-18 22:02:16,316 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2018-11-18 22:02:16,464 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 48. [2018-11-18 22:02:16,465 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-18 22:02:16,465 INFO L82 GeneralOperation]: Start isEquivalent. First operand 51 states. Second operand 48 states. [2018-11-18 22:02:16,465 INFO L74 IsIncluded]: Start isIncluded. First operand 51 states. Second operand 48 states. [2018-11-18 22:02:16,465 INFO L87 Difference]: Start difference. First operand 51 states. Second operand 48 states. [2018-11-18 22:02:16,468 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:02:16,468 INFO L93 Difference]: Finished difference Result 51 states and 55 transitions. [2018-11-18 22:02:16,468 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 55 transitions. [2018-11-18 22:02:16,469 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 22:02:16,469 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 22:02:16,469 INFO L74 IsIncluded]: Start isIncluded. First operand 48 states. Second operand 51 states. [2018-11-18 22:02:16,469 INFO L87 Difference]: Start difference. First operand 48 states. Second operand 51 states. [2018-11-18 22:02:16,472 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:02:16,472 INFO L93 Difference]: Finished difference Result 51 states and 55 transitions. [2018-11-18 22:02:16,472 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 55 transitions. [2018-11-18 22:02:16,473 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 22:02:16,473 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 22:02:16,473 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-18 22:02:16,473 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-18 22:02:16,473 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2018-11-18 22:02:16,475 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 52 transitions. [2018-11-18 22:02:16,475 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 52 transitions. Word has length 44 [2018-11-18 22:02:16,476 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 22:02:16,476 INFO L480 AbstractCegarLoop]: Abstraction has 48 states and 52 transitions. [2018-11-18 22:02:16,476 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-11-18 22:02:16,476 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 52 transitions. [2018-11-18 22:02:16,477 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2018-11-18 22:02:16,477 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 22:02:16,477 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, 1, 1, 1, 1] [2018-11-18 22:02:16,477 INFO L423 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 22:02:16,478 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 22:02:16,478 INFO L82 PathProgramCache]: Analyzing trace with hash 32913612, now seen corresponding path program 1 times [2018-11-18 22:02:16,478 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-18 22:02:16,478 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:02:16,506 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 22:02:16,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 22:02:16,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 22:02:16,663 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 22:02:16,986 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:02:16,993 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:02:16,994 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 22:02:16,998 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 22:02:17,006 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-18 22:02:17,006 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:15, output treesize:11 [2018-11-18 22:02:17,189 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:02:17,196 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:02:17,197 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 22:02:17,202 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 22:02:17,228 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:02:17,232 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:02:17,240 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-18 22:02:17,243 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 22:02:17,266 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-18 22:02:17,267 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:30, output treesize:19 [2018-11-18 22:02:17,398 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-18 22:02:17,534 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 15 treesize of output 11 [2018-11-18 22:02:17,547 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 11 treesize of output 3 [2018-11-18 22:02:17,548 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 22:02:17,552 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 22:02:17,572 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 19 treesize of output 15 [2018-11-18 22:02:17,586 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 15 treesize of output 7 [2018-11-18 22:02:17,598 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-18 22:02:17,600 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 22:02:17,610 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-18 22:02:17,610 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:38, output treesize:16 [2018-11-18 22:02:17,615 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-18 22:02:17,675 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 15 treesize of output 11 [2018-11-18 22:02:17,680 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 11 treesize of output 3 [2018-11-18 22:02:17,682 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 22:02:17,684 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 22:02:17,691 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-18 22:02:17,691 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:20, output treesize:9 [2018-11-18 22:02:17,696 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-18 22:02:17,728 INFO L256 TraceCheckUtils]: 0: Hoare triple {1965#true} call ULTIMATE.init(); {1965#true} is VALID [2018-11-18 22:02:17,728 INFO L273 TraceCheckUtils]: 1: Hoare triple {1965#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {1965#true} is VALID [2018-11-18 22:02:17,728 INFO L273 TraceCheckUtils]: 2: Hoare triple {1965#true} assume true; {1965#true} is VALID [2018-11-18 22:02:17,728 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1965#true} {1965#true} #126#return; {1965#true} is VALID [2018-11-18 22:02:17,729 INFO L256 TraceCheckUtils]: 4: Hoare triple {1965#true} call #t~ret16 := main(); {1965#true} is VALID [2018-11-18 22:02:17,729 INFO L273 TraceCheckUtils]: 5: Hoare triple {1965#true} ~len~0 := 2bv32;~data~0 := 1bv32;call ~#s~0.base, ~#s~0.offset := #Ultimate.alloc(4bv32);call write~$Pointer$(0bv32, 0bv32, ~#s~0.base, ~#s~0.offset, 4bv32); {1985#(and (= |main_~#s~0.offset| (_ bv0 32)) (= (bvadd main_~data~0 (_ bv4294967295 32)) (_ bv0 32)))} is VALID [2018-11-18 22:02:17,730 INFO L256 TraceCheckUtils]: 6: Hoare triple {1985#(and (= |main_~#s~0.offset| (_ bv0 32)) (= (bvadd main_~data~0 (_ bv4294967295 32)) (_ bv0 32)))} call #t~ret10.base, #t~ret10.offset := dll_create(~len~0, ~data~0); {1965#true} is VALID [2018-11-18 22:02:17,730 INFO L273 TraceCheckUtils]: 7: Hoare triple {1965#true} ~len := #in~len;~data := #in~data;~head~0.base, ~head~0.offset := 0bv32, 0bv32; {1965#true} is VALID [2018-11-18 22:02:17,730 INFO L273 TraceCheckUtils]: 8: Hoare triple {1965#true} assume true; {1965#true} is VALID [2018-11-18 22:02:17,730 INFO L273 TraceCheckUtils]: 9: Hoare triple {1965#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; {1965#true} is VALID [2018-11-18 22:02:17,730 INFO L273 TraceCheckUtils]: 10: Hoare triple {1965#true} assume !(0bv32 == ~new_head~0.base && 0bv32 == ~new_head~0.offset); {1965#true} is VALID [2018-11-18 22:02:17,731 INFO L273 TraceCheckUtils]: 11: Hoare triple {1965#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); {1965#true} is VALID [2018-11-18 22:02:17,731 INFO L273 TraceCheckUtils]: 12: Hoare triple {1965#true} assume !(~head~0.base != 0bv32 || ~head~0.offset != 0bv32); {1965#true} is VALID [2018-11-18 22:02:17,731 INFO L273 TraceCheckUtils]: 13: Hoare triple {1965#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; {1965#true} is VALID [2018-11-18 22:02:17,731 INFO L273 TraceCheckUtils]: 14: Hoare triple {1965#true} assume true; {1965#true} is VALID [2018-11-18 22:02:17,731 INFO L273 TraceCheckUtils]: 15: Hoare triple {1965#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; {1965#true} is VALID [2018-11-18 22:02:17,731 INFO L273 TraceCheckUtils]: 16: Hoare triple {1965#true} assume !(0bv32 == ~new_head~0.base && 0bv32 == ~new_head~0.offset); {1965#true} is VALID [2018-11-18 22:02:17,732 INFO L273 TraceCheckUtils]: 17: Hoare triple {1965#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); {1965#true} is VALID [2018-11-18 22:02:17,732 INFO L273 TraceCheckUtils]: 18: Hoare triple {1965#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); {1965#true} is VALID [2018-11-18 22:02:17,732 INFO L273 TraceCheckUtils]: 19: Hoare triple {1965#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; {1965#true} is VALID [2018-11-18 22:02:17,732 INFO L273 TraceCheckUtils]: 20: Hoare triple {1965#true} assume true; {1965#true} is VALID [2018-11-18 22:02:17,732 INFO L273 TraceCheckUtils]: 21: Hoare triple {1965#true} assume !~bvsgt32(~len, 0bv32); {1965#true} is VALID [2018-11-18 22:02:17,732 INFO L273 TraceCheckUtils]: 22: Hoare triple {1965#true} #res.base, #res.offset := ~head~0.base, ~head~0.offset; {1965#true} is VALID [2018-11-18 22:02:17,732 INFO L273 TraceCheckUtils]: 23: Hoare triple {1965#true} assume true; {1965#true} is VALID [2018-11-18 22:02:17,737 INFO L268 TraceCheckUtils]: 24: Hoare quadruple {1965#true} {1985#(and (= |main_~#s~0.offset| (_ bv0 32)) (= (bvadd main_~data~0 (_ bv4294967295 32)) (_ bv0 32)))} #116#return; {1985#(and (= |main_~#s~0.offset| (_ bv0 32)) (= (bvadd main_~data~0 (_ bv4294967295 32)) (_ bv0 32)))} is VALID [2018-11-18 22:02:17,738 INFO L273 TraceCheckUtils]: 25: Hoare triple {1985#(and (= |main_~#s~0.offset| (_ bv0 32)) (= (bvadd main_~data~0 (_ bv4294967295 32)) (_ bv0 32)))} call write~$Pointer$(#t~ret10.base, #t~ret10.offset, ~#s~0.base, ~#s~0.offset, 4bv32);havoc #t~ret10.base, #t~ret10.offset; {1985#(and (= |main_~#s~0.offset| (_ bv0 32)) (= (bvadd main_~data~0 (_ bv4294967295 32)) (_ bv0 32)))} is VALID [2018-11-18 22:02:17,738 INFO L256 TraceCheckUtils]: 26: Hoare triple {1985#(and (= |main_~#s~0.offset| (_ bv0 32)) (= (bvadd main_~data~0 (_ bv4294967295 32)) (_ bv0 32)))} call dll_prepend(~#s~0.base, ~#s~0.offset, ~data~0); {1965#true} is VALID [2018-11-18 22:02:17,745 INFO L273 TraceCheckUtils]: 27: Hoare triple {1965#true} ~head.base, ~head.offset := #in~head.base, #in~head.offset;~data := #in~data; {2052#(and (= dll_prepend_~data |dll_prepend_#in~data|) (= dll_prepend_~head.offset |dll_prepend_#in~head.offset|) (= |dll_prepend_#in~head.base| dll_prepend_~head.base))} is VALID [2018-11-18 22:02:17,745 INFO L256 TraceCheckUtils]: 28: Hoare triple {2052#(and (= dll_prepend_~data |dll_prepend_#in~data|) (= dll_prepend_~head.offset |dll_prepend_#in~head.offset|) (= |dll_prepend_#in~head.base| dll_prepend_~head.base))} call #t~ret6.base, #t~ret6.offset := node_create(~data); {1965#true} is VALID [2018-11-18 22:02:17,746 INFO L273 TraceCheckUtils]: 29: Hoare triple {1965#true} ~data := #in~data;call #t~malloc2.base, #t~malloc2.offset := #Ultimate.alloc(12bv32);~temp~0.base, ~temp~0.offset := #t~malloc2.base, #t~malloc2.offset; {2059#(and (= node_create_~data |node_create_#in~data|) (= node_create_~temp~0.offset (_ bv0 32)))} is VALID [2018-11-18 22:02:17,746 INFO L273 TraceCheckUtils]: 30: Hoare triple {2059#(and (= node_create_~data |node_create_#in~data|) (= node_create_~temp~0.offset (_ bv0 32)))} assume !(0bv32 == ~temp~0.base && 0bv32 == ~temp~0.offset); {2059#(and (= node_create_~data |node_create_#in~data|) (= node_create_~temp~0.offset (_ bv0 32)))} is VALID [2018-11-18 22:02:17,768 INFO L273 TraceCheckUtils]: 31: Hoare triple {2059#(and (= node_create_~data |node_create_#in~data|) (= node_create_~temp~0.offset (_ bv0 32)))} call write~$Pointer$(0bv32, 0bv32, ~temp~0.base, ~bvadd32(4bv32, ~temp~0.offset), 4bv32);call write~$Pointer$(0bv32, 0bv32, ~temp~0.base, ~bvadd32(8bv32, ~temp~0.offset), 4bv32);call write~intINTTYPE4(~data, ~temp~0.base, ~temp~0.offset, 4bv32);#res.base, #res.offset := ~temp~0.base, ~temp~0.offset; {2066#(and (= |node_create_#in~data| (select (select |#memory_int| |node_create_#res.base|) |node_create_#res.offset|)) (= |node_create_#res.offset| (_ bv0 32)))} is VALID [2018-11-18 22:02:17,782 INFO L273 TraceCheckUtils]: 32: Hoare triple {2066#(and (= |node_create_#in~data| (select (select |#memory_int| |node_create_#res.base|) |node_create_#res.offset|)) (= |node_create_#res.offset| (_ bv0 32)))} assume true; {2066#(and (= |node_create_#in~data| (select (select |#memory_int| |node_create_#res.base|) |node_create_#res.offset|)) (= |node_create_#res.offset| (_ bv0 32)))} is VALID [2018-11-18 22:02:17,797 INFO L268 TraceCheckUtils]: 33: Hoare quadruple {2066#(and (= |node_create_#in~data| (select (select |#memory_int| |node_create_#res.base|) |node_create_#res.offset|)) (= |node_create_#res.offset| (_ bv0 32)))} {2052#(and (= dll_prepend_~data |dll_prepend_#in~data|) (= dll_prepend_~head.offset |dll_prepend_#in~head.offset|) (= |dll_prepend_#in~head.base| dll_prepend_~head.base))} #124#return; {2073#(and (= dll_prepend_~head.offset |dll_prepend_#in~head.offset|) (= (select (select |#memory_int| |dll_prepend_#t~ret6.base|) |dll_prepend_#t~ret6.offset|) |dll_prepend_#in~data|) (= |dll_prepend_#t~ret6.offset| (_ bv0 32)) (= |dll_prepend_#in~head.base| dll_prepend_~head.base))} is VALID [2018-11-18 22:02:17,815 INFO L273 TraceCheckUtils]: 34: Hoare triple {2073#(and (= dll_prepend_~head.offset |dll_prepend_#in~head.offset|) (= (select (select |#memory_int| |dll_prepend_#t~ret6.base|) |dll_prepend_#t~ret6.offset|) |dll_prepend_#in~data|) (= |dll_prepend_#t~ret6.offset| (_ bv0 32)) (= |dll_prepend_#in~head.base| dll_prepend_~head.base))} ~new_head~1.base, ~new_head~1.offset := #t~ret6.base, #t~ret6.offset;havoc #t~ret6.base, #t~ret6.offset;call #t~mem7.base, #t~mem7.offset := read~$Pointer$(~head.base, ~head.offset, 4bv32);call write~$Pointer$(#t~mem7.base, #t~mem7.offset, ~new_head~1.base, ~bvadd32(4bv32, ~new_head~1.offset), 4bv32);havoc #t~mem7.base, #t~mem7.offset;call #t~mem8.base, #t~mem8.offset := read~$Pointer$(~head.base, ~head.offset, 4bv32); {2077#(and (= dll_prepend_~head.offset |dll_prepend_#in~head.offset|) (= (_ bv0 32) dll_prepend_~new_head~1.offset) (= (select (select |#memory_int| dll_prepend_~new_head~1.base) dll_prepend_~new_head~1.offset) |dll_prepend_#in~data|) (= |dll_prepend_#in~head.base| dll_prepend_~head.base))} is VALID [2018-11-18 22:02:17,821 INFO L273 TraceCheckUtils]: 35: Hoare triple {2077#(and (= dll_prepend_~head.offset |dll_prepend_#in~head.offset|) (= (_ bv0 32) dll_prepend_~new_head~1.offset) (= (select (select |#memory_int| dll_prepend_~new_head~1.base) dll_prepend_~new_head~1.offset) |dll_prepend_#in~data|) (= |dll_prepend_#in~head.base| dll_prepend_~head.base))} assume #t~mem8.base != 0bv32 || #t~mem8.offset != 0bv32;havoc #t~mem8.base, #t~mem8.offset;call #t~mem9.base, #t~mem9.offset := read~$Pointer$(~head.base, ~head.offset, 4bv32);call write~$Pointer$(~new_head~1.base, ~new_head~1.offset, #t~mem9.base, ~bvadd32(8bv32, #t~mem9.offset), 4bv32);havoc #t~mem9.base, #t~mem9.offset; {2077#(and (= dll_prepend_~head.offset |dll_prepend_#in~head.offset|) (= (_ bv0 32) dll_prepend_~new_head~1.offset) (= (select (select |#memory_int| dll_prepend_~new_head~1.base) dll_prepend_~new_head~1.offset) |dll_prepend_#in~data|) (= |dll_prepend_#in~head.base| dll_prepend_~head.base))} is VALID [2018-11-18 22:02:17,823 INFO L273 TraceCheckUtils]: 36: Hoare triple {2077#(and (= dll_prepend_~head.offset |dll_prepend_#in~head.offset|) (= (_ bv0 32) dll_prepend_~new_head~1.offset) (= (select (select |#memory_int| dll_prepend_~new_head~1.base) dll_prepend_~new_head~1.offset) |dll_prepend_#in~data|) (= |dll_prepend_#in~head.base| dll_prepend_~head.base))} call write~$Pointer$(~new_head~1.base, ~new_head~1.offset, ~head.base, ~head.offset, 4bv32); {2084#(and (= |dll_prepend_#in~data| (select (select |#memory_int| (select (select |#memory_$Pointer$.base| |dll_prepend_#in~head.base|) |dll_prepend_#in~head.offset|)) (_ bv0 32))) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| |dll_prepend_#in~head.base|) |dll_prepend_#in~head.offset|)))} is VALID [2018-11-18 22:02:17,824 INFO L273 TraceCheckUtils]: 37: Hoare triple {2084#(and (= |dll_prepend_#in~data| (select (select |#memory_int| (select (select |#memory_$Pointer$.base| |dll_prepend_#in~head.base|) |dll_prepend_#in~head.offset|)) (_ bv0 32))) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| |dll_prepend_#in~head.base|) |dll_prepend_#in~head.offset|)))} assume true; {2084#(and (= |dll_prepend_#in~data| (select (select |#memory_int| (select (select |#memory_$Pointer$.base| |dll_prepend_#in~head.base|) |dll_prepend_#in~head.offset|)) (_ bv0 32))) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| |dll_prepend_#in~head.base|) |dll_prepend_#in~head.offset|)))} is VALID [2018-11-18 22:02:17,826 INFO L268 TraceCheckUtils]: 38: Hoare quadruple {2084#(and (= |dll_prepend_#in~data| (select (select |#memory_int| (select (select |#memory_$Pointer$.base| |dll_prepend_#in~head.base|) |dll_prepend_#in~head.offset|)) (_ bv0 32))) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| |dll_prepend_#in~head.base|) |dll_prepend_#in~head.offset|)))} {1985#(and (= |main_~#s~0.offset| (_ bv0 32)) (= (bvadd main_~data~0 (_ bv4294967295 32)) (_ bv0 32)))} #118#return; {2091#(and (= (select (select |#memory_$Pointer$.offset| |main_~#s~0.base|) |main_~#s~0.offset|) (_ bv0 32)) (= |main_~#s~0.offset| (_ bv0 32)) (= (select (select |#memory_int| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) (_ bv0 32)) main_~data~0) (= (bvadd main_~data~0 (_ bv4294967295 32)) (_ bv0 32)))} is VALID [2018-11-18 22:02:17,827 INFO L273 TraceCheckUtils]: 39: Hoare triple {2091#(and (= (select (select |#memory_$Pointer$.offset| |main_~#s~0.base|) |main_~#s~0.offset|) (_ bv0 32)) (= |main_~#s~0.offset| (_ bv0 32)) (= (select (select |#memory_int| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) (_ bv0 32)) main_~data~0) (= (bvadd main_~data~0 (_ bv4294967295 32)) (_ bv0 32)))} call #t~mem11.base, #t~mem11.offset := read~$Pointer$(~#s~0.base, ~#s~0.offset, 4bv32);~ptr~0.base, ~ptr~0.offset := #t~mem11.base, #t~mem11.offset;havoc #t~mem11.base, #t~mem11.offset;~count~0 := 0bv32; {2095#(and (= main_~data~0 (select (select |#memory_int| main_~ptr~0.base) (_ bv0 32))) (= (bvadd main_~data~0 (_ bv4294967295 32)) (_ bv0 32)) (= main_~ptr~0.offset (_ bv0 32)))} is VALID [2018-11-18 22:02:17,827 INFO L273 TraceCheckUtils]: 40: Hoare triple {2095#(and (= main_~data~0 (select (select |#memory_int| main_~ptr~0.base) (_ bv0 32))) (= (bvadd main_~data~0 (_ bv4294967295 32)) (_ bv0 32)) (= main_~ptr~0.offset (_ bv0 32)))} assume true; {2095#(and (= main_~data~0 (select (select |#memory_int| main_~ptr~0.base) (_ bv0 32))) (= (bvadd main_~data~0 (_ bv4294967295 32)) (_ bv0 32)) (= main_~ptr~0.offset (_ bv0 32)))} is VALID [2018-11-18 22:02:17,828 INFO L273 TraceCheckUtils]: 41: Hoare triple {2095#(and (= main_~data~0 (select (select |#memory_int| main_~ptr~0.base) (_ bv0 32))) (= (bvadd main_~data~0 (_ bv4294967295 32)) (_ bv0 32)) (= main_~ptr~0.offset (_ bv0 32)))} assume !!(~ptr~0.base != 0bv32 || ~ptr~0.offset != 0bv32);call #t~mem12.base, #t~mem12.offset := read~$Pointer$(~ptr~0.base, ~bvadd32(4bv32, ~ptr~0.offset), 4bv32);~temp~2.base, ~temp~2.offset := #t~mem12.base, #t~mem12.offset;havoc #t~mem12.base, #t~mem12.offset;call #t~mem13 := read~intINTTYPE4(~ptr~0.base, ~ptr~0.offset, 4bv32); {2102#(and (= |main_#t~mem13| main_~data~0) (= (bvadd main_~data~0 (_ bv4294967295 32)) (_ bv0 32)))} is VALID [2018-11-18 22:02:17,829 INFO L273 TraceCheckUtils]: 42: Hoare triple {2102#(and (= |main_#t~mem13| main_~data~0) (= (bvadd main_~data~0 (_ bv4294967295 32)) (_ bv0 32)))} assume ~data~0 != #t~mem13;havoc #t~mem13; {1966#false} is VALID [2018-11-18 22:02:17,829 INFO L273 TraceCheckUtils]: 43: Hoare triple {1966#false} assume !false; {1966#false} is VALID [2018-11-18 22:02:17,833 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:02:17,833 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-18 22:02:17,835 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 22:02:17,835 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2018-11-18 22:02:17,835 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 44 [2018-11-18 22:02:17,836 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-18 22:02:17,836 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 12 states. [2018-11-18 22:02:17,927 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 38 edges. 38 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 22:02:17,927 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-11-18 22:02:17,928 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-11-18 22:02:17,928 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=110, Unknown=0, NotChecked=0, Total=132 [2018-11-18 22:02:17,928 INFO L87 Difference]: Start difference. First operand 48 states and 52 transitions. Second operand 12 states. [2018-11-18 22:02:19,977 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:02:19,977 INFO L93 Difference]: Finished difference Result 51 states and 55 transitions. [2018-11-18 22:02:19,977 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-11-18 22:02:19,977 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 44 [2018-11-18 22:02:19,978 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 22:02:19,978 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2018-11-18 22:02:19,979 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 47 transitions. [2018-11-18 22:02:19,980 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2018-11-18 22:02:19,981 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 47 transitions. [2018-11-18 22:02:19,982 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 12 states and 47 transitions. [2018-11-18 22:02:20,076 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 47 edges. 47 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 22:02:20,078 INFO L225 Difference]: With dead ends: 51 [2018-11-18 22:02:20,078 INFO L226 Difference]: Without dead ends: 49 [2018-11-18 22:02:20,079 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=52, Invalid=254, Unknown=0, NotChecked=0, Total=306 [2018-11-18 22:02:20,079 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2018-11-18 22:02:20,118 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 49. [2018-11-18 22:02:20,118 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-18 22:02:20,118 INFO L82 GeneralOperation]: Start isEquivalent. First operand 49 states. Second operand 49 states. [2018-11-18 22:02:20,118 INFO L74 IsIncluded]: Start isIncluded. First operand 49 states. Second operand 49 states. [2018-11-18 22:02:20,118 INFO L87 Difference]: Start difference. First operand 49 states. Second operand 49 states. [2018-11-18 22:02:20,121 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:02:20,121 INFO L93 Difference]: Finished difference Result 49 states and 53 transitions. [2018-11-18 22:02:20,121 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 53 transitions. [2018-11-18 22:02:20,122 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 22:02:20,122 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 22:02:20,122 INFO L74 IsIncluded]: Start isIncluded. First operand 49 states. Second operand 49 states. [2018-11-18 22:02:20,122 INFO L87 Difference]: Start difference. First operand 49 states. Second operand 49 states. [2018-11-18 22:02:20,124 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:02:20,124 INFO L93 Difference]: Finished difference Result 49 states and 53 transitions. [2018-11-18 22:02:20,124 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 53 transitions. [2018-11-18 22:02:20,125 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 22:02:20,125 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 22:02:20,125 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-18 22:02:20,125 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-18 22:02:20,125 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2018-11-18 22:02:20,127 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 53 transitions. [2018-11-18 22:02:20,127 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 53 transitions. Word has length 44 [2018-11-18 22:02:20,128 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 22:02:20,128 INFO L480 AbstractCegarLoop]: Abstraction has 49 states and 53 transitions. [2018-11-18 22:02:20,128 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-11-18 22:02:20,128 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 53 transitions. [2018-11-18 22:02:20,129 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2018-11-18 22:02:20,129 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 22:02:20,129 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] [2018-11-18 22:02:20,129 INFO L423 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 22:02:20,129 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 22:02:20,130 INFO L82 PathProgramCache]: Analyzing trace with hash 1278108350, now seen corresponding path program 1 times [2018-11-18 22:02:20,130 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-18 22:02:20,130 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:02:20,153 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 22:02:20,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 22:02:20,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 22:02:20,379 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 22:02:20,401 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:02:20,403 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-18 22:02:20,416 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 22:02:20,416 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-11-18 22:02:20,419 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-18 22:02:22,461 WARN L854 $PredicateComparison]: unable to prove that (exists ((|dll_create_#t~malloc3.base| (_ BitVec 32))) (and (= |c_#valid| (store |c_old(#valid)| |dll_create_#t~malloc3.base| (_ bv1 1))) (= (select |c_old(#valid)| |dll_create_#t~malloc3.base|) (_ bv0 1)))) is different from true [2018-11-18 22:02:24,569 WARN L180 SmtUtils]: Spent 2.01 s on a formula simplification that was a NOOP. DAG size: 17 [2018-11-18 22:02:26,633 WARN L180 SmtUtils]: Spent 1.43 s on a formula simplification that was a NOOP. DAG size: 17 [2018-11-18 22:02:29,868 WARN L180 SmtUtils]: Spent 1.19 s on a formula simplification that was a NOOP. DAG size: 17 [2018-11-18 22:02:29,901 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 22:02:29,903 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 22:02:29,904 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 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 22 treesize of output 29 [2018-11-18 22:02:29,929 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 20 [2018-11-18 22:02:29,932 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 22:02:29,945 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 22:02:29,971 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-18 22:02:29,971 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:29, output treesize:27 [2018-11-18 22:02:31,986 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-18 22:02:32,108 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 11 treesize of output 8 [2018-11-18 22:02:32,114 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-11-18 22:02:32,116 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 22:02:32,121 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 22:02:32,147 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-18 22:02:32,148 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:40, output treesize:37 [2018-11-18 22:02:32,159 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-18 22:02:39,256 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 149 treesize of output 147 [2018-11-18 22:02:39,274 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 147 treesize of output 145 [2018-11-18 22:02:39,277 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-18 22:02:39,300 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-18 22:02:39,432 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-18 22:02:39,432 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:164, output treesize:160 [2018-11-18 22:02:39,549 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-18 22:02:45,846 WARN L180 SmtUtils]: Spent 2.11 s on a formula simplification that was a NOOP. DAG size: 37 [2018-11-18 22:02:45,970 INFO L303 Elim1Store]: Index analysis took 101 ms [2018-11-18 22:02:45,971 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:02:45,999 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:02:46,001 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 22:02:46,033 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 22:02:46,179 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:02:46,180 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:296, output treesize:292 [2018-11-18 22:02:50,625 WARN L180 SmtUtils]: Spent 2.09 s on a formula simplification that was a NOOP. DAG size: 38 [2018-11-18 22:02:54,311 WARN L180 SmtUtils]: Spent 3.56 s on a formula simplification. DAG size of input: 120 DAG size of output: 55 [2018-11-18 22:02:54,376 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 22:02:54,432 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 22:02:54,450 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 22:02:54,504 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 22:02:54,505 INFO L303 Elim1Store]: Index analysis took 168 ms [2018-11-18 22:02:54,506 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 21 [2018-11-18 22:02:54,509 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-18 22:02:54,763 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 22:02:55,058 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 22:02:55,069 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 22:02:55,070 INFO L682 Elim1Store]: detected equality via solver [2018-11-18 22:02:55,071 INFO L303 Elim1Store]: Index analysis took 342 ms [2018-11-18 22:02:55,075 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 3 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 1 case distinctions, treesize of input 158 treesize of output 175 [2018-11-18 22:02:55,681 WARN L180 SmtUtils]: Spent 586.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 50 [2018-11-18 22:02:55,694 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 77 treesize of output 67 [2018-11-18 22:02:55,712 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 67 treesize of output 64 [2018-11-18 22:02:55,714 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-18 22:02:55,816 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 22:02:56,141 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 60 treesize of output 70 [2018-11-18 22:02:56,197 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 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 55 treesize of output 67 [2018-11-18 22:02:56,201 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-11-18 22:02:56,248 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-18 22:02:56,302 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 6 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 66 [2018-11-18 22:02:56,408 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 63 [2018-11-18 22:02:56,424 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 3 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:02:56,426 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-11-18 22:02:56,476 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 22:02:56,524 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-18 22:02:56,753 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 96 treesize of output 76 [2018-11-18 22:02:56,867 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 64 treesize of output 62 [2018-11-18 22:02:56,921 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 58 [2018-11-18 22:02:56,924 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2018-11-18 22:02:57,043 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 48 [2018-11-18 22:02:57,047 INFO L267 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 1 xjuncts. [2018-11-18 22:02:57,118 INFO L267 ElimStorePlain]: Start of recursive call 12: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 22:02:57,162 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 22:02:57,231 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 1 case distinctions, treesize of input 93 treesize of output 92 [2018-11-18 22:02:57,257 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 73 treesize of output 61 [2018-11-18 22:02:57,261 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:02:57,476 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 57 treesize of output 56 [2018-11-18 22:02:57,505 INFO L267 ElimStorePlain]: Start of recursive call 17: End of recursive call: and 1 xjuncts. [2018-11-18 22:02:57,789 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 63 treesize of output 66 [2018-11-18 22:02:57,821 INFO L267 ElimStorePlain]: Start of recursive call 19: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-18 22:02:57,957 INFO L267 ElimStorePlain]: Start of recursive call 18: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2018-11-18 22:02:58,258 INFO L267 ElimStorePlain]: Start of recursive call 15: 3 dim-1 vars, End of recursive call: 3 dim-0 vars, and 3 xjuncts. [2018-11-18 22:02:58,728 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 62 treesize of output 54 [2018-11-18 22:02:58,750 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 22:02:58,750 INFO L682 Elim1Store]: detected equality via solver [2018-11-18 22:02:58,751 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 2 stores, 2 select indices, 2 select index equivalence classes, 5 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 36 [2018-11-18 22:02:58,756 INFO L267 ElimStorePlain]: Start of recursive call 21: End of recursive call: and 1 xjuncts. [2018-11-18 22:02:58,848 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 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 21 treesize of output 16 [2018-11-18 22:02:58,851 INFO L267 ElimStorePlain]: Start of recursive call 22: End of recursive call: and 1 xjuncts. [2018-11-18 22:02:58,877 INFO L267 ElimStorePlain]: Start of recursive call 20: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 22:02:58,903 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 89 treesize of output 81 [2018-11-18 22:02:58,915 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 13 [2018-11-18 22:02:58,917 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:02:59,018 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 22:02:59,020 INFO L682 Elim1Store]: detected equality via solver [2018-11-18 22:02:59,021 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 2 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 36 treesize of output 40 [2018-11-18 22:02:59,024 INFO L267 ElimStorePlain]: Start of recursive call 25: End of recursive call: and 1 xjuncts. [2018-11-18 22:02:59,077 INFO L267 ElimStorePlain]: Start of recursive call 23: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 22:02:59,097 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 71 treesize of output 63 [2018-11-18 22:02:59,123 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 9 [2018-11-18 22:02:59,124 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:02:59,203 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 22:02:59,203 INFO L682 Elim1Store]: detected equality via solver [2018-11-18 22:02:59,205 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 2 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 28 treesize of output 32 [2018-11-18 22:02:59,213 INFO L267 ElimStorePlain]: Start of recursive call 28: End of recursive call: and 1 xjuncts. [2018-11-18 22:02:59,255 INFO L267 ElimStorePlain]: Start of recursive call 26: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 22:02:59,373 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 66 treesize of output 58 [2018-11-18 22:02:59,424 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 9 [2018-11-18 22:02:59,450 INFO L267 ElimStorePlain]: Start of recursive call 30: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-18 22:02:59,680 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 22:02:59,680 INFO L682 Elim1Store]: detected equality via solver [2018-11-18 22:02:59,682 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 2 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 28 treesize of output 32 [2018-11-18 22:02:59,697 INFO L267 ElimStorePlain]: Start of recursive call 31: End of recursive call: and 1 xjuncts. [2018-11-18 22:02:59,747 INFO L267 ElimStorePlain]: Start of recursive call 29: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 22:02:59,927 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, 3 dim-2 vars, End of recursive call: 1 dim-0 vars, and 4 xjuncts. [2018-11-18 22:03:00,056 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-18 22:03:00,056 INFO L202 ElimStorePlain]: Needed 31 recursive calls to eliminate 5 variables, input treesize:328, output treesize:79 [2018-11-18 22:03:00,597 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-18 22:03:00,826 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 15 treesize of output 11 [2018-11-18 22:03:00,832 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 11 treesize of output 3 [2018-11-18 22:03:00,833 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 22:03:00,838 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 22:03:00,879 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:00,879 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:90, output treesize:79 [2018-11-18 22:03:00,898 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-18 22:03:01,167 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 1 case distinctions, treesize of input 80 treesize of output 53 [2018-11-18 22:03:01,181 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 44 treesize of output 35 [2018-11-18 22:03:01,183 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 22:03:01,259 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 21 [2018-11-18 22:03:01,261 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-18 22:03:01,327 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 17 [2018-11-18 22:03:01,329 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-18 22:03:01,384 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 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 32 treesize of output 24 [2018-11-18 22:03:01,390 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-11-18 22:03:01,412 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 17 treesize of output 4 [2018-11-18 22:03:01,414 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-11-18 22:03:01,419 INFO L267 ElimStorePlain]: Start of recursive call 2: 5 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 22:03:01,422 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:03:01,423 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 3 variables, input treesize:80, output treesize:4 [2018-11-18 22:03:01,429 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-18 22:03:02,873 INFO L256 TraceCheckUtils]: 0: Hoare triple {2351#true} call ULTIMATE.init(); {2351#true} is VALID [2018-11-18 22:03:02,874 INFO L273 TraceCheckUtils]: 1: Hoare triple {2351#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {2351#true} is VALID [2018-11-18 22:03:02,874 INFO L273 TraceCheckUtils]: 2: Hoare triple {2351#true} assume true; {2351#true} is VALID [2018-11-18 22:03:02,874 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {2351#true} {2351#true} #126#return; {2351#true} is VALID [2018-11-18 22:03:02,875 INFO L256 TraceCheckUtils]: 4: Hoare triple {2351#true} call #t~ret16 := main(); {2351#true} is VALID [2018-11-18 22:03:02,876 INFO L273 TraceCheckUtils]: 5: Hoare triple {2351#true} ~len~0 := 2bv32;~data~0 := 1bv32;call ~#s~0.base, ~#s~0.offset := #Ultimate.alloc(4bv32);call write~$Pointer$(0bv32, 0bv32, ~#s~0.base, ~#s~0.offset, 4bv32); {2371#(and (= (bvadd (select |#valid| |main_~#s~0.base|) (_ bv1 1)) (_ bv0 1)) (= |main_~#s~0.offset| (_ bv0 32)))} is VALID [2018-11-18 22:03:02,877 INFO L256 TraceCheckUtils]: 6: Hoare triple {2371#(and (= (bvadd (select |#valid| |main_~#s~0.base|) (_ bv1 1)) (_ bv0 1)) (= |main_~#s~0.offset| (_ bv0 32)))} call #t~ret10.base, #t~ret10.offset := dll_create(~len~0, ~data~0); {2375#(= |#valid| |old(#valid)|)} is VALID [2018-11-18 22:03:02,878 INFO L273 TraceCheckUtils]: 7: Hoare triple {2375#(= |#valid| |old(#valid)|)} ~len := #in~len;~data := #in~data;~head~0.base, ~head~0.offset := 0bv32, 0bv32; {2375#(= |#valid| |old(#valid)|)} is VALID [2018-11-18 22:03:02,879 INFO L273 TraceCheckUtils]: 8: Hoare triple {2375#(= |#valid| |old(#valid)|)} assume true; {2375#(= |#valid| |old(#valid)|)} is VALID [2018-11-18 22:03:02,881 INFO L273 TraceCheckUtils]: 9: Hoare triple {2375#(= |#valid| |old(#valid)|)} 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; {2385#(exists ((|dll_create_#t~malloc3.base| (_ BitVec 32))) (and (= |#valid| (store |old(#valid)| |dll_create_#t~malloc3.base| (_ bv1 1))) (= (select |old(#valid)| |dll_create_#t~malloc3.base|) (_ bv0 1))))} is VALID [2018-11-18 22:03:02,882 INFO L273 TraceCheckUtils]: 10: Hoare triple {2385#(exists ((|dll_create_#t~malloc3.base| (_ BitVec 32))) (and (= |#valid| (store |old(#valid)| |dll_create_#t~malloc3.base| (_ bv1 1))) (= (select |old(#valid)| |dll_create_#t~malloc3.base|) (_ bv0 1))))} assume !(0bv32 == ~new_head~0.base && 0bv32 == ~new_head~0.offset); {2385#(exists ((|dll_create_#t~malloc3.base| (_ BitVec 32))) (and (= |#valid| (store |old(#valid)| |dll_create_#t~malloc3.base| (_ bv1 1))) (= (select |old(#valid)| |dll_create_#t~malloc3.base|) (_ bv0 1))))} is VALID [2018-11-18 22:03:02,882 INFO L273 TraceCheckUtils]: 11: Hoare triple {2385#(exists ((|dll_create_#t~malloc3.base| (_ BitVec 32))) (and (= |#valid| (store |old(#valid)| |dll_create_#t~malloc3.base| (_ bv1 1))) (= (select |old(#valid)| |dll_create_#t~malloc3.base|) (_ bv0 1))))} 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); {2385#(exists ((|dll_create_#t~malloc3.base| (_ BitVec 32))) (and (= |#valid| (store |old(#valid)| |dll_create_#t~malloc3.base| (_ bv1 1))) (= (select |old(#valid)| |dll_create_#t~malloc3.base|) (_ bv0 1))))} is VALID [2018-11-18 22:03:02,883 INFO L273 TraceCheckUtils]: 12: Hoare triple {2385#(exists ((|dll_create_#t~malloc3.base| (_ BitVec 32))) (and (= |#valid| (store |old(#valid)| |dll_create_#t~malloc3.base| (_ bv1 1))) (= (select |old(#valid)| |dll_create_#t~malloc3.base|) (_ bv0 1))))} assume !(~head~0.base != 0bv32 || ~head~0.offset != 0bv32); {2385#(exists ((|dll_create_#t~malloc3.base| (_ BitVec 32))) (and (= |#valid| (store |old(#valid)| |dll_create_#t~malloc3.base| (_ bv1 1))) (= (select |old(#valid)| |dll_create_#t~malloc3.base|) (_ bv0 1))))} is VALID [2018-11-18 22:03:02,883 INFO L273 TraceCheckUtils]: 13: Hoare triple {2385#(exists ((|dll_create_#t~malloc3.base| (_ BitVec 32))) (and (= |#valid| (store |old(#valid)| |dll_create_#t~malloc3.base| (_ bv1 1))) (= (select |old(#valid)| |dll_create_#t~malloc3.base|) (_ bv0 1))))} ~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; {2385#(exists ((|dll_create_#t~malloc3.base| (_ BitVec 32))) (and (= |#valid| (store |old(#valid)| |dll_create_#t~malloc3.base| (_ bv1 1))) (= (select |old(#valid)| |dll_create_#t~malloc3.base|) (_ bv0 1))))} is VALID [2018-11-18 22:03:02,883 INFO L273 TraceCheckUtils]: 14: Hoare triple {2385#(exists ((|dll_create_#t~malloc3.base| (_ BitVec 32))) (and (= |#valid| (store |old(#valid)| |dll_create_#t~malloc3.base| (_ bv1 1))) (= (select |old(#valid)| |dll_create_#t~malloc3.base|) (_ bv0 1))))} assume true; {2385#(exists ((|dll_create_#t~malloc3.base| (_ BitVec 32))) (and (= |#valid| (store |old(#valid)| |dll_create_#t~malloc3.base| (_ bv1 1))) (= (select |old(#valid)| |dll_create_#t~malloc3.base|) (_ bv0 1))))} is VALID [2018-11-18 22:03:02,885 INFO L273 TraceCheckUtils]: 15: Hoare triple {2385#(exists ((|dll_create_#t~malloc3.base| (_ BitVec 32))) (and (= |#valid| (store |old(#valid)| |dll_create_#t~malloc3.base| (_ bv1 1))) (= (select |old(#valid)| |dll_create_#t~malloc3.base|) (_ 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; {2404#(and (not (= dll_create_~new_head~0.base (_ bv0 32))) (exists ((|dll_create_#t~malloc3.base| (_ BitVec 32))) (and (= |#valid| (store (store |old(#valid)| |dll_create_#t~malloc3.base| (_ bv1 1)) dll_create_~new_head~0.base (_ bv1 1))) (= (select |old(#valid)| |dll_create_#t~malloc3.base|) (_ bv0 1)))))} is VALID [2018-11-18 22:03:02,887 INFO L273 TraceCheckUtils]: 16: Hoare triple {2404#(and (not (= dll_create_~new_head~0.base (_ bv0 32))) (exists ((|dll_create_#t~malloc3.base| (_ BitVec 32))) (and (= |#valid| (store (store |old(#valid)| |dll_create_#t~malloc3.base| (_ bv1 1)) dll_create_~new_head~0.base (_ bv1 1))) (= (select |old(#valid)| |dll_create_#t~malloc3.base|) (_ bv0 1)))))} assume !(0bv32 == ~new_head~0.base && 0bv32 == ~new_head~0.offset); {2404#(and (not (= dll_create_~new_head~0.base (_ bv0 32))) (exists ((|dll_create_#t~malloc3.base| (_ BitVec 32))) (and (= |#valid| (store (store |old(#valid)| |dll_create_#t~malloc3.base| (_ bv1 1)) dll_create_~new_head~0.base (_ bv1 1))) (= (select |old(#valid)| |dll_create_#t~malloc3.base|) (_ bv0 1)))))} is VALID [2018-11-18 22:03:02,888 INFO L273 TraceCheckUtils]: 17: Hoare triple {2404#(and (not (= dll_create_~new_head~0.base (_ bv0 32))) (exists ((|dll_create_#t~malloc3.base| (_ BitVec 32))) (and (= |#valid| (store (store |old(#valid)| |dll_create_#t~malloc3.base| (_ bv1 1)) dll_create_~new_head~0.base (_ bv1 1))) (= (select |old(#valid)| |dll_create_#t~malloc3.base|) (_ bv0 1)))))} 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); {2404#(and (not (= dll_create_~new_head~0.base (_ bv0 32))) (exists ((|dll_create_#t~malloc3.base| (_ BitVec 32))) (and (= |#valid| (store (store |old(#valid)| |dll_create_#t~malloc3.base| (_ bv1 1)) dll_create_~new_head~0.base (_ bv1 1))) (= (select |old(#valid)| |dll_create_#t~malloc3.base|) (_ bv0 1)))))} is VALID [2018-11-18 22:03:02,889 INFO L273 TraceCheckUtils]: 18: Hoare triple {2404#(and (not (= dll_create_~new_head~0.base (_ bv0 32))) (exists ((|dll_create_#t~malloc3.base| (_ BitVec 32))) (and (= |#valid| (store (store |old(#valid)| |dll_create_#t~malloc3.base| (_ bv1 1)) dll_create_~new_head~0.base (_ bv1 1))) (= (select |old(#valid)| |dll_create_#t~malloc3.base|) (_ bv0 1)))))} 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); {2404#(and (not (= dll_create_~new_head~0.base (_ bv0 32))) (exists ((|dll_create_#t~malloc3.base| (_ BitVec 32))) (and (= |#valid| (store (store |old(#valid)| |dll_create_#t~malloc3.base| (_ bv1 1)) dll_create_~new_head~0.base (_ bv1 1))) (= (select |old(#valid)| |dll_create_#t~malloc3.base|) (_ bv0 1)))))} is VALID [2018-11-18 22:03:02,893 INFO L273 TraceCheckUtils]: 19: Hoare triple {2404#(and (not (= dll_create_~new_head~0.base (_ bv0 32))) (exists ((|dll_create_#t~malloc3.base| (_ BitVec 32))) (and (= |#valid| (store (store |old(#valid)| |dll_create_#t~malloc3.base| (_ bv1 1)) dll_create_~new_head~0.base (_ bv1 1))) (= (select |old(#valid)| |dll_create_#t~malloc3.base|) (_ bv0 1)))))} ~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; {2417#(and (exists ((|dll_create_#t~malloc3.base| (_ BitVec 32))) (and (= |#valid| (store (store |old(#valid)| |dll_create_#t~malloc3.base| (_ bv1 1)) dll_create_~head~0.base (_ bv1 1))) (= (select |old(#valid)| |dll_create_#t~malloc3.base|) (_ bv0 1)))) (not (= (_ bv0 32) dll_create_~head~0.base)))} is VALID [2018-11-18 22:03:02,894 INFO L273 TraceCheckUtils]: 20: Hoare triple {2417#(and (exists ((|dll_create_#t~malloc3.base| (_ BitVec 32))) (and (= |#valid| (store (store |old(#valid)| |dll_create_#t~malloc3.base| (_ bv1 1)) dll_create_~head~0.base (_ bv1 1))) (= (select |old(#valid)| |dll_create_#t~malloc3.base|) (_ bv0 1)))) (not (= (_ bv0 32) dll_create_~head~0.base)))} assume true; {2417#(and (exists ((|dll_create_#t~malloc3.base| (_ BitVec 32))) (and (= |#valid| (store (store |old(#valid)| |dll_create_#t~malloc3.base| (_ bv1 1)) dll_create_~head~0.base (_ bv1 1))) (= (select |old(#valid)| |dll_create_#t~malloc3.base|) (_ bv0 1)))) (not (= (_ bv0 32) dll_create_~head~0.base)))} is VALID [2018-11-18 22:03:02,894 INFO L273 TraceCheckUtils]: 21: Hoare triple {2417#(and (exists ((|dll_create_#t~malloc3.base| (_ BitVec 32))) (and (= |#valid| (store (store |old(#valid)| |dll_create_#t~malloc3.base| (_ bv1 1)) dll_create_~head~0.base (_ bv1 1))) (= (select |old(#valid)| |dll_create_#t~malloc3.base|) (_ bv0 1)))) (not (= (_ bv0 32) dll_create_~head~0.base)))} assume !~bvsgt32(~len, 0bv32); {2417#(and (exists ((|dll_create_#t~malloc3.base| (_ BitVec 32))) (and (= |#valid| (store (store |old(#valid)| |dll_create_#t~malloc3.base| (_ bv1 1)) dll_create_~head~0.base (_ bv1 1))) (= (select |old(#valid)| |dll_create_#t~malloc3.base|) (_ bv0 1)))) (not (= (_ bv0 32) dll_create_~head~0.base)))} is VALID [2018-11-18 22:03:02,896 INFO L273 TraceCheckUtils]: 22: Hoare triple {2417#(and (exists ((|dll_create_#t~malloc3.base| (_ BitVec 32))) (and (= |#valid| (store (store |old(#valid)| |dll_create_#t~malloc3.base| (_ bv1 1)) dll_create_~head~0.base (_ bv1 1))) (= (select |old(#valid)| |dll_create_#t~malloc3.base|) (_ bv0 1)))) (not (= (_ bv0 32) dll_create_~head~0.base)))} #res.base, #res.offset := ~head~0.base, ~head~0.offset; {2427#(and (not (= |dll_create_#res.base| (_ bv0 32))) (exists ((|dll_create_#t~malloc3.base| (_ BitVec 32))) (and (= |#valid| (store (store |old(#valid)| |dll_create_#t~malloc3.base| (_ bv1 1)) |dll_create_#res.base| (_ bv1 1))) (= (select |old(#valid)| |dll_create_#t~malloc3.base|) (_ bv0 1)))))} is VALID [2018-11-18 22:03:02,896 INFO L273 TraceCheckUtils]: 23: Hoare triple {2427#(and (not (= |dll_create_#res.base| (_ bv0 32))) (exists ((|dll_create_#t~malloc3.base| (_ BitVec 32))) (and (= |#valid| (store (store |old(#valid)| |dll_create_#t~malloc3.base| (_ bv1 1)) |dll_create_#res.base| (_ bv1 1))) (= (select |old(#valid)| |dll_create_#t~malloc3.base|) (_ bv0 1)))))} assume true; {2427#(and (not (= |dll_create_#res.base| (_ bv0 32))) (exists ((|dll_create_#t~malloc3.base| (_ BitVec 32))) (and (= |#valid| (store (store |old(#valid)| |dll_create_#t~malloc3.base| (_ bv1 1)) |dll_create_#res.base| (_ bv1 1))) (= (select |old(#valid)| |dll_create_#t~malloc3.base|) (_ bv0 1)))))} is VALID [2018-11-18 22:03:02,903 INFO L268 TraceCheckUtils]: 24: Hoare quadruple {2427#(and (not (= |dll_create_#res.base| (_ bv0 32))) (exists ((|dll_create_#t~malloc3.base| (_ BitVec 32))) (and (= |#valid| (store (store |old(#valid)| |dll_create_#t~malloc3.base| (_ bv1 1)) |dll_create_#res.base| (_ bv1 1))) (= (select |old(#valid)| |dll_create_#t~malloc3.base|) (_ bv0 1)))))} {2371#(and (= (bvadd (select |#valid| |main_~#s~0.base|) (_ bv1 1)) (_ bv0 1)) (= |main_~#s~0.offset| (_ bv0 32)))} #116#return; {2434#(and (= (bvadd (select |#valid| |main_~#s~0.base|) (_ bv1 1)) (_ bv0 1)) (not (= (_ bv0 32) |main_#t~ret10.base|)) (exists ((|dll_create_#t~malloc3.base| (_ BitVec 32))) (and (not (= |main_~#s~0.base| |dll_create_#t~malloc3.base|)) (= (_ bv1 1) (select |#valid| |dll_create_#t~malloc3.base|)))) (= |main_~#s~0.offset| (_ bv0 32)) (= (_ bv1 1) (select |#valid| |main_#t~ret10.base|)))} is VALID [2018-11-18 22:03:02,904 INFO L273 TraceCheckUtils]: 25: Hoare triple {2434#(and (= (bvadd (select |#valid| |main_~#s~0.base|) (_ bv1 1)) (_ bv0 1)) (not (= (_ bv0 32) |main_#t~ret10.base|)) (exists ((|dll_create_#t~malloc3.base| (_ BitVec 32))) (and (not (= |main_~#s~0.base| |dll_create_#t~malloc3.base|)) (= (_ bv1 1) (select |#valid| |dll_create_#t~malloc3.base|)))) (= |main_~#s~0.offset| (_ bv0 32)) (= (_ bv1 1) (select |#valid| |main_#t~ret10.base|)))} call write~$Pointer$(#t~ret10.base, #t~ret10.offset, ~#s~0.base, ~#s~0.offset, 4bv32);havoc #t~ret10.base, #t~ret10.offset; {2438#(and (= (bvadd (select |#valid| |main_~#s~0.base|) (_ bv1 1)) (_ bv0 1)) (exists ((|dll_create_#t~malloc3.base| (_ BitVec 32))) (and (not (= |main_~#s~0.base| |dll_create_#t~malloc3.base|)) (= (_ bv1 1) (select |#valid| |dll_create_#t~malloc3.base|)))) (= |main_~#s~0.offset| (_ bv0 32)) (not (= (_ bv0 32) (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|))) (= (_ bv1 1) (select |#valid| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|))))} is VALID [2018-11-18 22:03:02,906 INFO L256 TraceCheckUtils]: 26: Hoare triple {2438#(and (= (bvadd (select |#valid| |main_~#s~0.base|) (_ bv1 1)) (_ bv0 1)) (exists ((|dll_create_#t~malloc3.base| (_ BitVec 32))) (and (not (= |main_~#s~0.base| |dll_create_#t~malloc3.base|)) (= (_ bv1 1) (select |#valid| |dll_create_#t~malloc3.base|)))) (= |main_~#s~0.offset| (_ bv0 32)) (not (= (_ bv0 32) (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|))) (= (_ bv1 1) (select |#valid| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|))))} call dll_prepend(~#s~0.base, ~#s~0.offset, ~data~0); {2442#(and (= |#valid| |old(#valid)|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))} is VALID [2018-11-18 22:03:02,906 INFO L273 TraceCheckUtils]: 27: Hoare triple {2442#(and (= |#valid| |old(#valid)|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))} ~head.base, ~head.offset := #in~head.base, #in~head.offset;~data := #in~data; {2446#(and (= |#valid| |old(#valid)|) (= dll_prepend_~head.offset |dll_prepend_#in~head.offset|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|) (= |dll_prepend_#in~head.base| dll_prepend_~head.base))} is VALID [2018-11-18 22:03:02,908 INFO L256 TraceCheckUtils]: 28: Hoare triple {2446#(and (= |#valid| |old(#valid)|) (= dll_prepend_~head.offset |dll_prepend_#in~head.offset|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|) (= |dll_prepend_#in~head.base| dll_prepend_~head.base))} call #t~ret6.base, #t~ret6.offset := node_create(~data); {2442#(and (= |#valid| |old(#valid)|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))} is VALID [2018-11-18 22:03:02,909 INFO L273 TraceCheckUtils]: 29: Hoare triple {2442#(and (= |#valid| |old(#valid)|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))} ~data := #in~data;call #t~malloc2.base, #t~malloc2.offset := #Ultimate.alloc(12bv32);~temp~0.base, ~temp~0.offset := #t~malloc2.base, #t~malloc2.offset; {2453#(and (= node_create_~temp~0.offset (_ bv0 32)) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|) (= (_ bv0 1) (select |old(#valid)| node_create_~temp~0.base)))} is VALID [2018-11-18 22:03:02,910 INFO L273 TraceCheckUtils]: 30: Hoare triple {2453#(and (= node_create_~temp~0.offset (_ bv0 32)) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|) (= (_ bv0 1) (select |old(#valid)| node_create_~temp~0.base)))} assume !(0bv32 == ~temp~0.base && 0bv32 == ~temp~0.offset); {2453#(and (= node_create_~temp~0.offset (_ bv0 32)) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|) (= (_ bv0 1) (select |old(#valid)| node_create_~temp~0.base)))} is VALID [2018-11-18 22:03:02,914 INFO L273 TraceCheckUtils]: 31: Hoare triple {2453#(and (= node_create_~temp~0.offset (_ bv0 32)) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|) (= (_ bv0 1) (select |old(#valid)| node_create_~temp~0.base)))} call write~$Pointer$(0bv32, 0bv32, ~temp~0.base, ~bvadd32(4bv32, ~temp~0.offset), 4bv32);call write~$Pointer$(0bv32, 0bv32, ~temp~0.base, ~bvadd32(8bv32, ~temp~0.offset), 4bv32);call write~intINTTYPE4(~data, ~temp~0.base, ~temp~0.offset, 4bv32);#res.base, #res.offset := ~temp~0.base, ~temp~0.offset; {2460#(and (= (_ bv0 1) (select |old(#valid)| |node_create_#res.base|)) (= |#memory_$Pointer$.base| (store |old(#memory_$Pointer$.base)| |node_create_#res.base| (store (store (select |old(#memory_$Pointer$.base)| |node_create_#res.base|) (bvadd |node_create_#res.offset| (_ bv4 32)) (_ bv0 32)) (bvadd |node_create_#res.offset| (_ bv8 32)) (_ bv0 32)))) (= |node_create_#res.offset| (_ bv0 32)))} is VALID [2018-11-18 22:03:02,915 INFO L273 TraceCheckUtils]: 32: Hoare triple {2460#(and (= (_ bv0 1) (select |old(#valid)| |node_create_#res.base|)) (= |#memory_$Pointer$.base| (store |old(#memory_$Pointer$.base)| |node_create_#res.base| (store (store (select |old(#memory_$Pointer$.base)| |node_create_#res.base|) (bvadd |node_create_#res.offset| (_ bv4 32)) (_ bv0 32)) (bvadd |node_create_#res.offset| (_ bv8 32)) (_ bv0 32)))) (= |node_create_#res.offset| (_ bv0 32)))} assume true; {2460#(and (= (_ bv0 1) (select |old(#valid)| |node_create_#res.base|)) (= |#memory_$Pointer$.base| (store |old(#memory_$Pointer$.base)| |node_create_#res.base| (store (store (select |old(#memory_$Pointer$.base)| |node_create_#res.base|) (bvadd |node_create_#res.offset| (_ bv4 32)) (_ bv0 32)) (bvadd |node_create_#res.offset| (_ bv8 32)) (_ bv0 32)))) (= |node_create_#res.offset| (_ bv0 32)))} is VALID [2018-11-18 22:03:02,917 INFO L268 TraceCheckUtils]: 33: Hoare quadruple {2460#(and (= (_ bv0 1) (select |old(#valid)| |node_create_#res.base|)) (= |#memory_$Pointer$.base| (store |old(#memory_$Pointer$.base)| |node_create_#res.base| (store (store (select |old(#memory_$Pointer$.base)| |node_create_#res.base|) (bvadd |node_create_#res.offset| (_ bv4 32)) (_ bv0 32)) (bvadd |node_create_#res.offset| (_ bv8 32)) (_ bv0 32)))) (= |node_create_#res.offset| (_ bv0 32)))} {2446#(and (= |#valid| |old(#valid)|) (= dll_prepend_~head.offset |dll_prepend_#in~head.offset|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|) (= |dll_prepend_#in~head.base| dll_prepend_~head.base))} #124#return; {2467#(and (= (select |old(#valid)| |dll_prepend_#t~ret6.base|) (_ bv0 1)) (= dll_prepend_~head.offset |dll_prepend_#in~head.offset|) (= |#memory_$Pointer$.base| (store |old(#memory_$Pointer$.base)| |dll_prepend_#t~ret6.base| (store (store (select |old(#memory_$Pointer$.base)| |dll_prepend_#t~ret6.base|) (_ bv4 32) (_ bv0 32)) (_ bv8 32) (_ bv0 32)))) (= |dll_prepend_#t~ret6.offset| (_ bv0 32)) (= |dll_prepend_#in~head.base| dll_prepend_~head.base))} is VALID [2018-11-18 22:03:02,923 INFO L273 TraceCheckUtils]: 34: Hoare triple {2467#(and (= (select |old(#valid)| |dll_prepend_#t~ret6.base|) (_ bv0 1)) (= dll_prepend_~head.offset |dll_prepend_#in~head.offset|) (= |#memory_$Pointer$.base| (store |old(#memory_$Pointer$.base)| |dll_prepend_#t~ret6.base| (store (store (select |old(#memory_$Pointer$.base)| |dll_prepend_#t~ret6.base|) (_ bv4 32) (_ bv0 32)) (_ bv8 32) (_ bv0 32)))) (= |dll_prepend_#t~ret6.offset| (_ bv0 32)) (= |dll_prepend_#in~head.base| dll_prepend_~head.base))} ~new_head~1.base, ~new_head~1.offset := #t~ret6.base, #t~ret6.offset;havoc #t~ret6.base, #t~ret6.offset;call #t~mem7.base, #t~mem7.offset := read~$Pointer$(~head.base, ~head.offset, 4bv32);call write~$Pointer$(#t~mem7.base, #t~mem7.offset, ~new_head~1.base, ~bvadd32(4bv32, ~new_head~1.offset), 4bv32);havoc #t~mem7.base, #t~mem7.offset;call #t~mem8.base, #t~mem8.offset := read~$Pointer$(~head.base, ~head.offset, 4bv32); {2471#(and (= (_ bv0 1) (select |old(#valid)| dll_prepend_~new_head~1.base)) (= dll_prepend_~head.offset |dll_prepend_#in~head.offset|) (= |#memory_$Pointer$.base| (store |old(#memory_$Pointer$.base)| dll_prepend_~new_head~1.base (store (store (store (select |old(#memory_$Pointer$.base)| dll_prepend_~new_head~1.base) (_ bv4 32) (_ bv0 32)) (_ bv8 32) (_ bv0 32)) (bvadd dll_prepend_~new_head~1.offset (_ bv4 32)) (select (select (store |old(#memory_$Pointer$.base)| dll_prepend_~new_head~1.base (store (store (select |old(#memory_$Pointer$.base)| dll_prepend_~new_head~1.base) (_ bv4 32) (_ bv0 32)) (_ bv8 32) (_ bv0 32))) dll_prepend_~head.base) dll_prepend_~head.offset)))) (= (_ bv0 32) dll_prepend_~new_head~1.offset) (= |dll_prepend_#in~head.base| dll_prepend_~head.base))} is VALID [2018-11-18 22:03:02,928 INFO L273 TraceCheckUtils]: 35: Hoare triple {2471#(and (= (_ bv0 1) (select |old(#valid)| dll_prepend_~new_head~1.base)) (= dll_prepend_~head.offset |dll_prepend_#in~head.offset|) (= |#memory_$Pointer$.base| (store |old(#memory_$Pointer$.base)| dll_prepend_~new_head~1.base (store (store (store (select |old(#memory_$Pointer$.base)| dll_prepend_~new_head~1.base) (_ bv4 32) (_ bv0 32)) (_ bv8 32) (_ bv0 32)) (bvadd dll_prepend_~new_head~1.offset (_ bv4 32)) (select (select (store |old(#memory_$Pointer$.base)| dll_prepend_~new_head~1.base (store (store (select |old(#memory_$Pointer$.base)| dll_prepend_~new_head~1.base) (_ bv4 32) (_ bv0 32)) (_ bv8 32) (_ bv0 32))) dll_prepend_~head.base) dll_prepend_~head.offset)))) (= (_ bv0 32) dll_prepend_~new_head~1.offset) (= |dll_prepend_#in~head.base| dll_prepend_~head.base))} assume #t~mem8.base != 0bv32 || #t~mem8.offset != 0bv32;havoc #t~mem8.base, #t~mem8.offset;call #t~mem9.base, #t~mem9.offset := read~$Pointer$(~head.base, ~head.offset, 4bv32);call write~$Pointer$(~new_head~1.base, ~new_head~1.offset, #t~mem9.base, ~bvadd32(8bv32, #t~mem9.offset), 4bv32);havoc #t~mem9.base, #t~mem9.offset; {2475#(and (= (_ bv0 1) (select |old(#valid)| dll_prepend_~new_head~1.base)) (exists ((v_arrayElimCell_11 (_ BitVec 32))) (= (store (store |old(#memory_$Pointer$.base)| dll_prepend_~new_head~1.base (store (store (store (select |old(#memory_$Pointer$.base)| dll_prepend_~new_head~1.base) (_ bv4 32) (_ bv0 32)) (_ bv8 32) (_ bv0 32)) (bvadd dll_prepend_~new_head~1.offset (_ bv4 32)) (select (select (store |old(#memory_$Pointer$.base)| dll_prepend_~new_head~1.base (store (store (select |old(#memory_$Pointer$.base)| dll_prepend_~new_head~1.base) (_ bv4 32) (_ bv0 32)) (_ bv8 32) (_ bv0 32))) dll_prepend_~head.base) dll_prepend_~head.offset))) (select (select (store |old(#memory_$Pointer$.base)| dll_prepend_~new_head~1.base (store (store (store (select |old(#memory_$Pointer$.base)| dll_prepend_~new_head~1.base) (_ bv4 32) (_ bv0 32)) (_ bv8 32) (_ bv0 32)) (bvadd dll_prepend_~new_head~1.offset (_ bv4 32)) (select (select (store |old(#memory_$Pointer$.base)| dll_prepend_~new_head~1.base (store (store (select |old(#memory_$Pointer$.base)| dll_prepend_~new_head~1.base) (_ bv4 32) (_ bv0 32)) (_ bv8 32) (_ bv0 32))) dll_prepend_~head.base) dll_prepend_~head.offset))) dll_prepend_~head.base) dll_prepend_~head.offset) (store (select (store |old(#memory_$Pointer$.base)| dll_prepend_~new_head~1.base (store (store (store (select |old(#memory_$Pointer$.base)| dll_prepend_~new_head~1.base) (_ bv4 32) (_ bv0 32)) (_ bv8 32) (_ bv0 32)) (bvadd dll_prepend_~new_head~1.offset (_ bv4 32)) (select (select (store |old(#memory_$Pointer$.base)| dll_prepend_~new_head~1.base (store (store (select |old(#memory_$Pointer$.base)| dll_prepend_~new_head~1.base) (_ bv4 32) (_ bv0 32)) (_ bv8 32) (_ bv0 32))) dll_prepend_~head.base) dll_prepend_~head.offset))) (select (select (store |old(#memory_$Pointer$.base)| dll_prepend_~new_head~1.base (store (store (store (select |old(#memory_$Pointer$.base)| dll_prepend_~new_head~1.base) (_ bv4 32) (_ bv0 32)) (_ bv8 32) (_ bv0 32)) (bvadd dll_prepend_~new_head~1.offset (_ bv4 32)) (select (select (store |old(#memory_$Pointer$.base)| dll_prepend_~new_head~1.base (store (store (select |old(#memory_$Pointer$.base)| dll_prepend_~new_head~1.base) (_ bv4 32) (_ bv0 32)) (_ bv8 32) (_ bv0 32))) dll_prepend_~head.base) dll_prepend_~head.offset))) dll_prepend_~head.base) dll_prepend_~head.offset)) (bvadd v_arrayElimCell_11 (_ bv8 32)) dll_prepend_~new_head~1.base)) |#memory_$Pointer$.base|)) (= dll_prepend_~head.offset |dll_prepend_#in~head.offset|) (= (_ bv0 32) dll_prepend_~new_head~1.offset) (= |dll_prepend_#in~head.base| dll_prepend_~head.base))} is VALID [2018-11-18 22:03:02,934 INFO L273 TraceCheckUtils]: 36: Hoare triple {2475#(and (= (_ bv0 1) (select |old(#valid)| dll_prepend_~new_head~1.base)) (exists ((v_arrayElimCell_11 (_ BitVec 32))) (= (store (store |old(#memory_$Pointer$.base)| dll_prepend_~new_head~1.base (store (store (store (select |old(#memory_$Pointer$.base)| dll_prepend_~new_head~1.base) (_ bv4 32) (_ bv0 32)) (_ bv8 32) (_ bv0 32)) (bvadd dll_prepend_~new_head~1.offset (_ bv4 32)) (select (select (store |old(#memory_$Pointer$.base)| dll_prepend_~new_head~1.base (store (store (select |old(#memory_$Pointer$.base)| dll_prepend_~new_head~1.base) (_ bv4 32) (_ bv0 32)) (_ bv8 32) (_ bv0 32))) dll_prepend_~head.base) dll_prepend_~head.offset))) (select (select (store |old(#memory_$Pointer$.base)| dll_prepend_~new_head~1.base (store (store (store (select |old(#memory_$Pointer$.base)| dll_prepend_~new_head~1.base) (_ bv4 32) (_ bv0 32)) (_ bv8 32) (_ bv0 32)) (bvadd dll_prepend_~new_head~1.offset (_ bv4 32)) (select (select (store |old(#memory_$Pointer$.base)| dll_prepend_~new_head~1.base (store (store (select |old(#memory_$Pointer$.base)| dll_prepend_~new_head~1.base) (_ bv4 32) (_ bv0 32)) (_ bv8 32) (_ bv0 32))) dll_prepend_~head.base) dll_prepend_~head.offset))) dll_prepend_~head.base) dll_prepend_~head.offset) (store (select (store |old(#memory_$Pointer$.base)| dll_prepend_~new_head~1.base (store (store (store (select |old(#memory_$Pointer$.base)| dll_prepend_~new_head~1.base) (_ bv4 32) (_ bv0 32)) (_ bv8 32) (_ bv0 32)) (bvadd dll_prepend_~new_head~1.offset (_ bv4 32)) (select (select (store |old(#memory_$Pointer$.base)| dll_prepend_~new_head~1.base (store (store (select |old(#memory_$Pointer$.base)| dll_prepend_~new_head~1.base) (_ bv4 32) (_ bv0 32)) (_ bv8 32) (_ bv0 32))) dll_prepend_~head.base) dll_prepend_~head.offset))) (select (select (store |old(#memory_$Pointer$.base)| dll_prepend_~new_head~1.base (store (store (store (select |old(#memory_$Pointer$.base)| dll_prepend_~new_head~1.base) (_ bv4 32) (_ bv0 32)) (_ bv8 32) (_ bv0 32)) (bvadd dll_prepend_~new_head~1.offset (_ bv4 32)) (select (select (store |old(#memory_$Pointer$.base)| dll_prepend_~new_head~1.base (store (store (select |old(#memory_$Pointer$.base)| dll_prepend_~new_head~1.base) (_ bv4 32) (_ bv0 32)) (_ bv8 32) (_ bv0 32))) dll_prepend_~head.base) dll_prepend_~head.offset))) dll_prepend_~head.base) dll_prepend_~head.offset)) (bvadd v_arrayElimCell_11 (_ bv8 32)) dll_prepend_~new_head~1.base)) |#memory_$Pointer$.base|)) (= dll_prepend_~head.offset |dll_prepend_#in~head.offset|) (= (_ bv0 32) dll_prepend_~new_head~1.offset) (= |dll_prepend_#in~head.base| dll_prepend_~head.base))} call write~$Pointer$(~new_head~1.base, ~new_head~1.offset, ~head.base, ~head.offset, 4bv32); {2479#(and (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| |dll_prepend_#in~head.base|) |dll_prepend_#in~head.offset|)) (exists ((v_arrayElimCell_11 (_ BitVec 32)) (dll_prepend_~new_head~1.base (_ BitVec 32))) (and (= (_ bv0 1) (select |old(#valid)| dll_prepend_~new_head~1.base)) (= |#memory_$Pointer$.base| (store (store (store |old(#memory_$Pointer$.base)| dll_prepend_~new_head~1.base (store (store (store (select |old(#memory_$Pointer$.base)| dll_prepend_~new_head~1.base) (_ bv4 32) (_ bv0 32)) (_ bv8 32) (_ bv0 32)) (_ bv4 32) (select (select (store |old(#memory_$Pointer$.base)| dll_prepend_~new_head~1.base (store (store (select |old(#memory_$Pointer$.base)| dll_prepend_~new_head~1.base) (_ bv4 32) (_ bv0 32)) (_ bv8 32) (_ bv0 32))) |dll_prepend_#in~head.base|) |dll_prepend_#in~head.offset|))) (select (select (store |old(#memory_$Pointer$.base)| dll_prepend_~new_head~1.base (store (store (store (select |old(#memory_$Pointer$.base)| dll_prepend_~new_head~1.base) (_ bv4 32) (_ bv0 32)) (_ bv8 32) (_ bv0 32)) (_ bv4 32) (select (select (store |old(#memory_$Pointer$.base)| dll_prepend_~new_head~1.base (store (store (select |old(#memory_$Pointer$.base)| dll_prepend_~new_head~1.base) (_ bv4 32) (_ bv0 32)) (_ bv8 32) (_ bv0 32))) |dll_prepend_#in~head.base|) |dll_prepend_#in~head.offset|))) |dll_prepend_#in~head.base|) |dll_prepend_#in~head.offset|) (store (select (store |old(#memory_$Pointer$.base)| dll_prepend_~new_head~1.base (store (store (store (select |old(#memory_$Pointer$.base)| dll_prepend_~new_head~1.base) (_ bv4 32) (_ bv0 32)) (_ bv8 32) (_ bv0 32)) (_ bv4 32) (select (select (store |old(#memory_$Pointer$.base)| dll_prepend_~new_head~1.base (store (store (select |old(#memory_$Pointer$.base)| dll_prepend_~new_head~1.base) (_ bv4 32) (_ bv0 32)) (_ bv8 32) (_ bv0 32))) |dll_prepend_#in~head.base|) |dll_prepend_#in~head.offset|))) (select (select (store |old(#memory_$Pointer$.base)| dll_prepend_~new_head~1.base (store (store (store (select |old(#memory_$Pointer$.base)| dll_prepend_~new_head~1.base) (_ bv4 32) (_ bv0 32)) (_ bv8 32) (_ bv0 32)) (_ bv4 32) (select (select (store |old(#memory_$Pointer$.base)| dll_prepend_~new_head~1.base (store (store (select |old(#memory_$Pointer$.base)| dll_prepend_~new_head~1.base) (_ bv4 32) (_ bv0 32)) (_ bv8 32) (_ bv0 32))) |dll_prepend_#in~head.base|) |dll_prepend_#in~head.offset|))) |dll_prepend_#in~head.base|) |dll_prepend_#in~head.offset|)) (bvadd v_arrayElimCell_11 (_ bv8 32)) dll_prepend_~new_head~1.base)) |dll_prepend_#in~head.base| (store (select (store (store |old(#memory_$Pointer$.base)| dll_prepend_~new_head~1.base (store (store (store (select |old(#memory_$Pointer$.base)| dll_prepend_~new_head~1.base) (_ bv4 32) (_ bv0 32)) (_ bv8 32) (_ bv0 32)) (_ bv4 32) (select (select (store |old(#memory_$Pointer$.base)| dll_prepend_~new_head~1.base (store (store (select |old(#memory_$Pointer$.base)| dll_prepend_~new_head~1.base) (_ bv4 32) (_ bv0 32)) (_ bv8 32) (_ bv0 32))) |dll_prepend_#in~head.base|) |dll_prepend_#in~head.offset|))) (select (select (store |old(#memory_$Pointer$.base)| dll_prepend_~new_head~1.base (store (store (store (select |old(#memory_$Pointer$.base)| dll_prepend_~new_head~1.base) (_ bv4 32) (_ bv0 32)) (_ bv8 32) (_ bv0 32)) (_ bv4 32) (select (select (store |old(#memory_$Pointer$.base)| dll_prepend_~new_head~1.base (store (store (select |old(#memory_$Pointer$.base)| dll_prepend_~new_head~1.base) (_ bv4 32) (_ bv0 32)) (_ bv8 32) (_ bv0 32))) |dll_prepend_#in~head.base|) |dll_prepend_#in~head.offset|))) |dll_prepend_#in~head.base|) |dll_prepend_#in~head.offset|) (store (select (store |old(#memory_$Pointer$.base)| dll_prepend_~new_head~1.base (store (store (store (select |old(#memory_$Pointer$.base)| dll_prepend_~new_head~1.base) (_ bv4 32) (_ bv0 32)) (_ bv8 32) (_ bv0 32)) (_ bv4 32) (select (select (store |old(#memory_$Pointer$.base)| dll_prepend_~new_head~1.base (store (store (select |old(#memory_$Pointer$.base)| dll_prepend_~new_head~1.base) (_ bv4 32) (_ bv0 32)) (_ bv8 32) (_ bv0 32))) |dll_prepend_#in~head.base|) |dll_prepend_#in~head.offset|))) (select (select (store |old(#memory_$Pointer$.base)| dll_prepend_~new_head~1.base (store (store (store (select |old(#memory_$Pointer$.base)| dll_prepend_~new_head~1.base) (_ bv4 32) (_ bv0 32)) (_ bv8 32) (_ bv0 32)) (_ bv4 32) (select (select (store |old(#memory_$Pointer$.base)| dll_prepend_~new_head~1.base (store (store (select |old(#memory_$Pointer$.base)| dll_prepend_~new_head~1.base) (_ bv4 32) (_ bv0 32)) (_ bv8 32) (_ bv0 32))) |dll_prepend_#in~head.base|) |dll_prepend_#in~head.offset|))) |dll_prepend_#in~head.base|) |dll_prepend_#in~head.offset|)) (bvadd v_arrayElimCell_11 (_ bv8 32)) dll_prepend_~new_head~1.base)) |dll_prepend_#in~head.base|) |dll_prepend_#in~head.offset| dll_prepend_~new_head~1.base))))))} is VALID [2018-11-18 22:03:02,936 INFO L273 TraceCheckUtils]: 37: Hoare triple {2479#(and (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| |dll_prepend_#in~head.base|) |dll_prepend_#in~head.offset|)) (exists ((v_arrayElimCell_11 (_ BitVec 32)) (dll_prepend_~new_head~1.base (_ BitVec 32))) (and (= (_ bv0 1) (select |old(#valid)| dll_prepend_~new_head~1.base)) (= |#memory_$Pointer$.base| (store (store (store |old(#memory_$Pointer$.base)| dll_prepend_~new_head~1.base (store (store (store (select |old(#memory_$Pointer$.base)| dll_prepend_~new_head~1.base) (_ bv4 32) (_ bv0 32)) (_ bv8 32) (_ bv0 32)) (_ bv4 32) (select (select (store |old(#memory_$Pointer$.base)| dll_prepend_~new_head~1.base (store (store (select |old(#memory_$Pointer$.base)| dll_prepend_~new_head~1.base) (_ bv4 32) (_ bv0 32)) (_ bv8 32) (_ bv0 32))) |dll_prepend_#in~head.base|) |dll_prepend_#in~head.offset|))) (select (select (store |old(#memory_$Pointer$.base)| dll_prepend_~new_head~1.base (store (store (store (select |old(#memory_$Pointer$.base)| dll_prepend_~new_head~1.base) (_ bv4 32) (_ bv0 32)) (_ bv8 32) (_ bv0 32)) (_ bv4 32) (select (select (store |old(#memory_$Pointer$.base)| dll_prepend_~new_head~1.base (store (store (select |old(#memory_$Pointer$.base)| dll_prepend_~new_head~1.base) (_ bv4 32) (_ bv0 32)) (_ bv8 32) (_ bv0 32))) |dll_prepend_#in~head.base|) |dll_prepend_#in~head.offset|))) |dll_prepend_#in~head.base|) |dll_prepend_#in~head.offset|) (store (select (store |old(#memory_$Pointer$.base)| dll_prepend_~new_head~1.base (store (store (store (select |old(#memory_$Pointer$.base)| dll_prepend_~new_head~1.base) (_ bv4 32) (_ bv0 32)) (_ bv8 32) (_ bv0 32)) (_ bv4 32) (select (select (store |old(#memory_$Pointer$.base)| dll_prepend_~new_head~1.base (store (store (select |old(#memory_$Pointer$.base)| dll_prepend_~new_head~1.base) (_ bv4 32) (_ bv0 32)) (_ bv8 32) (_ bv0 32))) |dll_prepend_#in~head.base|) |dll_prepend_#in~head.offset|))) (select (select (store |old(#memory_$Pointer$.base)| dll_prepend_~new_head~1.base (store (store (store (select |old(#memory_$Pointer$.base)| dll_prepend_~new_head~1.base) (_ bv4 32) (_ bv0 32)) (_ bv8 32) (_ bv0 32)) (_ bv4 32) (select (select (store |old(#memory_$Pointer$.base)| dll_prepend_~new_head~1.base (store (store (select |old(#memory_$Pointer$.base)| dll_prepend_~new_head~1.base) (_ bv4 32) (_ bv0 32)) (_ bv8 32) (_ bv0 32))) |dll_prepend_#in~head.base|) |dll_prepend_#in~head.offset|))) |dll_prepend_#in~head.base|) |dll_prepend_#in~head.offset|)) (bvadd v_arrayElimCell_11 (_ bv8 32)) dll_prepend_~new_head~1.base)) |dll_prepend_#in~head.base| (store (select (store (store |old(#memory_$Pointer$.base)| dll_prepend_~new_head~1.base (store (store (store (select |old(#memory_$Pointer$.base)| dll_prepend_~new_head~1.base) (_ bv4 32) (_ bv0 32)) (_ bv8 32) (_ bv0 32)) (_ bv4 32) (select (select (store |old(#memory_$Pointer$.base)| dll_prepend_~new_head~1.base (store (store (select |old(#memory_$Pointer$.base)| dll_prepend_~new_head~1.base) (_ bv4 32) (_ bv0 32)) (_ bv8 32) (_ bv0 32))) |dll_prepend_#in~head.base|) |dll_prepend_#in~head.offset|))) (select (select (store |old(#memory_$Pointer$.base)| dll_prepend_~new_head~1.base (store (store (store (select |old(#memory_$Pointer$.base)| dll_prepend_~new_head~1.base) (_ bv4 32) (_ bv0 32)) (_ bv8 32) (_ bv0 32)) (_ bv4 32) (select (select (store |old(#memory_$Pointer$.base)| dll_prepend_~new_head~1.base (store (store (select |old(#memory_$Pointer$.base)| dll_prepend_~new_head~1.base) (_ bv4 32) (_ bv0 32)) (_ bv8 32) (_ bv0 32))) |dll_prepend_#in~head.base|) |dll_prepend_#in~head.offset|))) |dll_prepend_#in~head.base|) |dll_prepend_#in~head.offset|) (store (select (store |old(#memory_$Pointer$.base)| dll_prepend_~new_head~1.base (store (store (store (select |old(#memory_$Pointer$.base)| dll_prepend_~new_head~1.base) (_ bv4 32) (_ bv0 32)) (_ bv8 32) (_ bv0 32)) (_ bv4 32) (select (select (store |old(#memory_$Pointer$.base)| dll_prepend_~new_head~1.base (store (store (select |old(#memory_$Pointer$.base)| dll_prepend_~new_head~1.base) (_ bv4 32) (_ bv0 32)) (_ bv8 32) (_ bv0 32))) |dll_prepend_#in~head.base|) |dll_prepend_#in~head.offset|))) (select (select (store |old(#memory_$Pointer$.base)| dll_prepend_~new_head~1.base (store (store (store (select |old(#memory_$Pointer$.base)| dll_prepend_~new_head~1.base) (_ bv4 32) (_ bv0 32)) (_ bv8 32) (_ bv0 32)) (_ bv4 32) (select (select (store |old(#memory_$Pointer$.base)| dll_prepend_~new_head~1.base (store (store (select |old(#memory_$Pointer$.base)| dll_prepend_~new_head~1.base) (_ bv4 32) (_ bv0 32)) (_ bv8 32) (_ bv0 32))) |dll_prepend_#in~head.base|) |dll_prepend_#in~head.offset|))) |dll_prepend_#in~head.base|) |dll_prepend_#in~head.offset|)) (bvadd v_arrayElimCell_11 (_ bv8 32)) dll_prepend_~new_head~1.base)) |dll_prepend_#in~head.base|) |dll_prepend_#in~head.offset| dll_prepend_~new_head~1.base))))))} assume true; {2479#(and (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| |dll_prepend_#in~head.base|) |dll_prepend_#in~head.offset|)) (exists ((v_arrayElimCell_11 (_ BitVec 32)) (dll_prepend_~new_head~1.base (_ BitVec 32))) (and (= (_ bv0 1) (select |old(#valid)| dll_prepend_~new_head~1.base)) (= |#memory_$Pointer$.base| (store (store (store |old(#memory_$Pointer$.base)| dll_prepend_~new_head~1.base (store (store (store (select |old(#memory_$Pointer$.base)| dll_prepend_~new_head~1.base) (_ bv4 32) (_ bv0 32)) (_ bv8 32) (_ bv0 32)) (_ bv4 32) (select (select (store |old(#memory_$Pointer$.base)| dll_prepend_~new_head~1.base (store (store (select |old(#memory_$Pointer$.base)| dll_prepend_~new_head~1.base) (_ bv4 32) (_ bv0 32)) (_ bv8 32) (_ bv0 32))) |dll_prepend_#in~head.base|) |dll_prepend_#in~head.offset|))) (select (select (store |old(#memory_$Pointer$.base)| dll_prepend_~new_head~1.base (store (store (store (select |old(#memory_$Pointer$.base)| dll_prepend_~new_head~1.base) (_ bv4 32) (_ bv0 32)) (_ bv8 32) (_ bv0 32)) (_ bv4 32) (select (select (store |old(#memory_$Pointer$.base)| dll_prepend_~new_head~1.base (store (store (select |old(#memory_$Pointer$.base)| dll_prepend_~new_head~1.base) (_ bv4 32) (_ bv0 32)) (_ bv8 32) (_ bv0 32))) |dll_prepend_#in~head.base|) |dll_prepend_#in~head.offset|))) |dll_prepend_#in~head.base|) |dll_prepend_#in~head.offset|) (store (select (store |old(#memory_$Pointer$.base)| dll_prepend_~new_head~1.base (store (store (store (select |old(#memory_$Pointer$.base)| dll_prepend_~new_head~1.base) (_ bv4 32) (_ bv0 32)) (_ bv8 32) (_ bv0 32)) (_ bv4 32) (select (select (store |old(#memory_$Pointer$.base)| dll_prepend_~new_head~1.base (store (store (select |old(#memory_$Pointer$.base)| dll_prepend_~new_head~1.base) (_ bv4 32) (_ bv0 32)) (_ bv8 32) (_ bv0 32))) |dll_prepend_#in~head.base|) |dll_prepend_#in~head.offset|))) (select (select (store |old(#memory_$Pointer$.base)| dll_prepend_~new_head~1.base (store (store (store (select |old(#memory_$Pointer$.base)| dll_prepend_~new_head~1.base) (_ bv4 32) (_ bv0 32)) (_ bv8 32) (_ bv0 32)) (_ bv4 32) (select (select (store |old(#memory_$Pointer$.base)| dll_prepend_~new_head~1.base (store (store (select |old(#memory_$Pointer$.base)| dll_prepend_~new_head~1.base) (_ bv4 32) (_ bv0 32)) (_ bv8 32) (_ bv0 32))) |dll_prepend_#in~head.base|) |dll_prepend_#in~head.offset|))) |dll_prepend_#in~head.base|) |dll_prepend_#in~head.offset|)) (bvadd v_arrayElimCell_11 (_ bv8 32)) dll_prepend_~new_head~1.base)) |dll_prepend_#in~head.base| (store (select (store (store |old(#memory_$Pointer$.base)| dll_prepend_~new_head~1.base (store (store (store (select |old(#memory_$Pointer$.base)| dll_prepend_~new_head~1.base) (_ bv4 32) (_ bv0 32)) (_ bv8 32) (_ bv0 32)) (_ bv4 32) (select (select (store |old(#memory_$Pointer$.base)| dll_prepend_~new_head~1.base (store (store (select |old(#memory_$Pointer$.base)| dll_prepend_~new_head~1.base) (_ bv4 32) (_ bv0 32)) (_ bv8 32) (_ bv0 32))) |dll_prepend_#in~head.base|) |dll_prepend_#in~head.offset|))) (select (select (store |old(#memory_$Pointer$.base)| dll_prepend_~new_head~1.base (store (store (store (select |old(#memory_$Pointer$.base)| dll_prepend_~new_head~1.base) (_ bv4 32) (_ bv0 32)) (_ bv8 32) (_ bv0 32)) (_ bv4 32) (select (select (store |old(#memory_$Pointer$.base)| dll_prepend_~new_head~1.base (store (store (select |old(#memory_$Pointer$.base)| dll_prepend_~new_head~1.base) (_ bv4 32) (_ bv0 32)) (_ bv8 32) (_ bv0 32))) |dll_prepend_#in~head.base|) |dll_prepend_#in~head.offset|))) |dll_prepend_#in~head.base|) |dll_prepend_#in~head.offset|) (store (select (store |old(#memory_$Pointer$.base)| dll_prepend_~new_head~1.base (store (store (store (select |old(#memory_$Pointer$.base)| dll_prepend_~new_head~1.base) (_ bv4 32) (_ bv0 32)) (_ bv8 32) (_ bv0 32)) (_ bv4 32) (select (select (store |old(#memory_$Pointer$.base)| dll_prepend_~new_head~1.base (store (store (select |old(#memory_$Pointer$.base)| dll_prepend_~new_head~1.base) (_ bv4 32) (_ bv0 32)) (_ bv8 32) (_ bv0 32))) |dll_prepend_#in~head.base|) |dll_prepend_#in~head.offset|))) (select (select (store |old(#memory_$Pointer$.base)| dll_prepend_~new_head~1.base (store (store (store (select |old(#memory_$Pointer$.base)| dll_prepend_~new_head~1.base) (_ bv4 32) (_ bv0 32)) (_ bv8 32) (_ bv0 32)) (_ bv4 32) (select (select (store |old(#memory_$Pointer$.base)| dll_prepend_~new_head~1.base (store (store (select |old(#memory_$Pointer$.base)| dll_prepend_~new_head~1.base) (_ bv4 32) (_ bv0 32)) (_ bv8 32) (_ bv0 32))) |dll_prepend_#in~head.base|) |dll_prepend_#in~head.offset|))) |dll_prepend_#in~head.base|) |dll_prepend_#in~head.offset|)) (bvadd v_arrayElimCell_11 (_ bv8 32)) dll_prepend_~new_head~1.base)) |dll_prepend_#in~head.base|) |dll_prepend_#in~head.offset| dll_prepend_~new_head~1.base))))))} is VALID [2018-11-18 22:03:02,945 INFO L268 TraceCheckUtils]: 38: Hoare quadruple {2479#(and (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| |dll_prepend_#in~head.base|) |dll_prepend_#in~head.offset|)) (exists ((v_arrayElimCell_11 (_ BitVec 32)) (dll_prepend_~new_head~1.base (_ BitVec 32))) (and (= (_ bv0 1) (select |old(#valid)| dll_prepend_~new_head~1.base)) (= |#memory_$Pointer$.base| (store (store (store |old(#memory_$Pointer$.base)| dll_prepend_~new_head~1.base (store (store (store (select |old(#memory_$Pointer$.base)| dll_prepend_~new_head~1.base) (_ bv4 32) (_ bv0 32)) (_ bv8 32) (_ bv0 32)) (_ bv4 32) (select (select (store |old(#memory_$Pointer$.base)| dll_prepend_~new_head~1.base (store (store (select |old(#memory_$Pointer$.base)| dll_prepend_~new_head~1.base) (_ bv4 32) (_ bv0 32)) (_ bv8 32) (_ bv0 32))) |dll_prepend_#in~head.base|) |dll_prepend_#in~head.offset|))) (select (select (store |old(#memory_$Pointer$.base)| dll_prepend_~new_head~1.base (store (store (store (select |old(#memory_$Pointer$.base)| dll_prepend_~new_head~1.base) (_ bv4 32) (_ bv0 32)) (_ bv8 32) (_ bv0 32)) (_ bv4 32) (select (select (store |old(#memory_$Pointer$.base)| dll_prepend_~new_head~1.base (store (store (select |old(#memory_$Pointer$.base)| dll_prepend_~new_head~1.base) (_ bv4 32) (_ bv0 32)) (_ bv8 32) (_ bv0 32))) |dll_prepend_#in~head.base|) |dll_prepend_#in~head.offset|))) |dll_prepend_#in~head.base|) |dll_prepend_#in~head.offset|) (store (select (store |old(#memory_$Pointer$.base)| dll_prepend_~new_head~1.base (store (store (store (select |old(#memory_$Pointer$.base)| dll_prepend_~new_head~1.base) (_ bv4 32) (_ bv0 32)) (_ bv8 32) (_ bv0 32)) (_ bv4 32) (select (select (store |old(#memory_$Pointer$.base)| dll_prepend_~new_head~1.base (store (store (select |old(#memory_$Pointer$.base)| dll_prepend_~new_head~1.base) (_ bv4 32) (_ bv0 32)) (_ bv8 32) (_ bv0 32))) |dll_prepend_#in~head.base|) |dll_prepend_#in~head.offset|))) (select (select (store |old(#memory_$Pointer$.base)| dll_prepend_~new_head~1.base (store (store (store (select |old(#memory_$Pointer$.base)| dll_prepend_~new_head~1.base) (_ bv4 32) (_ bv0 32)) (_ bv8 32) (_ bv0 32)) (_ bv4 32) (select (select (store |old(#memory_$Pointer$.base)| dll_prepend_~new_head~1.base (store (store (select |old(#memory_$Pointer$.base)| dll_prepend_~new_head~1.base) (_ bv4 32) (_ bv0 32)) (_ bv8 32) (_ bv0 32))) |dll_prepend_#in~head.base|) |dll_prepend_#in~head.offset|))) |dll_prepend_#in~head.base|) |dll_prepend_#in~head.offset|)) (bvadd v_arrayElimCell_11 (_ bv8 32)) dll_prepend_~new_head~1.base)) |dll_prepend_#in~head.base| (store (select (store (store |old(#memory_$Pointer$.base)| dll_prepend_~new_head~1.base (store (store (store (select |old(#memory_$Pointer$.base)| dll_prepend_~new_head~1.base) (_ bv4 32) (_ bv0 32)) (_ bv8 32) (_ bv0 32)) (_ bv4 32) (select (select (store |old(#memory_$Pointer$.base)| dll_prepend_~new_head~1.base (store (store (select |old(#memory_$Pointer$.base)| dll_prepend_~new_head~1.base) (_ bv4 32) (_ bv0 32)) (_ bv8 32) (_ bv0 32))) |dll_prepend_#in~head.base|) |dll_prepend_#in~head.offset|))) (select (select (store |old(#memory_$Pointer$.base)| dll_prepend_~new_head~1.base (store (store (store (select |old(#memory_$Pointer$.base)| dll_prepend_~new_head~1.base) (_ bv4 32) (_ bv0 32)) (_ bv8 32) (_ bv0 32)) (_ bv4 32) (select (select (store |old(#memory_$Pointer$.base)| dll_prepend_~new_head~1.base (store (store (select |old(#memory_$Pointer$.base)| dll_prepend_~new_head~1.base) (_ bv4 32) (_ bv0 32)) (_ bv8 32) (_ bv0 32))) |dll_prepend_#in~head.base|) |dll_prepend_#in~head.offset|))) |dll_prepend_#in~head.base|) |dll_prepend_#in~head.offset|) (store (select (store |old(#memory_$Pointer$.base)| dll_prepend_~new_head~1.base (store (store (store (select |old(#memory_$Pointer$.base)| dll_prepend_~new_head~1.base) (_ bv4 32) (_ bv0 32)) (_ bv8 32) (_ bv0 32)) (_ bv4 32) (select (select (store |old(#memory_$Pointer$.base)| dll_prepend_~new_head~1.base (store (store (select |old(#memory_$Pointer$.base)| dll_prepend_~new_head~1.base) (_ bv4 32) (_ bv0 32)) (_ bv8 32) (_ bv0 32))) |dll_prepend_#in~head.base|) |dll_prepend_#in~head.offset|))) (select (select (store |old(#memory_$Pointer$.base)| dll_prepend_~new_head~1.base (store (store (store (select |old(#memory_$Pointer$.base)| dll_prepend_~new_head~1.base) (_ bv4 32) (_ bv0 32)) (_ bv8 32) (_ bv0 32)) (_ bv4 32) (select (select (store |old(#memory_$Pointer$.base)| dll_prepend_~new_head~1.base (store (store (select |old(#memory_$Pointer$.base)| dll_prepend_~new_head~1.base) (_ bv4 32) (_ bv0 32)) (_ bv8 32) (_ bv0 32))) |dll_prepend_#in~head.base|) |dll_prepend_#in~head.offset|))) |dll_prepend_#in~head.base|) |dll_prepend_#in~head.offset|)) (bvadd v_arrayElimCell_11 (_ bv8 32)) dll_prepend_~new_head~1.base)) |dll_prepend_#in~head.base|) |dll_prepend_#in~head.offset| dll_prepend_~new_head~1.base))))))} {2438#(and (= (bvadd (select |#valid| |main_~#s~0.base|) (_ bv1 1)) (_ bv0 1)) (exists ((|dll_create_#t~malloc3.base| (_ BitVec 32))) (and (not (= |main_~#s~0.base| |dll_create_#t~malloc3.base|)) (= (_ bv1 1) (select |#valid| |dll_create_#t~malloc3.base|)))) (= |main_~#s~0.offset| (_ bv0 32)) (not (= (_ bv0 32) (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|))) (= (_ bv1 1) (select |#valid| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|))))} #118#return; {2486#(and (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) (_ bv4 32)) (_ bv0 32))) (= (select (select |#memory_$Pointer$.offset| |main_~#s~0.base|) |main_~#s~0.offset|) (_ bv0 32)) (= |main_~#s~0.offset| (_ bv0 32)) (exists ((v_arrayElimCell_11 (_ BitVec 32))) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) (_ bv4 32))) (bvadd v_arrayElimCell_11 (_ bv8 32))) (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|))) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) (_ bv8 32)) (_ bv0 32)) (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) (_ bv4 32)) (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|))) (not (= |main_~#s~0.base| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|))))} is VALID [2018-11-18 22:03:02,949 INFO L273 TraceCheckUtils]: 39: Hoare triple {2486#(and (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) (_ bv4 32)) (_ bv0 32))) (= (select (select |#memory_$Pointer$.offset| |main_~#s~0.base|) |main_~#s~0.offset|) (_ bv0 32)) (= |main_~#s~0.offset| (_ bv0 32)) (exists ((v_arrayElimCell_11 (_ BitVec 32))) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) (_ bv4 32))) (bvadd v_arrayElimCell_11 (_ bv8 32))) (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|))) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) (_ bv8 32)) (_ bv0 32)) (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) (_ bv4 32)) (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|))) (not (= |main_~#s~0.base| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|))))} call #t~mem11.base, #t~mem11.offset := read~$Pointer$(~#s~0.base, ~#s~0.offset, 4bv32);~ptr~0.base, ~ptr~0.offset := #t~mem11.base, #t~mem11.offset;havoc #t~mem11.base, #t~mem11.offset;~count~0 := 0bv32; {2490#(and (exists ((v_arrayElimCell_11 (_ BitVec 32)) (|main_~#s~0.base| (_ BitVec 32))) (and (= (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) (_ bv0 32)) main_~ptr~0.base) (not (= (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) (_ bv0 32)) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) (_ bv0 32))) (_ bv4 32)))) (= (_ bv0 32) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) (_ bv0 32))) (_ bv8 32))) (= (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) (_ bv0 32)) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) (_ bv0 32))) (_ bv4 32))) (bvadd v_arrayElimCell_11 (_ bv8 32)))) (not (= (_ bv0 32) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) (_ bv0 32))) (_ bv4 32)))) (not (= |main_~#s~0.base| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) (_ bv0 32)))))) (= main_~ptr~0.offset (_ bv0 32)))} is VALID [2018-11-18 22:03:02,950 INFO L273 TraceCheckUtils]: 40: Hoare triple {2490#(and (exists ((v_arrayElimCell_11 (_ BitVec 32)) (|main_~#s~0.base| (_ BitVec 32))) (and (= (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) (_ bv0 32)) main_~ptr~0.base) (not (= (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) (_ bv0 32)) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) (_ bv0 32))) (_ bv4 32)))) (= (_ bv0 32) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) (_ bv0 32))) (_ bv8 32))) (= (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) (_ bv0 32)) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) (_ bv0 32))) (_ bv4 32))) (bvadd v_arrayElimCell_11 (_ bv8 32)))) (not (= (_ bv0 32) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) (_ bv0 32))) (_ bv4 32)))) (not (= |main_~#s~0.base| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) (_ bv0 32)))))) (= main_~ptr~0.offset (_ bv0 32)))} assume true; {2490#(and (exists ((v_arrayElimCell_11 (_ BitVec 32)) (|main_~#s~0.base| (_ BitVec 32))) (and (= (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) (_ bv0 32)) main_~ptr~0.base) (not (= (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) (_ bv0 32)) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) (_ bv0 32))) (_ bv4 32)))) (= (_ bv0 32) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) (_ bv0 32))) (_ bv8 32))) (= (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) (_ bv0 32)) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) (_ bv0 32))) (_ bv4 32))) (bvadd v_arrayElimCell_11 (_ bv8 32)))) (not (= (_ bv0 32) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) (_ bv0 32))) (_ bv4 32)))) (not (= |main_~#s~0.base| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) (_ bv0 32)))))) (= main_~ptr~0.offset (_ bv0 32)))} is VALID [2018-11-18 22:03:02,952 INFO L273 TraceCheckUtils]: 41: Hoare triple {2490#(and (exists ((v_arrayElimCell_11 (_ BitVec 32)) (|main_~#s~0.base| (_ BitVec 32))) (and (= (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) (_ bv0 32)) main_~ptr~0.base) (not (= (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) (_ bv0 32)) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) (_ bv0 32))) (_ bv4 32)))) (= (_ bv0 32) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) (_ bv0 32))) (_ bv8 32))) (= (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) (_ bv0 32)) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) (_ bv0 32))) (_ bv4 32))) (bvadd v_arrayElimCell_11 (_ bv8 32)))) (not (= (_ bv0 32) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) (_ bv0 32))) (_ bv4 32)))) (not (= |main_~#s~0.base| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) (_ bv0 32)))))) (= main_~ptr~0.offset (_ bv0 32)))} assume !!(~ptr~0.base != 0bv32 || ~ptr~0.offset != 0bv32);call #t~mem12.base, #t~mem12.offset := read~$Pointer$(~ptr~0.base, ~bvadd32(4bv32, ~ptr~0.offset), 4bv32);~temp~2.base, ~temp~2.offset := #t~mem12.base, #t~mem12.offset;havoc #t~mem12.base, #t~mem12.offset;call #t~mem13 := read~intINTTYPE4(~ptr~0.base, ~ptr~0.offset, 4bv32); {2497#(not (= main_~temp~2.base (_ bv0 32)))} is VALID [2018-11-18 22:03:02,952 INFO L273 TraceCheckUtils]: 42: Hoare triple {2497#(not (= main_~temp~2.base (_ bv0 32)))} assume !(~data~0 != #t~mem13);havoc #t~mem13;~ptr~0.base, ~ptr~0.offset := ~temp~2.base, ~temp~2.offset;#t~post14 := ~count~0;~count~0 := ~bvadd32(1bv32, #t~post14);havoc #t~post14; {2501#(not (= (_ bv0 32) main_~ptr~0.base))} is VALID [2018-11-18 22:03:02,953 INFO L273 TraceCheckUtils]: 43: Hoare triple {2501#(not (= (_ bv0 32) main_~ptr~0.base))} assume true; {2501#(not (= (_ bv0 32) main_~ptr~0.base))} is VALID [2018-11-18 22:03:02,955 INFO L273 TraceCheckUtils]: 44: Hoare triple {2501#(not (= (_ bv0 32) main_~ptr~0.base))} assume !(~ptr~0.base != 0bv32 || ~ptr~0.offset != 0bv32); {2352#false} is VALID [2018-11-18 22:03:02,955 INFO L273 TraceCheckUtils]: 45: Hoare triple {2352#false} assume ~count~0 != ~bvadd32(1bv32, ~len~0); {2352#false} is VALID [2018-11-18 22:03:02,956 INFO L273 TraceCheckUtils]: 46: Hoare triple {2352#false} assume !false; {2352#false} is VALID [2018-11-18 22:03:02,975 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 8 not checked. [2018-11-18 22:03:02,975 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-18 22:03:06,882 WARN L180 SmtUtils]: Spent 1.32 s on a formula simplification that was a NOOP. DAG size: 76 [2018-11-18 22:03:07,278 WARN L180 SmtUtils]: Spent 387.00 ms on a formula simplification that was a NOOP. DAG size: 47 [2018-11-18 22:03:07,884 WARN L180 SmtUtils]: Spent 602.00 ms on a formula simplification that was a NOOP. DAG size: 59 [2018-11-18 22:03:08,572 WARN L180 SmtUtils]: Spent 686.00 ms on a formula simplification that was a NOOP. DAG size: 55 [2018-11-18 22:03:08,962 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 292 treesize of output 288 [2018-11-18 22:03:08,998 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 288 treesize of output 284 [2018-11-18 22:03:09,009 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-18 22:03:09,024 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-18 22:03:09,067 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-11-18 22:03:09,068 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:299, output treesize:291 [2018-11-18 22:03:15,704 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 22:03:15,704 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FPBP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-18 22:03:15,714 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 22:03:15,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 22:03:15,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 22:03:15,806 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 22:03:15,833 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:15,835 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-18 22:03:15,838 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 22:03:15,839 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-11-18 22:03:15,842 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-18 22:03:16,127 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 22:03:16,130 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 22:03:16,131 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 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 20 treesize of output 27 [2018-11-18 22:03:16,145 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 20 [2018-11-18 22:03:16,147 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 22:03:16,163 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 22:03:16,187 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-18 22:03:16,188 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:24, output treesize:24 [2018-11-18 22:03:18,202 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-18 22:03:18,393 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 11 treesize of output 8 [2018-11-18 22:03:18,399 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-11-18 22:03:18,400 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 22:03:18,406 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 22:03:18,431 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-18 22:03:18,432 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:37, output treesize:34 [2018-11-18 22:03:18,445 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-18 22:03:20,767 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 149 treesize of output 147 [2018-11-18 22:03:20,784 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 147 treesize of output 145 [2018-11-18 22:03:20,788 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-18 22:03:20,812 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-18 22:03:20,961 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-18 22:03:20,961 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:164, output treesize:160 [2018-11-18 22:03:21,581 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-18 22:03:24,049 INFO L303 Elim1Store]: Index analysis took 108 ms [2018-11-18 22:03:24,049 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:24,079 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:24,081 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 22:03:24,112 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 22:03:24,268 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:24,268 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:296, output treesize:292 [2018-11-18 22:03:26,638 WARN L180 SmtUtils]: Spent 2.27 s on a formula simplification. DAG size of input: 119 DAG size of output: 54 [2018-11-18 22:03:26,695 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 22:03:26,728 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 22:03:26,741 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 22:03:26,754 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 22:03:26,755 INFO L303 Elim1Store]: Index analysis took 110 ms [2018-11-18 22:03:26,756 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 21 [2018-11-18 22:03:26,757 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-18 22:03:27,009 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 22:03:27,279 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 22:03:27,291 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 22:03:27,291 INFO L682 Elim1Store]: detected equality via solver [2018-11-18 22:03:27,292 INFO L303 Elim1Store]: Index analysis took 331 ms [2018-11-18 22:03:27,296 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 3 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 1 case distinctions, treesize of input 158 treesize of output 138 [2018-11-18 22:03:27,851 WARN L180 SmtUtils]: Spent 537.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 50 [2018-11-18 22:03:27,864 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 44 [2018-11-18 22:03:27,876 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 44 treesize of output 43 [2018-11-18 22:03:27,878 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-18 22:03:27,952 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 22:03:28,222 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 7 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 66 [2018-11-18 22:03:28,290 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 7 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 63 [2018-11-18 22:03:28,317 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 4 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:28,324 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-11-18 22:03:28,357 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 22:03:28,400 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-18 22:03:28,425 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 60 treesize of output 70 [2018-11-18 22:03:28,475 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 5 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 55 treesize of output 67 [2018-11-18 22:03:28,477 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-11-18 22:03:28,569 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-18 22:03:28,705 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 5 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 67 treesize of output 65 [2018-11-18 22:03:28,726 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 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 28 treesize of output 24 [2018-11-18 22:03:28,729 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:03:28,765 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-18 22:03:28,784 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 5 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 64 treesize of output 62 [2018-11-18 22:03:28,793 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 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 25 treesize of output 21 [2018-11-18 22:03:28,797 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:03:28,833 INFO L267 ElimStorePlain]: Start of recursive call 13: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-18 22:03:29,035 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 75 treesize of output 69 [2018-11-18 22:03:29,054 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 61 treesize of output 57 [2018-11-18 22:03:29,056 INFO L267 ElimStorePlain]: Start of recursive call 16: End of recursive call: and 1 xjuncts. [2018-11-18 22:03:29,189 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 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 55 treesize of output 44 [2018-11-18 22:03:29,198 INFO L267 ElimStorePlain]: Start of recursive call 17: End of recursive call: and 1 xjuncts. [2018-11-18 22:03:29,399 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 47 treesize of output 61 [2018-11-18 22:03:29,539 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 22:03:29,542 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 22:03:29,543 INFO L303 Elim1Store]: Index analysis took 134 ms [2018-11-18 22:03:29,544 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 5 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 55 treesize of output 75 [2018-11-18 22:03:29,546 INFO L267 ElimStorePlain]: Start of recursive call 19: End of recursive call: and 1 xjuncts. [2018-11-18 22:03:29,674 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 51 [2018-11-18 22:03:29,676 INFO L267 ElimStorePlain]: Start of recursive call 20: End of recursive call: and 1 xjuncts. [2018-11-18 22:03:29,748 INFO L267 ElimStorePlain]: Start of recursive call 18: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 22:03:29,862 INFO L267 ElimStorePlain]: Start of recursive call 15: 5 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 22:03:29,919 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 72 treesize of output 68 [2018-11-18 22:03:29,933 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 64 treesize of output 63 [2018-11-18 22:03:29,938 INFO L267 ElimStorePlain]: Start of recursive call 22: End of recursive call: and 1 xjuncts. [2018-11-18 22:03:30,093 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 59 treesize of output 51 [2018-11-18 22:03:30,098 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:03:30,232 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 47 [2018-11-18 22:03:30,235 INFO L267 ElimStorePlain]: Start of recursive call 24: End of recursive call: and 1 xjuncts. [2018-11-18 22:03:30,377 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 52 [2018-11-18 22:03:30,382 INFO L267 ElimStorePlain]: Start of recursive call 25: End of recursive call: and 1 xjuncts. [2018-11-18 22:03:30,650 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 5 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 52 treesize of output 66 [2018-11-18 22:03:30,660 INFO L267 ElimStorePlain]: Start of recursive call 26: End of recursive call: and 2 xjuncts. [2018-11-18 22:03:31,181 INFO L267 ElimStorePlain]: Start of recursive call 21: 5 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-11-18 22:03:31,341 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, 3 dim-2 vars, End of recursive call: and 4 xjuncts. [2018-11-18 22:03:31,432 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-18 22:03:31,433 INFO L202 ElimStorePlain]: Needed 26 recursive calls to eliminate 5 variables, input treesize:325, output treesize:76 [2018-11-18 22:03:35,077 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-18 22:03:35,375 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 15 treesize of output 11 [2018-11-18 22:03:35,383 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 11 treesize of output 3 [2018-11-18 22:03:35,384 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 22:03:35,390 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 22:03:35,439 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2018-11-18 22:03:35,439 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:90, output treesize:79 [2018-11-18 22:03:35,456 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-18 22:03:37,735 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 1 case distinctions, treesize of input 80 treesize of output 53 [2018-11-18 22:03:37,750 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 30 [2018-11-18 22:03:37,752 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 22:03:37,827 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 26 [2018-11-18 22:03:37,829 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-18 22:03:37,896 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 30 treesize of output 21 [2018-11-18 22:03:37,898 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-18 22:03:37,956 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 16 [2018-11-18 22:03:37,961 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-11-18 22:03:37,970 INFO L267 ElimStorePlain]: Start of recursive call 2: 5 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 22:03:37,973 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-18 22:03:37,973 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 4 variables, input treesize:80, output treesize:4 [2018-11-18 22:03:37,979 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-18 22:03:37,982 INFO L256 TraceCheckUtils]: 0: Hoare triple {2351#true} call ULTIMATE.init(); {2351#true} is VALID [2018-11-18 22:03:37,982 INFO L273 TraceCheckUtils]: 1: Hoare triple {2351#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {2351#true} is VALID [2018-11-18 22:03:37,982 INFO L273 TraceCheckUtils]: 2: Hoare triple {2351#true} assume true; {2351#true} is VALID [2018-11-18 22:03:37,982 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {2351#true} {2351#true} #126#return; {2351#true} is VALID [2018-11-18 22:03:37,982 INFO L256 TraceCheckUtils]: 4: Hoare triple {2351#true} call #t~ret16 := main(); {2351#true} is VALID [2018-11-18 22:03:37,984 INFO L273 TraceCheckUtils]: 5: Hoare triple {2351#true} ~len~0 := 2bv32;~data~0 := 1bv32;call ~#s~0.base, ~#s~0.offset := #Ultimate.alloc(4bv32);call write~$Pointer$(0bv32, 0bv32, ~#s~0.base, ~#s~0.offset, 4bv32); {2559#(= (bvadd (select |#valid| |main_~#s~0.base|) (_ bv1 1)) (_ bv0 1))} is VALID [2018-11-18 22:03:37,984 INFO L256 TraceCheckUtils]: 6: Hoare triple {2559#(= (bvadd (select |#valid| |main_~#s~0.base|) (_ bv1 1)) (_ bv0 1))} call #t~ret10.base, #t~ret10.offset := dll_create(~len~0, ~data~0); {2375#(= |#valid| |old(#valid)|)} is VALID [2018-11-18 22:03:37,985 INFO L273 TraceCheckUtils]: 7: Hoare triple {2375#(= |#valid| |old(#valid)|)} ~len := #in~len;~data := #in~data;~head~0.base, ~head~0.offset := 0bv32, 0bv32; {2375#(= |#valid| |old(#valid)|)} is VALID [2018-11-18 22:03:37,986 INFO L273 TraceCheckUtils]: 8: Hoare triple {2375#(= |#valid| |old(#valid)|)} assume true; {2375#(= |#valid| |old(#valid)|)} is VALID [2018-11-18 22:03:37,988 INFO L273 TraceCheckUtils]: 9: Hoare triple {2375#(= |#valid| |old(#valid)|)} 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; {2385#(exists ((|dll_create_#t~malloc3.base| (_ BitVec 32))) (and (= |#valid| (store |old(#valid)| |dll_create_#t~malloc3.base| (_ bv1 1))) (= (select |old(#valid)| |dll_create_#t~malloc3.base|) (_ bv0 1))))} is VALID [2018-11-18 22:03:37,988 INFO L273 TraceCheckUtils]: 10: Hoare triple {2385#(exists ((|dll_create_#t~malloc3.base| (_ BitVec 32))) (and (= |#valid| (store |old(#valid)| |dll_create_#t~malloc3.base| (_ bv1 1))) (= (select |old(#valid)| |dll_create_#t~malloc3.base|) (_ bv0 1))))} assume !(0bv32 == ~new_head~0.base && 0bv32 == ~new_head~0.offset); {2385#(exists ((|dll_create_#t~malloc3.base| (_ BitVec 32))) (and (= |#valid| (store |old(#valid)| |dll_create_#t~malloc3.base| (_ bv1 1))) (= (select |old(#valid)| |dll_create_#t~malloc3.base|) (_ bv0 1))))} is VALID [2018-11-18 22:03:37,989 INFO L273 TraceCheckUtils]: 11: Hoare triple {2385#(exists ((|dll_create_#t~malloc3.base| (_ BitVec 32))) (and (= |#valid| (store |old(#valid)| |dll_create_#t~malloc3.base| (_ bv1 1))) (= (select |old(#valid)| |dll_create_#t~malloc3.base|) (_ bv0 1))))} 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); {2385#(exists ((|dll_create_#t~malloc3.base| (_ BitVec 32))) (and (= |#valid| (store |old(#valid)| |dll_create_#t~malloc3.base| (_ bv1 1))) (= (select |old(#valid)| |dll_create_#t~malloc3.base|) (_ bv0 1))))} is VALID [2018-11-18 22:03:37,989 INFO L273 TraceCheckUtils]: 12: Hoare triple {2385#(exists ((|dll_create_#t~malloc3.base| (_ BitVec 32))) (and (= |#valid| (store |old(#valid)| |dll_create_#t~malloc3.base| (_ bv1 1))) (= (select |old(#valid)| |dll_create_#t~malloc3.base|) (_ bv0 1))))} assume !(~head~0.base != 0bv32 || ~head~0.offset != 0bv32); {2385#(exists ((|dll_create_#t~malloc3.base| (_ BitVec 32))) (and (= |#valid| (store |old(#valid)| |dll_create_#t~malloc3.base| (_ bv1 1))) (= (select |old(#valid)| |dll_create_#t~malloc3.base|) (_ bv0 1))))} is VALID [2018-11-18 22:03:37,990 INFO L273 TraceCheckUtils]: 13: Hoare triple {2385#(exists ((|dll_create_#t~malloc3.base| (_ BitVec 32))) (and (= |#valid| (store |old(#valid)| |dll_create_#t~malloc3.base| (_ bv1 1))) (= (select |old(#valid)| |dll_create_#t~malloc3.base|) (_ bv0 1))))} ~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; {2385#(exists ((|dll_create_#t~malloc3.base| (_ BitVec 32))) (and (= |#valid| (store |old(#valid)| |dll_create_#t~malloc3.base| (_ bv1 1))) (= (select |old(#valid)| |dll_create_#t~malloc3.base|) (_ bv0 1))))} is VALID [2018-11-18 22:03:37,990 INFO L273 TraceCheckUtils]: 14: Hoare triple {2385#(exists ((|dll_create_#t~malloc3.base| (_ BitVec 32))) (and (= |#valid| (store |old(#valid)| |dll_create_#t~malloc3.base| (_ bv1 1))) (= (select |old(#valid)| |dll_create_#t~malloc3.base|) (_ bv0 1))))} assume true; {2385#(exists ((|dll_create_#t~malloc3.base| (_ BitVec 32))) (and (= |#valid| (store |old(#valid)| |dll_create_#t~malloc3.base| (_ bv1 1))) (= (select |old(#valid)| |dll_create_#t~malloc3.base|) (_ bv0 1))))} is VALID [2018-11-18 22:03:37,992 INFO L273 TraceCheckUtils]: 15: Hoare triple {2385#(exists ((|dll_create_#t~malloc3.base| (_ BitVec 32))) (and (= |#valid| (store |old(#valid)| |dll_create_#t~malloc3.base| (_ bv1 1))) (= (select |old(#valid)| |dll_create_#t~malloc3.base|) (_ 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; {2404#(and (not (= dll_create_~new_head~0.base (_ bv0 32))) (exists ((|dll_create_#t~malloc3.base| (_ BitVec 32))) (and (= |#valid| (store (store |old(#valid)| |dll_create_#t~malloc3.base| (_ bv1 1)) dll_create_~new_head~0.base (_ bv1 1))) (= (select |old(#valid)| |dll_create_#t~malloc3.base|) (_ bv0 1)))))} is VALID [2018-11-18 22:03:37,992 INFO L273 TraceCheckUtils]: 16: Hoare triple {2404#(and (not (= dll_create_~new_head~0.base (_ bv0 32))) (exists ((|dll_create_#t~malloc3.base| (_ BitVec 32))) (and (= |#valid| (store (store |old(#valid)| |dll_create_#t~malloc3.base| (_ bv1 1)) dll_create_~new_head~0.base (_ bv1 1))) (= (select |old(#valid)| |dll_create_#t~malloc3.base|) (_ bv0 1)))))} assume !(0bv32 == ~new_head~0.base && 0bv32 == ~new_head~0.offset); {2404#(and (not (= dll_create_~new_head~0.base (_ bv0 32))) (exists ((|dll_create_#t~malloc3.base| (_ BitVec 32))) (and (= |#valid| (store (store |old(#valid)| |dll_create_#t~malloc3.base| (_ bv1 1)) dll_create_~new_head~0.base (_ bv1 1))) (= (select |old(#valid)| |dll_create_#t~malloc3.base|) (_ bv0 1)))))} is VALID [2018-11-18 22:03:37,993 INFO L273 TraceCheckUtils]: 17: Hoare triple {2404#(and (not (= dll_create_~new_head~0.base (_ bv0 32))) (exists ((|dll_create_#t~malloc3.base| (_ BitVec 32))) (and (= |#valid| (store (store |old(#valid)| |dll_create_#t~malloc3.base| (_ bv1 1)) dll_create_~new_head~0.base (_ bv1 1))) (= (select |old(#valid)| |dll_create_#t~malloc3.base|) (_ bv0 1)))))} 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); {2404#(and (not (= dll_create_~new_head~0.base (_ bv0 32))) (exists ((|dll_create_#t~malloc3.base| (_ BitVec 32))) (and (= |#valid| (store (store |old(#valid)| |dll_create_#t~malloc3.base| (_ bv1 1)) dll_create_~new_head~0.base (_ bv1 1))) (= (select |old(#valid)| |dll_create_#t~malloc3.base|) (_ bv0 1)))))} is VALID [2018-11-18 22:03:37,994 INFO L273 TraceCheckUtils]: 18: Hoare triple {2404#(and (not (= dll_create_~new_head~0.base (_ bv0 32))) (exists ((|dll_create_#t~malloc3.base| (_ BitVec 32))) (and (= |#valid| (store (store |old(#valid)| |dll_create_#t~malloc3.base| (_ bv1 1)) dll_create_~new_head~0.base (_ bv1 1))) (= (select |old(#valid)| |dll_create_#t~malloc3.base|) (_ bv0 1)))))} 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); {2404#(and (not (= dll_create_~new_head~0.base (_ bv0 32))) (exists ((|dll_create_#t~malloc3.base| (_ BitVec 32))) (and (= |#valid| (store (store |old(#valid)| |dll_create_#t~malloc3.base| (_ bv1 1)) dll_create_~new_head~0.base (_ bv1 1))) (= (select |old(#valid)| |dll_create_#t~malloc3.base|) (_ bv0 1)))))} is VALID [2018-11-18 22:03:37,996 INFO L273 TraceCheckUtils]: 19: Hoare triple {2404#(and (not (= dll_create_~new_head~0.base (_ bv0 32))) (exists ((|dll_create_#t~malloc3.base| (_ BitVec 32))) (and (= |#valid| (store (store |old(#valid)| |dll_create_#t~malloc3.base| (_ bv1 1)) dll_create_~new_head~0.base (_ bv1 1))) (= (select |old(#valid)| |dll_create_#t~malloc3.base|) (_ bv0 1)))))} ~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; {2417#(and (exists ((|dll_create_#t~malloc3.base| (_ BitVec 32))) (and (= |#valid| (store (store |old(#valid)| |dll_create_#t~malloc3.base| (_ bv1 1)) dll_create_~head~0.base (_ bv1 1))) (= (select |old(#valid)| |dll_create_#t~malloc3.base|) (_ bv0 1)))) (not (= (_ bv0 32) dll_create_~head~0.base)))} is VALID [2018-11-18 22:03:37,997 INFO L273 TraceCheckUtils]: 20: Hoare triple {2417#(and (exists ((|dll_create_#t~malloc3.base| (_ BitVec 32))) (and (= |#valid| (store (store |old(#valid)| |dll_create_#t~malloc3.base| (_ bv1 1)) dll_create_~head~0.base (_ bv1 1))) (= (select |old(#valid)| |dll_create_#t~malloc3.base|) (_ bv0 1)))) (not (= (_ bv0 32) dll_create_~head~0.base)))} assume true; {2417#(and (exists ((|dll_create_#t~malloc3.base| (_ BitVec 32))) (and (= |#valid| (store (store |old(#valid)| |dll_create_#t~malloc3.base| (_ bv1 1)) dll_create_~head~0.base (_ bv1 1))) (= (select |old(#valid)| |dll_create_#t~malloc3.base|) (_ bv0 1)))) (not (= (_ bv0 32) dll_create_~head~0.base)))} is VALID [2018-11-18 22:03:38,000 INFO L273 TraceCheckUtils]: 21: Hoare triple {2417#(and (exists ((|dll_create_#t~malloc3.base| (_ BitVec 32))) (and (= |#valid| (store (store |old(#valid)| |dll_create_#t~malloc3.base| (_ bv1 1)) dll_create_~head~0.base (_ bv1 1))) (= (select |old(#valid)| |dll_create_#t~malloc3.base|) (_ bv0 1)))) (not (= (_ bv0 32) dll_create_~head~0.base)))} assume !~bvsgt32(~len, 0bv32); {2417#(and (exists ((|dll_create_#t~malloc3.base| (_ BitVec 32))) (and (= |#valid| (store (store |old(#valid)| |dll_create_#t~malloc3.base| (_ bv1 1)) dll_create_~head~0.base (_ bv1 1))) (= (select |old(#valid)| |dll_create_#t~malloc3.base|) (_ bv0 1)))) (not (= (_ bv0 32) dll_create_~head~0.base)))} is VALID [2018-11-18 22:03:38,001 INFO L273 TraceCheckUtils]: 22: Hoare triple {2417#(and (exists ((|dll_create_#t~malloc3.base| (_ BitVec 32))) (and (= |#valid| (store (store |old(#valid)| |dll_create_#t~malloc3.base| (_ bv1 1)) dll_create_~head~0.base (_ bv1 1))) (= (select |old(#valid)| |dll_create_#t~malloc3.base|) (_ bv0 1)))) (not (= (_ bv0 32) dll_create_~head~0.base)))} #res.base, #res.offset := ~head~0.base, ~head~0.offset; {2427#(and (not (= |dll_create_#res.base| (_ bv0 32))) (exists ((|dll_create_#t~malloc3.base| (_ BitVec 32))) (and (= |#valid| (store (store |old(#valid)| |dll_create_#t~malloc3.base| (_ bv1 1)) |dll_create_#res.base| (_ bv1 1))) (= (select |old(#valid)| |dll_create_#t~malloc3.base|) (_ bv0 1)))))} is VALID [2018-11-18 22:03:38,001 INFO L273 TraceCheckUtils]: 23: Hoare triple {2427#(and (not (= |dll_create_#res.base| (_ bv0 32))) (exists ((|dll_create_#t~malloc3.base| (_ BitVec 32))) (and (= |#valid| (store (store |old(#valid)| |dll_create_#t~malloc3.base| (_ bv1 1)) |dll_create_#res.base| (_ bv1 1))) (= (select |old(#valid)| |dll_create_#t~malloc3.base|) (_ bv0 1)))))} assume true; {2427#(and (not (= |dll_create_#res.base| (_ bv0 32))) (exists ((|dll_create_#t~malloc3.base| (_ BitVec 32))) (and (= |#valid| (store (store |old(#valid)| |dll_create_#t~malloc3.base| (_ bv1 1)) |dll_create_#res.base| (_ bv1 1))) (= (select |old(#valid)| |dll_create_#t~malloc3.base|) (_ bv0 1)))))} is VALID [2018-11-18 22:03:38,006 INFO L268 TraceCheckUtils]: 24: Hoare quadruple {2427#(and (not (= |dll_create_#res.base| (_ bv0 32))) (exists ((|dll_create_#t~malloc3.base| (_ BitVec 32))) (and (= |#valid| (store (store |old(#valid)| |dll_create_#t~malloc3.base| (_ bv1 1)) |dll_create_#res.base| (_ bv1 1))) (= (select |old(#valid)| |dll_create_#t~malloc3.base|) (_ bv0 1)))))} {2559#(= (bvadd (select |#valid| |main_~#s~0.base|) (_ bv1 1)) (_ bv0 1))} #116#return; {2617#(and (= (bvadd (select |#valid| |main_~#s~0.base|) (_ bv1 1)) (_ bv0 1)) (not (= (_ bv0 32) |main_#t~ret10.base|)) (exists ((|dll_create_#t~malloc3.base| (_ BitVec 32))) (and (not (= |main_~#s~0.base| |dll_create_#t~malloc3.base|)) (= (_ bv1 1) (select |#valid| |dll_create_#t~malloc3.base|)))) (= (_ bv1 1) (select |#valid| |main_#t~ret10.base|)))} is VALID [2018-11-18 22:03:38,008 INFO L273 TraceCheckUtils]: 25: Hoare triple {2617#(and (= (bvadd (select |#valid| |main_~#s~0.base|) (_ bv1 1)) (_ bv0 1)) (not (= (_ bv0 32) |main_#t~ret10.base|)) (exists ((|dll_create_#t~malloc3.base| (_ BitVec 32))) (and (not (= |main_~#s~0.base| |dll_create_#t~malloc3.base|)) (= (_ bv1 1) (select |#valid| |dll_create_#t~malloc3.base|)))) (= (_ bv1 1) (select |#valid| |main_#t~ret10.base|)))} call write~$Pointer$(#t~ret10.base, #t~ret10.offset, ~#s~0.base, ~#s~0.offset, 4bv32);havoc #t~ret10.base, #t~ret10.offset; {2621#(and (= (bvadd (select |#valid| |main_~#s~0.base|) (_ bv1 1)) (_ bv0 1)) (exists ((|dll_create_#t~malloc3.base| (_ BitVec 32))) (and (not (= |main_~#s~0.base| |dll_create_#t~malloc3.base|)) (= (_ bv1 1) (select |#valid| |dll_create_#t~malloc3.base|)))) (not (= (_ bv0 32) (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|))) (= (_ bv1 1) (select |#valid| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|))))} is VALID [2018-11-18 22:03:38,009 INFO L256 TraceCheckUtils]: 26: Hoare triple {2621#(and (= (bvadd (select |#valid| |main_~#s~0.base|) (_ bv1 1)) (_ bv0 1)) (exists ((|dll_create_#t~malloc3.base| (_ BitVec 32))) (and (not (= |main_~#s~0.base| |dll_create_#t~malloc3.base|)) (= (_ bv1 1) (select |#valid| |dll_create_#t~malloc3.base|)))) (not (= (_ bv0 32) (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|))) (= (_ bv1 1) (select |#valid| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|))))} call dll_prepend(~#s~0.base, ~#s~0.offset, ~data~0); {2442#(and (= |#valid| |old(#valid)|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))} is VALID [2018-11-18 22:03:38,009 INFO L273 TraceCheckUtils]: 27: Hoare triple {2442#(and (= |#valid| |old(#valid)|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))} ~head.base, ~head.offset := #in~head.base, #in~head.offset;~data := #in~data; {2446#(and (= |#valid| |old(#valid)|) (= dll_prepend_~head.offset |dll_prepend_#in~head.offset|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|) (= |dll_prepend_#in~head.base| dll_prepend_~head.base))} is VALID [2018-11-18 22:03:38,011 INFO L256 TraceCheckUtils]: 28: Hoare triple {2446#(and (= |#valid| |old(#valid)|) (= dll_prepend_~head.offset |dll_prepend_#in~head.offset|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|) (= |dll_prepend_#in~head.base| dll_prepend_~head.base))} call #t~ret6.base, #t~ret6.offset := node_create(~data); {2442#(and (= |#valid| |old(#valid)|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))} is VALID [2018-11-18 22:03:38,012 INFO L273 TraceCheckUtils]: 29: Hoare triple {2442#(and (= |#valid| |old(#valid)|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))} ~data := #in~data;call #t~malloc2.base, #t~malloc2.offset := #Ultimate.alloc(12bv32);~temp~0.base, ~temp~0.offset := #t~malloc2.base, #t~malloc2.offset; {2453#(and (= node_create_~temp~0.offset (_ bv0 32)) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|) (= (_ bv0 1) (select |old(#valid)| node_create_~temp~0.base)))} is VALID [2018-11-18 22:03:38,013 INFO L273 TraceCheckUtils]: 30: Hoare triple {2453#(and (= node_create_~temp~0.offset (_ bv0 32)) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|) (= (_ bv0 1) (select |old(#valid)| node_create_~temp~0.base)))} assume !(0bv32 == ~temp~0.base && 0bv32 == ~temp~0.offset); {2453#(and (= node_create_~temp~0.offset (_ bv0 32)) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|) (= (_ bv0 1) (select |old(#valid)| node_create_~temp~0.base)))} is VALID [2018-11-18 22:03:38,016 INFO L273 TraceCheckUtils]: 31: Hoare triple {2453#(and (= node_create_~temp~0.offset (_ bv0 32)) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|) (= (_ bv0 1) (select |old(#valid)| node_create_~temp~0.base)))} call write~$Pointer$(0bv32, 0bv32, ~temp~0.base, ~bvadd32(4bv32, ~temp~0.offset), 4bv32);call write~$Pointer$(0bv32, 0bv32, ~temp~0.base, ~bvadd32(8bv32, ~temp~0.offset), 4bv32);call write~intINTTYPE4(~data, ~temp~0.base, ~temp~0.offset, 4bv32);#res.base, #res.offset := ~temp~0.base, ~temp~0.offset; {2460#(and (= (_ bv0 1) (select |old(#valid)| |node_create_#res.base|)) (= |#memory_$Pointer$.base| (store |old(#memory_$Pointer$.base)| |node_create_#res.base| (store (store (select |old(#memory_$Pointer$.base)| |node_create_#res.base|) (bvadd |node_create_#res.offset| (_ bv4 32)) (_ bv0 32)) (bvadd |node_create_#res.offset| (_ bv8 32)) (_ bv0 32)))) (= |node_create_#res.offset| (_ bv0 32)))} is VALID [2018-11-18 22:03:38,017 INFO L273 TraceCheckUtils]: 32: Hoare triple {2460#(and (= (_ bv0 1) (select |old(#valid)| |node_create_#res.base|)) (= |#memory_$Pointer$.base| (store |old(#memory_$Pointer$.base)| |node_create_#res.base| (store (store (select |old(#memory_$Pointer$.base)| |node_create_#res.base|) (bvadd |node_create_#res.offset| (_ bv4 32)) (_ bv0 32)) (bvadd |node_create_#res.offset| (_ bv8 32)) (_ bv0 32)))) (= |node_create_#res.offset| (_ bv0 32)))} assume true; {2460#(and (= (_ bv0 1) (select |old(#valid)| |node_create_#res.base|)) (= |#memory_$Pointer$.base| (store |old(#memory_$Pointer$.base)| |node_create_#res.base| (store (store (select |old(#memory_$Pointer$.base)| |node_create_#res.base|) (bvadd |node_create_#res.offset| (_ bv4 32)) (_ bv0 32)) (bvadd |node_create_#res.offset| (_ bv8 32)) (_ bv0 32)))) (= |node_create_#res.offset| (_ bv0 32)))} is VALID [2018-11-18 22:03:38,019 INFO L268 TraceCheckUtils]: 33: Hoare quadruple {2460#(and (= (_ bv0 1) (select |old(#valid)| |node_create_#res.base|)) (= |#memory_$Pointer$.base| (store |old(#memory_$Pointer$.base)| |node_create_#res.base| (store (store (select |old(#memory_$Pointer$.base)| |node_create_#res.base|) (bvadd |node_create_#res.offset| (_ bv4 32)) (_ bv0 32)) (bvadd |node_create_#res.offset| (_ bv8 32)) (_ bv0 32)))) (= |node_create_#res.offset| (_ bv0 32)))} {2446#(and (= |#valid| |old(#valid)|) (= dll_prepend_~head.offset |dll_prepend_#in~head.offset|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|) (= |dll_prepend_#in~head.base| dll_prepend_~head.base))} #124#return; {2467#(and (= (select |old(#valid)| |dll_prepend_#t~ret6.base|) (_ bv0 1)) (= dll_prepend_~head.offset |dll_prepend_#in~head.offset|) (= |#memory_$Pointer$.base| (store |old(#memory_$Pointer$.base)| |dll_prepend_#t~ret6.base| (store (store (select |old(#memory_$Pointer$.base)| |dll_prepend_#t~ret6.base|) (_ bv4 32) (_ bv0 32)) (_ bv8 32) (_ bv0 32)))) (= |dll_prepend_#t~ret6.offset| (_ bv0 32)) (= |dll_prepend_#in~head.base| dll_prepend_~head.base))} is VALID [2018-11-18 22:03:38,026 INFO L273 TraceCheckUtils]: 34: Hoare triple {2467#(and (= (select |old(#valid)| |dll_prepend_#t~ret6.base|) (_ bv0 1)) (= dll_prepend_~head.offset |dll_prepend_#in~head.offset|) (= |#memory_$Pointer$.base| (store |old(#memory_$Pointer$.base)| |dll_prepend_#t~ret6.base| (store (store (select |old(#memory_$Pointer$.base)| |dll_prepend_#t~ret6.base|) (_ bv4 32) (_ bv0 32)) (_ bv8 32) (_ bv0 32)))) (= |dll_prepend_#t~ret6.offset| (_ bv0 32)) (= |dll_prepend_#in~head.base| dll_prepend_~head.base))} ~new_head~1.base, ~new_head~1.offset := #t~ret6.base, #t~ret6.offset;havoc #t~ret6.base, #t~ret6.offset;call #t~mem7.base, #t~mem7.offset := read~$Pointer$(~head.base, ~head.offset, 4bv32);call write~$Pointer$(#t~mem7.base, #t~mem7.offset, ~new_head~1.base, ~bvadd32(4bv32, ~new_head~1.offset), 4bv32);havoc #t~mem7.base, #t~mem7.offset;call #t~mem8.base, #t~mem8.offset := read~$Pointer$(~head.base, ~head.offset, 4bv32); {2471#(and (= (_ bv0 1) (select |old(#valid)| dll_prepend_~new_head~1.base)) (= dll_prepend_~head.offset |dll_prepend_#in~head.offset|) (= |#memory_$Pointer$.base| (store |old(#memory_$Pointer$.base)| dll_prepend_~new_head~1.base (store (store (store (select |old(#memory_$Pointer$.base)| dll_prepend_~new_head~1.base) (_ bv4 32) (_ bv0 32)) (_ bv8 32) (_ bv0 32)) (bvadd dll_prepend_~new_head~1.offset (_ bv4 32)) (select (select (store |old(#memory_$Pointer$.base)| dll_prepend_~new_head~1.base (store (store (select |old(#memory_$Pointer$.base)| dll_prepend_~new_head~1.base) (_ bv4 32) (_ bv0 32)) (_ bv8 32) (_ bv0 32))) dll_prepend_~head.base) dll_prepend_~head.offset)))) (= (_ bv0 32) dll_prepend_~new_head~1.offset) (= |dll_prepend_#in~head.base| dll_prepend_~head.base))} is VALID [2018-11-18 22:03:38,032 INFO L273 TraceCheckUtils]: 35: Hoare triple {2471#(and (= (_ bv0 1) (select |old(#valid)| dll_prepend_~new_head~1.base)) (= dll_prepend_~head.offset |dll_prepend_#in~head.offset|) (= |#memory_$Pointer$.base| (store |old(#memory_$Pointer$.base)| dll_prepend_~new_head~1.base (store (store (store (select |old(#memory_$Pointer$.base)| dll_prepend_~new_head~1.base) (_ bv4 32) (_ bv0 32)) (_ bv8 32) (_ bv0 32)) (bvadd dll_prepend_~new_head~1.offset (_ bv4 32)) (select (select (store |old(#memory_$Pointer$.base)| dll_prepend_~new_head~1.base (store (store (select |old(#memory_$Pointer$.base)| dll_prepend_~new_head~1.base) (_ bv4 32) (_ bv0 32)) (_ bv8 32) (_ bv0 32))) dll_prepend_~head.base) dll_prepend_~head.offset)))) (= (_ bv0 32) dll_prepend_~new_head~1.offset) (= |dll_prepend_#in~head.base| dll_prepend_~head.base))} assume #t~mem8.base != 0bv32 || #t~mem8.offset != 0bv32;havoc #t~mem8.base, #t~mem8.offset;call #t~mem9.base, #t~mem9.offset := read~$Pointer$(~head.base, ~head.offset, 4bv32);call write~$Pointer$(~new_head~1.base, ~new_head~1.offset, #t~mem9.base, ~bvadd32(8bv32, #t~mem9.offset), 4bv32);havoc #t~mem9.base, #t~mem9.offset; {2475#(and (= (_ bv0 1) (select |old(#valid)| dll_prepend_~new_head~1.base)) (exists ((v_arrayElimCell_11 (_ BitVec 32))) (= (store (store |old(#memory_$Pointer$.base)| dll_prepend_~new_head~1.base (store (store (store (select |old(#memory_$Pointer$.base)| dll_prepend_~new_head~1.base) (_ bv4 32) (_ bv0 32)) (_ bv8 32) (_ bv0 32)) (bvadd dll_prepend_~new_head~1.offset (_ bv4 32)) (select (select (store |old(#memory_$Pointer$.base)| dll_prepend_~new_head~1.base (store (store (select |old(#memory_$Pointer$.base)| dll_prepend_~new_head~1.base) (_ bv4 32) (_ bv0 32)) (_ bv8 32) (_ bv0 32))) dll_prepend_~head.base) dll_prepend_~head.offset))) (select (select (store |old(#memory_$Pointer$.base)| dll_prepend_~new_head~1.base (store (store (store (select |old(#memory_$Pointer$.base)| dll_prepend_~new_head~1.base) (_ bv4 32) (_ bv0 32)) (_ bv8 32) (_ bv0 32)) (bvadd dll_prepend_~new_head~1.offset (_ bv4 32)) (select (select (store |old(#memory_$Pointer$.base)| dll_prepend_~new_head~1.base (store (store (select |old(#memory_$Pointer$.base)| dll_prepend_~new_head~1.base) (_ bv4 32) (_ bv0 32)) (_ bv8 32) (_ bv0 32))) dll_prepend_~head.base) dll_prepend_~head.offset))) dll_prepend_~head.base) dll_prepend_~head.offset) (store (select (store |old(#memory_$Pointer$.base)| dll_prepend_~new_head~1.base (store (store (store (select |old(#memory_$Pointer$.base)| dll_prepend_~new_head~1.base) (_ bv4 32) (_ bv0 32)) (_ bv8 32) (_ bv0 32)) (bvadd dll_prepend_~new_head~1.offset (_ bv4 32)) (select (select (store |old(#memory_$Pointer$.base)| dll_prepend_~new_head~1.base (store (store (select |old(#memory_$Pointer$.base)| dll_prepend_~new_head~1.base) (_ bv4 32) (_ bv0 32)) (_ bv8 32) (_ bv0 32))) dll_prepend_~head.base) dll_prepend_~head.offset))) (select (select (store |old(#memory_$Pointer$.base)| dll_prepend_~new_head~1.base (store (store (store (select |old(#memory_$Pointer$.base)| dll_prepend_~new_head~1.base) (_ bv4 32) (_ bv0 32)) (_ bv8 32) (_ bv0 32)) (bvadd dll_prepend_~new_head~1.offset (_ bv4 32)) (select (select (store |old(#memory_$Pointer$.base)| dll_prepend_~new_head~1.base (store (store (select |old(#memory_$Pointer$.base)| dll_prepend_~new_head~1.base) (_ bv4 32) (_ bv0 32)) (_ bv8 32) (_ bv0 32))) dll_prepend_~head.base) dll_prepend_~head.offset))) dll_prepend_~head.base) dll_prepend_~head.offset)) (bvadd v_arrayElimCell_11 (_ bv8 32)) dll_prepend_~new_head~1.base)) |#memory_$Pointer$.base|)) (= dll_prepend_~head.offset |dll_prepend_#in~head.offset|) (= (_ bv0 32) dll_prepend_~new_head~1.offset) (= |dll_prepend_#in~head.base| dll_prepend_~head.base))} is VALID [2018-11-18 22:03:38,037 INFO L273 TraceCheckUtils]: 36: Hoare triple {2475#(and (= (_ bv0 1) (select |old(#valid)| dll_prepend_~new_head~1.base)) (exists ((v_arrayElimCell_11 (_ BitVec 32))) (= (store (store |old(#memory_$Pointer$.base)| dll_prepend_~new_head~1.base (store (store (store (select |old(#memory_$Pointer$.base)| dll_prepend_~new_head~1.base) (_ bv4 32) (_ bv0 32)) (_ bv8 32) (_ bv0 32)) (bvadd dll_prepend_~new_head~1.offset (_ bv4 32)) (select (select (store |old(#memory_$Pointer$.base)| dll_prepend_~new_head~1.base (store (store (select |old(#memory_$Pointer$.base)| dll_prepend_~new_head~1.base) (_ bv4 32) (_ bv0 32)) (_ bv8 32) (_ bv0 32))) dll_prepend_~head.base) dll_prepend_~head.offset))) (select (select (store |old(#memory_$Pointer$.base)| dll_prepend_~new_head~1.base (store (store (store (select |old(#memory_$Pointer$.base)| dll_prepend_~new_head~1.base) (_ bv4 32) (_ bv0 32)) (_ bv8 32) (_ bv0 32)) (bvadd dll_prepend_~new_head~1.offset (_ bv4 32)) (select (select (store |old(#memory_$Pointer$.base)| dll_prepend_~new_head~1.base (store (store (select |old(#memory_$Pointer$.base)| dll_prepend_~new_head~1.base) (_ bv4 32) (_ bv0 32)) (_ bv8 32) (_ bv0 32))) dll_prepend_~head.base) dll_prepend_~head.offset))) dll_prepend_~head.base) dll_prepend_~head.offset) (store (select (store |old(#memory_$Pointer$.base)| dll_prepend_~new_head~1.base (store (store (store (select |old(#memory_$Pointer$.base)| dll_prepend_~new_head~1.base) (_ bv4 32) (_ bv0 32)) (_ bv8 32) (_ bv0 32)) (bvadd dll_prepend_~new_head~1.offset (_ bv4 32)) (select (select (store |old(#memory_$Pointer$.base)| dll_prepend_~new_head~1.base (store (store (select |old(#memory_$Pointer$.base)| dll_prepend_~new_head~1.base) (_ bv4 32) (_ bv0 32)) (_ bv8 32) (_ bv0 32))) dll_prepend_~head.base) dll_prepend_~head.offset))) (select (select (store |old(#memory_$Pointer$.base)| dll_prepend_~new_head~1.base (store (store (store (select |old(#memory_$Pointer$.base)| dll_prepend_~new_head~1.base) (_ bv4 32) (_ bv0 32)) (_ bv8 32) (_ bv0 32)) (bvadd dll_prepend_~new_head~1.offset (_ bv4 32)) (select (select (store |old(#memory_$Pointer$.base)| dll_prepend_~new_head~1.base (store (store (select |old(#memory_$Pointer$.base)| dll_prepend_~new_head~1.base) (_ bv4 32) (_ bv0 32)) (_ bv8 32) (_ bv0 32))) dll_prepend_~head.base) dll_prepend_~head.offset))) dll_prepend_~head.base) dll_prepend_~head.offset)) (bvadd v_arrayElimCell_11 (_ bv8 32)) dll_prepend_~new_head~1.base)) |#memory_$Pointer$.base|)) (= dll_prepend_~head.offset |dll_prepend_#in~head.offset|) (= (_ bv0 32) dll_prepend_~new_head~1.offset) (= |dll_prepend_#in~head.base| dll_prepend_~head.base))} call write~$Pointer$(~new_head~1.base, ~new_head~1.offset, ~head.base, ~head.offset, 4bv32); {2479#(and (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| |dll_prepend_#in~head.base|) |dll_prepend_#in~head.offset|)) (exists ((v_arrayElimCell_11 (_ BitVec 32)) (dll_prepend_~new_head~1.base (_ BitVec 32))) (and (= (_ bv0 1) (select |old(#valid)| dll_prepend_~new_head~1.base)) (= |#memory_$Pointer$.base| (store (store (store |old(#memory_$Pointer$.base)| dll_prepend_~new_head~1.base (store (store (store (select |old(#memory_$Pointer$.base)| dll_prepend_~new_head~1.base) (_ bv4 32) (_ bv0 32)) (_ bv8 32) (_ bv0 32)) (_ bv4 32) (select (select (store |old(#memory_$Pointer$.base)| dll_prepend_~new_head~1.base (store (store (select |old(#memory_$Pointer$.base)| dll_prepend_~new_head~1.base) (_ bv4 32) (_ bv0 32)) (_ bv8 32) (_ bv0 32))) |dll_prepend_#in~head.base|) |dll_prepend_#in~head.offset|))) (select (select (store |old(#memory_$Pointer$.base)| dll_prepend_~new_head~1.base (store (store (store (select |old(#memory_$Pointer$.base)| dll_prepend_~new_head~1.base) (_ bv4 32) (_ bv0 32)) (_ bv8 32) (_ bv0 32)) (_ bv4 32) (select (select (store |old(#memory_$Pointer$.base)| dll_prepend_~new_head~1.base (store (store (select |old(#memory_$Pointer$.base)| dll_prepend_~new_head~1.base) (_ bv4 32) (_ bv0 32)) (_ bv8 32) (_ bv0 32))) |dll_prepend_#in~head.base|) |dll_prepend_#in~head.offset|))) |dll_prepend_#in~head.base|) |dll_prepend_#in~head.offset|) (store (select (store |old(#memory_$Pointer$.base)| dll_prepend_~new_head~1.base (store (store (store (select |old(#memory_$Pointer$.base)| dll_prepend_~new_head~1.base) (_ bv4 32) (_ bv0 32)) (_ bv8 32) (_ bv0 32)) (_ bv4 32) (select (select (store |old(#memory_$Pointer$.base)| dll_prepend_~new_head~1.base (store (store (select |old(#memory_$Pointer$.base)| dll_prepend_~new_head~1.base) (_ bv4 32) (_ bv0 32)) (_ bv8 32) (_ bv0 32))) |dll_prepend_#in~head.base|) |dll_prepend_#in~head.offset|))) (select (select (store |old(#memory_$Pointer$.base)| dll_prepend_~new_head~1.base (store (store (store (select |old(#memory_$Pointer$.base)| dll_prepend_~new_head~1.base) (_ bv4 32) (_ bv0 32)) (_ bv8 32) (_ bv0 32)) (_ bv4 32) (select (select (store |old(#memory_$Pointer$.base)| dll_prepend_~new_head~1.base (store (store (select |old(#memory_$Pointer$.base)| dll_prepend_~new_head~1.base) (_ bv4 32) (_ bv0 32)) (_ bv8 32) (_ bv0 32))) |dll_prepend_#in~head.base|) |dll_prepend_#in~head.offset|))) |dll_prepend_#in~head.base|) |dll_prepend_#in~head.offset|)) (bvadd v_arrayElimCell_11 (_ bv8 32)) dll_prepend_~new_head~1.base)) |dll_prepend_#in~head.base| (store (select (store (store |old(#memory_$Pointer$.base)| dll_prepend_~new_head~1.base (store (store (store (select |old(#memory_$Pointer$.base)| dll_prepend_~new_head~1.base) (_ bv4 32) (_ bv0 32)) (_ bv8 32) (_ bv0 32)) (_ bv4 32) (select (select (store |old(#memory_$Pointer$.base)| dll_prepend_~new_head~1.base (store (store (select |old(#memory_$Pointer$.base)| dll_prepend_~new_head~1.base) (_ bv4 32) (_ bv0 32)) (_ bv8 32) (_ bv0 32))) |dll_prepend_#in~head.base|) |dll_prepend_#in~head.offset|))) (select (select (store |old(#memory_$Pointer$.base)| dll_prepend_~new_head~1.base (store (store (store (select |old(#memory_$Pointer$.base)| dll_prepend_~new_head~1.base) (_ bv4 32) (_ bv0 32)) (_ bv8 32) (_ bv0 32)) (_ bv4 32) (select (select (store |old(#memory_$Pointer$.base)| dll_prepend_~new_head~1.base (store (store (select |old(#memory_$Pointer$.base)| dll_prepend_~new_head~1.base) (_ bv4 32) (_ bv0 32)) (_ bv8 32) (_ bv0 32))) |dll_prepend_#in~head.base|) |dll_prepend_#in~head.offset|))) |dll_prepend_#in~head.base|) |dll_prepend_#in~head.offset|) (store (select (store |old(#memory_$Pointer$.base)| dll_prepend_~new_head~1.base (store (store (store (select |old(#memory_$Pointer$.base)| dll_prepend_~new_head~1.base) (_ bv4 32) (_ bv0 32)) (_ bv8 32) (_ bv0 32)) (_ bv4 32) (select (select (store |old(#memory_$Pointer$.base)| dll_prepend_~new_head~1.base (store (store (select |old(#memory_$Pointer$.base)| dll_prepend_~new_head~1.base) (_ bv4 32) (_ bv0 32)) (_ bv8 32) (_ bv0 32))) |dll_prepend_#in~head.base|) |dll_prepend_#in~head.offset|))) (select (select (store |old(#memory_$Pointer$.base)| dll_prepend_~new_head~1.base (store (store (store (select |old(#memory_$Pointer$.base)| dll_prepend_~new_head~1.base) (_ bv4 32) (_ bv0 32)) (_ bv8 32) (_ bv0 32)) (_ bv4 32) (select (select (store |old(#memory_$Pointer$.base)| dll_prepend_~new_head~1.base (store (store (select |old(#memory_$Pointer$.base)| dll_prepend_~new_head~1.base) (_ bv4 32) (_ bv0 32)) (_ bv8 32) (_ bv0 32))) |dll_prepend_#in~head.base|) |dll_prepend_#in~head.offset|))) |dll_prepend_#in~head.base|) |dll_prepend_#in~head.offset|)) (bvadd v_arrayElimCell_11 (_ bv8 32)) dll_prepend_~new_head~1.base)) |dll_prepend_#in~head.base|) |dll_prepend_#in~head.offset| dll_prepend_~new_head~1.base))))))} is VALID [2018-11-18 22:03:38,039 INFO L273 TraceCheckUtils]: 37: Hoare triple {2479#(and (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| |dll_prepend_#in~head.base|) |dll_prepend_#in~head.offset|)) (exists ((v_arrayElimCell_11 (_ BitVec 32)) (dll_prepend_~new_head~1.base (_ BitVec 32))) (and (= (_ bv0 1) (select |old(#valid)| dll_prepend_~new_head~1.base)) (= |#memory_$Pointer$.base| (store (store (store |old(#memory_$Pointer$.base)| dll_prepend_~new_head~1.base (store (store (store (select |old(#memory_$Pointer$.base)| dll_prepend_~new_head~1.base) (_ bv4 32) (_ bv0 32)) (_ bv8 32) (_ bv0 32)) (_ bv4 32) (select (select (store |old(#memory_$Pointer$.base)| dll_prepend_~new_head~1.base (store (store (select |old(#memory_$Pointer$.base)| dll_prepend_~new_head~1.base) (_ bv4 32) (_ bv0 32)) (_ bv8 32) (_ bv0 32))) |dll_prepend_#in~head.base|) |dll_prepend_#in~head.offset|))) (select (select (store |old(#memory_$Pointer$.base)| dll_prepend_~new_head~1.base (store (store (store (select |old(#memory_$Pointer$.base)| dll_prepend_~new_head~1.base) (_ bv4 32) (_ bv0 32)) (_ bv8 32) (_ bv0 32)) (_ bv4 32) (select (select (store |old(#memory_$Pointer$.base)| dll_prepend_~new_head~1.base (store (store (select |old(#memory_$Pointer$.base)| dll_prepend_~new_head~1.base) (_ bv4 32) (_ bv0 32)) (_ bv8 32) (_ bv0 32))) |dll_prepend_#in~head.base|) |dll_prepend_#in~head.offset|))) |dll_prepend_#in~head.base|) |dll_prepend_#in~head.offset|) (store (select (store |old(#memory_$Pointer$.base)| dll_prepend_~new_head~1.base (store (store (store (select |old(#memory_$Pointer$.base)| dll_prepend_~new_head~1.base) (_ bv4 32) (_ bv0 32)) (_ bv8 32) (_ bv0 32)) (_ bv4 32) (select (select (store |old(#memory_$Pointer$.base)| dll_prepend_~new_head~1.base (store (store (select |old(#memory_$Pointer$.base)| dll_prepend_~new_head~1.base) (_ bv4 32) (_ bv0 32)) (_ bv8 32) (_ bv0 32))) |dll_prepend_#in~head.base|) |dll_prepend_#in~head.offset|))) (select (select (store |old(#memory_$Pointer$.base)| dll_prepend_~new_head~1.base (store (store (store (select |old(#memory_$Pointer$.base)| dll_prepend_~new_head~1.base) (_ bv4 32) (_ bv0 32)) (_ bv8 32) (_ bv0 32)) (_ bv4 32) (select (select (store |old(#memory_$Pointer$.base)| dll_prepend_~new_head~1.base (store (store (select |old(#memory_$Pointer$.base)| dll_prepend_~new_head~1.base) (_ bv4 32) (_ bv0 32)) (_ bv8 32) (_ bv0 32))) |dll_prepend_#in~head.base|) |dll_prepend_#in~head.offset|))) |dll_prepend_#in~head.base|) |dll_prepend_#in~head.offset|)) (bvadd v_arrayElimCell_11 (_ bv8 32)) dll_prepend_~new_head~1.base)) |dll_prepend_#in~head.base| (store (select (store (store |old(#memory_$Pointer$.base)| dll_prepend_~new_head~1.base (store (store (store (select |old(#memory_$Pointer$.base)| dll_prepend_~new_head~1.base) (_ bv4 32) (_ bv0 32)) (_ bv8 32) (_ bv0 32)) (_ bv4 32) (select (select (store |old(#memory_$Pointer$.base)| dll_prepend_~new_head~1.base (store (store (select |old(#memory_$Pointer$.base)| dll_prepend_~new_head~1.base) (_ bv4 32) (_ bv0 32)) (_ bv8 32) (_ bv0 32))) |dll_prepend_#in~head.base|) |dll_prepend_#in~head.offset|))) (select (select (store |old(#memory_$Pointer$.base)| dll_prepend_~new_head~1.base (store (store (store (select |old(#memory_$Pointer$.base)| dll_prepend_~new_head~1.base) (_ bv4 32) (_ bv0 32)) (_ bv8 32) (_ bv0 32)) (_ bv4 32) (select (select (store |old(#memory_$Pointer$.base)| dll_prepend_~new_head~1.base (store (store (select |old(#memory_$Pointer$.base)| dll_prepend_~new_head~1.base) (_ bv4 32) (_ bv0 32)) (_ bv8 32) (_ bv0 32))) |dll_prepend_#in~head.base|) |dll_prepend_#in~head.offset|))) |dll_prepend_#in~head.base|) |dll_prepend_#in~head.offset|) (store (select (store |old(#memory_$Pointer$.base)| dll_prepend_~new_head~1.base (store (store (store (select |old(#memory_$Pointer$.base)| dll_prepend_~new_head~1.base) (_ bv4 32) (_ bv0 32)) (_ bv8 32) (_ bv0 32)) (_ bv4 32) (select (select (store |old(#memory_$Pointer$.base)| dll_prepend_~new_head~1.base (store (store (select |old(#memory_$Pointer$.base)| dll_prepend_~new_head~1.base) (_ bv4 32) (_ bv0 32)) (_ bv8 32) (_ bv0 32))) |dll_prepend_#in~head.base|) |dll_prepend_#in~head.offset|))) (select (select (store |old(#memory_$Pointer$.base)| dll_prepend_~new_head~1.base (store (store (store (select |old(#memory_$Pointer$.base)| dll_prepend_~new_head~1.base) (_ bv4 32) (_ bv0 32)) (_ bv8 32) (_ bv0 32)) (_ bv4 32) (select (select (store |old(#memory_$Pointer$.base)| dll_prepend_~new_head~1.base (store (store (select |old(#memory_$Pointer$.base)| dll_prepend_~new_head~1.base) (_ bv4 32) (_ bv0 32)) (_ bv8 32) (_ bv0 32))) |dll_prepend_#in~head.base|) |dll_prepend_#in~head.offset|))) |dll_prepend_#in~head.base|) |dll_prepend_#in~head.offset|)) (bvadd v_arrayElimCell_11 (_ bv8 32)) dll_prepend_~new_head~1.base)) |dll_prepend_#in~head.base|) |dll_prepend_#in~head.offset| dll_prepend_~new_head~1.base))))))} assume true; {2479#(and (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| |dll_prepend_#in~head.base|) |dll_prepend_#in~head.offset|)) (exists ((v_arrayElimCell_11 (_ BitVec 32)) (dll_prepend_~new_head~1.base (_ BitVec 32))) (and (= (_ bv0 1) (select |old(#valid)| dll_prepend_~new_head~1.base)) (= |#memory_$Pointer$.base| (store (store (store |old(#memory_$Pointer$.base)| dll_prepend_~new_head~1.base (store (store (store (select |old(#memory_$Pointer$.base)| dll_prepend_~new_head~1.base) (_ bv4 32) (_ bv0 32)) (_ bv8 32) (_ bv0 32)) (_ bv4 32) (select (select (store |old(#memory_$Pointer$.base)| dll_prepend_~new_head~1.base (store (store (select |old(#memory_$Pointer$.base)| dll_prepend_~new_head~1.base) (_ bv4 32) (_ bv0 32)) (_ bv8 32) (_ bv0 32))) |dll_prepend_#in~head.base|) |dll_prepend_#in~head.offset|))) (select (select (store |old(#memory_$Pointer$.base)| dll_prepend_~new_head~1.base (store (store (store (select |old(#memory_$Pointer$.base)| dll_prepend_~new_head~1.base) (_ bv4 32) (_ bv0 32)) (_ bv8 32) (_ bv0 32)) (_ bv4 32) (select (select (store |old(#memory_$Pointer$.base)| dll_prepend_~new_head~1.base (store (store (select |old(#memory_$Pointer$.base)| dll_prepend_~new_head~1.base) (_ bv4 32) (_ bv0 32)) (_ bv8 32) (_ bv0 32))) |dll_prepend_#in~head.base|) |dll_prepend_#in~head.offset|))) |dll_prepend_#in~head.base|) |dll_prepend_#in~head.offset|) (store (select (store |old(#memory_$Pointer$.base)| dll_prepend_~new_head~1.base (store (store (store (select |old(#memory_$Pointer$.base)| dll_prepend_~new_head~1.base) (_ bv4 32) (_ bv0 32)) (_ bv8 32) (_ bv0 32)) (_ bv4 32) (select (select (store |old(#memory_$Pointer$.base)| dll_prepend_~new_head~1.base (store (store (select |old(#memory_$Pointer$.base)| dll_prepend_~new_head~1.base) (_ bv4 32) (_ bv0 32)) (_ bv8 32) (_ bv0 32))) |dll_prepend_#in~head.base|) |dll_prepend_#in~head.offset|))) (select (select (store |old(#memory_$Pointer$.base)| dll_prepend_~new_head~1.base (store (store (store (select |old(#memory_$Pointer$.base)| dll_prepend_~new_head~1.base) (_ bv4 32) (_ bv0 32)) (_ bv8 32) (_ bv0 32)) (_ bv4 32) (select (select (store |old(#memory_$Pointer$.base)| dll_prepend_~new_head~1.base (store (store (select |old(#memory_$Pointer$.base)| dll_prepend_~new_head~1.base) (_ bv4 32) (_ bv0 32)) (_ bv8 32) (_ bv0 32))) |dll_prepend_#in~head.base|) |dll_prepend_#in~head.offset|))) |dll_prepend_#in~head.base|) |dll_prepend_#in~head.offset|)) (bvadd v_arrayElimCell_11 (_ bv8 32)) dll_prepend_~new_head~1.base)) |dll_prepend_#in~head.base| (store (select (store (store |old(#memory_$Pointer$.base)| dll_prepend_~new_head~1.base (store (store (store (select |old(#memory_$Pointer$.base)| dll_prepend_~new_head~1.base) (_ bv4 32) (_ bv0 32)) (_ bv8 32) (_ bv0 32)) (_ bv4 32) (select (select (store |old(#memory_$Pointer$.base)| dll_prepend_~new_head~1.base (store (store (select |old(#memory_$Pointer$.base)| dll_prepend_~new_head~1.base) (_ bv4 32) (_ bv0 32)) (_ bv8 32) (_ bv0 32))) |dll_prepend_#in~head.base|) |dll_prepend_#in~head.offset|))) (select (select (store |old(#memory_$Pointer$.base)| dll_prepend_~new_head~1.base (store (store (store (select |old(#memory_$Pointer$.base)| dll_prepend_~new_head~1.base) (_ bv4 32) (_ bv0 32)) (_ bv8 32) (_ bv0 32)) (_ bv4 32) (select (select (store |old(#memory_$Pointer$.base)| dll_prepend_~new_head~1.base (store (store (select |old(#memory_$Pointer$.base)| dll_prepend_~new_head~1.base) (_ bv4 32) (_ bv0 32)) (_ bv8 32) (_ bv0 32))) |dll_prepend_#in~head.base|) |dll_prepend_#in~head.offset|))) |dll_prepend_#in~head.base|) |dll_prepend_#in~head.offset|) (store (select (store |old(#memory_$Pointer$.base)| dll_prepend_~new_head~1.base (store (store (store (select |old(#memory_$Pointer$.base)| dll_prepend_~new_head~1.base) (_ bv4 32) (_ bv0 32)) (_ bv8 32) (_ bv0 32)) (_ bv4 32) (select (select (store |old(#memory_$Pointer$.base)| dll_prepend_~new_head~1.base (store (store (select |old(#memory_$Pointer$.base)| dll_prepend_~new_head~1.base) (_ bv4 32) (_ bv0 32)) (_ bv8 32) (_ bv0 32))) |dll_prepend_#in~head.base|) |dll_prepend_#in~head.offset|))) (select (select (store |old(#memory_$Pointer$.base)| dll_prepend_~new_head~1.base (store (store (store (select |old(#memory_$Pointer$.base)| dll_prepend_~new_head~1.base) (_ bv4 32) (_ bv0 32)) (_ bv8 32) (_ bv0 32)) (_ bv4 32) (select (select (store |old(#memory_$Pointer$.base)| dll_prepend_~new_head~1.base (store (store (select |old(#memory_$Pointer$.base)| dll_prepend_~new_head~1.base) (_ bv4 32) (_ bv0 32)) (_ bv8 32) (_ bv0 32))) |dll_prepend_#in~head.base|) |dll_prepend_#in~head.offset|))) |dll_prepend_#in~head.base|) |dll_prepend_#in~head.offset|)) (bvadd v_arrayElimCell_11 (_ bv8 32)) dll_prepend_~new_head~1.base)) |dll_prepend_#in~head.base|) |dll_prepend_#in~head.offset| dll_prepend_~new_head~1.base))))))} is VALID [2018-11-18 22:03:38,047 INFO L268 TraceCheckUtils]: 38: Hoare quadruple {2479#(and (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| |dll_prepend_#in~head.base|) |dll_prepend_#in~head.offset|)) (exists ((v_arrayElimCell_11 (_ BitVec 32)) (dll_prepend_~new_head~1.base (_ BitVec 32))) (and (= (_ bv0 1) (select |old(#valid)| dll_prepend_~new_head~1.base)) (= |#memory_$Pointer$.base| (store (store (store |old(#memory_$Pointer$.base)| dll_prepend_~new_head~1.base (store (store (store (select |old(#memory_$Pointer$.base)| dll_prepend_~new_head~1.base) (_ bv4 32) (_ bv0 32)) (_ bv8 32) (_ bv0 32)) (_ bv4 32) (select (select (store |old(#memory_$Pointer$.base)| dll_prepend_~new_head~1.base (store (store (select |old(#memory_$Pointer$.base)| dll_prepend_~new_head~1.base) (_ bv4 32) (_ bv0 32)) (_ bv8 32) (_ bv0 32))) |dll_prepend_#in~head.base|) |dll_prepend_#in~head.offset|))) (select (select (store |old(#memory_$Pointer$.base)| dll_prepend_~new_head~1.base (store (store (store (select |old(#memory_$Pointer$.base)| dll_prepend_~new_head~1.base) (_ bv4 32) (_ bv0 32)) (_ bv8 32) (_ bv0 32)) (_ bv4 32) (select (select (store |old(#memory_$Pointer$.base)| dll_prepend_~new_head~1.base (store (store (select |old(#memory_$Pointer$.base)| dll_prepend_~new_head~1.base) (_ bv4 32) (_ bv0 32)) (_ bv8 32) (_ bv0 32))) |dll_prepend_#in~head.base|) |dll_prepend_#in~head.offset|))) |dll_prepend_#in~head.base|) |dll_prepend_#in~head.offset|) (store (select (store |old(#memory_$Pointer$.base)| dll_prepend_~new_head~1.base (store (store (store (select |old(#memory_$Pointer$.base)| dll_prepend_~new_head~1.base) (_ bv4 32) (_ bv0 32)) (_ bv8 32) (_ bv0 32)) (_ bv4 32) (select (select (store |old(#memory_$Pointer$.base)| dll_prepend_~new_head~1.base (store (store (select |old(#memory_$Pointer$.base)| dll_prepend_~new_head~1.base) (_ bv4 32) (_ bv0 32)) (_ bv8 32) (_ bv0 32))) |dll_prepend_#in~head.base|) |dll_prepend_#in~head.offset|))) (select (select (store |old(#memory_$Pointer$.base)| dll_prepend_~new_head~1.base (store (store (store (select |old(#memory_$Pointer$.base)| dll_prepend_~new_head~1.base) (_ bv4 32) (_ bv0 32)) (_ bv8 32) (_ bv0 32)) (_ bv4 32) (select (select (store |old(#memory_$Pointer$.base)| dll_prepend_~new_head~1.base (store (store (select |old(#memory_$Pointer$.base)| dll_prepend_~new_head~1.base) (_ bv4 32) (_ bv0 32)) (_ bv8 32) (_ bv0 32))) |dll_prepend_#in~head.base|) |dll_prepend_#in~head.offset|))) |dll_prepend_#in~head.base|) |dll_prepend_#in~head.offset|)) (bvadd v_arrayElimCell_11 (_ bv8 32)) dll_prepend_~new_head~1.base)) |dll_prepend_#in~head.base| (store (select (store (store |old(#memory_$Pointer$.base)| dll_prepend_~new_head~1.base (store (store (store (select |old(#memory_$Pointer$.base)| dll_prepend_~new_head~1.base) (_ bv4 32) (_ bv0 32)) (_ bv8 32) (_ bv0 32)) (_ bv4 32) (select (select (store |old(#memory_$Pointer$.base)| dll_prepend_~new_head~1.base (store (store (select |old(#memory_$Pointer$.base)| dll_prepend_~new_head~1.base) (_ bv4 32) (_ bv0 32)) (_ bv8 32) (_ bv0 32))) |dll_prepend_#in~head.base|) |dll_prepend_#in~head.offset|))) (select (select (store |old(#memory_$Pointer$.base)| dll_prepend_~new_head~1.base (store (store (store (select |old(#memory_$Pointer$.base)| dll_prepend_~new_head~1.base) (_ bv4 32) (_ bv0 32)) (_ bv8 32) (_ bv0 32)) (_ bv4 32) (select (select (store |old(#memory_$Pointer$.base)| dll_prepend_~new_head~1.base (store (store (select |old(#memory_$Pointer$.base)| dll_prepend_~new_head~1.base) (_ bv4 32) (_ bv0 32)) (_ bv8 32) (_ bv0 32))) |dll_prepend_#in~head.base|) |dll_prepend_#in~head.offset|))) |dll_prepend_#in~head.base|) |dll_prepend_#in~head.offset|) (store (select (store |old(#memory_$Pointer$.base)| dll_prepend_~new_head~1.base (store (store (store (select |old(#memory_$Pointer$.base)| dll_prepend_~new_head~1.base) (_ bv4 32) (_ bv0 32)) (_ bv8 32) (_ bv0 32)) (_ bv4 32) (select (select (store |old(#memory_$Pointer$.base)| dll_prepend_~new_head~1.base (store (store (select |old(#memory_$Pointer$.base)| dll_prepend_~new_head~1.base) (_ bv4 32) (_ bv0 32)) (_ bv8 32) (_ bv0 32))) |dll_prepend_#in~head.base|) |dll_prepend_#in~head.offset|))) (select (select (store |old(#memory_$Pointer$.base)| dll_prepend_~new_head~1.base (store (store (store (select |old(#memory_$Pointer$.base)| dll_prepend_~new_head~1.base) (_ bv4 32) (_ bv0 32)) (_ bv8 32) (_ bv0 32)) (_ bv4 32) (select (select (store |old(#memory_$Pointer$.base)| dll_prepend_~new_head~1.base (store (store (select |old(#memory_$Pointer$.base)| dll_prepend_~new_head~1.base) (_ bv4 32) (_ bv0 32)) (_ bv8 32) (_ bv0 32))) |dll_prepend_#in~head.base|) |dll_prepend_#in~head.offset|))) |dll_prepend_#in~head.base|) |dll_prepend_#in~head.offset|)) (bvadd v_arrayElimCell_11 (_ bv8 32)) dll_prepend_~new_head~1.base)) |dll_prepend_#in~head.base|) |dll_prepend_#in~head.offset| dll_prepend_~new_head~1.base))))))} {2621#(and (= (bvadd (select |#valid| |main_~#s~0.base|) (_ bv1 1)) (_ bv0 1)) (exists ((|dll_create_#t~malloc3.base| (_ BitVec 32))) (and (not (= |main_~#s~0.base| |dll_create_#t~malloc3.base|)) (= (_ bv1 1) (select |#valid| |dll_create_#t~malloc3.base|)))) (not (= (_ bv0 32) (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|))) (= (_ bv1 1) (select |#valid| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|))))} #118#return; {2661#(and (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) (_ bv4 32)) (_ bv0 32))) (= (select (select |#memory_$Pointer$.offset| |main_~#s~0.base|) |main_~#s~0.offset|) (_ bv0 32)) (exists ((v_arrayElimCell_11 (_ BitVec 32))) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) (_ bv4 32))) (bvadd v_arrayElimCell_11 (_ bv8 32))) (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|))) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) (_ bv8 32)) (_ bv0 32)) (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) (_ bv4 32)) (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|))) (not (= |main_~#s~0.base| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|))))} is VALID [2018-11-18 22:03:38,050 INFO L273 TraceCheckUtils]: 39: Hoare triple {2661#(and (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) (_ bv4 32)) (_ bv0 32))) (= (select (select |#memory_$Pointer$.offset| |main_~#s~0.base|) |main_~#s~0.offset|) (_ bv0 32)) (exists ((v_arrayElimCell_11 (_ BitVec 32))) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) (_ bv4 32))) (bvadd v_arrayElimCell_11 (_ bv8 32))) (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|))) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) (_ bv8 32)) (_ bv0 32)) (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) (_ bv4 32)) (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|))) (not (= |main_~#s~0.base| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|))))} call #t~mem11.base, #t~mem11.offset := read~$Pointer$(~#s~0.base, ~#s~0.offset, 4bv32);~ptr~0.base, ~ptr~0.offset := #t~mem11.base, #t~mem11.offset;havoc #t~mem11.base, #t~mem11.offset;~count~0 := 0bv32; {2665#(and (exists ((|main_~#s~0.offset| (_ BitVec 32)) (v_arrayElimCell_11 (_ BitVec 32)) (|main_~#s~0.base| (_ BitVec 32))) (and (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) (_ bv4 32)) (_ bv0 32))) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) (_ bv4 32))) (bvadd v_arrayElimCell_11 (_ bv8 32))) (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) (= main_~ptr~0.base (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) (_ bv8 32)) (_ bv0 32)) (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) (_ bv4 32)) (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|))) (not (= |main_~#s~0.base| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|))))) (= main_~ptr~0.offset (_ bv0 32)))} is VALID [2018-11-18 22:03:38,051 INFO L273 TraceCheckUtils]: 40: Hoare triple {2665#(and (exists ((|main_~#s~0.offset| (_ BitVec 32)) (v_arrayElimCell_11 (_ BitVec 32)) (|main_~#s~0.base| (_ BitVec 32))) (and (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) (_ bv4 32)) (_ bv0 32))) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) (_ bv4 32))) (bvadd v_arrayElimCell_11 (_ bv8 32))) (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) (= main_~ptr~0.base (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) (_ bv8 32)) (_ bv0 32)) (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) (_ bv4 32)) (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|))) (not (= |main_~#s~0.base| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|))))) (= main_~ptr~0.offset (_ bv0 32)))} assume true; {2665#(and (exists ((|main_~#s~0.offset| (_ BitVec 32)) (v_arrayElimCell_11 (_ BitVec 32)) (|main_~#s~0.base| (_ BitVec 32))) (and (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) (_ bv4 32)) (_ bv0 32))) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) (_ bv4 32))) (bvadd v_arrayElimCell_11 (_ bv8 32))) (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) (= main_~ptr~0.base (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) (_ bv8 32)) (_ bv0 32)) (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) (_ bv4 32)) (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|))) (not (= |main_~#s~0.base| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|))))) (= main_~ptr~0.offset (_ bv0 32)))} is VALID [2018-11-18 22:03:38,054 INFO L273 TraceCheckUtils]: 41: Hoare triple {2665#(and (exists ((|main_~#s~0.offset| (_ BitVec 32)) (v_arrayElimCell_11 (_ BitVec 32)) (|main_~#s~0.base| (_ BitVec 32))) (and (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) (_ bv4 32)) (_ bv0 32))) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) (_ bv4 32))) (bvadd v_arrayElimCell_11 (_ bv8 32))) (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) (= main_~ptr~0.base (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) (_ bv8 32)) (_ bv0 32)) (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) (_ bv4 32)) (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|))) (not (= |main_~#s~0.base| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|))))) (= main_~ptr~0.offset (_ bv0 32)))} assume !!(~ptr~0.base != 0bv32 || ~ptr~0.offset != 0bv32);call #t~mem12.base, #t~mem12.offset := read~$Pointer$(~ptr~0.base, ~bvadd32(4bv32, ~ptr~0.offset), 4bv32);~temp~2.base, ~temp~2.offset := #t~mem12.base, #t~mem12.offset;havoc #t~mem12.base, #t~mem12.offset;call #t~mem13 := read~intINTTYPE4(~ptr~0.base, ~ptr~0.offset, 4bv32); {2497#(not (= main_~temp~2.base (_ bv0 32)))} is VALID [2018-11-18 22:03:38,055 INFO L273 TraceCheckUtils]: 42: Hoare triple {2497#(not (= main_~temp~2.base (_ bv0 32)))} assume !(~data~0 != #t~mem13);havoc #t~mem13;~ptr~0.base, ~ptr~0.offset := ~temp~2.base, ~temp~2.offset;#t~post14 := ~count~0;~count~0 := ~bvadd32(1bv32, #t~post14);havoc #t~post14; {2501#(not (= (_ bv0 32) main_~ptr~0.base))} is VALID [2018-11-18 22:03:38,056 INFO L273 TraceCheckUtils]: 43: Hoare triple {2501#(not (= (_ bv0 32) main_~ptr~0.base))} assume true; {2501#(not (= (_ bv0 32) main_~ptr~0.base))} is VALID [2018-11-18 22:03:38,056 INFO L273 TraceCheckUtils]: 44: Hoare triple {2501#(not (= (_ bv0 32) main_~ptr~0.base))} assume !(~ptr~0.base != 0bv32 || ~ptr~0.offset != 0bv32); {2352#false} is VALID [2018-11-18 22:03:38,056 INFO L273 TraceCheckUtils]: 45: Hoare triple {2352#false} assume ~count~0 != ~bvadd32(1bv32, ~len~0); {2352#false} is VALID [2018-11-18 22:03:38,056 INFO L273 TraceCheckUtils]: 46: Hoare triple {2352#false} assume !false; {2352#false} is VALID [2018-11-18 22:03:38,066 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 8 not checked. [2018-11-18 22:03:38,066 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-18 22:03:39,893 WARN L180 SmtUtils]: Spent 1.56 s on a formula simplification that was a NOOP. DAG size: 76 [2018-11-18 22:03:40,454 WARN L180 SmtUtils]: Spent 555.00 ms on a formula simplification that was a NOOP. DAG size: 48 [2018-11-18 22:03:41,215 WARN L180 SmtUtils]: Spent 758.00 ms on a formula simplification that was a NOOP. DAG size: 60 [2018-11-18 22:03:42,118 WARN L180 SmtUtils]: Spent 901.00 ms on a formula simplification that was a NOOP. DAG size: 56 [2018-11-18 22:03:42,614 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 292 treesize of output 288 [2018-11-18 22:03:42,636 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 288 treesize of output 284 [2018-11-18 22:03:42,638 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-18 22:03:42,664 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-18 22:03:42,740 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-11-18 22:03:42,741 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:299, output treesize:291 [2018-11-18 22:03:47,218 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-18 22:03:47,219 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 22] total 27 [2018-11-18 22:03:47,219 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 47 [2018-11-18 22:03:47,220 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-18 22:03:47,220 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 27 states. [2018-11-18 22:03:47,434 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 56 edges. 56 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 22:03:47,434 INFO L459 AbstractCegarLoop]: Interpolant automaton has 27 states [2018-11-18 22:03:47,434 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2018-11-18 22:03:47,435 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=77, Invalid=724, Unknown=15, NotChecked=54, Total=870 [2018-11-18 22:03:47,435 INFO L87 Difference]: Start difference. First operand 49 states and 53 transitions. Second operand 27 states. [2018-11-18 22:04:11,107 WARN L180 SmtUtils]: Spent 3.46 s on a formula simplification that was a NOOP. DAG size: 20 [2018-11-18 22:04:20,427 WARN L854 $PredicateComparison]: unable to prove that (and (exists ((|dll_create_#t~malloc3.base| (_ BitVec 32))) (and (= |c_#valid| (store |c_old(#valid)| |dll_create_#t~malloc3.base| (_ bv1 1))) (= (select |c_old(#valid)| |dll_create_#t~malloc3.base|) (_ bv0 1)))) (exists ((|dll_create_#t~malloc3.base| (_ BitVec 32))) (and (= |c_#valid| (store (store |c_old(#valid)| |dll_create_#t~malloc3.base| (_ bv1 1)) c_dll_create_~head~0.base (_ bv1 1))) (= (select |c_old(#valid)| |dll_create_#t~malloc3.base|) (_ bv0 1)))) (not (= c_dll_create_~new_head~0.base (_ bv0 32))) (exists ((|dll_create_#t~malloc3.base| (_ BitVec 32))) (and (= |c_#valid| (store (store |c_old(#valid)| |dll_create_#t~malloc3.base| (_ bv1 1)) c_dll_create_~new_head~0.base (_ bv1 1))) (= (select |c_old(#valid)| |dll_create_#t~malloc3.base|) (_ bv0 1)))) (not (= (_ bv0 32) c_dll_create_~head~0.base))) is different from true [2018-11-18 22:04:37,648 WARN L180 SmtUtils]: Spent 3.78 s on a formula simplification that was a NOOP. DAG size: 20 [2018-11-18 22:05:03,715 WARN L180 SmtUtils]: Spent 4.02 s on a formula simplification that was a NOOP. DAG size: 24 [2018-11-18 22:05:30,653 WARN L180 SmtUtils]: Spent 6.04 s on a formula simplification that was a NOOP. DAG size: 31