./Ultimate.py --spec ../sv-benchmarks/c/properties/no-overflow.prp --file ../sv-benchmarks/c/uthash-2.0.2/uthash_JEN_test6-1.i --full-output -ea --architecture 32bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version 03d7b7b3 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -ea -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/uthash-2.0.2/uthash_JEN_test6-1.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! overflow) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 3012c2825f53c0db53d950c12df6540de859b34b2bef033c36a98846352dedd3 --- Real Ultimate output --- This is Ultimate 0.2.2-dev-03d7b7b [2022-02-21 03:16:39,139 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-02-21 03:16:39,149 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-02-21 03:16:39,168 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-02-21 03:16:39,174 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-02-21 03:16:39,175 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-02-21 03:16:39,176 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-02-21 03:16:39,177 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-02-21 03:16:39,178 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-02-21 03:16:39,181 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-02-21 03:16:39,182 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-02-21 03:16:39,183 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-02-21 03:16:39,184 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-02-21 03:16:39,184 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-02-21 03:16:39,186 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-02-21 03:16:39,188 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-02-21 03:16:39,189 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-02-21 03:16:39,190 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-02-21 03:16:39,191 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-02-21 03:16:39,194 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-02-21 03:16:39,197 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-02-21 03:16:39,200 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-02-21 03:16:39,201 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-02-21 03:16:39,202 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-02-21 03:16:39,203 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-02-21 03:16:39,208 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-02-21 03:16:39,209 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-02-21 03:16:39,209 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-02-21 03:16:39,210 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-02-21 03:16:39,210 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-02-21 03:16:39,211 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-02-21 03:16:39,211 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-02-21 03:16:39,212 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-02-21 03:16:39,212 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-02-21 03:16:39,213 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-02-21 03:16:39,213 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-02-21 03:16:39,213 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-02-21 03:16:39,214 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-02-21 03:16:39,214 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-02-21 03:16:39,215 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-02-21 03:16:39,215 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-02-21 03:16:39,216 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf [2022-02-21 03:16:39,245 INFO L113 SettingsManager]: Loading preferences was successful [2022-02-21 03:16:39,246 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-02-21 03:16:39,247 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-02-21 03:16:39,247 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-02-21 03:16:39,248 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-02-21 03:16:39,248 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-02-21 03:16:39,248 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-02-21 03:16:39,248 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-02-21 03:16:39,248 INFO L138 SettingsManager]: * Use SBE=true [2022-02-21 03:16:39,249 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-02-21 03:16:39,249 INFO L138 SettingsManager]: * sizeof long=4 [2022-02-21 03:16:39,250 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-02-21 03:16:39,250 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-02-21 03:16:39,250 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-02-21 03:16:39,250 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-02-21 03:16:39,250 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-02-21 03:16:39,250 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-02-21 03:16:39,250 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-02-21 03:16:39,251 INFO L138 SettingsManager]: * Check absence of signed integer overflows=true [2022-02-21 03:16:39,251 INFO L138 SettingsManager]: * sizeof long double=12 [2022-02-21 03:16:39,251 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-02-21 03:16:39,251 INFO L138 SettingsManager]: * Use constant arrays=true [2022-02-21 03:16:39,251 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-02-21 03:16:39,251 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-02-21 03:16:39,251 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-02-21 03:16:39,252 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-02-21 03:16:39,252 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-21 03:16:39,253 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-02-21 03:16:39,253 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-02-21 03:16:39,253 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-02-21 03:16:39,253 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-02-21 03:16:39,253 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-02-21 03:16:39,254 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-02-21 03:16:39,254 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! overflow) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 3012c2825f53c0db53d950c12df6540de859b34b2bef033c36a98846352dedd3 [2022-02-21 03:16:39,442 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-02-21 03:16:39,469 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-02-21 03:16:39,471 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-02-21 03:16:39,472 INFO L271 PluginConnector]: Initializing CDTParser... [2022-02-21 03:16:39,473 INFO L275 PluginConnector]: CDTParser initialized [2022-02-21 03:16:39,473 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/uthash-2.0.2/uthash_JEN_test6-1.i [2022-02-21 03:16:39,532 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/912d3d693/056cde8409e747b78eb05e7c569b5cca/FLAG936afea58 [2022-02-21 03:16:40,006 INFO L306 CDTParser]: Found 1 translation units. [2022-02-21 03:16:40,010 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_JEN_test6-1.i [2022-02-21 03:16:40,035 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/912d3d693/056cde8409e747b78eb05e7c569b5cca/FLAG936afea58 [2022-02-21 03:16:40,048 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/912d3d693/056cde8409e747b78eb05e7c569b5cca [2022-02-21 03:16:40,050 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-02-21 03:16:40,052 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-02-21 03:16:40,054 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-02-21 03:16:40,054 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-02-21 03:16:40,057 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-02-21 03:16:40,057 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.02 03:16:40" (1/1) ... [2022-02-21 03:16:40,058 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7c6d99eb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:16:40, skipping insertion in model container [2022-02-21 03:16:40,058 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.02 03:16:40" (1/1) ... [2022-02-21 03:16:40,062 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-02-21 03:16:40,106 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-21 03:16:40,465 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_JEN_test6-1.i[44118,44131] [2022-02-21 03:16:40,475 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_JEN_test6-1.i[44660,44673] [2022-02-21 03:16:40,562 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_JEN_test6-1.i[56247,56260] [2022-02-21 03:16:40,570 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_JEN_test6-1.i[56368,56381] [2022-02-21 03:16:40,582 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-21 03:16:40,590 INFO L203 MainTranslator]: Completed pre-run [2022-02-21 03:16:40,625 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_JEN_test6-1.i[44118,44131] [2022-02-21 03:16:40,628 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_JEN_test6-1.i[44660,44673] [2022-02-21 03:16:40,692 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_JEN_test6-1.i[56247,56260] [2022-02-21 03:16:40,697 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_JEN_test6-1.i[56368,56381] [2022-02-21 03:16:40,701 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-21 03:16:40,754 INFO L208 MainTranslator]: Completed translation [2022-02-21 03:16:40,754 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:16:40 WrapperNode [2022-02-21 03:16:40,754 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-02-21 03:16:40,755 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-02-21 03:16:40,755 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-02-21 03:16:40,755 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-02-21 03:16:40,760 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:16:40" (1/1) ... [2022-02-21 03:16:40,793 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:16:40" (1/1) ... [2022-02-21 03:16:40,868 INFO L137 Inliner]: procedures = 282, calls = 294, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 1050 [2022-02-21 03:16:40,872 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-02-21 03:16:40,873 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-02-21 03:16:40,873 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-02-21 03:16:40,874 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-02-21 03:16:40,879 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:16:40" (1/1) ... [2022-02-21 03:16:40,880 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:16:40" (1/1) ... [2022-02-21 03:16:40,887 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:16:40" (1/1) ... [2022-02-21 03:16:40,888 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:16:40" (1/1) ... [2022-02-21 03:16:40,919 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:16:40" (1/1) ... [2022-02-21 03:16:40,926 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:16:40" (1/1) ... [2022-02-21 03:16:40,930 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:16:40" (1/1) ... [2022-02-21 03:16:40,936 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-02-21 03:16:40,936 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-02-21 03:16:40,937 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-02-21 03:16:40,937 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-02-21 03:16:40,939 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:16:40" (1/1) ... [2022-02-21 03:16:40,956 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-21 03:16:40,965 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:16:40,981 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-02-21 03:16:40,988 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-02-21 03:16:41,011 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-02-21 03:16:41,012 INFO L130 BoogieDeclarations]: Found specification of procedure memcmp [2022-02-21 03:16:41,012 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-02-21 03:16:41,012 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-02-21 03:16:41,012 INFO L130 BoogieDeclarations]: Found specification of procedure alt_bzero [2022-02-21 03:16:41,012 INFO L138 BoogieDeclarations]: Found implementation of procedure alt_bzero [2022-02-21 03:16:41,012 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-02-21 03:16:41,013 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-02-21 03:16:41,013 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-02-21 03:16:41,013 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-02-21 03:16:41,013 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-02-21 03:16:41,013 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-02-21 03:16:41,013 INFO L130 BoogieDeclarations]: Found specification of procedure alt_malloc [2022-02-21 03:16:41,013 INFO L138 BoogieDeclarations]: Found implementation of procedure alt_malloc [2022-02-21 03:16:41,013 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-02-21 03:16:41,013 INFO L130 BoogieDeclarations]: Found specification of procedure alt_free [2022-02-21 03:16:41,014 INFO L138 BoogieDeclarations]: Found implementation of procedure alt_free [2022-02-21 03:16:41,014 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-02-21 03:16:41,014 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-02-21 03:16:41,014 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-02-21 03:16:41,197 INFO L234 CfgBuilder]: Building ICFG [2022-02-21 03:16:41,198 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-02-21 03:16:42,746 INFO L275 CfgBuilder]: Performing block encoding [2022-02-21 03:16:42,753 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-02-21 03:16:42,753 INFO L299 CfgBuilder]: Removed 63 assume(true) statements. [2022-02-21 03:16:42,755 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.02 03:16:42 BoogieIcfgContainer [2022-02-21 03:16:42,755 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-02-21 03:16:42,756 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-02-21 03:16:42,756 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-02-21 03:16:42,758 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-02-21 03:16:42,758 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 21.02 03:16:40" (1/3) ... [2022-02-21 03:16:42,759 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2ab2c5d8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.02 03:16:42, skipping insertion in model container [2022-02-21 03:16:42,759 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:16:40" (2/3) ... [2022-02-21 03:16:42,759 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2ab2c5d8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.02 03:16:42, skipping insertion in model container [2022-02-21 03:16:42,759 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.02 03:16:42" (3/3) ... [2022-02-21 03:16:42,760 INFO L111 eAbstractionObserver]: Analyzing ICFG uthash_JEN_test6-1.i [2022-02-21 03:16:42,763 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-02-21 03:16:42,763 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 14 error locations. [2022-02-21 03:16:42,792 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-02-21 03:16:42,796 INFO L339 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mLoopAccelerationTechnique=FAST_UPR [2022-02-21 03:16:42,796 INFO L340 AbstractCegarLoop]: Starting to check reachability of 14 error locations. [2022-02-21 03:16:42,814 INFO L276 IsEmpty]: Start isEmpty. Operand has 245 states, 213 states have (on average 1.6525821596244132) internal successors, (352), 227 states have internal predecessors, (352), 14 states have call successors, (14), 4 states have call predecessors, (14), 4 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2022-02-21 03:16:42,816 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2022-02-21 03:16:42,816 INFO L506 BasicCegarLoop]: Found error trace [2022-02-21 03:16:42,817 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2022-02-21 03:16:42,817 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [alt_mallocErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, alt_mallocErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, alt_freeErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2022-02-21 03:16:42,820 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:16:42,821 INFO L85 PathProgramCache]: Analyzing trace with hash 1831503788, now seen corresponding path program 1 times [2022-02-21 03:16:42,826 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:16:42,827 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1355810658] [2022-02-21 03:16:42,827 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:16:42,827 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:16:42,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:16:42,961 INFO L290 TraceCheckUtils]: 0: Hoare triple {248#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(21, 2);~#alt_malloc_sizes~0.base, ~#alt_malloc_sizes~0.offset := 3, 0;call #Ultimate.allocInit(40, 3);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#alt_malloc_sizes~0.base);~alt_malloc_balance~0 := 0;~alt_memcmp_count~0 := 0;~alt_bzero_count~0 := 0; {248#true} is VALID [2022-02-21 03:16:42,961 INFO L290 TraceCheckUtils]: 1: Hoare triple {248#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret43#1.base, main_#t~ret43#1.offset, main_#t~mem44#1, main_#t~mem45#1, main_#t~mem46#1, main_#t~mem48#1, main_#t~mem47#1, main_#t~mem49#1, main_#t~mem50#1, main_#t~mem52#1, main_#t~mem51#1, main_#t~mem53#1, main_#t~mem54#1, main_#t~mem56#1, main_#t~mem55#1, main_#t~mem57#1, main_#t~mem58#1, main_#t~switch59#1, main_#t~mem60#1, main_#t~mem61#1, main_#t~mem62#1, main_#t~mem63#1, main_#t~mem64#1, main_#t~mem65#1, main_#t~mem66#1, main_#t~mem67#1, main_#t~mem68#1, main_#t~mem69#1, main_#t~mem70#1, main_~_hj_i~0#1, main_~_hj_j~0#1, main_~_hj_k~0#1, main_~_hj_key~0#1.base, main_~_hj_key~0#1.offset, main_#t~ret71#1.base, main_#t~ret71#1.offset, main_#t~mem72#1.base, main_#t~mem72#1.offset, main_#t~mem73#1.base, main_#t~mem73#1.offset, main_#t~mem74#1.base, main_#t~mem74#1.offset, main_#t~mem75#1.base, main_#t~mem75#1.offset, main_#t~mem76#1.base, main_#t~mem76#1.offset, main_#t~mem77#1.base, main_#t~mem77#1.offset, main_#t~mem78#1.base, main_#t~mem78#1.offset, main_#t~ret79#1.base, main_#t~ret79#1.offset, main_#t~mem80#1.base, main_#t~mem80#1.offset, main_#t~mem81#1.base, main_#t~mem81#1.offset, main_#t~mem82#1.base, main_#t~mem82#1.offset, main_#t~mem83#1.base, main_#t~mem83#1.offset, main_#t~mem84#1.base, main_#t~mem84#1.offset, main_#t~mem85#1.base, main_#t~mem85#1.offset, main_#t~mem86#1.base, main_#t~mem86#1.offset, main_#t~mem87#1.base, main_#t~mem87#1.offset, main_#t~mem88#1.base, main_#t~mem88#1.offset, main_#t~mem89#1.base, main_#t~mem89#1.offset, main_#t~mem90#1, main_#t~mem91#1.base, main_#t~mem91#1.offset, main_#t~mem92#1.base, main_#t~mem92#1.offset, main_#t~mem93#1.base, main_#t~mem93#1.offset, main_#t~mem94#1.base, main_#t~mem94#1.offset, main_#t~mem95#1, main_#t~post96#1, main_#t~mem97#1.base, main_#t~mem97#1.offset, main_#t~mem98#1, main_#t~mem99#1.base, main_#t~mem99#1.offset, main_#t~mem100#1.base, main_#t~mem100#1.offset, main_#t~mem101#1, main_#t~post102#1, main_#t~mem103#1.base, main_#t~mem103#1.offset, main_#t~mem104#1.base, main_#t~mem104#1.offset, main_#t~mem105#1.base, main_#t~mem105#1.offset, main_#t~mem107#1, main_#t~mem106#1, main_#t~mem108#1.base, main_#t~mem108#1.offset, main_#t~mem109#1, main_#t~short110#1, main_#t~mem111#1.base, main_#t~mem111#1.offset, main_#t~mem112#1, main_#t~ret113#1.base, main_#t~ret113#1.offset, main_#t~mem114#1.base, main_#t~mem114#1.offset, main_#t~mem115#1.base, main_#t~mem115#1.offset, main_#t~mem116#1.base, main_#t~mem116#1.offset, main_#t~mem117#1, main_#t~mem118#1.base, main_#t~mem118#1.offset, main_#t~mem119#1.base, main_#t~mem119#1.offset, main_#t~mem122#1, main_#t~mem120#1.base, main_#t~mem120#1.offset, main_#t~mem121#1, main_#t~mem123#1.base, main_#t~mem123#1.offset, main_#t~mem126#1, main_#t~mem124#1.base, main_#t~mem124#1.offset, main_#t~mem125#1, main_#t~ite127#1, main_#t~mem128#1.base, main_#t~mem128#1.offset, main_#t~mem132#1.base, main_#t~mem132#1.offset, main_#t~mem133#1.base, main_#t~mem133#1.offset, main_#t~mem134#1.base, main_#t~mem134#1.offset, main_#t~mem135#1.base, main_#t~mem135#1.offset, main_#t~mem138#1, main_#t~mem136#1.base, main_#t~mem136#1.offset, main_#t~mem137#1, main_#t~mem139#1.base, main_#t~mem139#1.offset, main_#t~mem140#1, main_#t~pre141#1, main_#t~mem142#1.base, main_#t~mem142#1.offset, main_#t~mem143#1, main_#t~mem144#1.base, main_#t~mem144#1.offset, main_#t~mem145#1, main_#t~post146#1, main_#t~mem150#1, main_#t~mem148#1, main_#t~mem147#1.base, main_#t~mem147#1.offset, main_#t~mem149#1, main_#t~mem151#1, main_#t~post152#1, main_#t~mem153#1.base, main_#t~mem153#1.offset, main_#t~mem154#1.base, main_#t~mem154#1.offset, main_#t~mem155#1.base, main_#t~mem155#1.offset, main_#t~post129#1, main_#t~mem130#1.base, main_#t~mem130#1.offset, main_#t~mem131#1, main_#t~mem156#1.base, main_#t~mem156#1.offset, main_#t~mem157#1.base, main_#t~mem157#1.offset, main_#t~mem158#1.base, main_#t~mem158#1.offset, main_#t~mem159#1, main_#t~mem160#1.base, main_#t~mem160#1.offset, main_#t~mem161#1, main_#t~mem162#1.base, main_#t~mem162#1.offset, main_#t~mem163#1, main_#t~post164#1, main_#t~mem165#1.base, main_#t~mem165#1.offset, main_#t~mem166#1.base, main_#t~mem166#1.offset, main_#t~mem167#1.base, main_#t~mem167#1.offset, main_#t~mem168#1.base, main_#t~mem168#1.offset, main_#t~mem171#1, main_#t~mem169#1.base, main_#t~mem169#1.offset, main_#t~mem170#1, main_#t~ite174#1, main_#t~mem172#1.base, main_#t~mem172#1.offset, main_#t~mem173#1, main_#t~mem175#1.base, main_#t~mem175#1.offset, main_#t~mem176#1, main_#t~mem177#1.base, main_#t~mem177#1.offset, main_~_he_bkt~0#1, main_~_he_bkt_i~0#1, main_~_he_thh~0#1.base, main_~_he_thh~0#1.offset, main_~_he_hh_nxt~0#1.base, main_~_he_hh_nxt~0#1.offset, main_~#_he_new_buckets~0#1.base, main_~#_he_new_buckets~0#1.offset, main_~_he_newbkt~0#1.base, main_~_he_newbkt~0#1.offset, main_~_ha_head~0#1.base, main_~_ha_head~0#1.offset, main_~_ha_bkt~0#1, main_~_ha_hashv~0#1, main_#t~mem40#1, main_#t~post41#1, main_#t~mem42#1, main_#t~mem182#1, main_#t~mem181#1, main_#t~mem183#1, main_#t~mem184#1, main_#t~mem186#1, main_#t~mem185#1, main_#t~mem187#1, main_#t~mem188#1, main_#t~mem190#1, main_#t~mem189#1, main_#t~mem191#1, main_#t~mem192#1, main_#t~switch193#1, main_#t~mem194#1, main_#t~mem195#1, main_#t~mem196#1, main_#t~mem197#1, main_#t~mem198#1, main_#t~mem199#1, main_#t~mem200#1, main_#t~mem201#1, main_#t~mem202#1, main_#t~mem203#1, main_#t~mem204#1, main_~_hj_i~1#1, main_~_hj_j~1#1, main_~_hj_k~1#1, main_~_hj_key~1#1.base, main_~_hj_key~1#1.offset, main_#t~mem205#1.base, main_#t~mem205#1.offset, main_#t~mem206#1, main_#t~mem207#1.base, main_#t~mem207#1.offset, main_#t~mem208#1.base, main_#t~mem208#1.offset, main_#t~mem209#1.base, main_#t~mem209#1.offset, main_#t~mem210#1.base, main_#t~mem210#1.offset, main_#t~mem211#1.base, main_#t~mem211#1.offset, main_#t~mem212#1.base, main_#t~mem212#1.offset, main_#t~mem213#1.base, main_#t~mem213#1.offset, main_#t~mem214#1, main_#t~mem215#1, main_#t~mem216#1, main_#t~short217#1, main_#t~mem218#1.base, main_#t~mem218#1.offset, main_#t~ret219#1, main_#t~mem220#1.base, main_#t~mem220#1.offset, main_#t~mem221#1.base, main_#t~mem221#1.offset, main_#t~mem222#1.base, main_#t~mem222#1.offset, main_#t~mem223#1, main_~_hf_bkt~0#1, main_~_hf_hashv~0#1, main_#t~mem224#1.base, main_#t~mem224#1.offset, main_#t~mem225#1.base, main_#t~mem225#1.offset, main_#t~short226#1, main_#t~mem227#1.base, main_#t~mem227#1.offset, main_#t~mem228#1.base, main_#t~mem228#1.offset, main_#t~mem229#1.base, main_#t~mem229#1.offset, main_#t~mem230#1, main_#t~mem231#1.base, main_#t~mem231#1.offset, main_#t~mem232#1.base, main_#t~mem232#1.offset, main_#t~mem233#1.base, main_#t~mem233#1.offset, main_#t~mem234#1.base, main_#t~mem234#1.offset, main_#t~mem235#1.base, main_#t~mem235#1.offset, main_#t~mem236#1.base, main_#t~mem236#1.offset, main_#t~mem237#1, main_#t~mem238#1.base, main_#t~mem238#1.offset, main_#t~mem239#1.base, main_#t~mem239#1.offset, main_#t~mem240#1.base, main_#t~mem240#1.offset, main_#t~mem241#1, main_#t~mem242#1.base, main_#t~mem242#1.offset, main_#t~mem243#1.base, main_#t~mem243#1.offset, main_#t~mem244#1.base, main_#t~mem244#1.offset, main_#t~mem245#1.base, main_#t~mem245#1.offset, main_#t~mem246#1.base, main_#t~mem246#1.offset, main_#t~mem247#1, main_#t~mem248#1.base, main_#t~mem248#1.offset, main_#t~mem251#1, main_#t~mem249#1.base, main_#t~mem249#1.offset, main_#t~mem250#1, main_#t~mem252#1.base, main_#t~mem252#1.offset, main_#t~mem253#1.base, main_#t~mem253#1.offset, main_#t~mem254#1, main_#t~post255#1, main_#t~mem256#1.base, main_#t~mem256#1.offset, main_#t~mem257#1.base, main_#t~mem257#1.offset, main_#t~mem258#1.base, main_#t~mem258#1.offset, main_#t~mem259#1.base, main_#t~mem259#1.offset, main_#t~mem260#1.base, main_#t~mem260#1.offset, main_#t~mem261#1.base, main_#t~mem261#1.offset, main_#t~mem262#1.base, main_#t~mem262#1.offset, main_#t~mem263#1.base, main_#t~mem263#1.offset, main_~_hd_head~0#1.base, main_~_hd_head~0#1.offset, main_#t~mem264#1.base, main_#t~mem264#1.offset, main_#t~mem265#1, main_#t~post266#1, main_~_hd_bkt~0#1, main_~_hd_hh_del~0#1.base, main_~_hd_hh_del~0#1.offset, main_#t~mem178#1, main_#t~post179#1, main_#t~mem180#1, main_#t~mem267#1.base, main_#t~mem267#1.offset, main_~#i~0#1.base, main_~#i~0#1.offset, main_~user~0#1.base, main_~user~0#1.offset, main_~tmp~0#1.base, main_~tmp~0#1.offset, main_~users~0#1.base, main_~users~0#1.offset;call main_~#i~0#1.base, main_~#i~0#1.offset := #Ultimate.allocOnStack(4);havoc main_~user~0#1.base, main_~user~0#1.offset;havoc main_~tmp~0#1.base, main_~tmp~0#1.offset;main_~users~0#1.base, main_~users~0#1.offset := 0, 0;call write~int(0, main_~#i~0#1.base, main_~#i~0#1.offset, 4); {248#true} is VALID [2022-02-21 03:16:42,963 INFO L290 TraceCheckUtils]: 2: Hoare triple {248#true} call main_#t~mem42#1 := read~int(main_~#i~0#1.base, main_~#i~0#1.offset, 4); {248#true} is VALID [2022-02-21 03:16:42,964 INFO L290 TraceCheckUtils]: 3: Hoare triple {248#true} assume !!(main_#t~mem42#1 < 10);havoc main_#t~mem42#1;assume { :begin_inline_real_malloc } true;real_malloc_#in~n#1 := 40;havoc real_malloc_#res#1.base, real_malloc_#res#1.offset;havoc real_malloc_#t~malloc39#1.base, real_malloc_#t~malloc39#1.offset, real_malloc_~n#1;real_malloc_~n#1 := real_malloc_#in~n#1;call real_malloc_#t~malloc39#1.base, real_malloc_#t~malloc39#1.offset := #Ultimate.allocOnHeap(real_malloc_~n#1);real_malloc_#res#1.base, real_malloc_#res#1.offset := real_malloc_#t~malloc39#1.base, real_malloc_#t~malloc39#1.offset;havoc real_malloc_#t~malloc39#1.base, real_malloc_#t~malloc39#1.offset; {248#true} is VALID [2022-02-21 03:16:42,964 INFO L290 TraceCheckUtils]: 4: Hoare triple {248#true} main_#t~ret43#1.base, main_#t~ret43#1.offset := real_malloc_#res#1.base, real_malloc_#res#1.offset;assume { :end_inline_real_malloc } true;main_~user~0#1.base, main_~user~0#1.offset := main_#t~ret43#1.base, main_#t~ret43#1.offset;havoc main_#t~ret43#1.base, main_#t~ret43#1.offset; {248#true} is VALID [2022-02-21 03:16:42,965 INFO L290 TraceCheckUtils]: 5: Hoare triple {248#true} assume main_~user~0#1.base == 0 && main_~user~0#1.offset == 0;assume false; {249#false} is VALID [2022-02-21 03:16:42,965 INFO L290 TraceCheckUtils]: 6: Hoare triple {249#false} call main_#t~mem44#1 := read~int(main_~#i~0#1.base, main_~#i~0#1.offset, 4);call write~int(main_#t~mem44#1, main_~user~0#1.base, main_~user~0#1.offset, 4);havoc main_#t~mem44#1;call main_#t~mem45#1 := read~int(main_~#i~0#1.base, main_~#i~0#1.offset, 4);call main_#t~mem46#1 := read~int(main_~#i~0#1.base, main_~#i~0#1.offset, 4); {249#false} is VALID [2022-02-21 03:16:42,965 INFO L290 TraceCheckUtils]: 7: Hoare triple {249#false} assume !(main_#t~mem45#1 * main_#t~mem46#1 <= 2147483647); {249#false} is VALID [2022-02-21 03:16:42,966 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-21 03:16:42,966 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 03:16:42,967 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1355810658] [2022-02-21 03:16:42,967 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1355810658] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-21 03:16:42,967 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-21 03:16:42,968 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-02-21 03:16:42,969 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [532197650] [2022-02-21 03:16:42,969 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-21 03:16:42,972 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 4.0) internal successors, (8), 2 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2022-02-21 03:16:42,973 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-21 03:16:42,975 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 2 states, 2 states have (on average 4.0) internal successors, (8), 2 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:16:42,984 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 8 edges. 8 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:16:42,984 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-02-21 03:16:42,984 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 03:16:43,010 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-02-21 03:16:43,011 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-02-21 03:16:43,018 INFO L87 Difference]: Start difference. First operand has 245 states, 213 states have (on average 1.6525821596244132) internal successors, (352), 227 states have internal predecessors, (352), 14 states have call successors, (14), 4 states have call predecessors, (14), 4 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) Second operand has 2 states, 2 states have (on average 4.0) internal successors, (8), 2 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:16:43,329 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:16:43,329 INFO L93 Difference]: Finished difference Result 485 states and 764 transitions. [2022-02-21 03:16:43,330 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-02-21 03:16:43,330 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 4.0) internal successors, (8), 2 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2022-02-21 03:16:43,330 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-21 03:16:43,331 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2 states, 2 states have (on average 4.0) internal successors, (8), 2 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:16:43,351 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 764 transitions. [2022-02-21 03:16:43,351 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2 states, 2 states have (on average 4.0) internal successors, (8), 2 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:16:43,361 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 764 transitions. [2022-02-21 03:16:43,362 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states and 764 transitions. [2022-02-21 03:16:43,901 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 764 edges. 764 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:16:43,918 INFO L225 Difference]: With dead ends: 485 [2022-02-21 03:16:43,918 INFO L226 Difference]: Without dead ends: 233 [2022-02-21 03:16:43,921 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-02-21 03:16:43,923 INFO L933 BasicCegarLoop]: 305 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 305 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-21 03:16:43,924 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 305 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-21 03:16:43,935 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 233 states. [2022-02-21 03:16:43,950 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 233 to 233. [2022-02-21 03:16:43,950 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 03:16:43,951 INFO L82 GeneralOperation]: Start isEquivalent. First operand 233 states. Second operand has 233 states, 205 states have (on average 1.3317073170731708) internal successors, (273), 219 states have internal predecessors, (273), 10 states have call successors, (10), 4 states have call predecessors, (10), 4 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-02-21 03:16:43,952 INFO L74 IsIncluded]: Start isIncluded. First operand 233 states. Second operand has 233 states, 205 states have (on average 1.3317073170731708) internal successors, (273), 219 states have internal predecessors, (273), 10 states have call successors, (10), 4 states have call predecessors, (10), 4 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-02-21 03:16:43,953 INFO L87 Difference]: Start difference. First operand 233 states. Second operand has 233 states, 205 states have (on average 1.3317073170731708) internal successors, (273), 219 states have internal predecessors, (273), 10 states have call successors, (10), 4 states have call predecessors, (10), 4 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-02-21 03:16:43,960 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:16:43,960 INFO L93 Difference]: Finished difference Result 233 states and 293 transitions. [2022-02-21 03:16:43,961 INFO L276 IsEmpty]: Start isEmpty. Operand 233 states and 293 transitions. [2022-02-21 03:16:43,962 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:16:43,962 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:16:43,963 INFO L74 IsIncluded]: Start isIncluded. First operand has 233 states, 205 states have (on average 1.3317073170731708) internal successors, (273), 219 states have internal predecessors, (273), 10 states have call successors, (10), 4 states have call predecessors, (10), 4 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) Second operand 233 states. [2022-02-21 03:16:43,963 INFO L87 Difference]: Start difference. First operand has 233 states, 205 states have (on average 1.3317073170731708) internal successors, (273), 219 states have internal predecessors, (273), 10 states have call successors, (10), 4 states have call predecessors, (10), 4 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) Second operand 233 states. [2022-02-21 03:16:43,970 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:16:43,971 INFO L93 Difference]: Finished difference Result 233 states and 293 transitions. [2022-02-21 03:16:43,971 INFO L276 IsEmpty]: Start isEmpty. Operand 233 states and 293 transitions. [2022-02-21 03:16:43,972 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:16:43,972 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:16:43,972 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 03:16:43,972 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 03:16:43,973 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 233 states, 205 states have (on average 1.3317073170731708) internal successors, (273), 219 states have internal predecessors, (273), 10 states have call successors, (10), 4 states have call predecessors, (10), 4 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-02-21 03:16:43,979 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 233 states to 233 states and 293 transitions. [2022-02-21 03:16:43,981 INFO L78 Accepts]: Start accepts. Automaton has 233 states and 293 transitions. Word has length 8 [2022-02-21 03:16:43,981 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-21 03:16:43,981 INFO L470 AbstractCegarLoop]: Abstraction has 233 states and 293 transitions. [2022-02-21 03:16:43,981 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 4.0) internal successors, (8), 2 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:16:43,981 INFO L276 IsEmpty]: Start isEmpty. Operand 233 states and 293 transitions. [2022-02-21 03:16:43,982 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2022-02-21 03:16:43,982 INFO L506 BasicCegarLoop]: Found error trace [2022-02-21 03:16:43,982 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2022-02-21 03:16:43,982 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-02-21 03:16:43,982 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [alt_mallocErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, alt_mallocErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, alt_freeErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2022-02-21 03:16:43,983 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:16:43,983 INFO L85 PathProgramCache]: Analyzing trace with hash 1831505710, now seen corresponding path program 1 times [2022-02-21 03:16:43,983 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:16:43,983 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1821954985] [2022-02-21 03:16:43,983 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:16:43,984 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:16:44,005 ERROR L252 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-02-21 03:16:44,013 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [678451185] [2022-02-21 03:16:44,013 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:16:44,013 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-21 03:16:44,014 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:16:44,015 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-02-21 03:16:44,035 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-02-21 03:16:44,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:16:44,146 INFO L263 TraceCheckSpWp]: Trace formula consists of 106 conjuncts, 15 conjunts are in the unsatisfiable core [2022-02-21 03:16:44,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:16:44,199 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 03:16:44,277 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 11 treesize of output 7 [2022-02-21 03:16:44,282 INFO L390 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 [2022-02-21 03:16:44,336 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-02-21 03:16:44,337 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-02-21 03:16:44,454 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-21 03:16:44,457 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 15 treesize of output 7 [2022-02-21 03:16:44,474 INFO L290 TraceCheckUtils]: 0: Hoare triple {1576#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(21, 2);~#alt_malloc_sizes~0.base, ~#alt_malloc_sizes~0.offset := 3, 0;call #Ultimate.allocInit(40, 3);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#alt_malloc_sizes~0.base);~alt_malloc_balance~0 := 0;~alt_memcmp_count~0 := 0;~alt_bzero_count~0 := 0; {1576#true} is VALID [2022-02-21 03:16:44,475 INFO L290 TraceCheckUtils]: 1: Hoare triple {1576#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret43#1.base, main_#t~ret43#1.offset, main_#t~mem44#1, main_#t~mem45#1, main_#t~mem46#1, main_#t~mem48#1, main_#t~mem47#1, main_#t~mem49#1, main_#t~mem50#1, main_#t~mem52#1, main_#t~mem51#1, main_#t~mem53#1, main_#t~mem54#1, main_#t~mem56#1, main_#t~mem55#1, main_#t~mem57#1, main_#t~mem58#1, main_#t~switch59#1, main_#t~mem60#1, main_#t~mem61#1, main_#t~mem62#1, main_#t~mem63#1, main_#t~mem64#1, main_#t~mem65#1, main_#t~mem66#1, main_#t~mem67#1, main_#t~mem68#1, main_#t~mem69#1, main_#t~mem70#1, main_~_hj_i~0#1, main_~_hj_j~0#1, main_~_hj_k~0#1, main_~_hj_key~0#1.base, main_~_hj_key~0#1.offset, main_#t~ret71#1.base, main_#t~ret71#1.offset, main_#t~mem72#1.base, main_#t~mem72#1.offset, main_#t~mem73#1.base, main_#t~mem73#1.offset, main_#t~mem74#1.base, main_#t~mem74#1.offset, main_#t~mem75#1.base, main_#t~mem75#1.offset, main_#t~mem76#1.base, main_#t~mem76#1.offset, main_#t~mem77#1.base, main_#t~mem77#1.offset, main_#t~mem78#1.base, main_#t~mem78#1.offset, main_#t~ret79#1.base, main_#t~ret79#1.offset, main_#t~mem80#1.base, main_#t~mem80#1.offset, main_#t~mem81#1.base, main_#t~mem81#1.offset, main_#t~mem82#1.base, main_#t~mem82#1.offset, main_#t~mem83#1.base, main_#t~mem83#1.offset, main_#t~mem84#1.base, main_#t~mem84#1.offset, main_#t~mem85#1.base, main_#t~mem85#1.offset, main_#t~mem86#1.base, main_#t~mem86#1.offset, main_#t~mem87#1.base, main_#t~mem87#1.offset, main_#t~mem88#1.base, main_#t~mem88#1.offset, main_#t~mem89#1.base, main_#t~mem89#1.offset, main_#t~mem90#1, main_#t~mem91#1.base, main_#t~mem91#1.offset, main_#t~mem92#1.base, main_#t~mem92#1.offset, main_#t~mem93#1.base, main_#t~mem93#1.offset, main_#t~mem94#1.base, main_#t~mem94#1.offset, main_#t~mem95#1, main_#t~post96#1, main_#t~mem97#1.base, main_#t~mem97#1.offset, main_#t~mem98#1, main_#t~mem99#1.base, main_#t~mem99#1.offset, main_#t~mem100#1.base, main_#t~mem100#1.offset, main_#t~mem101#1, main_#t~post102#1, main_#t~mem103#1.base, main_#t~mem103#1.offset, main_#t~mem104#1.base, main_#t~mem104#1.offset, main_#t~mem105#1.base, main_#t~mem105#1.offset, main_#t~mem107#1, main_#t~mem106#1, main_#t~mem108#1.base, main_#t~mem108#1.offset, main_#t~mem109#1, main_#t~short110#1, main_#t~mem111#1.base, main_#t~mem111#1.offset, main_#t~mem112#1, main_#t~ret113#1.base, main_#t~ret113#1.offset, main_#t~mem114#1.base, main_#t~mem114#1.offset, main_#t~mem115#1.base, main_#t~mem115#1.offset, main_#t~mem116#1.base, main_#t~mem116#1.offset, main_#t~mem117#1, main_#t~mem118#1.base, main_#t~mem118#1.offset, main_#t~mem119#1.base, main_#t~mem119#1.offset, main_#t~mem122#1, main_#t~mem120#1.base, main_#t~mem120#1.offset, main_#t~mem121#1, main_#t~mem123#1.base, main_#t~mem123#1.offset, main_#t~mem126#1, main_#t~mem124#1.base, main_#t~mem124#1.offset, main_#t~mem125#1, main_#t~ite127#1, main_#t~mem128#1.base, main_#t~mem128#1.offset, main_#t~mem132#1.base, main_#t~mem132#1.offset, main_#t~mem133#1.base, main_#t~mem133#1.offset, main_#t~mem134#1.base, main_#t~mem134#1.offset, main_#t~mem135#1.base, main_#t~mem135#1.offset, main_#t~mem138#1, main_#t~mem136#1.base, main_#t~mem136#1.offset, main_#t~mem137#1, main_#t~mem139#1.base, main_#t~mem139#1.offset, main_#t~mem140#1, main_#t~pre141#1, main_#t~mem142#1.base, main_#t~mem142#1.offset, main_#t~mem143#1, main_#t~mem144#1.base, main_#t~mem144#1.offset, main_#t~mem145#1, main_#t~post146#1, main_#t~mem150#1, main_#t~mem148#1, main_#t~mem147#1.base, main_#t~mem147#1.offset, main_#t~mem149#1, main_#t~mem151#1, main_#t~post152#1, main_#t~mem153#1.base, main_#t~mem153#1.offset, main_#t~mem154#1.base, main_#t~mem154#1.offset, main_#t~mem155#1.base, main_#t~mem155#1.offset, main_#t~post129#1, main_#t~mem130#1.base, main_#t~mem130#1.offset, main_#t~mem131#1, main_#t~mem156#1.base, main_#t~mem156#1.offset, main_#t~mem157#1.base, main_#t~mem157#1.offset, main_#t~mem158#1.base, main_#t~mem158#1.offset, main_#t~mem159#1, main_#t~mem160#1.base, main_#t~mem160#1.offset, main_#t~mem161#1, main_#t~mem162#1.base, main_#t~mem162#1.offset, main_#t~mem163#1, main_#t~post164#1, main_#t~mem165#1.base, main_#t~mem165#1.offset, main_#t~mem166#1.base, main_#t~mem166#1.offset, main_#t~mem167#1.base, main_#t~mem167#1.offset, main_#t~mem168#1.base, main_#t~mem168#1.offset, main_#t~mem171#1, main_#t~mem169#1.base, main_#t~mem169#1.offset, main_#t~mem170#1, main_#t~ite174#1, main_#t~mem172#1.base, main_#t~mem172#1.offset, main_#t~mem173#1, main_#t~mem175#1.base, main_#t~mem175#1.offset, main_#t~mem176#1, main_#t~mem177#1.base, main_#t~mem177#1.offset, main_~_he_bkt~0#1, main_~_he_bkt_i~0#1, main_~_he_thh~0#1.base, main_~_he_thh~0#1.offset, main_~_he_hh_nxt~0#1.base, main_~_he_hh_nxt~0#1.offset, main_~#_he_new_buckets~0#1.base, main_~#_he_new_buckets~0#1.offset, main_~_he_newbkt~0#1.base, main_~_he_newbkt~0#1.offset, main_~_ha_head~0#1.base, main_~_ha_head~0#1.offset, main_~_ha_bkt~0#1, main_~_ha_hashv~0#1, main_#t~mem40#1, main_#t~post41#1, main_#t~mem42#1, main_#t~mem182#1, main_#t~mem181#1, main_#t~mem183#1, main_#t~mem184#1, main_#t~mem186#1, main_#t~mem185#1, main_#t~mem187#1, main_#t~mem188#1, main_#t~mem190#1, main_#t~mem189#1, main_#t~mem191#1, main_#t~mem192#1, main_#t~switch193#1, main_#t~mem194#1, main_#t~mem195#1, main_#t~mem196#1, main_#t~mem197#1, main_#t~mem198#1, main_#t~mem199#1, main_#t~mem200#1, main_#t~mem201#1, main_#t~mem202#1, main_#t~mem203#1, main_#t~mem204#1, main_~_hj_i~1#1, main_~_hj_j~1#1, main_~_hj_k~1#1, main_~_hj_key~1#1.base, main_~_hj_key~1#1.offset, main_#t~mem205#1.base, main_#t~mem205#1.offset, main_#t~mem206#1, main_#t~mem207#1.base, main_#t~mem207#1.offset, main_#t~mem208#1.base, main_#t~mem208#1.offset, main_#t~mem209#1.base, main_#t~mem209#1.offset, main_#t~mem210#1.base, main_#t~mem210#1.offset, main_#t~mem211#1.base, main_#t~mem211#1.offset, main_#t~mem212#1.base, main_#t~mem212#1.offset, main_#t~mem213#1.base, main_#t~mem213#1.offset, main_#t~mem214#1, main_#t~mem215#1, main_#t~mem216#1, main_#t~short217#1, main_#t~mem218#1.base, main_#t~mem218#1.offset, main_#t~ret219#1, main_#t~mem220#1.base, main_#t~mem220#1.offset, main_#t~mem221#1.base, main_#t~mem221#1.offset, main_#t~mem222#1.base, main_#t~mem222#1.offset, main_#t~mem223#1, main_~_hf_bkt~0#1, main_~_hf_hashv~0#1, main_#t~mem224#1.base, main_#t~mem224#1.offset, main_#t~mem225#1.base, main_#t~mem225#1.offset, main_#t~short226#1, main_#t~mem227#1.base, main_#t~mem227#1.offset, main_#t~mem228#1.base, main_#t~mem228#1.offset, main_#t~mem229#1.base, main_#t~mem229#1.offset, main_#t~mem230#1, main_#t~mem231#1.base, main_#t~mem231#1.offset, main_#t~mem232#1.base, main_#t~mem232#1.offset, main_#t~mem233#1.base, main_#t~mem233#1.offset, main_#t~mem234#1.base, main_#t~mem234#1.offset, main_#t~mem235#1.base, main_#t~mem235#1.offset, main_#t~mem236#1.base, main_#t~mem236#1.offset, main_#t~mem237#1, main_#t~mem238#1.base, main_#t~mem238#1.offset, main_#t~mem239#1.base, main_#t~mem239#1.offset, main_#t~mem240#1.base, main_#t~mem240#1.offset, main_#t~mem241#1, main_#t~mem242#1.base, main_#t~mem242#1.offset, main_#t~mem243#1.base, main_#t~mem243#1.offset, main_#t~mem244#1.base, main_#t~mem244#1.offset, main_#t~mem245#1.base, main_#t~mem245#1.offset, main_#t~mem246#1.base, main_#t~mem246#1.offset, main_#t~mem247#1, main_#t~mem248#1.base, main_#t~mem248#1.offset, main_#t~mem251#1, main_#t~mem249#1.base, main_#t~mem249#1.offset, main_#t~mem250#1, main_#t~mem252#1.base, main_#t~mem252#1.offset, main_#t~mem253#1.base, main_#t~mem253#1.offset, main_#t~mem254#1, main_#t~post255#1, main_#t~mem256#1.base, main_#t~mem256#1.offset, main_#t~mem257#1.base, main_#t~mem257#1.offset, main_#t~mem258#1.base, main_#t~mem258#1.offset, main_#t~mem259#1.base, main_#t~mem259#1.offset, main_#t~mem260#1.base, main_#t~mem260#1.offset, main_#t~mem261#1.base, main_#t~mem261#1.offset, main_#t~mem262#1.base, main_#t~mem262#1.offset, main_#t~mem263#1.base, main_#t~mem263#1.offset, main_~_hd_head~0#1.base, main_~_hd_head~0#1.offset, main_#t~mem264#1.base, main_#t~mem264#1.offset, main_#t~mem265#1, main_#t~post266#1, main_~_hd_bkt~0#1, main_~_hd_hh_del~0#1.base, main_~_hd_hh_del~0#1.offset, main_#t~mem178#1, main_#t~post179#1, main_#t~mem180#1, main_#t~mem267#1.base, main_#t~mem267#1.offset, main_~#i~0#1.base, main_~#i~0#1.offset, main_~user~0#1.base, main_~user~0#1.offset, main_~tmp~0#1.base, main_~tmp~0#1.offset, main_~users~0#1.base, main_~users~0#1.offset;call main_~#i~0#1.base, main_~#i~0#1.offset := #Ultimate.allocOnStack(4);havoc main_~user~0#1.base, main_~user~0#1.offset;havoc main_~tmp~0#1.base, main_~tmp~0#1.offset;main_~users~0#1.base, main_~users~0#1.offset := 0, 0;call write~int(0, main_~#i~0#1.base, main_~#i~0#1.offset, 4); {1584#(and (= (select (select |#memory_int| |ULTIMATE.start_main_~#i~0#1.base|) |ULTIMATE.start_main_~#i~0#1.offset|) 0) (= (select |#valid| |ULTIMATE.start_main_~#i~0#1.base|) 1))} is VALID [2022-02-21 03:16:44,476 INFO L290 TraceCheckUtils]: 2: Hoare triple {1584#(and (= (select (select |#memory_int| |ULTIMATE.start_main_~#i~0#1.base|) |ULTIMATE.start_main_~#i~0#1.offset|) 0) (= (select |#valid| |ULTIMATE.start_main_~#i~0#1.base|) 1))} call main_#t~mem42#1 := read~int(main_~#i~0#1.base, main_~#i~0#1.offset, 4); {1584#(and (= (select (select |#memory_int| |ULTIMATE.start_main_~#i~0#1.base|) |ULTIMATE.start_main_~#i~0#1.offset|) 0) (= (select |#valid| |ULTIMATE.start_main_~#i~0#1.base|) 1))} is VALID [2022-02-21 03:16:44,477 INFO L290 TraceCheckUtils]: 3: Hoare triple {1584#(and (= (select (select |#memory_int| |ULTIMATE.start_main_~#i~0#1.base|) |ULTIMATE.start_main_~#i~0#1.offset|) 0) (= (select |#valid| |ULTIMATE.start_main_~#i~0#1.base|) 1))} assume !!(main_#t~mem42#1 < 10);havoc main_#t~mem42#1;assume { :begin_inline_real_malloc } true;real_malloc_#in~n#1 := 40;havoc real_malloc_#res#1.base, real_malloc_#res#1.offset;havoc real_malloc_#t~malloc39#1.base, real_malloc_#t~malloc39#1.offset, real_malloc_~n#1;real_malloc_~n#1 := real_malloc_#in~n#1;call real_malloc_#t~malloc39#1.base, real_malloc_#t~malloc39#1.offset := #Ultimate.allocOnHeap(real_malloc_~n#1);real_malloc_#res#1.base, real_malloc_#res#1.offset := real_malloc_#t~malloc39#1.base, real_malloc_#t~malloc39#1.offset;havoc real_malloc_#t~malloc39#1.base, real_malloc_#t~malloc39#1.offset; {1591#(and (= (select (select |#memory_int| |ULTIMATE.start_main_~#i~0#1.base|) |ULTIMATE.start_main_~#i~0#1.offset|) 0) (not (= |ULTIMATE.start_main_~#i~0#1.base| |ULTIMATE.start_real_malloc_#res#1.base|)))} is VALID [2022-02-21 03:16:44,477 INFO L290 TraceCheckUtils]: 4: Hoare triple {1591#(and (= (select (select |#memory_int| |ULTIMATE.start_main_~#i~0#1.base|) |ULTIMATE.start_main_~#i~0#1.offset|) 0) (not (= |ULTIMATE.start_main_~#i~0#1.base| |ULTIMATE.start_real_malloc_#res#1.base|)))} main_#t~ret43#1.base, main_#t~ret43#1.offset := real_malloc_#res#1.base, real_malloc_#res#1.offset;assume { :end_inline_real_malloc } true;main_~user~0#1.base, main_~user~0#1.offset := main_#t~ret43#1.base, main_#t~ret43#1.offset;havoc main_#t~ret43#1.base, main_#t~ret43#1.offset; {1595#(and (= (select (select |#memory_int| |ULTIMATE.start_main_~#i~0#1.base|) |ULTIMATE.start_main_~#i~0#1.offset|) 0) (not (= |ULTIMATE.start_main_~user~0#1.base| |ULTIMATE.start_main_~#i~0#1.base|)))} is VALID [2022-02-21 03:16:44,478 INFO L290 TraceCheckUtils]: 5: Hoare triple {1595#(and (= (select (select |#memory_int| |ULTIMATE.start_main_~#i~0#1.base|) |ULTIMATE.start_main_~#i~0#1.offset|) 0) (not (= |ULTIMATE.start_main_~user~0#1.base| |ULTIMATE.start_main_~#i~0#1.base|)))} assume !(main_~user~0#1.base == 0 && main_~user~0#1.offset == 0); {1595#(and (= (select (select |#memory_int| |ULTIMATE.start_main_~#i~0#1.base|) |ULTIMATE.start_main_~#i~0#1.offset|) 0) (not (= |ULTIMATE.start_main_~user~0#1.base| |ULTIMATE.start_main_~#i~0#1.base|)))} is VALID [2022-02-21 03:16:44,479 INFO L290 TraceCheckUtils]: 6: Hoare triple {1595#(and (= (select (select |#memory_int| |ULTIMATE.start_main_~#i~0#1.base|) |ULTIMATE.start_main_~#i~0#1.offset|) 0) (not (= |ULTIMATE.start_main_~user~0#1.base| |ULTIMATE.start_main_~#i~0#1.base|)))} call main_#t~mem44#1 := read~int(main_~#i~0#1.base, main_~#i~0#1.offset, 4);call write~int(main_#t~mem44#1, main_~user~0#1.base, main_~user~0#1.offset, 4);havoc main_#t~mem44#1;call main_#t~mem45#1 := read~int(main_~#i~0#1.base, main_~#i~0#1.offset, 4);call main_#t~mem46#1 := read~int(main_~#i~0#1.base, main_~#i~0#1.offset, 4); {1602#(= |ULTIMATE.start_main_#t~mem45#1| 0)} is VALID [2022-02-21 03:16:44,479 INFO L290 TraceCheckUtils]: 7: Hoare triple {1602#(= |ULTIMATE.start_main_#t~mem45#1| 0)} assume !(main_#t~mem45#1 * main_#t~mem46#1 <= 2147483647); {1577#false} is VALID [2022-02-21 03:16:44,479 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-21 03:16:44,480 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-21 03:16:44,480 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 03:16:44,480 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1821954985] [2022-02-21 03:16:44,480 WARN L317 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-02-21 03:16:44,480 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [678451185] [2022-02-21 03:16:44,482 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [678451185] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-21 03:16:44,482 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-21 03:16:44,482 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-02-21 03:16:44,483 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1254750567] [2022-02-21 03:16:44,483 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-21 03:16:44,484 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 1.6) internal successors, (8), 6 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2022-02-21 03:16:44,484 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-21 03:16:44,484 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 6 states, 5 states have (on average 1.6) internal successors, (8), 6 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:16:44,491 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 8 edges. 8 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:16:44,491 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-02-21 03:16:44,492 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 03:16:44,492 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-02-21 03:16:44,492 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-02-21 03:16:44,493 INFO L87 Difference]: Start difference. First operand 233 states and 293 transitions. Second operand has 6 states, 5 states have (on average 1.6) internal successors, (8), 6 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:16:46,262 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:16:46,262 INFO L93 Difference]: Finished difference Result 357 states and 457 transitions. [2022-02-21 03:16:46,262 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-02-21 03:16:46,263 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 1.6) internal successors, (8), 6 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2022-02-21 03:16:46,263 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-21 03:16:46,263 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 5 states have (on average 1.6) internal successors, (8), 6 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:16:46,267 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 457 transitions. [2022-02-21 03:16:46,267 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 5 states have (on average 1.6) internal successors, (8), 6 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:16:46,270 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 457 transitions. [2022-02-21 03:16:46,270 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 457 transitions. [2022-02-21 03:16:46,612 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 457 edges. 457 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:16:46,629 INFO L225 Difference]: With dead ends: 357 [2022-02-21 03:16:46,629 INFO L226 Difference]: Without dead ends: 355 [2022-02-21 03:16:46,629 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2022-02-21 03:16:46,630 INFO L933 BasicCegarLoop]: 255 mSDtfsCounter, 242 mSDsluCounter, 866 mSDsCounter, 0 mSdLazyCounter, 400 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 242 SdHoareTripleChecker+Valid, 1121 SdHoareTripleChecker+Invalid, 418 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 400 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-02-21 03:16:46,631 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [242 Valid, 1121 Invalid, 418 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 400 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-02-21 03:16:46,631 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 355 states. [2022-02-21 03:16:46,638 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 355 to 240. [2022-02-21 03:16:46,639 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 03:16:46,639 INFO L82 GeneralOperation]: Start isEquivalent. First operand 355 states. Second operand has 240 states, 212 states have (on average 1.3254716981132075) internal successors, (281), 226 states have internal predecessors, (281), 10 states have call successors, (10), 4 states have call predecessors, (10), 4 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-02-21 03:16:46,640 INFO L74 IsIncluded]: Start isIncluded. First operand 355 states. Second operand has 240 states, 212 states have (on average 1.3254716981132075) internal successors, (281), 226 states have internal predecessors, (281), 10 states have call successors, (10), 4 states have call predecessors, (10), 4 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-02-21 03:16:46,640 INFO L87 Difference]: Start difference. First operand 355 states. Second operand has 240 states, 212 states have (on average 1.3254716981132075) internal successors, (281), 226 states have internal predecessors, (281), 10 states have call successors, (10), 4 states have call predecessors, (10), 4 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-02-21 03:16:46,650 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:16:46,651 INFO L93 Difference]: Finished difference Result 355 states and 455 transitions. [2022-02-21 03:16:46,651 INFO L276 IsEmpty]: Start isEmpty. Operand 355 states and 455 transitions. [2022-02-21 03:16:46,654 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:16:46,654 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:16:46,655 INFO L74 IsIncluded]: Start isIncluded. First operand has 240 states, 212 states have (on average 1.3254716981132075) internal successors, (281), 226 states have internal predecessors, (281), 10 states have call successors, (10), 4 states have call predecessors, (10), 4 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) Second operand 355 states. [2022-02-21 03:16:46,656 INFO L87 Difference]: Start difference. First operand has 240 states, 212 states have (on average 1.3254716981132075) internal successors, (281), 226 states have internal predecessors, (281), 10 states have call successors, (10), 4 states have call predecessors, (10), 4 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) Second operand 355 states. [2022-02-21 03:16:46,666 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:16:46,667 INFO L93 Difference]: Finished difference Result 355 states and 455 transitions. [2022-02-21 03:16:46,667 INFO L276 IsEmpty]: Start isEmpty. Operand 355 states and 455 transitions. [2022-02-21 03:16:46,667 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:16:46,668 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:16:46,668 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 03:16:46,668 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 03:16:46,669 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 240 states, 212 states have (on average 1.3254716981132075) internal successors, (281), 226 states have internal predecessors, (281), 10 states have call successors, (10), 4 states have call predecessors, (10), 4 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-02-21 03:16:46,676 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 240 states to 240 states and 301 transitions. [2022-02-21 03:16:46,676 INFO L78 Accepts]: Start accepts. Automaton has 240 states and 301 transitions. Word has length 8 [2022-02-21 03:16:46,676 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-21 03:16:46,677 INFO L470 AbstractCegarLoop]: Abstraction has 240 states and 301 transitions. [2022-02-21 03:16:46,677 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 1.6) internal successors, (8), 6 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:16:46,677 INFO L276 IsEmpty]: Start isEmpty. Operand 240 states and 301 transitions. [2022-02-21 03:16:46,678 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2022-02-21 03:16:46,678 INFO L506 BasicCegarLoop]: Found error trace [2022-02-21 03:16:46,678 INFO L514 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-21 03:16:46,713 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2022-02-21 03:16:46,891 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-21 03:16:46,892 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting alt_mallocErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [alt_mallocErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, alt_mallocErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, alt_freeErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2022-02-21 03:16:46,893 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:16:46,893 INFO L85 PathProgramCache]: Analyzing trace with hash 1327424248, now seen corresponding path program 1 times [2022-02-21 03:16:46,893 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:16:46,893 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1162267419] [2022-02-21 03:16:46,893 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:16:46,893 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:16:46,925 ERROR L252 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-02-21 03:16:46,925 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1317525188] [2022-02-21 03:16:46,925 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:16:46,925 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-21 03:16:46,926 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:16:46,927 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-02-21 03:16:46,935 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-02-21 03:16:47,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:16:47,085 INFO L263 TraceCheckSpWp]: Trace formula consists of 261 conjuncts, 3 conjunts are in the unsatisfiable core [2022-02-21 03:16:47,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:16:47,107 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 03:16:47,222 INFO L290 TraceCheckUtils]: 0: Hoare triple {3031#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(21, 2);~#alt_malloc_sizes~0.base, ~#alt_malloc_sizes~0.offset := 3, 0;call #Ultimate.allocInit(40, 3);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#alt_malloc_sizes~0.base);~alt_malloc_balance~0 := 0;~alt_memcmp_count~0 := 0;~alt_bzero_count~0 := 0; {3031#true} is VALID [2022-02-21 03:16:47,222 INFO L290 TraceCheckUtils]: 1: Hoare triple {3031#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret43#1.base, main_#t~ret43#1.offset, main_#t~mem44#1, main_#t~mem45#1, main_#t~mem46#1, main_#t~mem48#1, main_#t~mem47#1, main_#t~mem49#1, main_#t~mem50#1, main_#t~mem52#1, main_#t~mem51#1, main_#t~mem53#1, main_#t~mem54#1, main_#t~mem56#1, main_#t~mem55#1, main_#t~mem57#1, main_#t~mem58#1, main_#t~switch59#1, main_#t~mem60#1, main_#t~mem61#1, main_#t~mem62#1, main_#t~mem63#1, main_#t~mem64#1, main_#t~mem65#1, main_#t~mem66#1, main_#t~mem67#1, main_#t~mem68#1, main_#t~mem69#1, main_#t~mem70#1, main_~_hj_i~0#1, main_~_hj_j~0#1, main_~_hj_k~0#1, main_~_hj_key~0#1.base, main_~_hj_key~0#1.offset, main_#t~ret71#1.base, main_#t~ret71#1.offset, main_#t~mem72#1.base, main_#t~mem72#1.offset, main_#t~mem73#1.base, main_#t~mem73#1.offset, main_#t~mem74#1.base, main_#t~mem74#1.offset, main_#t~mem75#1.base, main_#t~mem75#1.offset, main_#t~mem76#1.base, main_#t~mem76#1.offset, main_#t~mem77#1.base, main_#t~mem77#1.offset, main_#t~mem78#1.base, main_#t~mem78#1.offset, main_#t~ret79#1.base, main_#t~ret79#1.offset, main_#t~mem80#1.base, main_#t~mem80#1.offset, main_#t~mem81#1.base, main_#t~mem81#1.offset, main_#t~mem82#1.base, main_#t~mem82#1.offset, main_#t~mem83#1.base, main_#t~mem83#1.offset, main_#t~mem84#1.base, main_#t~mem84#1.offset, main_#t~mem85#1.base, main_#t~mem85#1.offset, main_#t~mem86#1.base, main_#t~mem86#1.offset, main_#t~mem87#1.base, main_#t~mem87#1.offset, main_#t~mem88#1.base, main_#t~mem88#1.offset, main_#t~mem89#1.base, main_#t~mem89#1.offset, main_#t~mem90#1, main_#t~mem91#1.base, main_#t~mem91#1.offset, main_#t~mem92#1.base, main_#t~mem92#1.offset, main_#t~mem93#1.base, main_#t~mem93#1.offset, main_#t~mem94#1.base, main_#t~mem94#1.offset, main_#t~mem95#1, main_#t~post96#1, main_#t~mem97#1.base, main_#t~mem97#1.offset, main_#t~mem98#1, main_#t~mem99#1.base, main_#t~mem99#1.offset, main_#t~mem100#1.base, main_#t~mem100#1.offset, main_#t~mem101#1, main_#t~post102#1, main_#t~mem103#1.base, main_#t~mem103#1.offset, main_#t~mem104#1.base, main_#t~mem104#1.offset, main_#t~mem105#1.base, main_#t~mem105#1.offset, main_#t~mem107#1, main_#t~mem106#1, main_#t~mem108#1.base, main_#t~mem108#1.offset, main_#t~mem109#1, main_#t~short110#1, main_#t~mem111#1.base, main_#t~mem111#1.offset, main_#t~mem112#1, main_#t~ret113#1.base, main_#t~ret113#1.offset, main_#t~mem114#1.base, main_#t~mem114#1.offset, main_#t~mem115#1.base, main_#t~mem115#1.offset, main_#t~mem116#1.base, main_#t~mem116#1.offset, main_#t~mem117#1, main_#t~mem118#1.base, main_#t~mem118#1.offset, main_#t~mem119#1.base, main_#t~mem119#1.offset, main_#t~mem122#1, main_#t~mem120#1.base, main_#t~mem120#1.offset, main_#t~mem121#1, main_#t~mem123#1.base, main_#t~mem123#1.offset, main_#t~mem126#1, main_#t~mem124#1.base, main_#t~mem124#1.offset, main_#t~mem125#1, main_#t~ite127#1, main_#t~mem128#1.base, main_#t~mem128#1.offset, main_#t~mem132#1.base, main_#t~mem132#1.offset, main_#t~mem133#1.base, main_#t~mem133#1.offset, main_#t~mem134#1.base, main_#t~mem134#1.offset, main_#t~mem135#1.base, main_#t~mem135#1.offset, main_#t~mem138#1, main_#t~mem136#1.base, main_#t~mem136#1.offset, main_#t~mem137#1, main_#t~mem139#1.base, main_#t~mem139#1.offset, main_#t~mem140#1, main_#t~pre141#1, main_#t~mem142#1.base, main_#t~mem142#1.offset, main_#t~mem143#1, main_#t~mem144#1.base, main_#t~mem144#1.offset, main_#t~mem145#1, main_#t~post146#1, main_#t~mem150#1, main_#t~mem148#1, main_#t~mem147#1.base, main_#t~mem147#1.offset, main_#t~mem149#1, main_#t~mem151#1, main_#t~post152#1, main_#t~mem153#1.base, main_#t~mem153#1.offset, main_#t~mem154#1.base, main_#t~mem154#1.offset, main_#t~mem155#1.base, main_#t~mem155#1.offset, main_#t~post129#1, main_#t~mem130#1.base, main_#t~mem130#1.offset, main_#t~mem131#1, main_#t~mem156#1.base, main_#t~mem156#1.offset, main_#t~mem157#1.base, main_#t~mem157#1.offset, main_#t~mem158#1.base, main_#t~mem158#1.offset, main_#t~mem159#1, main_#t~mem160#1.base, main_#t~mem160#1.offset, main_#t~mem161#1, main_#t~mem162#1.base, main_#t~mem162#1.offset, main_#t~mem163#1, main_#t~post164#1, main_#t~mem165#1.base, main_#t~mem165#1.offset, main_#t~mem166#1.base, main_#t~mem166#1.offset, main_#t~mem167#1.base, main_#t~mem167#1.offset, main_#t~mem168#1.base, main_#t~mem168#1.offset, main_#t~mem171#1, main_#t~mem169#1.base, main_#t~mem169#1.offset, main_#t~mem170#1, main_#t~ite174#1, main_#t~mem172#1.base, main_#t~mem172#1.offset, main_#t~mem173#1, main_#t~mem175#1.base, main_#t~mem175#1.offset, main_#t~mem176#1, main_#t~mem177#1.base, main_#t~mem177#1.offset, main_~_he_bkt~0#1, main_~_he_bkt_i~0#1, main_~_he_thh~0#1.base, main_~_he_thh~0#1.offset, main_~_he_hh_nxt~0#1.base, main_~_he_hh_nxt~0#1.offset, main_~#_he_new_buckets~0#1.base, main_~#_he_new_buckets~0#1.offset, main_~_he_newbkt~0#1.base, main_~_he_newbkt~0#1.offset, main_~_ha_head~0#1.base, main_~_ha_head~0#1.offset, main_~_ha_bkt~0#1, main_~_ha_hashv~0#1, main_#t~mem40#1, main_#t~post41#1, main_#t~mem42#1, main_#t~mem182#1, main_#t~mem181#1, main_#t~mem183#1, main_#t~mem184#1, main_#t~mem186#1, main_#t~mem185#1, main_#t~mem187#1, main_#t~mem188#1, main_#t~mem190#1, main_#t~mem189#1, main_#t~mem191#1, main_#t~mem192#1, main_#t~switch193#1, main_#t~mem194#1, main_#t~mem195#1, main_#t~mem196#1, main_#t~mem197#1, main_#t~mem198#1, main_#t~mem199#1, main_#t~mem200#1, main_#t~mem201#1, main_#t~mem202#1, main_#t~mem203#1, main_#t~mem204#1, main_~_hj_i~1#1, main_~_hj_j~1#1, main_~_hj_k~1#1, main_~_hj_key~1#1.base, main_~_hj_key~1#1.offset, main_#t~mem205#1.base, main_#t~mem205#1.offset, main_#t~mem206#1, main_#t~mem207#1.base, main_#t~mem207#1.offset, main_#t~mem208#1.base, main_#t~mem208#1.offset, main_#t~mem209#1.base, main_#t~mem209#1.offset, main_#t~mem210#1.base, main_#t~mem210#1.offset, main_#t~mem211#1.base, main_#t~mem211#1.offset, main_#t~mem212#1.base, main_#t~mem212#1.offset, main_#t~mem213#1.base, main_#t~mem213#1.offset, main_#t~mem214#1, main_#t~mem215#1, main_#t~mem216#1, main_#t~short217#1, main_#t~mem218#1.base, main_#t~mem218#1.offset, main_#t~ret219#1, main_#t~mem220#1.base, main_#t~mem220#1.offset, main_#t~mem221#1.base, main_#t~mem221#1.offset, main_#t~mem222#1.base, main_#t~mem222#1.offset, main_#t~mem223#1, main_~_hf_bkt~0#1, main_~_hf_hashv~0#1, main_#t~mem224#1.base, main_#t~mem224#1.offset, main_#t~mem225#1.base, main_#t~mem225#1.offset, main_#t~short226#1, main_#t~mem227#1.base, main_#t~mem227#1.offset, main_#t~mem228#1.base, main_#t~mem228#1.offset, main_#t~mem229#1.base, main_#t~mem229#1.offset, main_#t~mem230#1, main_#t~mem231#1.base, main_#t~mem231#1.offset, main_#t~mem232#1.base, main_#t~mem232#1.offset, main_#t~mem233#1.base, main_#t~mem233#1.offset, main_#t~mem234#1.base, main_#t~mem234#1.offset, main_#t~mem235#1.base, main_#t~mem235#1.offset, main_#t~mem236#1.base, main_#t~mem236#1.offset, main_#t~mem237#1, main_#t~mem238#1.base, main_#t~mem238#1.offset, main_#t~mem239#1.base, main_#t~mem239#1.offset, main_#t~mem240#1.base, main_#t~mem240#1.offset, main_#t~mem241#1, main_#t~mem242#1.base, main_#t~mem242#1.offset, main_#t~mem243#1.base, main_#t~mem243#1.offset, main_#t~mem244#1.base, main_#t~mem244#1.offset, main_#t~mem245#1.base, main_#t~mem245#1.offset, main_#t~mem246#1.base, main_#t~mem246#1.offset, main_#t~mem247#1, main_#t~mem248#1.base, main_#t~mem248#1.offset, main_#t~mem251#1, main_#t~mem249#1.base, main_#t~mem249#1.offset, main_#t~mem250#1, main_#t~mem252#1.base, main_#t~mem252#1.offset, main_#t~mem253#1.base, main_#t~mem253#1.offset, main_#t~mem254#1, main_#t~post255#1, main_#t~mem256#1.base, main_#t~mem256#1.offset, main_#t~mem257#1.base, main_#t~mem257#1.offset, main_#t~mem258#1.base, main_#t~mem258#1.offset, main_#t~mem259#1.base, main_#t~mem259#1.offset, main_#t~mem260#1.base, main_#t~mem260#1.offset, main_#t~mem261#1.base, main_#t~mem261#1.offset, main_#t~mem262#1.base, main_#t~mem262#1.offset, main_#t~mem263#1.base, main_#t~mem263#1.offset, main_~_hd_head~0#1.base, main_~_hd_head~0#1.offset, main_#t~mem264#1.base, main_#t~mem264#1.offset, main_#t~mem265#1, main_#t~post266#1, main_~_hd_bkt~0#1, main_~_hd_hh_del~0#1.base, main_~_hd_hh_del~0#1.offset, main_#t~mem178#1, main_#t~post179#1, main_#t~mem180#1, main_#t~mem267#1.base, main_#t~mem267#1.offset, main_~#i~0#1.base, main_~#i~0#1.offset, main_~user~0#1.base, main_~user~0#1.offset, main_~tmp~0#1.base, main_~tmp~0#1.offset, main_~users~0#1.base, main_~users~0#1.offset;call main_~#i~0#1.base, main_~#i~0#1.offset := #Ultimate.allocOnStack(4);havoc main_~user~0#1.base, main_~user~0#1.offset;havoc main_~tmp~0#1.base, main_~tmp~0#1.offset;main_~users~0#1.base, main_~users~0#1.offset := 0, 0;call write~int(0, main_~#i~0#1.base, main_~#i~0#1.offset, 4); {3031#true} is VALID [2022-02-21 03:16:47,223 INFO L290 TraceCheckUtils]: 2: Hoare triple {3031#true} call main_#t~mem42#1 := read~int(main_~#i~0#1.base, main_~#i~0#1.offset, 4); {3031#true} is VALID [2022-02-21 03:16:47,223 INFO L290 TraceCheckUtils]: 3: Hoare triple {3031#true} assume !!(main_#t~mem42#1 < 10);havoc main_#t~mem42#1;assume { :begin_inline_real_malloc } true;real_malloc_#in~n#1 := 40;havoc real_malloc_#res#1.base, real_malloc_#res#1.offset;havoc real_malloc_#t~malloc39#1.base, real_malloc_#t~malloc39#1.offset, real_malloc_~n#1;real_malloc_~n#1 := real_malloc_#in~n#1;call real_malloc_#t~malloc39#1.base, real_malloc_#t~malloc39#1.offset := #Ultimate.allocOnHeap(real_malloc_~n#1);real_malloc_#res#1.base, real_malloc_#res#1.offset := real_malloc_#t~malloc39#1.base, real_malloc_#t~malloc39#1.offset;havoc real_malloc_#t~malloc39#1.base, real_malloc_#t~malloc39#1.offset; {3031#true} is VALID [2022-02-21 03:16:47,223 INFO L290 TraceCheckUtils]: 4: Hoare triple {3031#true} main_#t~ret43#1.base, main_#t~ret43#1.offset := real_malloc_#res#1.base, real_malloc_#res#1.offset;assume { :end_inline_real_malloc } true;main_~user~0#1.base, main_~user~0#1.offset := main_#t~ret43#1.base, main_#t~ret43#1.offset;havoc main_#t~ret43#1.base, main_#t~ret43#1.offset; {3031#true} is VALID [2022-02-21 03:16:47,223 INFO L290 TraceCheckUtils]: 5: Hoare triple {3031#true} assume !(main_~user~0#1.base == 0 && main_~user~0#1.offset == 0); {3031#true} is VALID [2022-02-21 03:16:47,223 INFO L290 TraceCheckUtils]: 6: Hoare triple {3031#true} call main_#t~mem44#1 := read~int(main_~#i~0#1.base, main_~#i~0#1.offset, 4);call write~int(main_#t~mem44#1, main_~user~0#1.base, main_~user~0#1.offset, 4);havoc main_#t~mem44#1;call main_#t~mem45#1 := read~int(main_~#i~0#1.base, main_~#i~0#1.offset, 4);call main_#t~mem46#1 := read~int(main_~#i~0#1.base, main_~#i~0#1.offset, 4); {3031#true} is VALID [2022-02-21 03:16:47,223 INFO L290 TraceCheckUtils]: 7: Hoare triple {3031#true} assume main_#t~mem45#1 * main_#t~mem46#1 <= 2147483647; {3031#true} is VALID [2022-02-21 03:16:47,224 INFO L290 TraceCheckUtils]: 8: Hoare triple {3031#true} assume main_#t~mem45#1 * main_#t~mem46#1 >= -2147483648;call write~int(main_#t~mem45#1 * main_#t~mem46#1, main_~user~0#1.base, 4 + main_~user~0#1.offset, 4);havoc main_#t~mem45#1;havoc main_#t~mem46#1; {3031#true} is VALID [2022-02-21 03:16:47,224 INFO L290 TraceCheckUtils]: 9: Hoare triple {3031#true} havoc main_~_ha_hashv~0#1; {3031#true} is VALID [2022-02-21 03:16:47,224 INFO L290 TraceCheckUtils]: 10: Hoare triple {3031#true} goto; {3031#true} is VALID [2022-02-21 03:16:47,224 INFO L290 TraceCheckUtils]: 11: Hoare triple {3031#true} havoc main_~_hj_i~0#1;havoc main_~_hj_j~0#1;havoc main_~_hj_k~0#1;main_~_hj_key~0#1.base, main_~_hj_key~0#1.offset := main_~user~0#1.base, main_~user~0#1.offset;main_~_ha_hashv~0#1 := 4276993775;main_~_hj_j~0#1 := 2654435769;main_~_hj_i~0#1 := main_~_hj_j~0#1;main_~_hj_k~0#1 := 4; {3031#true} is VALID [2022-02-21 03:16:47,224 INFO L290 TraceCheckUtils]: 12: Hoare triple {3031#true} assume !(main_~_hj_k~0#1 % 4294967296 >= 12); {3031#true} is VALID [2022-02-21 03:16:47,225 INFO L290 TraceCheckUtils]: 13: Hoare triple {3031#true} main_~_ha_hashv~0#1 := 4 + main_~_ha_hashv~0#1;main_#t~switch59#1 := 11 == main_~_hj_k~0#1; {3031#true} is VALID [2022-02-21 03:16:47,228 INFO L290 TraceCheckUtils]: 14: Hoare triple {3031#true} assume main_#t~switch59#1;call main_#t~mem60#1 := read~int(main_~_hj_key~0#1.base, 10 + main_~_hj_key~0#1.offset, 1);main_~_ha_hashv~0#1 := main_~_ha_hashv~0#1 + 16777216 * (main_#t~mem60#1 % 256);havoc main_#t~mem60#1; {3031#true} is VALID [2022-02-21 03:16:47,229 INFO L290 TraceCheckUtils]: 15: Hoare triple {3031#true} main_#t~switch59#1 := main_#t~switch59#1 || 10 == main_~_hj_k~0#1; {3031#true} is VALID [2022-02-21 03:16:47,229 INFO L290 TraceCheckUtils]: 16: Hoare triple {3031#true} assume main_#t~switch59#1;call main_#t~mem61#1 := read~int(main_~_hj_key~0#1.base, 9 + main_~_hj_key~0#1.offset, 1);main_~_ha_hashv~0#1 := main_~_ha_hashv~0#1 + 65536 * (main_#t~mem61#1 % 256);havoc main_#t~mem61#1; {3031#true} is VALID [2022-02-21 03:16:47,229 INFO L290 TraceCheckUtils]: 17: Hoare triple {3031#true} main_#t~switch59#1 := main_#t~switch59#1 || 9 == main_~_hj_k~0#1; {3031#true} is VALID [2022-02-21 03:16:47,229 INFO L290 TraceCheckUtils]: 18: Hoare triple {3031#true} assume main_#t~switch59#1;call main_#t~mem62#1 := read~int(main_~_hj_key~0#1.base, 8 + main_~_hj_key~0#1.offset, 1);main_~_ha_hashv~0#1 := main_~_ha_hashv~0#1 + 256 * (main_#t~mem62#1 % 256);havoc main_#t~mem62#1; {3090#|ULTIMATE.start_main_#t~switch59#1|} is VALID [2022-02-21 03:16:47,230 INFO L290 TraceCheckUtils]: 19: Hoare triple {3090#|ULTIMATE.start_main_#t~switch59#1|} main_#t~switch59#1 := main_#t~switch59#1 || 8 == main_~_hj_k~0#1; {3090#|ULTIMATE.start_main_#t~switch59#1|} is VALID [2022-02-21 03:16:47,230 INFO L290 TraceCheckUtils]: 20: Hoare triple {3090#|ULTIMATE.start_main_#t~switch59#1|} assume !main_#t~switch59#1; {3032#false} is VALID [2022-02-21 03:16:47,230 INFO L290 TraceCheckUtils]: 21: Hoare triple {3032#false} main_#t~switch59#1 := main_#t~switch59#1 || 7 == main_~_hj_k~0#1; {3032#false} is VALID [2022-02-21 03:16:47,231 INFO L290 TraceCheckUtils]: 22: Hoare triple {3032#false} assume main_#t~switch59#1;call main_#t~mem64#1 := read~int(main_~_hj_key~0#1.base, 6 + main_~_hj_key~0#1.offset, 1);main_~_hj_j~0#1 := main_~_hj_j~0#1 + 65536 * (main_#t~mem64#1 % 256);havoc main_#t~mem64#1; {3032#false} is VALID [2022-02-21 03:16:47,231 INFO L290 TraceCheckUtils]: 23: Hoare triple {3032#false} main_#t~switch59#1 := main_#t~switch59#1 || 6 == main_~_hj_k~0#1; {3032#false} is VALID [2022-02-21 03:16:47,231 INFO L290 TraceCheckUtils]: 24: Hoare triple {3032#false} assume main_#t~switch59#1;call main_#t~mem65#1 := read~int(main_~_hj_key~0#1.base, 5 + main_~_hj_key~0#1.offset, 1);main_~_hj_j~0#1 := main_~_hj_j~0#1 + 256 * (main_#t~mem65#1 % 256);havoc main_#t~mem65#1; {3032#false} is VALID [2022-02-21 03:16:47,231 INFO L290 TraceCheckUtils]: 25: Hoare triple {3032#false} main_#t~switch59#1 := main_#t~switch59#1 || 5 == main_~_hj_k~0#1; {3032#false} is VALID [2022-02-21 03:16:47,231 INFO L290 TraceCheckUtils]: 26: Hoare triple {3032#false} assume main_#t~switch59#1;call main_#t~mem66#1 := read~int(main_~_hj_key~0#1.base, 4 + main_~_hj_key~0#1.offset, 1);main_~_hj_j~0#1 := main_~_hj_j~0#1 + main_#t~mem66#1 % 256;havoc main_#t~mem66#1; {3032#false} is VALID [2022-02-21 03:16:47,232 INFO L290 TraceCheckUtils]: 27: Hoare triple {3032#false} main_#t~switch59#1 := main_#t~switch59#1 || 4 == main_~_hj_k~0#1; {3032#false} is VALID [2022-02-21 03:16:47,232 INFO L290 TraceCheckUtils]: 28: Hoare triple {3032#false} assume main_#t~switch59#1;call main_#t~mem67#1 := read~int(main_~_hj_key~0#1.base, 3 + main_~_hj_key~0#1.offset, 1);main_~_hj_i~0#1 := main_~_hj_i~0#1 + 16777216 * (main_#t~mem67#1 % 256);havoc main_#t~mem67#1; {3032#false} is VALID [2022-02-21 03:16:47,232 INFO L290 TraceCheckUtils]: 29: Hoare triple {3032#false} main_#t~switch59#1 := main_#t~switch59#1 || 3 == main_~_hj_k~0#1; {3032#false} is VALID [2022-02-21 03:16:47,232 INFO L290 TraceCheckUtils]: 30: Hoare triple {3032#false} assume main_#t~switch59#1;call main_#t~mem68#1 := read~int(main_~_hj_key~0#1.base, 2 + main_~_hj_key~0#1.offset, 1);main_~_hj_i~0#1 := main_~_hj_i~0#1 + 65536 * (main_#t~mem68#1 % 256);havoc main_#t~mem68#1; {3032#false} is VALID [2022-02-21 03:16:47,232 INFO L290 TraceCheckUtils]: 31: Hoare triple {3032#false} main_#t~switch59#1 := main_#t~switch59#1 || 2 == main_~_hj_k~0#1; {3032#false} is VALID [2022-02-21 03:16:47,233 INFO L290 TraceCheckUtils]: 32: Hoare triple {3032#false} assume main_#t~switch59#1;call main_#t~mem69#1 := read~int(main_~_hj_key~0#1.base, 1 + main_~_hj_key~0#1.offset, 1);main_~_hj_i~0#1 := main_~_hj_i~0#1 + 256 * (main_#t~mem69#1 % 256);havoc main_#t~mem69#1; {3032#false} is VALID [2022-02-21 03:16:47,233 INFO L290 TraceCheckUtils]: 33: Hoare triple {3032#false} main_#t~switch59#1 := main_#t~switch59#1 || 1 == main_~_hj_k~0#1; {3032#false} is VALID [2022-02-21 03:16:47,233 INFO L290 TraceCheckUtils]: 34: Hoare triple {3032#false} assume !main_#t~switch59#1; {3032#false} is VALID [2022-02-21 03:16:47,233 INFO L290 TraceCheckUtils]: 35: Hoare triple {3032#false} havoc main_#t~switch59#1; {3032#false} is VALID [2022-02-21 03:16:47,233 INFO L290 TraceCheckUtils]: 36: Hoare triple {3032#false} main_~_hj_i~0#1 := main_~_hj_i~0#1 - main_~_hj_j~0#1;main_~_hj_i~0#1 := main_~_hj_i~0#1 - main_~_ha_hashv~0#1;main_~_hj_i~0#1 := (if (1 == main_~_hj_i~0#1 || 0 == main_~_hj_i~0#1) && (1 == main_~_ha_hashv~0#1 / 8192 || 0 == main_~_ha_hashv~0#1 / 8192) then (if main_~_hj_i~0#1 == main_~_ha_hashv~0#1 / 8192 then 0 else 1) else (if 0 == main_~_hj_i~0#1 then main_~_ha_hashv~0#1 / 8192 else (if 0 == main_~_ha_hashv~0#1 / 8192 then main_~_hj_i~0#1 else ~bitwiseXOr(main_~_hj_i~0#1, main_~_ha_hashv~0#1 / 8192))));main_~_hj_j~0#1 := main_~_hj_j~0#1 - main_~_ha_hashv~0#1;main_~_hj_j~0#1 := main_~_hj_j~0#1 - main_~_hj_i~0#1;main_~_hj_j~0#1 := (if (1 == main_~_hj_j~0#1 || 0 == main_~_hj_j~0#1) && (1 == 256 * main_~_hj_i~0#1 || 0 == 256 * main_~_hj_i~0#1) then (if main_~_hj_j~0#1 == 256 * main_~_hj_i~0#1 then 0 else 1) else (if 0 == main_~_hj_j~0#1 then 256 * main_~_hj_i~0#1 else (if 0 == 256 * main_~_hj_i~0#1 then main_~_hj_j~0#1 else ~bitwiseXOr(main_~_hj_j~0#1, 256 * main_~_hj_i~0#1))));main_~_ha_hashv~0#1 := main_~_ha_hashv~0#1 - main_~_hj_i~0#1;main_~_ha_hashv~0#1 := main_~_ha_hashv~0#1 - main_~_hj_j~0#1;main_~_ha_hashv~0#1 := (if (1 == main_~_ha_hashv~0#1 || 0 == main_~_ha_hashv~0#1) && (1 == main_~_hj_j~0#1 / 8192 || 0 == main_~_hj_j~0#1 / 8192) then (if main_~_ha_hashv~0#1 == main_~_hj_j~0#1 / 8192 then 0 else 1) else (if 0 == main_~_ha_hashv~0#1 then main_~_hj_j~0#1 / 8192 else (if 0 == main_~_hj_j~0#1 / 8192 then main_~_ha_hashv~0#1 else ~bitwiseXOr(main_~_ha_hashv~0#1, main_~_hj_j~0#1 / 8192))));main_~_hj_i~0#1 := main_~_hj_i~0#1 - main_~_hj_j~0#1;main_~_hj_i~0#1 := main_~_hj_i~0#1 - main_~_ha_hashv~0#1;main_~_hj_i~0#1 := (if (1 == main_~_hj_i~0#1 || 0 == main_~_hj_i~0#1) && (1 == main_~_ha_hashv~0#1 / 4096 || 0 == main_~_ha_hashv~0#1 / 4096) then (if main_~_hj_i~0#1 == main_~_ha_hashv~0#1 / 4096 then 0 else 1) else (if 0 == main_~_hj_i~0#1 then main_~_ha_hashv~0#1 / 4096 else (if 0 == main_~_ha_hashv~0#1 / 4096 then main_~_hj_i~0#1 else ~bitwiseXOr(main_~_hj_i~0#1, main_~_ha_hashv~0#1 / 4096))));main_~_hj_j~0#1 := main_~_hj_j~0#1 - main_~_ha_hashv~0#1;main_~_hj_j~0#1 := main_~_hj_j~0#1 - main_~_hj_i~0#1;main_~_hj_j~0#1 := (if (1 == main_~_hj_j~0#1 || 0 == main_~_hj_j~0#1) && (1 == 65536 * main_~_hj_i~0#1 || 0 == 65536 * main_~_hj_i~0#1) then (if main_~_hj_j~0#1 == 65536 * main_~_hj_i~0#1 then 0 else 1) else (if 0 == main_~_hj_j~0#1 then 65536 * main_~_hj_i~0#1 else (if 0 == 65536 * main_~_hj_i~0#1 then main_~_hj_j~0#1 else ~bitwiseXOr(main_~_hj_j~0#1, 65536 * main_~_hj_i~0#1))));main_~_ha_hashv~0#1 := main_~_ha_hashv~0#1 - main_~_hj_i~0#1;main_~_ha_hashv~0#1 := main_~_ha_hashv~0#1 - main_~_hj_j~0#1;main_~_ha_hashv~0#1 := (if (1 == main_~_ha_hashv~0#1 || 0 == main_~_ha_hashv~0#1) && (1 == main_~_hj_j~0#1 / 32 || 0 == main_~_hj_j~0#1 / 32) then (if main_~_ha_hashv~0#1 == main_~_hj_j~0#1 / 32 then 0 else 1) else (if 0 == main_~_ha_hashv~0#1 then main_~_hj_j~0#1 / 32 else (if 0 == main_~_hj_j~0#1 / 32 then main_~_ha_hashv~0#1 else ~bitwiseXOr(main_~_ha_hashv~0#1, main_~_hj_j~0#1 / 32))));main_~_hj_i~0#1 := main_~_hj_i~0#1 - main_~_hj_j~0#1;main_~_hj_i~0#1 := main_~_hj_i~0#1 - main_~_ha_hashv~0#1;main_~_hj_i~0#1 := (if (1 == main_~_hj_i~0#1 || 0 == main_~_hj_i~0#1) && (1 == main_~_ha_hashv~0#1 / 8 || 0 == main_~_ha_hashv~0#1 / 8) then (if main_~_hj_i~0#1 == main_~_ha_hashv~0#1 / 8 then 0 else 1) else (if 0 == main_~_hj_i~0#1 then main_~_ha_hashv~0#1 / 8 else (if 0 == main_~_ha_hashv~0#1 / 8 then main_~_hj_i~0#1 else ~bitwiseXOr(main_~_hj_i~0#1, main_~_ha_hashv~0#1 / 8))));main_~_hj_j~0#1 := main_~_hj_j~0#1 - main_~_ha_hashv~0#1;main_~_hj_j~0#1 := main_~_hj_j~0#1 - main_~_hj_i~0#1;main_~_hj_j~0#1 := (if (1 == main_~_hj_j~0#1 || 0 == main_~_hj_j~0#1) && (1 == 1024 * main_~_hj_i~0#1 || 0 == 1024 * main_~_hj_i~0#1) then (if main_~_hj_j~0#1 == 1024 * main_~_hj_i~0#1 then 0 else 1) else (if 0 == main_~_hj_j~0#1 then 1024 * main_~_hj_i~0#1 else (if 0 == 1024 * main_~_hj_i~0#1 then main_~_hj_j~0#1 else ~bitwiseXOr(main_~_hj_j~0#1, 1024 * main_~_hj_i~0#1))));main_~_ha_hashv~0#1 := main_~_ha_hashv~0#1 - main_~_hj_i~0#1;main_~_ha_hashv~0#1 := main_~_ha_hashv~0#1 - main_~_hj_j~0#1;main_~_ha_hashv~0#1 := (if (1 == main_~_ha_hashv~0#1 || 0 == main_~_ha_hashv~0#1) && (1 == main_~_hj_j~0#1 / 32768 || 0 == main_~_hj_j~0#1 / 32768) then (if main_~_ha_hashv~0#1 == main_~_hj_j~0#1 / 32768 then 0 else 1) else (if 0 == main_~_ha_hashv~0#1 then main_~_hj_j~0#1 / 32768 else (if 0 == main_~_hj_j~0#1 / 32768 then main_~_ha_hashv~0#1 else ~bitwiseXOr(main_~_ha_hashv~0#1, main_~_hj_j~0#1 / 32768)))); {3032#false} is VALID [2022-02-21 03:16:47,234 INFO L290 TraceCheckUtils]: 37: Hoare triple {3032#false} goto; {3032#false} is VALID [2022-02-21 03:16:47,234 INFO L290 TraceCheckUtils]: 38: Hoare triple {3032#false} goto; {3032#false} is VALID [2022-02-21 03:16:47,234 INFO L290 TraceCheckUtils]: 39: Hoare triple {3032#false} goto; {3032#false} is VALID [2022-02-21 03:16:47,234 INFO L290 TraceCheckUtils]: 40: Hoare triple {3032#false} call write~int(main_~_ha_hashv~0#1, main_~user~0#1.base, 36 + main_~user~0#1.offset, 4);call write~$Pointer$(main_~user~0#1.base, main_~user~0#1.offset, main_~user~0#1.base, 28 + main_~user~0#1.offset, 4);call write~int(4, main_~user~0#1.base, 32 + main_~user~0#1.offset, 4); {3032#false} is VALID [2022-02-21 03:16:47,234 INFO L290 TraceCheckUtils]: 41: Hoare triple {3032#false} assume main_~users~0#1.base == 0 && main_~users~0#1.offset == 0;call write~$Pointer$(0, 0, main_~user~0#1.base, 16 + main_~user~0#1.offset, 4);call write~$Pointer$(0, 0, main_~user~0#1.base, 12 + main_~user~0#1.offset, 4); {3032#false} is VALID [2022-02-21 03:16:47,235 INFO L272 TraceCheckUtils]: 42: Hoare triple {3032#false} call main_#t~ret71#1.base, main_#t~ret71#1.offset := alt_malloc(44); {3032#false} is VALID [2022-02-21 03:16:47,235 INFO L290 TraceCheckUtils]: 43: Hoare triple {3032#false} ~sz := #in~sz;#t~post31 := ~alt_malloc_balance~0; {3032#false} is VALID [2022-02-21 03:16:47,235 INFO L290 TraceCheckUtils]: 44: Hoare triple {3032#false} assume !(1 + #t~post31 <= 2147483647); {3032#false} is VALID [2022-02-21 03:16:47,235 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-21 03:16:47,235 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-21 03:16:47,236 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 03:16:47,236 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1162267419] [2022-02-21 03:16:47,236 WARN L317 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-02-21 03:16:47,236 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1317525188] [2022-02-21 03:16:47,236 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1317525188] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-21 03:16:47,236 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-21 03:16:47,237 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-21 03:16:47,237 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [256237367] [2022-02-21 03:16:47,237 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-21 03:16:47,237 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 3 states have internal predecessors, (44), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 45 [2022-02-21 03:16:47,238 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-21 03:16:47,238 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 3 states have internal predecessors, (44), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:16:47,266 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 45 edges. 45 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:16:47,266 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-21 03:16:47,266 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 03:16:47,267 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-21 03:16:47,267 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-21 03:16:47,267 INFO L87 Difference]: Start difference. First operand 240 states and 301 transitions. Second operand has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 3 states have internal predecessors, (44), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:16:47,727 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:16:47,727 INFO L93 Difference]: Finished difference Result 492 states and 623 transitions. [2022-02-21 03:16:47,727 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-21 03:16:47,728 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 3 states have internal predecessors, (44), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 45 [2022-02-21 03:16:47,728 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-21 03:16:47,728 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 3 states have internal predecessors, (44), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:16:47,742 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 615 transitions. [2022-02-21 03:16:47,743 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 3 states have internal predecessors, (44), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:16:47,747 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 615 transitions. [2022-02-21 03:16:47,747 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 615 transitions. [2022-02-21 03:16:48,186 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 615 edges. 615 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:16:48,190 INFO L225 Difference]: With dead ends: 492 [2022-02-21 03:16:48,190 INFO L226 Difference]: Without dead ends: 261 [2022-02-21 03:16:48,191 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-21 03:16:48,191 INFO L933 BasicCegarLoop]: 273 mSDtfsCounter, 9 mSDsluCounter, 258 mSDsCounter, 0 mSdLazyCounter, 44 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 531 SdHoareTripleChecker+Invalid, 72 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 44 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-21 03:16:48,192 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [9 Valid, 531 Invalid, 72 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 44 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-21 03:16:48,192 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 261 states. [2022-02-21 03:16:48,204 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 261 to 260. [2022-02-21 03:16:48,204 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 03:16:48,205 INFO L82 GeneralOperation]: Start isEquivalent. First operand 261 states. Second operand has 260 states, 232 states have (on average 1.2974137931034482) internal successors, (301), 246 states have internal predecessors, (301), 10 states have call successors, (10), 4 states have call predecessors, (10), 4 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-02-21 03:16:48,205 INFO L74 IsIncluded]: Start isIncluded. First operand 261 states. Second operand has 260 states, 232 states have (on average 1.2974137931034482) internal successors, (301), 246 states have internal predecessors, (301), 10 states have call successors, (10), 4 states have call predecessors, (10), 4 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-02-21 03:16:48,206 INFO L87 Difference]: Start difference. First operand 261 states. Second operand has 260 states, 232 states have (on average 1.2974137931034482) internal successors, (301), 246 states have internal predecessors, (301), 10 states have call successors, (10), 4 states have call predecessors, (10), 4 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-02-21 03:16:48,212 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:16:48,213 INFO L93 Difference]: Finished difference Result 261 states and 322 transitions. [2022-02-21 03:16:48,213 INFO L276 IsEmpty]: Start isEmpty. Operand 261 states and 322 transitions. [2022-02-21 03:16:48,213 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:16:48,213 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:16:48,214 INFO L74 IsIncluded]: Start isIncluded. First operand has 260 states, 232 states have (on average 1.2974137931034482) internal successors, (301), 246 states have internal predecessors, (301), 10 states have call successors, (10), 4 states have call predecessors, (10), 4 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) Second operand 261 states. [2022-02-21 03:16:48,214 INFO L87 Difference]: Start difference. First operand has 260 states, 232 states have (on average 1.2974137931034482) internal successors, (301), 246 states have internal predecessors, (301), 10 states have call successors, (10), 4 states have call predecessors, (10), 4 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) Second operand 261 states. [2022-02-21 03:16:48,218 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:16:48,219 INFO L93 Difference]: Finished difference Result 261 states and 322 transitions. [2022-02-21 03:16:48,219 INFO L276 IsEmpty]: Start isEmpty. Operand 261 states and 322 transitions. [2022-02-21 03:16:48,219 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:16:48,219 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:16:48,219 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 03:16:48,220 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 03:16:48,220 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 260 states, 232 states have (on average 1.2974137931034482) internal successors, (301), 246 states have internal predecessors, (301), 10 states have call successors, (10), 4 states have call predecessors, (10), 4 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-02-21 03:16:48,224 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 260 states to 260 states and 321 transitions. [2022-02-21 03:16:48,224 INFO L78 Accepts]: Start accepts. Automaton has 260 states and 321 transitions. Word has length 45 [2022-02-21 03:16:48,225 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-21 03:16:48,225 INFO L470 AbstractCegarLoop]: Abstraction has 260 states and 321 transitions. [2022-02-21 03:16:48,225 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 3 states have internal predecessors, (44), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:16:48,225 INFO L276 IsEmpty]: Start isEmpty. Operand 260 states and 321 transitions. [2022-02-21 03:16:48,226 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2022-02-21 03:16:48,226 INFO L506 BasicCegarLoop]: Found error trace [2022-02-21 03:16:48,226 INFO L514 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-21 03:16:48,247 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-02-21 03:16:48,438 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable2 [2022-02-21 03:16:48,439 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting alt_mallocErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [alt_mallocErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, alt_mallocErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, alt_freeErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2022-02-21 03:16:48,439 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:16:48,439 INFO L85 PathProgramCache]: Analyzing trace with hash 485811060, now seen corresponding path program 1 times [2022-02-21 03:16:48,440 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:16:48,440 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1140000420] [2022-02-21 03:16:48,440 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:16:48,440 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:16:48,461 ERROR L252 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-02-21 03:16:48,462 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1571313181] [2022-02-21 03:16:48,462 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:16:48,462 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-21 03:16:48,462 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:16:48,463 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-02-21 03:16:48,464 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-02-21 03:16:48,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:16:48,628 INFO L263 TraceCheckSpWp]: Trace formula consists of 265 conjuncts, 3 conjunts are in the unsatisfiable core [2022-02-21 03:16:48,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:16:48,652 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 03:16:48,734 INFO L290 TraceCheckUtils]: 0: Hoare triple {4575#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(21, 2);~#alt_malloc_sizes~0.base, ~#alt_malloc_sizes~0.offset := 3, 0;call #Ultimate.allocInit(40, 3);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#alt_malloc_sizes~0.base);~alt_malloc_balance~0 := 0;~alt_memcmp_count~0 := 0;~alt_bzero_count~0 := 0; {4575#true} is VALID [2022-02-21 03:16:48,734 INFO L290 TraceCheckUtils]: 1: Hoare triple {4575#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret43#1.base, main_#t~ret43#1.offset, main_#t~mem44#1, main_#t~mem45#1, main_#t~mem46#1, main_#t~mem48#1, main_#t~mem47#1, main_#t~mem49#1, main_#t~mem50#1, main_#t~mem52#1, main_#t~mem51#1, main_#t~mem53#1, main_#t~mem54#1, main_#t~mem56#1, main_#t~mem55#1, main_#t~mem57#1, main_#t~mem58#1, main_#t~switch59#1, main_#t~mem60#1, main_#t~mem61#1, main_#t~mem62#1, main_#t~mem63#1, main_#t~mem64#1, main_#t~mem65#1, main_#t~mem66#1, main_#t~mem67#1, main_#t~mem68#1, main_#t~mem69#1, main_#t~mem70#1, main_~_hj_i~0#1, main_~_hj_j~0#1, main_~_hj_k~0#1, main_~_hj_key~0#1.base, main_~_hj_key~0#1.offset, main_#t~ret71#1.base, main_#t~ret71#1.offset, main_#t~mem72#1.base, main_#t~mem72#1.offset, main_#t~mem73#1.base, main_#t~mem73#1.offset, main_#t~mem74#1.base, main_#t~mem74#1.offset, main_#t~mem75#1.base, main_#t~mem75#1.offset, main_#t~mem76#1.base, main_#t~mem76#1.offset, main_#t~mem77#1.base, main_#t~mem77#1.offset, main_#t~mem78#1.base, main_#t~mem78#1.offset, main_#t~ret79#1.base, main_#t~ret79#1.offset, main_#t~mem80#1.base, main_#t~mem80#1.offset, main_#t~mem81#1.base, main_#t~mem81#1.offset, main_#t~mem82#1.base, main_#t~mem82#1.offset, main_#t~mem83#1.base, main_#t~mem83#1.offset, main_#t~mem84#1.base, main_#t~mem84#1.offset, main_#t~mem85#1.base, main_#t~mem85#1.offset, main_#t~mem86#1.base, main_#t~mem86#1.offset, main_#t~mem87#1.base, main_#t~mem87#1.offset, main_#t~mem88#1.base, main_#t~mem88#1.offset, main_#t~mem89#1.base, main_#t~mem89#1.offset, main_#t~mem90#1, main_#t~mem91#1.base, main_#t~mem91#1.offset, main_#t~mem92#1.base, main_#t~mem92#1.offset, main_#t~mem93#1.base, main_#t~mem93#1.offset, main_#t~mem94#1.base, main_#t~mem94#1.offset, main_#t~mem95#1, main_#t~post96#1, main_#t~mem97#1.base, main_#t~mem97#1.offset, main_#t~mem98#1, main_#t~mem99#1.base, main_#t~mem99#1.offset, main_#t~mem100#1.base, main_#t~mem100#1.offset, main_#t~mem101#1, main_#t~post102#1, main_#t~mem103#1.base, main_#t~mem103#1.offset, main_#t~mem104#1.base, main_#t~mem104#1.offset, main_#t~mem105#1.base, main_#t~mem105#1.offset, main_#t~mem107#1, main_#t~mem106#1, main_#t~mem108#1.base, main_#t~mem108#1.offset, main_#t~mem109#1, main_#t~short110#1, main_#t~mem111#1.base, main_#t~mem111#1.offset, main_#t~mem112#1, main_#t~ret113#1.base, main_#t~ret113#1.offset, main_#t~mem114#1.base, main_#t~mem114#1.offset, main_#t~mem115#1.base, main_#t~mem115#1.offset, main_#t~mem116#1.base, main_#t~mem116#1.offset, main_#t~mem117#1, main_#t~mem118#1.base, main_#t~mem118#1.offset, main_#t~mem119#1.base, main_#t~mem119#1.offset, main_#t~mem122#1, main_#t~mem120#1.base, main_#t~mem120#1.offset, main_#t~mem121#1, main_#t~mem123#1.base, main_#t~mem123#1.offset, main_#t~mem126#1, main_#t~mem124#1.base, main_#t~mem124#1.offset, main_#t~mem125#1, main_#t~ite127#1, main_#t~mem128#1.base, main_#t~mem128#1.offset, main_#t~mem132#1.base, main_#t~mem132#1.offset, main_#t~mem133#1.base, main_#t~mem133#1.offset, main_#t~mem134#1.base, main_#t~mem134#1.offset, main_#t~mem135#1.base, main_#t~mem135#1.offset, main_#t~mem138#1, main_#t~mem136#1.base, main_#t~mem136#1.offset, main_#t~mem137#1, main_#t~mem139#1.base, main_#t~mem139#1.offset, main_#t~mem140#1, main_#t~pre141#1, main_#t~mem142#1.base, main_#t~mem142#1.offset, main_#t~mem143#1, main_#t~mem144#1.base, main_#t~mem144#1.offset, main_#t~mem145#1, main_#t~post146#1, main_#t~mem150#1, main_#t~mem148#1, main_#t~mem147#1.base, main_#t~mem147#1.offset, main_#t~mem149#1, main_#t~mem151#1, main_#t~post152#1, main_#t~mem153#1.base, main_#t~mem153#1.offset, main_#t~mem154#1.base, main_#t~mem154#1.offset, main_#t~mem155#1.base, main_#t~mem155#1.offset, main_#t~post129#1, main_#t~mem130#1.base, main_#t~mem130#1.offset, main_#t~mem131#1, main_#t~mem156#1.base, main_#t~mem156#1.offset, main_#t~mem157#1.base, main_#t~mem157#1.offset, main_#t~mem158#1.base, main_#t~mem158#1.offset, main_#t~mem159#1, main_#t~mem160#1.base, main_#t~mem160#1.offset, main_#t~mem161#1, main_#t~mem162#1.base, main_#t~mem162#1.offset, main_#t~mem163#1, main_#t~post164#1, main_#t~mem165#1.base, main_#t~mem165#1.offset, main_#t~mem166#1.base, main_#t~mem166#1.offset, main_#t~mem167#1.base, main_#t~mem167#1.offset, main_#t~mem168#1.base, main_#t~mem168#1.offset, main_#t~mem171#1, main_#t~mem169#1.base, main_#t~mem169#1.offset, main_#t~mem170#1, main_#t~ite174#1, main_#t~mem172#1.base, main_#t~mem172#1.offset, main_#t~mem173#1, main_#t~mem175#1.base, main_#t~mem175#1.offset, main_#t~mem176#1, main_#t~mem177#1.base, main_#t~mem177#1.offset, main_~_he_bkt~0#1, main_~_he_bkt_i~0#1, main_~_he_thh~0#1.base, main_~_he_thh~0#1.offset, main_~_he_hh_nxt~0#1.base, main_~_he_hh_nxt~0#1.offset, main_~#_he_new_buckets~0#1.base, main_~#_he_new_buckets~0#1.offset, main_~_he_newbkt~0#1.base, main_~_he_newbkt~0#1.offset, main_~_ha_head~0#1.base, main_~_ha_head~0#1.offset, main_~_ha_bkt~0#1, main_~_ha_hashv~0#1, main_#t~mem40#1, main_#t~post41#1, main_#t~mem42#1, main_#t~mem182#1, main_#t~mem181#1, main_#t~mem183#1, main_#t~mem184#1, main_#t~mem186#1, main_#t~mem185#1, main_#t~mem187#1, main_#t~mem188#1, main_#t~mem190#1, main_#t~mem189#1, main_#t~mem191#1, main_#t~mem192#1, main_#t~switch193#1, main_#t~mem194#1, main_#t~mem195#1, main_#t~mem196#1, main_#t~mem197#1, main_#t~mem198#1, main_#t~mem199#1, main_#t~mem200#1, main_#t~mem201#1, main_#t~mem202#1, main_#t~mem203#1, main_#t~mem204#1, main_~_hj_i~1#1, main_~_hj_j~1#1, main_~_hj_k~1#1, main_~_hj_key~1#1.base, main_~_hj_key~1#1.offset, main_#t~mem205#1.base, main_#t~mem205#1.offset, main_#t~mem206#1, main_#t~mem207#1.base, main_#t~mem207#1.offset, main_#t~mem208#1.base, main_#t~mem208#1.offset, main_#t~mem209#1.base, main_#t~mem209#1.offset, main_#t~mem210#1.base, main_#t~mem210#1.offset, main_#t~mem211#1.base, main_#t~mem211#1.offset, main_#t~mem212#1.base, main_#t~mem212#1.offset, main_#t~mem213#1.base, main_#t~mem213#1.offset, main_#t~mem214#1, main_#t~mem215#1, main_#t~mem216#1, main_#t~short217#1, main_#t~mem218#1.base, main_#t~mem218#1.offset, main_#t~ret219#1, main_#t~mem220#1.base, main_#t~mem220#1.offset, main_#t~mem221#1.base, main_#t~mem221#1.offset, main_#t~mem222#1.base, main_#t~mem222#1.offset, main_#t~mem223#1, main_~_hf_bkt~0#1, main_~_hf_hashv~0#1, main_#t~mem224#1.base, main_#t~mem224#1.offset, main_#t~mem225#1.base, main_#t~mem225#1.offset, main_#t~short226#1, main_#t~mem227#1.base, main_#t~mem227#1.offset, main_#t~mem228#1.base, main_#t~mem228#1.offset, main_#t~mem229#1.base, main_#t~mem229#1.offset, main_#t~mem230#1, main_#t~mem231#1.base, main_#t~mem231#1.offset, main_#t~mem232#1.base, main_#t~mem232#1.offset, main_#t~mem233#1.base, main_#t~mem233#1.offset, main_#t~mem234#1.base, main_#t~mem234#1.offset, main_#t~mem235#1.base, main_#t~mem235#1.offset, main_#t~mem236#1.base, main_#t~mem236#1.offset, main_#t~mem237#1, main_#t~mem238#1.base, main_#t~mem238#1.offset, main_#t~mem239#1.base, main_#t~mem239#1.offset, main_#t~mem240#1.base, main_#t~mem240#1.offset, main_#t~mem241#1, main_#t~mem242#1.base, main_#t~mem242#1.offset, main_#t~mem243#1.base, main_#t~mem243#1.offset, main_#t~mem244#1.base, main_#t~mem244#1.offset, main_#t~mem245#1.base, main_#t~mem245#1.offset, main_#t~mem246#1.base, main_#t~mem246#1.offset, main_#t~mem247#1, main_#t~mem248#1.base, main_#t~mem248#1.offset, main_#t~mem251#1, main_#t~mem249#1.base, main_#t~mem249#1.offset, main_#t~mem250#1, main_#t~mem252#1.base, main_#t~mem252#1.offset, main_#t~mem253#1.base, main_#t~mem253#1.offset, main_#t~mem254#1, main_#t~post255#1, main_#t~mem256#1.base, main_#t~mem256#1.offset, main_#t~mem257#1.base, main_#t~mem257#1.offset, main_#t~mem258#1.base, main_#t~mem258#1.offset, main_#t~mem259#1.base, main_#t~mem259#1.offset, main_#t~mem260#1.base, main_#t~mem260#1.offset, main_#t~mem261#1.base, main_#t~mem261#1.offset, main_#t~mem262#1.base, main_#t~mem262#1.offset, main_#t~mem263#1.base, main_#t~mem263#1.offset, main_~_hd_head~0#1.base, main_~_hd_head~0#1.offset, main_#t~mem264#1.base, main_#t~mem264#1.offset, main_#t~mem265#1, main_#t~post266#1, main_~_hd_bkt~0#1, main_~_hd_hh_del~0#1.base, main_~_hd_hh_del~0#1.offset, main_#t~mem178#1, main_#t~post179#1, main_#t~mem180#1, main_#t~mem267#1.base, main_#t~mem267#1.offset, main_~#i~0#1.base, main_~#i~0#1.offset, main_~user~0#1.base, main_~user~0#1.offset, main_~tmp~0#1.base, main_~tmp~0#1.offset, main_~users~0#1.base, main_~users~0#1.offset;call main_~#i~0#1.base, main_~#i~0#1.offset := #Ultimate.allocOnStack(4);havoc main_~user~0#1.base, main_~user~0#1.offset;havoc main_~tmp~0#1.base, main_~tmp~0#1.offset;main_~users~0#1.base, main_~users~0#1.offset := 0, 0;call write~int(0, main_~#i~0#1.base, main_~#i~0#1.offset, 4); {4575#true} is VALID [2022-02-21 03:16:48,735 INFO L290 TraceCheckUtils]: 2: Hoare triple {4575#true} call main_#t~mem42#1 := read~int(main_~#i~0#1.base, main_~#i~0#1.offset, 4); {4575#true} is VALID [2022-02-21 03:16:48,735 INFO L290 TraceCheckUtils]: 3: Hoare triple {4575#true} assume !!(main_#t~mem42#1 < 10);havoc main_#t~mem42#1;assume { :begin_inline_real_malloc } true;real_malloc_#in~n#1 := 40;havoc real_malloc_#res#1.base, real_malloc_#res#1.offset;havoc real_malloc_#t~malloc39#1.base, real_malloc_#t~malloc39#1.offset, real_malloc_~n#1;real_malloc_~n#1 := real_malloc_#in~n#1;call real_malloc_#t~malloc39#1.base, real_malloc_#t~malloc39#1.offset := #Ultimate.allocOnHeap(real_malloc_~n#1);real_malloc_#res#1.base, real_malloc_#res#1.offset := real_malloc_#t~malloc39#1.base, real_malloc_#t~malloc39#1.offset;havoc real_malloc_#t~malloc39#1.base, real_malloc_#t~malloc39#1.offset; {4575#true} is VALID [2022-02-21 03:16:48,736 INFO L290 TraceCheckUtils]: 4: Hoare triple {4575#true} main_#t~ret43#1.base, main_#t~ret43#1.offset := real_malloc_#res#1.base, real_malloc_#res#1.offset;assume { :end_inline_real_malloc } true;main_~user~0#1.base, main_~user~0#1.offset := main_#t~ret43#1.base, main_#t~ret43#1.offset;havoc main_#t~ret43#1.base, main_#t~ret43#1.offset; {4575#true} is VALID [2022-02-21 03:16:48,737 INFO L290 TraceCheckUtils]: 5: Hoare triple {4575#true} assume !(main_~user~0#1.base == 0 && main_~user~0#1.offset == 0); {4575#true} is VALID [2022-02-21 03:16:48,737 INFO L290 TraceCheckUtils]: 6: Hoare triple {4575#true} call main_#t~mem44#1 := read~int(main_~#i~0#1.base, main_~#i~0#1.offset, 4);call write~int(main_#t~mem44#1, main_~user~0#1.base, main_~user~0#1.offset, 4);havoc main_#t~mem44#1;call main_#t~mem45#1 := read~int(main_~#i~0#1.base, main_~#i~0#1.offset, 4);call main_#t~mem46#1 := read~int(main_~#i~0#1.base, main_~#i~0#1.offset, 4); {4575#true} is VALID [2022-02-21 03:16:48,737 INFO L290 TraceCheckUtils]: 7: Hoare triple {4575#true} assume main_#t~mem45#1 * main_#t~mem46#1 <= 2147483647; {4575#true} is VALID [2022-02-21 03:16:48,737 INFO L290 TraceCheckUtils]: 8: Hoare triple {4575#true} assume main_#t~mem45#1 * main_#t~mem46#1 >= -2147483648;call write~int(main_#t~mem45#1 * main_#t~mem46#1, main_~user~0#1.base, 4 + main_~user~0#1.offset, 4);havoc main_#t~mem45#1;havoc main_#t~mem46#1; {4575#true} is VALID [2022-02-21 03:16:48,737 INFO L290 TraceCheckUtils]: 9: Hoare triple {4575#true} havoc main_~_ha_hashv~0#1; {4575#true} is VALID [2022-02-21 03:16:48,738 INFO L290 TraceCheckUtils]: 10: Hoare triple {4575#true} goto; {4575#true} is VALID [2022-02-21 03:16:48,739 INFO L290 TraceCheckUtils]: 11: Hoare triple {4575#true} havoc main_~_hj_i~0#1;havoc main_~_hj_j~0#1;havoc main_~_hj_k~0#1;main_~_hj_key~0#1.base, main_~_hj_key~0#1.offset := main_~user~0#1.base, main_~user~0#1.offset;main_~_ha_hashv~0#1 := 4276993775;main_~_hj_j~0#1 := 2654435769;main_~_hj_i~0#1 := main_~_hj_j~0#1;main_~_hj_k~0#1 := 4; {4613#(<= |ULTIMATE.start_main_~_hj_k~0#1| 4)} is VALID [2022-02-21 03:16:48,739 INFO L290 TraceCheckUtils]: 12: Hoare triple {4613#(<= |ULTIMATE.start_main_~_hj_k~0#1| 4)} assume !(main_~_hj_k~0#1 % 4294967296 >= 12); {4613#(<= |ULTIMATE.start_main_~_hj_k~0#1| 4)} is VALID [2022-02-21 03:16:48,739 INFO L290 TraceCheckUtils]: 13: Hoare triple {4613#(<= |ULTIMATE.start_main_~_hj_k~0#1| 4)} main_~_ha_hashv~0#1 := 4 + main_~_ha_hashv~0#1;main_#t~switch59#1 := 11 == main_~_hj_k~0#1; {4620#(not |ULTIMATE.start_main_#t~switch59#1|)} is VALID [2022-02-21 03:16:48,740 INFO L290 TraceCheckUtils]: 14: Hoare triple {4620#(not |ULTIMATE.start_main_#t~switch59#1|)} assume main_#t~switch59#1;call main_#t~mem60#1 := read~int(main_~_hj_key~0#1.base, 10 + main_~_hj_key~0#1.offset, 1);main_~_ha_hashv~0#1 := main_~_ha_hashv~0#1 + 16777216 * (main_#t~mem60#1 % 256);havoc main_#t~mem60#1; {4576#false} is VALID [2022-02-21 03:16:48,740 INFO L290 TraceCheckUtils]: 15: Hoare triple {4576#false} main_#t~switch59#1 := main_#t~switch59#1 || 10 == main_~_hj_k~0#1; {4576#false} is VALID [2022-02-21 03:16:48,740 INFO L290 TraceCheckUtils]: 16: Hoare triple {4576#false} assume main_#t~switch59#1;call main_#t~mem61#1 := read~int(main_~_hj_key~0#1.base, 9 + main_~_hj_key~0#1.offset, 1);main_~_ha_hashv~0#1 := main_~_ha_hashv~0#1 + 65536 * (main_#t~mem61#1 % 256);havoc main_#t~mem61#1; {4576#false} is VALID [2022-02-21 03:16:48,740 INFO L290 TraceCheckUtils]: 17: Hoare triple {4576#false} main_#t~switch59#1 := main_#t~switch59#1 || 9 == main_~_hj_k~0#1; {4576#false} is VALID [2022-02-21 03:16:48,740 INFO L290 TraceCheckUtils]: 18: Hoare triple {4576#false} assume main_#t~switch59#1;call main_#t~mem62#1 := read~int(main_~_hj_key~0#1.base, 8 + main_~_hj_key~0#1.offset, 1);main_~_ha_hashv~0#1 := main_~_ha_hashv~0#1 + 256 * (main_#t~mem62#1 % 256);havoc main_#t~mem62#1; {4576#false} is VALID [2022-02-21 03:16:48,741 INFO L290 TraceCheckUtils]: 19: Hoare triple {4576#false} main_#t~switch59#1 := main_#t~switch59#1 || 8 == main_~_hj_k~0#1; {4576#false} is VALID [2022-02-21 03:16:48,741 INFO L290 TraceCheckUtils]: 20: Hoare triple {4576#false} assume main_#t~switch59#1;call main_#t~mem63#1 := read~int(main_~_hj_key~0#1.base, 7 + main_~_hj_key~0#1.offset, 1);main_~_hj_j~0#1 := main_~_hj_j~0#1 + 16777216 * (main_#t~mem63#1 % 256);havoc main_#t~mem63#1; {4576#false} is VALID [2022-02-21 03:16:48,741 INFO L290 TraceCheckUtils]: 21: Hoare triple {4576#false} main_#t~switch59#1 := main_#t~switch59#1 || 7 == main_~_hj_k~0#1; {4576#false} is VALID [2022-02-21 03:16:48,741 INFO L290 TraceCheckUtils]: 22: Hoare triple {4576#false} assume main_#t~switch59#1;call main_#t~mem64#1 := read~int(main_~_hj_key~0#1.base, 6 + main_~_hj_key~0#1.offset, 1);main_~_hj_j~0#1 := main_~_hj_j~0#1 + 65536 * (main_#t~mem64#1 % 256);havoc main_#t~mem64#1; {4576#false} is VALID [2022-02-21 03:16:48,741 INFO L290 TraceCheckUtils]: 23: Hoare triple {4576#false} main_#t~switch59#1 := main_#t~switch59#1 || 6 == main_~_hj_k~0#1; {4576#false} is VALID [2022-02-21 03:16:48,742 INFO L290 TraceCheckUtils]: 24: Hoare triple {4576#false} assume main_#t~switch59#1;call main_#t~mem65#1 := read~int(main_~_hj_key~0#1.base, 5 + main_~_hj_key~0#1.offset, 1);main_~_hj_j~0#1 := main_~_hj_j~0#1 + 256 * (main_#t~mem65#1 % 256);havoc main_#t~mem65#1; {4576#false} is VALID [2022-02-21 03:16:48,742 INFO L290 TraceCheckUtils]: 25: Hoare triple {4576#false} main_#t~switch59#1 := main_#t~switch59#1 || 5 == main_~_hj_k~0#1; {4576#false} is VALID [2022-02-21 03:16:48,742 INFO L290 TraceCheckUtils]: 26: Hoare triple {4576#false} assume main_#t~switch59#1;call main_#t~mem66#1 := read~int(main_~_hj_key~0#1.base, 4 + main_~_hj_key~0#1.offset, 1);main_~_hj_j~0#1 := main_~_hj_j~0#1 + main_#t~mem66#1 % 256;havoc main_#t~mem66#1; {4576#false} is VALID [2022-02-21 03:16:48,742 INFO L290 TraceCheckUtils]: 27: Hoare triple {4576#false} main_#t~switch59#1 := main_#t~switch59#1 || 4 == main_~_hj_k~0#1; {4576#false} is VALID [2022-02-21 03:16:48,742 INFO L290 TraceCheckUtils]: 28: Hoare triple {4576#false} assume main_#t~switch59#1;call main_#t~mem67#1 := read~int(main_~_hj_key~0#1.base, 3 + main_~_hj_key~0#1.offset, 1);main_~_hj_i~0#1 := main_~_hj_i~0#1 + 16777216 * (main_#t~mem67#1 % 256);havoc main_#t~mem67#1; {4576#false} is VALID [2022-02-21 03:16:48,742 INFO L290 TraceCheckUtils]: 29: Hoare triple {4576#false} main_#t~switch59#1 := main_#t~switch59#1 || 3 == main_~_hj_k~0#1; {4576#false} is VALID [2022-02-21 03:16:48,743 INFO L290 TraceCheckUtils]: 30: Hoare triple {4576#false} assume main_#t~switch59#1;call main_#t~mem68#1 := read~int(main_~_hj_key~0#1.base, 2 + main_~_hj_key~0#1.offset, 1);main_~_hj_i~0#1 := main_~_hj_i~0#1 + 65536 * (main_#t~mem68#1 % 256);havoc main_#t~mem68#1; {4576#false} is VALID [2022-02-21 03:16:48,743 INFO L290 TraceCheckUtils]: 31: Hoare triple {4576#false} main_#t~switch59#1 := main_#t~switch59#1 || 2 == main_~_hj_k~0#1; {4576#false} is VALID [2022-02-21 03:16:48,743 INFO L290 TraceCheckUtils]: 32: Hoare triple {4576#false} assume main_#t~switch59#1;call main_#t~mem69#1 := read~int(main_~_hj_key~0#1.base, 1 + main_~_hj_key~0#1.offset, 1);main_~_hj_i~0#1 := main_~_hj_i~0#1 + 256 * (main_#t~mem69#1 % 256);havoc main_#t~mem69#1; {4576#false} is VALID [2022-02-21 03:16:48,743 INFO L290 TraceCheckUtils]: 33: Hoare triple {4576#false} main_#t~switch59#1 := main_#t~switch59#1 || 1 == main_~_hj_k~0#1; {4576#false} is VALID [2022-02-21 03:16:48,743 INFO L290 TraceCheckUtils]: 34: Hoare triple {4576#false} assume main_#t~switch59#1;call main_#t~mem70#1 := read~int(main_~_hj_key~0#1.base, main_~_hj_key~0#1.offset, 1);main_~_hj_i~0#1 := main_~_hj_i~0#1 + main_#t~mem70#1 % 256;havoc main_#t~mem70#1; {4576#false} is VALID [2022-02-21 03:16:48,743 INFO L290 TraceCheckUtils]: 35: Hoare triple {4576#false} havoc main_#t~switch59#1; {4576#false} is VALID [2022-02-21 03:16:48,744 INFO L290 TraceCheckUtils]: 36: Hoare triple {4576#false} main_~_hj_i~0#1 := main_~_hj_i~0#1 - main_~_hj_j~0#1;main_~_hj_i~0#1 := main_~_hj_i~0#1 - main_~_ha_hashv~0#1;main_~_hj_i~0#1 := (if (1 == main_~_hj_i~0#1 || 0 == main_~_hj_i~0#1) && (1 == main_~_ha_hashv~0#1 / 8192 || 0 == main_~_ha_hashv~0#1 / 8192) then (if main_~_hj_i~0#1 == main_~_ha_hashv~0#1 / 8192 then 0 else 1) else (if 0 == main_~_hj_i~0#1 then main_~_ha_hashv~0#1 / 8192 else (if 0 == main_~_ha_hashv~0#1 / 8192 then main_~_hj_i~0#1 else ~bitwiseXOr(main_~_hj_i~0#1, main_~_ha_hashv~0#1 / 8192))));main_~_hj_j~0#1 := main_~_hj_j~0#1 - main_~_ha_hashv~0#1;main_~_hj_j~0#1 := main_~_hj_j~0#1 - main_~_hj_i~0#1;main_~_hj_j~0#1 := (if (1 == main_~_hj_j~0#1 || 0 == main_~_hj_j~0#1) && (1 == 256 * main_~_hj_i~0#1 || 0 == 256 * main_~_hj_i~0#1) then (if main_~_hj_j~0#1 == 256 * main_~_hj_i~0#1 then 0 else 1) else (if 0 == main_~_hj_j~0#1 then 256 * main_~_hj_i~0#1 else (if 0 == 256 * main_~_hj_i~0#1 then main_~_hj_j~0#1 else ~bitwiseXOr(main_~_hj_j~0#1, 256 * main_~_hj_i~0#1))));main_~_ha_hashv~0#1 := main_~_ha_hashv~0#1 - main_~_hj_i~0#1;main_~_ha_hashv~0#1 := main_~_ha_hashv~0#1 - main_~_hj_j~0#1;main_~_ha_hashv~0#1 := (if (1 == main_~_ha_hashv~0#1 || 0 == main_~_ha_hashv~0#1) && (1 == main_~_hj_j~0#1 / 8192 || 0 == main_~_hj_j~0#1 / 8192) then (if main_~_ha_hashv~0#1 == main_~_hj_j~0#1 / 8192 then 0 else 1) else (if 0 == main_~_ha_hashv~0#1 then main_~_hj_j~0#1 / 8192 else (if 0 == main_~_hj_j~0#1 / 8192 then main_~_ha_hashv~0#1 else ~bitwiseXOr(main_~_ha_hashv~0#1, main_~_hj_j~0#1 / 8192))));main_~_hj_i~0#1 := main_~_hj_i~0#1 - main_~_hj_j~0#1;main_~_hj_i~0#1 := main_~_hj_i~0#1 - main_~_ha_hashv~0#1;main_~_hj_i~0#1 := (if (1 == main_~_hj_i~0#1 || 0 == main_~_hj_i~0#1) && (1 == main_~_ha_hashv~0#1 / 4096 || 0 == main_~_ha_hashv~0#1 / 4096) then (if main_~_hj_i~0#1 == main_~_ha_hashv~0#1 / 4096 then 0 else 1) else (if 0 == main_~_hj_i~0#1 then main_~_ha_hashv~0#1 / 4096 else (if 0 == main_~_ha_hashv~0#1 / 4096 then main_~_hj_i~0#1 else ~bitwiseXOr(main_~_hj_i~0#1, main_~_ha_hashv~0#1 / 4096))));main_~_hj_j~0#1 := main_~_hj_j~0#1 - main_~_ha_hashv~0#1;main_~_hj_j~0#1 := main_~_hj_j~0#1 - main_~_hj_i~0#1;main_~_hj_j~0#1 := (if (1 == main_~_hj_j~0#1 || 0 == main_~_hj_j~0#1) && (1 == 65536 * main_~_hj_i~0#1 || 0 == 65536 * main_~_hj_i~0#1) then (if main_~_hj_j~0#1 == 65536 * main_~_hj_i~0#1 then 0 else 1) else (if 0 == main_~_hj_j~0#1 then 65536 * main_~_hj_i~0#1 else (if 0 == 65536 * main_~_hj_i~0#1 then main_~_hj_j~0#1 else ~bitwiseXOr(main_~_hj_j~0#1, 65536 * main_~_hj_i~0#1))));main_~_ha_hashv~0#1 := main_~_ha_hashv~0#1 - main_~_hj_i~0#1;main_~_ha_hashv~0#1 := main_~_ha_hashv~0#1 - main_~_hj_j~0#1;main_~_ha_hashv~0#1 := (if (1 == main_~_ha_hashv~0#1 || 0 == main_~_ha_hashv~0#1) && (1 == main_~_hj_j~0#1 / 32 || 0 == main_~_hj_j~0#1 / 32) then (if main_~_ha_hashv~0#1 == main_~_hj_j~0#1 / 32 then 0 else 1) else (if 0 == main_~_ha_hashv~0#1 then main_~_hj_j~0#1 / 32 else (if 0 == main_~_hj_j~0#1 / 32 then main_~_ha_hashv~0#1 else ~bitwiseXOr(main_~_ha_hashv~0#1, main_~_hj_j~0#1 / 32))));main_~_hj_i~0#1 := main_~_hj_i~0#1 - main_~_hj_j~0#1;main_~_hj_i~0#1 := main_~_hj_i~0#1 - main_~_ha_hashv~0#1;main_~_hj_i~0#1 := (if (1 == main_~_hj_i~0#1 || 0 == main_~_hj_i~0#1) && (1 == main_~_ha_hashv~0#1 / 8 || 0 == main_~_ha_hashv~0#1 / 8) then (if main_~_hj_i~0#1 == main_~_ha_hashv~0#1 / 8 then 0 else 1) else (if 0 == main_~_hj_i~0#1 then main_~_ha_hashv~0#1 / 8 else (if 0 == main_~_ha_hashv~0#1 / 8 then main_~_hj_i~0#1 else ~bitwiseXOr(main_~_hj_i~0#1, main_~_ha_hashv~0#1 / 8))));main_~_hj_j~0#1 := main_~_hj_j~0#1 - main_~_ha_hashv~0#1;main_~_hj_j~0#1 := main_~_hj_j~0#1 - main_~_hj_i~0#1;main_~_hj_j~0#1 := (if (1 == main_~_hj_j~0#1 || 0 == main_~_hj_j~0#1) && (1 == 1024 * main_~_hj_i~0#1 || 0 == 1024 * main_~_hj_i~0#1) then (if main_~_hj_j~0#1 == 1024 * main_~_hj_i~0#1 then 0 else 1) else (if 0 == main_~_hj_j~0#1 then 1024 * main_~_hj_i~0#1 else (if 0 == 1024 * main_~_hj_i~0#1 then main_~_hj_j~0#1 else ~bitwiseXOr(main_~_hj_j~0#1, 1024 * main_~_hj_i~0#1))));main_~_ha_hashv~0#1 := main_~_ha_hashv~0#1 - main_~_hj_i~0#1;main_~_ha_hashv~0#1 := main_~_ha_hashv~0#1 - main_~_hj_j~0#1;main_~_ha_hashv~0#1 := (if (1 == main_~_ha_hashv~0#1 || 0 == main_~_ha_hashv~0#1) && (1 == main_~_hj_j~0#1 / 32768 || 0 == main_~_hj_j~0#1 / 32768) then (if main_~_ha_hashv~0#1 == main_~_hj_j~0#1 / 32768 then 0 else 1) else (if 0 == main_~_ha_hashv~0#1 then main_~_hj_j~0#1 / 32768 else (if 0 == main_~_hj_j~0#1 / 32768 then main_~_ha_hashv~0#1 else ~bitwiseXOr(main_~_ha_hashv~0#1, main_~_hj_j~0#1 / 32768)))); {4576#false} is VALID [2022-02-21 03:16:48,744 INFO L290 TraceCheckUtils]: 37: Hoare triple {4576#false} goto; {4576#false} is VALID [2022-02-21 03:16:48,744 INFO L290 TraceCheckUtils]: 38: Hoare triple {4576#false} goto; {4576#false} is VALID [2022-02-21 03:16:48,744 INFO L290 TraceCheckUtils]: 39: Hoare triple {4576#false} goto; {4576#false} is VALID [2022-02-21 03:16:48,744 INFO L290 TraceCheckUtils]: 40: Hoare triple {4576#false} call write~int(main_~_ha_hashv~0#1, main_~user~0#1.base, 36 + main_~user~0#1.offset, 4);call write~$Pointer$(main_~user~0#1.base, main_~user~0#1.offset, main_~user~0#1.base, 28 + main_~user~0#1.offset, 4);call write~int(4, main_~user~0#1.base, 32 + main_~user~0#1.offset, 4); {4576#false} is VALID [2022-02-21 03:16:48,744 INFO L290 TraceCheckUtils]: 41: Hoare triple {4576#false} assume main_~users~0#1.base == 0 && main_~users~0#1.offset == 0;call write~$Pointer$(0, 0, main_~user~0#1.base, 16 + main_~user~0#1.offset, 4);call write~$Pointer$(0, 0, main_~user~0#1.base, 12 + main_~user~0#1.offset, 4); {4576#false} is VALID [2022-02-21 03:16:48,745 INFO L272 TraceCheckUtils]: 42: Hoare triple {4576#false} call main_#t~ret71#1.base, main_#t~ret71#1.offset := alt_malloc(44); {4576#false} is VALID [2022-02-21 03:16:48,745 INFO L290 TraceCheckUtils]: 43: Hoare triple {4576#false} ~sz := #in~sz;#t~post31 := ~alt_malloc_balance~0; {4576#false} is VALID [2022-02-21 03:16:48,745 INFO L290 TraceCheckUtils]: 44: Hoare triple {4576#false} assume !(1 + #t~post31 <= 2147483647); {4576#false} is VALID [2022-02-21 03:16:48,745 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-21 03:16:48,745 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-21 03:16:48,746 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 03:16:48,746 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1140000420] [2022-02-21 03:16:48,746 WARN L317 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-02-21 03:16:48,746 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1571313181] [2022-02-21 03:16:48,746 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1571313181] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-21 03:16:48,746 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-21 03:16:48,746 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-02-21 03:16:48,747 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [157375424] [2022-02-21 03:16:48,747 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-21 03:16:48,747 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.0) internal successors, (44), 4 states have internal predecessors, (44), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 45 [2022-02-21 03:16:48,747 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-21 03:16:48,748 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 11.0) internal successors, (44), 4 states have internal predecessors, (44), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:16:48,777 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 45 edges. 45 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:16:48,777 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-02-21 03:16:48,777 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 03:16:48,778 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-02-21 03:16:48,778 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-02-21 03:16:48,778 INFO L87 Difference]: Start difference. First operand 260 states and 321 transitions. Second operand has 4 states, 4 states have (on average 11.0) internal successors, (44), 4 states have internal predecessors, (44), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:16:49,542 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:16:49,543 INFO L93 Difference]: Finished difference Result 596 states and 746 transitions. [2022-02-21 03:16:49,543 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-02-21 03:16:49,543 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.0) internal successors, (44), 4 states have internal predecessors, (44), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 45 [2022-02-21 03:16:49,544 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-21 03:16:49,544 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 11.0) internal successors, (44), 4 states have internal predecessors, (44), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:16:49,549 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 723 transitions. [2022-02-21 03:16:49,549 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 11.0) internal successors, (44), 4 states have internal predecessors, (44), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:16:49,553 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 723 transitions. [2022-02-21 03:16:49,553 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 723 transitions. [2022-02-21 03:16:50,056 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 723 edges. 723 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:16:50,061 INFO L225 Difference]: With dead ends: 596 [2022-02-21 03:16:50,062 INFO L226 Difference]: Without dead ends: 345 [2022-02-21 03:16:50,063 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-02-21 03:16:50,067 INFO L933 BasicCegarLoop]: 401 mSDtfsCounter, 232 mSDsluCounter, 565 mSDsCounter, 0 mSdLazyCounter, 42 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 241 SdHoareTripleChecker+Valid, 966 SdHoareTripleChecker+Invalid, 66 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 42 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-21 03:16:50,068 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [241 Valid, 966 Invalid, 66 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 42 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-21 03:16:50,070 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 345 states. [2022-02-21 03:16:50,094 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 345 to 246. [2022-02-21 03:16:50,095 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 03:16:50,095 INFO L82 GeneralOperation]: Start isEquivalent. First operand 345 states. Second operand has 246 states, 218 states have (on average 1.2844036697247707) internal successors, (280), 232 states have internal predecessors, (280), 10 states have call successors, (10), 4 states have call predecessors, (10), 4 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-02-21 03:16:50,096 INFO L74 IsIncluded]: Start isIncluded. First operand 345 states. Second operand has 246 states, 218 states have (on average 1.2844036697247707) internal successors, (280), 232 states have internal predecessors, (280), 10 states have call successors, (10), 4 states have call predecessors, (10), 4 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-02-21 03:16:50,096 INFO L87 Difference]: Start difference. First operand 345 states. Second operand has 246 states, 218 states have (on average 1.2844036697247707) internal successors, (280), 232 states have internal predecessors, (280), 10 states have call successors, (10), 4 states have call predecessors, (10), 4 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-02-21 03:16:50,102 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:16:50,102 INFO L93 Difference]: Finished difference Result 345 states and 428 transitions. [2022-02-21 03:16:50,103 INFO L276 IsEmpty]: Start isEmpty. Operand 345 states and 428 transitions. [2022-02-21 03:16:50,103 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:16:50,103 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:16:50,105 INFO L74 IsIncluded]: Start isIncluded. First operand has 246 states, 218 states have (on average 1.2844036697247707) internal successors, (280), 232 states have internal predecessors, (280), 10 states have call successors, (10), 4 states have call predecessors, (10), 4 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) Second operand 345 states. [2022-02-21 03:16:50,107 INFO L87 Difference]: Start difference. First operand has 246 states, 218 states have (on average 1.2844036697247707) internal successors, (280), 232 states have internal predecessors, (280), 10 states have call successors, (10), 4 states have call predecessors, (10), 4 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) Second operand 345 states. [2022-02-21 03:16:50,115 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:16:50,115 INFO L93 Difference]: Finished difference Result 345 states and 428 transitions. [2022-02-21 03:16:50,115 INFO L276 IsEmpty]: Start isEmpty. Operand 345 states and 428 transitions. [2022-02-21 03:16:50,116 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:16:50,116 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:16:50,116 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 03:16:50,116 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 03:16:50,117 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 246 states, 218 states have (on average 1.2844036697247707) internal successors, (280), 232 states have internal predecessors, (280), 10 states have call successors, (10), 4 states have call predecessors, (10), 4 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-02-21 03:16:50,120 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 246 states to 246 states and 300 transitions. [2022-02-21 03:16:50,120 INFO L78 Accepts]: Start accepts. Automaton has 246 states and 300 transitions. Word has length 45 [2022-02-21 03:16:50,121 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-21 03:16:50,122 INFO L470 AbstractCegarLoop]: Abstraction has 246 states and 300 transitions. [2022-02-21 03:16:50,122 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.0) internal successors, (44), 4 states have internal predecessors, (44), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:16:50,122 INFO L276 IsEmpty]: Start isEmpty. Operand 246 states and 300 transitions. [2022-02-21 03:16:50,123 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2022-02-21 03:16:50,123 INFO L506 BasicCegarLoop]: Found error trace [2022-02-21 03:16:50,124 INFO L514 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-21 03:16:50,143 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-02-21 03:16:50,340 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-21 03:16:50,341 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting alt_mallocErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [alt_mallocErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, alt_mallocErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, alt_freeErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2022-02-21 03:16:50,341 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:16:50,341 INFO L85 PathProgramCache]: Analyzing trace with hash 1565710722, now seen corresponding path program 1 times [2022-02-21 03:16:50,341 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:16:50,341 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1206708628] [2022-02-21 03:16:50,342 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:16:50,342 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:16:50,375 ERROR L252 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-02-21 03:16:50,378 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1862839406] [2022-02-21 03:16:50,379 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:16:50,379 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-21 03:16:50,379 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:16:50,384 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-02-21 03:16:50,411 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-02-21 03:16:50,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:16:50,544 INFO L263 TraceCheckSpWp]: Trace formula consists of 251 conjuncts, 5 conjunts are in the unsatisfiable core [2022-02-21 03:16:50,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:16:50,574 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 03:16:50,739 INFO L290 TraceCheckUtils]: 0: Hoare triple {6399#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(21, 2);~#alt_malloc_sizes~0.base, ~#alt_malloc_sizes~0.offset := 3, 0;call #Ultimate.allocInit(40, 3);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#alt_malloc_sizes~0.base);~alt_malloc_balance~0 := 0;~alt_memcmp_count~0 := 0;~alt_bzero_count~0 := 0; {6404#(<= ~alt_malloc_balance~0 0)} is VALID [2022-02-21 03:16:50,741 INFO L290 TraceCheckUtils]: 1: Hoare triple {6404#(<= ~alt_malloc_balance~0 0)} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret43#1.base, main_#t~ret43#1.offset, main_#t~mem44#1, main_#t~mem45#1, main_#t~mem46#1, main_#t~mem48#1, main_#t~mem47#1, main_#t~mem49#1, main_#t~mem50#1, main_#t~mem52#1, main_#t~mem51#1, main_#t~mem53#1, main_#t~mem54#1, main_#t~mem56#1, main_#t~mem55#1, main_#t~mem57#1, main_#t~mem58#1, main_#t~switch59#1, main_#t~mem60#1, main_#t~mem61#1, main_#t~mem62#1, main_#t~mem63#1, main_#t~mem64#1, main_#t~mem65#1, main_#t~mem66#1, main_#t~mem67#1, main_#t~mem68#1, main_#t~mem69#1, main_#t~mem70#1, main_~_hj_i~0#1, main_~_hj_j~0#1, main_~_hj_k~0#1, main_~_hj_key~0#1.base, main_~_hj_key~0#1.offset, main_#t~ret71#1.base, main_#t~ret71#1.offset, main_#t~mem72#1.base, main_#t~mem72#1.offset, main_#t~mem73#1.base, main_#t~mem73#1.offset, main_#t~mem74#1.base, main_#t~mem74#1.offset, main_#t~mem75#1.base, main_#t~mem75#1.offset, main_#t~mem76#1.base, main_#t~mem76#1.offset, main_#t~mem77#1.base, main_#t~mem77#1.offset, main_#t~mem78#1.base, main_#t~mem78#1.offset, main_#t~ret79#1.base, main_#t~ret79#1.offset, main_#t~mem80#1.base, main_#t~mem80#1.offset, main_#t~mem81#1.base, main_#t~mem81#1.offset, main_#t~mem82#1.base, main_#t~mem82#1.offset, main_#t~mem83#1.base, main_#t~mem83#1.offset, main_#t~mem84#1.base, main_#t~mem84#1.offset, main_#t~mem85#1.base, main_#t~mem85#1.offset, main_#t~mem86#1.base, main_#t~mem86#1.offset, main_#t~mem87#1.base, main_#t~mem87#1.offset, main_#t~mem88#1.base, main_#t~mem88#1.offset, main_#t~mem89#1.base, main_#t~mem89#1.offset, main_#t~mem90#1, main_#t~mem91#1.base, main_#t~mem91#1.offset, main_#t~mem92#1.base, main_#t~mem92#1.offset, main_#t~mem93#1.base, main_#t~mem93#1.offset, main_#t~mem94#1.base, main_#t~mem94#1.offset, main_#t~mem95#1, main_#t~post96#1, main_#t~mem97#1.base, main_#t~mem97#1.offset, main_#t~mem98#1, main_#t~mem99#1.base, main_#t~mem99#1.offset, main_#t~mem100#1.base, main_#t~mem100#1.offset, main_#t~mem101#1, main_#t~post102#1, main_#t~mem103#1.base, main_#t~mem103#1.offset, main_#t~mem104#1.base, main_#t~mem104#1.offset, main_#t~mem105#1.base, main_#t~mem105#1.offset, main_#t~mem107#1, main_#t~mem106#1, main_#t~mem108#1.base, main_#t~mem108#1.offset, main_#t~mem109#1, main_#t~short110#1, main_#t~mem111#1.base, main_#t~mem111#1.offset, main_#t~mem112#1, main_#t~ret113#1.base, main_#t~ret113#1.offset, main_#t~mem114#1.base, main_#t~mem114#1.offset, main_#t~mem115#1.base, main_#t~mem115#1.offset, main_#t~mem116#1.base, main_#t~mem116#1.offset, main_#t~mem117#1, main_#t~mem118#1.base, main_#t~mem118#1.offset, main_#t~mem119#1.base, main_#t~mem119#1.offset, main_#t~mem122#1, main_#t~mem120#1.base, main_#t~mem120#1.offset, main_#t~mem121#1, main_#t~mem123#1.base, main_#t~mem123#1.offset, main_#t~mem126#1, main_#t~mem124#1.base, main_#t~mem124#1.offset, main_#t~mem125#1, main_#t~ite127#1, main_#t~mem128#1.base, main_#t~mem128#1.offset, main_#t~mem132#1.base, main_#t~mem132#1.offset, main_#t~mem133#1.base, main_#t~mem133#1.offset, main_#t~mem134#1.base, main_#t~mem134#1.offset, main_#t~mem135#1.base, main_#t~mem135#1.offset, main_#t~mem138#1, main_#t~mem136#1.base, main_#t~mem136#1.offset, main_#t~mem137#1, main_#t~mem139#1.base, main_#t~mem139#1.offset, main_#t~mem140#1, main_#t~pre141#1, main_#t~mem142#1.base, main_#t~mem142#1.offset, main_#t~mem143#1, main_#t~mem144#1.base, main_#t~mem144#1.offset, main_#t~mem145#1, main_#t~post146#1, main_#t~mem150#1, main_#t~mem148#1, main_#t~mem147#1.base, main_#t~mem147#1.offset, main_#t~mem149#1, main_#t~mem151#1, main_#t~post152#1, main_#t~mem153#1.base, main_#t~mem153#1.offset, main_#t~mem154#1.base, main_#t~mem154#1.offset, main_#t~mem155#1.base, main_#t~mem155#1.offset, main_#t~post129#1, main_#t~mem130#1.base, main_#t~mem130#1.offset, main_#t~mem131#1, main_#t~mem156#1.base, main_#t~mem156#1.offset, main_#t~mem157#1.base, main_#t~mem157#1.offset, main_#t~mem158#1.base, main_#t~mem158#1.offset, main_#t~mem159#1, main_#t~mem160#1.base, main_#t~mem160#1.offset, main_#t~mem161#1, main_#t~mem162#1.base, main_#t~mem162#1.offset, main_#t~mem163#1, main_#t~post164#1, main_#t~mem165#1.base, main_#t~mem165#1.offset, main_#t~mem166#1.base, main_#t~mem166#1.offset, main_#t~mem167#1.base, main_#t~mem167#1.offset, main_#t~mem168#1.base, main_#t~mem168#1.offset, main_#t~mem171#1, main_#t~mem169#1.base, main_#t~mem169#1.offset, main_#t~mem170#1, main_#t~ite174#1, main_#t~mem172#1.base, main_#t~mem172#1.offset, main_#t~mem173#1, main_#t~mem175#1.base, main_#t~mem175#1.offset, main_#t~mem176#1, main_#t~mem177#1.base, main_#t~mem177#1.offset, main_~_he_bkt~0#1, main_~_he_bkt_i~0#1, main_~_he_thh~0#1.base, main_~_he_thh~0#1.offset, main_~_he_hh_nxt~0#1.base, main_~_he_hh_nxt~0#1.offset, main_~#_he_new_buckets~0#1.base, main_~#_he_new_buckets~0#1.offset, main_~_he_newbkt~0#1.base, main_~_he_newbkt~0#1.offset, main_~_ha_head~0#1.base, main_~_ha_head~0#1.offset, main_~_ha_bkt~0#1, main_~_ha_hashv~0#1, main_#t~mem40#1, main_#t~post41#1, main_#t~mem42#1, main_#t~mem182#1, main_#t~mem181#1, main_#t~mem183#1, main_#t~mem184#1, main_#t~mem186#1, main_#t~mem185#1, main_#t~mem187#1, main_#t~mem188#1, main_#t~mem190#1, main_#t~mem189#1, main_#t~mem191#1, main_#t~mem192#1, main_#t~switch193#1, main_#t~mem194#1, main_#t~mem195#1, main_#t~mem196#1, main_#t~mem197#1, main_#t~mem198#1, main_#t~mem199#1, main_#t~mem200#1, main_#t~mem201#1, main_#t~mem202#1, main_#t~mem203#1, main_#t~mem204#1, main_~_hj_i~1#1, main_~_hj_j~1#1, main_~_hj_k~1#1, main_~_hj_key~1#1.base, main_~_hj_key~1#1.offset, main_#t~mem205#1.base, main_#t~mem205#1.offset, main_#t~mem206#1, main_#t~mem207#1.base, main_#t~mem207#1.offset, main_#t~mem208#1.base, main_#t~mem208#1.offset, main_#t~mem209#1.base, main_#t~mem209#1.offset, main_#t~mem210#1.base, main_#t~mem210#1.offset, main_#t~mem211#1.base, main_#t~mem211#1.offset, main_#t~mem212#1.base, main_#t~mem212#1.offset, main_#t~mem213#1.base, main_#t~mem213#1.offset, main_#t~mem214#1, main_#t~mem215#1, main_#t~mem216#1, main_#t~short217#1, main_#t~mem218#1.base, main_#t~mem218#1.offset, main_#t~ret219#1, main_#t~mem220#1.base, main_#t~mem220#1.offset, main_#t~mem221#1.base, main_#t~mem221#1.offset, main_#t~mem222#1.base, main_#t~mem222#1.offset, main_#t~mem223#1, main_~_hf_bkt~0#1, main_~_hf_hashv~0#1, main_#t~mem224#1.base, main_#t~mem224#1.offset, main_#t~mem225#1.base, main_#t~mem225#1.offset, main_#t~short226#1, main_#t~mem227#1.base, main_#t~mem227#1.offset, main_#t~mem228#1.base, main_#t~mem228#1.offset, main_#t~mem229#1.base, main_#t~mem229#1.offset, main_#t~mem230#1, main_#t~mem231#1.base, main_#t~mem231#1.offset, main_#t~mem232#1.base, main_#t~mem232#1.offset, main_#t~mem233#1.base, main_#t~mem233#1.offset, main_#t~mem234#1.base, main_#t~mem234#1.offset, main_#t~mem235#1.base, main_#t~mem235#1.offset, main_#t~mem236#1.base, main_#t~mem236#1.offset, main_#t~mem237#1, main_#t~mem238#1.base, main_#t~mem238#1.offset, main_#t~mem239#1.base, main_#t~mem239#1.offset, main_#t~mem240#1.base, main_#t~mem240#1.offset, main_#t~mem241#1, main_#t~mem242#1.base, main_#t~mem242#1.offset, main_#t~mem243#1.base, main_#t~mem243#1.offset, main_#t~mem244#1.base, main_#t~mem244#1.offset, main_#t~mem245#1.base, main_#t~mem245#1.offset, main_#t~mem246#1.base, main_#t~mem246#1.offset, main_#t~mem247#1, main_#t~mem248#1.base, main_#t~mem248#1.offset, main_#t~mem251#1, main_#t~mem249#1.base, main_#t~mem249#1.offset, main_#t~mem250#1, main_#t~mem252#1.base, main_#t~mem252#1.offset, main_#t~mem253#1.base, main_#t~mem253#1.offset, main_#t~mem254#1, main_#t~post255#1, main_#t~mem256#1.base, main_#t~mem256#1.offset, main_#t~mem257#1.base, main_#t~mem257#1.offset, main_#t~mem258#1.base, main_#t~mem258#1.offset, main_#t~mem259#1.base, main_#t~mem259#1.offset, main_#t~mem260#1.base, main_#t~mem260#1.offset, main_#t~mem261#1.base, main_#t~mem261#1.offset, main_#t~mem262#1.base, main_#t~mem262#1.offset, main_#t~mem263#1.base, main_#t~mem263#1.offset, main_~_hd_head~0#1.base, main_~_hd_head~0#1.offset, main_#t~mem264#1.base, main_#t~mem264#1.offset, main_#t~mem265#1, main_#t~post266#1, main_~_hd_bkt~0#1, main_~_hd_hh_del~0#1.base, main_~_hd_hh_del~0#1.offset, main_#t~mem178#1, main_#t~post179#1, main_#t~mem180#1, main_#t~mem267#1.base, main_#t~mem267#1.offset, main_~#i~0#1.base, main_~#i~0#1.offset, main_~user~0#1.base, main_~user~0#1.offset, main_~tmp~0#1.base, main_~tmp~0#1.offset, main_~users~0#1.base, main_~users~0#1.offset;call main_~#i~0#1.base, main_~#i~0#1.offset := #Ultimate.allocOnStack(4);havoc main_~user~0#1.base, main_~user~0#1.offset;havoc main_~tmp~0#1.base, main_~tmp~0#1.offset;main_~users~0#1.base, main_~users~0#1.offset := 0, 0;call write~int(0, main_~#i~0#1.base, main_~#i~0#1.offset, 4); {6404#(<= ~alt_malloc_balance~0 0)} is VALID [2022-02-21 03:16:50,741 INFO L290 TraceCheckUtils]: 2: Hoare triple {6404#(<= ~alt_malloc_balance~0 0)} call main_#t~mem42#1 := read~int(main_~#i~0#1.base, main_~#i~0#1.offset, 4); {6404#(<= ~alt_malloc_balance~0 0)} is VALID [2022-02-21 03:16:50,742 INFO L290 TraceCheckUtils]: 3: Hoare triple {6404#(<= ~alt_malloc_balance~0 0)} assume !!(main_#t~mem42#1 < 10);havoc main_#t~mem42#1;assume { :begin_inline_real_malloc } true;real_malloc_#in~n#1 := 40;havoc real_malloc_#res#1.base, real_malloc_#res#1.offset;havoc real_malloc_#t~malloc39#1.base, real_malloc_#t~malloc39#1.offset, real_malloc_~n#1;real_malloc_~n#1 := real_malloc_#in~n#1;call real_malloc_#t~malloc39#1.base, real_malloc_#t~malloc39#1.offset := #Ultimate.allocOnHeap(real_malloc_~n#1);real_malloc_#res#1.base, real_malloc_#res#1.offset := real_malloc_#t~malloc39#1.base, real_malloc_#t~malloc39#1.offset;havoc real_malloc_#t~malloc39#1.base, real_malloc_#t~malloc39#1.offset; {6404#(<= ~alt_malloc_balance~0 0)} is VALID [2022-02-21 03:16:50,742 INFO L290 TraceCheckUtils]: 4: Hoare triple {6404#(<= ~alt_malloc_balance~0 0)} main_#t~ret43#1.base, main_#t~ret43#1.offset := real_malloc_#res#1.base, real_malloc_#res#1.offset;assume { :end_inline_real_malloc } true;main_~user~0#1.base, main_~user~0#1.offset := main_#t~ret43#1.base, main_#t~ret43#1.offset;havoc main_#t~ret43#1.base, main_#t~ret43#1.offset; {6404#(<= ~alt_malloc_balance~0 0)} is VALID [2022-02-21 03:16:50,742 INFO L290 TraceCheckUtils]: 5: Hoare triple {6404#(<= ~alt_malloc_balance~0 0)} assume !(main_~user~0#1.base == 0 && main_~user~0#1.offset == 0); {6404#(<= ~alt_malloc_balance~0 0)} is VALID [2022-02-21 03:16:50,742 INFO L290 TraceCheckUtils]: 6: Hoare triple {6404#(<= ~alt_malloc_balance~0 0)} call main_#t~mem44#1 := read~int(main_~#i~0#1.base, main_~#i~0#1.offset, 4);call write~int(main_#t~mem44#1, main_~user~0#1.base, main_~user~0#1.offset, 4);havoc main_#t~mem44#1;call main_#t~mem45#1 := read~int(main_~#i~0#1.base, main_~#i~0#1.offset, 4);call main_#t~mem46#1 := read~int(main_~#i~0#1.base, main_~#i~0#1.offset, 4); {6404#(<= ~alt_malloc_balance~0 0)} is VALID [2022-02-21 03:16:50,743 INFO L290 TraceCheckUtils]: 7: Hoare triple {6404#(<= ~alt_malloc_balance~0 0)} assume main_#t~mem45#1 * main_#t~mem46#1 <= 2147483647; {6404#(<= ~alt_malloc_balance~0 0)} is VALID [2022-02-21 03:16:50,743 INFO L290 TraceCheckUtils]: 8: Hoare triple {6404#(<= ~alt_malloc_balance~0 0)} assume main_#t~mem45#1 * main_#t~mem46#1 >= -2147483648;call write~int(main_#t~mem45#1 * main_#t~mem46#1, main_~user~0#1.base, 4 + main_~user~0#1.offset, 4);havoc main_#t~mem45#1;havoc main_#t~mem46#1; {6404#(<= ~alt_malloc_balance~0 0)} is VALID [2022-02-21 03:16:50,744 INFO L290 TraceCheckUtils]: 9: Hoare triple {6404#(<= ~alt_malloc_balance~0 0)} havoc main_~_ha_hashv~0#1; {6404#(<= ~alt_malloc_balance~0 0)} is VALID [2022-02-21 03:16:50,744 INFO L290 TraceCheckUtils]: 10: Hoare triple {6404#(<= ~alt_malloc_balance~0 0)} goto; {6404#(<= ~alt_malloc_balance~0 0)} is VALID [2022-02-21 03:16:50,745 INFO L290 TraceCheckUtils]: 11: Hoare triple {6404#(<= ~alt_malloc_balance~0 0)} havoc main_~_hj_i~0#1;havoc main_~_hj_j~0#1;havoc main_~_hj_k~0#1;main_~_hj_key~0#1.base, main_~_hj_key~0#1.offset := main_~user~0#1.base, main_~user~0#1.offset;main_~_ha_hashv~0#1 := 4276993775;main_~_hj_j~0#1 := 2654435769;main_~_hj_i~0#1 := main_~_hj_j~0#1;main_~_hj_k~0#1 := 4; {6404#(<= ~alt_malloc_balance~0 0)} is VALID [2022-02-21 03:16:50,746 INFO L290 TraceCheckUtils]: 12: Hoare triple {6404#(<= ~alt_malloc_balance~0 0)} assume !(main_~_hj_k~0#1 % 4294967296 >= 12); {6404#(<= ~alt_malloc_balance~0 0)} is VALID [2022-02-21 03:16:50,746 INFO L290 TraceCheckUtils]: 13: Hoare triple {6404#(<= ~alt_malloc_balance~0 0)} main_~_ha_hashv~0#1 := 4 + main_~_ha_hashv~0#1;main_#t~switch59#1 := 11 == main_~_hj_k~0#1; {6404#(<= ~alt_malloc_balance~0 0)} is VALID [2022-02-21 03:16:50,755 INFO L290 TraceCheckUtils]: 14: Hoare triple {6404#(<= ~alt_malloc_balance~0 0)} assume !main_#t~switch59#1; {6404#(<= ~alt_malloc_balance~0 0)} is VALID [2022-02-21 03:16:50,756 INFO L290 TraceCheckUtils]: 15: Hoare triple {6404#(<= ~alt_malloc_balance~0 0)} main_#t~switch59#1 := main_#t~switch59#1 || 10 == main_~_hj_k~0#1; {6404#(<= ~alt_malloc_balance~0 0)} is VALID [2022-02-21 03:16:50,756 INFO L290 TraceCheckUtils]: 16: Hoare triple {6404#(<= ~alt_malloc_balance~0 0)} assume !main_#t~switch59#1; {6404#(<= ~alt_malloc_balance~0 0)} is VALID [2022-02-21 03:16:50,757 INFO L290 TraceCheckUtils]: 17: Hoare triple {6404#(<= ~alt_malloc_balance~0 0)} main_#t~switch59#1 := main_#t~switch59#1 || 9 == main_~_hj_k~0#1; {6404#(<= ~alt_malloc_balance~0 0)} is VALID [2022-02-21 03:16:50,757 INFO L290 TraceCheckUtils]: 18: Hoare triple {6404#(<= ~alt_malloc_balance~0 0)} assume !main_#t~switch59#1; {6404#(<= ~alt_malloc_balance~0 0)} is VALID [2022-02-21 03:16:50,757 INFO L290 TraceCheckUtils]: 19: Hoare triple {6404#(<= ~alt_malloc_balance~0 0)} main_#t~switch59#1 := main_#t~switch59#1 || 8 == main_~_hj_k~0#1; {6404#(<= ~alt_malloc_balance~0 0)} is VALID [2022-02-21 03:16:50,758 INFO L290 TraceCheckUtils]: 20: Hoare triple {6404#(<= ~alt_malloc_balance~0 0)} assume !main_#t~switch59#1; {6404#(<= ~alt_malloc_balance~0 0)} is VALID [2022-02-21 03:16:50,758 INFO L290 TraceCheckUtils]: 21: Hoare triple {6404#(<= ~alt_malloc_balance~0 0)} main_#t~switch59#1 := main_#t~switch59#1 || 7 == main_~_hj_k~0#1; {6404#(<= ~alt_malloc_balance~0 0)} is VALID [2022-02-21 03:16:50,759 INFO L290 TraceCheckUtils]: 22: Hoare triple {6404#(<= ~alt_malloc_balance~0 0)} assume !main_#t~switch59#1; {6404#(<= ~alt_malloc_balance~0 0)} is VALID [2022-02-21 03:16:50,759 INFO L290 TraceCheckUtils]: 23: Hoare triple {6404#(<= ~alt_malloc_balance~0 0)} main_#t~switch59#1 := main_#t~switch59#1 || 6 == main_~_hj_k~0#1; {6404#(<= ~alt_malloc_balance~0 0)} is VALID [2022-02-21 03:16:50,759 INFO L290 TraceCheckUtils]: 24: Hoare triple {6404#(<= ~alt_malloc_balance~0 0)} assume !main_#t~switch59#1; {6404#(<= ~alt_malloc_balance~0 0)} is VALID [2022-02-21 03:16:50,760 INFO L290 TraceCheckUtils]: 25: Hoare triple {6404#(<= ~alt_malloc_balance~0 0)} main_#t~switch59#1 := main_#t~switch59#1 || 5 == main_~_hj_k~0#1; {6404#(<= ~alt_malloc_balance~0 0)} is VALID [2022-02-21 03:16:50,760 INFO L290 TraceCheckUtils]: 26: Hoare triple {6404#(<= ~alt_malloc_balance~0 0)} assume !main_#t~switch59#1; {6404#(<= ~alt_malloc_balance~0 0)} is VALID [2022-02-21 03:16:50,760 INFO L290 TraceCheckUtils]: 27: Hoare triple {6404#(<= ~alt_malloc_balance~0 0)} main_#t~switch59#1 := main_#t~switch59#1 || 4 == main_~_hj_k~0#1; {6404#(<= ~alt_malloc_balance~0 0)} is VALID [2022-02-21 03:16:50,760 INFO L290 TraceCheckUtils]: 28: Hoare triple {6404#(<= ~alt_malloc_balance~0 0)} assume main_#t~switch59#1;call main_#t~mem67#1 := read~int(main_~_hj_key~0#1.base, 3 + main_~_hj_key~0#1.offset, 1);main_~_hj_i~0#1 := main_~_hj_i~0#1 + 16777216 * (main_#t~mem67#1 % 256);havoc main_#t~mem67#1; {6404#(<= ~alt_malloc_balance~0 0)} is VALID [2022-02-21 03:16:50,761 INFO L290 TraceCheckUtils]: 29: Hoare triple {6404#(<= ~alt_malloc_balance~0 0)} main_#t~switch59#1 := main_#t~switch59#1 || 3 == main_~_hj_k~0#1; {6404#(<= ~alt_malloc_balance~0 0)} is VALID [2022-02-21 03:16:50,761 INFO L290 TraceCheckUtils]: 30: Hoare triple {6404#(<= ~alt_malloc_balance~0 0)} assume main_#t~switch59#1;call main_#t~mem68#1 := read~int(main_~_hj_key~0#1.base, 2 + main_~_hj_key~0#1.offset, 1);main_~_hj_i~0#1 := main_~_hj_i~0#1 + 65536 * (main_#t~mem68#1 % 256);havoc main_#t~mem68#1; {6404#(<= ~alt_malloc_balance~0 0)} is VALID [2022-02-21 03:16:50,761 INFO L290 TraceCheckUtils]: 31: Hoare triple {6404#(<= ~alt_malloc_balance~0 0)} main_#t~switch59#1 := main_#t~switch59#1 || 2 == main_~_hj_k~0#1; {6404#(<= ~alt_malloc_balance~0 0)} is VALID [2022-02-21 03:16:50,762 INFO L290 TraceCheckUtils]: 32: Hoare triple {6404#(<= ~alt_malloc_balance~0 0)} assume main_#t~switch59#1;call main_#t~mem69#1 := read~int(main_~_hj_key~0#1.base, 1 + main_~_hj_key~0#1.offset, 1);main_~_hj_i~0#1 := main_~_hj_i~0#1 + 256 * (main_#t~mem69#1 % 256);havoc main_#t~mem69#1; {6404#(<= ~alt_malloc_balance~0 0)} is VALID [2022-02-21 03:16:50,762 INFO L290 TraceCheckUtils]: 33: Hoare triple {6404#(<= ~alt_malloc_balance~0 0)} main_#t~switch59#1 := main_#t~switch59#1 || 1 == main_~_hj_k~0#1; {6404#(<= ~alt_malloc_balance~0 0)} is VALID [2022-02-21 03:16:50,762 INFO L290 TraceCheckUtils]: 34: Hoare triple {6404#(<= ~alt_malloc_balance~0 0)} assume main_#t~switch59#1;call main_#t~mem70#1 := read~int(main_~_hj_key~0#1.base, main_~_hj_key~0#1.offset, 1);main_~_hj_i~0#1 := main_~_hj_i~0#1 + main_#t~mem70#1 % 256;havoc main_#t~mem70#1; {6404#(<= ~alt_malloc_balance~0 0)} is VALID [2022-02-21 03:16:50,763 INFO L290 TraceCheckUtils]: 35: Hoare triple {6404#(<= ~alt_malloc_balance~0 0)} havoc main_#t~switch59#1; {6404#(<= ~alt_malloc_balance~0 0)} is VALID [2022-02-21 03:16:50,763 INFO L290 TraceCheckUtils]: 36: Hoare triple {6404#(<= ~alt_malloc_balance~0 0)} main_~_hj_i~0#1 := main_~_hj_i~0#1 - main_~_hj_j~0#1;main_~_hj_i~0#1 := main_~_hj_i~0#1 - main_~_ha_hashv~0#1;main_~_hj_i~0#1 := (if (1 == main_~_hj_i~0#1 || 0 == main_~_hj_i~0#1) && (1 == main_~_ha_hashv~0#1 / 8192 || 0 == main_~_ha_hashv~0#1 / 8192) then (if main_~_hj_i~0#1 == main_~_ha_hashv~0#1 / 8192 then 0 else 1) else (if 0 == main_~_hj_i~0#1 then main_~_ha_hashv~0#1 / 8192 else (if 0 == main_~_ha_hashv~0#1 / 8192 then main_~_hj_i~0#1 else ~bitwiseXOr(main_~_hj_i~0#1, main_~_ha_hashv~0#1 / 8192))));main_~_hj_j~0#1 := main_~_hj_j~0#1 - main_~_ha_hashv~0#1;main_~_hj_j~0#1 := main_~_hj_j~0#1 - main_~_hj_i~0#1;main_~_hj_j~0#1 := (if (1 == main_~_hj_j~0#1 || 0 == main_~_hj_j~0#1) && (1 == 256 * main_~_hj_i~0#1 || 0 == 256 * main_~_hj_i~0#1) then (if main_~_hj_j~0#1 == 256 * main_~_hj_i~0#1 then 0 else 1) else (if 0 == main_~_hj_j~0#1 then 256 * main_~_hj_i~0#1 else (if 0 == 256 * main_~_hj_i~0#1 then main_~_hj_j~0#1 else ~bitwiseXOr(main_~_hj_j~0#1, 256 * main_~_hj_i~0#1))));main_~_ha_hashv~0#1 := main_~_ha_hashv~0#1 - main_~_hj_i~0#1;main_~_ha_hashv~0#1 := main_~_ha_hashv~0#1 - main_~_hj_j~0#1;main_~_ha_hashv~0#1 := (if (1 == main_~_ha_hashv~0#1 || 0 == main_~_ha_hashv~0#1) && (1 == main_~_hj_j~0#1 / 8192 || 0 == main_~_hj_j~0#1 / 8192) then (if main_~_ha_hashv~0#1 == main_~_hj_j~0#1 / 8192 then 0 else 1) else (if 0 == main_~_ha_hashv~0#1 then main_~_hj_j~0#1 / 8192 else (if 0 == main_~_hj_j~0#1 / 8192 then main_~_ha_hashv~0#1 else ~bitwiseXOr(main_~_ha_hashv~0#1, main_~_hj_j~0#1 / 8192))));main_~_hj_i~0#1 := main_~_hj_i~0#1 - main_~_hj_j~0#1;main_~_hj_i~0#1 := main_~_hj_i~0#1 - main_~_ha_hashv~0#1;main_~_hj_i~0#1 := (if (1 == main_~_hj_i~0#1 || 0 == main_~_hj_i~0#1) && (1 == main_~_ha_hashv~0#1 / 4096 || 0 == main_~_ha_hashv~0#1 / 4096) then (if main_~_hj_i~0#1 == main_~_ha_hashv~0#1 / 4096 then 0 else 1) else (if 0 == main_~_hj_i~0#1 then main_~_ha_hashv~0#1 / 4096 else (if 0 == main_~_ha_hashv~0#1 / 4096 then main_~_hj_i~0#1 else ~bitwiseXOr(main_~_hj_i~0#1, main_~_ha_hashv~0#1 / 4096))));main_~_hj_j~0#1 := main_~_hj_j~0#1 - main_~_ha_hashv~0#1;main_~_hj_j~0#1 := main_~_hj_j~0#1 - main_~_hj_i~0#1;main_~_hj_j~0#1 := (if (1 == main_~_hj_j~0#1 || 0 == main_~_hj_j~0#1) && (1 == 65536 * main_~_hj_i~0#1 || 0 == 65536 * main_~_hj_i~0#1) then (if main_~_hj_j~0#1 == 65536 * main_~_hj_i~0#1 then 0 else 1) else (if 0 == main_~_hj_j~0#1 then 65536 * main_~_hj_i~0#1 else (if 0 == 65536 * main_~_hj_i~0#1 then main_~_hj_j~0#1 else ~bitwiseXOr(main_~_hj_j~0#1, 65536 * main_~_hj_i~0#1))));main_~_ha_hashv~0#1 := main_~_ha_hashv~0#1 - main_~_hj_i~0#1;main_~_ha_hashv~0#1 := main_~_ha_hashv~0#1 - main_~_hj_j~0#1;main_~_ha_hashv~0#1 := (if (1 == main_~_ha_hashv~0#1 || 0 == main_~_ha_hashv~0#1) && (1 == main_~_hj_j~0#1 / 32 || 0 == main_~_hj_j~0#1 / 32) then (if main_~_ha_hashv~0#1 == main_~_hj_j~0#1 / 32 then 0 else 1) else (if 0 == main_~_ha_hashv~0#1 then main_~_hj_j~0#1 / 32 else (if 0 == main_~_hj_j~0#1 / 32 then main_~_ha_hashv~0#1 else ~bitwiseXOr(main_~_ha_hashv~0#1, main_~_hj_j~0#1 / 32))));main_~_hj_i~0#1 := main_~_hj_i~0#1 - main_~_hj_j~0#1;main_~_hj_i~0#1 := main_~_hj_i~0#1 - main_~_ha_hashv~0#1;main_~_hj_i~0#1 := (if (1 == main_~_hj_i~0#1 || 0 == main_~_hj_i~0#1) && (1 == main_~_ha_hashv~0#1 / 8 || 0 == main_~_ha_hashv~0#1 / 8) then (if main_~_hj_i~0#1 == main_~_ha_hashv~0#1 / 8 then 0 else 1) else (if 0 == main_~_hj_i~0#1 then main_~_ha_hashv~0#1 / 8 else (if 0 == main_~_ha_hashv~0#1 / 8 then main_~_hj_i~0#1 else ~bitwiseXOr(main_~_hj_i~0#1, main_~_ha_hashv~0#1 / 8))));main_~_hj_j~0#1 := main_~_hj_j~0#1 - main_~_ha_hashv~0#1;main_~_hj_j~0#1 := main_~_hj_j~0#1 - main_~_hj_i~0#1;main_~_hj_j~0#1 := (if (1 == main_~_hj_j~0#1 || 0 == main_~_hj_j~0#1) && (1 == 1024 * main_~_hj_i~0#1 || 0 == 1024 * main_~_hj_i~0#1) then (if main_~_hj_j~0#1 == 1024 * main_~_hj_i~0#1 then 0 else 1) else (if 0 == main_~_hj_j~0#1 then 1024 * main_~_hj_i~0#1 else (if 0 == 1024 * main_~_hj_i~0#1 then main_~_hj_j~0#1 else ~bitwiseXOr(main_~_hj_j~0#1, 1024 * main_~_hj_i~0#1))));main_~_ha_hashv~0#1 := main_~_ha_hashv~0#1 - main_~_hj_i~0#1;main_~_ha_hashv~0#1 := main_~_ha_hashv~0#1 - main_~_hj_j~0#1;main_~_ha_hashv~0#1 := (if (1 == main_~_ha_hashv~0#1 || 0 == main_~_ha_hashv~0#1) && (1 == main_~_hj_j~0#1 / 32768 || 0 == main_~_hj_j~0#1 / 32768) then (if main_~_ha_hashv~0#1 == main_~_hj_j~0#1 / 32768 then 0 else 1) else (if 0 == main_~_ha_hashv~0#1 then main_~_hj_j~0#1 / 32768 else (if 0 == main_~_hj_j~0#1 / 32768 then main_~_ha_hashv~0#1 else ~bitwiseXOr(main_~_ha_hashv~0#1, main_~_hj_j~0#1 / 32768)))); {6404#(<= ~alt_malloc_balance~0 0)} is VALID [2022-02-21 03:16:50,763 INFO L290 TraceCheckUtils]: 37: Hoare triple {6404#(<= ~alt_malloc_balance~0 0)} goto; {6404#(<= ~alt_malloc_balance~0 0)} is VALID [2022-02-21 03:16:50,763 INFO L290 TraceCheckUtils]: 38: Hoare triple {6404#(<= ~alt_malloc_balance~0 0)} goto; {6404#(<= ~alt_malloc_balance~0 0)} is VALID [2022-02-21 03:16:50,764 INFO L290 TraceCheckUtils]: 39: Hoare triple {6404#(<= ~alt_malloc_balance~0 0)} goto; {6404#(<= ~alt_malloc_balance~0 0)} is VALID [2022-02-21 03:16:50,764 INFO L290 TraceCheckUtils]: 40: Hoare triple {6404#(<= ~alt_malloc_balance~0 0)} call write~int(main_~_ha_hashv~0#1, main_~user~0#1.base, 36 + main_~user~0#1.offset, 4);call write~$Pointer$(main_~user~0#1.base, main_~user~0#1.offset, main_~user~0#1.base, 28 + main_~user~0#1.offset, 4);call write~int(4, main_~user~0#1.base, 32 + main_~user~0#1.offset, 4); {6404#(<= ~alt_malloc_balance~0 0)} is VALID [2022-02-21 03:16:50,764 INFO L290 TraceCheckUtils]: 41: Hoare triple {6404#(<= ~alt_malloc_balance~0 0)} assume main_~users~0#1.base == 0 && main_~users~0#1.offset == 0;call write~$Pointer$(0, 0, main_~user~0#1.base, 16 + main_~user~0#1.offset, 4);call write~$Pointer$(0, 0, main_~user~0#1.base, 12 + main_~user~0#1.offset, 4); {6404#(<= ~alt_malloc_balance~0 0)} is VALID [2022-02-21 03:16:50,765 INFO L272 TraceCheckUtils]: 42: Hoare triple {6404#(<= ~alt_malloc_balance~0 0)} call main_#t~ret71#1.base, main_#t~ret71#1.offset := alt_malloc(44); {6404#(<= ~alt_malloc_balance~0 0)} is VALID [2022-02-21 03:16:50,765 INFO L290 TraceCheckUtils]: 43: Hoare triple {6404#(<= ~alt_malloc_balance~0 0)} ~sz := #in~sz;#t~post31 := ~alt_malloc_balance~0; {6534#(<= |alt_malloc_#t~post31| 0)} is VALID [2022-02-21 03:16:50,766 INFO L290 TraceCheckUtils]: 44: Hoare triple {6534#(<= |alt_malloc_#t~post31| 0)} assume !(1 + #t~post31 <= 2147483647); {6400#false} is VALID [2022-02-21 03:16:50,766 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-21 03:16:50,766 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-21 03:16:50,766 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 03:16:50,766 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1206708628] [2022-02-21 03:16:50,766 WARN L317 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-02-21 03:16:50,766 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1862839406] [2022-02-21 03:16:50,766 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1862839406] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-21 03:16:50,766 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-21 03:16:50,766 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-02-21 03:16:50,766 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1284051884] [2022-02-21 03:16:50,767 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-21 03:16:50,767 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 14.666666666666666) internal successors, (44), 3 states have internal predecessors, (44), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 45 [2022-02-21 03:16:50,767 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-21 03:16:50,767 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 4 states, 3 states have (on average 14.666666666666666) internal successors, (44), 3 states have internal predecessors, (44), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:16:50,797 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 45 edges. 45 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:16:50,797 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-02-21 03:16:50,797 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 03:16:50,798 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-02-21 03:16:50,798 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-02-21 03:16:50,798 INFO L87 Difference]: Start difference. First operand 246 states and 300 transitions. Second operand has 4 states, 3 states have (on average 14.666666666666666) internal successors, (44), 3 states have internal predecessors, (44), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:16:51,504 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:16:51,504 INFO L93 Difference]: Finished difference Result 427 states and 522 transitions. [2022-02-21 03:16:51,505 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-02-21 03:16:51,505 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 14.666666666666666) internal successors, (44), 3 states have internal predecessors, (44), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 45 [2022-02-21 03:16:51,505 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-21 03:16:51,505 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 3 states have (on average 14.666666666666666) internal successors, (44), 3 states have internal predecessors, (44), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:16:51,508 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 502 transitions. [2022-02-21 03:16:51,508 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 3 states have (on average 14.666666666666666) internal successors, (44), 3 states have internal predecessors, (44), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:16:51,511 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 502 transitions. [2022-02-21 03:16:51,511 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 502 transitions. [2022-02-21 03:16:51,907 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 502 edges. 502 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:16:51,914 INFO L225 Difference]: With dead ends: 427 [2022-02-21 03:16:51,914 INFO L226 Difference]: Without dead ends: 425 [2022-02-21 03:16:51,915 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-02-21 03:16:51,917 INFO L933 BasicCegarLoop]: 283 mSDtfsCounter, 171 mSDsluCounter, 560 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 171 SdHoareTripleChecker+Valid, 843 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-21 03:16:51,917 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [171 Valid, 843 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-21 03:16:51,918 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 425 states. [2022-02-21 03:16:51,948 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 425 to 415. [2022-02-21 03:16:51,948 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 03:16:51,949 INFO L82 GeneralOperation]: Start isEquivalent. First operand 425 states. Second operand has 415 states, 382 states have (on average 1.2827225130890052) internal successors, (490), 397 states have internal predecessors, (490), 14 states have call successors, (14), 6 states have call predecessors, (14), 5 states have return successors, (14), 12 states have call predecessors, (14), 14 states have call successors, (14) [2022-02-21 03:16:51,950 INFO L74 IsIncluded]: Start isIncluded. First operand 425 states. Second operand has 415 states, 382 states have (on average 1.2827225130890052) internal successors, (490), 397 states have internal predecessors, (490), 14 states have call successors, (14), 6 states have call predecessors, (14), 5 states have return successors, (14), 12 states have call predecessors, (14), 14 states have call successors, (14) [2022-02-21 03:16:51,950 INFO L87 Difference]: Start difference. First operand 425 states. Second operand has 415 states, 382 states have (on average 1.2827225130890052) internal successors, (490), 397 states have internal predecessors, (490), 14 states have call successors, (14), 6 states have call predecessors, (14), 5 states have return successors, (14), 12 states have call predecessors, (14), 14 states have call successors, (14) [2022-02-21 03:16:51,958 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:16:51,958 INFO L93 Difference]: Finished difference Result 425 states and 520 transitions. [2022-02-21 03:16:51,959 INFO L276 IsEmpty]: Start isEmpty. Operand 425 states and 520 transitions. [2022-02-21 03:16:51,959 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:16:51,959 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:16:51,960 INFO L74 IsIncluded]: Start isIncluded. First operand has 415 states, 382 states have (on average 1.2827225130890052) internal successors, (490), 397 states have internal predecessors, (490), 14 states have call successors, (14), 6 states have call predecessors, (14), 5 states have return successors, (14), 12 states have call predecessors, (14), 14 states have call successors, (14) Second operand 425 states. [2022-02-21 03:16:51,961 INFO L87 Difference]: Start difference. First operand has 415 states, 382 states have (on average 1.2827225130890052) internal successors, (490), 397 states have internal predecessors, (490), 14 states have call successors, (14), 6 states have call predecessors, (14), 5 states have return successors, (14), 12 states have call predecessors, (14), 14 states have call successors, (14) Second operand 425 states. [2022-02-21 03:16:51,971 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:16:51,971 INFO L93 Difference]: Finished difference Result 425 states and 520 transitions. [2022-02-21 03:16:51,971 INFO L276 IsEmpty]: Start isEmpty. Operand 425 states and 520 transitions. [2022-02-21 03:16:51,972 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:16:51,972 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:16:51,972 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 03:16:51,972 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 03:16:51,973 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 415 states, 382 states have (on average 1.2827225130890052) internal successors, (490), 397 states have internal predecessors, (490), 14 states have call successors, (14), 6 states have call predecessors, (14), 5 states have return successors, (14), 12 states have call predecessors, (14), 14 states have call successors, (14) [2022-02-21 03:16:51,980 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 415 states to 415 states and 518 transitions. [2022-02-21 03:16:51,981 INFO L78 Accepts]: Start accepts. Automaton has 415 states and 518 transitions. Word has length 45 [2022-02-21 03:16:51,982 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-21 03:16:51,982 INFO L470 AbstractCegarLoop]: Abstraction has 415 states and 518 transitions. [2022-02-21 03:16:51,982 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 14.666666666666666) internal successors, (44), 3 states have internal predecessors, (44), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:16:51,983 INFO L276 IsEmpty]: Start isEmpty. Operand 415 states and 518 transitions. [2022-02-21 03:16:51,983 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2022-02-21 03:16:51,983 INFO L506 BasicCegarLoop]: Found error trace [2022-02-21 03:16:51,983 INFO L514 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-21 03:16:52,002 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-02-21 03:16:52,195 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-21 03:16:52,195 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting alt_mallocErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [alt_mallocErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, alt_mallocErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, alt_freeErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2022-02-21 03:16:52,196 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:16:52,196 INFO L85 PathProgramCache]: Analyzing trace with hash 1292392160, now seen corresponding path program 1 times [2022-02-21 03:16:52,196 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:16:52,196 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [77465280] [2022-02-21 03:16:52,196 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:16:52,196 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:16:52,223 ERROR L252 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-02-21 03:16:52,223 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [974560349] [2022-02-21 03:16:52,223 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:16:52,223 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-21 03:16:52,224 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:16:52,232 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-02-21 03:16:52,233 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-02-21 03:16:52,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:16:52,381 INFO L263 TraceCheckSpWp]: Trace formula consists of 252 conjuncts, 5 conjunts are in the unsatisfiable core [2022-02-21 03:16:52,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:16:52,415 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 03:16:52,603 INFO L290 TraceCheckUtils]: 0: Hoare triple {8383#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(21, 2);~#alt_malloc_sizes~0.base, ~#alt_malloc_sizes~0.offset := 3, 0;call #Ultimate.allocInit(40, 3);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#alt_malloc_sizes~0.base);~alt_malloc_balance~0 := 0;~alt_memcmp_count~0 := 0;~alt_bzero_count~0 := 0; {8388#(<= 0 ~alt_malloc_balance~0)} is VALID [2022-02-21 03:16:52,604 INFO L290 TraceCheckUtils]: 1: Hoare triple {8388#(<= 0 ~alt_malloc_balance~0)} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret43#1.base, main_#t~ret43#1.offset, main_#t~mem44#1, main_#t~mem45#1, main_#t~mem46#1, main_#t~mem48#1, main_#t~mem47#1, main_#t~mem49#1, main_#t~mem50#1, main_#t~mem52#1, main_#t~mem51#1, main_#t~mem53#1, main_#t~mem54#1, main_#t~mem56#1, main_#t~mem55#1, main_#t~mem57#1, main_#t~mem58#1, main_#t~switch59#1, main_#t~mem60#1, main_#t~mem61#1, main_#t~mem62#1, main_#t~mem63#1, main_#t~mem64#1, main_#t~mem65#1, main_#t~mem66#1, main_#t~mem67#1, main_#t~mem68#1, main_#t~mem69#1, main_#t~mem70#1, main_~_hj_i~0#1, main_~_hj_j~0#1, main_~_hj_k~0#1, main_~_hj_key~0#1.base, main_~_hj_key~0#1.offset, main_#t~ret71#1.base, main_#t~ret71#1.offset, main_#t~mem72#1.base, main_#t~mem72#1.offset, main_#t~mem73#1.base, main_#t~mem73#1.offset, main_#t~mem74#1.base, main_#t~mem74#1.offset, main_#t~mem75#1.base, main_#t~mem75#1.offset, main_#t~mem76#1.base, main_#t~mem76#1.offset, main_#t~mem77#1.base, main_#t~mem77#1.offset, main_#t~mem78#1.base, main_#t~mem78#1.offset, main_#t~ret79#1.base, main_#t~ret79#1.offset, main_#t~mem80#1.base, main_#t~mem80#1.offset, main_#t~mem81#1.base, main_#t~mem81#1.offset, main_#t~mem82#1.base, main_#t~mem82#1.offset, main_#t~mem83#1.base, main_#t~mem83#1.offset, main_#t~mem84#1.base, main_#t~mem84#1.offset, main_#t~mem85#1.base, main_#t~mem85#1.offset, main_#t~mem86#1.base, main_#t~mem86#1.offset, main_#t~mem87#1.base, main_#t~mem87#1.offset, main_#t~mem88#1.base, main_#t~mem88#1.offset, main_#t~mem89#1.base, main_#t~mem89#1.offset, main_#t~mem90#1, main_#t~mem91#1.base, main_#t~mem91#1.offset, main_#t~mem92#1.base, main_#t~mem92#1.offset, main_#t~mem93#1.base, main_#t~mem93#1.offset, main_#t~mem94#1.base, main_#t~mem94#1.offset, main_#t~mem95#1, main_#t~post96#1, main_#t~mem97#1.base, main_#t~mem97#1.offset, main_#t~mem98#1, main_#t~mem99#1.base, main_#t~mem99#1.offset, main_#t~mem100#1.base, main_#t~mem100#1.offset, main_#t~mem101#1, main_#t~post102#1, main_#t~mem103#1.base, main_#t~mem103#1.offset, main_#t~mem104#1.base, main_#t~mem104#1.offset, main_#t~mem105#1.base, main_#t~mem105#1.offset, main_#t~mem107#1, main_#t~mem106#1, main_#t~mem108#1.base, main_#t~mem108#1.offset, main_#t~mem109#1, main_#t~short110#1, main_#t~mem111#1.base, main_#t~mem111#1.offset, main_#t~mem112#1, main_#t~ret113#1.base, main_#t~ret113#1.offset, main_#t~mem114#1.base, main_#t~mem114#1.offset, main_#t~mem115#1.base, main_#t~mem115#1.offset, main_#t~mem116#1.base, main_#t~mem116#1.offset, main_#t~mem117#1, main_#t~mem118#1.base, main_#t~mem118#1.offset, main_#t~mem119#1.base, main_#t~mem119#1.offset, main_#t~mem122#1, main_#t~mem120#1.base, main_#t~mem120#1.offset, main_#t~mem121#1, main_#t~mem123#1.base, main_#t~mem123#1.offset, main_#t~mem126#1, main_#t~mem124#1.base, main_#t~mem124#1.offset, main_#t~mem125#1, main_#t~ite127#1, main_#t~mem128#1.base, main_#t~mem128#1.offset, main_#t~mem132#1.base, main_#t~mem132#1.offset, main_#t~mem133#1.base, main_#t~mem133#1.offset, main_#t~mem134#1.base, main_#t~mem134#1.offset, main_#t~mem135#1.base, main_#t~mem135#1.offset, main_#t~mem138#1, main_#t~mem136#1.base, main_#t~mem136#1.offset, main_#t~mem137#1, main_#t~mem139#1.base, main_#t~mem139#1.offset, main_#t~mem140#1, main_#t~pre141#1, main_#t~mem142#1.base, main_#t~mem142#1.offset, main_#t~mem143#1, main_#t~mem144#1.base, main_#t~mem144#1.offset, main_#t~mem145#1, main_#t~post146#1, main_#t~mem150#1, main_#t~mem148#1, main_#t~mem147#1.base, main_#t~mem147#1.offset, main_#t~mem149#1, main_#t~mem151#1, main_#t~post152#1, main_#t~mem153#1.base, main_#t~mem153#1.offset, main_#t~mem154#1.base, main_#t~mem154#1.offset, main_#t~mem155#1.base, main_#t~mem155#1.offset, main_#t~post129#1, main_#t~mem130#1.base, main_#t~mem130#1.offset, main_#t~mem131#1, main_#t~mem156#1.base, main_#t~mem156#1.offset, main_#t~mem157#1.base, main_#t~mem157#1.offset, main_#t~mem158#1.base, main_#t~mem158#1.offset, main_#t~mem159#1, main_#t~mem160#1.base, main_#t~mem160#1.offset, main_#t~mem161#1, main_#t~mem162#1.base, main_#t~mem162#1.offset, main_#t~mem163#1, main_#t~post164#1, main_#t~mem165#1.base, main_#t~mem165#1.offset, main_#t~mem166#1.base, main_#t~mem166#1.offset, main_#t~mem167#1.base, main_#t~mem167#1.offset, main_#t~mem168#1.base, main_#t~mem168#1.offset, main_#t~mem171#1, main_#t~mem169#1.base, main_#t~mem169#1.offset, main_#t~mem170#1, main_#t~ite174#1, main_#t~mem172#1.base, main_#t~mem172#1.offset, main_#t~mem173#1, main_#t~mem175#1.base, main_#t~mem175#1.offset, main_#t~mem176#1, main_#t~mem177#1.base, main_#t~mem177#1.offset, main_~_he_bkt~0#1, main_~_he_bkt_i~0#1, main_~_he_thh~0#1.base, main_~_he_thh~0#1.offset, main_~_he_hh_nxt~0#1.base, main_~_he_hh_nxt~0#1.offset, main_~#_he_new_buckets~0#1.base, main_~#_he_new_buckets~0#1.offset, main_~_he_newbkt~0#1.base, main_~_he_newbkt~0#1.offset, main_~_ha_head~0#1.base, main_~_ha_head~0#1.offset, main_~_ha_bkt~0#1, main_~_ha_hashv~0#1, main_#t~mem40#1, main_#t~post41#1, main_#t~mem42#1, main_#t~mem182#1, main_#t~mem181#1, main_#t~mem183#1, main_#t~mem184#1, main_#t~mem186#1, main_#t~mem185#1, main_#t~mem187#1, main_#t~mem188#1, main_#t~mem190#1, main_#t~mem189#1, main_#t~mem191#1, main_#t~mem192#1, main_#t~switch193#1, main_#t~mem194#1, main_#t~mem195#1, main_#t~mem196#1, main_#t~mem197#1, main_#t~mem198#1, main_#t~mem199#1, main_#t~mem200#1, main_#t~mem201#1, main_#t~mem202#1, main_#t~mem203#1, main_#t~mem204#1, main_~_hj_i~1#1, main_~_hj_j~1#1, main_~_hj_k~1#1, main_~_hj_key~1#1.base, main_~_hj_key~1#1.offset, main_#t~mem205#1.base, main_#t~mem205#1.offset, main_#t~mem206#1, main_#t~mem207#1.base, main_#t~mem207#1.offset, main_#t~mem208#1.base, main_#t~mem208#1.offset, main_#t~mem209#1.base, main_#t~mem209#1.offset, main_#t~mem210#1.base, main_#t~mem210#1.offset, main_#t~mem211#1.base, main_#t~mem211#1.offset, main_#t~mem212#1.base, main_#t~mem212#1.offset, main_#t~mem213#1.base, main_#t~mem213#1.offset, main_#t~mem214#1, main_#t~mem215#1, main_#t~mem216#1, main_#t~short217#1, main_#t~mem218#1.base, main_#t~mem218#1.offset, main_#t~ret219#1, main_#t~mem220#1.base, main_#t~mem220#1.offset, main_#t~mem221#1.base, main_#t~mem221#1.offset, main_#t~mem222#1.base, main_#t~mem222#1.offset, main_#t~mem223#1, main_~_hf_bkt~0#1, main_~_hf_hashv~0#1, main_#t~mem224#1.base, main_#t~mem224#1.offset, main_#t~mem225#1.base, main_#t~mem225#1.offset, main_#t~short226#1, main_#t~mem227#1.base, main_#t~mem227#1.offset, main_#t~mem228#1.base, main_#t~mem228#1.offset, main_#t~mem229#1.base, main_#t~mem229#1.offset, main_#t~mem230#1, main_#t~mem231#1.base, main_#t~mem231#1.offset, main_#t~mem232#1.base, main_#t~mem232#1.offset, main_#t~mem233#1.base, main_#t~mem233#1.offset, main_#t~mem234#1.base, main_#t~mem234#1.offset, main_#t~mem235#1.base, main_#t~mem235#1.offset, main_#t~mem236#1.base, main_#t~mem236#1.offset, main_#t~mem237#1, main_#t~mem238#1.base, main_#t~mem238#1.offset, main_#t~mem239#1.base, main_#t~mem239#1.offset, main_#t~mem240#1.base, main_#t~mem240#1.offset, main_#t~mem241#1, main_#t~mem242#1.base, main_#t~mem242#1.offset, main_#t~mem243#1.base, main_#t~mem243#1.offset, main_#t~mem244#1.base, main_#t~mem244#1.offset, main_#t~mem245#1.base, main_#t~mem245#1.offset, main_#t~mem246#1.base, main_#t~mem246#1.offset, main_#t~mem247#1, main_#t~mem248#1.base, main_#t~mem248#1.offset, main_#t~mem251#1, main_#t~mem249#1.base, main_#t~mem249#1.offset, main_#t~mem250#1, main_#t~mem252#1.base, main_#t~mem252#1.offset, main_#t~mem253#1.base, main_#t~mem253#1.offset, main_#t~mem254#1, main_#t~post255#1, main_#t~mem256#1.base, main_#t~mem256#1.offset, main_#t~mem257#1.base, main_#t~mem257#1.offset, main_#t~mem258#1.base, main_#t~mem258#1.offset, main_#t~mem259#1.base, main_#t~mem259#1.offset, main_#t~mem260#1.base, main_#t~mem260#1.offset, main_#t~mem261#1.base, main_#t~mem261#1.offset, main_#t~mem262#1.base, main_#t~mem262#1.offset, main_#t~mem263#1.base, main_#t~mem263#1.offset, main_~_hd_head~0#1.base, main_~_hd_head~0#1.offset, main_#t~mem264#1.base, main_#t~mem264#1.offset, main_#t~mem265#1, main_#t~post266#1, main_~_hd_bkt~0#1, main_~_hd_hh_del~0#1.base, main_~_hd_hh_del~0#1.offset, main_#t~mem178#1, main_#t~post179#1, main_#t~mem180#1, main_#t~mem267#1.base, main_#t~mem267#1.offset, main_~#i~0#1.base, main_~#i~0#1.offset, main_~user~0#1.base, main_~user~0#1.offset, main_~tmp~0#1.base, main_~tmp~0#1.offset, main_~users~0#1.base, main_~users~0#1.offset;call main_~#i~0#1.base, main_~#i~0#1.offset := #Ultimate.allocOnStack(4);havoc main_~user~0#1.base, main_~user~0#1.offset;havoc main_~tmp~0#1.base, main_~tmp~0#1.offset;main_~users~0#1.base, main_~users~0#1.offset := 0, 0;call write~int(0, main_~#i~0#1.base, main_~#i~0#1.offset, 4); {8388#(<= 0 ~alt_malloc_balance~0)} is VALID [2022-02-21 03:16:52,604 INFO L290 TraceCheckUtils]: 2: Hoare triple {8388#(<= 0 ~alt_malloc_balance~0)} call main_#t~mem42#1 := read~int(main_~#i~0#1.base, main_~#i~0#1.offset, 4); {8388#(<= 0 ~alt_malloc_balance~0)} is VALID [2022-02-21 03:16:52,605 INFO L290 TraceCheckUtils]: 3: Hoare triple {8388#(<= 0 ~alt_malloc_balance~0)} assume !!(main_#t~mem42#1 < 10);havoc main_#t~mem42#1;assume { :begin_inline_real_malloc } true;real_malloc_#in~n#1 := 40;havoc real_malloc_#res#1.base, real_malloc_#res#1.offset;havoc real_malloc_#t~malloc39#1.base, real_malloc_#t~malloc39#1.offset, real_malloc_~n#1;real_malloc_~n#1 := real_malloc_#in~n#1;call real_malloc_#t~malloc39#1.base, real_malloc_#t~malloc39#1.offset := #Ultimate.allocOnHeap(real_malloc_~n#1);real_malloc_#res#1.base, real_malloc_#res#1.offset := real_malloc_#t~malloc39#1.base, real_malloc_#t~malloc39#1.offset;havoc real_malloc_#t~malloc39#1.base, real_malloc_#t~malloc39#1.offset; {8388#(<= 0 ~alt_malloc_balance~0)} is VALID [2022-02-21 03:16:52,605 INFO L290 TraceCheckUtils]: 4: Hoare triple {8388#(<= 0 ~alt_malloc_balance~0)} main_#t~ret43#1.base, main_#t~ret43#1.offset := real_malloc_#res#1.base, real_malloc_#res#1.offset;assume { :end_inline_real_malloc } true;main_~user~0#1.base, main_~user~0#1.offset := main_#t~ret43#1.base, main_#t~ret43#1.offset;havoc main_#t~ret43#1.base, main_#t~ret43#1.offset; {8388#(<= 0 ~alt_malloc_balance~0)} is VALID [2022-02-21 03:16:52,605 INFO L290 TraceCheckUtils]: 5: Hoare triple {8388#(<= 0 ~alt_malloc_balance~0)} assume !(main_~user~0#1.base == 0 && main_~user~0#1.offset == 0); {8388#(<= 0 ~alt_malloc_balance~0)} is VALID [2022-02-21 03:16:52,606 INFO L290 TraceCheckUtils]: 6: Hoare triple {8388#(<= 0 ~alt_malloc_balance~0)} call main_#t~mem44#1 := read~int(main_~#i~0#1.base, main_~#i~0#1.offset, 4);call write~int(main_#t~mem44#1, main_~user~0#1.base, main_~user~0#1.offset, 4);havoc main_#t~mem44#1;call main_#t~mem45#1 := read~int(main_~#i~0#1.base, main_~#i~0#1.offset, 4);call main_#t~mem46#1 := read~int(main_~#i~0#1.base, main_~#i~0#1.offset, 4); {8388#(<= 0 ~alt_malloc_balance~0)} is VALID [2022-02-21 03:16:52,606 INFO L290 TraceCheckUtils]: 7: Hoare triple {8388#(<= 0 ~alt_malloc_balance~0)} assume main_#t~mem45#1 * main_#t~mem46#1 <= 2147483647; {8388#(<= 0 ~alt_malloc_balance~0)} is VALID [2022-02-21 03:16:52,606 INFO L290 TraceCheckUtils]: 8: Hoare triple {8388#(<= 0 ~alt_malloc_balance~0)} assume main_#t~mem45#1 * main_#t~mem46#1 >= -2147483648;call write~int(main_#t~mem45#1 * main_#t~mem46#1, main_~user~0#1.base, 4 + main_~user~0#1.offset, 4);havoc main_#t~mem45#1;havoc main_#t~mem46#1; {8388#(<= 0 ~alt_malloc_balance~0)} is VALID [2022-02-21 03:16:52,606 INFO L290 TraceCheckUtils]: 9: Hoare triple {8388#(<= 0 ~alt_malloc_balance~0)} havoc main_~_ha_hashv~0#1; {8388#(<= 0 ~alt_malloc_balance~0)} is VALID [2022-02-21 03:16:52,607 INFO L290 TraceCheckUtils]: 10: Hoare triple {8388#(<= 0 ~alt_malloc_balance~0)} goto; {8388#(<= 0 ~alt_malloc_balance~0)} is VALID [2022-02-21 03:16:52,607 INFO L290 TraceCheckUtils]: 11: Hoare triple {8388#(<= 0 ~alt_malloc_balance~0)} havoc main_~_hj_i~0#1;havoc main_~_hj_j~0#1;havoc main_~_hj_k~0#1;main_~_hj_key~0#1.base, main_~_hj_key~0#1.offset := main_~user~0#1.base, main_~user~0#1.offset;main_~_ha_hashv~0#1 := 4276993775;main_~_hj_j~0#1 := 2654435769;main_~_hj_i~0#1 := main_~_hj_j~0#1;main_~_hj_k~0#1 := 4; {8388#(<= 0 ~alt_malloc_balance~0)} is VALID [2022-02-21 03:16:52,607 INFO L290 TraceCheckUtils]: 12: Hoare triple {8388#(<= 0 ~alt_malloc_balance~0)} assume !(main_~_hj_k~0#1 % 4294967296 >= 12); {8388#(<= 0 ~alt_malloc_balance~0)} is VALID [2022-02-21 03:16:52,608 INFO L290 TraceCheckUtils]: 13: Hoare triple {8388#(<= 0 ~alt_malloc_balance~0)} main_~_ha_hashv~0#1 := 4 + main_~_ha_hashv~0#1;main_#t~switch59#1 := 11 == main_~_hj_k~0#1; {8388#(<= 0 ~alt_malloc_balance~0)} is VALID [2022-02-21 03:16:52,608 INFO L290 TraceCheckUtils]: 14: Hoare triple {8388#(<= 0 ~alt_malloc_balance~0)} assume !main_#t~switch59#1; {8388#(<= 0 ~alt_malloc_balance~0)} is VALID [2022-02-21 03:16:52,608 INFO L290 TraceCheckUtils]: 15: Hoare triple {8388#(<= 0 ~alt_malloc_balance~0)} main_#t~switch59#1 := main_#t~switch59#1 || 10 == main_~_hj_k~0#1; {8388#(<= 0 ~alt_malloc_balance~0)} is VALID [2022-02-21 03:16:52,608 INFO L290 TraceCheckUtils]: 16: Hoare triple {8388#(<= 0 ~alt_malloc_balance~0)} assume !main_#t~switch59#1; {8388#(<= 0 ~alt_malloc_balance~0)} is VALID [2022-02-21 03:16:52,609 INFO L290 TraceCheckUtils]: 17: Hoare triple {8388#(<= 0 ~alt_malloc_balance~0)} main_#t~switch59#1 := main_#t~switch59#1 || 9 == main_~_hj_k~0#1; {8388#(<= 0 ~alt_malloc_balance~0)} is VALID [2022-02-21 03:16:52,609 INFO L290 TraceCheckUtils]: 18: Hoare triple {8388#(<= 0 ~alt_malloc_balance~0)} assume !main_#t~switch59#1; {8388#(<= 0 ~alt_malloc_balance~0)} is VALID [2022-02-21 03:16:52,609 INFO L290 TraceCheckUtils]: 19: Hoare triple {8388#(<= 0 ~alt_malloc_balance~0)} main_#t~switch59#1 := main_#t~switch59#1 || 8 == main_~_hj_k~0#1; {8388#(<= 0 ~alt_malloc_balance~0)} is VALID [2022-02-21 03:16:52,610 INFO L290 TraceCheckUtils]: 20: Hoare triple {8388#(<= 0 ~alt_malloc_balance~0)} assume !main_#t~switch59#1; {8388#(<= 0 ~alt_malloc_balance~0)} is VALID [2022-02-21 03:16:52,610 INFO L290 TraceCheckUtils]: 21: Hoare triple {8388#(<= 0 ~alt_malloc_balance~0)} main_#t~switch59#1 := main_#t~switch59#1 || 7 == main_~_hj_k~0#1; {8388#(<= 0 ~alt_malloc_balance~0)} is VALID [2022-02-21 03:16:52,610 INFO L290 TraceCheckUtils]: 22: Hoare triple {8388#(<= 0 ~alt_malloc_balance~0)} assume !main_#t~switch59#1; {8388#(<= 0 ~alt_malloc_balance~0)} is VALID [2022-02-21 03:16:52,610 INFO L290 TraceCheckUtils]: 23: Hoare triple {8388#(<= 0 ~alt_malloc_balance~0)} main_#t~switch59#1 := main_#t~switch59#1 || 6 == main_~_hj_k~0#1; {8388#(<= 0 ~alt_malloc_balance~0)} is VALID [2022-02-21 03:16:52,611 INFO L290 TraceCheckUtils]: 24: Hoare triple {8388#(<= 0 ~alt_malloc_balance~0)} assume !main_#t~switch59#1; {8388#(<= 0 ~alt_malloc_balance~0)} is VALID [2022-02-21 03:16:52,611 INFO L290 TraceCheckUtils]: 25: Hoare triple {8388#(<= 0 ~alt_malloc_balance~0)} main_#t~switch59#1 := main_#t~switch59#1 || 5 == main_~_hj_k~0#1; {8388#(<= 0 ~alt_malloc_balance~0)} is VALID [2022-02-21 03:16:52,611 INFO L290 TraceCheckUtils]: 26: Hoare triple {8388#(<= 0 ~alt_malloc_balance~0)} assume !main_#t~switch59#1; {8388#(<= 0 ~alt_malloc_balance~0)} is VALID [2022-02-21 03:16:52,612 INFO L290 TraceCheckUtils]: 27: Hoare triple {8388#(<= 0 ~alt_malloc_balance~0)} main_#t~switch59#1 := main_#t~switch59#1 || 4 == main_~_hj_k~0#1; {8388#(<= 0 ~alt_malloc_balance~0)} is VALID [2022-02-21 03:16:52,612 INFO L290 TraceCheckUtils]: 28: Hoare triple {8388#(<= 0 ~alt_malloc_balance~0)} assume main_#t~switch59#1;call main_#t~mem67#1 := read~int(main_~_hj_key~0#1.base, 3 + main_~_hj_key~0#1.offset, 1);main_~_hj_i~0#1 := main_~_hj_i~0#1 + 16777216 * (main_#t~mem67#1 % 256);havoc main_#t~mem67#1; {8388#(<= 0 ~alt_malloc_balance~0)} is VALID [2022-02-21 03:16:52,612 INFO L290 TraceCheckUtils]: 29: Hoare triple {8388#(<= 0 ~alt_malloc_balance~0)} main_#t~switch59#1 := main_#t~switch59#1 || 3 == main_~_hj_k~0#1; {8388#(<= 0 ~alt_malloc_balance~0)} is VALID [2022-02-21 03:16:52,613 INFO L290 TraceCheckUtils]: 30: Hoare triple {8388#(<= 0 ~alt_malloc_balance~0)} assume main_#t~switch59#1;call main_#t~mem68#1 := read~int(main_~_hj_key~0#1.base, 2 + main_~_hj_key~0#1.offset, 1);main_~_hj_i~0#1 := main_~_hj_i~0#1 + 65536 * (main_#t~mem68#1 % 256);havoc main_#t~mem68#1; {8388#(<= 0 ~alt_malloc_balance~0)} is VALID [2022-02-21 03:16:52,613 INFO L290 TraceCheckUtils]: 31: Hoare triple {8388#(<= 0 ~alt_malloc_balance~0)} main_#t~switch59#1 := main_#t~switch59#1 || 2 == main_~_hj_k~0#1; {8388#(<= 0 ~alt_malloc_balance~0)} is VALID [2022-02-21 03:16:52,613 INFO L290 TraceCheckUtils]: 32: Hoare triple {8388#(<= 0 ~alt_malloc_balance~0)} assume main_#t~switch59#1;call main_#t~mem69#1 := read~int(main_~_hj_key~0#1.base, 1 + main_~_hj_key~0#1.offset, 1);main_~_hj_i~0#1 := main_~_hj_i~0#1 + 256 * (main_#t~mem69#1 % 256);havoc main_#t~mem69#1; {8388#(<= 0 ~alt_malloc_balance~0)} is VALID [2022-02-21 03:16:52,613 INFO L290 TraceCheckUtils]: 33: Hoare triple {8388#(<= 0 ~alt_malloc_balance~0)} main_#t~switch59#1 := main_#t~switch59#1 || 1 == main_~_hj_k~0#1; {8388#(<= 0 ~alt_malloc_balance~0)} is VALID [2022-02-21 03:16:52,614 INFO L290 TraceCheckUtils]: 34: Hoare triple {8388#(<= 0 ~alt_malloc_balance~0)} assume main_#t~switch59#1;call main_#t~mem70#1 := read~int(main_~_hj_key~0#1.base, main_~_hj_key~0#1.offset, 1);main_~_hj_i~0#1 := main_~_hj_i~0#1 + main_#t~mem70#1 % 256;havoc main_#t~mem70#1; {8388#(<= 0 ~alt_malloc_balance~0)} is VALID [2022-02-21 03:16:52,615 INFO L290 TraceCheckUtils]: 35: Hoare triple {8388#(<= 0 ~alt_malloc_balance~0)} havoc main_#t~switch59#1; {8388#(<= 0 ~alt_malloc_balance~0)} is VALID [2022-02-21 03:16:52,618 INFO L290 TraceCheckUtils]: 36: Hoare triple {8388#(<= 0 ~alt_malloc_balance~0)} main_~_hj_i~0#1 := main_~_hj_i~0#1 - main_~_hj_j~0#1;main_~_hj_i~0#1 := main_~_hj_i~0#1 - main_~_ha_hashv~0#1;main_~_hj_i~0#1 := (if (1 == main_~_hj_i~0#1 || 0 == main_~_hj_i~0#1) && (1 == main_~_ha_hashv~0#1 / 8192 || 0 == main_~_ha_hashv~0#1 / 8192) then (if main_~_hj_i~0#1 == main_~_ha_hashv~0#1 / 8192 then 0 else 1) else (if 0 == main_~_hj_i~0#1 then main_~_ha_hashv~0#1 / 8192 else (if 0 == main_~_ha_hashv~0#1 / 8192 then main_~_hj_i~0#1 else ~bitwiseXOr(main_~_hj_i~0#1, main_~_ha_hashv~0#1 / 8192))));main_~_hj_j~0#1 := main_~_hj_j~0#1 - main_~_ha_hashv~0#1;main_~_hj_j~0#1 := main_~_hj_j~0#1 - main_~_hj_i~0#1;main_~_hj_j~0#1 := (if (1 == main_~_hj_j~0#1 || 0 == main_~_hj_j~0#1) && (1 == 256 * main_~_hj_i~0#1 || 0 == 256 * main_~_hj_i~0#1) then (if main_~_hj_j~0#1 == 256 * main_~_hj_i~0#1 then 0 else 1) else (if 0 == main_~_hj_j~0#1 then 256 * main_~_hj_i~0#1 else (if 0 == 256 * main_~_hj_i~0#1 then main_~_hj_j~0#1 else ~bitwiseXOr(main_~_hj_j~0#1, 256 * main_~_hj_i~0#1))));main_~_ha_hashv~0#1 := main_~_ha_hashv~0#1 - main_~_hj_i~0#1;main_~_ha_hashv~0#1 := main_~_ha_hashv~0#1 - main_~_hj_j~0#1;main_~_ha_hashv~0#1 := (if (1 == main_~_ha_hashv~0#1 || 0 == main_~_ha_hashv~0#1) && (1 == main_~_hj_j~0#1 / 8192 || 0 == main_~_hj_j~0#1 / 8192) then (if main_~_ha_hashv~0#1 == main_~_hj_j~0#1 / 8192 then 0 else 1) else (if 0 == main_~_ha_hashv~0#1 then main_~_hj_j~0#1 / 8192 else (if 0 == main_~_hj_j~0#1 / 8192 then main_~_ha_hashv~0#1 else ~bitwiseXOr(main_~_ha_hashv~0#1, main_~_hj_j~0#1 / 8192))));main_~_hj_i~0#1 := main_~_hj_i~0#1 - main_~_hj_j~0#1;main_~_hj_i~0#1 := main_~_hj_i~0#1 - main_~_ha_hashv~0#1;main_~_hj_i~0#1 := (if (1 == main_~_hj_i~0#1 || 0 == main_~_hj_i~0#1) && (1 == main_~_ha_hashv~0#1 / 4096 || 0 == main_~_ha_hashv~0#1 / 4096) then (if main_~_hj_i~0#1 == main_~_ha_hashv~0#1 / 4096 then 0 else 1) else (if 0 == main_~_hj_i~0#1 then main_~_ha_hashv~0#1 / 4096 else (if 0 == main_~_ha_hashv~0#1 / 4096 then main_~_hj_i~0#1 else ~bitwiseXOr(main_~_hj_i~0#1, main_~_ha_hashv~0#1 / 4096))));main_~_hj_j~0#1 := main_~_hj_j~0#1 - main_~_ha_hashv~0#1;main_~_hj_j~0#1 := main_~_hj_j~0#1 - main_~_hj_i~0#1;main_~_hj_j~0#1 := (if (1 == main_~_hj_j~0#1 || 0 == main_~_hj_j~0#1) && (1 == 65536 * main_~_hj_i~0#1 || 0 == 65536 * main_~_hj_i~0#1) then (if main_~_hj_j~0#1 == 65536 * main_~_hj_i~0#1 then 0 else 1) else (if 0 == main_~_hj_j~0#1 then 65536 * main_~_hj_i~0#1 else (if 0 == 65536 * main_~_hj_i~0#1 then main_~_hj_j~0#1 else ~bitwiseXOr(main_~_hj_j~0#1, 65536 * main_~_hj_i~0#1))));main_~_ha_hashv~0#1 := main_~_ha_hashv~0#1 - main_~_hj_i~0#1;main_~_ha_hashv~0#1 := main_~_ha_hashv~0#1 - main_~_hj_j~0#1;main_~_ha_hashv~0#1 := (if (1 == main_~_ha_hashv~0#1 || 0 == main_~_ha_hashv~0#1) && (1 == main_~_hj_j~0#1 / 32 || 0 == main_~_hj_j~0#1 / 32) then (if main_~_ha_hashv~0#1 == main_~_hj_j~0#1 / 32 then 0 else 1) else (if 0 == main_~_ha_hashv~0#1 then main_~_hj_j~0#1 / 32 else (if 0 == main_~_hj_j~0#1 / 32 then main_~_ha_hashv~0#1 else ~bitwiseXOr(main_~_ha_hashv~0#1, main_~_hj_j~0#1 / 32))));main_~_hj_i~0#1 := main_~_hj_i~0#1 - main_~_hj_j~0#1;main_~_hj_i~0#1 := main_~_hj_i~0#1 - main_~_ha_hashv~0#1;main_~_hj_i~0#1 := (if (1 == main_~_hj_i~0#1 || 0 == main_~_hj_i~0#1) && (1 == main_~_ha_hashv~0#1 / 8 || 0 == main_~_ha_hashv~0#1 / 8) then (if main_~_hj_i~0#1 == main_~_ha_hashv~0#1 / 8 then 0 else 1) else (if 0 == main_~_hj_i~0#1 then main_~_ha_hashv~0#1 / 8 else (if 0 == main_~_ha_hashv~0#1 / 8 then main_~_hj_i~0#1 else ~bitwiseXOr(main_~_hj_i~0#1, main_~_ha_hashv~0#1 / 8))));main_~_hj_j~0#1 := main_~_hj_j~0#1 - main_~_ha_hashv~0#1;main_~_hj_j~0#1 := main_~_hj_j~0#1 - main_~_hj_i~0#1;main_~_hj_j~0#1 := (if (1 == main_~_hj_j~0#1 || 0 == main_~_hj_j~0#1) && (1 == 1024 * main_~_hj_i~0#1 || 0 == 1024 * main_~_hj_i~0#1) then (if main_~_hj_j~0#1 == 1024 * main_~_hj_i~0#1 then 0 else 1) else (if 0 == main_~_hj_j~0#1 then 1024 * main_~_hj_i~0#1 else (if 0 == 1024 * main_~_hj_i~0#1 then main_~_hj_j~0#1 else ~bitwiseXOr(main_~_hj_j~0#1, 1024 * main_~_hj_i~0#1))));main_~_ha_hashv~0#1 := main_~_ha_hashv~0#1 - main_~_hj_i~0#1;main_~_ha_hashv~0#1 := main_~_ha_hashv~0#1 - main_~_hj_j~0#1;main_~_ha_hashv~0#1 := (if (1 == main_~_ha_hashv~0#1 || 0 == main_~_ha_hashv~0#1) && (1 == main_~_hj_j~0#1 / 32768 || 0 == main_~_hj_j~0#1 / 32768) then (if main_~_ha_hashv~0#1 == main_~_hj_j~0#1 / 32768 then 0 else 1) else (if 0 == main_~_ha_hashv~0#1 then main_~_hj_j~0#1 / 32768 else (if 0 == main_~_hj_j~0#1 / 32768 then main_~_ha_hashv~0#1 else ~bitwiseXOr(main_~_ha_hashv~0#1, main_~_hj_j~0#1 / 32768)))); {8388#(<= 0 ~alt_malloc_balance~0)} is VALID [2022-02-21 03:16:52,618 INFO L290 TraceCheckUtils]: 37: Hoare triple {8388#(<= 0 ~alt_malloc_balance~0)} goto; {8388#(<= 0 ~alt_malloc_balance~0)} is VALID [2022-02-21 03:16:52,619 INFO L290 TraceCheckUtils]: 38: Hoare triple {8388#(<= 0 ~alt_malloc_balance~0)} goto; {8388#(<= 0 ~alt_malloc_balance~0)} is VALID [2022-02-21 03:16:52,619 INFO L290 TraceCheckUtils]: 39: Hoare triple {8388#(<= 0 ~alt_malloc_balance~0)} goto; {8388#(<= 0 ~alt_malloc_balance~0)} is VALID [2022-02-21 03:16:52,619 INFO L290 TraceCheckUtils]: 40: Hoare triple {8388#(<= 0 ~alt_malloc_balance~0)} call write~int(main_~_ha_hashv~0#1, main_~user~0#1.base, 36 + main_~user~0#1.offset, 4);call write~$Pointer$(main_~user~0#1.base, main_~user~0#1.offset, main_~user~0#1.base, 28 + main_~user~0#1.offset, 4);call write~int(4, main_~user~0#1.base, 32 + main_~user~0#1.offset, 4); {8388#(<= 0 ~alt_malloc_balance~0)} is VALID [2022-02-21 03:16:52,620 INFO L290 TraceCheckUtils]: 41: Hoare triple {8388#(<= 0 ~alt_malloc_balance~0)} assume main_~users~0#1.base == 0 && main_~users~0#1.offset == 0;call write~$Pointer$(0, 0, main_~user~0#1.base, 16 + main_~user~0#1.offset, 4);call write~$Pointer$(0, 0, main_~user~0#1.base, 12 + main_~user~0#1.offset, 4); {8388#(<= 0 ~alt_malloc_balance~0)} is VALID [2022-02-21 03:16:52,620 INFO L272 TraceCheckUtils]: 42: Hoare triple {8388#(<= 0 ~alt_malloc_balance~0)} call main_#t~ret71#1.base, main_#t~ret71#1.offset := alt_malloc(44); {8388#(<= 0 ~alt_malloc_balance~0)} is VALID [2022-02-21 03:16:52,620 INFO L290 TraceCheckUtils]: 43: Hoare triple {8388#(<= 0 ~alt_malloc_balance~0)} ~sz := #in~sz;#t~post31 := ~alt_malloc_balance~0; {8518#(<= 0 |alt_malloc_#t~post31|)} is VALID [2022-02-21 03:16:52,621 INFO L290 TraceCheckUtils]: 44: Hoare triple {8518#(<= 0 |alt_malloc_#t~post31|)} assume 1 + #t~post31 <= 2147483647; {8518#(<= 0 |alt_malloc_#t~post31|)} is VALID [2022-02-21 03:16:52,622 INFO L290 TraceCheckUtils]: 45: Hoare triple {8518#(<= 0 |alt_malloc_#t~post31|)} assume !(1 + #t~post31 >= -2147483648); {8384#false} is VALID [2022-02-21 03:16:52,622 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-21 03:16:52,622 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-21 03:16:52,622 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 03:16:52,622 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [77465280] [2022-02-21 03:16:52,622 WARN L317 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-02-21 03:16:52,622 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [974560349] [2022-02-21 03:16:52,622 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [974560349] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-21 03:16:52,622 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-21 03:16:52,623 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-02-21 03:16:52,623 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1097107515] [2022-02-21 03:16:52,623 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-21 03:16:52,623 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 15.0) internal successors, (45), 3 states have internal predecessors, (45), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 46 [2022-02-21 03:16:52,623 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-21 03:16:52,636 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 4 states, 3 states have (on average 15.0) internal successors, (45), 3 states have internal predecessors, (45), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:16:52,694 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 46 edges. 46 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:16:52,694 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-02-21 03:16:52,694 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 03:16:52,696 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-02-21 03:16:52,696 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-02-21 03:16:52,696 INFO L87 Difference]: Start difference. First operand 415 states and 518 transitions. Second operand has 4 states, 3 states have (on average 15.0) internal successors, (45), 3 states have internal predecessors, (45), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:16:53,470 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:16:53,470 INFO L93 Difference]: Finished difference Result 723 states and 914 transitions. [2022-02-21 03:16:53,470 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-02-21 03:16:53,470 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 15.0) internal successors, (45), 3 states have internal predecessors, (45), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 46 [2022-02-21 03:16:53,471 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-21 03:16:53,471 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 3 states have (on average 15.0) internal successors, (45), 3 states have internal predecessors, (45), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:16:53,474 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 553 transitions. [2022-02-21 03:16:53,474 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 3 states have (on average 15.0) internal successors, (45), 3 states have internal predecessors, (45), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:16:53,477 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 553 transitions. [2022-02-21 03:16:53,477 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 553 transitions. [2022-02-21 03:16:53,883 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 553 edges. 553 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:16:53,901 INFO L225 Difference]: With dead ends: 723 [2022-02-21 03:16:53,901 INFO L226 Difference]: Without dead ends: 721 [2022-02-21 03:16:53,902 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-02-21 03:16:53,903 INFO L933 BasicCegarLoop]: 288 mSDtfsCounter, 226 mSDsluCounter, 560 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 226 SdHoareTripleChecker+Valid, 848 SdHoareTripleChecker+Invalid, 29 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-21 03:16:53,903 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [226 Valid, 848 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-21 03:16:53,904 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 721 states. [2022-02-21 03:16:53,986 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 721 to 710. [2022-02-21 03:16:53,986 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 03:16:53,988 INFO L82 GeneralOperation]: Start isEquivalent. First operand 721 states. Second operand has 710 states, 666 states have (on average 1.2942942942942943) internal successors, (862), 682 states have internal predecessors, (862), 23 states have call successors, (23), 10 states have call predecessors, (23), 7 states have return successors, (26), 18 states have call predecessors, (26), 23 states have call successors, (26) [2022-02-21 03:16:53,989 INFO L74 IsIncluded]: Start isIncluded. First operand 721 states. Second operand has 710 states, 666 states have (on average 1.2942942942942943) internal successors, (862), 682 states have internal predecessors, (862), 23 states have call successors, (23), 10 states have call predecessors, (23), 7 states have return successors, (26), 18 states have call predecessors, (26), 23 states have call successors, (26) [2022-02-21 03:16:53,990 INFO L87 Difference]: Start difference. First operand 721 states. Second operand has 710 states, 666 states have (on average 1.2942942942942943) internal successors, (862), 682 states have internal predecessors, (862), 23 states have call successors, (23), 10 states have call predecessors, (23), 7 states have return successors, (26), 18 states have call predecessors, (26), 23 states have call successors, (26) [2022-02-21 03:16:54,007 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:16:54,007 INFO L93 Difference]: Finished difference Result 721 states and 911 transitions. [2022-02-21 03:16:54,007 INFO L276 IsEmpty]: Start isEmpty. Operand 721 states and 911 transitions. [2022-02-21 03:16:54,008 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:16:54,008 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:16:54,010 INFO L74 IsIncluded]: Start isIncluded. First operand has 710 states, 666 states have (on average 1.2942942942942943) internal successors, (862), 682 states have internal predecessors, (862), 23 states have call successors, (23), 10 states have call predecessors, (23), 7 states have return successors, (26), 18 states have call predecessors, (26), 23 states have call successors, (26) Second operand 721 states. [2022-02-21 03:16:54,011 INFO L87 Difference]: Start difference. First operand has 710 states, 666 states have (on average 1.2942942942942943) internal successors, (862), 682 states have internal predecessors, (862), 23 states have call successors, (23), 10 states have call predecessors, (23), 7 states have return successors, (26), 18 states have call predecessors, (26), 23 states have call successors, (26) Second operand 721 states. [2022-02-21 03:16:54,027 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:16:54,027 INFO L93 Difference]: Finished difference Result 721 states and 911 transitions. [2022-02-21 03:16:54,027 INFO L276 IsEmpty]: Start isEmpty. Operand 721 states and 911 transitions. [2022-02-21 03:16:54,028 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:16:54,029 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:16:54,029 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 03:16:54,029 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 03:16:54,030 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 710 states, 666 states have (on average 1.2942942942942943) internal successors, (862), 682 states have internal predecessors, (862), 23 states have call successors, (23), 10 states have call predecessors, (23), 7 states have return successors, (26), 18 states have call predecessors, (26), 23 states have call successors, (26) [2022-02-21 03:16:54,048 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 710 states to 710 states and 911 transitions. [2022-02-21 03:16:54,048 INFO L78 Accepts]: Start accepts. Automaton has 710 states and 911 transitions. Word has length 46 [2022-02-21 03:16:54,049 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-21 03:16:54,049 INFO L470 AbstractCegarLoop]: Abstraction has 710 states and 911 transitions. [2022-02-21 03:16:54,049 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 15.0) internal successors, (45), 3 states have internal predecessors, (45), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:16:54,049 INFO L276 IsEmpty]: Start isEmpty. Operand 710 states and 911 transitions. [2022-02-21 03:16:54,049 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2022-02-21 03:16:54,050 INFO L506 BasicCegarLoop]: Found error trace [2022-02-21 03:16:54,050 INFO L514 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-21 03:16:54,075 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-02-21 03:16:54,266 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-21 03:16:54,266 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [alt_mallocErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, alt_mallocErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, alt_freeErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2022-02-21 03:16:54,266 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:16:54,266 INFO L85 PathProgramCache]: Analyzing trace with hash -2118750223, now seen corresponding path program 1 times [2022-02-21 03:16:54,267 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:16:54,267 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1500737821] [2022-02-21 03:16:54,267 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:16:54,267 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:16:54,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:16:54,362 INFO L290 TraceCheckUtils]: 0: Hoare triple {11665#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(21, 2);~#alt_malloc_sizes~0.base, ~#alt_malloc_sizes~0.offset := 3, 0;call #Ultimate.allocInit(40, 3);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#alt_malloc_sizes~0.base);~alt_malloc_balance~0 := 0;~alt_memcmp_count~0 := 0;~alt_bzero_count~0 := 0; {11665#true} is VALID [2022-02-21 03:16:54,363 INFO L290 TraceCheckUtils]: 1: Hoare triple {11665#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret43#1.base, main_#t~ret43#1.offset, main_#t~mem44#1, main_#t~mem45#1, main_#t~mem46#1, main_#t~mem48#1, main_#t~mem47#1, main_#t~mem49#1, main_#t~mem50#1, main_#t~mem52#1, main_#t~mem51#1, main_#t~mem53#1, main_#t~mem54#1, main_#t~mem56#1, main_#t~mem55#1, main_#t~mem57#1, main_#t~mem58#1, main_#t~switch59#1, main_#t~mem60#1, main_#t~mem61#1, main_#t~mem62#1, main_#t~mem63#1, main_#t~mem64#1, main_#t~mem65#1, main_#t~mem66#1, main_#t~mem67#1, main_#t~mem68#1, main_#t~mem69#1, main_#t~mem70#1, main_~_hj_i~0#1, main_~_hj_j~0#1, main_~_hj_k~0#1, main_~_hj_key~0#1.base, main_~_hj_key~0#1.offset, main_#t~ret71#1.base, main_#t~ret71#1.offset, main_#t~mem72#1.base, main_#t~mem72#1.offset, main_#t~mem73#1.base, main_#t~mem73#1.offset, main_#t~mem74#1.base, main_#t~mem74#1.offset, main_#t~mem75#1.base, main_#t~mem75#1.offset, main_#t~mem76#1.base, main_#t~mem76#1.offset, main_#t~mem77#1.base, main_#t~mem77#1.offset, main_#t~mem78#1.base, main_#t~mem78#1.offset, main_#t~ret79#1.base, main_#t~ret79#1.offset, main_#t~mem80#1.base, main_#t~mem80#1.offset, main_#t~mem81#1.base, main_#t~mem81#1.offset, main_#t~mem82#1.base, main_#t~mem82#1.offset, main_#t~mem83#1.base, main_#t~mem83#1.offset, main_#t~mem84#1.base, main_#t~mem84#1.offset, main_#t~mem85#1.base, main_#t~mem85#1.offset, main_#t~mem86#1.base, main_#t~mem86#1.offset, main_#t~mem87#1.base, main_#t~mem87#1.offset, main_#t~mem88#1.base, main_#t~mem88#1.offset, main_#t~mem89#1.base, main_#t~mem89#1.offset, main_#t~mem90#1, main_#t~mem91#1.base, main_#t~mem91#1.offset, main_#t~mem92#1.base, main_#t~mem92#1.offset, main_#t~mem93#1.base, main_#t~mem93#1.offset, main_#t~mem94#1.base, main_#t~mem94#1.offset, main_#t~mem95#1, main_#t~post96#1, main_#t~mem97#1.base, main_#t~mem97#1.offset, main_#t~mem98#1, main_#t~mem99#1.base, main_#t~mem99#1.offset, main_#t~mem100#1.base, main_#t~mem100#1.offset, main_#t~mem101#1, main_#t~post102#1, main_#t~mem103#1.base, main_#t~mem103#1.offset, main_#t~mem104#1.base, main_#t~mem104#1.offset, main_#t~mem105#1.base, main_#t~mem105#1.offset, main_#t~mem107#1, main_#t~mem106#1, main_#t~mem108#1.base, main_#t~mem108#1.offset, main_#t~mem109#1, main_#t~short110#1, main_#t~mem111#1.base, main_#t~mem111#1.offset, main_#t~mem112#1, main_#t~ret113#1.base, main_#t~ret113#1.offset, main_#t~mem114#1.base, main_#t~mem114#1.offset, main_#t~mem115#1.base, main_#t~mem115#1.offset, main_#t~mem116#1.base, main_#t~mem116#1.offset, main_#t~mem117#1, main_#t~mem118#1.base, main_#t~mem118#1.offset, main_#t~mem119#1.base, main_#t~mem119#1.offset, main_#t~mem122#1, main_#t~mem120#1.base, main_#t~mem120#1.offset, main_#t~mem121#1, main_#t~mem123#1.base, main_#t~mem123#1.offset, main_#t~mem126#1, main_#t~mem124#1.base, main_#t~mem124#1.offset, main_#t~mem125#1, main_#t~ite127#1, main_#t~mem128#1.base, main_#t~mem128#1.offset, main_#t~mem132#1.base, main_#t~mem132#1.offset, main_#t~mem133#1.base, main_#t~mem133#1.offset, main_#t~mem134#1.base, main_#t~mem134#1.offset, main_#t~mem135#1.base, main_#t~mem135#1.offset, main_#t~mem138#1, main_#t~mem136#1.base, main_#t~mem136#1.offset, main_#t~mem137#1, main_#t~mem139#1.base, main_#t~mem139#1.offset, main_#t~mem140#1, main_#t~pre141#1, main_#t~mem142#1.base, main_#t~mem142#1.offset, main_#t~mem143#1, main_#t~mem144#1.base, main_#t~mem144#1.offset, main_#t~mem145#1, main_#t~post146#1, main_#t~mem150#1, main_#t~mem148#1, main_#t~mem147#1.base, main_#t~mem147#1.offset, main_#t~mem149#1, main_#t~mem151#1, main_#t~post152#1, main_#t~mem153#1.base, main_#t~mem153#1.offset, main_#t~mem154#1.base, main_#t~mem154#1.offset, main_#t~mem155#1.base, main_#t~mem155#1.offset, main_#t~post129#1, main_#t~mem130#1.base, main_#t~mem130#1.offset, main_#t~mem131#1, main_#t~mem156#1.base, main_#t~mem156#1.offset, main_#t~mem157#1.base, main_#t~mem157#1.offset, main_#t~mem158#1.base, main_#t~mem158#1.offset, main_#t~mem159#1, main_#t~mem160#1.base, main_#t~mem160#1.offset, main_#t~mem161#1, main_#t~mem162#1.base, main_#t~mem162#1.offset, main_#t~mem163#1, main_#t~post164#1, main_#t~mem165#1.base, main_#t~mem165#1.offset, main_#t~mem166#1.base, main_#t~mem166#1.offset, main_#t~mem167#1.base, main_#t~mem167#1.offset, main_#t~mem168#1.base, main_#t~mem168#1.offset, main_#t~mem171#1, main_#t~mem169#1.base, main_#t~mem169#1.offset, main_#t~mem170#1, main_#t~ite174#1, main_#t~mem172#1.base, main_#t~mem172#1.offset, main_#t~mem173#1, main_#t~mem175#1.base, main_#t~mem175#1.offset, main_#t~mem176#1, main_#t~mem177#1.base, main_#t~mem177#1.offset, main_~_he_bkt~0#1, main_~_he_bkt_i~0#1, main_~_he_thh~0#1.base, main_~_he_thh~0#1.offset, main_~_he_hh_nxt~0#1.base, main_~_he_hh_nxt~0#1.offset, main_~#_he_new_buckets~0#1.base, main_~#_he_new_buckets~0#1.offset, main_~_he_newbkt~0#1.base, main_~_he_newbkt~0#1.offset, main_~_ha_head~0#1.base, main_~_ha_head~0#1.offset, main_~_ha_bkt~0#1, main_~_ha_hashv~0#1, main_#t~mem40#1, main_#t~post41#1, main_#t~mem42#1, main_#t~mem182#1, main_#t~mem181#1, main_#t~mem183#1, main_#t~mem184#1, main_#t~mem186#1, main_#t~mem185#1, main_#t~mem187#1, main_#t~mem188#1, main_#t~mem190#1, main_#t~mem189#1, main_#t~mem191#1, main_#t~mem192#1, main_#t~switch193#1, main_#t~mem194#1, main_#t~mem195#1, main_#t~mem196#1, main_#t~mem197#1, main_#t~mem198#1, main_#t~mem199#1, main_#t~mem200#1, main_#t~mem201#1, main_#t~mem202#1, main_#t~mem203#1, main_#t~mem204#1, main_~_hj_i~1#1, main_~_hj_j~1#1, main_~_hj_k~1#1, main_~_hj_key~1#1.base, main_~_hj_key~1#1.offset, main_#t~mem205#1.base, main_#t~mem205#1.offset, main_#t~mem206#1, main_#t~mem207#1.base, main_#t~mem207#1.offset, main_#t~mem208#1.base, main_#t~mem208#1.offset, main_#t~mem209#1.base, main_#t~mem209#1.offset, main_#t~mem210#1.base, main_#t~mem210#1.offset, main_#t~mem211#1.base, main_#t~mem211#1.offset, main_#t~mem212#1.base, main_#t~mem212#1.offset, main_#t~mem213#1.base, main_#t~mem213#1.offset, main_#t~mem214#1, main_#t~mem215#1, main_#t~mem216#1, main_#t~short217#1, main_#t~mem218#1.base, main_#t~mem218#1.offset, main_#t~ret219#1, main_#t~mem220#1.base, main_#t~mem220#1.offset, main_#t~mem221#1.base, main_#t~mem221#1.offset, main_#t~mem222#1.base, main_#t~mem222#1.offset, main_#t~mem223#1, main_~_hf_bkt~0#1, main_~_hf_hashv~0#1, main_#t~mem224#1.base, main_#t~mem224#1.offset, main_#t~mem225#1.base, main_#t~mem225#1.offset, main_#t~short226#1, main_#t~mem227#1.base, main_#t~mem227#1.offset, main_#t~mem228#1.base, main_#t~mem228#1.offset, main_#t~mem229#1.base, main_#t~mem229#1.offset, main_#t~mem230#1, main_#t~mem231#1.base, main_#t~mem231#1.offset, main_#t~mem232#1.base, main_#t~mem232#1.offset, main_#t~mem233#1.base, main_#t~mem233#1.offset, main_#t~mem234#1.base, main_#t~mem234#1.offset, main_#t~mem235#1.base, main_#t~mem235#1.offset, main_#t~mem236#1.base, main_#t~mem236#1.offset, main_#t~mem237#1, main_#t~mem238#1.base, main_#t~mem238#1.offset, main_#t~mem239#1.base, main_#t~mem239#1.offset, main_#t~mem240#1.base, main_#t~mem240#1.offset, main_#t~mem241#1, main_#t~mem242#1.base, main_#t~mem242#1.offset, main_#t~mem243#1.base, main_#t~mem243#1.offset, main_#t~mem244#1.base, main_#t~mem244#1.offset, main_#t~mem245#1.base, main_#t~mem245#1.offset, main_#t~mem246#1.base, main_#t~mem246#1.offset, main_#t~mem247#1, main_#t~mem248#1.base, main_#t~mem248#1.offset, main_#t~mem251#1, main_#t~mem249#1.base, main_#t~mem249#1.offset, main_#t~mem250#1, main_#t~mem252#1.base, main_#t~mem252#1.offset, main_#t~mem253#1.base, main_#t~mem253#1.offset, main_#t~mem254#1, main_#t~post255#1, main_#t~mem256#1.base, main_#t~mem256#1.offset, main_#t~mem257#1.base, main_#t~mem257#1.offset, main_#t~mem258#1.base, main_#t~mem258#1.offset, main_#t~mem259#1.base, main_#t~mem259#1.offset, main_#t~mem260#1.base, main_#t~mem260#1.offset, main_#t~mem261#1.base, main_#t~mem261#1.offset, main_#t~mem262#1.base, main_#t~mem262#1.offset, main_#t~mem263#1.base, main_#t~mem263#1.offset, main_~_hd_head~0#1.base, main_~_hd_head~0#1.offset, main_#t~mem264#1.base, main_#t~mem264#1.offset, main_#t~mem265#1, main_#t~post266#1, main_~_hd_bkt~0#1, main_~_hd_hh_del~0#1.base, main_~_hd_hh_del~0#1.offset, main_#t~mem178#1, main_#t~post179#1, main_#t~mem180#1, main_#t~mem267#1.base, main_#t~mem267#1.offset, main_~#i~0#1.base, main_~#i~0#1.offset, main_~user~0#1.base, main_~user~0#1.offset, main_~tmp~0#1.base, main_~tmp~0#1.offset, main_~users~0#1.base, main_~users~0#1.offset;call main_~#i~0#1.base, main_~#i~0#1.offset := #Ultimate.allocOnStack(4);havoc main_~user~0#1.base, main_~user~0#1.offset;havoc main_~tmp~0#1.base, main_~tmp~0#1.offset;main_~users~0#1.base, main_~users~0#1.offset := 0, 0;call write~int(0, main_~#i~0#1.base, main_~#i~0#1.offset, 4); {11667#(= (select (select |#memory_int| |ULTIMATE.start_main_~#i~0#1.base|) |ULTIMATE.start_main_~#i~0#1.offset|) 0)} is VALID [2022-02-21 03:16:54,364 INFO L290 TraceCheckUtils]: 2: Hoare triple {11667#(= (select (select |#memory_int| |ULTIMATE.start_main_~#i~0#1.base|) |ULTIMATE.start_main_~#i~0#1.offset|) 0)} call main_#t~mem42#1 := read~int(main_~#i~0#1.base, main_~#i~0#1.offset, 4); {11668#(= |ULTIMATE.start_main_#t~mem42#1| 0)} is VALID [2022-02-21 03:16:54,364 INFO L290 TraceCheckUtils]: 3: Hoare triple {11668#(= |ULTIMATE.start_main_#t~mem42#1| 0)} assume !(main_#t~mem42#1 < 10);havoc main_#t~mem42#1; {11666#false} is VALID [2022-02-21 03:16:54,364 INFO L290 TraceCheckUtils]: 4: Hoare triple {11666#false} call write~int(0, main_~#i~0#1.base, main_~#i~0#1.offset, 4); {11666#false} is VALID [2022-02-21 03:16:54,365 INFO L290 TraceCheckUtils]: 5: Hoare triple {11666#false} call main_#t~mem180#1 := read~int(main_~#i~0#1.base, main_~#i~0#1.offset, 4); {11666#false} is VALID [2022-02-21 03:16:54,365 INFO L290 TraceCheckUtils]: 6: Hoare triple {11666#false} assume !!(main_#t~mem180#1 < 10);havoc main_#t~mem180#1; {11666#false} is VALID [2022-02-21 03:16:54,365 INFO L290 TraceCheckUtils]: 7: Hoare triple {11666#false} havoc main_~_hf_hashv~0#1; {11666#false} is VALID [2022-02-21 03:16:54,365 INFO L290 TraceCheckUtils]: 8: Hoare triple {11666#false} goto; {11666#false} is VALID [2022-02-21 03:16:54,365 INFO L290 TraceCheckUtils]: 9: Hoare triple {11666#false} havoc main_~_hj_i~1#1;havoc main_~_hj_j~1#1;havoc main_~_hj_k~1#1;main_~_hj_key~1#1.base, main_~_hj_key~1#1.offset := main_~#i~0#1.base, main_~#i~0#1.offset;main_~_hf_hashv~0#1 := 4276993775;main_~_hj_j~1#1 := 2654435769;main_~_hj_i~1#1 := main_~_hj_j~1#1;main_~_hj_k~1#1 := 4; {11666#false} is VALID [2022-02-21 03:16:54,365 INFO L290 TraceCheckUtils]: 10: Hoare triple {11666#false} assume !(main_~_hj_k~1#1 % 4294967296 >= 12); {11666#false} is VALID [2022-02-21 03:16:54,366 INFO L290 TraceCheckUtils]: 11: Hoare triple {11666#false} main_~_hf_hashv~0#1 := 4 + main_~_hf_hashv~0#1;main_#t~switch193#1 := 11 == main_~_hj_k~1#1; {11666#false} is VALID [2022-02-21 03:16:54,366 INFO L290 TraceCheckUtils]: 12: Hoare triple {11666#false} assume main_#t~switch193#1;call main_#t~mem194#1 := read~int(main_~_hj_key~1#1.base, 10 + main_~_hj_key~1#1.offset, 1);main_~_hf_hashv~0#1 := main_~_hf_hashv~0#1 + 16777216 * (main_#t~mem194#1 % 256);havoc main_#t~mem194#1; {11666#false} is VALID [2022-02-21 03:16:54,366 INFO L290 TraceCheckUtils]: 13: Hoare triple {11666#false} main_#t~switch193#1 := main_#t~switch193#1 || 10 == main_~_hj_k~1#1; {11666#false} is VALID [2022-02-21 03:16:54,366 INFO L290 TraceCheckUtils]: 14: Hoare triple {11666#false} assume main_#t~switch193#1;call main_#t~mem195#1 := read~int(main_~_hj_key~1#1.base, 9 + main_~_hj_key~1#1.offset, 1);main_~_hf_hashv~0#1 := main_~_hf_hashv~0#1 + 65536 * (main_#t~mem195#1 % 256);havoc main_#t~mem195#1; {11666#false} is VALID [2022-02-21 03:16:54,366 INFO L290 TraceCheckUtils]: 15: Hoare triple {11666#false} main_#t~switch193#1 := main_#t~switch193#1 || 9 == main_~_hj_k~1#1; {11666#false} is VALID [2022-02-21 03:16:54,366 INFO L290 TraceCheckUtils]: 16: Hoare triple {11666#false} assume main_#t~switch193#1;call main_#t~mem196#1 := read~int(main_~_hj_key~1#1.base, 8 + main_~_hj_key~1#1.offset, 1);main_~_hf_hashv~0#1 := main_~_hf_hashv~0#1 + 256 * (main_#t~mem196#1 % 256);havoc main_#t~mem196#1; {11666#false} is VALID [2022-02-21 03:16:54,367 INFO L290 TraceCheckUtils]: 17: Hoare triple {11666#false} main_#t~switch193#1 := main_#t~switch193#1 || 8 == main_~_hj_k~1#1; {11666#false} is VALID [2022-02-21 03:16:54,367 INFO L290 TraceCheckUtils]: 18: Hoare triple {11666#false} assume main_#t~switch193#1;call main_#t~mem197#1 := read~int(main_~_hj_key~1#1.base, 7 + main_~_hj_key~1#1.offset, 1);main_~_hj_j~1#1 := main_~_hj_j~1#1 + 16777216 * (main_#t~mem197#1 % 256);havoc main_#t~mem197#1; {11666#false} is VALID [2022-02-21 03:16:54,367 INFO L290 TraceCheckUtils]: 19: Hoare triple {11666#false} main_#t~switch193#1 := main_#t~switch193#1 || 7 == main_~_hj_k~1#1; {11666#false} is VALID [2022-02-21 03:16:54,367 INFO L290 TraceCheckUtils]: 20: Hoare triple {11666#false} assume !main_#t~switch193#1; {11666#false} is VALID [2022-02-21 03:16:54,367 INFO L290 TraceCheckUtils]: 21: Hoare triple {11666#false} main_#t~switch193#1 := main_#t~switch193#1 || 6 == main_~_hj_k~1#1; {11666#false} is VALID [2022-02-21 03:16:54,367 INFO L290 TraceCheckUtils]: 22: Hoare triple {11666#false} assume main_#t~switch193#1;call main_#t~mem199#1 := read~int(main_~_hj_key~1#1.base, 5 + main_~_hj_key~1#1.offset, 1);main_~_hj_j~1#1 := main_~_hj_j~1#1 + 256 * (main_#t~mem199#1 % 256);havoc main_#t~mem199#1; {11666#false} is VALID [2022-02-21 03:16:54,367 INFO L290 TraceCheckUtils]: 23: Hoare triple {11666#false} main_#t~switch193#1 := main_#t~switch193#1 || 5 == main_~_hj_k~1#1; {11666#false} is VALID [2022-02-21 03:16:54,368 INFO L290 TraceCheckUtils]: 24: Hoare triple {11666#false} assume main_#t~switch193#1;call main_#t~mem200#1 := read~int(main_~_hj_key~1#1.base, 4 + main_~_hj_key~1#1.offset, 1);main_~_hj_j~1#1 := main_~_hj_j~1#1 + main_#t~mem200#1 % 256;havoc main_#t~mem200#1; {11666#false} is VALID [2022-02-21 03:16:54,368 INFO L290 TraceCheckUtils]: 25: Hoare triple {11666#false} main_#t~switch193#1 := main_#t~switch193#1 || 4 == main_~_hj_k~1#1; {11666#false} is VALID [2022-02-21 03:16:54,368 INFO L290 TraceCheckUtils]: 26: Hoare triple {11666#false} assume main_#t~switch193#1;call main_#t~mem201#1 := read~int(main_~_hj_key~1#1.base, 3 + main_~_hj_key~1#1.offset, 1);main_~_hj_i~1#1 := main_~_hj_i~1#1 + 16777216 * (main_#t~mem201#1 % 256);havoc main_#t~mem201#1; {11666#false} is VALID [2022-02-21 03:16:54,368 INFO L290 TraceCheckUtils]: 27: Hoare triple {11666#false} main_#t~switch193#1 := main_#t~switch193#1 || 3 == main_~_hj_k~1#1; {11666#false} is VALID [2022-02-21 03:16:54,368 INFO L290 TraceCheckUtils]: 28: Hoare triple {11666#false} assume main_#t~switch193#1;call main_#t~mem202#1 := read~int(main_~_hj_key~1#1.base, 2 + main_~_hj_key~1#1.offset, 1);main_~_hj_i~1#1 := main_~_hj_i~1#1 + 65536 * (main_#t~mem202#1 % 256);havoc main_#t~mem202#1; {11666#false} is VALID [2022-02-21 03:16:54,368 INFO L290 TraceCheckUtils]: 29: Hoare triple {11666#false} main_#t~switch193#1 := main_#t~switch193#1 || 2 == main_~_hj_k~1#1; {11666#false} is VALID [2022-02-21 03:16:54,369 INFO L290 TraceCheckUtils]: 30: Hoare triple {11666#false} assume main_#t~switch193#1;call main_#t~mem203#1 := read~int(main_~_hj_key~1#1.base, 1 + main_~_hj_key~1#1.offset, 1);main_~_hj_i~1#1 := main_~_hj_i~1#1 + 256 * (main_#t~mem203#1 % 256);havoc main_#t~mem203#1; {11666#false} is VALID [2022-02-21 03:16:54,369 INFO L290 TraceCheckUtils]: 31: Hoare triple {11666#false} main_#t~switch193#1 := main_#t~switch193#1 || 1 == main_~_hj_k~1#1; {11666#false} is VALID [2022-02-21 03:16:54,369 INFO L290 TraceCheckUtils]: 32: Hoare triple {11666#false} assume main_#t~switch193#1;call main_#t~mem204#1 := read~int(main_~_hj_key~1#1.base, main_~_hj_key~1#1.offset, 1);main_~_hj_i~1#1 := main_~_hj_i~1#1 + main_#t~mem204#1 % 256;havoc main_#t~mem204#1; {11666#false} is VALID [2022-02-21 03:16:54,369 INFO L290 TraceCheckUtils]: 33: Hoare triple {11666#false} havoc main_#t~switch193#1; {11666#false} is VALID [2022-02-21 03:16:54,369 INFO L290 TraceCheckUtils]: 34: Hoare triple {11666#false} main_~_hj_i~1#1 := main_~_hj_i~1#1 - main_~_hj_j~1#1;main_~_hj_i~1#1 := main_~_hj_i~1#1 - main_~_hf_hashv~0#1;main_~_hj_i~1#1 := (if (1 == main_~_hj_i~1#1 || 0 == main_~_hj_i~1#1) && (1 == main_~_hf_hashv~0#1 / 8192 || 0 == main_~_hf_hashv~0#1 / 8192) then (if main_~_hj_i~1#1 == main_~_hf_hashv~0#1 / 8192 then 0 else 1) else (if 0 == main_~_hj_i~1#1 then main_~_hf_hashv~0#1 / 8192 else (if 0 == main_~_hf_hashv~0#1 / 8192 then main_~_hj_i~1#1 else ~bitwiseXOr(main_~_hj_i~1#1, main_~_hf_hashv~0#1 / 8192))));main_~_hj_j~1#1 := main_~_hj_j~1#1 - main_~_hf_hashv~0#1;main_~_hj_j~1#1 := main_~_hj_j~1#1 - main_~_hj_i~1#1;main_~_hj_j~1#1 := (if (1 == main_~_hj_j~1#1 || 0 == main_~_hj_j~1#1) && (1 == 256 * main_~_hj_i~1#1 || 0 == 256 * main_~_hj_i~1#1) then (if main_~_hj_j~1#1 == 256 * main_~_hj_i~1#1 then 0 else 1) else (if 0 == main_~_hj_j~1#1 then 256 * main_~_hj_i~1#1 else (if 0 == 256 * main_~_hj_i~1#1 then main_~_hj_j~1#1 else ~bitwiseXOr(main_~_hj_j~1#1, 256 * main_~_hj_i~1#1))));main_~_hf_hashv~0#1 := main_~_hf_hashv~0#1 - main_~_hj_i~1#1;main_~_hf_hashv~0#1 := main_~_hf_hashv~0#1 - main_~_hj_j~1#1;main_~_hf_hashv~0#1 := (if (1 == main_~_hf_hashv~0#1 || 0 == main_~_hf_hashv~0#1) && (1 == main_~_hj_j~1#1 / 8192 || 0 == main_~_hj_j~1#1 / 8192) then (if main_~_hf_hashv~0#1 == main_~_hj_j~1#1 / 8192 then 0 else 1) else (if 0 == main_~_hf_hashv~0#1 then main_~_hj_j~1#1 / 8192 else (if 0 == main_~_hj_j~1#1 / 8192 then main_~_hf_hashv~0#1 else ~bitwiseXOr(main_~_hf_hashv~0#1, main_~_hj_j~1#1 / 8192))));main_~_hj_i~1#1 := main_~_hj_i~1#1 - main_~_hj_j~1#1;main_~_hj_i~1#1 := main_~_hj_i~1#1 - main_~_hf_hashv~0#1;main_~_hj_i~1#1 := (if (1 == main_~_hj_i~1#1 || 0 == main_~_hj_i~1#1) && (1 == main_~_hf_hashv~0#1 / 4096 || 0 == main_~_hf_hashv~0#1 / 4096) then (if main_~_hj_i~1#1 == main_~_hf_hashv~0#1 / 4096 then 0 else 1) else (if 0 == main_~_hj_i~1#1 then main_~_hf_hashv~0#1 / 4096 else (if 0 == main_~_hf_hashv~0#1 / 4096 then main_~_hj_i~1#1 else ~bitwiseXOr(main_~_hj_i~1#1, main_~_hf_hashv~0#1 / 4096))));main_~_hj_j~1#1 := main_~_hj_j~1#1 - main_~_hf_hashv~0#1;main_~_hj_j~1#1 := main_~_hj_j~1#1 - main_~_hj_i~1#1;main_~_hj_j~1#1 := (if (1 == main_~_hj_j~1#1 || 0 == main_~_hj_j~1#1) && (1 == 65536 * main_~_hj_i~1#1 || 0 == 65536 * main_~_hj_i~1#1) then (if main_~_hj_j~1#1 == 65536 * main_~_hj_i~1#1 then 0 else 1) else (if 0 == main_~_hj_j~1#1 then 65536 * main_~_hj_i~1#1 else (if 0 == 65536 * main_~_hj_i~1#1 then main_~_hj_j~1#1 else ~bitwiseXOr(main_~_hj_j~1#1, 65536 * main_~_hj_i~1#1))));main_~_hf_hashv~0#1 := main_~_hf_hashv~0#1 - main_~_hj_i~1#1;main_~_hf_hashv~0#1 := main_~_hf_hashv~0#1 - main_~_hj_j~1#1;main_~_hf_hashv~0#1 := (if (1 == main_~_hf_hashv~0#1 || 0 == main_~_hf_hashv~0#1) && (1 == main_~_hj_j~1#1 / 32 || 0 == main_~_hj_j~1#1 / 32) then (if main_~_hf_hashv~0#1 == main_~_hj_j~1#1 / 32 then 0 else 1) else (if 0 == main_~_hf_hashv~0#1 then main_~_hj_j~1#1 / 32 else (if 0 == main_~_hj_j~1#1 / 32 then main_~_hf_hashv~0#1 else ~bitwiseXOr(main_~_hf_hashv~0#1, main_~_hj_j~1#1 / 32))));main_~_hj_i~1#1 := main_~_hj_i~1#1 - main_~_hj_j~1#1;main_~_hj_i~1#1 := main_~_hj_i~1#1 - main_~_hf_hashv~0#1;main_~_hj_i~1#1 := (if (1 == main_~_hj_i~1#1 || 0 == main_~_hj_i~1#1) && (1 == main_~_hf_hashv~0#1 / 8 || 0 == main_~_hf_hashv~0#1 / 8) then (if main_~_hj_i~1#1 == main_~_hf_hashv~0#1 / 8 then 0 else 1) else (if 0 == main_~_hj_i~1#1 then main_~_hf_hashv~0#1 / 8 else (if 0 == main_~_hf_hashv~0#1 / 8 then main_~_hj_i~1#1 else ~bitwiseXOr(main_~_hj_i~1#1, main_~_hf_hashv~0#1 / 8))));main_~_hj_j~1#1 := main_~_hj_j~1#1 - main_~_hf_hashv~0#1;main_~_hj_j~1#1 := main_~_hj_j~1#1 - main_~_hj_i~1#1;main_~_hj_j~1#1 := (if (1 == main_~_hj_j~1#1 || 0 == main_~_hj_j~1#1) && (1 == 1024 * main_~_hj_i~1#1 || 0 == 1024 * main_~_hj_i~1#1) then (if main_~_hj_j~1#1 == 1024 * main_~_hj_i~1#1 then 0 else 1) else (if 0 == main_~_hj_j~1#1 then 1024 * main_~_hj_i~1#1 else (if 0 == 1024 * main_~_hj_i~1#1 then main_~_hj_j~1#1 else ~bitwiseXOr(main_~_hj_j~1#1, 1024 * main_~_hj_i~1#1))));main_~_hf_hashv~0#1 := main_~_hf_hashv~0#1 - main_~_hj_i~1#1;main_~_hf_hashv~0#1 := main_~_hf_hashv~0#1 - main_~_hj_j~1#1;main_~_hf_hashv~0#1 := (if (1 == main_~_hf_hashv~0#1 || 0 == main_~_hf_hashv~0#1) && (1 == main_~_hj_j~1#1 / 32768 || 0 == main_~_hj_j~1#1 / 32768) then (if main_~_hf_hashv~0#1 == main_~_hj_j~1#1 / 32768 then 0 else 1) else (if 0 == main_~_hf_hashv~0#1 then main_~_hj_j~1#1 / 32768 else (if 0 == main_~_hj_j~1#1 / 32768 then main_~_hf_hashv~0#1 else ~bitwiseXOr(main_~_hf_hashv~0#1, main_~_hj_j~1#1 / 32768)))); {11666#false} is VALID [2022-02-21 03:16:54,370 INFO L290 TraceCheckUtils]: 35: Hoare triple {11666#false} goto; {11666#false} is VALID [2022-02-21 03:16:54,370 INFO L290 TraceCheckUtils]: 36: Hoare triple {11666#false} goto; {11666#false} is VALID [2022-02-21 03:16:54,370 INFO L290 TraceCheckUtils]: 37: Hoare triple {11666#false} goto; {11666#false} is VALID [2022-02-21 03:16:54,370 INFO L290 TraceCheckUtils]: 38: Hoare triple {11666#false} main_~tmp~0#1.base, main_~tmp~0#1.offset := 0, 0; {11666#false} is VALID [2022-02-21 03:16:54,370 INFO L290 TraceCheckUtils]: 39: Hoare triple {11666#false} assume main_~users~0#1.base != 0 || main_~users~0#1.offset != 0;havoc main_~_hf_bkt~0#1; {11666#false} is VALID [2022-02-21 03:16:54,370 INFO L290 TraceCheckUtils]: 40: Hoare triple {11666#false} call main_#t~mem205#1.base, main_#t~mem205#1.offset := read~$Pointer$(main_~users~0#1.base, 8 + main_~users~0#1.offset, 4);call main_#t~mem206#1 := read~int(main_#t~mem205#1.base, 4 + main_#t~mem205#1.offset, 4);main_~_hf_bkt~0#1 := (if 0 == main_~_hf_hashv~0#1 || 0 == main_#t~mem206#1 - 1 then 0 else (if 1 == main_#t~mem206#1 - 1 then (if 1 == main_~_hf_hashv~0#1 || 0 == main_~_hf_hashv~0#1 then main_~_hf_hashv~0#1 else (if main_~_hf_hashv~0#1 >= 0 then main_~_hf_hashv~0#1 % 2 else ~bitwiseAnd(main_~_hf_hashv~0#1, main_#t~mem206#1 - 1))) else (if 1 == main_~_hf_hashv~0#1 then (if 1 == main_#t~mem206#1 - 1 || 0 == main_#t~mem206#1 - 1 then main_#t~mem206#1 - 1 else (if main_#t~mem206#1 - 1 >= 0 then (main_#t~mem206#1 - 1) % 2 else ~bitwiseAnd(main_~_hf_hashv~0#1, main_#t~mem206#1 - 1))) else ~bitwiseAnd(main_~_hf_hashv~0#1, main_#t~mem206#1 - 1))));havoc main_#t~mem205#1.base, main_#t~mem205#1.offset;havoc main_#t~mem206#1; {11666#false} is VALID [2022-02-21 03:16:54,370 INFO L290 TraceCheckUtils]: 41: Hoare triple {11666#false} goto; {11666#false} is VALID [2022-02-21 03:16:54,371 INFO L290 TraceCheckUtils]: 42: Hoare triple {11666#false} goto; {11666#false} is VALID [2022-02-21 03:16:54,371 INFO L290 TraceCheckUtils]: 43: Hoare triple {11666#false} call main_#t~mem207#1.base, main_#t~mem207#1.offset := read~$Pointer$(main_~users~0#1.base, 8 + main_~users~0#1.offset, 4);call main_#t~mem208#1.base, main_#t~mem208#1.offset := read~$Pointer$(main_#t~mem207#1.base, main_#t~mem207#1.offset, 4);call main_#t~mem209#1.base, main_#t~mem209#1.offset := read~$Pointer$(main_#t~mem208#1.base, main_#t~mem208#1.offset + 12 * (if main_~_hf_bkt~0#1 % 4294967296 % 4294967296 <= 2147483647 then main_~_hf_bkt~0#1 % 4294967296 % 4294967296 else main_~_hf_bkt~0#1 % 4294967296 % 4294967296 - 4294967296), 4); {11666#false} is VALID [2022-02-21 03:16:54,371 INFO L290 TraceCheckUtils]: 44: Hoare triple {11666#false} assume !(main_#t~mem209#1.base != 0 || main_#t~mem209#1.offset != 0);havoc main_#t~mem207#1.base, main_#t~mem207#1.offset;havoc main_#t~mem208#1.base, main_#t~mem208#1.offset;havoc main_#t~mem209#1.base, main_#t~mem209#1.offset;main_~tmp~0#1.base, main_~tmp~0#1.offset := 0, 0; {11666#false} is VALID [2022-02-21 03:16:54,371 INFO L290 TraceCheckUtils]: 45: Hoare triple {11666#false} assume !!(main_~tmp~0#1.base != 0 || main_~tmp~0#1.offset != 0);call main_#t~mem215#1 := read~int(main_~tmp~0#1.base, 36 + main_~tmp~0#1.offset, 4);main_#t~short217#1 := main_#t~mem215#1 % 4294967296 == main_~_hf_hashv~0#1 % 4294967296; {11666#false} is VALID [2022-02-21 03:16:54,371 INFO L290 TraceCheckUtils]: 46: Hoare triple {11666#false} assume main_#t~short217#1;call main_#t~mem216#1 := read~int(main_~tmp~0#1.base, 32 + main_~tmp~0#1.offset, 4);main_#t~short217#1 := 4 == main_#t~mem216#1 % 4294967296; {11666#false} is VALID [2022-02-21 03:16:54,371 INFO L290 TraceCheckUtils]: 47: Hoare triple {11666#false} assume main_#t~short217#1;havoc main_#t~mem215#1;havoc main_#t~mem216#1;havoc main_#t~short217#1;call main_#t~mem218#1.base, main_#t~mem218#1.offset := read~$Pointer$(main_~tmp~0#1.base, 28 + main_~tmp~0#1.offset, 4);assume { :begin_inline_alt_memcmp } true;alt_memcmp_#in~a#1.base, alt_memcmp_#in~a#1.offset, alt_memcmp_#in~b#1.base, alt_memcmp_#in~b#1.offset, alt_memcmp_#in~n#1 := main_#t~mem218#1.base, main_#t~mem218#1.offset, main_~#i~0#1.base, main_~#i~0#1.offset, 4;havoc alt_memcmp_#res#1;havoc alt_memcmp_#t~pre35#1, alt_memcmp_#t~ret36#1, alt_memcmp_~a#1.base, alt_memcmp_~a#1.offset, alt_memcmp_~b#1.base, alt_memcmp_~b#1.offset, alt_memcmp_~n#1;alt_memcmp_~a#1.base, alt_memcmp_~a#1.offset := alt_memcmp_#in~a#1.base, alt_memcmp_#in~a#1.offset;alt_memcmp_~b#1.base, alt_memcmp_~b#1.offset := alt_memcmp_#in~b#1.base, alt_memcmp_#in~b#1.offset;alt_memcmp_~n#1 := alt_memcmp_#in~n#1; {11666#false} is VALID [2022-02-21 03:16:54,372 INFO L290 TraceCheckUtils]: 48: Hoare triple {11666#false} assume !(1 + ~alt_memcmp_count~0 <= 2147483647); {11666#false} is VALID [2022-02-21 03:16:54,372 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-21 03:16:54,372 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 03:16:54,372 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1500737821] [2022-02-21 03:16:54,372 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1500737821] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-21 03:16:54,372 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-21 03:16:54,373 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-02-21 03:16:54,373 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [732082963] [2022-02-21 03:16:54,373 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-21 03:16:54,373 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.25) internal successors, (49), 4 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 49 [2022-02-21 03:16:54,373 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-21 03:16:54,374 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 12.25) internal successors, (49), 4 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:16:54,406 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 49 edges. 49 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:16:54,407 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-02-21 03:16:54,407 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 03:16:54,407 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-02-21 03:16:54,407 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-02-21 03:16:54,407 INFO L87 Difference]: Start difference. First operand 710 states and 911 transitions. Second operand has 4 states, 4 states have (on average 12.25) internal successors, (49), 4 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:16:55,414 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:16:55,414 INFO L93 Difference]: Finished difference Result 1147 states and 1491 transitions. [2022-02-21 03:16:55,414 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-02-21 03:16:55,414 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.25) internal successors, (49), 4 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 49 [2022-02-21 03:16:55,414 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-21 03:16:55,415 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 12.25) internal successors, (49), 4 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:16:55,417 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 538 transitions. [2022-02-21 03:16:55,417 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 12.25) internal successors, (49), 4 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:16:55,420 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 538 transitions. [2022-02-21 03:16:55,420 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 538 transitions. [2022-02-21 03:16:55,853 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 538 edges. 538 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:16:55,884 INFO L225 Difference]: With dead ends: 1147 [2022-02-21 03:16:55,885 INFO L226 Difference]: Without dead ends: 954 [2022-02-21 03:16:55,885 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-02-21 03:16:55,886 INFO L933 BasicCegarLoop]: 275 mSDtfsCounter, 108 mSDsluCounter, 478 mSDsCounter, 0 mSdLazyCounter, 149 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 110 SdHoareTripleChecker+Valid, 753 SdHoareTripleChecker+Invalid, 152 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 149 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-02-21 03:16:55,886 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [110 Valid, 753 Invalid, 152 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 149 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-02-21 03:16:55,887 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 954 states. [2022-02-21 03:16:56,003 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 954 to 710. [2022-02-21 03:16:56,003 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 03:16:56,004 INFO L82 GeneralOperation]: Start isEquivalent. First operand 954 states. Second operand has 710 states, 666 states have (on average 1.2927927927927927) internal successors, (861), 682 states have internal predecessors, (861), 23 states have call successors, (23), 10 states have call predecessors, (23), 7 states have return successors, (26), 18 states have call predecessors, (26), 23 states have call successors, (26) [2022-02-21 03:16:56,005 INFO L74 IsIncluded]: Start isIncluded. First operand 954 states. Second operand has 710 states, 666 states have (on average 1.2927927927927927) internal successors, (861), 682 states have internal predecessors, (861), 23 states have call successors, (23), 10 states have call predecessors, (23), 7 states have return successors, (26), 18 states have call predecessors, (26), 23 states have call successors, (26) [2022-02-21 03:16:56,007 INFO L87 Difference]: Start difference. First operand 954 states. Second operand has 710 states, 666 states have (on average 1.2927927927927927) internal successors, (861), 682 states have internal predecessors, (861), 23 states have call successors, (23), 10 states have call predecessors, (23), 7 states have return successors, (26), 18 states have call predecessors, (26), 23 states have call successors, (26) [2022-02-21 03:16:56,038 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:16:56,038 INFO L93 Difference]: Finished difference Result 954 states and 1237 transitions. [2022-02-21 03:16:56,038 INFO L276 IsEmpty]: Start isEmpty. Operand 954 states and 1237 transitions. [2022-02-21 03:16:56,040 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:16:56,040 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:16:56,042 INFO L74 IsIncluded]: Start isIncluded. First operand has 710 states, 666 states have (on average 1.2927927927927927) internal successors, (861), 682 states have internal predecessors, (861), 23 states have call successors, (23), 10 states have call predecessors, (23), 7 states have return successors, (26), 18 states have call predecessors, (26), 23 states have call successors, (26) Second operand 954 states. [2022-02-21 03:16:56,043 INFO L87 Difference]: Start difference. First operand has 710 states, 666 states have (on average 1.2927927927927927) internal successors, (861), 682 states have internal predecessors, (861), 23 states have call successors, (23), 10 states have call predecessors, (23), 7 states have return successors, (26), 18 states have call predecessors, (26), 23 states have call successors, (26) Second operand 954 states. [2022-02-21 03:16:56,073 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:16:56,073 INFO L93 Difference]: Finished difference Result 954 states and 1237 transitions. [2022-02-21 03:16:56,073 INFO L276 IsEmpty]: Start isEmpty. Operand 954 states and 1237 transitions. [2022-02-21 03:16:56,075 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:16:56,075 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:16:56,075 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 03:16:56,075 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 03:16:56,076 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 710 states, 666 states have (on average 1.2927927927927927) internal successors, (861), 682 states have internal predecessors, (861), 23 states have call successors, (23), 10 states have call predecessors, (23), 7 states have return successors, (26), 18 states have call predecessors, (26), 23 states have call successors, (26) [2022-02-21 03:16:56,095 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 710 states to 710 states and 910 transitions. [2022-02-21 03:16:56,096 INFO L78 Accepts]: Start accepts. Automaton has 710 states and 910 transitions. Word has length 49 [2022-02-21 03:16:56,096 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-21 03:16:56,096 INFO L470 AbstractCegarLoop]: Abstraction has 710 states and 910 transitions. [2022-02-21 03:16:56,096 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.25) internal successors, (49), 4 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:16:56,096 INFO L276 IsEmpty]: Start isEmpty. Operand 710 states and 910 transitions. [2022-02-21 03:16:56,098 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2022-02-21 03:16:56,098 INFO L506 BasicCegarLoop]: Found error trace [2022-02-21 03:16:56,098 INFO L514 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-21 03:16:56,098 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-02-21 03:16:56,102 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting alt_bzeroErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [alt_mallocErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, alt_mallocErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, alt_freeErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2022-02-21 03:16:56,102 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:16:56,102 INFO L85 PathProgramCache]: Analyzing trace with hash 1422172071, now seen corresponding path program 1 times [2022-02-21 03:16:56,102 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:16:56,102 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1089889511] [2022-02-21 03:16:56,103 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:16:56,103 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:16:56,133 ERROR L252 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-02-21 03:16:56,133 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [752137057] [2022-02-21 03:16:56,133 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:16:56,133 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-21 03:16:56,134 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:16:56,135 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-02-21 03:16:56,136 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-02-21 03:16:56,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:16:56,304 INFO L263 TraceCheckSpWp]: Trace formula consists of 328 conjuncts, 4 conjunts are in the unsatisfiable core [2022-02-21 03:16:56,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:16:56,335 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 03:16:56,556 INFO L290 TraceCheckUtils]: 0: Hoare triple {15782#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(21, 2);~#alt_malloc_sizes~0.base, ~#alt_malloc_sizes~0.offset := 3, 0;call #Ultimate.allocInit(40, 3);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#alt_malloc_sizes~0.base);~alt_malloc_balance~0 := 0;~alt_memcmp_count~0 := 0;~alt_bzero_count~0 := 0; {15787#(<= ~alt_bzero_count~0 0)} is VALID [2022-02-21 03:16:56,557 INFO L290 TraceCheckUtils]: 1: Hoare triple {15787#(<= ~alt_bzero_count~0 0)} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret43#1.base, main_#t~ret43#1.offset, main_#t~mem44#1, main_#t~mem45#1, main_#t~mem46#1, main_#t~mem48#1, main_#t~mem47#1, main_#t~mem49#1, main_#t~mem50#1, main_#t~mem52#1, main_#t~mem51#1, main_#t~mem53#1, main_#t~mem54#1, main_#t~mem56#1, main_#t~mem55#1, main_#t~mem57#1, main_#t~mem58#1, main_#t~switch59#1, main_#t~mem60#1, main_#t~mem61#1, main_#t~mem62#1, main_#t~mem63#1, main_#t~mem64#1, main_#t~mem65#1, main_#t~mem66#1, main_#t~mem67#1, main_#t~mem68#1, main_#t~mem69#1, main_#t~mem70#1, main_~_hj_i~0#1, main_~_hj_j~0#1, main_~_hj_k~0#1, main_~_hj_key~0#1.base, main_~_hj_key~0#1.offset, main_#t~ret71#1.base, main_#t~ret71#1.offset, main_#t~mem72#1.base, main_#t~mem72#1.offset, main_#t~mem73#1.base, main_#t~mem73#1.offset, main_#t~mem74#1.base, main_#t~mem74#1.offset, main_#t~mem75#1.base, main_#t~mem75#1.offset, main_#t~mem76#1.base, main_#t~mem76#1.offset, main_#t~mem77#1.base, main_#t~mem77#1.offset, main_#t~mem78#1.base, main_#t~mem78#1.offset, main_#t~ret79#1.base, main_#t~ret79#1.offset, main_#t~mem80#1.base, main_#t~mem80#1.offset, main_#t~mem81#1.base, main_#t~mem81#1.offset, main_#t~mem82#1.base, main_#t~mem82#1.offset, main_#t~mem83#1.base, main_#t~mem83#1.offset, main_#t~mem84#1.base, main_#t~mem84#1.offset, main_#t~mem85#1.base, main_#t~mem85#1.offset, main_#t~mem86#1.base, main_#t~mem86#1.offset, main_#t~mem87#1.base, main_#t~mem87#1.offset, main_#t~mem88#1.base, main_#t~mem88#1.offset, main_#t~mem89#1.base, main_#t~mem89#1.offset, main_#t~mem90#1, main_#t~mem91#1.base, main_#t~mem91#1.offset, main_#t~mem92#1.base, main_#t~mem92#1.offset, main_#t~mem93#1.base, main_#t~mem93#1.offset, main_#t~mem94#1.base, main_#t~mem94#1.offset, main_#t~mem95#1, main_#t~post96#1, main_#t~mem97#1.base, main_#t~mem97#1.offset, main_#t~mem98#1, main_#t~mem99#1.base, main_#t~mem99#1.offset, main_#t~mem100#1.base, main_#t~mem100#1.offset, main_#t~mem101#1, main_#t~post102#1, main_#t~mem103#1.base, main_#t~mem103#1.offset, main_#t~mem104#1.base, main_#t~mem104#1.offset, main_#t~mem105#1.base, main_#t~mem105#1.offset, main_#t~mem107#1, main_#t~mem106#1, main_#t~mem108#1.base, main_#t~mem108#1.offset, main_#t~mem109#1, main_#t~short110#1, main_#t~mem111#1.base, main_#t~mem111#1.offset, main_#t~mem112#1, main_#t~ret113#1.base, main_#t~ret113#1.offset, main_#t~mem114#1.base, main_#t~mem114#1.offset, main_#t~mem115#1.base, main_#t~mem115#1.offset, main_#t~mem116#1.base, main_#t~mem116#1.offset, main_#t~mem117#1, main_#t~mem118#1.base, main_#t~mem118#1.offset, main_#t~mem119#1.base, main_#t~mem119#1.offset, main_#t~mem122#1, main_#t~mem120#1.base, main_#t~mem120#1.offset, main_#t~mem121#1, main_#t~mem123#1.base, main_#t~mem123#1.offset, main_#t~mem126#1, main_#t~mem124#1.base, main_#t~mem124#1.offset, main_#t~mem125#1, main_#t~ite127#1, main_#t~mem128#1.base, main_#t~mem128#1.offset, main_#t~mem132#1.base, main_#t~mem132#1.offset, main_#t~mem133#1.base, main_#t~mem133#1.offset, main_#t~mem134#1.base, main_#t~mem134#1.offset, main_#t~mem135#1.base, main_#t~mem135#1.offset, main_#t~mem138#1, main_#t~mem136#1.base, main_#t~mem136#1.offset, main_#t~mem137#1, main_#t~mem139#1.base, main_#t~mem139#1.offset, main_#t~mem140#1, main_#t~pre141#1, main_#t~mem142#1.base, main_#t~mem142#1.offset, main_#t~mem143#1, main_#t~mem144#1.base, main_#t~mem144#1.offset, main_#t~mem145#1, main_#t~post146#1, main_#t~mem150#1, main_#t~mem148#1, main_#t~mem147#1.base, main_#t~mem147#1.offset, main_#t~mem149#1, main_#t~mem151#1, main_#t~post152#1, main_#t~mem153#1.base, main_#t~mem153#1.offset, main_#t~mem154#1.base, main_#t~mem154#1.offset, main_#t~mem155#1.base, main_#t~mem155#1.offset, main_#t~post129#1, main_#t~mem130#1.base, main_#t~mem130#1.offset, main_#t~mem131#1, main_#t~mem156#1.base, main_#t~mem156#1.offset, main_#t~mem157#1.base, main_#t~mem157#1.offset, main_#t~mem158#1.base, main_#t~mem158#1.offset, main_#t~mem159#1, main_#t~mem160#1.base, main_#t~mem160#1.offset, main_#t~mem161#1, main_#t~mem162#1.base, main_#t~mem162#1.offset, main_#t~mem163#1, main_#t~post164#1, main_#t~mem165#1.base, main_#t~mem165#1.offset, main_#t~mem166#1.base, main_#t~mem166#1.offset, main_#t~mem167#1.base, main_#t~mem167#1.offset, main_#t~mem168#1.base, main_#t~mem168#1.offset, main_#t~mem171#1, main_#t~mem169#1.base, main_#t~mem169#1.offset, main_#t~mem170#1, main_#t~ite174#1, main_#t~mem172#1.base, main_#t~mem172#1.offset, main_#t~mem173#1, main_#t~mem175#1.base, main_#t~mem175#1.offset, main_#t~mem176#1, main_#t~mem177#1.base, main_#t~mem177#1.offset, main_~_he_bkt~0#1, main_~_he_bkt_i~0#1, main_~_he_thh~0#1.base, main_~_he_thh~0#1.offset, main_~_he_hh_nxt~0#1.base, main_~_he_hh_nxt~0#1.offset, main_~#_he_new_buckets~0#1.base, main_~#_he_new_buckets~0#1.offset, main_~_he_newbkt~0#1.base, main_~_he_newbkt~0#1.offset, main_~_ha_head~0#1.base, main_~_ha_head~0#1.offset, main_~_ha_bkt~0#1, main_~_ha_hashv~0#1, main_#t~mem40#1, main_#t~post41#1, main_#t~mem42#1, main_#t~mem182#1, main_#t~mem181#1, main_#t~mem183#1, main_#t~mem184#1, main_#t~mem186#1, main_#t~mem185#1, main_#t~mem187#1, main_#t~mem188#1, main_#t~mem190#1, main_#t~mem189#1, main_#t~mem191#1, main_#t~mem192#1, main_#t~switch193#1, main_#t~mem194#1, main_#t~mem195#1, main_#t~mem196#1, main_#t~mem197#1, main_#t~mem198#1, main_#t~mem199#1, main_#t~mem200#1, main_#t~mem201#1, main_#t~mem202#1, main_#t~mem203#1, main_#t~mem204#1, main_~_hj_i~1#1, main_~_hj_j~1#1, main_~_hj_k~1#1, main_~_hj_key~1#1.base, main_~_hj_key~1#1.offset, main_#t~mem205#1.base, main_#t~mem205#1.offset, main_#t~mem206#1, main_#t~mem207#1.base, main_#t~mem207#1.offset, main_#t~mem208#1.base, main_#t~mem208#1.offset, main_#t~mem209#1.base, main_#t~mem209#1.offset, main_#t~mem210#1.base, main_#t~mem210#1.offset, main_#t~mem211#1.base, main_#t~mem211#1.offset, main_#t~mem212#1.base, main_#t~mem212#1.offset, main_#t~mem213#1.base, main_#t~mem213#1.offset, main_#t~mem214#1, main_#t~mem215#1, main_#t~mem216#1, main_#t~short217#1, main_#t~mem218#1.base, main_#t~mem218#1.offset, main_#t~ret219#1, main_#t~mem220#1.base, main_#t~mem220#1.offset, main_#t~mem221#1.base, main_#t~mem221#1.offset, main_#t~mem222#1.base, main_#t~mem222#1.offset, main_#t~mem223#1, main_~_hf_bkt~0#1, main_~_hf_hashv~0#1, main_#t~mem224#1.base, main_#t~mem224#1.offset, main_#t~mem225#1.base, main_#t~mem225#1.offset, main_#t~short226#1, main_#t~mem227#1.base, main_#t~mem227#1.offset, main_#t~mem228#1.base, main_#t~mem228#1.offset, main_#t~mem229#1.base, main_#t~mem229#1.offset, main_#t~mem230#1, main_#t~mem231#1.base, main_#t~mem231#1.offset, main_#t~mem232#1.base, main_#t~mem232#1.offset, main_#t~mem233#1.base, main_#t~mem233#1.offset, main_#t~mem234#1.base, main_#t~mem234#1.offset, main_#t~mem235#1.base, main_#t~mem235#1.offset, main_#t~mem236#1.base, main_#t~mem236#1.offset, main_#t~mem237#1, main_#t~mem238#1.base, main_#t~mem238#1.offset, main_#t~mem239#1.base, main_#t~mem239#1.offset, main_#t~mem240#1.base, main_#t~mem240#1.offset, main_#t~mem241#1, main_#t~mem242#1.base, main_#t~mem242#1.offset, main_#t~mem243#1.base, main_#t~mem243#1.offset, main_#t~mem244#1.base, main_#t~mem244#1.offset, main_#t~mem245#1.base, main_#t~mem245#1.offset, main_#t~mem246#1.base, main_#t~mem246#1.offset, main_#t~mem247#1, main_#t~mem248#1.base, main_#t~mem248#1.offset, main_#t~mem251#1, main_#t~mem249#1.base, main_#t~mem249#1.offset, main_#t~mem250#1, main_#t~mem252#1.base, main_#t~mem252#1.offset, main_#t~mem253#1.base, main_#t~mem253#1.offset, main_#t~mem254#1, main_#t~post255#1, main_#t~mem256#1.base, main_#t~mem256#1.offset, main_#t~mem257#1.base, main_#t~mem257#1.offset, main_#t~mem258#1.base, main_#t~mem258#1.offset, main_#t~mem259#1.base, main_#t~mem259#1.offset, main_#t~mem260#1.base, main_#t~mem260#1.offset, main_#t~mem261#1.base, main_#t~mem261#1.offset, main_#t~mem262#1.base, main_#t~mem262#1.offset, main_#t~mem263#1.base, main_#t~mem263#1.offset, main_~_hd_head~0#1.base, main_~_hd_head~0#1.offset, main_#t~mem264#1.base, main_#t~mem264#1.offset, main_#t~mem265#1, main_#t~post266#1, main_~_hd_bkt~0#1, main_~_hd_hh_del~0#1.base, main_~_hd_hh_del~0#1.offset, main_#t~mem178#1, main_#t~post179#1, main_#t~mem180#1, main_#t~mem267#1.base, main_#t~mem267#1.offset, main_~#i~0#1.base, main_~#i~0#1.offset, main_~user~0#1.base, main_~user~0#1.offset, main_~tmp~0#1.base, main_~tmp~0#1.offset, main_~users~0#1.base, main_~users~0#1.offset;call main_~#i~0#1.base, main_~#i~0#1.offset := #Ultimate.allocOnStack(4);havoc main_~user~0#1.base, main_~user~0#1.offset;havoc main_~tmp~0#1.base, main_~tmp~0#1.offset;main_~users~0#1.base, main_~users~0#1.offset := 0, 0;call write~int(0, main_~#i~0#1.base, main_~#i~0#1.offset, 4); {15787#(<= ~alt_bzero_count~0 0)} is VALID [2022-02-21 03:16:56,559 INFO L290 TraceCheckUtils]: 2: Hoare triple {15787#(<= ~alt_bzero_count~0 0)} call main_#t~mem42#1 := read~int(main_~#i~0#1.base, main_~#i~0#1.offset, 4); {15787#(<= ~alt_bzero_count~0 0)} is VALID [2022-02-21 03:16:56,559 INFO L290 TraceCheckUtils]: 3: Hoare triple {15787#(<= ~alt_bzero_count~0 0)} assume !!(main_#t~mem42#1 < 10);havoc main_#t~mem42#1;assume { :begin_inline_real_malloc } true;real_malloc_#in~n#1 := 40;havoc real_malloc_#res#1.base, real_malloc_#res#1.offset;havoc real_malloc_#t~malloc39#1.base, real_malloc_#t~malloc39#1.offset, real_malloc_~n#1;real_malloc_~n#1 := real_malloc_#in~n#1;call real_malloc_#t~malloc39#1.base, real_malloc_#t~malloc39#1.offset := #Ultimate.allocOnHeap(real_malloc_~n#1);real_malloc_#res#1.base, real_malloc_#res#1.offset := real_malloc_#t~malloc39#1.base, real_malloc_#t~malloc39#1.offset;havoc real_malloc_#t~malloc39#1.base, real_malloc_#t~malloc39#1.offset; {15787#(<= ~alt_bzero_count~0 0)} is VALID [2022-02-21 03:16:56,560 INFO L290 TraceCheckUtils]: 4: Hoare triple {15787#(<= ~alt_bzero_count~0 0)} main_#t~ret43#1.base, main_#t~ret43#1.offset := real_malloc_#res#1.base, real_malloc_#res#1.offset;assume { :end_inline_real_malloc } true;main_~user~0#1.base, main_~user~0#1.offset := main_#t~ret43#1.base, main_#t~ret43#1.offset;havoc main_#t~ret43#1.base, main_#t~ret43#1.offset; {15787#(<= ~alt_bzero_count~0 0)} is VALID [2022-02-21 03:16:56,560 INFO L290 TraceCheckUtils]: 5: Hoare triple {15787#(<= ~alt_bzero_count~0 0)} assume !(main_~user~0#1.base == 0 && main_~user~0#1.offset == 0); {15787#(<= ~alt_bzero_count~0 0)} is VALID [2022-02-21 03:16:56,560 INFO L290 TraceCheckUtils]: 6: Hoare triple {15787#(<= ~alt_bzero_count~0 0)} call main_#t~mem44#1 := read~int(main_~#i~0#1.base, main_~#i~0#1.offset, 4);call write~int(main_#t~mem44#1, main_~user~0#1.base, main_~user~0#1.offset, 4);havoc main_#t~mem44#1;call main_#t~mem45#1 := read~int(main_~#i~0#1.base, main_~#i~0#1.offset, 4);call main_#t~mem46#1 := read~int(main_~#i~0#1.base, main_~#i~0#1.offset, 4); {15787#(<= ~alt_bzero_count~0 0)} is VALID [2022-02-21 03:16:56,561 INFO L290 TraceCheckUtils]: 7: Hoare triple {15787#(<= ~alt_bzero_count~0 0)} assume main_#t~mem45#1 * main_#t~mem46#1 <= 2147483647; {15787#(<= ~alt_bzero_count~0 0)} is VALID [2022-02-21 03:16:56,561 INFO L290 TraceCheckUtils]: 8: Hoare triple {15787#(<= ~alt_bzero_count~0 0)} assume main_#t~mem45#1 * main_#t~mem46#1 >= -2147483648;call write~int(main_#t~mem45#1 * main_#t~mem46#1, main_~user~0#1.base, 4 + main_~user~0#1.offset, 4);havoc main_#t~mem45#1;havoc main_#t~mem46#1; {15787#(<= ~alt_bzero_count~0 0)} is VALID [2022-02-21 03:16:56,564 INFO L290 TraceCheckUtils]: 9: Hoare triple {15787#(<= ~alt_bzero_count~0 0)} havoc main_~_ha_hashv~0#1; {15787#(<= ~alt_bzero_count~0 0)} is VALID [2022-02-21 03:16:56,564 INFO L290 TraceCheckUtils]: 10: Hoare triple {15787#(<= ~alt_bzero_count~0 0)} goto; {15787#(<= ~alt_bzero_count~0 0)} is VALID [2022-02-21 03:16:56,564 INFO L290 TraceCheckUtils]: 11: Hoare triple {15787#(<= ~alt_bzero_count~0 0)} havoc main_~_hj_i~0#1;havoc main_~_hj_j~0#1;havoc main_~_hj_k~0#1;main_~_hj_key~0#1.base, main_~_hj_key~0#1.offset := main_~user~0#1.base, main_~user~0#1.offset;main_~_ha_hashv~0#1 := 4276993775;main_~_hj_j~0#1 := 2654435769;main_~_hj_i~0#1 := main_~_hj_j~0#1;main_~_hj_k~0#1 := 4; {15787#(<= ~alt_bzero_count~0 0)} is VALID [2022-02-21 03:16:56,565 INFO L290 TraceCheckUtils]: 12: Hoare triple {15787#(<= ~alt_bzero_count~0 0)} assume !(main_~_hj_k~0#1 % 4294967296 >= 12); {15787#(<= ~alt_bzero_count~0 0)} is VALID [2022-02-21 03:16:56,565 INFO L290 TraceCheckUtils]: 13: Hoare triple {15787#(<= ~alt_bzero_count~0 0)} main_~_ha_hashv~0#1 := 4 + main_~_ha_hashv~0#1;main_#t~switch59#1 := 11 == main_~_hj_k~0#1; {15787#(<= ~alt_bzero_count~0 0)} is VALID [2022-02-21 03:16:56,565 INFO L290 TraceCheckUtils]: 14: Hoare triple {15787#(<= ~alt_bzero_count~0 0)} assume !main_#t~switch59#1; {15787#(<= ~alt_bzero_count~0 0)} is VALID [2022-02-21 03:16:56,566 INFO L290 TraceCheckUtils]: 15: Hoare triple {15787#(<= ~alt_bzero_count~0 0)} main_#t~switch59#1 := main_#t~switch59#1 || 10 == main_~_hj_k~0#1; {15787#(<= ~alt_bzero_count~0 0)} is VALID [2022-02-21 03:16:56,566 INFO L290 TraceCheckUtils]: 16: Hoare triple {15787#(<= ~alt_bzero_count~0 0)} assume !main_#t~switch59#1; {15787#(<= ~alt_bzero_count~0 0)} is VALID [2022-02-21 03:16:56,566 INFO L290 TraceCheckUtils]: 17: Hoare triple {15787#(<= ~alt_bzero_count~0 0)} main_#t~switch59#1 := main_#t~switch59#1 || 9 == main_~_hj_k~0#1; {15787#(<= ~alt_bzero_count~0 0)} is VALID [2022-02-21 03:16:56,567 INFO L290 TraceCheckUtils]: 18: Hoare triple {15787#(<= ~alt_bzero_count~0 0)} assume !main_#t~switch59#1; {15787#(<= ~alt_bzero_count~0 0)} is VALID [2022-02-21 03:16:56,567 INFO L290 TraceCheckUtils]: 19: Hoare triple {15787#(<= ~alt_bzero_count~0 0)} main_#t~switch59#1 := main_#t~switch59#1 || 8 == main_~_hj_k~0#1; {15787#(<= ~alt_bzero_count~0 0)} is VALID [2022-02-21 03:16:56,567 INFO L290 TraceCheckUtils]: 20: Hoare triple {15787#(<= ~alt_bzero_count~0 0)} assume !main_#t~switch59#1; {15787#(<= ~alt_bzero_count~0 0)} is VALID [2022-02-21 03:16:56,567 INFO L290 TraceCheckUtils]: 21: Hoare triple {15787#(<= ~alt_bzero_count~0 0)} main_#t~switch59#1 := main_#t~switch59#1 || 7 == main_~_hj_k~0#1; {15787#(<= ~alt_bzero_count~0 0)} is VALID [2022-02-21 03:16:56,568 INFO L290 TraceCheckUtils]: 22: Hoare triple {15787#(<= ~alt_bzero_count~0 0)} assume !main_#t~switch59#1; {15787#(<= ~alt_bzero_count~0 0)} is VALID [2022-02-21 03:16:56,568 INFO L290 TraceCheckUtils]: 23: Hoare triple {15787#(<= ~alt_bzero_count~0 0)} main_#t~switch59#1 := main_#t~switch59#1 || 6 == main_~_hj_k~0#1; {15787#(<= ~alt_bzero_count~0 0)} is VALID [2022-02-21 03:16:56,568 INFO L290 TraceCheckUtils]: 24: Hoare triple {15787#(<= ~alt_bzero_count~0 0)} assume !main_#t~switch59#1; {15787#(<= ~alt_bzero_count~0 0)} is VALID [2022-02-21 03:16:56,569 INFO L290 TraceCheckUtils]: 25: Hoare triple {15787#(<= ~alt_bzero_count~0 0)} main_#t~switch59#1 := main_#t~switch59#1 || 5 == main_~_hj_k~0#1; {15787#(<= ~alt_bzero_count~0 0)} is VALID [2022-02-21 03:16:56,569 INFO L290 TraceCheckUtils]: 26: Hoare triple {15787#(<= ~alt_bzero_count~0 0)} assume !main_#t~switch59#1; {15787#(<= ~alt_bzero_count~0 0)} is VALID [2022-02-21 03:16:56,569 INFO L290 TraceCheckUtils]: 27: Hoare triple {15787#(<= ~alt_bzero_count~0 0)} main_#t~switch59#1 := main_#t~switch59#1 || 4 == main_~_hj_k~0#1; {15787#(<= ~alt_bzero_count~0 0)} is VALID [2022-02-21 03:16:56,570 INFO L290 TraceCheckUtils]: 28: Hoare triple {15787#(<= ~alt_bzero_count~0 0)} assume main_#t~switch59#1;call main_#t~mem67#1 := read~int(main_~_hj_key~0#1.base, 3 + main_~_hj_key~0#1.offset, 1);main_~_hj_i~0#1 := main_~_hj_i~0#1 + 16777216 * (main_#t~mem67#1 % 256);havoc main_#t~mem67#1; {15787#(<= ~alt_bzero_count~0 0)} is VALID [2022-02-21 03:16:56,570 INFO L290 TraceCheckUtils]: 29: Hoare triple {15787#(<= ~alt_bzero_count~0 0)} main_#t~switch59#1 := main_#t~switch59#1 || 3 == main_~_hj_k~0#1; {15787#(<= ~alt_bzero_count~0 0)} is VALID [2022-02-21 03:16:56,570 INFO L290 TraceCheckUtils]: 30: Hoare triple {15787#(<= ~alt_bzero_count~0 0)} assume main_#t~switch59#1;call main_#t~mem68#1 := read~int(main_~_hj_key~0#1.base, 2 + main_~_hj_key~0#1.offset, 1);main_~_hj_i~0#1 := main_~_hj_i~0#1 + 65536 * (main_#t~mem68#1 % 256);havoc main_#t~mem68#1; {15787#(<= ~alt_bzero_count~0 0)} is VALID [2022-02-21 03:16:56,571 INFO L290 TraceCheckUtils]: 31: Hoare triple {15787#(<= ~alt_bzero_count~0 0)} main_#t~switch59#1 := main_#t~switch59#1 || 2 == main_~_hj_k~0#1; {15787#(<= ~alt_bzero_count~0 0)} is VALID [2022-02-21 03:16:56,571 INFO L290 TraceCheckUtils]: 32: Hoare triple {15787#(<= ~alt_bzero_count~0 0)} assume main_#t~switch59#1;call main_#t~mem69#1 := read~int(main_~_hj_key~0#1.base, 1 + main_~_hj_key~0#1.offset, 1);main_~_hj_i~0#1 := main_~_hj_i~0#1 + 256 * (main_#t~mem69#1 % 256);havoc main_#t~mem69#1; {15787#(<= ~alt_bzero_count~0 0)} is VALID [2022-02-21 03:16:56,571 INFO L290 TraceCheckUtils]: 33: Hoare triple {15787#(<= ~alt_bzero_count~0 0)} main_#t~switch59#1 := main_#t~switch59#1 || 1 == main_~_hj_k~0#1; {15787#(<= ~alt_bzero_count~0 0)} is VALID [2022-02-21 03:16:56,571 INFO L290 TraceCheckUtils]: 34: Hoare triple {15787#(<= ~alt_bzero_count~0 0)} assume main_#t~switch59#1;call main_#t~mem70#1 := read~int(main_~_hj_key~0#1.base, main_~_hj_key~0#1.offset, 1);main_~_hj_i~0#1 := main_~_hj_i~0#1 + main_#t~mem70#1 % 256;havoc main_#t~mem70#1; {15787#(<= ~alt_bzero_count~0 0)} is VALID [2022-02-21 03:16:56,572 INFO L290 TraceCheckUtils]: 35: Hoare triple {15787#(<= ~alt_bzero_count~0 0)} havoc main_#t~switch59#1; {15787#(<= ~alt_bzero_count~0 0)} is VALID [2022-02-21 03:16:56,572 INFO L290 TraceCheckUtils]: 36: Hoare triple {15787#(<= ~alt_bzero_count~0 0)} main_~_hj_i~0#1 := main_~_hj_i~0#1 - main_~_hj_j~0#1;main_~_hj_i~0#1 := main_~_hj_i~0#1 - main_~_ha_hashv~0#1;main_~_hj_i~0#1 := (if (1 == main_~_hj_i~0#1 || 0 == main_~_hj_i~0#1) && (1 == main_~_ha_hashv~0#1 / 8192 || 0 == main_~_ha_hashv~0#1 / 8192) then (if main_~_hj_i~0#1 == main_~_ha_hashv~0#1 / 8192 then 0 else 1) else (if 0 == main_~_hj_i~0#1 then main_~_ha_hashv~0#1 / 8192 else (if 0 == main_~_ha_hashv~0#1 / 8192 then main_~_hj_i~0#1 else ~bitwiseXOr(main_~_hj_i~0#1, main_~_ha_hashv~0#1 / 8192))));main_~_hj_j~0#1 := main_~_hj_j~0#1 - main_~_ha_hashv~0#1;main_~_hj_j~0#1 := main_~_hj_j~0#1 - main_~_hj_i~0#1;main_~_hj_j~0#1 := (if (1 == main_~_hj_j~0#1 || 0 == main_~_hj_j~0#1) && (1 == 256 * main_~_hj_i~0#1 || 0 == 256 * main_~_hj_i~0#1) then (if main_~_hj_j~0#1 == 256 * main_~_hj_i~0#1 then 0 else 1) else (if 0 == main_~_hj_j~0#1 then 256 * main_~_hj_i~0#1 else (if 0 == 256 * main_~_hj_i~0#1 then main_~_hj_j~0#1 else ~bitwiseXOr(main_~_hj_j~0#1, 256 * main_~_hj_i~0#1))));main_~_ha_hashv~0#1 := main_~_ha_hashv~0#1 - main_~_hj_i~0#1;main_~_ha_hashv~0#1 := main_~_ha_hashv~0#1 - main_~_hj_j~0#1;main_~_ha_hashv~0#1 := (if (1 == main_~_ha_hashv~0#1 || 0 == main_~_ha_hashv~0#1) && (1 == main_~_hj_j~0#1 / 8192 || 0 == main_~_hj_j~0#1 / 8192) then (if main_~_ha_hashv~0#1 == main_~_hj_j~0#1 / 8192 then 0 else 1) else (if 0 == main_~_ha_hashv~0#1 then main_~_hj_j~0#1 / 8192 else (if 0 == main_~_hj_j~0#1 / 8192 then main_~_ha_hashv~0#1 else ~bitwiseXOr(main_~_ha_hashv~0#1, main_~_hj_j~0#1 / 8192))));main_~_hj_i~0#1 := main_~_hj_i~0#1 - main_~_hj_j~0#1;main_~_hj_i~0#1 := main_~_hj_i~0#1 - main_~_ha_hashv~0#1;main_~_hj_i~0#1 := (if (1 == main_~_hj_i~0#1 || 0 == main_~_hj_i~0#1) && (1 == main_~_ha_hashv~0#1 / 4096 || 0 == main_~_ha_hashv~0#1 / 4096) then (if main_~_hj_i~0#1 == main_~_ha_hashv~0#1 / 4096 then 0 else 1) else (if 0 == main_~_hj_i~0#1 then main_~_ha_hashv~0#1 / 4096 else (if 0 == main_~_ha_hashv~0#1 / 4096 then main_~_hj_i~0#1 else ~bitwiseXOr(main_~_hj_i~0#1, main_~_ha_hashv~0#1 / 4096))));main_~_hj_j~0#1 := main_~_hj_j~0#1 - main_~_ha_hashv~0#1;main_~_hj_j~0#1 := main_~_hj_j~0#1 - main_~_hj_i~0#1;main_~_hj_j~0#1 := (if (1 == main_~_hj_j~0#1 || 0 == main_~_hj_j~0#1) && (1 == 65536 * main_~_hj_i~0#1 || 0 == 65536 * main_~_hj_i~0#1) then (if main_~_hj_j~0#1 == 65536 * main_~_hj_i~0#1 then 0 else 1) else (if 0 == main_~_hj_j~0#1 then 65536 * main_~_hj_i~0#1 else (if 0 == 65536 * main_~_hj_i~0#1 then main_~_hj_j~0#1 else ~bitwiseXOr(main_~_hj_j~0#1, 65536 * main_~_hj_i~0#1))));main_~_ha_hashv~0#1 := main_~_ha_hashv~0#1 - main_~_hj_i~0#1;main_~_ha_hashv~0#1 := main_~_ha_hashv~0#1 - main_~_hj_j~0#1;main_~_ha_hashv~0#1 := (if (1 == main_~_ha_hashv~0#1 || 0 == main_~_ha_hashv~0#1) && (1 == main_~_hj_j~0#1 / 32 || 0 == main_~_hj_j~0#1 / 32) then (if main_~_ha_hashv~0#1 == main_~_hj_j~0#1 / 32 then 0 else 1) else (if 0 == main_~_ha_hashv~0#1 then main_~_hj_j~0#1 / 32 else (if 0 == main_~_hj_j~0#1 / 32 then main_~_ha_hashv~0#1 else ~bitwiseXOr(main_~_ha_hashv~0#1, main_~_hj_j~0#1 / 32))));main_~_hj_i~0#1 := main_~_hj_i~0#1 - main_~_hj_j~0#1;main_~_hj_i~0#1 := main_~_hj_i~0#1 - main_~_ha_hashv~0#1;main_~_hj_i~0#1 := (if (1 == main_~_hj_i~0#1 || 0 == main_~_hj_i~0#1) && (1 == main_~_ha_hashv~0#1 / 8 || 0 == main_~_ha_hashv~0#1 / 8) then (if main_~_hj_i~0#1 == main_~_ha_hashv~0#1 / 8 then 0 else 1) else (if 0 == main_~_hj_i~0#1 then main_~_ha_hashv~0#1 / 8 else (if 0 == main_~_ha_hashv~0#1 / 8 then main_~_hj_i~0#1 else ~bitwiseXOr(main_~_hj_i~0#1, main_~_ha_hashv~0#1 / 8))));main_~_hj_j~0#1 := main_~_hj_j~0#1 - main_~_ha_hashv~0#1;main_~_hj_j~0#1 := main_~_hj_j~0#1 - main_~_hj_i~0#1;main_~_hj_j~0#1 := (if (1 == main_~_hj_j~0#1 || 0 == main_~_hj_j~0#1) && (1 == 1024 * main_~_hj_i~0#1 || 0 == 1024 * main_~_hj_i~0#1) then (if main_~_hj_j~0#1 == 1024 * main_~_hj_i~0#1 then 0 else 1) else (if 0 == main_~_hj_j~0#1 then 1024 * main_~_hj_i~0#1 else (if 0 == 1024 * main_~_hj_i~0#1 then main_~_hj_j~0#1 else ~bitwiseXOr(main_~_hj_j~0#1, 1024 * main_~_hj_i~0#1))));main_~_ha_hashv~0#1 := main_~_ha_hashv~0#1 - main_~_hj_i~0#1;main_~_ha_hashv~0#1 := main_~_ha_hashv~0#1 - main_~_hj_j~0#1;main_~_ha_hashv~0#1 := (if (1 == main_~_ha_hashv~0#1 || 0 == main_~_ha_hashv~0#1) && (1 == main_~_hj_j~0#1 / 32768 || 0 == main_~_hj_j~0#1 / 32768) then (if main_~_ha_hashv~0#1 == main_~_hj_j~0#1 / 32768 then 0 else 1) else (if 0 == main_~_ha_hashv~0#1 then main_~_hj_j~0#1 / 32768 else (if 0 == main_~_hj_j~0#1 / 32768 then main_~_ha_hashv~0#1 else ~bitwiseXOr(main_~_ha_hashv~0#1, main_~_hj_j~0#1 / 32768)))); {15787#(<= ~alt_bzero_count~0 0)} is VALID [2022-02-21 03:16:56,573 INFO L290 TraceCheckUtils]: 37: Hoare triple {15787#(<= ~alt_bzero_count~0 0)} goto; {15787#(<= ~alt_bzero_count~0 0)} is VALID [2022-02-21 03:16:56,573 INFO L290 TraceCheckUtils]: 38: Hoare triple {15787#(<= ~alt_bzero_count~0 0)} goto; {15787#(<= ~alt_bzero_count~0 0)} is VALID [2022-02-21 03:16:56,574 INFO L290 TraceCheckUtils]: 39: Hoare triple {15787#(<= ~alt_bzero_count~0 0)} goto; {15787#(<= ~alt_bzero_count~0 0)} is VALID [2022-02-21 03:16:56,574 INFO L290 TraceCheckUtils]: 40: Hoare triple {15787#(<= ~alt_bzero_count~0 0)} call write~int(main_~_ha_hashv~0#1, main_~user~0#1.base, 36 + main_~user~0#1.offset, 4);call write~$Pointer$(main_~user~0#1.base, main_~user~0#1.offset, main_~user~0#1.base, 28 + main_~user~0#1.offset, 4);call write~int(4, main_~user~0#1.base, 32 + main_~user~0#1.offset, 4); {15787#(<= ~alt_bzero_count~0 0)} is VALID [2022-02-21 03:16:56,574 INFO L290 TraceCheckUtils]: 41: Hoare triple {15787#(<= ~alt_bzero_count~0 0)} assume main_~users~0#1.base == 0 && main_~users~0#1.offset == 0;call write~$Pointer$(0, 0, main_~user~0#1.base, 16 + main_~user~0#1.offset, 4);call write~$Pointer$(0, 0, main_~user~0#1.base, 12 + main_~user~0#1.offset, 4); {15787#(<= ~alt_bzero_count~0 0)} is VALID [2022-02-21 03:16:56,575 INFO L272 TraceCheckUtils]: 42: Hoare triple {15787#(<= ~alt_bzero_count~0 0)} call main_#t~ret71#1.base, main_#t~ret71#1.offset := alt_malloc(44); {15787#(<= ~alt_bzero_count~0 0)} is VALID [2022-02-21 03:16:56,575 INFO L290 TraceCheckUtils]: 43: Hoare triple {15787#(<= ~alt_bzero_count~0 0)} ~sz := #in~sz;#t~post31 := ~alt_malloc_balance~0; {15787#(<= ~alt_bzero_count~0 0)} is VALID [2022-02-21 03:16:56,575 INFO L290 TraceCheckUtils]: 44: Hoare triple {15787#(<= ~alt_bzero_count~0 0)} assume 1 + #t~post31 <= 2147483647; {15787#(<= ~alt_bzero_count~0 0)} is VALID [2022-02-21 03:16:56,576 INFO L290 TraceCheckUtils]: 45: Hoare triple {15787#(<= ~alt_bzero_count~0 0)} assume 1 + #t~post31 >= -2147483648;~alt_malloc_balance~0 := 1 + #t~post31;call write~int(~sz, ~#alt_malloc_sizes~0.base, ~#alt_malloc_sizes~0.offset + 4 * #t~post31, 4);havoc #t~post31; {15787#(<= ~alt_bzero_count~0 0)} is VALID [2022-02-21 03:16:56,576 INFO L290 TraceCheckUtils]: 46: Hoare triple {15787#(<= ~alt_bzero_count~0 0)} assume !(1 == ~alt_malloc_balance~0); {15787#(<= ~alt_bzero_count~0 0)} is VALID [2022-02-21 03:16:56,576 INFO L290 TraceCheckUtils]: 47: Hoare triple {15787#(<= ~alt_bzero_count~0 0)} call #t~malloc32.base, #t~malloc32.offset := #Ultimate.allocOnHeap(~sz);#res.base, #res.offset := #t~malloc32.base, #t~malloc32.offset;havoc #t~malloc32.base, #t~malloc32.offset; {15787#(<= ~alt_bzero_count~0 0)} is VALID [2022-02-21 03:16:56,576 INFO L290 TraceCheckUtils]: 48: Hoare triple {15787#(<= ~alt_bzero_count~0 0)} assume true; {15787#(<= ~alt_bzero_count~0 0)} is VALID [2022-02-21 03:16:56,577 INFO L284 TraceCheckUtils]: 49: Hoare quadruple {15787#(<= ~alt_bzero_count~0 0)} {15787#(<= ~alt_bzero_count~0 0)} #855#return; {15787#(<= ~alt_bzero_count~0 0)} is VALID [2022-02-21 03:16:56,577 INFO L290 TraceCheckUtils]: 50: Hoare triple {15787#(<= ~alt_bzero_count~0 0)} call write~$Pointer$(main_#t~ret71#1.base, main_#t~ret71#1.offset, main_~user~0#1.base, 8 + main_~user~0#1.offset, 4);havoc main_#t~ret71#1.base, main_#t~ret71#1.offset;call main_#t~mem72#1.base, main_#t~mem72#1.offset := read~$Pointer$(main_~user~0#1.base, 8 + main_~user~0#1.offset, 4); {15787#(<= ~alt_bzero_count~0 0)} is VALID [2022-02-21 03:16:56,578 INFO L290 TraceCheckUtils]: 51: Hoare triple {15787#(<= ~alt_bzero_count~0 0)} assume !(main_#t~mem72#1.base == 0 && main_#t~mem72#1.offset == 0);havoc main_#t~mem72#1.base, main_#t~mem72#1.offset;call main_#t~mem73#1.base, main_#t~mem73#1.offset := read~$Pointer$(main_~user~0#1.base, 8 + main_~user~0#1.offset, 4); {15787#(<= ~alt_bzero_count~0 0)} is VALID [2022-02-21 03:16:56,578 INFO L272 TraceCheckUtils]: 52: Hoare triple {15787#(<= ~alt_bzero_count~0 0)} call alt_bzero(main_#t~mem73#1.base, main_#t~mem73#1.offset, 44); {15787#(<= ~alt_bzero_count~0 0)} is VALID [2022-02-21 03:16:56,578 INFO L290 TraceCheckUtils]: 53: Hoare triple {15787#(<= ~alt_bzero_count~0 0)} ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; {15787#(<= ~alt_bzero_count~0 0)} is VALID [2022-02-21 03:16:56,579 INFO L290 TraceCheckUtils]: 54: Hoare triple {15787#(<= ~alt_bzero_count~0 0)} assume !(1 + ~alt_bzero_count~0 <= 2147483647); {15783#false} is VALID [2022-02-21 03:16:56,579 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-21 03:16:56,579 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-21 03:16:56,579 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 03:16:56,580 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1089889511] [2022-02-21 03:16:56,580 WARN L317 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-02-21 03:16:56,580 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [752137057] [2022-02-21 03:16:56,580 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [752137057] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-21 03:16:56,580 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-21 03:16:56,580 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-02-21 03:16:56,580 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2047492774] [2022-02-21 03:16:56,580 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-21 03:16:56,581 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 26.0) internal successors, (52), 2 states have internal predecessors, (52), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 55 [2022-02-21 03:16:56,581 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-21 03:16:56,581 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 2 states have (on average 26.0) internal successors, (52), 2 states have internal predecessors, (52), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-21 03:16:56,621 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 55 edges. 55 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:16:56,622 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-21 03:16:56,627 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 03:16:56,627 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-21 03:16:56,627 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-21 03:16:56,628 INFO L87 Difference]: Start difference. First operand 710 states and 910 transitions. Second operand has 3 states, 2 states have (on average 26.0) internal successors, (52), 2 states have internal predecessors, (52), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-21 03:16:57,215 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:16:57,216 INFO L93 Difference]: Finished difference Result 739 states and 933 transitions. [2022-02-21 03:16:57,216 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-21 03:16:57,216 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 26.0) internal successors, (52), 2 states have internal predecessors, (52), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 55 [2022-02-21 03:16:57,216 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-21 03:16:57,216 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 2 states have (on average 26.0) internal successors, (52), 2 states have internal predecessors, (52), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-21 03:16:57,219 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 521 transitions. [2022-02-21 03:16:57,219 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 2 states have (on average 26.0) internal successors, (52), 2 states have internal predecessors, (52), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-21 03:16:57,221 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 521 transitions. [2022-02-21 03:16:57,221 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 521 transitions. [2022-02-21 03:16:57,619 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 521 edges. 521 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:16:57,637 INFO L225 Difference]: With dead ends: 739 [2022-02-21 03:16:57,637 INFO L226 Difference]: Without dead ends: 738 [2022-02-21 03:16:57,637 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 53 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-21 03:16:57,638 INFO L933 BasicCegarLoop]: 290 mSDtfsCounter, 179 mSDsluCounter, 282 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 179 SdHoareTripleChecker+Valid, 572 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-21 03:16:57,638 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [179 Valid, 572 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-21 03:16:57,639 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 738 states. [2022-02-21 03:16:57,731 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 738 to 728. [2022-02-21 03:16:57,731 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 03:16:57,732 INFO L82 GeneralOperation]: Start isEquivalent. First operand 738 states. Second operand has 728 states, 679 states have (on average 1.288659793814433) internal successors, (875), 696 states have internal predecessors, (875), 26 states have call successors, (26), 12 states have call predecessors, (26), 9 states have return successors, (29), 21 states have call predecessors, (29), 26 states have call successors, (29) [2022-02-21 03:16:57,733 INFO L74 IsIncluded]: Start isIncluded. First operand 738 states. Second operand has 728 states, 679 states have (on average 1.288659793814433) internal successors, (875), 696 states have internal predecessors, (875), 26 states have call successors, (26), 12 states have call predecessors, (26), 9 states have return successors, (29), 21 states have call predecessors, (29), 26 states have call successors, (29) [2022-02-21 03:16:57,734 INFO L87 Difference]: Start difference. First operand 738 states. Second operand has 728 states, 679 states have (on average 1.288659793814433) internal successors, (875), 696 states have internal predecessors, (875), 26 states have call successors, (26), 12 states have call predecessors, (26), 9 states have return successors, (29), 21 states have call predecessors, (29), 26 states have call successors, (29) [2022-02-21 03:16:57,751 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:16:57,751 INFO L93 Difference]: Finished difference Result 738 states and 932 transitions. [2022-02-21 03:16:57,751 INFO L276 IsEmpty]: Start isEmpty. Operand 738 states and 932 transitions. [2022-02-21 03:16:57,754 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:16:57,754 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:16:57,757 INFO L74 IsIncluded]: Start isIncluded. First operand has 728 states, 679 states have (on average 1.288659793814433) internal successors, (875), 696 states have internal predecessors, (875), 26 states have call successors, (26), 12 states have call predecessors, (26), 9 states have return successors, (29), 21 states have call predecessors, (29), 26 states have call successors, (29) Second operand 738 states. [2022-02-21 03:16:57,758 INFO L87 Difference]: Start difference. First operand has 728 states, 679 states have (on average 1.288659793814433) internal successors, (875), 696 states have internal predecessors, (875), 26 states have call successors, (26), 12 states have call predecessors, (26), 9 states have return successors, (29), 21 states have call predecessors, (29), 26 states have call successors, (29) Second operand 738 states. [2022-02-21 03:16:57,775 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:16:57,775 INFO L93 Difference]: Finished difference Result 738 states and 932 transitions. [2022-02-21 03:16:57,775 INFO L276 IsEmpty]: Start isEmpty. Operand 738 states and 932 transitions. [2022-02-21 03:16:57,777 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:16:57,777 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:16:57,777 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 03:16:57,777 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 03:16:57,778 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 728 states, 679 states have (on average 1.288659793814433) internal successors, (875), 696 states have internal predecessors, (875), 26 states have call successors, (26), 12 states have call predecessors, (26), 9 states have return successors, (29), 21 states have call predecessors, (29), 26 states have call successors, (29) [2022-02-21 03:16:57,796 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 728 states to 728 states and 930 transitions. [2022-02-21 03:16:57,796 INFO L78 Accepts]: Start accepts. Automaton has 728 states and 930 transitions. Word has length 55 [2022-02-21 03:16:57,797 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-21 03:16:57,797 INFO L470 AbstractCegarLoop]: Abstraction has 728 states and 930 transitions. [2022-02-21 03:16:57,797 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 26.0) internal successors, (52), 2 states have internal predecessors, (52), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-21 03:16:57,797 INFO L276 IsEmpty]: Start isEmpty. Operand 728 states and 930 transitions. [2022-02-21 03:16:57,797 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2022-02-21 03:16:57,797 INFO L506 BasicCegarLoop]: Found error trace [2022-02-21 03:16:57,797 INFO L514 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-21 03:16:57,815 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-02-21 03:16:58,014 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-21 03:16:58,015 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting alt_bzeroErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [alt_mallocErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, alt_mallocErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, alt_freeErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2022-02-21 03:16:58,015 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:16:58,015 INFO L85 PathProgramCache]: Analyzing trace with hash 1137661302, now seen corresponding path program 1 times [2022-02-21 03:16:58,015 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:16:58,015 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1904572324] [2022-02-21 03:16:58,015 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:16:58,016 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:16:58,046 ERROR L252 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-02-21 03:16:58,047 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [520096739] [2022-02-21 03:16:58,047 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:16:58,047 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-21 03:16:58,047 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:16:58,050 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-02-21 03:16:58,075 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-02-21 03:16:58,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:16:58,224 INFO L263 TraceCheckSpWp]: Trace formula consists of 329 conjuncts, 4 conjunts are in the unsatisfiable core [2022-02-21 03:16:58,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:16:58,256 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 03:16:58,455 INFO L290 TraceCheckUtils]: 0: Hoare triple {19166#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(21, 2);~#alt_malloc_sizes~0.base, ~#alt_malloc_sizes~0.offset := 3, 0;call #Ultimate.allocInit(40, 3);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#alt_malloc_sizes~0.base);~alt_malloc_balance~0 := 0;~alt_memcmp_count~0 := 0;~alt_bzero_count~0 := 0; {19171#(<= 0 ~alt_bzero_count~0)} is VALID [2022-02-21 03:16:58,456 INFO L290 TraceCheckUtils]: 1: Hoare triple {19171#(<= 0 ~alt_bzero_count~0)} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret43#1.base, main_#t~ret43#1.offset, main_#t~mem44#1, main_#t~mem45#1, main_#t~mem46#1, main_#t~mem48#1, main_#t~mem47#1, main_#t~mem49#1, main_#t~mem50#1, main_#t~mem52#1, main_#t~mem51#1, main_#t~mem53#1, main_#t~mem54#1, main_#t~mem56#1, main_#t~mem55#1, main_#t~mem57#1, main_#t~mem58#1, main_#t~switch59#1, main_#t~mem60#1, main_#t~mem61#1, main_#t~mem62#1, main_#t~mem63#1, main_#t~mem64#1, main_#t~mem65#1, main_#t~mem66#1, main_#t~mem67#1, main_#t~mem68#1, main_#t~mem69#1, main_#t~mem70#1, main_~_hj_i~0#1, main_~_hj_j~0#1, main_~_hj_k~0#1, main_~_hj_key~0#1.base, main_~_hj_key~0#1.offset, main_#t~ret71#1.base, main_#t~ret71#1.offset, main_#t~mem72#1.base, main_#t~mem72#1.offset, main_#t~mem73#1.base, main_#t~mem73#1.offset, main_#t~mem74#1.base, main_#t~mem74#1.offset, main_#t~mem75#1.base, main_#t~mem75#1.offset, main_#t~mem76#1.base, main_#t~mem76#1.offset, main_#t~mem77#1.base, main_#t~mem77#1.offset, main_#t~mem78#1.base, main_#t~mem78#1.offset, main_#t~ret79#1.base, main_#t~ret79#1.offset, main_#t~mem80#1.base, main_#t~mem80#1.offset, main_#t~mem81#1.base, main_#t~mem81#1.offset, main_#t~mem82#1.base, main_#t~mem82#1.offset, main_#t~mem83#1.base, main_#t~mem83#1.offset, main_#t~mem84#1.base, main_#t~mem84#1.offset, main_#t~mem85#1.base, main_#t~mem85#1.offset, main_#t~mem86#1.base, main_#t~mem86#1.offset, main_#t~mem87#1.base, main_#t~mem87#1.offset, main_#t~mem88#1.base, main_#t~mem88#1.offset, main_#t~mem89#1.base, main_#t~mem89#1.offset, main_#t~mem90#1, main_#t~mem91#1.base, main_#t~mem91#1.offset, main_#t~mem92#1.base, main_#t~mem92#1.offset, main_#t~mem93#1.base, main_#t~mem93#1.offset, main_#t~mem94#1.base, main_#t~mem94#1.offset, main_#t~mem95#1, main_#t~post96#1, main_#t~mem97#1.base, main_#t~mem97#1.offset, main_#t~mem98#1, main_#t~mem99#1.base, main_#t~mem99#1.offset, main_#t~mem100#1.base, main_#t~mem100#1.offset, main_#t~mem101#1, main_#t~post102#1, main_#t~mem103#1.base, main_#t~mem103#1.offset, main_#t~mem104#1.base, main_#t~mem104#1.offset, main_#t~mem105#1.base, main_#t~mem105#1.offset, main_#t~mem107#1, main_#t~mem106#1, main_#t~mem108#1.base, main_#t~mem108#1.offset, main_#t~mem109#1, main_#t~short110#1, main_#t~mem111#1.base, main_#t~mem111#1.offset, main_#t~mem112#1, main_#t~ret113#1.base, main_#t~ret113#1.offset, main_#t~mem114#1.base, main_#t~mem114#1.offset, main_#t~mem115#1.base, main_#t~mem115#1.offset, main_#t~mem116#1.base, main_#t~mem116#1.offset, main_#t~mem117#1, main_#t~mem118#1.base, main_#t~mem118#1.offset, main_#t~mem119#1.base, main_#t~mem119#1.offset, main_#t~mem122#1, main_#t~mem120#1.base, main_#t~mem120#1.offset, main_#t~mem121#1, main_#t~mem123#1.base, main_#t~mem123#1.offset, main_#t~mem126#1, main_#t~mem124#1.base, main_#t~mem124#1.offset, main_#t~mem125#1, main_#t~ite127#1, main_#t~mem128#1.base, main_#t~mem128#1.offset, main_#t~mem132#1.base, main_#t~mem132#1.offset, main_#t~mem133#1.base, main_#t~mem133#1.offset, main_#t~mem134#1.base, main_#t~mem134#1.offset, main_#t~mem135#1.base, main_#t~mem135#1.offset, main_#t~mem138#1, main_#t~mem136#1.base, main_#t~mem136#1.offset, main_#t~mem137#1, main_#t~mem139#1.base, main_#t~mem139#1.offset, main_#t~mem140#1, main_#t~pre141#1, main_#t~mem142#1.base, main_#t~mem142#1.offset, main_#t~mem143#1, main_#t~mem144#1.base, main_#t~mem144#1.offset, main_#t~mem145#1, main_#t~post146#1, main_#t~mem150#1, main_#t~mem148#1, main_#t~mem147#1.base, main_#t~mem147#1.offset, main_#t~mem149#1, main_#t~mem151#1, main_#t~post152#1, main_#t~mem153#1.base, main_#t~mem153#1.offset, main_#t~mem154#1.base, main_#t~mem154#1.offset, main_#t~mem155#1.base, main_#t~mem155#1.offset, main_#t~post129#1, main_#t~mem130#1.base, main_#t~mem130#1.offset, main_#t~mem131#1, main_#t~mem156#1.base, main_#t~mem156#1.offset, main_#t~mem157#1.base, main_#t~mem157#1.offset, main_#t~mem158#1.base, main_#t~mem158#1.offset, main_#t~mem159#1, main_#t~mem160#1.base, main_#t~mem160#1.offset, main_#t~mem161#1, main_#t~mem162#1.base, main_#t~mem162#1.offset, main_#t~mem163#1, main_#t~post164#1, main_#t~mem165#1.base, main_#t~mem165#1.offset, main_#t~mem166#1.base, main_#t~mem166#1.offset, main_#t~mem167#1.base, main_#t~mem167#1.offset, main_#t~mem168#1.base, main_#t~mem168#1.offset, main_#t~mem171#1, main_#t~mem169#1.base, main_#t~mem169#1.offset, main_#t~mem170#1, main_#t~ite174#1, main_#t~mem172#1.base, main_#t~mem172#1.offset, main_#t~mem173#1, main_#t~mem175#1.base, main_#t~mem175#1.offset, main_#t~mem176#1, main_#t~mem177#1.base, main_#t~mem177#1.offset, main_~_he_bkt~0#1, main_~_he_bkt_i~0#1, main_~_he_thh~0#1.base, main_~_he_thh~0#1.offset, main_~_he_hh_nxt~0#1.base, main_~_he_hh_nxt~0#1.offset, main_~#_he_new_buckets~0#1.base, main_~#_he_new_buckets~0#1.offset, main_~_he_newbkt~0#1.base, main_~_he_newbkt~0#1.offset, main_~_ha_head~0#1.base, main_~_ha_head~0#1.offset, main_~_ha_bkt~0#1, main_~_ha_hashv~0#1, main_#t~mem40#1, main_#t~post41#1, main_#t~mem42#1, main_#t~mem182#1, main_#t~mem181#1, main_#t~mem183#1, main_#t~mem184#1, main_#t~mem186#1, main_#t~mem185#1, main_#t~mem187#1, main_#t~mem188#1, main_#t~mem190#1, main_#t~mem189#1, main_#t~mem191#1, main_#t~mem192#1, main_#t~switch193#1, main_#t~mem194#1, main_#t~mem195#1, main_#t~mem196#1, main_#t~mem197#1, main_#t~mem198#1, main_#t~mem199#1, main_#t~mem200#1, main_#t~mem201#1, main_#t~mem202#1, main_#t~mem203#1, main_#t~mem204#1, main_~_hj_i~1#1, main_~_hj_j~1#1, main_~_hj_k~1#1, main_~_hj_key~1#1.base, main_~_hj_key~1#1.offset, main_#t~mem205#1.base, main_#t~mem205#1.offset, main_#t~mem206#1, main_#t~mem207#1.base, main_#t~mem207#1.offset, main_#t~mem208#1.base, main_#t~mem208#1.offset, main_#t~mem209#1.base, main_#t~mem209#1.offset, main_#t~mem210#1.base, main_#t~mem210#1.offset, main_#t~mem211#1.base, main_#t~mem211#1.offset, main_#t~mem212#1.base, main_#t~mem212#1.offset, main_#t~mem213#1.base, main_#t~mem213#1.offset, main_#t~mem214#1, main_#t~mem215#1, main_#t~mem216#1, main_#t~short217#1, main_#t~mem218#1.base, main_#t~mem218#1.offset, main_#t~ret219#1, main_#t~mem220#1.base, main_#t~mem220#1.offset, main_#t~mem221#1.base, main_#t~mem221#1.offset, main_#t~mem222#1.base, main_#t~mem222#1.offset, main_#t~mem223#1, main_~_hf_bkt~0#1, main_~_hf_hashv~0#1, main_#t~mem224#1.base, main_#t~mem224#1.offset, main_#t~mem225#1.base, main_#t~mem225#1.offset, main_#t~short226#1, main_#t~mem227#1.base, main_#t~mem227#1.offset, main_#t~mem228#1.base, main_#t~mem228#1.offset, main_#t~mem229#1.base, main_#t~mem229#1.offset, main_#t~mem230#1, main_#t~mem231#1.base, main_#t~mem231#1.offset, main_#t~mem232#1.base, main_#t~mem232#1.offset, main_#t~mem233#1.base, main_#t~mem233#1.offset, main_#t~mem234#1.base, main_#t~mem234#1.offset, main_#t~mem235#1.base, main_#t~mem235#1.offset, main_#t~mem236#1.base, main_#t~mem236#1.offset, main_#t~mem237#1, main_#t~mem238#1.base, main_#t~mem238#1.offset, main_#t~mem239#1.base, main_#t~mem239#1.offset, main_#t~mem240#1.base, main_#t~mem240#1.offset, main_#t~mem241#1, main_#t~mem242#1.base, main_#t~mem242#1.offset, main_#t~mem243#1.base, main_#t~mem243#1.offset, main_#t~mem244#1.base, main_#t~mem244#1.offset, main_#t~mem245#1.base, main_#t~mem245#1.offset, main_#t~mem246#1.base, main_#t~mem246#1.offset, main_#t~mem247#1, main_#t~mem248#1.base, main_#t~mem248#1.offset, main_#t~mem251#1, main_#t~mem249#1.base, main_#t~mem249#1.offset, main_#t~mem250#1, main_#t~mem252#1.base, main_#t~mem252#1.offset, main_#t~mem253#1.base, main_#t~mem253#1.offset, main_#t~mem254#1, main_#t~post255#1, main_#t~mem256#1.base, main_#t~mem256#1.offset, main_#t~mem257#1.base, main_#t~mem257#1.offset, main_#t~mem258#1.base, main_#t~mem258#1.offset, main_#t~mem259#1.base, main_#t~mem259#1.offset, main_#t~mem260#1.base, main_#t~mem260#1.offset, main_#t~mem261#1.base, main_#t~mem261#1.offset, main_#t~mem262#1.base, main_#t~mem262#1.offset, main_#t~mem263#1.base, main_#t~mem263#1.offset, main_~_hd_head~0#1.base, main_~_hd_head~0#1.offset, main_#t~mem264#1.base, main_#t~mem264#1.offset, main_#t~mem265#1, main_#t~post266#1, main_~_hd_bkt~0#1, main_~_hd_hh_del~0#1.base, main_~_hd_hh_del~0#1.offset, main_#t~mem178#1, main_#t~post179#1, main_#t~mem180#1, main_#t~mem267#1.base, main_#t~mem267#1.offset, main_~#i~0#1.base, main_~#i~0#1.offset, main_~user~0#1.base, main_~user~0#1.offset, main_~tmp~0#1.base, main_~tmp~0#1.offset, main_~users~0#1.base, main_~users~0#1.offset;call main_~#i~0#1.base, main_~#i~0#1.offset := #Ultimate.allocOnStack(4);havoc main_~user~0#1.base, main_~user~0#1.offset;havoc main_~tmp~0#1.base, main_~tmp~0#1.offset;main_~users~0#1.base, main_~users~0#1.offset := 0, 0;call write~int(0, main_~#i~0#1.base, main_~#i~0#1.offset, 4); {19171#(<= 0 ~alt_bzero_count~0)} is VALID [2022-02-21 03:16:58,456 INFO L290 TraceCheckUtils]: 2: Hoare triple {19171#(<= 0 ~alt_bzero_count~0)} call main_#t~mem42#1 := read~int(main_~#i~0#1.base, main_~#i~0#1.offset, 4); {19171#(<= 0 ~alt_bzero_count~0)} is VALID [2022-02-21 03:16:58,457 INFO L290 TraceCheckUtils]: 3: Hoare triple {19171#(<= 0 ~alt_bzero_count~0)} assume !!(main_#t~mem42#1 < 10);havoc main_#t~mem42#1;assume { :begin_inline_real_malloc } true;real_malloc_#in~n#1 := 40;havoc real_malloc_#res#1.base, real_malloc_#res#1.offset;havoc real_malloc_#t~malloc39#1.base, real_malloc_#t~malloc39#1.offset, real_malloc_~n#1;real_malloc_~n#1 := real_malloc_#in~n#1;call real_malloc_#t~malloc39#1.base, real_malloc_#t~malloc39#1.offset := #Ultimate.allocOnHeap(real_malloc_~n#1);real_malloc_#res#1.base, real_malloc_#res#1.offset := real_malloc_#t~malloc39#1.base, real_malloc_#t~malloc39#1.offset;havoc real_malloc_#t~malloc39#1.base, real_malloc_#t~malloc39#1.offset; {19171#(<= 0 ~alt_bzero_count~0)} is VALID [2022-02-21 03:16:58,457 INFO L290 TraceCheckUtils]: 4: Hoare triple {19171#(<= 0 ~alt_bzero_count~0)} main_#t~ret43#1.base, main_#t~ret43#1.offset := real_malloc_#res#1.base, real_malloc_#res#1.offset;assume { :end_inline_real_malloc } true;main_~user~0#1.base, main_~user~0#1.offset := main_#t~ret43#1.base, main_#t~ret43#1.offset;havoc main_#t~ret43#1.base, main_#t~ret43#1.offset; {19171#(<= 0 ~alt_bzero_count~0)} is VALID [2022-02-21 03:16:58,457 INFO L290 TraceCheckUtils]: 5: Hoare triple {19171#(<= 0 ~alt_bzero_count~0)} assume !(main_~user~0#1.base == 0 && main_~user~0#1.offset == 0); {19171#(<= 0 ~alt_bzero_count~0)} is VALID [2022-02-21 03:16:58,458 INFO L290 TraceCheckUtils]: 6: Hoare triple {19171#(<= 0 ~alt_bzero_count~0)} call main_#t~mem44#1 := read~int(main_~#i~0#1.base, main_~#i~0#1.offset, 4);call write~int(main_#t~mem44#1, main_~user~0#1.base, main_~user~0#1.offset, 4);havoc main_#t~mem44#1;call main_#t~mem45#1 := read~int(main_~#i~0#1.base, main_~#i~0#1.offset, 4);call main_#t~mem46#1 := read~int(main_~#i~0#1.base, main_~#i~0#1.offset, 4); {19171#(<= 0 ~alt_bzero_count~0)} is VALID [2022-02-21 03:16:58,458 INFO L290 TraceCheckUtils]: 7: Hoare triple {19171#(<= 0 ~alt_bzero_count~0)} assume main_#t~mem45#1 * main_#t~mem46#1 <= 2147483647; {19171#(<= 0 ~alt_bzero_count~0)} is VALID [2022-02-21 03:16:58,458 INFO L290 TraceCheckUtils]: 8: Hoare triple {19171#(<= 0 ~alt_bzero_count~0)} assume main_#t~mem45#1 * main_#t~mem46#1 >= -2147483648;call write~int(main_#t~mem45#1 * main_#t~mem46#1, main_~user~0#1.base, 4 + main_~user~0#1.offset, 4);havoc main_#t~mem45#1;havoc main_#t~mem46#1; {19171#(<= 0 ~alt_bzero_count~0)} is VALID [2022-02-21 03:16:58,459 INFO L290 TraceCheckUtils]: 9: Hoare triple {19171#(<= 0 ~alt_bzero_count~0)} havoc main_~_ha_hashv~0#1; {19171#(<= 0 ~alt_bzero_count~0)} is VALID [2022-02-21 03:16:58,459 INFO L290 TraceCheckUtils]: 10: Hoare triple {19171#(<= 0 ~alt_bzero_count~0)} goto; {19171#(<= 0 ~alt_bzero_count~0)} is VALID [2022-02-21 03:16:58,460 INFO L290 TraceCheckUtils]: 11: Hoare triple {19171#(<= 0 ~alt_bzero_count~0)} havoc main_~_hj_i~0#1;havoc main_~_hj_j~0#1;havoc main_~_hj_k~0#1;main_~_hj_key~0#1.base, main_~_hj_key~0#1.offset := main_~user~0#1.base, main_~user~0#1.offset;main_~_ha_hashv~0#1 := 4276993775;main_~_hj_j~0#1 := 2654435769;main_~_hj_i~0#1 := main_~_hj_j~0#1;main_~_hj_k~0#1 := 4; {19171#(<= 0 ~alt_bzero_count~0)} is VALID [2022-02-21 03:16:58,460 INFO L290 TraceCheckUtils]: 12: Hoare triple {19171#(<= 0 ~alt_bzero_count~0)} assume !(main_~_hj_k~0#1 % 4294967296 >= 12); {19171#(<= 0 ~alt_bzero_count~0)} is VALID [2022-02-21 03:16:58,460 INFO L290 TraceCheckUtils]: 13: Hoare triple {19171#(<= 0 ~alt_bzero_count~0)} main_~_ha_hashv~0#1 := 4 + main_~_ha_hashv~0#1;main_#t~switch59#1 := 11 == main_~_hj_k~0#1; {19171#(<= 0 ~alt_bzero_count~0)} is VALID [2022-02-21 03:16:58,461 INFO L290 TraceCheckUtils]: 14: Hoare triple {19171#(<= 0 ~alt_bzero_count~0)} assume !main_#t~switch59#1; {19171#(<= 0 ~alt_bzero_count~0)} is VALID [2022-02-21 03:16:58,461 INFO L290 TraceCheckUtils]: 15: Hoare triple {19171#(<= 0 ~alt_bzero_count~0)} main_#t~switch59#1 := main_#t~switch59#1 || 10 == main_~_hj_k~0#1; {19171#(<= 0 ~alt_bzero_count~0)} is VALID [2022-02-21 03:16:58,461 INFO L290 TraceCheckUtils]: 16: Hoare triple {19171#(<= 0 ~alt_bzero_count~0)} assume !main_#t~switch59#1; {19171#(<= 0 ~alt_bzero_count~0)} is VALID [2022-02-21 03:16:58,462 INFO L290 TraceCheckUtils]: 17: Hoare triple {19171#(<= 0 ~alt_bzero_count~0)} main_#t~switch59#1 := main_#t~switch59#1 || 9 == main_~_hj_k~0#1; {19171#(<= 0 ~alt_bzero_count~0)} is VALID [2022-02-21 03:16:58,462 INFO L290 TraceCheckUtils]: 18: Hoare triple {19171#(<= 0 ~alt_bzero_count~0)} assume !main_#t~switch59#1; {19171#(<= 0 ~alt_bzero_count~0)} is VALID [2022-02-21 03:16:58,462 INFO L290 TraceCheckUtils]: 19: Hoare triple {19171#(<= 0 ~alt_bzero_count~0)} main_#t~switch59#1 := main_#t~switch59#1 || 8 == main_~_hj_k~0#1; {19171#(<= 0 ~alt_bzero_count~0)} is VALID [2022-02-21 03:16:58,463 INFO L290 TraceCheckUtils]: 20: Hoare triple {19171#(<= 0 ~alt_bzero_count~0)} assume !main_#t~switch59#1; {19171#(<= 0 ~alt_bzero_count~0)} is VALID [2022-02-21 03:16:58,463 INFO L290 TraceCheckUtils]: 21: Hoare triple {19171#(<= 0 ~alt_bzero_count~0)} main_#t~switch59#1 := main_#t~switch59#1 || 7 == main_~_hj_k~0#1; {19171#(<= 0 ~alt_bzero_count~0)} is VALID [2022-02-21 03:16:58,463 INFO L290 TraceCheckUtils]: 22: Hoare triple {19171#(<= 0 ~alt_bzero_count~0)} assume !main_#t~switch59#1; {19171#(<= 0 ~alt_bzero_count~0)} is VALID [2022-02-21 03:16:58,464 INFO L290 TraceCheckUtils]: 23: Hoare triple {19171#(<= 0 ~alt_bzero_count~0)} main_#t~switch59#1 := main_#t~switch59#1 || 6 == main_~_hj_k~0#1; {19171#(<= 0 ~alt_bzero_count~0)} is VALID [2022-02-21 03:16:58,464 INFO L290 TraceCheckUtils]: 24: Hoare triple {19171#(<= 0 ~alt_bzero_count~0)} assume !main_#t~switch59#1; {19171#(<= 0 ~alt_bzero_count~0)} is VALID [2022-02-21 03:16:58,464 INFO L290 TraceCheckUtils]: 25: Hoare triple {19171#(<= 0 ~alt_bzero_count~0)} main_#t~switch59#1 := main_#t~switch59#1 || 5 == main_~_hj_k~0#1; {19171#(<= 0 ~alt_bzero_count~0)} is VALID [2022-02-21 03:16:58,465 INFO L290 TraceCheckUtils]: 26: Hoare triple {19171#(<= 0 ~alt_bzero_count~0)} assume !main_#t~switch59#1; {19171#(<= 0 ~alt_bzero_count~0)} is VALID [2022-02-21 03:16:58,466 INFO L290 TraceCheckUtils]: 27: Hoare triple {19171#(<= 0 ~alt_bzero_count~0)} main_#t~switch59#1 := main_#t~switch59#1 || 4 == main_~_hj_k~0#1; {19171#(<= 0 ~alt_bzero_count~0)} is VALID [2022-02-21 03:16:58,466 INFO L290 TraceCheckUtils]: 28: Hoare triple {19171#(<= 0 ~alt_bzero_count~0)} assume main_#t~switch59#1;call main_#t~mem67#1 := read~int(main_~_hj_key~0#1.base, 3 + main_~_hj_key~0#1.offset, 1);main_~_hj_i~0#1 := main_~_hj_i~0#1 + 16777216 * (main_#t~mem67#1 % 256);havoc main_#t~mem67#1; {19171#(<= 0 ~alt_bzero_count~0)} is VALID [2022-02-21 03:16:58,467 INFO L290 TraceCheckUtils]: 29: Hoare triple {19171#(<= 0 ~alt_bzero_count~0)} main_#t~switch59#1 := main_#t~switch59#1 || 3 == main_~_hj_k~0#1; {19171#(<= 0 ~alt_bzero_count~0)} is VALID [2022-02-21 03:16:58,467 INFO L290 TraceCheckUtils]: 30: Hoare triple {19171#(<= 0 ~alt_bzero_count~0)} assume main_#t~switch59#1;call main_#t~mem68#1 := read~int(main_~_hj_key~0#1.base, 2 + main_~_hj_key~0#1.offset, 1);main_~_hj_i~0#1 := main_~_hj_i~0#1 + 65536 * (main_#t~mem68#1 % 256);havoc main_#t~mem68#1; {19171#(<= 0 ~alt_bzero_count~0)} is VALID [2022-02-21 03:16:58,467 INFO L290 TraceCheckUtils]: 31: Hoare triple {19171#(<= 0 ~alt_bzero_count~0)} main_#t~switch59#1 := main_#t~switch59#1 || 2 == main_~_hj_k~0#1; {19171#(<= 0 ~alt_bzero_count~0)} is VALID [2022-02-21 03:16:58,468 INFO L290 TraceCheckUtils]: 32: Hoare triple {19171#(<= 0 ~alt_bzero_count~0)} assume main_#t~switch59#1;call main_#t~mem69#1 := read~int(main_~_hj_key~0#1.base, 1 + main_~_hj_key~0#1.offset, 1);main_~_hj_i~0#1 := main_~_hj_i~0#1 + 256 * (main_#t~mem69#1 % 256);havoc main_#t~mem69#1; {19171#(<= 0 ~alt_bzero_count~0)} is VALID [2022-02-21 03:16:58,468 INFO L290 TraceCheckUtils]: 33: Hoare triple {19171#(<= 0 ~alt_bzero_count~0)} main_#t~switch59#1 := main_#t~switch59#1 || 1 == main_~_hj_k~0#1; {19171#(<= 0 ~alt_bzero_count~0)} is VALID [2022-02-21 03:16:58,469 INFO L290 TraceCheckUtils]: 34: Hoare triple {19171#(<= 0 ~alt_bzero_count~0)} assume main_#t~switch59#1;call main_#t~mem70#1 := read~int(main_~_hj_key~0#1.base, main_~_hj_key~0#1.offset, 1);main_~_hj_i~0#1 := main_~_hj_i~0#1 + main_#t~mem70#1 % 256;havoc main_#t~mem70#1; {19171#(<= 0 ~alt_bzero_count~0)} is VALID [2022-02-21 03:16:58,470 INFO L290 TraceCheckUtils]: 35: Hoare triple {19171#(<= 0 ~alt_bzero_count~0)} havoc main_#t~switch59#1; {19171#(<= 0 ~alt_bzero_count~0)} is VALID [2022-02-21 03:16:58,470 INFO L290 TraceCheckUtils]: 36: Hoare triple {19171#(<= 0 ~alt_bzero_count~0)} main_~_hj_i~0#1 := main_~_hj_i~0#1 - main_~_hj_j~0#1;main_~_hj_i~0#1 := main_~_hj_i~0#1 - main_~_ha_hashv~0#1;main_~_hj_i~0#1 := (if (1 == main_~_hj_i~0#1 || 0 == main_~_hj_i~0#1) && (1 == main_~_ha_hashv~0#1 / 8192 || 0 == main_~_ha_hashv~0#1 / 8192) then (if main_~_hj_i~0#1 == main_~_ha_hashv~0#1 / 8192 then 0 else 1) else (if 0 == main_~_hj_i~0#1 then main_~_ha_hashv~0#1 / 8192 else (if 0 == main_~_ha_hashv~0#1 / 8192 then main_~_hj_i~0#1 else ~bitwiseXOr(main_~_hj_i~0#1, main_~_ha_hashv~0#1 / 8192))));main_~_hj_j~0#1 := main_~_hj_j~0#1 - main_~_ha_hashv~0#1;main_~_hj_j~0#1 := main_~_hj_j~0#1 - main_~_hj_i~0#1;main_~_hj_j~0#1 := (if (1 == main_~_hj_j~0#1 || 0 == main_~_hj_j~0#1) && (1 == 256 * main_~_hj_i~0#1 || 0 == 256 * main_~_hj_i~0#1) then (if main_~_hj_j~0#1 == 256 * main_~_hj_i~0#1 then 0 else 1) else (if 0 == main_~_hj_j~0#1 then 256 * main_~_hj_i~0#1 else (if 0 == 256 * main_~_hj_i~0#1 then main_~_hj_j~0#1 else ~bitwiseXOr(main_~_hj_j~0#1, 256 * main_~_hj_i~0#1))));main_~_ha_hashv~0#1 := main_~_ha_hashv~0#1 - main_~_hj_i~0#1;main_~_ha_hashv~0#1 := main_~_ha_hashv~0#1 - main_~_hj_j~0#1;main_~_ha_hashv~0#1 := (if (1 == main_~_ha_hashv~0#1 || 0 == main_~_ha_hashv~0#1) && (1 == main_~_hj_j~0#1 / 8192 || 0 == main_~_hj_j~0#1 / 8192) then (if main_~_ha_hashv~0#1 == main_~_hj_j~0#1 / 8192 then 0 else 1) else (if 0 == main_~_ha_hashv~0#1 then main_~_hj_j~0#1 / 8192 else (if 0 == main_~_hj_j~0#1 / 8192 then main_~_ha_hashv~0#1 else ~bitwiseXOr(main_~_ha_hashv~0#1, main_~_hj_j~0#1 / 8192))));main_~_hj_i~0#1 := main_~_hj_i~0#1 - main_~_hj_j~0#1;main_~_hj_i~0#1 := main_~_hj_i~0#1 - main_~_ha_hashv~0#1;main_~_hj_i~0#1 := (if (1 == main_~_hj_i~0#1 || 0 == main_~_hj_i~0#1) && (1 == main_~_ha_hashv~0#1 / 4096 || 0 == main_~_ha_hashv~0#1 / 4096) then (if main_~_hj_i~0#1 == main_~_ha_hashv~0#1 / 4096 then 0 else 1) else (if 0 == main_~_hj_i~0#1 then main_~_ha_hashv~0#1 / 4096 else (if 0 == main_~_ha_hashv~0#1 / 4096 then main_~_hj_i~0#1 else ~bitwiseXOr(main_~_hj_i~0#1, main_~_ha_hashv~0#1 / 4096))));main_~_hj_j~0#1 := main_~_hj_j~0#1 - main_~_ha_hashv~0#1;main_~_hj_j~0#1 := main_~_hj_j~0#1 - main_~_hj_i~0#1;main_~_hj_j~0#1 := (if (1 == main_~_hj_j~0#1 || 0 == main_~_hj_j~0#1) && (1 == 65536 * main_~_hj_i~0#1 || 0 == 65536 * main_~_hj_i~0#1) then (if main_~_hj_j~0#1 == 65536 * main_~_hj_i~0#1 then 0 else 1) else (if 0 == main_~_hj_j~0#1 then 65536 * main_~_hj_i~0#1 else (if 0 == 65536 * main_~_hj_i~0#1 then main_~_hj_j~0#1 else ~bitwiseXOr(main_~_hj_j~0#1, 65536 * main_~_hj_i~0#1))));main_~_ha_hashv~0#1 := main_~_ha_hashv~0#1 - main_~_hj_i~0#1;main_~_ha_hashv~0#1 := main_~_ha_hashv~0#1 - main_~_hj_j~0#1;main_~_ha_hashv~0#1 := (if (1 == main_~_ha_hashv~0#1 || 0 == main_~_ha_hashv~0#1) && (1 == main_~_hj_j~0#1 / 32 || 0 == main_~_hj_j~0#1 / 32) then (if main_~_ha_hashv~0#1 == main_~_hj_j~0#1 / 32 then 0 else 1) else (if 0 == main_~_ha_hashv~0#1 then main_~_hj_j~0#1 / 32 else (if 0 == main_~_hj_j~0#1 / 32 then main_~_ha_hashv~0#1 else ~bitwiseXOr(main_~_ha_hashv~0#1, main_~_hj_j~0#1 / 32))));main_~_hj_i~0#1 := main_~_hj_i~0#1 - main_~_hj_j~0#1;main_~_hj_i~0#1 := main_~_hj_i~0#1 - main_~_ha_hashv~0#1;main_~_hj_i~0#1 := (if (1 == main_~_hj_i~0#1 || 0 == main_~_hj_i~0#1) && (1 == main_~_ha_hashv~0#1 / 8 || 0 == main_~_ha_hashv~0#1 / 8) then (if main_~_hj_i~0#1 == main_~_ha_hashv~0#1 / 8 then 0 else 1) else (if 0 == main_~_hj_i~0#1 then main_~_ha_hashv~0#1 / 8 else (if 0 == main_~_ha_hashv~0#1 / 8 then main_~_hj_i~0#1 else ~bitwiseXOr(main_~_hj_i~0#1, main_~_ha_hashv~0#1 / 8))));main_~_hj_j~0#1 := main_~_hj_j~0#1 - main_~_ha_hashv~0#1;main_~_hj_j~0#1 := main_~_hj_j~0#1 - main_~_hj_i~0#1;main_~_hj_j~0#1 := (if (1 == main_~_hj_j~0#1 || 0 == main_~_hj_j~0#1) && (1 == 1024 * main_~_hj_i~0#1 || 0 == 1024 * main_~_hj_i~0#1) then (if main_~_hj_j~0#1 == 1024 * main_~_hj_i~0#1 then 0 else 1) else (if 0 == main_~_hj_j~0#1 then 1024 * main_~_hj_i~0#1 else (if 0 == 1024 * main_~_hj_i~0#1 then main_~_hj_j~0#1 else ~bitwiseXOr(main_~_hj_j~0#1, 1024 * main_~_hj_i~0#1))));main_~_ha_hashv~0#1 := main_~_ha_hashv~0#1 - main_~_hj_i~0#1;main_~_ha_hashv~0#1 := main_~_ha_hashv~0#1 - main_~_hj_j~0#1;main_~_ha_hashv~0#1 := (if (1 == main_~_ha_hashv~0#1 || 0 == main_~_ha_hashv~0#1) && (1 == main_~_hj_j~0#1 / 32768 || 0 == main_~_hj_j~0#1 / 32768) then (if main_~_ha_hashv~0#1 == main_~_hj_j~0#1 / 32768 then 0 else 1) else (if 0 == main_~_ha_hashv~0#1 then main_~_hj_j~0#1 / 32768 else (if 0 == main_~_hj_j~0#1 / 32768 then main_~_ha_hashv~0#1 else ~bitwiseXOr(main_~_ha_hashv~0#1, main_~_hj_j~0#1 / 32768)))); {19171#(<= 0 ~alt_bzero_count~0)} is VALID [2022-02-21 03:16:58,470 INFO L290 TraceCheckUtils]: 37: Hoare triple {19171#(<= 0 ~alt_bzero_count~0)} goto; {19171#(<= 0 ~alt_bzero_count~0)} is VALID [2022-02-21 03:16:58,471 INFO L290 TraceCheckUtils]: 38: Hoare triple {19171#(<= 0 ~alt_bzero_count~0)} goto; {19171#(<= 0 ~alt_bzero_count~0)} is VALID [2022-02-21 03:16:58,471 INFO L290 TraceCheckUtils]: 39: Hoare triple {19171#(<= 0 ~alt_bzero_count~0)} goto; {19171#(<= 0 ~alt_bzero_count~0)} is VALID [2022-02-21 03:16:58,471 INFO L290 TraceCheckUtils]: 40: Hoare triple {19171#(<= 0 ~alt_bzero_count~0)} call write~int(main_~_ha_hashv~0#1, main_~user~0#1.base, 36 + main_~user~0#1.offset, 4);call write~$Pointer$(main_~user~0#1.base, main_~user~0#1.offset, main_~user~0#1.base, 28 + main_~user~0#1.offset, 4);call write~int(4, main_~user~0#1.base, 32 + main_~user~0#1.offset, 4); {19171#(<= 0 ~alt_bzero_count~0)} is VALID [2022-02-21 03:16:58,472 INFO L290 TraceCheckUtils]: 41: Hoare triple {19171#(<= 0 ~alt_bzero_count~0)} assume main_~users~0#1.base == 0 && main_~users~0#1.offset == 0;call write~$Pointer$(0, 0, main_~user~0#1.base, 16 + main_~user~0#1.offset, 4);call write~$Pointer$(0, 0, main_~user~0#1.base, 12 + main_~user~0#1.offset, 4); {19171#(<= 0 ~alt_bzero_count~0)} is VALID [2022-02-21 03:16:58,472 INFO L272 TraceCheckUtils]: 42: Hoare triple {19171#(<= 0 ~alt_bzero_count~0)} call main_#t~ret71#1.base, main_#t~ret71#1.offset := alt_malloc(44); {19171#(<= 0 ~alt_bzero_count~0)} is VALID [2022-02-21 03:16:58,472 INFO L290 TraceCheckUtils]: 43: Hoare triple {19171#(<= 0 ~alt_bzero_count~0)} ~sz := #in~sz;#t~post31 := ~alt_malloc_balance~0; {19171#(<= 0 ~alt_bzero_count~0)} is VALID [2022-02-21 03:16:58,473 INFO L290 TraceCheckUtils]: 44: Hoare triple {19171#(<= 0 ~alt_bzero_count~0)} assume 1 + #t~post31 <= 2147483647; {19171#(<= 0 ~alt_bzero_count~0)} is VALID [2022-02-21 03:16:58,473 INFO L290 TraceCheckUtils]: 45: Hoare triple {19171#(<= 0 ~alt_bzero_count~0)} assume 1 + #t~post31 >= -2147483648;~alt_malloc_balance~0 := 1 + #t~post31;call write~int(~sz, ~#alt_malloc_sizes~0.base, ~#alt_malloc_sizes~0.offset + 4 * #t~post31, 4);havoc #t~post31; {19171#(<= 0 ~alt_bzero_count~0)} is VALID [2022-02-21 03:16:58,473 INFO L290 TraceCheckUtils]: 46: Hoare triple {19171#(<= 0 ~alt_bzero_count~0)} assume !(1 == ~alt_malloc_balance~0); {19171#(<= 0 ~alt_bzero_count~0)} is VALID [2022-02-21 03:16:58,474 INFO L290 TraceCheckUtils]: 47: Hoare triple {19171#(<= 0 ~alt_bzero_count~0)} call #t~malloc32.base, #t~malloc32.offset := #Ultimate.allocOnHeap(~sz);#res.base, #res.offset := #t~malloc32.base, #t~malloc32.offset;havoc #t~malloc32.base, #t~malloc32.offset; {19171#(<= 0 ~alt_bzero_count~0)} is VALID [2022-02-21 03:16:58,474 INFO L290 TraceCheckUtils]: 48: Hoare triple {19171#(<= 0 ~alt_bzero_count~0)} assume true; {19171#(<= 0 ~alt_bzero_count~0)} is VALID [2022-02-21 03:16:58,475 INFO L284 TraceCheckUtils]: 49: Hoare quadruple {19171#(<= 0 ~alt_bzero_count~0)} {19171#(<= 0 ~alt_bzero_count~0)} #855#return; {19171#(<= 0 ~alt_bzero_count~0)} is VALID [2022-02-21 03:16:58,475 INFO L290 TraceCheckUtils]: 50: Hoare triple {19171#(<= 0 ~alt_bzero_count~0)} call write~$Pointer$(main_#t~ret71#1.base, main_#t~ret71#1.offset, main_~user~0#1.base, 8 + main_~user~0#1.offset, 4);havoc main_#t~ret71#1.base, main_#t~ret71#1.offset;call main_#t~mem72#1.base, main_#t~mem72#1.offset := read~$Pointer$(main_~user~0#1.base, 8 + main_~user~0#1.offset, 4); {19171#(<= 0 ~alt_bzero_count~0)} is VALID [2022-02-21 03:16:58,475 INFO L290 TraceCheckUtils]: 51: Hoare triple {19171#(<= 0 ~alt_bzero_count~0)} assume !(main_#t~mem72#1.base == 0 && main_#t~mem72#1.offset == 0);havoc main_#t~mem72#1.base, main_#t~mem72#1.offset;call main_#t~mem73#1.base, main_#t~mem73#1.offset := read~$Pointer$(main_~user~0#1.base, 8 + main_~user~0#1.offset, 4); {19171#(<= 0 ~alt_bzero_count~0)} is VALID [2022-02-21 03:16:58,476 INFO L272 TraceCheckUtils]: 52: Hoare triple {19171#(<= 0 ~alt_bzero_count~0)} call alt_bzero(main_#t~mem73#1.base, main_#t~mem73#1.offset, 44); {19171#(<= 0 ~alt_bzero_count~0)} is VALID [2022-02-21 03:16:58,476 INFO L290 TraceCheckUtils]: 53: Hoare triple {19171#(<= 0 ~alt_bzero_count~0)} ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; {19171#(<= 0 ~alt_bzero_count~0)} is VALID [2022-02-21 03:16:58,477 INFO L290 TraceCheckUtils]: 54: Hoare triple {19171#(<= 0 ~alt_bzero_count~0)} assume 1 + ~alt_bzero_count~0 <= 2147483647; {19171#(<= 0 ~alt_bzero_count~0)} is VALID [2022-02-21 03:16:58,477 INFO L290 TraceCheckUtils]: 55: Hoare triple {19171#(<= 0 ~alt_bzero_count~0)} assume !(1 + ~alt_bzero_count~0 >= -2147483648); {19167#false} is VALID [2022-02-21 03:16:58,478 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-21 03:16:58,478 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-21 03:16:58,479 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 03:16:58,479 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1904572324] [2022-02-21 03:16:58,479 WARN L317 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-02-21 03:16:58,479 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [520096739] [2022-02-21 03:16:58,479 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [520096739] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-21 03:16:58,479 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-21 03:16:58,479 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-02-21 03:16:58,479 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [999090657] [2022-02-21 03:16:58,479 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-21 03:16:58,480 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 26.5) internal successors, (53), 2 states have internal predecessors, (53), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 56 [2022-02-21 03:16:58,480 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-21 03:16:58,480 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 2 states have (on average 26.5) internal successors, (53), 2 states have internal predecessors, (53), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-21 03:16:58,530 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 56 edges. 56 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:16:58,531 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-21 03:16:58,531 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 03:16:58,531 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-21 03:16:58,531 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-21 03:16:58,531 INFO L87 Difference]: Start difference. First operand 728 states and 930 transitions. Second operand has 3 states, 2 states have (on average 26.5) internal successors, (53), 2 states have internal predecessors, (53), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-21 03:16:58,972 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:16:58,972 INFO L93 Difference]: Finished difference Result 728 states and 930 transitions. [2022-02-21 03:16:58,972 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-21 03:16:58,972 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 26.5) internal successors, (53), 2 states have internal predecessors, (53), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 56 [2022-02-21 03:16:58,973 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-21 03:16:58,973 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 2 states have (on average 26.5) internal successors, (53), 2 states have internal predecessors, (53), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-21 03:16:58,974 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 286 transitions. [2022-02-21 03:16:58,974 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 2 states have (on average 26.5) internal successors, (53), 2 states have internal predecessors, (53), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-21 03:16:58,975 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 286 transitions. [2022-02-21 03:16:58,975 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 286 transitions. [2022-02-21 03:16:59,228 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 286 edges. 286 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:16:59,248 INFO L225 Difference]: With dead ends: 728 [2022-02-21 03:16:59,248 INFO L226 Difference]: Without dead ends: 727 [2022-02-21 03:16:59,249 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 54 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-21 03:16:59,251 INFO L933 BasicCegarLoop]: 282 mSDtfsCounter, 229 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 229 SdHoareTripleChecker+Valid, 282 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-21 03:16:59,251 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [229 Valid, 282 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-21 03:16:59,252 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 727 states. [2022-02-21 03:16:59,421 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 727 to 727. [2022-02-21 03:16:59,421 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 03:16:59,424 INFO L82 GeneralOperation]: Start isEquivalent. First operand 727 states. Second operand has 727 states, 679 states have (on average 1.2857142857142858) internal successors, (873), 695 states have internal predecessors, (873), 26 states have call successors, (26), 12 states have call predecessors, (26), 9 states have return successors, (29), 21 states have call predecessors, (29), 26 states have call successors, (29) [2022-02-21 03:16:59,425 INFO L74 IsIncluded]: Start isIncluded. First operand 727 states. Second operand has 727 states, 679 states have (on average 1.2857142857142858) internal successors, (873), 695 states have internal predecessors, (873), 26 states have call successors, (26), 12 states have call predecessors, (26), 9 states have return successors, (29), 21 states have call predecessors, (29), 26 states have call successors, (29) [2022-02-21 03:16:59,426 INFO L87 Difference]: Start difference. First operand 727 states. Second operand has 727 states, 679 states have (on average 1.2857142857142858) internal successors, (873), 695 states have internal predecessors, (873), 26 states have call successors, (26), 12 states have call predecessors, (26), 9 states have return successors, (29), 21 states have call predecessors, (29), 26 states have call successors, (29) [2022-02-21 03:16:59,442 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:16:59,442 INFO L93 Difference]: Finished difference Result 727 states and 928 transitions. [2022-02-21 03:16:59,442 INFO L276 IsEmpty]: Start isEmpty. Operand 727 states and 928 transitions. [2022-02-21 03:16:59,443 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:16:59,443 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:16:59,444 INFO L74 IsIncluded]: Start isIncluded. First operand has 727 states, 679 states have (on average 1.2857142857142858) internal successors, (873), 695 states have internal predecessors, (873), 26 states have call successors, (26), 12 states have call predecessors, (26), 9 states have return successors, (29), 21 states have call predecessors, (29), 26 states have call successors, (29) Second operand 727 states. [2022-02-21 03:16:59,445 INFO L87 Difference]: Start difference. First operand has 727 states, 679 states have (on average 1.2857142857142858) internal successors, (873), 695 states have internal predecessors, (873), 26 states have call successors, (26), 12 states have call predecessors, (26), 9 states have return successors, (29), 21 states have call predecessors, (29), 26 states have call successors, (29) Second operand 727 states. [2022-02-21 03:16:59,461 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:16:59,462 INFO L93 Difference]: Finished difference Result 727 states and 928 transitions. [2022-02-21 03:16:59,462 INFO L276 IsEmpty]: Start isEmpty. Operand 727 states and 928 transitions. [2022-02-21 03:16:59,464 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:16:59,464 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:16:59,464 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 03:16:59,464 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 03:16:59,465 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 727 states, 679 states have (on average 1.2857142857142858) internal successors, (873), 695 states have internal predecessors, (873), 26 states have call successors, (26), 12 states have call predecessors, (26), 9 states have return successors, (29), 21 states have call predecessors, (29), 26 states have call successors, (29) [2022-02-21 03:16:59,482 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 727 states to 727 states and 928 transitions. [2022-02-21 03:16:59,483 INFO L78 Accepts]: Start accepts. Automaton has 727 states and 928 transitions. Word has length 56 [2022-02-21 03:16:59,483 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-21 03:16:59,483 INFO L470 AbstractCegarLoop]: Abstraction has 727 states and 928 transitions. [2022-02-21 03:16:59,484 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 26.5) internal successors, (53), 2 states have internal predecessors, (53), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-21 03:16:59,484 INFO L276 IsEmpty]: Start isEmpty. Operand 727 states and 928 transitions. [2022-02-21 03:16:59,484 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2022-02-21 03:16:59,484 INFO L506 BasicCegarLoop]: Found error trace [2022-02-21 03:16:59,484 INFO L514 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, 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] [2022-02-21 03:16:59,501 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2022-02-21 03:16:59,699 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-21 03:16:59,699 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [alt_mallocErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, alt_mallocErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, alt_freeErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2022-02-21 03:16:59,700 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:16:59,700 INFO L85 PathProgramCache]: Analyzing trace with hash -906147032, now seen corresponding path program 1 times [2022-02-21 03:16:59,700 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:16:59,700 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1794785749] [2022-02-21 03:16:59,700 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:16:59,700 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:16:59,783 ERROR L252 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-02-21 03:16:59,783 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2108640902] [2022-02-21 03:16:59,783 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:16:59,783 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-21 03:16:59,784 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:16:59,784 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-02-21 03:16:59,785 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-02-21 03:17:00,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:17:00,196 INFO L263 TraceCheckSpWp]: Trace formula consists of 1557 conjuncts, 5 conjunts are in the unsatisfiable core [2022-02-21 03:17:00,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:17:00,225 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 03:17:00,512 INFO L290 TraceCheckUtils]: 0: Hoare triple {22519#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(21, 2);~#alt_malloc_sizes~0.base, ~#alt_malloc_sizes~0.offset := 3, 0;call #Ultimate.allocInit(40, 3);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#alt_malloc_sizes~0.base);~alt_malloc_balance~0 := 0;~alt_memcmp_count~0 := 0;~alt_bzero_count~0 := 0; {22519#true} is VALID [2022-02-21 03:17:00,513 INFO L290 TraceCheckUtils]: 1: Hoare triple {22519#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret43#1.base, main_#t~ret43#1.offset, main_#t~mem44#1, main_#t~mem45#1, main_#t~mem46#1, main_#t~mem48#1, main_#t~mem47#1, main_#t~mem49#1, main_#t~mem50#1, main_#t~mem52#1, main_#t~mem51#1, main_#t~mem53#1, main_#t~mem54#1, main_#t~mem56#1, main_#t~mem55#1, main_#t~mem57#1, main_#t~mem58#1, main_#t~switch59#1, main_#t~mem60#1, main_#t~mem61#1, main_#t~mem62#1, main_#t~mem63#1, main_#t~mem64#1, main_#t~mem65#1, main_#t~mem66#1, main_#t~mem67#1, main_#t~mem68#1, main_#t~mem69#1, main_#t~mem70#1, main_~_hj_i~0#1, main_~_hj_j~0#1, main_~_hj_k~0#1, main_~_hj_key~0#1.base, main_~_hj_key~0#1.offset, main_#t~ret71#1.base, main_#t~ret71#1.offset, main_#t~mem72#1.base, main_#t~mem72#1.offset, main_#t~mem73#1.base, main_#t~mem73#1.offset, main_#t~mem74#1.base, main_#t~mem74#1.offset, main_#t~mem75#1.base, main_#t~mem75#1.offset, main_#t~mem76#1.base, main_#t~mem76#1.offset, main_#t~mem77#1.base, main_#t~mem77#1.offset, main_#t~mem78#1.base, main_#t~mem78#1.offset, main_#t~ret79#1.base, main_#t~ret79#1.offset, main_#t~mem80#1.base, main_#t~mem80#1.offset, main_#t~mem81#1.base, main_#t~mem81#1.offset, main_#t~mem82#1.base, main_#t~mem82#1.offset, main_#t~mem83#1.base, main_#t~mem83#1.offset, main_#t~mem84#1.base, main_#t~mem84#1.offset, main_#t~mem85#1.base, main_#t~mem85#1.offset, main_#t~mem86#1.base, main_#t~mem86#1.offset, main_#t~mem87#1.base, main_#t~mem87#1.offset, main_#t~mem88#1.base, main_#t~mem88#1.offset, main_#t~mem89#1.base, main_#t~mem89#1.offset, main_#t~mem90#1, main_#t~mem91#1.base, main_#t~mem91#1.offset, main_#t~mem92#1.base, main_#t~mem92#1.offset, main_#t~mem93#1.base, main_#t~mem93#1.offset, main_#t~mem94#1.base, main_#t~mem94#1.offset, main_#t~mem95#1, main_#t~post96#1, main_#t~mem97#1.base, main_#t~mem97#1.offset, main_#t~mem98#1, main_#t~mem99#1.base, main_#t~mem99#1.offset, main_#t~mem100#1.base, main_#t~mem100#1.offset, main_#t~mem101#1, main_#t~post102#1, main_#t~mem103#1.base, main_#t~mem103#1.offset, main_#t~mem104#1.base, main_#t~mem104#1.offset, main_#t~mem105#1.base, main_#t~mem105#1.offset, main_#t~mem107#1, main_#t~mem106#1, main_#t~mem108#1.base, main_#t~mem108#1.offset, main_#t~mem109#1, main_#t~short110#1, main_#t~mem111#1.base, main_#t~mem111#1.offset, main_#t~mem112#1, main_#t~ret113#1.base, main_#t~ret113#1.offset, main_#t~mem114#1.base, main_#t~mem114#1.offset, main_#t~mem115#1.base, main_#t~mem115#1.offset, main_#t~mem116#1.base, main_#t~mem116#1.offset, main_#t~mem117#1, main_#t~mem118#1.base, main_#t~mem118#1.offset, main_#t~mem119#1.base, main_#t~mem119#1.offset, main_#t~mem122#1, main_#t~mem120#1.base, main_#t~mem120#1.offset, main_#t~mem121#1, main_#t~mem123#1.base, main_#t~mem123#1.offset, main_#t~mem126#1, main_#t~mem124#1.base, main_#t~mem124#1.offset, main_#t~mem125#1, main_#t~ite127#1, main_#t~mem128#1.base, main_#t~mem128#1.offset, main_#t~mem132#1.base, main_#t~mem132#1.offset, main_#t~mem133#1.base, main_#t~mem133#1.offset, main_#t~mem134#1.base, main_#t~mem134#1.offset, main_#t~mem135#1.base, main_#t~mem135#1.offset, main_#t~mem138#1, main_#t~mem136#1.base, main_#t~mem136#1.offset, main_#t~mem137#1, main_#t~mem139#1.base, main_#t~mem139#1.offset, main_#t~mem140#1, main_#t~pre141#1, main_#t~mem142#1.base, main_#t~mem142#1.offset, main_#t~mem143#1, main_#t~mem144#1.base, main_#t~mem144#1.offset, main_#t~mem145#1, main_#t~post146#1, main_#t~mem150#1, main_#t~mem148#1, main_#t~mem147#1.base, main_#t~mem147#1.offset, main_#t~mem149#1, main_#t~mem151#1, main_#t~post152#1, main_#t~mem153#1.base, main_#t~mem153#1.offset, main_#t~mem154#1.base, main_#t~mem154#1.offset, main_#t~mem155#1.base, main_#t~mem155#1.offset, main_#t~post129#1, main_#t~mem130#1.base, main_#t~mem130#1.offset, main_#t~mem131#1, main_#t~mem156#1.base, main_#t~mem156#1.offset, main_#t~mem157#1.base, main_#t~mem157#1.offset, main_#t~mem158#1.base, main_#t~mem158#1.offset, main_#t~mem159#1, main_#t~mem160#1.base, main_#t~mem160#1.offset, main_#t~mem161#1, main_#t~mem162#1.base, main_#t~mem162#1.offset, main_#t~mem163#1, main_#t~post164#1, main_#t~mem165#1.base, main_#t~mem165#1.offset, main_#t~mem166#1.base, main_#t~mem166#1.offset, main_#t~mem167#1.base, main_#t~mem167#1.offset, main_#t~mem168#1.base, main_#t~mem168#1.offset, main_#t~mem171#1, main_#t~mem169#1.base, main_#t~mem169#1.offset, main_#t~mem170#1, main_#t~ite174#1, main_#t~mem172#1.base, main_#t~mem172#1.offset, main_#t~mem173#1, main_#t~mem175#1.base, main_#t~mem175#1.offset, main_#t~mem176#1, main_#t~mem177#1.base, main_#t~mem177#1.offset, main_~_he_bkt~0#1, main_~_he_bkt_i~0#1, main_~_he_thh~0#1.base, main_~_he_thh~0#1.offset, main_~_he_hh_nxt~0#1.base, main_~_he_hh_nxt~0#1.offset, main_~#_he_new_buckets~0#1.base, main_~#_he_new_buckets~0#1.offset, main_~_he_newbkt~0#1.base, main_~_he_newbkt~0#1.offset, main_~_ha_head~0#1.base, main_~_ha_head~0#1.offset, main_~_ha_bkt~0#1, main_~_ha_hashv~0#1, main_#t~mem40#1, main_#t~post41#1, main_#t~mem42#1, main_#t~mem182#1, main_#t~mem181#1, main_#t~mem183#1, main_#t~mem184#1, main_#t~mem186#1, main_#t~mem185#1, main_#t~mem187#1, main_#t~mem188#1, main_#t~mem190#1, main_#t~mem189#1, main_#t~mem191#1, main_#t~mem192#1, main_#t~switch193#1, main_#t~mem194#1, main_#t~mem195#1, main_#t~mem196#1, main_#t~mem197#1, main_#t~mem198#1, main_#t~mem199#1, main_#t~mem200#1, main_#t~mem201#1, main_#t~mem202#1, main_#t~mem203#1, main_#t~mem204#1, main_~_hj_i~1#1, main_~_hj_j~1#1, main_~_hj_k~1#1, main_~_hj_key~1#1.base, main_~_hj_key~1#1.offset, main_#t~mem205#1.base, main_#t~mem205#1.offset, main_#t~mem206#1, main_#t~mem207#1.base, main_#t~mem207#1.offset, main_#t~mem208#1.base, main_#t~mem208#1.offset, main_#t~mem209#1.base, main_#t~mem209#1.offset, main_#t~mem210#1.base, main_#t~mem210#1.offset, main_#t~mem211#1.base, main_#t~mem211#1.offset, main_#t~mem212#1.base, main_#t~mem212#1.offset, main_#t~mem213#1.base, main_#t~mem213#1.offset, main_#t~mem214#1, main_#t~mem215#1, main_#t~mem216#1, main_#t~short217#1, main_#t~mem218#1.base, main_#t~mem218#1.offset, main_#t~ret219#1, main_#t~mem220#1.base, main_#t~mem220#1.offset, main_#t~mem221#1.base, main_#t~mem221#1.offset, main_#t~mem222#1.base, main_#t~mem222#1.offset, main_#t~mem223#1, main_~_hf_bkt~0#1, main_~_hf_hashv~0#1, main_#t~mem224#1.base, main_#t~mem224#1.offset, main_#t~mem225#1.base, main_#t~mem225#1.offset, main_#t~short226#1, main_#t~mem227#1.base, main_#t~mem227#1.offset, main_#t~mem228#1.base, main_#t~mem228#1.offset, main_#t~mem229#1.base, main_#t~mem229#1.offset, main_#t~mem230#1, main_#t~mem231#1.base, main_#t~mem231#1.offset, main_#t~mem232#1.base, main_#t~mem232#1.offset, main_#t~mem233#1.base, main_#t~mem233#1.offset, main_#t~mem234#1.base, main_#t~mem234#1.offset, main_#t~mem235#1.base, main_#t~mem235#1.offset, main_#t~mem236#1.base, main_#t~mem236#1.offset, main_#t~mem237#1, main_#t~mem238#1.base, main_#t~mem238#1.offset, main_#t~mem239#1.base, main_#t~mem239#1.offset, main_#t~mem240#1.base, main_#t~mem240#1.offset, main_#t~mem241#1, main_#t~mem242#1.base, main_#t~mem242#1.offset, main_#t~mem243#1.base, main_#t~mem243#1.offset, main_#t~mem244#1.base, main_#t~mem244#1.offset, main_#t~mem245#1.base, main_#t~mem245#1.offset, main_#t~mem246#1.base, main_#t~mem246#1.offset, main_#t~mem247#1, main_#t~mem248#1.base, main_#t~mem248#1.offset, main_#t~mem251#1, main_#t~mem249#1.base, main_#t~mem249#1.offset, main_#t~mem250#1, main_#t~mem252#1.base, main_#t~mem252#1.offset, main_#t~mem253#1.base, main_#t~mem253#1.offset, main_#t~mem254#1, main_#t~post255#1, main_#t~mem256#1.base, main_#t~mem256#1.offset, main_#t~mem257#1.base, main_#t~mem257#1.offset, main_#t~mem258#1.base, main_#t~mem258#1.offset, main_#t~mem259#1.base, main_#t~mem259#1.offset, main_#t~mem260#1.base, main_#t~mem260#1.offset, main_#t~mem261#1.base, main_#t~mem261#1.offset, main_#t~mem262#1.base, main_#t~mem262#1.offset, main_#t~mem263#1.base, main_#t~mem263#1.offset, main_~_hd_head~0#1.base, main_~_hd_head~0#1.offset, main_#t~mem264#1.base, main_#t~mem264#1.offset, main_#t~mem265#1, main_#t~post266#1, main_~_hd_bkt~0#1, main_~_hd_hh_del~0#1.base, main_~_hd_hh_del~0#1.offset, main_#t~mem178#1, main_#t~post179#1, main_#t~mem180#1, main_#t~mem267#1.base, main_#t~mem267#1.offset, main_~#i~0#1.base, main_~#i~0#1.offset, main_~user~0#1.base, main_~user~0#1.offset, main_~tmp~0#1.base, main_~tmp~0#1.offset, main_~users~0#1.base, main_~users~0#1.offset;call main_~#i~0#1.base, main_~#i~0#1.offset := #Ultimate.allocOnStack(4);havoc main_~user~0#1.base, main_~user~0#1.offset;havoc main_~tmp~0#1.base, main_~tmp~0#1.offset;main_~users~0#1.base, main_~users~0#1.offset := 0, 0;call write~int(0, main_~#i~0#1.base, main_~#i~0#1.offset, 4); {22527#(and (= |ULTIMATE.start_main_~users~0#1.offset| 0) (= |ULTIMATE.start_main_~users~0#1.base| 0))} is VALID [2022-02-21 03:17:00,514 INFO L290 TraceCheckUtils]: 2: Hoare triple {22527#(and (= |ULTIMATE.start_main_~users~0#1.offset| 0) (= |ULTIMATE.start_main_~users~0#1.base| 0))} call main_#t~mem42#1 := read~int(main_~#i~0#1.base, main_~#i~0#1.offset, 4); {22527#(and (= |ULTIMATE.start_main_~users~0#1.offset| 0) (= |ULTIMATE.start_main_~users~0#1.base| 0))} is VALID [2022-02-21 03:17:00,514 INFO L290 TraceCheckUtils]: 3: Hoare triple {22527#(and (= |ULTIMATE.start_main_~users~0#1.offset| 0) (= |ULTIMATE.start_main_~users~0#1.base| 0))} assume !!(main_#t~mem42#1 < 10);havoc main_#t~mem42#1;assume { :begin_inline_real_malloc } true;real_malloc_#in~n#1 := 40;havoc real_malloc_#res#1.base, real_malloc_#res#1.offset;havoc real_malloc_#t~malloc39#1.base, real_malloc_#t~malloc39#1.offset, real_malloc_~n#1;real_malloc_~n#1 := real_malloc_#in~n#1;call real_malloc_#t~malloc39#1.base, real_malloc_#t~malloc39#1.offset := #Ultimate.allocOnHeap(real_malloc_~n#1);real_malloc_#res#1.base, real_malloc_#res#1.offset := real_malloc_#t~malloc39#1.base, real_malloc_#t~malloc39#1.offset;havoc real_malloc_#t~malloc39#1.base, real_malloc_#t~malloc39#1.offset; {22527#(and (= |ULTIMATE.start_main_~users~0#1.offset| 0) (= |ULTIMATE.start_main_~users~0#1.base| 0))} is VALID [2022-02-21 03:17:00,515 INFO L290 TraceCheckUtils]: 4: Hoare triple {22527#(and (= |ULTIMATE.start_main_~users~0#1.offset| 0) (= |ULTIMATE.start_main_~users~0#1.base| 0))} main_#t~ret43#1.base, main_#t~ret43#1.offset := real_malloc_#res#1.base, real_malloc_#res#1.offset;assume { :end_inline_real_malloc } true;main_~user~0#1.base, main_~user~0#1.offset := main_#t~ret43#1.base, main_#t~ret43#1.offset;havoc main_#t~ret43#1.base, main_#t~ret43#1.offset; {22527#(and (= |ULTIMATE.start_main_~users~0#1.offset| 0) (= |ULTIMATE.start_main_~users~0#1.base| 0))} is VALID [2022-02-21 03:17:00,515 INFO L290 TraceCheckUtils]: 5: Hoare triple {22527#(and (= |ULTIMATE.start_main_~users~0#1.offset| 0) (= |ULTIMATE.start_main_~users~0#1.base| 0))} assume !(main_~user~0#1.base == 0 && main_~user~0#1.offset == 0); {22527#(and (= |ULTIMATE.start_main_~users~0#1.offset| 0) (= |ULTIMATE.start_main_~users~0#1.base| 0))} is VALID [2022-02-21 03:17:00,516 INFO L290 TraceCheckUtils]: 6: Hoare triple {22527#(and (= |ULTIMATE.start_main_~users~0#1.offset| 0) (= |ULTIMATE.start_main_~users~0#1.base| 0))} call main_#t~mem44#1 := read~int(main_~#i~0#1.base, main_~#i~0#1.offset, 4);call write~int(main_#t~mem44#1, main_~user~0#1.base, main_~user~0#1.offset, 4);havoc main_#t~mem44#1;call main_#t~mem45#1 := read~int(main_~#i~0#1.base, main_~#i~0#1.offset, 4);call main_#t~mem46#1 := read~int(main_~#i~0#1.base, main_~#i~0#1.offset, 4); {22527#(and (= |ULTIMATE.start_main_~users~0#1.offset| 0) (= |ULTIMATE.start_main_~users~0#1.base| 0))} is VALID [2022-02-21 03:17:00,516 INFO L290 TraceCheckUtils]: 7: Hoare triple {22527#(and (= |ULTIMATE.start_main_~users~0#1.offset| 0) (= |ULTIMATE.start_main_~users~0#1.base| 0))} assume main_#t~mem45#1 * main_#t~mem46#1 <= 2147483647; {22527#(and (= |ULTIMATE.start_main_~users~0#1.offset| 0) (= |ULTIMATE.start_main_~users~0#1.base| 0))} is VALID [2022-02-21 03:17:00,516 INFO L290 TraceCheckUtils]: 8: Hoare triple {22527#(and (= |ULTIMATE.start_main_~users~0#1.offset| 0) (= |ULTIMATE.start_main_~users~0#1.base| 0))} assume main_#t~mem45#1 * main_#t~mem46#1 >= -2147483648;call write~int(main_#t~mem45#1 * main_#t~mem46#1, main_~user~0#1.base, 4 + main_~user~0#1.offset, 4);havoc main_#t~mem45#1;havoc main_#t~mem46#1; {22527#(and (= |ULTIMATE.start_main_~users~0#1.offset| 0) (= |ULTIMATE.start_main_~users~0#1.base| 0))} is VALID [2022-02-21 03:17:00,517 INFO L290 TraceCheckUtils]: 9: Hoare triple {22527#(and (= |ULTIMATE.start_main_~users~0#1.offset| 0) (= |ULTIMATE.start_main_~users~0#1.base| 0))} havoc main_~_ha_hashv~0#1; {22527#(and (= |ULTIMATE.start_main_~users~0#1.offset| 0) (= |ULTIMATE.start_main_~users~0#1.base| 0))} is VALID [2022-02-21 03:17:00,517 INFO L290 TraceCheckUtils]: 10: Hoare triple {22527#(and (= |ULTIMATE.start_main_~users~0#1.offset| 0) (= |ULTIMATE.start_main_~users~0#1.base| 0))} goto; {22527#(and (= |ULTIMATE.start_main_~users~0#1.offset| 0) (= |ULTIMATE.start_main_~users~0#1.base| 0))} is VALID [2022-02-21 03:17:00,517 INFO L290 TraceCheckUtils]: 11: Hoare triple {22527#(and (= |ULTIMATE.start_main_~users~0#1.offset| 0) (= |ULTIMATE.start_main_~users~0#1.base| 0))} havoc main_~_hj_i~0#1;havoc main_~_hj_j~0#1;havoc main_~_hj_k~0#1;main_~_hj_key~0#1.base, main_~_hj_key~0#1.offset := main_~user~0#1.base, main_~user~0#1.offset;main_~_ha_hashv~0#1 := 4276993775;main_~_hj_j~0#1 := 2654435769;main_~_hj_i~0#1 := main_~_hj_j~0#1;main_~_hj_k~0#1 := 4; {22527#(and (= |ULTIMATE.start_main_~users~0#1.offset| 0) (= |ULTIMATE.start_main_~users~0#1.base| 0))} is VALID [2022-02-21 03:17:00,518 INFO L290 TraceCheckUtils]: 12: Hoare triple {22527#(and (= |ULTIMATE.start_main_~users~0#1.offset| 0) (= |ULTIMATE.start_main_~users~0#1.base| 0))} assume !(main_~_hj_k~0#1 % 4294967296 >= 12); {22527#(and (= |ULTIMATE.start_main_~users~0#1.offset| 0) (= |ULTIMATE.start_main_~users~0#1.base| 0))} is VALID [2022-02-21 03:17:00,518 INFO L290 TraceCheckUtils]: 13: Hoare triple {22527#(and (= |ULTIMATE.start_main_~users~0#1.offset| 0) (= |ULTIMATE.start_main_~users~0#1.base| 0))} main_~_ha_hashv~0#1 := 4 + main_~_ha_hashv~0#1;main_#t~switch59#1 := 11 == main_~_hj_k~0#1; {22527#(and (= |ULTIMATE.start_main_~users~0#1.offset| 0) (= |ULTIMATE.start_main_~users~0#1.base| 0))} is VALID [2022-02-21 03:17:00,523 INFO L290 TraceCheckUtils]: 14: Hoare triple {22527#(and (= |ULTIMATE.start_main_~users~0#1.offset| 0) (= |ULTIMATE.start_main_~users~0#1.base| 0))} assume !main_#t~switch59#1; {22527#(and (= |ULTIMATE.start_main_~users~0#1.offset| 0) (= |ULTIMATE.start_main_~users~0#1.base| 0))} is VALID [2022-02-21 03:17:00,524 INFO L290 TraceCheckUtils]: 15: Hoare triple {22527#(and (= |ULTIMATE.start_main_~users~0#1.offset| 0) (= |ULTIMATE.start_main_~users~0#1.base| 0))} main_#t~switch59#1 := main_#t~switch59#1 || 10 == main_~_hj_k~0#1; {22527#(and (= |ULTIMATE.start_main_~users~0#1.offset| 0) (= |ULTIMATE.start_main_~users~0#1.base| 0))} is VALID [2022-02-21 03:17:00,524 INFO L290 TraceCheckUtils]: 16: Hoare triple {22527#(and (= |ULTIMATE.start_main_~users~0#1.offset| 0) (= |ULTIMATE.start_main_~users~0#1.base| 0))} assume !main_#t~switch59#1; {22527#(and (= |ULTIMATE.start_main_~users~0#1.offset| 0) (= |ULTIMATE.start_main_~users~0#1.base| 0))} is VALID [2022-02-21 03:17:00,525 INFO L290 TraceCheckUtils]: 17: Hoare triple {22527#(and (= |ULTIMATE.start_main_~users~0#1.offset| 0) (= |ULTIMATE.start_main_~users~0#1.base| 0))} main_#t~switch59#1 := main_#t~switch59#1 || 9 == main_~_hj_k~0#1; {22527#(and (= |ULTIMATE.start_main_~users~0#1.offset| 0) (= |ULTIMATE.start_main_~users~0#1.base| 0))} is VALID [2022-02-21 03:17:00,529 INFO L290 TraceCheckUtils]: 18: Hoare triple {22527#(and (= |ULTIMATE.start_main_~users~0#1.offset| 0) (= |ULTIMATE.start_main_~users~0#1.base| 0))} assume !main_#t~switch59#1; {22527#(and (= |ULTIMATE.start_main_~users~0#1.offset| 0) (= |ULTIMATE.start_main_~users~0#1.base| 0))} is VALID [2022-02-21 03:17:00,531 INFO L290 TraceCheckUtils]: 19: Hoare triple {22527#(and (= |ULTIMATE.start_main_~users~0#1.offset| 0) (= |ULTIMATE.start_main_~users~0#1.base| 0))} main_#t~switch59#1 := main_#t~switch59#1 || 8 == main_~_hj_k~0#1; {22527#(and (= |ULTIMATE.start_main_~users~0#1.offset| 0) (= |ULTIMATE.start_main_~users~0#1.base| 0))} is VALID [2022-02-21 03:17:00,531 INFO L290 TraceCheckUtils]: 20: Hoare triple {22527#(and (= |ULTIMATE.start_main_~users~0#1.offset| 0) (= |ULTIMATE.start_main_~users~0#1.base| 0))} assume !main_#t~switch59#1; {22527#(and (= |ULTIMATE.start_main_~users~0#1.offset| 0) (= |ULTIMATE.start_main_~users~0#1.base| 0))} is VALID [2022-02-21 03:17:00,531 INFO L290 TraceCheckUtils]: 21: Hoare triple {22527#(and (= |ULTIMATE.start_main_~users~0#1.offset| 0) (= |ULTIMATE.start_main_~users~0#1.base| 0))} main_#t~switch59#1 := main_#t~switch59#1 || 7 == main_~_hj_k~0#1; {22527#(and (= |ULTIMATE.start_main_~users~0#1.offset| 0) (= |ULTIMATE.start_main_~users~0#1.base| 0))} is VALID [2022-02-21 03:17:00,532 INFO L290 TraceCheckUtils]: 22: Hoare triple {22527#(and (= |ULTIMATE.start_main_~users~0#1.offset| 0) (= |ULTIMATE.start_main_~users~0#1.base| 0))} assume !main_#t~switch59#1; {22527#(and (= |ULTIMATE.start_main_~users~0#1.offset| 0) (= |ULTIMATE.start_main_~users~0#1.base| 0))} is VALID [2022-02-21 03:17:00,532 INFO L290 TraceCheckUtils]: 23: Hoare triple {22527#(and (= |ULTIMATE.start_main_~users~0#1.offset| 0) (= |ULTIMATE.start_main_~users~0#1.base| 0))} main_#t~switch59#1 := main_#t~switch59#1 || 6 == main_~_hj_k~0#1; {22527#(and (= |ULTIMATE.start_main_~users~0#1.offset| 0) (= |ULTIMATE.start_main_~users~0#1.base| 0))} is VALID [2022-02-21 03:17:00,533 INFO L290 TraceCheckUtils]: 24: Hoare triple {22527#(and (= |ULTIMATE.start_main_~users~0#1.offset| 0) (= |ULTIMATE.start_main_~users~0#1.base| 0))} assume !main_#t~switch59#1; {22527#(and (= |ULTIMATE.start_main_~users~0#1.offset| 0) (= |ULTIMATE.start_main_~users~0#1.base| 0))} is VALID [2022-02-21 03:17:00,534 INFO L290 TraceCheckUtils]: 25: Hoare triple {22527#(and (= |ULTIMATE.start_main_~users~0#1.offset| 0) (= |ULTIMATE.start_main_~users~0#1.base| 0))} main_#t~switch59#1 := main_#t~switch59#1 || 5 == main_~_hj_k~0#1; {22527#(and (= |ULTIMATE.start_main_~users~0#1.offset| 0) (= |ULTIMATE.start_main_~users~0#1.base| 0))} is VALID [2022-02-21 03:17:00,534 INFO L290 TraceCheckUtils]: 26: Hoare triple {22527#(and (= |ULTIMATE.start_main_~users~0#1.offset| 0) (= |ULTIMATE.start_main_~users~0#1.base| 0))} assume !main_#t~switch59#1; {22527#(and (= |ULTIMATE.start_main_~users~0#1.offset| 0) (= |ULTIMATE.start_main_~users~0#1.base| 0))} is VALID [2022-02-21 03:17:00,534 INFO L290 TraceCheckUtils]: 27: Hoare triple {22527#(and (= |ULTIMATE.start_main_~users~0#1.offset| 0) (= |ULTIMATE.start_main_~users~0#1.base| 0))} main_#t~switch59#1 := main_#t~switch59#1 || 4 == main_~_hj_k~0#1; {22527#(and (= |ULTIMATE.start_main_~users~0#1.offset| 0) (= |ULTIMATE.start_main_~users~0#1.base| 0))} is VALID [2022-02-21 03:17:00,535 INFO L290 TraceCheckUtils]: 28: Hoare triple {22527#(and (= |ULTIMATE.start_main_~users~0#1.offset| 0) (= |ULTIMATE.start_main_~users~0#1.base| 0))} assume main_#t~switch59#1;call main_#t~mem67#1 := read~int(main_~_hj_key~0#1.base, 3 + main_~_hj_key~0#1.offset, 1);main_~_hj_i~0#1 := main_~_hj_i~0#1 + 16777216 * (main_#t~mem67#1 % 256);havoc main_#t~mem67#1; {22527#(and (= |ULTIMATE.start_main_~users~0#1.offset| 0) (= |ULTIMATE.start_main_~users~0#1.base| 0))} is VALID [2022-02-21 03:17:00,535 INFO L290 TraceCheckUtils]: 29: Hoare triple {22527#(and (= |ULTIMATE.start_main_~users~0#1.offset| 0) (= |ULTIMATE.start_main_~users~0#1.base| 0))} main_#t~switch59#1 := main_#t~switch59#1 || 3 == main_~_hj_k~0#1; {22527#(and (= |ULTIMATE.start_main_~users~0#1.offset| 0) (= |ULTIMATE.start_main_~users~0#1.base| 0))} is VALID [2022-02-21 03:17:00,535 INFO L290 TraceCheckUtils]: 30: Hoare triple {22527#(and (= |ULTIMATE.start_main_~users~0#1.offset| 0) (= |ULTIMATE.start_main_~users~0#1.base| 0))} assume main_#t~switch59#1;call main_#t~mem68#1 := read~int(main_~_hj_key~0#1.base, 2 + main_~_hj_key~0#1.offset, 1);main_~_hj_i~0#1 := main_~_hj_i~0#1 + 65536 * (main_#t~mem68#1 % 256);havoc main_#t~mem68#1; {22527#(and (= |ULTIMATE.start_main_~users~0#1.offset| 0) (= |ULTIMATE.start_main_~users~0#1.base| 0))} is VALID [2022-02-21 03:17:00,536 INFO L290 TraceCheckUtils]: 31: Hoare triple {22527#(and (= |ULTIMATE.start_main_~users~0#1.offset| 0) (= |ULTIMATE.start_main_~users~0#1.base| 0))} main_#t~switch59#1 := main_#t~switch59#1 || 2 == main_~_hj_k~0#1; {22527#(and (= |ULTIMATE.start_main_~users~0#1.offset| 0) (= |ULTIMATE.start_main_~users~0#1.base| 0))} is VALID [2022-02-21 03:17:00,536 INFO L290 TraceCheckUtils]: 32: Hoare triple {22527#(and (= |ULTIMATE.start_main_~users~0#1.offset| 0) (= |ULTIMATE.start_main_~users~0#1.base| 0))} assume main_#t~switch59#1;call main_#t~mem69#1 := read~int(main_~_hj_key~0#1.base, 1 + main_~_hj_key~0#1.offset, 1);main_~_hj_i~0#1 := main_~_hj_i~0#1 + 256 * (main_#t~mem69#1 % 256);havoc main_#t~mem69#1; {22527#(and (= |ULTIMATE.start_main_~users~0#1.offset| 0) (= |ULTIMATE.start_main_~users~0#1.base| 0))} is VALID [2022-02-21 03:17:00,537 INFO L290 TraceCheckUtils]: 33: Hoare triple {22527#(and (= |ULTIMATE.start_main_~users~0#1.offset| 0) (= |ULTIMATE.start_main_~users~0#1.base| 0))} main_#t~switch59#1 := main_#t~switch59#1 || 1 == main_~_hj_k~0#1; {22527#(and (= |ULTIMATE.start_main_~users~0#1.offset| 0) (= |ULTIMATE.start_main_~users~0#1.base| 0))} is VALID [2022-02-21 03:17:00,537 INFO L290 TraceCheckUtils]: 34: Hoare triple {22527#(and (= |ULTIMATE.start_main_~users~0#1.offset| 0) (= |ULTIMATE.start_main_~users~0#1.base| 0))} assume main_#t~switch59#1;call main_#t~mem70#1 := read~int(main_~_hj_key~0#1.base, main_~_hj_key~0#1.offset, 1);main_~_hj_i~0#1 := main_~_hj_i~0#1 + main_#t~mem70#1 % 256;havoc main_#t~mem70#1; {22527#(and (= |ULTIMATE.start_main_~users~0#1.offset| 0) (= |ULTIMATE.start_main_~users~0#1.base| 0))} is VALID [2022-02-21 03:17:00,538 INFO L290 TraceCheckUtils]: 35: Hoare triple {22527#(and (= |ULTIMATE.start_main_~users~0#1.offset| 0) (= |ULTIMATE.start_main_~users~0#1.base| 0))} havoc main_#t~switch59#1; {22527#(and (= |ULTIMATE.start_main_~users~0#1.offset| 0) (= |ULTIMATE.start_main_~users~0#1.base| 0))} is VALID [2022-02-21 03:17:00,540 INFO L290 TraceCheckUtils]: 36: Hoare triple {22527#(and (= |ULTIMATE.start_main_~users~0#1.offset| 0) (= |ULTIMATE.start_main_~users~0#1.base| 0))} main_~_hj_i~0#1 := main_~_hj_i~0#1 - main_~_hj_j~0#1;main_~_hj_i~0#1 := main_~_hj_i~0#1 - main_~_ha_hashv~0#1;main_~_hj_i~0#1 := (if (1 == main_~_hj_i~0#1 || 0 == main_~_hj_i~0#1) && (1 == main_~_ha_hashv~0#1 / 8192 || 0 == main_~_ha_hashv~0#1 / 8192) then (if main_~_hj_i~0#1 == main_~_ha_hashv~0#1 / 8192 then 0 else 1) else (if 0 == main_~_hj_i~0#1 then main_~_ha_hashv~0#1 / 8192 else (if 0 == main_~_ha_hashv~0#1 / 8192 then main_~_hj_i~0#1 else ~bitwiseXOr(main_~_hj_i~0#1, main_~_ha_hashv~0#1 / 8192))));main_~_hj_j~0#1 := main_~_hj_j~0#1 - main_~_ha_hashv~0#1;main_~_hj_j~0#1 := main_~_hj_j~0#1 - main_~_hj_i~0#1;main_~_hj_j~0#1 := (if (1 == main_~_hj_j~0#1 || 0 == main_~_hj_j~0#1) && (1 == 256 * main_~_hj_i~0#1 || 0 == 256 * main_~_hj_i~0#1) then (if main_~_hj_j~0#1 == 256 * main_~_hj_i~0#1 then 0 else 1) else (if 0 == main_~_hj_j~0#1 then 256 * main_~_hj_i~0#1 else (if 0 == 256 * main_~_hj_i~0#1 then main_~_hj_j~0#1 else ~bitwiseXOr(main_~_hj_j~0#1, 256 * main_~_hj_i~0#1))));main_~_ha_hashv~0#1 := main_~_ha_hashv~0#1 - main_~_hj_i~0#1;main_~_ha_hashv~0#1 := main_~_ha_hashv~0#1 - main_~_hj_j~0#1;main_~_ha_hashv~0#1 := (if (1 == main_~_ha_hashv~0#1 || 0 == main_~_ha_hashv~0#1) && (1 == main_~_hj_j~0#1 / 8192 || 0 == main_~_hj_j~0#1 / 8192) then (if main_~_ha_hashv~0#1 == main_~_hj_j~0#1 / 8192 then 0 else 1) else (if 0 == main_~_ha_hashv~0#1 then main_~_hj_j~0#1 / 8192 else (if 0 == main_~_hj_j~0#1 / 8192 then main_~_ha_hashv~0#1 else ~bitwiseXOr(main_~_ha_hashv~0#1, main_~_hj_j~0#1 / 8192))));main_~_hj_i~0#1 := main_~_hj_i~0#1 - main_~_hj_j~0#1;main_~_hj_i~0#1 := main_~_hj_i~0#1 - main_~_ha_hashv~0#1;main_~_hj_i~0#1 := (if (1 == main_~_hj_i~0#1 || 0 == main_~_hj_i~0#1) && (1 == main_~_ha_hashv~0#1 / 4096 || 0 == main_~_ha_hashv~0#1 / 4096) then (if main_~_hj_i~0#1 == main_~_ha_hashv~0#1 / 4096 then 0 else 1) else (if 0 == main_~_hj_i~0#1 then main_~_ha_hashv~0#1 / 4096 else (if 0 == main_~_ha_hashv~0#1 / 4096 then main_~_hj_i~0#1 else ~bitwiseXOr(main_~_hj_i~0#1, main_~_ha_hashv~0#1 / 4096))));main_~_hj_j~0#1 := main_~_hj_j~0#1 - main_~_ha_hashv~0#1;main_~_hj_j~0#1 := main_~_hj_j~0#1 - main_~_hj_i~0#1;main_~_hj_j~0#1 := (if (1 == main_~_hj_j~0#1 || 0 == main_~_hj_j~0#1) && (1 == 65536 * main_~_hj_i~0#1 || 0 == 65536 * main_~_hj_i~0#1) then (if main_~_hj_j~0#1 == 65536 * main_~_hj_i~0#1 then 0 else 1) else (if 0 == main_~_hj_j~0#1 then 65536 * main_~_hj_i~0#1 else (if 0 == 65536 * main_~_hj_i~0#1 then main_~_hj_j~0#1 else ~bitwiseXOr(main_~_hj_j~0#1, 65536 * main_~_hj_i~0#1))));main_~_ha_hashv~0#1 := main_~_ha_hashv~0#1 - main_~_hj_i~0#1;main_~_ha_hashv~0#1 := main_~_ha_hashv~0#1 - main_~_hj_j~0#1;main_~_ha_hashv~0#1 := (if (1 == main_~_ha_hashv~0#1 || 0 == main_~_ha_hashv~0#1) && (1 == main_~_hj_j~0#1 / 32 || 0 == main_~_hj_j~0#1 / 32) then (if main_~_ha_hashv~0#1 == main_~_hj_j~0#1 / 32 then 0 else 1) else (if 0 == main_~_ha_hashv~0#1 then main_~_hj_j~0#1 / 32 else (if 0 == main_~_hj_j~0#1 / 32 then main_~_ha_hashv~0#1 else ~bitwiseXOr(main_~_ha_hashv~0#1, main_~_hj_j~0#1 / 32))));main_~_hj_i~0#1 := main_~_hj_i~0#1 - main_~_hj_j~0#1;main_~_hj_i~0#1 := main_~_hj_i~0#1 - main_~_ha_hashv~0#1;main_~_hj_i~0#1 := (if (1 == main_~_hj_i~0#1 || 0 == main_~_hj_i~0#1) && (1 == main_~_ha_hashv~0#1 / 8 || 0 == main_~_ha_hashv~0#1 / 8) then (if main_~_hj_i~0#1 == main_~_ha_hashv~0#1 / 8 then 0 else 1) else (if 0 == main_~_hj_i~0#1 then main_~_ha_hashv~0#1 / 8 else (if 0 == main_~_ha_hashv~0#1 / 8 then main_~_hj_i~0#1 else ~bitwiseXOr(main_~_hj_i~0#1, main_~_ha_hashv~0#1 / 8))));main_~_hj_j~0#1 := main_~_hj_j~0#1 - main_~_ha_hashv~0#1;main_~_hj_j~0#1 := main_~_hj_j~0#1 - main_~_hj_i~0#1;main_~_hj_j~0#1 := (if (1 == main_~_hj_j~0#1 || 0 == main_~_hj_j~0#1) && (1 == 1024 * main_~_hj_i~0#1 || 0 == 1024 * main_~_hj_i~0#1) then (if main_~_hj_j~0#1 == 1024 * main_~_hj_i~0#1 then 0 else 1) else (if 0 == main_~_hj_j~0#1 then 1024 * main_~_hj_i~0#1 else (if 0 == 1024 * main_~_hj_i~0#1 then main_~_hj_j~0#1 else ~bitwiseXOr(main_~_hj_j~0#1, 1024 * main_~_hj_i~0#1))));main_~_ha_hashv~0#1 := main_~_ha_hashv~0#1 - main_~_hj_i~0#1;main_~_ha_hashv~0#1 := main_~_ha_hashv~0#1 - main_~_hj_j~0#1;main_~_ha_hashv~0#1 := (if (1 == main_~_ha_hashv~0#1 || 0 == main_~_ha_hashv~0#1) && (1 == main_~_hj_j~0#1 / 32768 || 0 == main_~_hj_j~0#1 / 32768) then (if main_~_ha_hashv~0#1 == main_~_hj_j~0#1 / 32768 then 0 else 1) else (if 0 == main_~_ha_hashv~0#1 then main_~_hj_j~0#1 / 32768 else (if 0 == main_~_hj_j~0#1 / 32768 then main_~_ha_hashv~0#1 else ~bitwiseXOr(main_~_ha_hashv~0#1, main_~_hj_j~0#1 / 32768)))); {22527#(and (= |ULTIMATE.start_main_~users~0#1.offset| 0) (= |ULTIMATE.start_main_~users~0#1.base| 0))} is VALID [2022-02-21 03:17:00,540 INFO L290 TraceCheckUtils]: 37: Hoare triple {22527#(and (= |ULTIMATE.start_main_~users~0#1.offset| 0) (= |ULTIMATE.start_main_~users~0#1.base| 0))} goto; {22527#(and (= |ULTIMATE.start_main_~users~0#1.offset| 0) (= |ULTIMATE.start_main_~users~0#1.base| 0))} is VALID [2022-02-21 03:17:00,540 INFO L290 TraceCheckUtils]: 38: Hoare triple {22527#(and (= |ULTIMATE.start_main_~users~0#1.offset| 0) (= |ULTIMATE.start_main_~users~0#1.base| 0))} goto; {22527#(and (= |ULTIMATE.start_main_~users~0#1.offset| 0) (= |ULTIMATE.start_main_~users~0#1.base| 0))} is VALID [2022-02-21 03:17:00,541 INFO L290 TraceCheckUtils]: 39: Hoare triple {22527#(and (= |ULTIMATE.start_main_~users~0#1.offset| 0) (= |ULTIMATE.start_main_~users~0#1.base| 0))} goto; {22527#(and (= |ULTIMATE.start_main_~users~0#1.offset| 0) (= |ULTIMATE.start_main_~users~0#1.base| 0))} is VALID [2022-02-21 03:17:00,544 INFO L290 TraceCheckUtils]: 40: Hoare triple {22527#(and (= |ULTIMATE.start_main_~users~0#1.offset| 0) (= |ULTIMATE.start_main_~users~0#1.base| 0))} call write~int(main_~_ha_hashv~0#1, main_~user~0#1.base, 36 + main_~user~0#1.offset, 4);call write~$Pointer$(main_~user~0#1.base, main_~user~0#1.offset, main_~user~0#1.base, 28 + main_~user~0#1.offset, 4);call write~int(4, main_~user~0#1.base, 32 + main_~user~0#1.offset, 4); {22527#(and (= |ULTIMATE.start_main_~users~0#1.offset| 0) (= |ULTIMATE.start_main_~users~0#1.base| 0))} is VALID [2022-02-21 03:17:00,545 INFO L290 TraceCheckUtils]: 41: Hoare triple {22527#(and (= |ULTIMATE.start_main_~users~0#1.offset| 0) (= |ULTIMATE.start_main_~users~0#1.base| 0))} assume !(main_~users~0#1.base == 0 && main_~users~0#1.offset == 0);call main_#t~mem86#1.base, main_#t~mem86#1.offset := read~$Pointer$(main_~users~0#1.base, 8 + main_~users~0#1.offset, 4);call write~$Pointer$(main_#t~mem86#1.base, main_#t~mem86#1.offset, main_~user~0#1.base, 8 + main_~user~0#1.offset, 4);havoc main_#t~mem86#1.base, main_#t~mem86#1.offset; {22520#false} is VALID [2022-02-21 03:17:00,545 INFO L290 TraceCheckUtils]: 42: Hoare triple {22520#false} call write~$Pointer$(0, 0, main_~user~0#1.base, 16 + main_~user~0#1.offset, 4);call main_#t~mem87#1.base, main_#t~mem87#1.offset := read~$Pointer$(main_~users~0#1.base, 8 + main_~users~0#1.offset, 4);call main_#t~mem88#1.base, main_#t~mem88#1.offset := read~$Pointer$(main_#t~mem87#1.base, 16 + main_#t~mem87#1.offset, 4);call main_#t~mem89#1.base, main_#t~mem89#1.offset := read~$Pointer$(main_~users~0#1.base, 8 + main_~users~0#1.offset, 4);call main_#t~mem90#1 := read~int(main_#t~mem89#1.base, 20 + main_#t~mem89#1.offset, 4);call write~$Pointer$(main_#t~mem88#1.base, main_#t~mem88#1.offset - main_#t~mem90#1, main_~user~0#1.base, 12 + main_~user~0#1.offset, 4);havoc main_#t~mem87#1.base, main_#t~mem87#1.offset;havoc main_#t~mem88#1.base, main_#t~mem88#1.offset;havoc main_#t~mem89#1.base, main_#t~mem89#1.offset;havoc main_#t~mem90#1;call main_#t~mem91#1.base, main_#t~mem91#1.offset := read~$Pointer$(main_~users~0#1.base, 8 + main_~users~0#1.offset, 4);call main_#t~mem92#1.base, main_#t~mem92#1.offset := read~$Pointer$(main_#t~mem91#1.base, 16 + main_#t~mem91#1.offset, 4);call write~$Pointer$(main_~user~0#1.base, main_~user~0#1.offset, main_#t~mem92#1.base, 8 + main_#t~mem92#1.offset, 4);havoc main_#t~mem91#1.base, main_#t~mem91#1.offset;havoc main_#t~mem92#1.base, main_#t~mem92#1.offset;call main_#t~mem93#1.base, main_#t~mem93#1.offset := read~$Pointer$(main_~users~0#1.base, 8 + main_~users~0#1.offset, 4);call write~$Pointer$(main_~user~0#1.base, 8 + main_~user~0#1.offset, main_#t~mem93#1.base, 16 + main_#t~mem93#1.offset, 4);havoc main_#t~mem93#1.base, main_#t~mem93#1.offset; {22520#false} is VALID [2022-02-21 03:17:00,545 INFO L290 TraceCheckUtils]: 43: Hoare triple {22520#false} goto; {22520#false} is VALID [2022-02-21 03:17:00,545 INFO L290 TraceCheckUtils]: 44: Hoare triple {22520#false} havoc main_~_ha_bkt~0#1;call main_#t~mem94#1.base, main_#t~mem94#1.offset := read~$Pointer$(main_~users~0#1.base, 8 + main_~users~0#1.offset, 4);call main_#t~mem95#1 := read~int(main_#t~mem94#1.base, 12 + main_#t~mem94#1.offset, 4);main_#t~post96#1 := main_#t~mem95#1;call write~int(1 + main_#t~post96#1, main_#t~mem94#1.base, 12 + main_#t~mem94#1.offset, 4);havoc main_#t~mem94#1.base, main_#t~mem94#1.offset;havoc main_#t~mem95#1;havoc main_#t~post96#1; {22520#false} is VALID [2022-02-21 03:17:00,545 INFO L290 TraceCheckUtils]: 45: Hoare triple {22520#false} call main_#t~mem97#1.base, main_#t~mem97#1.offset := read~$Pointer$(main_~users~0#1.base, 8 + main_~users~0#1.offset, 4);call main_#t~mem98#1 := read~int(main_#t~mem97#1.base, 4 + main_#t~mem97#1.offset, 4);main_~_ha_bkt~0#1 := (if 0 == main_~_ha_hashv~0#1 || 0 == main_#t~mem98#1 - 1 then 0 else (if 1 == main_#t~mem98#1 - 1 then (if 1 == main_~_ha_hashv~0#1 || 0 == main_~_ha_hashv~0#1 then main_~_ha_hashv~0#1 else (if main_~_ha_hashv~0#1 >= 0 then main_~_ha_hashv~0#1 % 2 else ~bitwiseAnd(main_~_ha_hashv~0#1, main_#t~mem98#1 - 1))) else (if 1 == main_~_ha_hashv~0#1 then (if 1 == main_#t~mem98#1 - 1 || 0 == main_#t~mem98#1 - 1 then main_#t~mem98#1 - 1 else (if main_#t~mem98#1 - 1 >= 0 then (main_#t~mem98#1 - 1) % 2 else ~bitwiseAnd(main_~_ha_hashv~0#1, main_#t~mem98#1 - 1))) else ~bitwiseAnd(main_~_ha_hashv~0#1, main_#t~mem98#1 - 1))));havoc main_#t~mem97#1.base, main_#t~mem97#1.offset;havoc main_#t~mem98#1; {22520#false} is VALID [2022-02-21 03:17:00,546 INFO L290 TraceCheckUtils]: 46: Hoare triple {22520#false} goto; {22520#false} is VALID [2022-02-21 03:17:00,546 INFO L290 TraceCheckUtils]: 47: Hoare triple {22520#false} call main_#t~mem99#1.base, main_#t~mem99#1.offset := read~$Pointer$(main_~users~0#1.base, 8 + main_~users~0#1.offset, 4);call main_#t~mem100#1.base, main_#t~mem100#1.offset := read~$Pointer$(main_#t~mem99#1.base, main_#t~mem99#1.offset, 4);main_~_ha_head~0#1.base, main_~_ha_head~0#1.offset := main_#t~mem100#1.base, main_#t~mem100#1.offset + 12 * (if main_~_ha_bkt~0#1 % 4294967296 % 4294967296 <= 2147483647 then main_~_ha_bkt~0#1 % 4294967296 % 4294967296 else main_~_ha_bkt~0#1 % 4294967296 % 4294967296 - 4294967296);havoc main_#t~mem99#1.base, main_#t~mem99#1.offset;havoc main_#t~mem100#1.base, main_#t~mem100#1.offset;call main_#t~mem101#1 := read~int(main_~_ha_head~0#1.base, 4 + main_~_ha_head~0#1.offset, 4);main_#t~post102#1 := main_#t~mem101#1;call write~int(1 + main_#t~post102#1, main_~_ha_head~0#1.base, 4 + main_~_ha_head~0#1.offset, 4);havoc main_#t~mem101#1;havoc main_#t~post102#1;call main_#t~mem103#1.base, main_#t~mem103#1.offset := read~$Pointer$(main_~_ha_head~0#1.base, main_~_ha_head~0#1.offset, 4);call write~$Pointer$(main_#t~mem103#1.base, main_#t~mem103#1.offset, main_~user~0#1.base, 24 + main_~user~0#1.offset, 4);havoc main_#t~mem103#1.base, main_#t~mem103#1.offset;call write~$Pointer$(0, 0, main_~user~0#1.base, 20 + main_~user~0#1.offset, 4);call main_#t~mem104#1.base, main_#t~mem104#1.offset := read~$Pointer$(main_~_ha_head~0#1.base, main_~_ha_head~0#1.offset, 4); {22520#false} is VALID [2022-02-21 03:17:00,546 INFO L290 TraceCheckUtils]: 48: Hoare triple {22520#false} assume main_#t~mem104#1.base != 0 || main_#t~mem104#1.offset != 0;havoc main_#t~mem104#1.base, main_#t~mem104#1.offset;call main_#t~mem105#1.base, main_#t~mem105#1.offset := read~$Pointer$(main_~_ha_head~0#1.base, main_~_ha_head~0#1.offset, 4);call write~$Pointer$(main_~user~0#1.base, 8 + main_~user~0#1.offset, main_#t~mem105#1.base, 12 + main_#t~mem105#1.offset, 4);havoc main_#t~mem105#1.base, main_#t~mem105#1.offset; {22520#false} is VALID [2022-02-21 03:17:00,546 INFO L290 TraceCheckUtils]: 49: Hoare triple {22520#false} call write~$Pointer$(main_~user~0#1.base, 8 + main_~user~0#1.offset, main_~_ha_head~0#1.base, main_~_ha_head~0#1.offset, 4);call main_#t~mem107#1 := read~int(main_~_ha_head~0#1.base, 4 + main_~_ha_head~0#1.offset, 4);call main_#t~mem106#1 := read~int(main_~_ha_head~0#1.base, 8 + main_~_ha_head~0#1.offset, 4);main_#t~short110#1 := main_#t~mem107#1 % 4294967296 >= 10 * (1 + main_#t~mem106#1) % 4294967296; {22520#false} is VALID [2022-02-21 03:17:00,546 INFO L290 TraceCheckUtils]: 50: Hoare triple {22520#false} assume main_#t~short110#1;call main_#t~mem108#1.base, main_#t~mem108#1.offset := read~$Pointer$(main_~user~0#1.base, 8 + main_~user~0#1.offset, 4);call main_#t~mem109#1 := read~int(main_#t~mem108#1.base, 36 + main_#t~mem108#1.offset, 4);main_#t~short110#1 := 0 == main_#t~mem109#1 % 4294967296; {22520#false} is VALID [2022-02-21 03:17:00,546 INFO L290 TraceCheckUtils]: 51: Hoare triple {22520#false} assume !main_#t~short110#1;havoc main_#t~mem107#1;havoc main_#t~mem106#1;havoc main_#t~mem108#1.base, main_#t~mem108#1.offset;havoc main_#t~mem109#1;havoc main_#t~short110#1; {22520#false} is VALID [2022-02-21 03:17:00,546 INFO L290 TraceCheckUtils]: 52: Hoare triple {22520#false} goto; {22520#false} is VALID [2022-02-21 03:17:00,546 INFO L290 TraceCheckUtils]: 53: Hoare triple {22520#false} goto; {22520#false} is VALID [2022-02-21 03:17:00,546 INFO L290 TraceCheckUtils]: 54: Hoare triple {22520#false} goto; {22520#false} is VALID [2022-02-21 03:17:00,546 INFO L290 TraceCheckUtils]: 55: Hoare triple {22520#false} goto; {22520#false} is VALID [2022-02-21 03:17:00,546 INFO L290 TraceCheckUtils]: 56: Hoare triple {22520#false} call main_#t~mem40#1 := read~int(main_~#i~0#1.base, main_~#i~0#1.offset, 4);main_#t~post41#1 := main_#t~mem40#1; {22520#false} is VALID [2022-02-21 03:17:00,546 INFO L290 TraceCheckUtils]: 57: Hoare triple {22520#false} assume !(1 + main_#t~post41#1 <= 2147483647); {22520#false} is VALID [2022-02-21 03:17:00,547 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-21 03:17:00,547 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-21 03:17:00,547 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 03:17:00,547 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1794785749] [2022-02-21 03:17:00,547 WARN L317 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-02-21 03:17:00,547 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2108640902] [2022-02-21 03:17:00,547 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2108640902] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-21 03:17:00,547 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-21 03:17:00,547 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-21 03:17:00,547 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [15496458] [2022-02-21 03:17:00,547 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-21 03:17:00,548 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 19.333333333333332) internal successors, (58), 3 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 58 [2022-02-21 03:17:00,551 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-21 03:17:00,551 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 19.333333333333332) internal successors, (58), 3 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:17:00,596 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 58 edges. 58 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:17:00,596 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-21 03:17:00,596 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 03:17:00,596 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-21 03:17:00,596 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-21 03:17:00,596 INFO L87 Difference]: Start difference. First operand 727 states and 928 transitions. Second operand has 3 states, 3 states have (on average 19.333333333333332) internal successors, (58), 3 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:17:01,300 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:17:01,300 INFO L93 Difference]: Finished difference Result 1367 states and 1741 transitions. [2022-02-21 03:17:01,300 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-21 03:17:01,300 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 19.333333333333332) internal successors, (58), 3 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 58 [2022-02-21 03:17:01,300 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-21 03:17:01,300 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 19.333333333333332) internal successors, (58), 3 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:17:01,303 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 712 transitions. [2022-02-21 03:17:01,303 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 19.333333333333332) internal successors, (58), 3 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:17:01,306 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 712 transitions. [2022-02-21 03:17:01,306 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 712 transitions. [2022-02-21 03:17:01,874 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 712 edges. 712 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:17:01,889 INFO L225 Difference]: With dead ends: 1367 [2022-02-21 03:17:01,889 INFO L226 Difference]: Without dead ends: 649 [2022-02-21 03:17:01,890 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 56 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-21 03:17:01,891 INFO L933 BasicCegarLoop]: 326 mSDtfsCounter, 103 mSDsluCounter, 249 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 109 SdHoareTripleChecker+Valid, 575 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-21 03:17:01,891 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [109 Valid, 575 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-21 03:17:01,892 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 649 states. [2022-02-21 03:17:01,991 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 649 to 640. [2022-02-21 03:17:01,991 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 03:17:01,992 INFO L82 GeneralOperation]: Start isEquivalent. First operand 649 states. Second operand has 640 states, 598 states have (on average 1.2775919732441472) internal successors, (764), 613 states have internal predecessors, (764), 21 states have call successors, (21), 10 states have call predecessors, (21), 8 states have return successors, (24), 18 states have call predecessors, (24), 21 states have call successors, (24) [2022-02-21 03:17:01,993 INFO L74 IsIncluded]: Start isIncluded. First operand 649 states. Second operand has 640 states, 598 states have (on average 1.2775919732441472) internal successors, (764), 613 states have internal predecessors, (764), 21 states have call successors, (21), 10 states have call predecessors, (21), 8 states have return successors, (24), 18 states have call predecessors, (24), 21 states have call successors, (24) [2022-02-21 03:17:01,994 INFO L87 Difference]: Start difference. First operand 649 states. Second operand has 640 states, 598 states have (on average 1.2775919732441472) internal successors, (764), 613 states have internal predecessors, (764), 21 states have call successors, (21), 10 states have call predecessors, (21), 8 states have return successors, (24), 18 states have call predecessors, (24), 21 states have call successors, (24) [2022-02-21 03:17:02,007 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:17:02,007 INFO L93 Difference]: Finished difference Result 649 states and 819 transitions. [2022-02-21 03:17:02,007 INFO L276 IsEmpty]: Start isEmpty. Operand 649 states and 819 transitions. [2022-02-21 03:17:02,008 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:17:02,008 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:17:02,009 INFO L74 IsIncluded]: Start isIncluded. First operand has 640 states, 598 states have (on average 1.2775919732441472) internal successors, (764), 613 states have internal predecessors, (764), 21 states have call successors, (21), 10 states have call predecessors, (21), 8 states have return successors, (24), 18 states have call predecessors, (24), 21 states have call successors, (24) Second operand 649 states. [2022-02-21 03:17:02,009 INFO L87 Difference]: Start difference. First operand has 640 states, 598 states have (on average 1.2775919732441472) internal successors, (764), 613 states have internal predecessors, (764), 21 states have call successors, (21), 10 states have call predecessors, (21), 8 states have return successors, (24), 18 states have call predecessors, (24), 21 states have call successors, (24) Second operand 649 states. [2022-02-21 03:17:02,025 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:17:02,025 INFO L93 Difference]: Finished difference Result 649 states and 819 transitions. [2022-02-21 03:17:02,025 INFO L276 IsEmpty]: Start isEmpty. Operand 649 states and 819 transitions. [2022-02-21 03:17:02,026 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:17:02,026 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:17:02,026 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 03:17:02,026 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 03:17:02,027 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 640 states, 598 states have (on average 1.2775919732441472) internal successors, (764), 613 states have internal predecessors, (764), 21 states have call successors, (21), 10 states have call predecessors, (21), 8 states have return successors, (24), 18 states have call predecessors, (24), 21 states have call successors, (24) [2022-02-21 03:17:02,040 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 640 states to 640 states and 809 transitions. [2022-02-21 03:17:02,041 INFO L78 Accepts]: Start accepts. Automaton has 640 states and 809 transitions. Word has length 58 [2022-02-21 03:17:02,041 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-21 03:17:02,041 INFO L470 AbstractCegarLoop]: Abstraction has 640 states and 809 transitions. [2022-02-21 03:17:02,041 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 19.333333333333332) internal successors, (58), 3 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:17:02,041 INFO L276 IsEmpty]: Start isEmpty. Operand 640 states and 809 transitions. [2022-02-21 03:17:02,041 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2022-02-21 03:17:02,041 INFO L506 BasicCegarLoop]: Found error trace [2022-02-21 03:17:02,042 INFO L514 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, 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] [2022-02-21 03:17:02,072 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2022-02-21 03:17:02,253 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2022-02-21 03:17:02,253 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting alt_mallocErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [alt_mallocErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, alt_mallocErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, alt_freeErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2022-02-21 03:17:02,253 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:17:02,253 INFO L85 PathProgramCache]: Analyzing trace with hash 804842726, now seen corresponding path program 1 times [2022-02-21 03:17:02,253 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:17:02,254 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1723224699] [2022-02-21 03:17:02,254 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:17:02,254 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:17:02,284 ERROR L252 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-02-21 03:17:02,284 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1709881534] [2022-02-21 03:17:02,284 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:17:02,284 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-21 03:17:02,284 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:17:02,285 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-02-21 03:17:02,286 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2022-02-21 03:17:02,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:17:02,566 INFO L263 TraceCheckSpWp]: Trace formula consists of 498 conjuncts, 9 conjunts are in the unsatisfiable core [2022-02-21 03:17:02,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:17:02,596 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 03:17:02,881 INFO L290 TraceCheckUtils]: 0: Hoare triple {26366#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(21, 2);~#alt_malloc_sizes~0.base, ~#alt_malloc_sizes~0.offset := 3, 0;call #Ultimate.allocInit(40, 3);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#alt_malloc_sizes~0.base);~alt_malloc_balance~0 := 0;~alt_memcmp_count~0 := 0;~alt_bzero_count~0 := 0; {26371#(<= ~alt_malloc_balance~0 0)} is VALID [2022-02-21 03:17:02,881 INFO L290 TraceCheckUtils]: 1: Hoare triple {26371#(<= ~alt_malloc_balance~0 0)} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret43#1.base, main_#t~ret43#1.offset, main_#t~mem44#1, main_#t~mem45#1, main_#t~mem46#1, main_#t~mem48#1, main_#t~mem47#1, main_#t~mem49#1, main_#t~mem50#1, main_#t~mem52#1, main_#t~mem51#1, main_#t~mem53#1, main_#t~mem54#1, main_#t~mem56#1, main_#t~mem55#1, main_#t~mem57#1, main_#t~mem58#1, main_#t~switch59#1, main_#t~mem60#1, main_#t~mem61#1, main_#t~mem62#1, main_#t~mem63#1, main_#t~mem64#1, main_#t~mem65#1, main_#t~mem66#1, main_#t~mem67#1, main_#t~mem68#1, main_#t~mem69#1, main_#t~mem70#1, main_~_hj_i~0#1, main_~_hj_j~0#1, main_~_hj_k~0#1, main_~_hj_key~0#1.base, main_~_hj_key~0#1.offset, main_#t~ret71#1.base, main_#t~ret71#1.offset, main_#t~mem72#1.base, main_#t~mem72#1.offset, main_#t~mem73#1.base, main_#t~mem73#1.offset, main_#t~mem74#1.base, main_#t~mem74#1.offset, main_#t~mem75#1.base, main_#t~mem75#1.offset, main_#t~mem76#1.base, main_#t~mem76#1.offset, main_#t~mem77#1.base, main_#t~mem77#1.offset, main_#t~mem78#1.base, main_#t~mem78#1.offset, main_#t~ret79#1.base, main_#t~ret79#1.offset, main_#t~mem80#1.base, main_#t~mem80#1.offset, main_#t~mem81#1.base, main_#t~mem81#1.offset, main_#t~mem82#1.base, main_#t~mem82#1.offset, main_#t~mem83#1.base, main_#t~mem83#1.offset, main_#t~mem84#1.base, main_#t~mem84#1.offset, main_#t~mem85#1.base, main_#t~mem85#1.offset, main_#t~mem86#1.base, main_#t~mem86#1.offset, main_#t~mem87#1.base, main_#t~mem87#1.offset, main_#t~mem88#1.base, main_#t~mem88#1.offset, main_#t~mem89#1.base, main_#t~mem89#1.offset, main_#t~mem90#1, main_#t~mem91#1.base, main_#t~mem91#1.offset, main_#t~mem92#1.base, main_#t~mem92#1.offset, main_#t~mem93#1.base, main_#t~mem93#1.offset, main_#t~mem94#1.base, main_#t~mem94#1.offset, main_#t~mem95#1, main_#t~post96#1, main_#t~mem97#1.base, main_#t~mem97#1.offset, main_#t~mem98#1, main_#t~mem99#1.base, main_#t~mem99#1.offset, main_#t~mem100#1.base, main_#t~mem100#1.offset, main_#t~mem101#1, main_#t~post102#1, main_#t~mem103#1.base, main_#t~mem103#1.offset, main_#t~mem104#1.base, main_#t~mem104#1.offset, main_#t~mem105#1.base, main_#t~mem105#1.offset, main_#t~mem107#1, main_#t~mem106#1, main_#t~mem108#1.base, main_#t~mem108#1.offset, main_#t~mem109#1, main_#t~short110#1, main_#t~mem111#1.base, main_#t~mem111#1.offset, main_#t~mem112#1, main_#t~ret113#1.base, main_#t~ret113#1.offset, main_#t~mem114#1.base, main_#t~mem114#1.offset, main_#t~mem115#1.base, main_#t~mem115#1.offset, main_#t~mem116#1.base, main_#t~mem116#1.offset, main_#t~mem117#1, main_#t~mem118#1.base, main_#t~mem118#1.offset, main_#t~mem119#1.base, main_#t~mem119#1.offset, main_#t~mem122#1, main_#t~mem120#1.base, main_#t~mem120#1.offset, main_#t~mem121#1, main_#t~mem123#1.base, main_#t~mem123#1.offset, main_#t~mem126#1, main_#t~mem124#1.base, main_#t~mem124#1.offset, main_#t~mem125#1, main_#t~ite127#1, main_#t~mem128#1.base, main_#t~mem128#1.offset, main_#t~mem132#1.base, main_#t~mem132#1.offset, main_#t~mem133#1.base, main_#t~mem133#1.offset, main_#t~mem134#1.base, main_#t~mem134#1.offset, main_#t~mem135#1.base, main_#t~mem135#1.offset, main_#t~mem138#1, main_#t~mem136#1.base, main_#t~mem136#1.offset, main_#t~mem137#1, main_#t~mem139#1.base, main_#t~mem139#1.offset, main_#t~mem140#1, main_#t~pre141#1, main_#t~mem142#1.base, main_#t~mem142#1.offset, main_#t~mem143#1, main_#t~mem144#1.base, main_#t~mem144#1.offset, main_#t~mem145#1, main_#t~post146#1, main_#t~mem150#1, main_#t~mem148#1, main_#t~mem147#1.base, main_#t~mem147#1.offset, main_#t~mem149#1, main_#t~mem151#1, main_#t~post152#1, main_#t~mem153#1.base, main_#t~mem153#1.offset, main_#t~mem154#1.base, main_#t~mem154#1.offset, main_#t~mem155#1.base, main_#t~mem155#1.offset, main_#t~post129#1, main_#t~mem130#1.base, main_#t~mem130#1.offset, main_#t~mem131#1, main_#t~mem156#1.base, main_#t~mem156#1.offset, main_#t~mem157#1.base, main_#t~mem157#1.offset, main_#t~mem158#1.base, main_#t~mem158#1.offset, main_#t~mem159#1, main_#t~mem160#1.base, main_#t~mem160#1.offset, main_#t~mem161#1, main_#t~mem162#1.base, main_#t~mem162#1.offset, main_#t~mem163#1, main_#t~post164#1, main_#t~mem165#1.base, main_#t~mem165#1.offset, main_#t~mem166#1.base, main_#t~mem166#1.offset, main_#t~mem167#1.base, main_#t~mem167#1.offset, main_#t~mem168#1.base, main_#t~mem168#1.offset, main_#t~mem171#1, main_#t~mem169#1.base, main_#t~mem169#1.offset, main_#t~mem170#1, main_#t~ite174#1, main_#t~mem172#1.base, main_#t~mem172#1.offset, main_#t~mem173#1, main_#t~mem175#1.base, main_#t~mem175#1.offset, main_#t~mem176#1, main_#t~mem177#1.base, main_#t~mem177#1.offset, main_~_he_bkt~0#1, main_~_he_bkt_i~0#1, main_~_he_thh~0#1.base, main_~_he_thh~0#1.offset, main_~_he_hh_nxt~0#1.base, main_~_he_hh_nxt~0#1.offset, main_~#_he_new_buckets~0#1.base, main_~#_he_new_buckets~0#1.offset, main_~_he_newbkt~0#1.base, main_~_he_newbkt~0#1.offset, main_~_ha_head~0#1.base, main_~_ha_head~0#1.offset, main_~_ha_bkt~0#1, main_~_ha_hashv~0#1, main_#t~mem40#1, main_#t~post41#1, main_#t~mem42#1, main_#t~mem182#1, main_#t~mem181#1, main_#t~mem183#1, main_#t~mem184#1, main_#t~mem186#1, main_#t~mem185#1, main_#t~mem187#1, main_#t~mem188#1, main_#t~mem190#1, main_#t~mem189#1, main_#t~mem191#1, main_#t~mem192#1, main_#t~switch193#1, main_#t~mem194#1, main_#t~mem195#1, main_#t~mem196#1, main_#t~mem197#1, main_#t~mem198#1, main_#t~mem199#1, main_#t~mem200#1, main_#t~mem201#1, main_#t~mem202#1, main_#t~mem203#1, main_#t~mem204#1, main_~_hj_i~1#1, main_~_hj_j~1#1, main_~_hj_k~1#1, main_~_hj_key~1#1.base, main_~_hj_key~1#1.offset, main_#t~mem205#1.base, main_#t~mem205#1.offset, main_#t~mem206#1, main_#t~mem207#1.base, main_#t~mem207#1.offset, main_#t~mem208#1.base, main_#t~mem208#1.offset, main_#t~mem209#1.base, main_#t~mem209#1.offset, main_#t~mem210#1.base, main_#t~mem210#1.offset, main_#t~mem211#1.base, main_#t~mem211#1.offset, main_#t~mem212#1.base, main_#t~mem212#1.offset, main_#t~mem213#1.base, main_#t~mem213#1.offset, main_#t~mem214#1, main_#t~mem215#1, main_#t~mem216#1, main_#t~short217#1, main_#t~mem218#1.base, main_#t~mem218#1.offset, main_#t~ret219#1, main_#t~mem220#1.base, main_#t~mem220#1.offset, main_#t~mem221#1.base, main_#t~mem221#1.offset, main_#t~mem222#1.base, main_#t~mem222#1.offset, main_#t~mem223#1, main_~_hf_bkt~0#1, main_~_hf_hashv~0#1, main_#t~mem224#1.base, main_#t~mem224#1.offset, main_#t~mem225#1.base, main_#t~mem225#1.offset, main_#t~short226#1, main_#t~mem227#1.base, main_#t~mem227#1.offset, main_#t~mem228#1.base, main_#t~mem228#1.offset, main_#t~mem229#1.base, main_#t~mem229#1.offset, main_#t~mem230#1, main_#t~mem231#1.base, main_#t~mem231#1.offset, main_#t~mem232#1.base, main_#t~mem232#1.offset, main_#t~mem233#1.base, main_#t~mem233#1.offset, main_#t~mem234#1.base, main_#t~mem234#1.offset, main_#t~mem235#1.base, main_#t~mem235#1.offset, main_#t~mem236#1.base, main_#t~mem236#1.offset, main_#t~mem237#1, main_#t~mem238#1.base, main_#t~mem238#1.offset, main_#t~mem239#1.base, main_#t~mem239#1.offset, main_#t~mem240#1.base, main_#t~mem240#1.offset, main_#t~mem241#1, main_#t~mem242#1.base, main_#t~mem242#1.offset, main_#t~mem243#1.base, main_#t~mem243#1.offset, main_#t~mem244#1.base, main_#t~mem244#1.offset, main_#t~mem245#1.base, main_#t~mem245#1.offset, main_#t~mem246#1.base, main_#t~mem246#1.offset, main_#t~mem247#1, main_#t~mem248#1.base, main_#t~mem248#1.offset, main_#t~mem251#1, main_#t~mem249#1.base, main_#t~mem249#1.offset, main_#t~mem250#1, main_#t~mem252#1.base, main_#t~mem252#1.offset, main_#t~mem253#1.base, main_#t~mem253#1.offset, main_#t~mem254#1, main_#t~post255#1, main_#t~mem256#1.base, main_#t~mem256#1.offset, main_#t~mem257#1.base, main_#t~mem257#1.offset, main_#t~mem258#1.base, main_#t~mem258#1.offset, main_#t~mem259#1.base, main_#t~mem259#1.offset, main_#t~mem260#1.base, main_#t~mem260#1.offset, main_#t~mem261#1.base, main_#t~mem261#1.offset, main_#t~mem262#1.base, main_#t~mem262#1.offset, main_#t~mem263#1.base, main_#t~mem263#1.offset, main_~_hd_head~0#1.base, main_~_hd_head~0#1.offset, main_#t~mem264#1.base, main_#t~mem264#1.offset, main_#t~mem265#1, main_#t~post266#1, main_~_hd_bkt~0#1, main_~_hd_hh_del~0#1.base, main_~_hd_hh_del~0#1.offset, main_#t~mem178#1, main_#t~post179#1, main_#t~mem180#1, main_#t~mem267#1.base, main_#t~mem267#1.offset, main_~#i~0#1.base, main_~#i~0#1.offset, main_~user~0#1.base, main_~user~0#1.offset, main_~tmp~0#1.base, main_~tmp~0#1.offset, main_~users~0#1.base, main_~users~0#1.offset;call main_~#i~0#1.base, main_~#i~0#1.offset := #Ultimate.allocOnStack(4);havoc main_~user~0#1.base, main_~user~0#1.offset;havoc main_~tmp~0#1.base, main_~tmp~0#1.offset;main_~users~0#1.base, main_~users~0#1.offset := 0, 0;call write~int(0, main_~#i~0#1.base, main_~#i~0#1.offset, 4); {26371#(<= ~alt_malloc_balance~0 0)} is VALID [2022-02-21 03:17:02,882 INFO L290 TraceCheckUtils]: 2: Hoare triple {26371#(<= ~alt_malloc_balance~0 0)} call main_#t~mem42#1 := read~int(main_~#i~0#1.base, main_~#i~0#1.offset, 4); {26371#(<= ~alt_malloc_balance~0 0)} is VALID [2022-02-21 03:17:02,882 INFO L290 TraceCheckUtils]: 3: Hoare triple {26371#(<= ~alt_malloc_balance~0 0)} assume !!(main_#t~mem42#1 < 10);havoc main_#t~mem42#1;assume { :begin_inline_real_malloc } true;real_malloc_#in~n#1 := 40;havoc real_malloc_#res#1.base, real_malloc_#res#1.offset;havoc real_malloc_#t~malloc39#1.base, real_malloc_#t~malloc39#1.offset, real_malloc_~n#1;real_malloc_~n#1 := real_malloc_#in~n#1;call real_malloc_#t~malloc39#1.base, real_malloc_#t~malloc39#1.offset := #Ultimate.allocOnHeap(real_malloc_~n#1);real_malloc_#res#1.base, real_malloc_#res#1.offset := real_malloc_#t~malloc39#1.base, real_malloc_#t~malloc39#1.offset;havoc real_malloc_#t~malloc39#1.base, real_malloc_#t~malloc39#1.offset; {26371#(<= ~alt_malloc_balance~0 0)} is VALID [2022-02-21 03:17:02,882 INFO L290 TraceCheckUtils]: 4: Hoare triple {26371#(<= ~alt_malloc_balance~0 0)} main_#t~ret43#1.base, main_#t~ret43#1.offset := real_malloc_#res#1.base, real_malloc_#res#1.offset;assume { :end_inline_real_malloc } true;main_~user~0#1.base, main_~user~0#1.offset := main_#t~ret43#1.base, main_#t~ret43#1.offset;havoc main_#t~ret43#1.base, main_#t~ret43#1.offset; {26371#(<= ~alt_malloc_balance~0 0)} is VALID [2022-02-21 03:17:02,883 INFO L290 TraceCheckUtils]: 5: Hoare triple {26371#(<= ~alt_malloc_balance~0 0)} assume !(main_~user~0#1.base == 0 && main_~user~0#1.offset == 0); {26371#(<= ~alt_malloc_balance~0 0)} is VALID [2022-02-21 03:17:02,883 INFO L290 TraceCheckUtils]: 6: Hoare triple {26371#(<= ~alt_malloc_balance~0 0)} call main_#t~mem44#1 := read~int(main_~#i~0#1.base, main_~#i~0#1.offset, 4);call write~int(main_#t~mem44#1, main_~user~0#1.base, main_~user~0#1.offset, 4);havoc main_#t~mem44#1;call main_#t~mem45#1 := read~int(main_~#i~0#1.base, main_~#i~0#1.offset, 4);call main_#t~mem46#1 := read~int(main_~#i~0#1.base, main_~#i~0#1.offset, 4); {26371#(<= ~alt_malloc_balance~0 0)} is VALID [2022-02-21 03:17:02,883 INFO L290 TraceCheckUtils]: 7: Hoare triple {26371#(<= ~alt_malloc_balance~0 0)} assume main_#t~mem45#1 * main_#t~mem46#1 <= 2147483647; {26371#(<= ~alt_malloc_balance~0 0)} is VALID [2022-02-21 03:17:02,883 INFO L290 TraceCheckUtils]: 8: Hoare triple {26371#(<= ~alt_malloc_balance~0 0)} assume main_#t~mem45#1 * main_#t~mem46#1 >= -2147483648;call write~int(main_#t~mem45#1 * main_#t~mem46#1, main_~user~0#1.base, 4 + main_~user~0#1.offset, 4);havoc main_#t~mem45#1;havoc main_#t~mem46#1; {26371#(<= ~alt_malloc_balance~0 0)} is VALID [2022-02-21 03:17:02,884 INFO L290 TraceCheckUtils]: 9: Hoare triple {26371#(<= ~alt_malloc_balance~0 0)} havoc main_~_ha_hashv~0#1; {26371#(<= ~alt_malloc_balance~0 0)} is VALID [2022-02-21 03:17:02,884 INFO L290 TraceCheckUtils]: 10: Hoare triple {26371#(<= ~alt_malloc_balance~0 0)} goto; {26371#(<= ~alt_malloc_balance~0 0)} is VALID [2022-02-21 03:17:02,884 INFO L290 TraceCheckUtils]: 11: Hoare triple {26371#(<= ~alt_malloc_balance~0 0)} havoc main_~_hj_i~0#1;havoc main_~_hj_j~0#1;havoc main_~_hj_k~0#1;main_~_hj_key~0#1.base, main_~_hj_key~0#1.offset := main_~user~0#1.base, main_~user~0#1.offset;main_~_ha_hashv~0#1 := 4276993775;main_~_hj_j~0#1 := 2654435769;main_~_hj_i~0#1 := main_~_hj_j~0#1;main_~_hj_k~0#1 := 4; {26371#(<= ~alt_malloc_balance~0 0)} is VALID [2022-02-21 03:17:02,885 INFO L290 TraceCheckUtils]: 12: Hoare triple {26371#(<= ~alt_malloc_balance~0 0)} assume !(main_~_hj_k~0#1 % 4294967296 >= 12); {26371#(<= ~alt_malloc_balance~0 0)} is VALID [2022-02-21 03:17:02,885 INFO L290 TraceCheckUtils]: 13: Hoare triple {26371#(<= ~alt_malloc_balance~0 0)} main_~_ha_hashv~0#1 := 4 + main_~_ha_hashv~0#1;main_#t~switch59#1 := 11 == main_~_hj_k~0#1; {26371#(<= ~alt_malloc_balance~0 0)} is VALID [2022-02-21 03:17:02,885 INFO L290 TraceCheckUtils]: 14: Hoare triple {26371#(<= ~alt_malloc_balance~0 0)} assume !main_#t~switch59#1; {26371#(<= ~alt_malloc_balance~0 0)} is VALID [2022-02-21 03:17:02,886 INFO L290 TraceCheckUtils]: 15: Hoare triple {26371#(<= ~alt_malloc_balance~0 0)} main_#t~switch59#1 := main_#t~switch59#1 || 10 == main_~_hj_k~0#1; {26371#(<= ~alt_malloc_balance~0 0)} is VALID [2022-02-21 03:17:02,886 INFO L290 TraceCheckUtils]: 16: Hoare triple {26371#(<= ~alt_malloc_balance~0 0)} assume !main_#t~switch59#1; {26371#(<= ~alt_malloc_balance~0 0)} is VALID [2022-02-21 03:17:02,886 INFO L290 TraceCheckUtils]: 17: Hoare triple {26371#(<= ~alt_malloc_balance~0 0)} main_#t~switch59#1 := main_#t~switch59#1 || 9 == main_~_hj_k~0#1; {26371#(<= ~alt_malloc_balance~0 0)} is VALID [2022-02-21 03:17:02,887 INFO L290 TraceCheckUtils]: 18: Hoare triple {26371#(<= ~alt_malloc_balance~0 0)} assume !main_#t~switch59#1; {26371#(<= ~alt_malloc_balance~0 0)} is VALID [2022-02-21 03:17:02,887 INFO L290 TraceCheckUtils]: 19: Hoare triple {26371#(<= ~alt_malloc_balance~0 0)} main_#t~switch59#1 := main_#t~switch59#1 || 8 == main_~_hj_k~0#1; {26371#(<= ~alt_malloc_balance~0 0)} is VALID [2022-02-21 03:17:02,887 INFO L290 TraceCheckUtils]: 20: Hoare triple {26371#(<= ~alt_malloc_balance~0 0)} assume !main_#t~switch59#1; {26371#(<= ~alt_malloc_balance~0 0)} is VALID [2022-02-21 03:17:02,887 INFO L290 TraceCheckUtils]: 21: Hoare triple {26371#(<= ~alt_malloc_balance~0 0)} main_#t~switch59#1 := main_#t~switch59#1 || 7 == main_~_hj_k~0#1; {26371#(<= ~alt_malloc_balance~0 0)} is VALID [2022-02-21 03:17:02,888 INFO L290 TraceCheckUtils]: 22: Hoare triple {26371#(<= ~alt_malloc_balance~0 0)} assume !main_#t~switch59#1; {26371#(<= ~alt_malloc_balance~0 0)} is VALID [2022-02-21 03:17:02,888 INFO L290 TraceCheckUtils]: 23: Hoare triple {26371#(<= ~alt_malloc_balance~0 0)} main_#t~switch59#1 := main_#t~switch59#1 || 6 == main_~_hj_k~0#1; {26371#(<= ~alt_malloc_balance~0 0)} is VALID [2022-02-21 03:17:02,888 INFO L290 TraceCheckUtils]: 24: Hoare triple {26371#(<= ~alt_malloc_balance~0 0)} assume !main_#t~switch59#1; {26371#(<= ~alt_malloc_balance~0 0)} is VALID [2022-02-21 03:17:02,888 INFO L290 TraceCheckUtils]: 25: Hoare triple {26371#(<= ~alt_malloc_balance~0 0)} main_#t~switch59#1 := main_#t~switch59#1 || 5 == main_~_hj_k~0#1; {26371#(<= ~alt_malloc_balance~0 0)} is VALID [2022-02-21 03:17:02,889 INFO L290 TraceCheckUtils]: 26: Hoare triple {26371#(<= ~alt_malloc_balance~0 0)} assume !main_#t~switch59#1; {26371#(<= ~alt_malloc_balance~0 0)} is VALID [2022-02-21 03:17:02,889 INFO L290 TraceCheckUtils]: 27: Hoare triple {26371#(<= ~alt_malloc_balance~0 0)} main_#t~switch59#1 := main_#t~switch59#1 || 4 == main_~_hj_k~0#1; {26371#(<= ~alt_malloc_balance~0 0)} is VALID [2022-02-21 03:17:02,889 INFO L290 TraceCheckUtils]: 28: Hoare triple {26371#(<= ~alt_malloc_balance~0 0)} assume main_#t~switch59#1;call main_#t~mem67#1 := read~int(main_~_hj_key~0#1.base, 3 + main_~_hj_key~0#1.offset, 1);main_~_hj_i~0#1 := main_~_hj_i~0#1 + 16777216 * (main_#t~mem67#1 % 256);havoc main_#t~mem67#1; {26371#(<= ~alt_malloc_balance~0 0)} is VALID [2022-02-21 03:17:02,889 INFO L290 TraceCheckUtils]: 29: Hoare triple {26371#(<= ~alt_malloc_balance~0 0)} main_#t~switch59#1 := main_#t~switch59#1 || 3 == main_~_hj_k~0#1; {26371#(<= ~alt_malloc_balance~0 0)} is VALID [2022-02-21 03:17:02,890 INFO L290 TraceCheckUtils]: 30: Hoare triple {26371#(<= ~alt_malloc_balance~0 0)} assume main_#t~switch59#1;call main_#t~mem68#1 := read~int(main_~_hj_key~0#1.base, 2 + main_~_hj_key~0#1.offset, 1);main_~_hj_i~0#1 := main_~_hj_i~0#1 + 65536 * (main_#t~mem68#1 % 256);havoc main_#t~mem68#1; {26371#(<= ~alt_malloc_balance~0 0)} is VALID [2022-02-21 03:17:02,890 INFO L290 TraceCheckUtils]: 31: Hoare triple {26371#(<= ~alt_malloc_balance~0 0)} main_#t~switch59#1 := main_#t~switch59#1 || 2 == main_~_hj_k~0#1; {26371#(<= ~alt_malloc_balance~0 0)} is VALID [2022-02-21 03:17:02,890 INFO L290 TraceCheckUtils]: 32: Hoare triple {26371#(<= ~alt_malloc_balance~0 0)} assume main_#t~switch59#1;call main_#t~mem69#1 := read~int(main_~_hj_key~0#1.base, 1 + main_~_hj_key~0#1.offset, 1);main_~_hj_i~0#1 := main_~_hj_i~0#1 + 256 * (main_#t~mem69#1 % 256);havoc main_#t~mem69#1; {26371#(<= ~alt_malloc_balance~0 0)} is VALID [2022-02-21 03:17:02,891 INFO L290 TraceCheckUtils]: 33: Hoare triple {26371#(<= ~alt_malloc_balance~0 0)} main_#t~switch59#1 := main_#t~switch59#1 || 1 == main_~_hj_k~0#1; {26371#(<= ~alt_malloc_balance~0 0)} is VALID [2022-02-21 03:17:02,891 INFO L290 TraceCheckUtils]: 34: Hoare triple {26371#(<= ~alt_malloc_balance~0 0)} assume main_#t~switch59#1;call main_#t~mem70#1 := read~int(main_~_hj_key~0#1.base, main_~_hj_key~0#1.offset, 1);main_~_hj_i~0#1 := main_~_hj_i~0#1 + main_#t~mem70#1 % 256;havoc main_#t~mem70#1; {26371#(<= ~alt_malloc_balance~0 0)} is VALID [2022-02-21 03:17:02,891 INFO L290 TraceCheckUtils]: 35: Hoare triple {26371#(<= ~alt_malloc_balance~0 0)} havoc main_#t~switch59#1; {26371#(<= ~alt_malloc_balance~0 0)} is VALID [2022-02-21 03:17:02,891 INFO L290 TraceCheckUtils]: 36: Hoare triple {26371#(<= ~alt_malloc_balance~0 0)} main_~_hj_i~0#1 := main_~_hj_i~0#1 - main_~_hj_j~0#1;main_~_hj_i~0#1 := main_~_hj_i~0#1 - main_~_ha_hashv~0#1;main_~_hj_i~0#1 := (if (1 == main_~_hj_i~0#1 || 0 == main_~_hj_i~0#1) && (1 == main_~_ha_hashv~0#1 / 8192 || 0 == main_~_ha_hashv~0#1 / 8192) then (if main_~_hj_i~0#1 == main_~_ha_hashv~0#1 / 8192 then 0 else 1) else (if 0 == main_~_hj_i~0#1 then main_~_ha_hashv~0#1 / 8192 else (if 0 == main_~_ha_hashv~0#1 / 8192 then main_~_hj_i~0#1 else ~bitwiseXOr(main_~_hj_i~0#1, main_~_ha_hashv~0#1 / 8192))));main_~_hj_j~0#1 := main_~_hj_j~0#1 - main_~_ha_hashv~0#1;main_~_hj_j~0#1 := main_~_hj_j~0#1 - main_~_hj_i~0#1;main_~_hj_j~0#1 := (if (1 == main_~_hj_j~0#1 || 0 == main_~_hj_j~0#1) && (1 == 256 * main_~_hj_i~0#1 || 0 == 256 * main_~_hj_i~0#1) then (if main_~_hj_j~0#1 == 256 * main_~_hj_i~0#1 then 0 else 1) else (if 0 == main_~_hj_j~0#1 then 256 * main_~_hj_i~0#1 else (if 0 == 256 * main_~_hj_i~0#1 then main_~_hj_j~0#1 else ~bitwiseXOr(main_~_hj_j~0#1, 256 * main_~_hj_i~0#1))));main_~_ha_hashv~0#1 := main_~_ha_hashv~0#1 - main_~_hj_i~0#1;main_~_ha_hashv~0#1 := main_~_ha_hashv~0#1 - main_~_hj_j~0#1;main_~_ha_hashv~0#1 := (if (1 == main_~_ha_hashv~0#1 || 0 == main_~_ha_hashv~0#1) && (1 == main_~_hj_j~0#1 / 8192 || 0 == main_~_hj_j~0#1 / 8192) then (if main_~_ha_hashv~0#1 == main_~_hj_j~0#1 / 8192 then 0 else 1) else (if 0 == main_~_ha_hashv~0#1 then main_~_hj_j~0#1 / 8192 else (if 0 == main_~_hj_j~0#1 / 8192 then main_~_ha_hashv~0#1 else ~bitwiseXOr(main_~_ha_hashv~0#1, main_~_hj_j~0#1 / 8192))));main_~_hj_i~0#1 := main_~_hj_i~0#1 - main_~_hj_j~0#1;main_~_hj_i~0#1 := main_~_hj_i~0#1 - main_~_ha_hashv~0#1;main_~_hj_i~0#1 := (if (1 == main_~_hj_i~0#1 || 0 == main_~_hj_i~0#1) && (1 == main_~_ha_hashv~0#1 / 4096 || 0 == main_~_ha_hashv~0#1 / 4096) then (if main_~_hj_i~0#1 == main_~_ha_hashv~0#1 / 4096 then 0 else 1) else (if 0 == main_~_hj_i~0#1 then main_~_ha_hashv~0#1 / 4096 else (if 0 == main_~_ha_hashv~0#1 / 4096 then main_~_hj_i~0#1 else ~bitwiseXOr(main_~_hj_i~0#1, main_~_ha_hashv~0#1 / 4096))));main_~_hj_j~0#1 := main_~_hj_j~0#1 - main_~_ha_hashv~0#1;main_~_hj_j~0#1 := main_~_hj_j~0#1 - main_~_hj_i~0#1;main_~_hj_j~0#1 := (if (1 == main_~_hj_j~0#1 || 0 == main_~_hj_j~0#1) && (1 == 65536 * main_~_hj_i~0#1 || 0 == 65536 * main_~_hj_i~0#1) then (if main_~_hj_j~0#1 == 65536 * main_~_hj_i~0#1 then 0 else 1) else (if 0 == main_~_hj_j~0#1 then 65536 * main_~_hj_i~0#1 else (if 0 == 65536 * main_~_hj_i~0#1 then main_~_hj_j~0#1 else ~bitwiseXOr(main_~_hj_j~0#1, 65536 * main_~_hj_i~0#1))));main_~_ha_hashv~0#1 := main_~_ha_hashv~0#1 - main_~_hj_i~0#1;main_~_ha_hashv~0#1 := main_~_ha_hashv~0#1 - main_~_hj_j~0#1;main_~_ha_hashv~0#1 := (if (1 == main_~_ha_hashv~0#1 || 0 == main_~_ha_hashv~0#1) && (1 == main_~_hj_j~0#1 / 32 || 0 == main_~_hj_j~0#1 / 32) then (if main_~_ha_hashv~0#1 == main_~_hj_j~0#1 / 32 then 0 else 1) else (if 0 == main_~_ha_hashv~0#1 then main_~_hj_j~0#1 / 32 else (if 0 == main_~_hj_j~0#1 / 32 then main_~_ha_hashv~0#1 else ~bitwiseXOr(main_~_ha_hashv~0#1, main_~_hj_j~0#1 / 32))));main_~_hj_i~0#1 := main_~_hj_i~0#1 - main_~_hj_j~0#1;main_~_hj_i~0#1 := main_~_hj_i~0#1 - main_~_ha_hashv~0#1;main_~_hj_i~0#1 := (if (1 == main_~_hj_i~0#1 || 0 == main_~_hj_i~0#1) && (1 == main_~_ha_hashv~0#1 / 8 || 0 == main_~_ha_hashv~0#1 / 8) then (if main_~_hj_i~0#1 == main_~_ha_hashv~0#1 / 8 then 0 else 1) else (if 0 == main_~_hj_i~0#1 then main_~_ha_hashv~0#1 / 8 else (if 0 == main_~_ha_hashv~0#1 / 8 then main_~_hj_i~0#1 else ~bitwiseXOr(main_~_hj_i~0#1, main_~_ha_hashv~0#1 / 8))));main_~_hj_j~0#1 := main_~_hj_j~0#1 - main_~_ha_hashv~0#1;main_~_hj_j~0#1 := main_~_hj_j~0#1 - main_~_hj_i~0#1;main_~_hj_j~0#1 := (if (1 == main_~_hj_j~0#1 || 0 == main_~_hj_j~0#1) && (1 == 1024 * main_~_hj_i~0#1 || 0 == 1024 * main_~_hj_i~0#1) then (if main_~_hj_j~0#1 == 1024 * main_~_hj_i~0#1 then 0 else 1) else (if 0 == main_~_hj_j~0#1 then 1024 * main_~_hj_i~0#1 else (if 0 == 1024 * main_~_hj_i~0#1 then main_~_hj_j~0#1 else ~bitwiseXOr(main_~_hj_j~0#1, 1024 * main_~_hj_i~0#1))));main_~_ha_hashv~0#1 := main_~_ha_hashv~0#1 - main_~_hj_i~0#1;main_~_ha_hashv~0#1 := main_~_ha_hashv~0#1 - main_~_hj_j~0#1;main_~_ha_hashv~0#1 := (if (1 == main_~_ha_hashv~0#1 || 0 == main_~_ha_hashv~0#1) && (1 == main_~_hj_j~0#1 / 32768 || 0 == main_~_hj_j~0#1 / 32768) then (if main_~_ha_hashv~0#1 == main_~_hj_j~0#1 / 32768 then 0 else 1) else (if 0 == main_~_ha_hashv~0#1 then main_~_hj_j~0#1 / 32768 else (if 0 == main_~_hj_j~0#1 / 32768 then main_~_ha_hashv~0#1 else ~bitwiseXOr(main_~_ha_hashv~0#1, main_~_hj_j~0#1 / 32768)))); {26371#(<= ~alt_malloc_balance~0 0)} is VALID [2022-02-21 03:17:02,892 INFO L290 TraceCheckUtils]: 37: Hoare triple {26371#(<= ~alt_malloc_balance~0 0)} goto; {26371#(<= ~alt_malloc_balance~0 0)} is VALID [2022-02-21 03:17:02,892 INFO L290 TraceCheckUtils]: 38: Hoare triple {26371#(<= ~alt_malloc_balance~0 0)} goto; {26371#(<= ~alt_malloc_balance~0 0)} is VALID [2022-02-21 03:17:02,892 INFO L290 TraceCheckUtils]: 39: Hoare triple {26371#(<= ~alt_malloc_balance~0 0)} goto; {26371#(<= ~alt_malloc_balance~0 0)} is VALID [2022-02-21 03:17:02,893 INFO L290 TraceCheckUtils]: 40: Hoare triple {26371#(<= ~alt_malloc_balance~0 0)} call write~int(main_~_ha_hashv~0#1, main_~user~0#1.base, 36 + main_~user~0#1.offset, 4);call write~$Pointer$(main_~user~0#1.base, main_~user~0#1.offset, main_~user~0#1.base, 28 + main_~user~0#1.offset, 4);call write~int(4, main_~user~0#1.base, 32 + main_~user~0#1.offset, 4); {26371#(<= ~alt_malloc_balance~0 0)} is VALID [2022-02-21 03:17:02,893 INFO L290 TraceCheckUtils]: 41: Hoare triple {26371#(<= ~alt_malloc_balance~0 0)} assume main_~users~0#1.base == 0 && main_~users~0#1.offset == 0;call write~$Pointer$(0, 0, main_~user~0#1.base, 16 + main_~user~0#1.offset, 4);call write~$Pointer$(0, 0, main_~user~0#1.base, 12 + main_~user~0#1.offset, 4); {26371#(<= ~alt_malloc_balance~0 0)} is VALID [2022-02-21 03:17:02,893 INFO L272 TraceCheckUtils]: 42: Hoare triple {26371#(<= ~alt_malloc_balance~0 0)} call main_#t~ret71#1.base, main_#t~ret71#1.offset := alt_malloc(44); {26498#(<= ~alt_malloc_balance~0 |old(~alt_malloc_balance~0)|)} is VALID [2022-02-21 03:17:02,894 INFO L290 TraceCheckUtils]: 43: Hoare triple {26498#(<= ~alt_malloc_balance~0 |old(~alt_malloc_balance~0)|)} ~sz := #in~sz;#t~post31 := ~alt_malloc_balance~0; {26502#(<= |alt_malloc_#t~post31| |old(~alt_malloc_balance~0)|)} is VALID [2022-02-21 03:17:02,899 INFO L290 TraceCheckUtils]: 44: Hoare triple {26502#(<= |alt_malloc_#t~post31| |old(~alt_malloc_balance~0)|)} assume 1 + #t~post31 <= 2147483647; {26502#(<= |alt_malloc_#t~post31| |old(~alt_malloc_balance~0)|)} is VALID [2022-02-21 03:17:02,900 INFO L290 TraceCheckUtils]: 45: Hoare triple {26502#(<= |alt_malloc_#t~post31| |old(~alt_malloc_balance~0)|)} assume 1 + #t~post31 >= -2147483648;~alt_malloc_balance~0 := 1 + #t~post31;call write~int(~sz, ~#alt_malloc_sizes~0.base, ~#alt_malloc_sizes~0.offset + 4 * #t~post31, 4);havoc #t~post31; {26509#(<= ~alt_malloc_balance~0 (+ |old(~alt_malloc_balance~0)| 1))} is VALID [2022-02-21 03:17:02,900 INFO L290 TraceCheckUtils]: 46: Hoare triple {26509#(<= ~alt_malloc_balance~0 (+ |old(~alt_malloc_balance~0)| 1))} assume !(1 == ~alt_malloc_balance~0); {26509#(<= ~alt_malloc_balance~0 (+ |old(~alt_malloc_balance~0)| 1))} is VALID [2022-02-21 03:17:02,900 INFO L290 TraceCheckUtils]: 47: Hoare triple {26509#(<= ~alt_malloc_balance~0 (+ |old(~alt_malloc_balance~0)| 1))} call #t~malloc32.base, #t~malloc32.offset := #Ultimate.allocOnHeap(~sz);#res.base, #res.offset := #t~malloc32.base, #t~malloc32.offset;havoc #t~malloc32.base, #t~malloc32.offset; {26509#(<= ~alt_malloc_balance~0 (+ |old(~alt_malloc_balance~0)| 1))} is VALID [2022-02-21 03:17:02,901 INFO L290 TraceCheckUtils]: 48: Hoare triple {26509#(<= ~alt_malloc_balance~0 (+ |old(~alt_malloc_balance~0)| 1))} assume true; {26509#(<= ~alt_malloc_balance~0 (+ |old(~alt_malloc_balance~0)| 1))} is VALID [2022-02-21 03:17:02,901 INFO L284 TraceCheckUtils]: 49: Hoare quadruple {26509#(<= ~alt_malloc_balance~0 (+ |old(~alt_malloc_balance~0)| 1))} {26371#(<= ~alt_malloc_balance~0 0)} #855#return; {26522#(<= ~alt_malloc_balance~0 1)} is VALID [2022-02-21 03:17:02,902 INFO L290 TraceCheckUtils]: 50: Hoare triple {26522#(<= ~alt_malloc_balance~0 1)} call write~$Pointer$(main_#t~ret71#1.base, main_#t~ret71#1.offset, main_~user~0#1.base, 8 + main_~user~0#1.offset, 4);havoc main_#t~ret71#1.base, main_#t~ret71#1.offset;call main_#t~mem72#1.base, main_#t~mem72#1.offset := read~$Pointer$(main_~user~0#1.base, 8 + main_~user~0#1.offset, 4); {26522#(<= ~alt_malloc_balance~0 1)} is VALID [2022-02-21 03:17:02,902 INFO L290 TraceCheckUtils]: 51: Hoare triple {26522#(<= ~alt_malloc_balance~0 1)} assume !(main_#t~mem72#1.base == 0 && main_#t~mem72#1.offset == 0);havoc main_#t~mem72#1.base, main_#t~mem72#1.offset;call main_#t~mem73#1.base, main_#t~mem73#1.offset := read~$Pointer$(main_~user~0#1.base, 8 + main_~user~0#1.offset, 4); {26522#(<= ~alt_malloc_balance~0 1)} is VALID [2022-02-21 03:17:02,903 INFO L272 TraceCheckUtils]: 52: Hoare triple {26522#(<= ~alt_malloc_balance~0 1)} call alt_bzero(main_#t~mem73#1.base, main_#t~mem73#1.offset, 44); {26522#(<= ~alt_malloc_balance~0 1)} is VALID [2022-02-21 03:17:02,903 INFO L290 TraceCheckUtils]: 53: Hoare triple {26522#(<= ~alt_malloc_balance~0 1)} ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; {26522#(<= ~alt_malloc_balance~0 1)} is VALID [2022-02-21 03:17:02,903 INFO L290 TraceCheckUtils]: 54: Hoare triple {26522#(<= ~alt_malloc_balance~0 1)} assume 1 + ~alt_bzero_count~0 <= 2147483647; {26522#(<= ~alt_malloc_balance~0 1)} is VALID [2022-02-21 03:17:02,903 INFO L290 TraceCheckUtils]: 55: Hoare triple {26522#(<= ~alt_malloc_balance~0 1)} assume 1 + ~alt_bzero_count~0 >= -2147483648;#t~pre37#1 := 1 + ~alt_bzero_count~0;~alt_bzero_count~0 := 1 + ~alt_bzero_count~0;havoc #t~pre37#1;assume { :begin_inline_#Ultimate.C_memset } true;#Ultimate.C_memset_#ptr#1.base, #Ultimate.C_memset_#ptr#1.offset, #Ultimate.C_memset_#value#1, #Ultimate.C_memset_#amount#1 := ~a#1.base, ~a#1.offset, 0, ~n#1;havoc #Ultimate.C_memset_#res#1.base, #Ultimate.C_memset_#res#1.offset;havoc #Ultimate.C_memset_#t~loopctr269#1;#Ultimate.C_memset_#t~loopctr269#1 := 0; {26522#(<= ~alt_malloc_balance~0 1)} is VALID [2022-02-21 03:17:02,904 INFO L290 TraceCheckUtils]: 56: Hoare triple {26522#(<= ~alt_malloc_balance~0 1)} assume !(#Ultimate.C_memset_#t~loopctr269#1 % 4294967296 < #Ultimate.C_memset_#amount#1 % 4294967296); {26522#(<= ~alt_malloc_balance~0 1)} is VALID [2022-02-21 03:17:02,904 INFO L290 TraceCheckUtils]: 57: Hoare triple {26522#(<= ~alt_malloc_balance~0 1)} assume #Ultimate.C_memset_#res#1.base == #Ultimate.C_memset_#ptr#1.base && #Ultimate.C_memset_#res#1.offset == #Ultimate.C_memset_#ptr#1.offset;#t~memset~res38#1.base, #t~memset~res38#1.offset := #Ultimate.C_memset_#res#1.base, #Ultimate.C_memset_#res#1.offset;assume { :end_inline_#Ultimate.C_memset } true;havoc #t~memset~res38#1.base, #t~memset~res38#1.offset; {26522#(<= ~alt_malloc_balance~0 1)} is VALID [2022-02-21 03:17:02,904 INFO L290 TraceCheckUtils]: 58: Hoare triple {26522#(<= ~alt_malloc_balance~0 1)} assume true; {26522#(<= ~alt_malloc_balance~0 1)} is VALID [2022-02-21 03:17:02,905 INFO L284 TraceCheckUtils]: 59: Hoare quadruple {26522#(<= ~alt_malloc_balance~0 1)} {26522#(<= ~alt_malloc_balance~0 1)} #857#return; {26522#(<= ~alt_malloc_balance~0 1)} is VALID [2022-02-21 03:17:02,905 INFO L290 TraceCheckUtils]: 60: Hoare triple {26522#(<= ~alt_malloc_balance~0 1)} havoc main_#t~mem73#1.base, main_#t~mem73#1.offset;call main_#t~mem74#1.base, main_#t~mem74#1.offset := read~$Pointer$(main_~user~0#1.base, 8 + main_~user~0#1.offset, 4);call write~$Pointer$(main_~user~0#1.base, 8 + main_~user~0#1.offset, main_#t~mem74#1.base, 16 + main_#t~mem74#1.offset, 4);havoc main_#t~mem74#1.base, main_#t~mem74#1.offset;call main_#t~mem75#1.base, main_#t~mem75#1.offset := read~$Pointer$(main_~user~0#1.base, 8 + main_~user~0#1.offset, 4);call write~int(32, main_#t~mem75#1.base, 4 + main_#t~mem75#1.offset, 4);havoc main_#t~mem75#1.base, main_#t~mem75#1.offset;call main_#t~mem76#1.base, main_#t~mem76#1.offset := read~$Pointer$(main_~user~0#1.base, 8 + main_~user~0#1.offset, 4);call write~int(5, main_#t~mem76#1.base, 8 + main_#t~mem76#1.offset, 4);havoc main_#t~mem76#1.base, main_#t~mem76#1.offset;call main_#t~mem77#1.base, main_#t~mem77#1.offset := read~$Pointer$(main_~user~0#1.base, 8 + main_~user~0#1.offset, 4);call write~int((if 8 + main_~user~0#1.offset - main_~user~0#1.offset < 0 && 0 != (8 + main_~user~0#1.offset - main_~user~0#1.offset) % 1 then 1 + (8 + main_~user~0#1.offset - main_~user~0#1.offset) / 1 else (8 + main_~user~0#1.offset - main_~user~0#1.offset) / 1), main_#t~mem77#1.base, 20 + main_#t~mem77#1.offset, 4);havoc main_#t~mem77#1.base, main_#t~mem77#1.offset;call main_#t~mem78#1.base, main_#t~mem78#1.offset := read~$Pointer$(main_~user~0#1.base, 8 + main_~user~0#1.offset, 4); {26522#(<= ~alt_malloc_balance~0 1)} is VALID [2022-02-21 03:17:02,905 INFO L272 TraceCheckUtils]: 61: Hoare triple {26522#(<= ~alt_malloc_balance~0 1)} call main_#t~ret79#1.base, main_#t~ret79#1.offset := alt_malloc(384); {26522#(<= ~alt_malloc_balance~0 1)} is VALID [2022-02-21 03:17:02,906 INFO L290 TraceCheckUtils]: 62: Hoare triple {26522#(<= ~alt_malloc_balance~0 1)} ~sz := #in~sz;#t~post31 := ~alt_malloc_balance~0; {26562#(<= |alt_malloc_#t~post31| 1)} is VALID [2022-02-21 03:17:02,906 INFO L290 TraceCheckUtils]: 63: Hoare triple {26562#(<= |alt_malloc_#t~post31| 1)} assume !(1 + #t~post31 <= 2147483647); {26367#false} is VALID [2022-02-21 03:17:02,907 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-21 03:17:02,907 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-21 03:17:03,369 INFO L290 TraceCheckUtils]: 63: Hoare triple {26566#(<= |alt_malloc_#t~post31| 2147483646)} assume !(1 + #t~post31 <= 2147483647); {26367#false} is VALID [2022-02-21 03:17:03,370 INFO L290 TraceCheckUtils]: 62: Hoare triple {26570#(<= ~alt_malloc_balance~0 2147483646)} ~sz := #in~sz;#t~post31 := ~alt_malloc_balance~0; {26566#(<= |alt_malloc_#t~post31| 2147483646)} is VALID [2022-02-21 03:17:03,370 INFO L272 TraceCheckUtils]: 61: Hoare triple {26570#(<= ~alt_malloc_balance~0 2147483646)} call main_#t~ret79#1.base, main_#t~ret79#1.offset := alt_malloc(384); {26570#(<= ~alt_malloc_balance~0 2147483646)} is VALID [2022-02-21 03:17:03,370 INFO L290 TraceCheckUtils]: 60: Hoare triple {26570#(<= ~alt_malloc_balance~0 2147483646)} havoc main_#t~mem73#1.base, main_#t~mem73#1.offset;call main_#t~mem74#1.base, main_#t~mem74#1.offset := read~$Pointer$(main_~user~0#1.base, 8 + main_~user~0#1.offset, 4);call write~$Pointer$(main_~user~0#1.base, 8 + main_~user~0#1.offset, main_#t~mem74#1.base, 16 + main_#t~mem74#1.offset, 4);havoc main_#t~mem74#1.base, main_#t~mem74#1.offset;call main_#t~mem75#1.base, main_#t~mem75#1.offset := read~$Pointer$(main_~user~0#1.base, 8 + main_~user~0#1.offset, 4);call write~int(32, main_#t~mem75#1.base, 4 + main_#t~mem75#1.offset, 4);havoc main_#t~mem75#1.base, main_#t~mem75#1.offset;call main_#t~mem76#1.base, main_#t~mem76#1.offset := read~$Pointer$(main_~user~0#1.base, 8 + main_~user~0#1.offset, 4);call write~int(5, main_#t~mem76#1.base, 8 + main_#t~mem76#1.offset, 4);havoc main_#t~mem76#1.base, main_#t~mem76#1.offset;call main_#t~mem77#1.base, main_#t~mem77#1.offset := read~$Pointer$(main_~user~0#1.base, 8 + main_~user~0#1.offset, 4);call write~int((if 8 + main_~user~0#1.offset - main_~user~0#1.offset < 0 && 0 != (8 + main_~user~0#1.offset - main_~user~0#1.offset) % 1 then 1 + (8 + main_~user~0#1.offset - main_~user~0#1.offset) / 1 else (8 + main_~user~0#1.offset - main_~user~0#1.offset) / 1), main_#t~mem77#1.base, 20 + main_#t~mem77#1.offset, 4);havoc main_#t~mem77#1.base, main_#t~mem77#1.offset;call main_#t~mem78#1.base, main_#t~mem78#1.offset := read~$Pointer$(main_~user~0#1.base, 8 + main_~user~0#1.offset, 4); {26570#(<= ~alt_malloc_balance~0 2147483646)} is VALID [2022-02-21 03:17:03,371 INFO L284 TraceCheckUtils]: 59: Hoare quadruple {26366#true} {26570#(<= ~alt_malloc_balance~0 2147483646)} #857#return; {26570#(<= ~alt_malloc_balance~0 2147483646)} is VALID [2022-02-21 03:17:03,371 INFO L290 TraceCheckUtils]: 58: Hoare triple {26366#true} assume true; {26366#true} is VALID [2022-02-21 03:17:03,371 INFO L290 TraceCheckUtils]: 57: Hoare triple {26366#true} assume #Ultimate.C_memset_#res#1.base == #Ultimate.C_memset_#ptr#1.base && #Ultimate.C_memset_#res#1.offset == #Ultimate.C_memset_#ptr#1.offset;#t~memset~res38#1.base, #t~memset~res38#1.offset := #Ultimate.C_memset_#res#1.base, #Ultimate.C_memset_#res#1.offset;assume { :end_inline_#Ultimate.C_memset } true;havoc #t~memset~res38#1.base, #t~memset~res38#1.offset; {26366#true} is VALID [2022-02-21 03:17:03,371 INFO L290 TraceCheckUtils]: 56: Hoare triple {26366#true} assume !(#Ultimate.C_memset_#t~loopctr269#1 % 4294967296 < #Ultimate.C_memset_#amount#1 % 4294967296); {26366#true} is VALID [2022-02-21 03:17:03,371 INFO L290 TraceCheckUtils]: 55: Hoare triple {26366#true} assume 1 + ~alt_bzero_count~0 >= -2147483648;#t~pre37#1 := 1 + ~alt_bzero_count~0;~alt_bzero_count~0 := 1 + ~alt_bzero_count~0;havoc #t~pre37#1;assume { :begin_inline_#Ultimate.C_memset } true;#Ultimate.C_memset_#ptr#1.base, #Ultimate.C_memset_#ptr#1.offset, #Ultimate.C_memset_#value#1, #Ultimate.C_memset_#amount#1 := ~a#1.base, ~a#1.offset, 0, ~n#1;havoc #Ultimate.C_memset_#res#1.base, #Ultimate.C_memset_#res#1.offset;havoc #Ultimate.C_memset_#t~loopctr269#1;#Ultimate.C_memset_#t~loopctr269#1 := 0; {26366#true} is VALID [2022-02-21 03:17:03,371 INFO L290 TraceCheckUtils]: 54: Hoare triple {26366#true} assume 1 + ~alt_bzero_count~0 <= 2147483647; {26366#true} is VALID [2022-02-21 03:17:03,371 INFO L290 TraceCheckUtils]: 53: Hoare triple {26366#true} ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; {26366#true} is VALID [2022-02-21 03:17:03,371 INFO L272 TraceCheckUtils]: 52: Hoare triple {26570#(<= ~alt_malloc_balance~0 2147483646)} call alt_bzero(main_#t~mem73#1.base, main_#t~mem73#1.offset, 44); {26366#true} is VALID [2022-02-21 03:17:03,372 INFO L290 TraceCheckUtils]: 51: Hoare triple {26570#(<= ~alt_malloc_balance~0 2147483646)} assume !(main_#t~mem72#1.base == 0 && main_#t~mem72#1.offset == 0);havoc main_#t~mem72#1.base, main_#t~mem72#1.offset;call main_#t~mem73#1.base, main_#t~mem73#1.offset := read~$Pointer$(main_~user~0#1.base, 8 + main_~user~0#1.offset, 4); {26570#(<= ~alt_malloc_balance~0 2147483646)} is VALID [2022-02-21 03:17:03,372 INFO L290 TraceCheckUtils]: 50: Hoare triple {26570#(<= ~alt_malloc_balance~0 2147483646)} call write~$Pointer$(main_#t~ret71#1.base, main_#t~ret71#1.offset, main_~user~0#1.base, 8 + main_~user~0#1.offset, 4);havoc main_#t~ret71#1.base, main_#t~ret71#1.offset;call main_#t~mem72#1.base, main_#t~mem72#1.offset := read~$Pointer$(main_~user~0#1.base, 8 + main_~user~0#1.offset, 4); {26570#(<= ~alt_malloc_balance~0 2147483646)} is VALID [2022-02-21 03:17:03,373 INFO L284 TraceCheckUtils]: 49: Hoare quadruple {26614#(or (< 2147483645 |old(~alt_malloc_balance~0)|) (<= ~alt_malloc_balance~0 2147483646))} {26610#(<= ~alt_malloc_balance~0 2147483645)} #855#return; {26570#(<= ~alt_malloc_balance~0 2147483646)} is VALID [2022-02-21 03:17:03,373 INFO L290 TraceCheckUtils]: 48: Hoare triple {26614#(or (< 2147483645 |old(~alt_malloc_balance~0)|) (<= ~alt_malloc_balance~0 2147483646))} assume true; {26614#(or (< 2147483645 |old(~alt_malloc_balance~0)|) (<= ~alt_malloc_balance~0 2147483646))} is VALID [2022-02-21 03:17:03,374 INFO L290 TraceCheckUtils]: 47: Hoare triple {26614#(or (< 2147483645 |old(~alt_malloc_balance~0)|) (<= ~alt_malloc_balance~0 2147483646))} call #t~malloc32.base, #t~malloc32.offset := #Ultimate.allocOnHeap(~sz);#res.base, #res.offset := #t~malloc32.base, #t~malloc32.offset;havoc #t~malloc32.base, #t~malloc32.offset; {26614#(or (< 2147483645 |old(~alt_malloc_balance~0)|) (<= ~alt_malloc_balance~0 2147483646))} is VALID [2022-02-21 03:17:03,374 INFO L290 TraceCheckUtils]: 46: Hoare triple {26614#(or (< 2147483645 |old(~alt_malloc_balance~0)|) (<= ~alt_malloc_balance~0 2147483646))} assume !(1 == ~alt_malloc_balance~0); {26614#(or (< 2147483645 |old(~alt_malloc_balance~0)|) (<= ~alt_malloc_balance~0 2147483646))} is VALID [2022-02-21 03:17:03,382 INFO L290 TraceCheckUtils]: 45: Hoare triple {26627#(or (< 2147483645 |old(~alt_malloc_balance~0)|) (<= |alt_malloc_#t~post31| 2147483645))} assume 1 + #t~post31 >= -2147483648;~alt_malloc_balance~0 := 1 + #t~post31;call write~int(~sz, ~#alt_malloc_sizes~0.base, ~#alt_malloc_sizes~0.offset + 4 * #t~post31, 4);havoc #t~post31; {26614#(or (< 2147483645 |old(~alt_malloc_balance~0)|) (<= ~alt_malloc_balance~0 2147483646))} is VALID [2022-02-21 03:17:03,383 INFO L290 TraceCheckUtils]: 44: Hoare triple {26627#(or (< 2147483645 |old(~alt_malloc_balance~0)|) (<= |alt_malloc_#t~post31| 2147483645))} assume 1 + #t~post31 <= 2147483647; {26627#(or (< 2147483645 |old(~alt_malloc_balance~0)|) (<= |alt_malloc_#t~post31| 2147483645))} is VALID [2022-02-21 03:17:03,383 INFO L290 TraceCheckUtils]: 43: Hoare triple {26634#(or (< 2147483645 |old(~alt_malloc_balance~0)|) (<= ~alt_malloc_balance~0 2147483645))} ~sz := #in~sz;#t~post31 := ~alt_malloc_balance~0; {26627#(or (< 2147483645 |old(~alt_malloc_balance~0)|) (<= |alt_malloc_#t~post31| 2147483645))} is VALID [2022-02-21 03:17:03,384 INFO L272 TraceCheckUtils]: 42: Hoare triple {26610#(<= ~alt_malloc_balance~0 2147483645)} call main_#t~ret71#1.base, main_#t~ret71#1.offset := alt_malloc(44); {26634#(or (< 2147483645 |old(~alt_malloc_balance~0)|) (<= ~alt_malloc_balance~0 2147483645))} is VALID [2022-02-21 03:17:03,384 INFO L290 TraceCheckUtils]: 41: Hoare triple {26610#(<= ~alt_malloc_balance~0 2147483645)} assume main_~users~0#1.base == 0 && main_~users~0#1.offset == 0;call write~$Pointer$(0, 0, main_~user~0#1.base, 16 + main_~user~0#1.offset, 4);call write~$Pointer$(0, 0, main_~user~0#1.base, 12 + main_~user~0#1.offset, 4); {26610#(<= ~alt_malloc_balance~0 2147483645)} is VALID [2022-02-21 03:17:03,385 INFO L290 TraceCheckUtils]: 40: Hoare triple {26610#(<= ~alt_malloc_balance~0 2147483645)} call write~int(main_~_ha_hashv~0#1, main_~user~0#1.base, 36 + main_~user~0#1.offset, 4);call write~$Pointer$(main_~user~0#1.base, main_~user~0#1.offset, main_~user~0#1.base, 28 + main_~user~0#1.offset, 4);call write~int(4, main_~user~0#1.base, 32 + main_~user~0#1.offset, 4); {26610#(<= ~alt_malloc_balance~0 2147483645)} is VALID [2022-02-21 03:17:03,385 INFO L290 TraceCheckUtils]: 39: Hoare triple {26610#(<= ~alt_malloc_balance~0 2147483645)} goto; {26610#(<= ~alt_malloc_balance~0 2147483645)} is VALID [2022-02-21 03:17:03,385 INFO L290 TraceCheckUtils]: 38: Hoare triple {26610#(<= ~alt_malloc_balance~0 2147483645)} goto; {26610#(<= ~alt_malloc_balance~0 2147483645)} is VALID [2022-02-21 03:17:03,385 INFO L290 TraceCheckUtils]: 37: Hoare triple {26610#(<= ~alt_malloc_balance~0 2147483645)} goto; {26610#(<= ~alt_malloc_balance~0 2147483645)} is VALID [2022-02-21 03:17:03,386 INFO L290 TraceCheckUtils]: 36: Hoare triple {26610#(<= ~alt_malloc_balance~0 2147483645)} main_~_hj_i~0#1 := main_~_hj_i~0#1 - main_~_hj_j~0#1;main_~_hj_i~0#1 := main_~_hj_i~0#1 - main_~_ha_hashv~0#1;main_~_hj_i~0#1 := (if (1 == main_~_hj_i~0#1 || 0 == main_~_hj_i~0#1) && (1 == main_~_ha_hashv~0#1 / 8192 || 0 == main_~_ha_hashv~0#1 / 8192) then (if main_~_hj_i~0#1 == main_~_ha_hashv~0#1 / 8192 then 0 else 1) else (if 0 == main_~_hj_i~0#1 then main_~_ha_hashv~0#1 / 8192 else (if 0 == main_~_ha_hashv~0#1 / 8192 then main_~_hj_i~0#1 else ~bitwiseXOr(main_~_hj_i~0#1, main_~_ha_hashv~0#1 / 8192))));main_~_hj_j~0#1 := main_~_hj_j~0#1 - main_~_ha_hashv~0#1;main_~_hj_j~0#1 := main_~_hj_j~0#1 - main_~_hj_i~0#1;main_~_hj_j~0#1 := (if (1 == main_~_hj_j~0#1 || 0 == main_~_hj_j~0#1) && (1 == 256 * main_~_hj_i~0#1 || 0 == 256 * main_~_hj_i~0#1) then (if main_~_hj_j~0#1 == 256 * main_~_hj_i~0#1 then 0 else 1) else (if 0 == main_~_hj_j~0#1 then 256 * main_~_hj_i~0#1 else (if 0 == 256 * main_~_hj_i~0#1 then main_~_hj_j~0#1 else ~bitwiseXOr(main_~_hj_j~0#1, 256 * main_~_hj_i~0#1))));main_~_ha_hashv~0#1 := main_~_ha_hashv~0#1 - main_~_hj_i~0#1;main_~_ha_hashv~0#1 := main_~_ha_hashv~0#1 - main_~_hj_j~0#1;main_~_ha_hashv~0#1 := (if (1 == main_~_ha_hashv~0#1 || 0 == main_~_ha_hashv~0#1) && (1 == main_~_hj_j~0#1 / 8192 || 0 == main_~_hj_j~0#1 / 8192) then (if main_~_ha_hashv~0#1 == main_~_hj_j~0#1 / 8192 then 0 else 1) else (if 0 == main_~_ha_hashv~0#1 then main_~_hj_j~0#1 / 8192 else (if 0 == main_~_hj_j~0#1 / 8192 then main_~_ha_hashv~0#1 else ~bitwiseXOr(main_~_ha_hashv~0#1, main_~_hj_j~0#1 / 8192))));main_~_hj_i~0#1 := main_~_hj_i~0#1 - main_~_hj_j~0#1;main_~_hj_i~0#1 := main_~_hj_i~0#1 - main_~_ha_hashv~0#1;main_~_hj_i~0#1 := (if (1 == main_~_hj_i~0#1 || 0 == main_~_hj_i~0#1) && (1 == main_~_ha_hashv~0#1 / 4096 || 0 == main_~_ha_hashv~0#1 / 4096) then (if main_~_hj_i~0#1 == main_~_ha_hashv~0#1 / 4096 then 0 else 1) else (if 0 == main_~_hj_i~0#1 then main_~_ha_hashv~0#1 / 4096 else (if 0 == main_~_ha_hashv~0#1 / 4096 then main_~_hj_i~0#1 else ~bitwiseXOr(main_~_hj_i~0#1, main_~_ha_hashv~0#1 / 4096))));main_~_hj_j~0#1 := main_~_hj_j~0#1 - main_~_ha_hashv~0#1;main_~_hj_j~0#1 := main_~_hj_j~0#1 - main_~_hj_i~0#1;main_~_hj_j~0#1 := (if (1 == main_~_hj_j~0#1 || 0 == main_~_hj_j~0#1) && (1 == 65536 * main_~_hj_i~0#1 || 0 == 65536 * main_~_hj_i~0#1) then (if main_~_hj_j~0#1 == 65536 * main_~_hj_i~0#1 then 0 else 1) else (if 0 == main_~_hj_j~0#1 then 65536 * main_~_hj_i~0#1 else (if 0 == 65536 * main_~_hj_i~0#1 then main_~_hj_j~0#1 else ~bitwiseXOr(main_~_hj_j~0#1, 65536 * main_~_hj_i~0#1))));main_~_ha_hashv~0#1 := main_~_ha_hashv~0#1 - main_~_hj_i~0#1;main_~_ha_hashv~0#1 := main_~_ha_hashv~0#1 - main_~_hj_j~0#1;main_~_ha_hashv~0#1 := (if (1 == main_~_ha_hashv~0#1 || 0 == main_~_ha_hashv~0#1) && (1 == main_~_hj_j~0#1 / 32 || 0 == main_~_hj_j~0#1 / 32) then (if main_~_ha_hashv~0#1 == main_~_hj_j~0#1 / 32 then 0 else 1) else (if 0 == main_~_ha_hashv~0#1 then main_~_hj_j~0#1 / 32 else (if 0 == main_~_hj_j~0#1 / 32 then main_~_ha_hashv~0#1 else ~bitwiseXOr(main_~_ha_hashv~0#1, main_~_hj_j~0#1 / 32))));main_~_hj_i~0#1 := main_~_hj_i~0#1 - main_~_hj_j~0#1;main_~_hj_i~0#1 := main_~_hj_i~0#1 - main_~_ha_hashv~0#1;main_~_hj_i~0#1 := (if (1 == main_~_hj_i~0#1 || 0 == main_~_hj_i~0#1) && (1 == main_~_ha_hashv~0#1 / 8 || 0 == main_~_ha_hashv~0#1 / 8) then (if main_~_hj_i~0#1 == main_~_ha_hashv~0#1 / 8 then 0 else 1) else (if 0 == main_~_hj_i~0#1 then main_~_ha_hashv~0#1 / 8 else (if 0 == main_~_ha_hashv~0#1 / 8 then main_~_hj_i~0#1 else ~bitwiseXOr(main_~_hj_i~0#1, main_~_ha_hashv~0#1 / 8))));main_~_hj_j~0#1 := main_~_hj_j~0#1 - main_~_ha_hashv~0#1;main_~_hj_j~0#1 := main_~_hj_j~0#1 - main_~_hj_i~0#1;main_~_hj_j~0#1 := (if (1 == main_~_hj_j~0#1 || 0 == main_~_hj_j~0#1) && (1 == 1024 * main_~_hj_i~0#1 || 0 == 1024 * main_~_hj_i~0#1) then (if main_~_hj_j~0#1 == 1024 * main_~_hj_i~0#1 then 0 else 1) else (if 0 == main_~_hj_j~0#1 then 1024 * main_~_hj_i~0#1 else (if 0 == 1024 * main_~_hj_i~0#1 then main_~_hj_j~0#1 else ~bitwiseXOr(main_~_hj_j~0#1, 1024 * main_~_hj_i~0#1))));main_~_ha_hashv~0#1 := main_~_ha_hashv~0#1 - main_~_hj_i~0#1;main_~_ha_hashv~0#1 := main_~_ha_hashv~0#1 - main_~_hj_j~0#1;main_~_ha_hashv~0#1 := (if (1 == main_~_ha_hashv~0#1 || 0 == main_~_ha_hashv~0#1) && (1 == main_~_hj_j~0#1 / 32768 || 0 == main_~_hj_j~0#1 / 32768) then (if main_~_ha_hashv~0#1 == main_~_hj_j~0#1 / 32768 then 0 else 1) else (if 0 == main_~_ha_hashv~0#1 then main_~_hj_j~0#1 / 32768 else (if 0 == main_~_hj_j~0#1 / 32768 then main_~_ha_hashv~0#1 else ~bitwiseXOr(main_~_ha_hashv~0#1, main_~_hj_j~0#1 / 32768)))); {26610#(<= ~alt_malloc_balance~0 2147483645)} is VALID [2022-02-21 03:17:03,386 INFO L290 TraceCheckUtils]: 35: Hoare triple {26610#(<= ~alt_malloc_balance~0 2147483645)} havoc main_#t~switch59#1; {26610#(<= ~alt_malloc_balance~0 2147483645)} is VALID [2022-02-21 03:17:03,386 INFO L290 TraceCheckUtils]: 34: Hoare triple {26610#(<= ~alt_malloc_balance~0 2147483645)} assume main_#t~switch59#1;call main_#t~mem70#1 := read~int(main_~_hj_key~0#1.base, main_~_hj_key~0#1.offset, 1);main_~_hj_i~0#1 := main_~_hj_i~0#1 + main_#t~mem70#1 % 256;havoc main_#t~mem70#1; {26610#(<= ~alt_malloc_balance~0 2147483645)} is VALID [2022-02-21 03:17:03,387 INFO L290 TraceCheckUtils]: 33: Hoare triple {26610#(<= ~alt_malloc_balance~0 2147483645)} main_#t~switch59#1 := main_#t~switch59#1 || 1 == main_~_hj_k~0#1; {26610#(<= ~alt_malloc_balance~0 2147483645)} is VALID [2022-02-21 03:17:03,387 INFO L290 TraceCheckUtils]: 32: Hoare triple {26610#(<= ~alt_malloc_balance~0 2147483645)} assume main_#t~switch59#1;call main_#t~mem69#1 := read~int(main_~_hj_key~0#1.base, 1 + main_~_hj_key~0#1.offset, 1);main_~_hj_i~0#1 := main_~_hj_i~0#1 + 256 * (main_#t~mem69#1 % 256);havoc main_#t~mem69#1; {26610#(<= ~alt_malloc_balance~0 2147483645)} is VALID [2022-02-21 03:17:03,387 INFO L290 TraceCheckUtils]: 31: Hoare triple {26610#(<= ~alt_malloc_balance~0 2147483645)} main_#t~switch59#1 := main_#t~switch59#1 || 2 == main_~_hj_k~0#1; {26610#(<= ~alt_malloc_balance~0 2147483645)} is VALID [2022-02-21 03:17:03,387 INFO L290 TraceCheckUtils]: 30: Hoare triple {26610#(<= ~alt_malloc_balance~0 2147483645)} assume main_#t~switch59#1;call main_#t~mem68#1 := read~int(main_~_hj_key~0#1.base, 2 + main_~_hj_key~0#1.offset, 1);main_~_hj_i~0#1 := main_~_hj_i~0#1 + 65536 * (main_#t~mem68#1 % 256);havoc main_#t~mem68#1; {26610#(<= ~alt_malloc_balance~0 2147483645)} is VALID [2022-02-21 03:17:03,388 INFO L290 TraceCheckUtils]: 29: Hoare triple {26610#(<= ~alt_malloc_balance~0 2147483645)} main_#t~switch59#1 := main_#t~switch59#1 || 3 == main_~_hj_k~0#1; {26610#(<= ~alt_malloc_balance~0 2147483645)} is VALID [2022-02-21 03:17:03,388 INFO L290 TraceCheckUtils]: 28: Hoare triple {26610#(<= ~alt_malloc_balance~0 2147483645)} assume main_#t~switch59#1;call main_#t~mem67#1 := read~int(main_~_hj_key~0#1.base, 3 + main_~_hj_key~0#1.offset, 1);main_~_hj_i~0#1 := main_~_hj_i~0#1 + 16777216 * (main_#t~mem67#1 % 256);havoc main_#t~mem67#1; {26610#(<= ~alt_malloc_balance~0 2147483645)} is VALID [2022-02-21 03:17:03,388 INFO L290 TraceCheckUtils]: 27: Hoare triple {26610#(<= ~alt_malloc_balance~0 2147483645)} main_#t~switch59#1 := main_#t~switch59#1 || 4 == main_~_hj_k~0#1; {26610#(<= ~alt_malloc_balance~0 2147483645)} is VALID [2022-02-21 03:17:03,388 INFO L290 TraceCheckUtils]: 26: Hoare triple {26610#(<= ~alt_malloc_balance~0 2147483645)} assume !main_#t~switch59#1; {26610#(<= ~alt_malloc_balance~0 2147483645)} is VALID [2022-02-21 03:17:03,389 INFO L290 TraceCheckUtils]: 25: Hoare triple {26610#(<= ~alt_malloc_balance~0 2147483645)} main_#t~switch59#1 := main_#t~switch59#1 || 5 == main_~_hj_k~0#1; {26610#(<= ~alt_malloc_balance~0 2147483645)} is VALID [2022-02-21 03:17:03,389 INFO L290 TraceCheckUtils]: 24: Hoare triple {26610#(<= ~alt_malloc_balance~0 2147483645)} assume !main_#t~switch59#1; {26610#(<= ~alt_malloc_balance~0 2147483645)} is VALID [2022-02-21 03:17:03,389 INFO L290 TraceCheckUtils]: 23: Hoare triple {26610#(<= ~alt_malloc_balance~0 2147483645)} main_#t~switch59#1 := main_#t~switch59#1 || 6 == main_~_hj_k~0#1; {26610#(<= ~alt_malloc_balance~0 2147483645)} is VALID [2022-02-21 03:17:03,390 INFO L290 TraceCheckUtils]: 22: Hoare triple {26610#(<= ~alt_malloc_balance~0 2147483645)} assume !main_#t~switch59#1; {26610#(<= ~alt_malloc_balance~0 2147483645)} is VALID [2022-02-21 03:17:03,390 INFO L290 TraceCheckUtils]: 21: Hoare triple {26610#(<= ~alt_malloc_balance~0 2147483645)} main_#t~switch59#1 := main_#t~switch59#1 || 7 == main_~_hj_k~0#1; {26610#(<= ~alt_malloc_balance~0 2147483645)} is VALID [2022-02-21 03:17:03,390 INFO L290 TraceCheckUtils]: 20: Hoare triple {26610#(<= ~alt_malloc_balance~0 2147483645)} assume !main_#t~switch59#1; {26610#(<= ~alt_malloc_balance~0 2147483645)} is VALID [2022-02-21 03:17:03,390 INFO L290 TraceCheckUtils]: 19: Hoare triple {26610#(<= ~alt_malloc_balance~0 2147483645)} main_#t~switch59#1 := main_#t~switch59#1 || 8 == main_~_hj_k~0#1; {26610#(<= ~alt_malloc_balance~0 2147483645)} is VALID [2022-02-21 03:17:03,391 INFO L290 TraceCheckUtils]: 18: Hoare triple {26610#(<= ~alt_malloc_balance~0 2147483645)} assume !main_#t~switch59#1; {26610#(<= ~alt_malloc_balance~0 2147483645)} is VALID [2022-02-21 03:17:03,391 INFO L290 TraceCheckUtils]: 17: Hoare triple {26610#(<= ~alt_malloc_balance~0 2147483645)} main_#t~switch59#1 := main_#t~switch59#1 || 9 == main_~_hj_k~0#1; {26610#(<= ~alt_malloc_balance~0 2147483645)} is VALID [2022-02-21 03:17:03,391 INFO L290 TraceCheckUtils]: 16: Hoare triple {26610#(<= ~alt_malloc_balance~0 2147483645)} assume !main_#t~switch59#1; {26610#(<= ~alt_malloc_balance~0 2147483645)} is VALID [2022-02-21 03:17:03,391 INFO L290 TraceCheckUtils]: 15: Hoare triple {26610#(<= ~alt_malloc_balance~0 2147483645)} main_#t~switch59#1 := main_#t~switch59#1 || 10 == main_~_hj_k~0#1; {26610#(<= ~alt_malloc_balance~0 2147483645)} is VALID [2022-02-21 03:17:03,392 INFO L290 TraceCheckUtils]: 14: Hoare triple {26610#(<= ~alt_malloc_balance~0 2147483645)} assume !main_#t~switch59#1; {26610#(<= ~alt_malloc_balance~0 2147483645)} is VALID [2022-02-21 03:17:03,392 INFO L290 TraceCheckUtils]: 13: Hoare triple {26610#(<= ~alt_malloc_balance~0 2147483645)} main_~_ha_hashv~0#1 := 4 + main_~_ha_hashv~0#1;main_#t~switch59#1 := 11 == main_~_hj_k~0#1; {26610#(<= ~alt_malloc_balance~0 2147483645)} is VALID [2022-02-21 03:17:03,392 INFO L290 TraceCheckUtils]: 12: Hoare triple {26610#(<= ~alt_malloc_balance~0 2147483645)} assume !(main_~_hj_k~0#1 % 4294967296 >= 12); {26610#(<= ~alt_malloc_balance~0 2147483645)} is VALID [2022-02-21 03:17:03,392 INFO L290 TraceCheckUtils]: 11: Hoare triple {26610#(<= ~alt_malloc_balance~0 2147483645)} havoc main_~_hj_i~0#1;havoc main_~_hj_j~0#1;havoc main_~_hj_k~0#1;main_~_hj_key~0#1.base, main_~_hj_key~0#1.offset := main_~user~0#1.base, main_~user~0#1.offset;main_~_ha_hashv~0#1 := 4276993775;main_~_hj_j~0#1 := 2654435769;main_~_hj_i~0#1 := main_~_hj_j~0#1;main_~_hj_k~0#1 := 4; {26610#(<= ~alt_malloc_balance~0 2147483645)} is VALID [2022-02-21 03:17:03,393 INFO L290 TraceCheckUtils]: 10: Hoare triple {26610#(<= ~alt_malloc_balance~0 2147483645)} goto; {26610#(<= ~alt_malloc_balance~0 2147483645)} is VALID [2022-02-21 03:17:03,393 INFO L290 TraceCheckUtils]: 9: Hoare triple {26610#(<= ~alt_malloc_balance~0 2147483645)} havoc main_~_ha_hashv~0#1; {26610#(<= ~alt_malloc_balance~0 2147483645)} is VALID [2022-02-21 03:17:03,393 INFO L290 TraceCheckUtils]: 8: Hoare triple {26610#(<= ~alt_malloc_balance~0 2147483645)} assume main_#t~mem45#1 * main_#t~mem46#1 >= -2147483648;call write~int(main_#t~mem45#1 * main_#t~mem46#1, main_~user~0#1.base, 4 + main_~user~0#1.offset, 4);havoc main_#t~mem45#1;havoc main_#t~mem46#1; {26610#(<= ~alt_malloc_balance~0 2147483645)} is VALID [2022-02-21 03:17:03,393 INFO L290 TraceCheckUtils]: 7: Hoare triple {26610#(<= ~alt_malloc_balance~0 2147483645)} assume main_#t~mem45#1 * main_#t~mem46#1 <= 2147483647; {26610#(<= ~alt_malloc_balance~0 2147483645)} is VALID [2022-02-21 03:17:03,394 INFO L290 TraceCheckUtils]: 6: Hoare triple {26610#(<= ~alt_malloc_balance~0 2147483645)} call main_#t~mem44#1 := read~int(main_~#i~0#1.base, main_~#i~0#1.offset, 4);call write~int(main_#t~mem44#1, main_~user~0#1.base, main_~user~0#1.offset, 4);havoc main_#t~mem44#1;call main_#t~mem45#1 := read~int(main_~#i~0#1.base, main_~#i~0#1.offset, 4);call main_#t~mem46#1 := read~int(main_~#i~0#1.base, main_~#i~0#1.offset, 4); {26610#(<= ~alt_malloc_balance~0 2147483645)} is VALID [2022-02-21 03:17:03,394 INFO L290 TraceCheckUtils]: 5: Hoare triple {26610#(<= ~alt_malloc_balance~0 2147483645)} assume !(main_~user~0#1.base == 0 && main_~user~0#1.offset == 0); {26610#(<= ~alt_malloc_balance~0 2147483645)} is VALID [2022-02-21 03:17:03,394 INFO L290 TraceCheckUtils]: 4: Hoare triple {26610#(<= ~alt_malloc_balance~0 2147483645)} main_#t~ret43#1.base, main_#t~ret43#1.offset := real_malloc_#res#1.base, real_malloc_#res#1.offset;assume { :end_inline_real_malloc } true;main_~user~0#1.base, main_~user~0#1.offset := main_#t~ret43#1.base, main_#t~ret43#1.offset;havoc main_#t~ret43#1.base, main_#t~ret43#1.offset; {26610#(<= ~alt_malloc_balance~0 2147483645)} is VALID [2022-02-21 03:17:03,395 INFO L290 TraceCheckUtils]: 3: Hoare triple {26610#(<= ~alt_malloc_balance~0 2147483645)} assume !!(main_#t~mem42#1 < 10);havoc main_#t~mem42#1;assume { :begin_inline_real_malloc } true;real_malloc_#in~n#1 := 40;havoc real_malloc_#res#1.base, real_malloc_#res#1.offset;havoc real_malloc_#t~malloc39#1.base, real_malloc_#t~malloc39#1.offset, real_malloc_~n#1;real_malloc_~n#1 := real_malloc_#in~n#1;call real_malloc_#t~malloc39#1.base, real_malloc_#t~malloc39#1.offset := #Ultimate.allocOnHeap(real_malloc_~n#1);real_malloc_#res#1.base, real_malloc_#res#1.offset := real_malloc_#t~malloc39#1.base, real_malloc_#t~malloc39#1.offset;havoc real_malloc_#t~malloc39#1.base, real_malloc_#t~malloc39#1.offset; {26610#(<= ~alt_malloc_balance~0 2147483645)} is VALID [2022-02-21 03:17:03,395 INFO L290 TraceCheckUtils]: 2: Hoare triple {26610#(<= ~alt_malloc_balance~0 2147483645)} call main_#t~mem42#1 := read~int(main_~#i~0#1.base, main_~#i~0#1.offset, 4); {26610#(<= ~alt_malloc_balance~0 2147483645)} is VALID [2022-02-21 03:17:03,395 INFO L290 TraceCheckUtils]: 1: Hoare triple {26610#(<= ~alt_malloc_balance~0 2147483645)} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret43#1.base, main_#t~ret43#1.offset, main_#t~mem44#1, main_#t~mem45#1, main_#t~mem46#1, main_#t~mem48#1, main_#t~mem47#1, main_#t~mem49#1, main_#t~mem50#1, main_#t~mem52#1, main_#t~mem51#1, main_#t~mem53#1, main_#t~mem54#1, main_#t~mem56#1, main_#t~mem55#1, main_#t~mem57#1, main_#t~mem58#1, main_#t~switch59#1, main_#t~mem60#1, main_#t~mem61#1, main_#t~mem62#1, main_#t~mem63#1, main_#t~mem64#1, main_#t~mem65#1, main_#t~mem66#1, main_#t~mem67#1, main_#t~mem68#1, main_#t~mem69#1, main_#t~mem70#1, main_~_hj_i~0#1, main_~_hj_j~0#1, main_~_hj_k~0#1, main_~_hj_key~0#1.base, main_~_hj_key~0#1.offset, main_#t~ret71#1.base, main_#t~ret71#1.offset, main_#t~mem72#1.base, main_#t~mem72#1.offset, main_#t~mem73#1.base, main_#t~mem73#1.offset, main_#t~mem74#1.base, main_#t~mem74#1.offset, main_#t~mem75#1.base, main_#t~mem75#1.offset, main_#t~mem76#1.base, main_#t~mem76#1.offset, main_#t~mem77#1.base, main_#t~mem77#1.offset, main_#t~mem78#1.base, main_#t~mem78#1.offset, main_#t~ret79#1.base, main_#t~ret79#1.offset, main_#t~mem80#1.base, main_#t~mem80#1.offset, main_#t~mem81#1.base, main_#t~mem81#1.offset, main_#t~mem82#1.base, main_#t~mem82#1.offset, main_#t~mem83#1.base, main_#t~mem83#1.offset, main_#t~mem84#1.base, main_#t~mem84#1.offset, main_#t~mem85#1.base, main_#t~mem85#1.offset, main_#t~mem86#1.base, main_#t~mem86#1.offset, main_#t~mem87#1.base, main_#t~mem87#1.offset, main_#t~mem88#1.base, main_#t~mem88#1.offset, main_#t~mem89#1.base, main_#t~mem89#1.offset, main_#t~mem90#1, main_#t~mem91#1.base, main_#t~mem91#1.offset, main_#t~mem92#1.base, main_#t~mem92#1.offset, main_#t~mem93#1.base, main_#t~mem93#1.offset, main_#t~mem94#1.base, main_#t~mem94#1.offset, main_#t~mem95#1, main_#t~post96#1, main_#t~mem97#1.base, main_#t~mem97#1.offset, main_#t~mem98#1, main_#t~mem99#1.base, main_#t~mem99#1.offset, main_#t~mem100#1.base, main_#t~mem100#1.offset, main_#t~mem101#1, main_#t~post102#1, main_#t~mem103#1.base, main_#t~mem103#1.offset, main_#t~mem104#1.base, main_#t~mem104#1.offset, main_#t~mem105#1.base, main_#t~mem105#1.offset, main_#t~mem107#1, main_#t~mem106#1, main_#t~mem108#1.base, main_#t~mem108#1.offset, main_#t~mem109#1, main_#t~short110#1, main_#t~mem111#1.base, main_#t~mem111#1.offset, main_#t~mem112#1, main_#t~ret113#1.base, main_#t~ret113#1.offset, main_#t~mem114#1.base, main_#t~mem114#1.offset, main_#t~mem115#1.base, main_#t~mem115#1.offset, main_#t~mem116#1.base, main_#t~mem116#1.offset, main_#t~mem117#1, main_#t~mem118#1.base, main_#t~mem118#1.offset, main_#t~mem119#1.base, main_#t~mem119#1.offset, main_#t~mem122#1, main_#t~mem120#1.base, main_#t~mem120#1.offset, main_#t~mem121#1, main_#t~mem123#1.base, main_#t~mem123#1.offset, main_#t~mem126#1, main_#t~mem124#1.base, main_#t~mem124#1.offset, main_#t~mem125#1, main_#t~ite127#1, main_#t~mem128#1.base, main_#t~mem128#1.offset, main_#t~mem132#1.base, main_#t~mem132#1.offset, main_#t~mem133#1.base, main_#t~mem133#1.offset, main_#t~mem134#1.base, main_#t~mem134#1.offset, main_#t~mem135#1.base, main_#t~mem135#1.offset, main_#t~mem138#1, main_#t~mem136#1.base, main_#t~mem136#1.offset, main_#t~mem137#1, main_#t~mem139#1.base, main_#t~mem139#1.offset, main_#t~mem140#1, main_#t~pre141#1, main_#t~mem142#1.base, main_#t~mem142#1.offset, main_#t~mem143#1, main_#t~mem144#1.base, main_#t~mem144#1.offset, main_#t~mem145#1, main_#t~post146#1, main_#t~mem150#1, main_#t~mem148#1, main_#t~mem147#1.base, main_#t~mem147#1.offset, main_#t~mem149#1, main_#t~mem151#1, main_#t~post152#1, main_#t~mem153#1.base, main_#t~mem153#1.offset, main_#t~mem154#1.base, main_#t~mem154#1.offset, main_#t~mem155#1.base, main_#t~mem155#1.offset, main_#t~post129#1, main_#t~mem130#1.base, main_#t~mem130#1.offset, main_#t~mem131#1, main_#t~mem156#1.base, main_#t~mem156#1.offset, main_#t~mem157#1.base, main_#t~mem157#1.offset, main_#t~mem158#1.base, main_#t~mem158#1.offset, main_#t~mem159#1, main_#t~mem160#1.base, main_#t~mem160#1.offset, main_#t~mem161#1, main_#t~mem162#1.base, main_#t~mem162#1.offset, main_#t~mem163#1, main_#t~post164#1, main_#t~mem165#1.base, main_#t~mem165#1.offset, main_#t~mem166#1.base, main_#t~mem166#1.offset, main_#t~mem167#1.base, main_#t~mem167#1.offset, main_#t~mem168#1.base, main_#t~mem168#1.offset, main_#t~mem171#1, main_#t~mem169#1.base, main_#t~mem169#1.offset, main_#t~mem170#1, main_#t~ite174#1, main_#t~mem172#1.base, main_#t~mem172#1.offset, main_#t~mem173#1, main_#t~mem175#1.base, main_#t~mem175#1.offset, main_#t~mem176#1, main_#t~mem177#1.base, main_#t~mem177#1.offset, main_~_he_bkt~0#1, main_~_he_bkt_i~0#1, main_~_he_thh~0#1.base, main_~_he_thh~0#1.offset, main_~_he_hh_nxt~0#1.base, main_~_he_hh_nxt~0#1.offset, main_~#_he_new_buckets~0#1.base, main_~#_he_new_buckets~0#1.offset, main_~_he_newbkt~0#1.base, main_~_he_newbkt~0#1.offset, main_~_ha_head~0#1.base, main_~_ha_head~0#1.offset, main_~_ha_bkt~0#1, main_~_ha_hashv~0#1, main_#t~mem40#1, main_#t~post41#1, main_#t~mem42#1, main_#t~mem182#1, main_#t~mem181#1, main_#t~mem183#1, main_#t~mem184#1, main_#t~mem186#1, main_#t~mem185#1, main_#t~mem187#1, main_#t~mem188#1, main_#t~mem190#1, main_#t~mem189#1, main_#t~mem191#1, main_#t~mem192#1, main_#t~switch193#1, main_#t~mem194#1, main_#t~mem195#1, main_#t~mem196#1, main_#t~mem197#1, main_#t~mem198#1, main_#t~mem199#1, main_#t~mem200#1, main_#t~mem201#1, main_#t~mem202#1, main_#t~mem203#1, main_#t~mem204#1, main_~_hj_i~1#1, main_~_hj_j~1#1, main_~_hj_k~1#1, main_~_hj_key~1#1.base, main_~_hj_key~1#1.offset, main_#t~mem205#1.base, main_#t~mem205#1.offset, main_#t~mem206#1, main_#t~mem207#1.base, main_#t~mem207#1.offset, main_#t~mem208#1.base, main_#t~mem208#1.offset, main_#t~mem209#1.base, main_#t~mem209#1.offset, main_#t~mem210#1.base, main_#t~mem210#1.offset, main_#t~mem211#1.base, main_#t~mem211#1.offset, main_#t~mem212#1.base, main_#t~mem212#1.offset, main_#t~mem213#1.base, main_#t~mem213#1.offset, main_#t~mem214#1, main_#t~mem215#1, main_#t~mem216#1, main_#t~short217#1, main_#t~mem218#1.base, main_#t~mem218#1.offset, main_#t~ret219#1, main_#t~mem220#1.base, main_#t~mem220#1.offset, main_#t~mem221#1.base, main_#t~mem221#1.offset, main_#t~mem222#1.base, main_#t~mem222#1.offset, main_#t~mem223#1, main_~_hf_bkt~0#1, main_~_hf_hashv~0#1, main_#t~mem224#1.base, main_#t~mem224#1.offset, main_#t~mem225#1.base, main_#t~mem225#1.offset, main_#t~short226#1, main_#t~mem227#1.base, main_#t~mem227#1.offset, main_#t~mem228#1.base, main_#t~mem228#1.offset, main_#t~mem229#1.base, main_#t~mem229#1.offset, main_#t~mem230#1, main_#t~mem231#1.base, main_#t~mem231#1.offset, main_#t~mem232#1.base, main_#t~mem232#1.offset, main_#t~mem233#1.base, main_#t~mem233#1.offset, main_#t~mem234#1.base, main_#t~mem234#1.offset, main_#t~mem235#1.base, main_#t~mem235#1.offset, main_#t~mem236#1.base, main_#t~mem236#1.offset, main_#t~mem237#1, main_#t~mem238#1.base, main_#t~mem238#1.offset, main_#t~mem239#1.base, main_#t~mem239#1.offset, main_#t~mem240#1.base, main_#t~mem240#1.offset, main_#t~mem241#1, main_#t~mem242#1.base, main_#t~mem242#1.offset, main_#t~mem243#1.base, main_#t~mem243#1.offset, main_#t~mem244#1.base, main_#t~mem244#1.offset, main_#t~mem245#1.base, main_#t~mem245#1.offset, main_#t~mem246#1.base, main_#t~mem246#1.offset, main_#t~mem247#1, main_#t~mem248#1.base, main_#t~mem248#1.offset, main_#t~mem251#1, main_#t~mem249#1.base, main_#t~mem249#1.offset, main_#t~mem250#1, main_#t~mem252#1.base, main_#t~mem252#1.offset, main_#t~mem253#1.base, main_#t~mem253#1.offset, main_#t~mem254#1, main_#t~post255#1, main_#t~mem256#1.base, main_#t~mem256#1.offset, main_#t~mem257#1.base, main_#t~mem257#1.offset, main_#t~mem258#1.base, main_#t~mem258#1.offset, main_#t~mem259#1.base, main_#t~mem259#1.offset, main_#t~mem260#1.base, main_#t~mem260#1.offset, main_#t~mem261#1.base, main_#t~mem261#1.offset, main_#t~mem262#1.base, main_#t~mem262#1.offset, main_#t~mem263#1.base, main_#t~mem263#1.offset, main_~_hd_head~0#1.base, main_~_hd_head~0#1.offset, main_#t~mem264#1.base, main_#t~mem264#1.offset, main_#t~mem265#1, main_#t~post266#1, main_~_hd_bkt~0#1, main_~_hd_hh_del~0#1.base, main_~_hd_hh_del~0#1.offset, main_#t~mem178#1, main_#t~post179#1, main_#t~mem180#1, main_#t~mem267#1.base, main_#t~mem267#1.offset, main_~#i~0#1.base, main_~#i~0#1.offset, main_~user~0#1.base, main_~user~0#1.offset, main_~tmp~0#1.base, main_~tmp~0#1.offset, main_~users~0#1.base, main_~users~0#1.offset;call main_~#i~0#1.base, main_~#i~0#1.offset := #Ultimate.allocOnStack(4);havoc main_~user~0#1.base, main_~user~0#1.offset;havoc main_~tmp~0#1.base, main_~tmp~0#1.offset;main_~users~0#1.base, main_~users~0#1.offset := 0, 0;call write~int(0, main_~#i~0#1.base, main_~#i~0#1.offset, 4); {26610#(<= ~alt_malloc_balance~0 2147483645)} is VALID [2022-02-21 03:17:03,396 INFO L290 TraceCheckUtils]: 0: Hoare triple {26366#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(21, 2);~#alt_malloc_sizes~0.base, ~#alt_malloc_sizes~0.offset := 3, 0;call #Ultimate.allocInit(40, 3);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#alt_malloc_sizes~0.base);~alt_malloc_balance~0 := 0;~alt_memcmp_count~0 := 0;~alt_bzero_count~0 := 0; {26610#(<= ~alt_malloc_balance~0 2147483645)} is VALID [2022-02-21 03:17:03,396 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-21 03:17:03,396 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 03:17:03,396 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1723224699] [2022-02-21 03:17:03,396 WARN L317 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-02-21 03:17:03,396 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1709881534] [2022-02-21 03:17:03,396 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1709881534] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-21 03:17:03,397 INFO L191 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-02-21 03:17:03,397 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 7] total 13 [2022-02-21 03:17:03,397 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [782984945] [2022-02-21 03:17:03,397 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-02-21 03:17:03,397 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 9.076923076923077) internal successors, (118), 12 states have internal predecessors, (118), 4 states have call successors, (6), 5 states have call predecessors, (6), 4 states have return successors, (4), 2 states have call predecessors, (4), 4 states have call successors, (4) Word has length 64 [2022-02-21 03:17:03,398 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-21 03:17:03,398 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 14 states, 13 states have (on average 9.076923076923077) internal successors, (118), 12 states have internal predecessors, (118), 4 states have call successors, (6), 5 states have call predecessors, (6), 4 states have return successors, (4), 2 states have call predecessors, (4), 4 states have call successors, (4) [2022-02-21 03:17:03,509 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 128 edges. 128 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:17:03,510 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-02-21 03:17:03,510 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 03:17:03,510 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-02-21 03:17:03,510 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=136, Unknown=0, NotChecked=0, Total=182 [2022-02-21 03:17:03,510 INFO L87 Difference]: Start difference. First operand 640 states and 809 transitions. Second operand has 14 states, 13 states have (on average 9.076923076923077) internal successors, (118), 12 states have internal predecessors, (118), 4 states have call successors, (6), 5 states have call predecessors, (6), 4 states have return successors, (4), 2 states have call predecessors, (4), 4 states have call successors, (4) [2022-02-21 03:17:09,498 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:17:09,499 INFO L93 Difference]: Finished difference Result 2064 states and 2645 transitions. [2022-02-21 03:17:09,499 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2022-02-21 03:17:09,499 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 9.076923076923077) internal successors, (118), 12 states have internal predecessors, (118), 4 states have call successors, (6), 5 states have call predecessors, (6), 4 states have return successors, (4), 2 states have call predecessors, (4), 4 states have call successors, (4) Word has length 64 [2022-02-21 03:17:09,499 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-21 03:17:09,499 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 13 states have (on average 9.076923076923077) internal successors, (118), 12 states have internal predecessors, (118), 4 states have call successors, (6), 5 states have call predecessors, (6), 4 states have return successors, (4), 2 states have call predecessors, (4), 4 states have call successors, (4) [2022-02-21 03:17:09,505 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 1321 transitions. [2022-02-21 03:17:09,505 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 13 states have (on average 9.076923076923077) internal successors, (118), 12 states have internal predecessors, (118), 4 states have call successors, (6), 5 states have call predecessors, (6), 4 states have return successors, (4), 2 states have call predecessors, (4), 4 states have call successors, (4) [2022-02-21 03:17:09,510 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 1321 transitions. [2022-02-21 03:17:09,510 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 24 states and 1321 transitions. [2022-02-21 03:17:10,520 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 1321 edges. 1321 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:17:10,652 INFO L225 Difference]: With dead ends: 2064 [2022-02-21 03:17:10,652 INFO L226 Difference]: Without dead ends: 2062 [2022-02-21 03:17:10,653 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 145 GetRequests, 117 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 144 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=273, Invalid=597, Unknown=0, NotChecked=0, Total=870 [2022-02-21 03:17:10,653 INFO L933 BasicCegarLoop]: 621 mSDtfsCounter, 1748 mSDsluCounter, 3692 mSDsCounter, 0 mSdLazyCounter, 464 mSolverCounterSat, 200 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1755 SdHoareTripleChecker+Valid, 4313 SdHoareTripleChecker+Invalid, 664 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 200 IncrementalHoareTripleChecker+Valid, 464 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-02-21 03:17:10,653 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1755 Valid, 4313 Invalid, 664 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [200 Valid, 464 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2022-02-21 03:17:10,655 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2062 states. [2022-02-21 03:17:11,100 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2062 to 1830. [2022-02-21 03:17:11,101 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 03:17:11,103 INFO L82 GeneralOperation]: Start isEquivalent. First operand 2062 states. Second operand has 1830 states, 1738 states have (on average 1.2836593785960875) internal successors, (2231), 1755 states have internal predecessors, (2231), 60 states have call successors, (60), 24 states have call predecessors, (60), 19 states have return successors, (81), 51 states have call predecessors, (81), 60 states have call successors, (81) [2022-02-21 03:17:11,105 INFO L74 IsIncluded]: Start isIncluded. First operand 2062 states. Second operand has 1830 states, 1738 states have (on average 1.2836593785960875) internal successors, (2231), 1755 states have internal predecessors, (2231), 60 states have call successors, (60), 24 states have call predecessors, (60), 19 states have return successors, (81), 51 states have call predecessors, (81), 60 states have call successors, (81) [2022-02-21 03:17:11,107 INFO L87 Difference]: Start difference. First operand 2062 states. Second operand has 1830 states, 1738 states have (on average 1.2836593785960875) internal successors, (2231), 1755 states have internal predecessors, (2231), 60 states have call successors, (60), 24 states have call predecessors, (60), 19 states have return successors, (81), 51 states have call predecessors, (81), 60 states have call successors, (81) [2022-02-21 03:17:11,215 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:17:11,216 INFO L93 Difference]: Finished difference Result 2062 states and 2631 transitions. [2022-02-21 03:17:11,216 INFO L276 IsEmpty]: Start isEmpty. Operand 2062 states and 2631 transitions. [2022-02-21 03:17:11,220 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:17:11,221 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:17:11,223 INFO L74 IsIncluded]: Start isIncluded. First operand has 1830 states, 1738 states have (on average 1.2836593785960875) internal successors, (2231), 1755 states have internal predecessors, (2231), 60 states have call successors, (60), 24 states have call predecessors, (60), 19 states have return successors, (81), 51 states have call predecessors, (81), 60 states have call successors, (81) Second operand 2062 states. [2022-02-21 03:17:11,225 INFO L87 Difference]: Start difference. First operand has 1830 states, 1738 states have (on average 1.2836593785960875) internal successors, (2231), 1755 states have internal predecessors, (2231), 60 states have call successors, (60), 24 states have call predecessors, (60), 19 states have return successors, (81), 51 states have call predecessors, (81), 60 states have call successors, (81) Second operand 2062 states. [2022-02-21 03:17:11,335 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:17:11,335 INFO L93 Difference]: Finished difference Result 2062 states and 2631 transitions. [2022-02-21 03:17:11,336 INFO L276 IsEmpty]: Start isEmpty. Operand 2062 states and 2631 transitions. [2022-02-21 03:17:11,339 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:17:11,339 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:17:11,339 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 03:17:11,339 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 03:17:11,342 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1830 states, 1738 states have (on average 1.2836593785960875) internal successors, (2231), 1755 states have internal predecessors, (2231), 60 states have call successors, (60), 24 states have call predecessors, (60), 19 states have return successors, (81), 51 states have call predecessors, (81), 60 states have call successors, (81) [2022-02-21 03:17:11,445 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1830 states to 1830 states and 2372 transitions. [2022-02-21 03:17:11,445 INFO L78 Accepts]: Start accepts. Automaton has 1830 states and 2372 transitions. Word has length 64 [2022-02-21 03:17:11,445 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-21 03:17:11,445 INFO L470 AbstractCegarLoop]: Abstraction has 1830 states and 2372 transitions. [2022-02-21 03:17:11,445 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 9.076923076923077) internal successors, (118), 12 states have internal predecessors, (118), 4 states have call successors, (6), 5 states have call predecessors, (6), 4 states have return successors, (4), 2 states have call predecessors, (4), 4 states have call successors, (4) [2022-02-21 03:17:11,446 INFO L276 IsEmpty]: Start isEmpty. Operand 1830 states and 2372 transitions. [2022-02-21 03:17:11,446 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2022-02-21 03:17:11,446 INFO L506 BasicCegarLoop]: Found error trace [2022-02-21 03:17:11,446 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-21 03:17:11,464 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2022-02-21 03:17:11,646 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-21 03:17:11,647 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting alt_bzeroErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [alt_mallocErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, alt_mallocErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, alt_freeErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2022-02-21 03:17:11,647 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:17:11,647 INFO L85 PathProgramCache]: Analyzing trace with hash -1176759637, now seen corresponding path program 1 times [2022-02-21 03:17:11,647 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:17:11,648 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [597566255] [2022-02-21 03:17:11,648 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:17:11,648 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:17:11,684 ERROR L252 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-02-21 03:17:11,685 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2104253537] [2022-02-21 03:17:11,685 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:17:11,685 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-21 03:17:11,685 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:17:11,686 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-02-21 03:17:11,687 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2022-02-21 03:17:11,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:17:11,993 INFO L263 TraceCheckSpWp]: Trace formula consists of 635 conjuncts, 7 conjunts are in the unsatisfiable core [2022-02-21 03:17:12,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:17:12,028 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 03:17:12,298 INFO L290 TraceCheckUtils]: 0: Hoare triple {35500#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(21, 2);~#alt_malloc_sizes~0.base, ~#alt_malloc_sizes~0.offset := 3, 0;call #Ultimate.allocInit(40, 3);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#alt_malloc_sizes~0.base);~alt_malloc_balance~0 := 0;~alt_memcmp_count~0 := 0;~alt_bzero_count~0 := 0; {35505#(<= ~alt_bzero_count~0 0)} is VALID [2022-02-21 03:17:12,298 INFO L290 TraceCheckUtils]: 1: Hoare triple {35505#(<= ~alt_bzero_count~0 0)} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret43#1.base, main_#t~ret43#1.offset, main_#t~mem44#1, main_#t~mem45#1, main_#t~mem46#1, main_#t~mem48#1, main_#t~mem47#1, main_#t~mem49#1, main_#t~mem50#1, main_#t~mem52#1, main_#t~mem51#1, main_#t~mem53#1, main_#t~mem54#1, main_#t~mem56#1, main_#t~mem55#1, main_#t~mem57#1, main_#t~mem58#1, main_#t~switch59#1, main_#t~mem60#1, main_#t~mem61#1, main_#t~mem62#1, main_#t~mem63#1, main_#t~mem64#1, main_#t~mem65#1, main_#t~mem66#1, main_#t~mem67#1, main_#t~mem68#1, main_#t~mem69#1, main_#t~mem70#1, main_~_hj_i~0#1, main_~_hj_j~0#1, main_~_hj_k~0#1, main_~_hj_key~0#1.base, main_~_hj_key~0#1.offset, main_#t~ret71#1.base, main_#t~ret71#1.offset, main_#t~mem72#1.base, main_#t~mem72#1.offset, main_#t~mem73#1.base, main_#t~mem73#1.offset, main_#t~mem74#1.base, main_#t~mem74#1.offset, main_#t~mem75#1.base, main_#t~mem75#1.offset, main_#t~mem76#1.base, main_#t~mem76#1.offset, main_#t~mem77#1.base, main_#t~mem77#1.offset, main_#t~mem78#1.base, main_#t~mem78#1.offset, main_#t~ret79#1.base, main_#t~ret79#1.offset, main_#t~mem80#1.base, main_#t~mem80#1.offset, main_#t~mem81#1.base, main_#t~mem81#1.offset, main_#t~mem82#1.base, main_#t~mem82#1.offset, main_#t~mem83#1.base, main_#t~mem83#1.offset, main_#t~mem84#1.base, main_#t~mem84#1.offset, main_#t~mem85#1.base, main_#t~mem85#1.offset, main_#t~mem86#1.base, main_#t~mem86#1.offset, main_#t~mem87#1.base, main_#t~mem87#1.offset, main_#t~mem88#1.base, main_#t~mem88#1.offset, main_#t~mem89#1.base, main_#t~mem89#1.offset, main_#t~mem90#1, main_#t~mem91#1.base, main_#t~mem91#1.offset, main_#t~mem92#1.base, main_#t~mem92#1.offset, main_#t~mem93#1.base, main_#t~mem93#1.offset, main_#t~mem94#1.base, main_#t~mem94#1.offset, main_#t~mem95#1, main_#t~post96#1, main_#t~mem97#1.base, main_#t~mem97#1.offset, main_#t~mem98#1, main_#t~mem99#1.base, main_#t~mem99#1.offset, main_#t~mem100#1.base, main_#t~mem100#1.offset, main_#t~mem101#1, main_#t~post102#1, main_#t~mem103#1.base, main_#t~mem103#1.offset, main_#t~mem104#1.base, main_#t~mem104#1.offset, main_#t~mem105#1.base, main_#t~mem105#1.offset, main_#t~mem107#1, main_#t~mem106#1, main_#t~mem108#1.base, main_#t~mem108#1.offset, main_#t~mem109#1, main_#t~short110#1, main_#t~mem111#1.base, main_#t~mem111#1.offset, main_#t~mem112#1, main_#t~ret113#1.base, main_#t~ret113#1.offset, main_#t~mem114#1.base, main_#t~mem114#1.offset, main_#t~mem115#1.base, main_#t~mem115#1.offset, main_#t~mem116#1.base, main_#t~mem116#1.offset, main_#t~mem117#1, main_#t~mem118#1.base, main_#t~mem118#1.offset, main_#t~mem119#1.base, main_#t~mem119#1.offset, main_#t~mem122#1, main_#t~mem120#1.base, main_#t~mem120#1.offset, main_#t~mem121#1, main_#t~mem123#1.base, main_#t~mem123#1.offset, main_#t~mem126#1, main_#t~mem124#1.base, main_#t~mem124#1.offset, main_#t~mem125#1, main_#t~ite127#1, main_#t~mem128#1.base, main_#t~mem128#1.offset, main_#t~mem132#1.base, main_#t~mem132#1.offset, main_#t~mem133#1.base, main_#t~mem133#1.offset, main_#t~mem134#1.base, main_#t~mem134#1.offset, main_#t~mem135#1.base, main_#t~mem135#1.offset, main_#t~mem138#1, main_#t~mem136#1.base, main_#t~mem136#1.offset, main_#t~mem137#1, main_#t~mem139#1.base, main_#t~mem139#1.offset, main_#t~mem140#1, main_#t~pre141#1, main_#t~mem142#1.base, main_#t~mem142#1.offset, main_#t~mem143#1, main_#t~mem144#1.base, main_#t~mem144#1.offset, main_#t~mem145#1, main_#t~post146#1, main_#t~mem150#1, main_#t~mem148#1, main_#t~mem147#1.base, main_#t~mem147#1.offset, main_#t~mem149#1, main_#t~mem151#1, main_#t~post152#1, main_#t~mem153#1.base, main_#t~mem153#1.offset, main_#t~mem154#1.base, main_#t~mem154#1.offset, main_#t~mem155#1.base, main_#t~mem155#1.offset, main_#t~post129#1, main_#t~mem130#1.base, main_#t~mem130#1.offset, main_#t~mem131#1, main_#t~mem156#1.base, main_#t~mem156#1.offset, main_#t~mem157#1.base, main_#t~mem157#1.offset, main_#t~mem158#1.base, main_#t~mem158#1.offset, main_#t~mem159#1, main_#t~mem160#1.base, main_#t~mem160#1.offset, main_#t~mem161#1, main_#t~mem162#1.base, main_#t~mem162#1.offset, main_#t~mem163#1, main_#t~post164#1, main_#t~mem165#1.base, main_#t~mem165#1.offset, main_#t~mem166#1.base, main_#t~mem166#1.offset, main_#t~mem167#1.base, main_#t~mem167#1.offset, main_#t~mem168#1.base, main_#t~mem168#1.offset, main_#t~mem171#1, main_#t~mem169#1.base, main_#t~mem169#1.offset, main_#t~mem170#1, main_#t~ite174#1, main_#t~mem172#1.base, main_#t~mem172#1.offset, main_#t~mem173#1, main_#t~mem175#1.base, main_#t~mem175#1.offset, main_#t~mem176#1, main_#t~mem177#1.base, main_#t~mem177#1.offset, main_~_he_bkt~0#1, main_~_he_bkt_i~0#1, main_~_he_thh~0#1.base, main_~_he_thh~0#1.offset, main_~_he_hh_nxt~0#1.base, main_~_he_hh_nxt~0#1.offset, main_~#_he_new_buckets~0#1.base, main_~#_he_new_buckets~0#1.offset, main_~_he_newbkt~0#1.base, main_~_he_newbkt~0#1.offset, main_~_ha_head~0#1.base, main_~_ha_head~0#1.offset, main_~_ha_bkt~0#1, main_~_ha_hashv~0#1, main_#t~mem40#1, main_#t~post41#1, main_#t~mem42#1, main_#t~mem182#1, main_#t~mem181#1, main_#t~mem183#1, main_#t~mem184#1, main_#t~mem186#1, main_#t~mem185#1, main_#t~mem187#1, main_#t~mem188#1, main_#t~mem190#1, main_#t~mem189#1, main_#t~mem191#1, main_#t~mem192#1, main_#t~switch193#1, main_#t~mem194#1, main_#t~mem195#1, main_#t~mem196#1, main_#t~mem197#1, main_#t~mem198#1, main_#t~mem199#1, main_#t~mem200#1, main_#t~mem201#1, main_#t~mem202#1, main_#t~mem203#1, main_#t~mem204#1, main_~_hj_i~1#1, main_~_hj_j~1#1, main_~_hj_k~1#1, main_~_hj_key~1#1.base, main_~_hj_key~1#1.offset, main_#t~mem205#1.base, main_#t~mem205#1.offset, main_#t~mem206#1, main_#t~mem207#1.base, main_#t~mem207#1.offset, main_#t~mem208#1.base, main_#t~mem208#1.offset, main_#t~mem209#1.base, main_#t~mem209#1.offset, main_#t~mem210#1.base, main_#t~mem210#1.offset, main_#t~mem211#1.base, main_#t~mem211#1.offset, main_#t~mem212#1.base, main_#t~mem212#1.offset, main_#t~mem213#1.base, main_#t~mem213#1.offset, main_#t~mem214#1, main_#t~mem215#1, main_#t~mem216#1, main_#t~short217#1, main_#t~mem218#1.base, main_#t~mem218#1.offset, main_#t~ret219#1, main_#t~mem220#1.base, main_#t~mem220#1.offset, main_#t~mem221#1.base, main_#t~mem221#1.offset, main_#t~mem222#1.base, main_#t~mem222#1.offset, main_#t~mem223#1, main_~_hf_bkt~0#1, main_~_hf_hashv~0#1, main_#t~mem224#1.base, main_#t~mem224#1.offset, main_#t~mem225#1.base, main_#t~mem225#1.offset, main_#t~short226#1, main_#t~mem227#1.base, main_#t~mem227#1.offset, main_#t~mem228#1.base, main_#t~mem228#1.offset, main_#t~mem229#1.base, main_#t~mem229#1.offset, main_#t~mem230#1, main_#t~mem231#1.base, main_#t~mem231#1.offset, main_#t~mem232#1.base, main_#t~mem232#1.offset, main_#t~mem233#1.base, main_#t~mem233#1.offset, main_#t~mem234#1.base, main_#t~mem234#1.offset, main_#t~mem235#1.base, main_#t~mem235#1.offset, main_#t~mem236#1.base, main_#t~mem236#1.offset, main_#t~mem237#1, main_#t~mem238#1.base, main_#t~mem238#1.offset, main_#t~mem239#1.base, main_#t~mem239#1.offset, main_#t~mem240#1.base, main_#t~mem240#1.offset, main_#t~mem241#1, main_#t~mem242#1.base, main_#t~mem242#1.offset, main_#t~mem243#1.base, main_#t~mem243#1.offset, main_#t~mem244#1.base, main_#t~mem244#1.offset, main_#t~mem245#1.base, main_#t~mem245#1.offset, main_#t~mem246#1.base, main_#t~mem246#1.offset, main_#t~mem247#1, main_#t~mem248#1.base, main_#t~mem248#1.offset, main_#t~mem251#1, main_#t~mem249#1.base, main_#t~mem249#1.offset, main_#t~mem250#1, main_#t~mem252#1.base, main_#t~mem252#1.offset, main_#t~mem253#1.base, main_#t~mem253#1.offset, main_#t~mem254#1, main_#t~post255#1, main_#t~mem256#1.base, main_#t~mem256#1.offset, main_#t~mem257#1.base, main_#t~mem257#1.offset, main_#t~mem258#1.base, main_#t~mem258#1.offset, main_#t~mem259#1.base, main_#t~mem259#1.offset, main_#t~mem260#1.base, main_#t~mem260#1.offset, main_#t~mem261#1.base, main_#t~mem261#1.offset, main_#t~mem262#1.base, main_#t~mem262#1.offset, main_#t~mem263#1.base, main_#t~mem263#1.offset, main_~_hd_head~0#1.base, main_~_hd_head~0#1.offset, main_#t~mem264#1.base, main_#t~mem264#1.offset, main_#t~mem265#1, main_#t~post266#1, main_~_hd_bkt~0#1, main_~_hd_hh_del~0#1.base, main_~_hd_hh_del~0#1.offset, main_#t~mem178#1, main_#t~post179#1, main_#t~mem180#1, main_#t~mem267#1.base, main_#t~mem267#1.offset, main_~#i~0#1.base, main_~#i~0#1.offset, main_~user~0#1.base, main_~user~0#1.offset, main_~tmp~0#1.base, main_~tmp~0#1.offset, main_~users~0#1.base, main_~users~0#1.offset;call main_~#i~0#1.base, main_~#i~0#1.offset := #Ultimate.allocOnStack(4);havoc main_~user~0#1.base, main_~user~0#1.offset;havoc main_~tmp~0#1.base, main_~tmp~0#1.offset;main_~users~0#1.base, main_~users~0#1.offset := 0, 0;call write~int(0, main_~#i~0#1.base, main_~#i~0#1.offset, 4); {35505#(<= ~alt_bzero_count~0 0)} is VALID [2022-02-21 03:17:12,298 INFO L290 TraceCheckUtils]: 2: Hoare triple {35505#(<= ~alt_bzero_count~0 0)} call main_#t~mem42#1 := read~int(main_~#i~0#1.base, main_~#i~0#1.offset, 4); {35505#(<= ~alt_bzero_count~0 0)} is VALID [2022-02-21 03:17:12,299 INFO L290 TraceCheckUtils]: 3: Hoare triple {35505#(<= ~alt_bzero_count~0 0)} assume !!(main_#t~mem42#1 < 10);havoc main_#t~mem42#1;assume { :begin_inline_real_malloc } true;real_malloc_#in~n#1 := 40;havoc real_malloc_#res#1.base, real_malloc_#res#1.offset;havoc real_malloc_#t~malloc39#1.base, real_malloc_#t~malloc39#1.offset, real_malloc_~n#1;real_malloc_~n#1 := real_malloc_#in~n#1;call real_malloc_#t~malloc39#1.base, real_malloc_#t~malloc39#1.offset := #Ultimate.allocOnHeap(real_malloc_~n#1);real_malloc_#res#1.base, real_malloc_#res#1.offset := real_malloc_#t~malloc39#1.base, real_malloc_#t~malloc39#1.offset;havoc real_malloc_#t~malloc39#1.base, real_malloc_#t~malloc39#1.offset; {35505#(<= ~alt_bzero_count~0 0)} is VALID [2022-02-21 03:17:12,299 INFO L290 TraceCheckUtils]: 4: Hoare triple {35505#(<= ~alt_bzero_count~0 0)} main_#t~ret43#1.base, main_#t~ret43#1.offset := real_malloc_#res#1.base, real_malloc_#res#1.offset;assume { :end_inline_real_malloc } true;main_~user~0#1.base, main_~user~0#1.offset := main_#t~ret43#1.base, main_#t~ret43#1.offset;havoc main_#t~ret43#1.base, main_#t~ret43#1.offset; {35505#(<= ~alt_bzero_count~0 0)} is VALID [2022-02-21 03:17:12,299 INFO L290 TraceCheckUtils]: 5: Hoare triple {35505#(<= ~alt_bzero_count~0 0)} assume !(main_~user~0#1.base == 0 && main_~user~0#1.offset == 0); {35505#(<= ~alt_bzero_count~0 0)} is VALID [2022-02-21 03:17:12,300 INFO L290 TraceCheckUtils]: 6: Hoare triple {35505#(<= ~alt_bzero_count~0 0)} call main_#t~mem44#1 := read~int(main_~#i~0#1.base, main_~#i~0#1.offset, 4);call write~int(main_#t~mem44#1, main_~user~0#1.base, main_~user~0#1.offset, 4);havoc main_#t~mem44#1;call main_#t~mem45#1 := read~int(main_~#i~0#1.base, main_~#i~0#1.offset, 4);call main_#t~mem46#1 := read~int(main_~#i~0#1.base, main_~#i~0#1.offset, 4); {35505#(<= ~alt_bzero_count~0 0)} is VALID [2022-02-21 03:17:12,300 INFO L290 TraceCheckUtils]: 7: Hoare triple {35505#(<= ~alt_bzero_count~0 0)} assume main_#t~mem45#1 * main_#t~mem46#1 <= 2147483647; {35505#(<= ~alt_bzero_count~0 0)} is VALID [2022-02-21 03:17:12,314 INFO L290 TraceCheckUtils]: 8: Hoare triple {35505#(<= ~alt_bzero_count~0 0)} assume main_#t~mem45#1 * main_#t~mem46#1 >= -2147483648;call write~int(main_#t~mem45#1 * main_#t~mem46#1, main_~user~0#1.base, 4 + main_~user~0#1.offset, 4);havoc main_#t~mem45#1;havoc main_#t~mem46#1; {35505#(<= ~alt_bzero_count~0 0)} is VALID [2022-02-21 03:17:12,315 INFO L290 TraceCheckUtils]: 9: Hoare triple {35505#(<= ~alt_bzero_count~0 0)} havoc main_~_ha_hashv~0#1; {35505#(<= ~alt_bzero_count~0 0)} is VALID [2022-02-21 03:17:12,315 INFO L290 TraceCheckUtils]: 10: Hoare triple {35505#(<= ~alt_bzero_count~0 0)} goto; {35505#(<= ~alt_bzero_count~0 0)} is VALID [2022-02-21 03:17:12,315 INFO L290 TraceCheckUtils]: 11: Hoare triple {35505#(<= ~alt_bzero_count~0 0)} havoc main_~_hj_i~0#1;havoc main_~_hj_j~0#1;havoc main_~_hj_k~0#1;main_~_hj_key~0#1.base, main_~_hj_key~0#1.offset := main_~user~0#1.base, main_~user~0#1.offset;main_~_ha_hashv~0#1 := 4276993775;main_~_hj_j~0#1 := 2654435769;main_~_hj_i~0#1 := main_~_hj_j~0#1;main_~_hj_k~0#1 := 4; {35505#(<= ~alt_bzero_count~0 0)} is VALID [2022-02-21 03:17:12,316 INFO L290 TraceCheckUtils]: 12: Hoare triple {35505#(<= ~alt_bzero_count~0 0)} assume !(main_~_hj_k~0#1 % 4294967296 >= 12); {35505#(<= ~alt_bzero_count~0 0)} is VALID [2022-02-21 03:17:12,316 INFO L290 TraceCheckUtils]: 13: Hoare triple {35505#(<= ~alt_bzero_count~0 0)} main_~_ha_hashv~0#1 := 4 + main_~_ha_hashv~0#1;main_#t~switch59#1 := 11 == main_~_hj_k~0#1; {35505#(<= ~alt_bzero_count~0 0)} is VALID [2022-02-21 03:17:12,316 INFO L290 TraceCheckUtils]: 14: Hoare triple {35505#(<= ~alt_bzero_count~0 0)} assume !main_#t~switch59#1; {35505#(<= ~alt_bzero_count~0 0)} is VALID [2022-02-21 03:17:12,316 INFO L290 TraceCheckUtils]: 15: Hoare triple {35505#(<= ~alt_bzero_count~0 0)} main_#t~switch59#1 := main_#t~switch59#1 || 10 == main_~_hj_k~0#1; {35505#(<= ~alt_bzero_count~0 0)} is VALID [2022-02-21 03:17:12,317 INFO L290 TraceCheckUtils]: 16: Hoare triple {35505#(<= ~alt_bzero_count~0 0)} assume !main_#t~switch59#1; {35505#(<= ~alt_bzero_count~0 0)} is VALID [2022-02-21 03:17:12,317 INFO L290 TraceCheckUtils]: 17: Hoare triple {35505#(<= ~alt_bzero_count~0 0)} main_#t~switch59#1 := main_#t~switch59#1 || 9 == main_~_hj_k~0#1; {35505#(<= ~alt_bzero_count~0 0)} is VALID [2022-02-21 03:17:12,317 INFO L290 TraceCheckUtils]: 18: Hoare triple {35505#(<= ~alt_bzero_count~0 0)} assume !main_#t~switch59#1; {35505#(<= ~alt_bzero_count~0 0)} is VALID [2022-02-21 03:17:12,318 INFO L290 TraceCheckUtils]: 19: Hoare triple {35505#(<= ~alt_bzero_count~0 0)} main_#t~switch59#1 := main_#t~switch59#1 || 8 == main_~_hj_k~0#1; {35505#(<= ~alt_bzero_count~0 0)} is VALID [2022-02-21 03:17:12,318 INFO L290 TraceCheckUtils]: 20: Hoare triple {35505#(<= ~alt_bzero_count~0 0)} assume !main_#t~switch59#1; {35505#(<= ~alt_bzero_count~0 0)} is VALID [2022-02-21 03:17:12,318 INFO L290 TraceCheckUtils]: 21: Hoare triple {35505#(<= ~alt_bzero_count~0 0)} main_#t~switch59#1 := main_#t~switch59#1 || 7 == main_~_hj_k~0#1; {35505#(<= ~alt_bzero_count~0 0)} is VALID [2022-02-21 03:17:12,318 INFO L290 TraceCheckUtils]: 22: Hoare triple {35505#(<= ~alt_bzero_count~0 0)} assume !main_#t~switch59#1; {35505#(<= ~alt_bzero_count~0 0)} is VALID [2022-02-21 03:17:12,319 INFO L290 TraceCheckUtils]: 23: Hoare triple {35505#(<= ~alt_bzero_count~0 0)} main_#t~switch59#1 := main_#t~switch59#1 || 6 == main_~_hj_k~0#1; {35505#(<= ~alt_bzero_count~0 0)} is VALID [2022-02-21 03:17:12,319 INFO L290 TraceCheckUtils]: 24: Hoare triple {35505#(<= ~alt_bzero_count~0 0)} assume !main_#t~switch59#1; {35505#(<= ~alt_bzero_count~0 0)} is VALID [2022-02-21 03:17:12,319 INFO L290 TraceCheckUtils]: 25: Hoare triple {35505#(<= ~alt_bzero_count~0 0)} main_#t~switch59#1 := main_#t~switch59#1 || 5 == main_~_hj_k~0#1; {35505#(<= ~alt_bzero_count~0 0)} is VALID [2022-02-21 03:17:12,319 INFO L290 TraceCheckUtils]: 26: Hoare triple {35505#(<= ~alt_bzero_count~0 0)} assume !main_#t~switch59#1; {35505#(<= ~alt_bzero_count~0 0)} is VALID [2022-02-21 03:17:12,320 INFO L290 TraceCheckUtils]: 27: Hoare triple {35505#(<= ~alt_bzero_count~0 0)} main_#t~switch59#1 := main_#t~switch59#1 || 4 == main_~_hj_k~0#1; {35505#(<= ~alt_bzero_count~0 0)} is VALID [2022-02-21 03:17:12,320 INFO L290 TraceCheckUtils]: 28: Hoare triple {35505#(<= ~alt_bzero_count~0 0)} assume main_#t~switch59#1;call main_#t~mem67#1 := read~int(main_~_hj_key~0#1.base, 3 + main_~_hj_key~0#1.offset, 1);main_~_hj_i~0#1 := main_~_hj_i~0#1 + 16777216 * (main_#t~mem67#1 % 256);havoc main_#t~mem67#1; {35505#(<= ~alt_bzero_count~0 0)} is VALID [2022-02-21 03:17:12,320 INFO L290 TraceCheckUtils]: 29: Hoare triple {35505#(<= ~alt_bzero_count~0 0)} main_#t~switch59#1 := main_#t~switch59#1 || 3 == main_~_hj_k~0#1; {35505#(<= ~alt_bzero_count~0 0)} is VALID [2022-02-21 03:17:12,320 INFO L290 TraceCheckUtils]: 30: Hoare triple {35505#(<= ~alt_bzero_count~0 0)} assume main_#t~switch59#1;call main_#t~mem68#1 := read~int(main_~_hj_key~0#1.base, 2 + main_~_hj_key~0#1.offset, 1);main_~_hj_i~0#1 := main_~_hj_i~0#1 + 65536 * (main_#t~mem68#1 % 256);havoc main_#t~mem68#1; {35505#(<= ~alt_bzero_count~0 0)} is VALID [2022-02-21 03:17:12,321 INFO L290 TraceCheckUtils]: 31: Hoare triple {35505#(<= ~alt_bzero_count~0 0)} main_#t~switch59#1 := main_#t~switch59#1 || 2 == main_~_hj_k~0#1; {35505#(<= ~alt_bzero_count~0 0)} is VALID [2022-02-21 03:17:12,321 INFO L290 TraceCheckUtils]: 32: Hoare triple {35505#(<= ~alt_bzero_count~0 0)} assume main_#t~switch59#1;call main_#t~mem69#1 := read~int(main_~_hj_key~0#1.base, 1 + main_~_hj_key~0#1.offset, 1);main_~_hj_i~0#1 := main_~_hj_i~0#1 + 256 * (main_#t~mem69#1 % 256);havoc main_#t~mem69#1; {35505#(<= ~alt_bzero_count~0 0)} is VALID [2022-02-21 03:17:12,321 INFO L290 TraceCheckUtils]: 33: Hoare triple {35505#(<= ~alt_bzero_count~0 0)} main_#t~switch59#1 := main_#t~switch59#1 || 1 == main_~_hj_k~0#1; {35505#(<= ~alt_bzero_count~0 0)} is VALID [2022-02-21 03:17:12,322 INFO L290 TraceCheckUtils]: 34: Hoare triple {35505#(<= ~alt_bzero_count~0 0)} assume main_#t~switch59#1;call main_#t~mem70#1 := read~int(main_~_hj_key~0#1.base, main_~_hj_key~0#1.offset, 1);main_~_hj_i~0#1 := main_~_hj_i~0#1 + main_#t~mem70#1 % 256;havoc main_#t~mem70#1; {35505#(<= ~alt_bzero_count~0 0)} is VALID [2022-02-21 03:17:12,322 INFO L290 TraceCheckUtils]: 35: Hoare triple {35505#(<= ~alt_bzero_count~0 0)} havoc main_#t~switch59#1; {35505#(<= ~alt_bzero_count~0 0)} is VALID [2022-02-21 03:17:12,322 INFO L290 TraceCheckUtils]: 36: Hoare triple {35505#(<= ~alt_bzero_count~0 0)} main_~_hj_i~0#1 := main_~_hj_i~0#1 - main_~_hj_j~0#1;main_~_hj_i~0#1 := main_~_hj_i~0#1 - main_~_ha_hashv~0#1;main_~_hj_i~0#1 := (if (1 == main_~_hj_i~0#1 || 0 == main_~_hj_i~0#1) && (1 == main_~_ha_hashv~0#1 / 8192 || 0 == main_~_ha_hashv~0#1 / 8192) then (if main_~_hj_i~0#1 == main_~_ha_hashv~0#1 / 8192 then 0 else 1) else (if 0 == main_~_hj_i~0#1 then main_~_ha_hashv~0#1 / 8192 else (if 0 == main_~_ha_hashv~0#1 / 8192 then main_~_hj_i~0#1 else ~bitwiseXOr(main_~_hj_i~0#1, main_~_ha_hashv~0#1 / 8192))));main_~_hj_j~0#1 := main_~_hj_j~0#1 - main_~_ha_hashv~0#1;main_~_hj_j~0#1 := main_~_hj_j~0#1 - main_~_hj_i~0#1;main_~_hj_j~0#1 := (if (1 == main_~_hj_j~0#1 || 0 == main_~_hj_j~0#1) && (1 == 256 * main_~_hj_i~0#1 || 0 == 256 * main_~_hj_i~0#1) then (if main_~_hj_j~0#1 == 256 * main_~_hj_i~0#1 then 0 else 1) else (if 0 == main_~_hj_j~0#1 then 256 * main_~_hj_i~0#1 else (if 0 == 256 * main_~_hj_i~0#1 then main_~_hj_j~0#1 else ~bitwiseXOr(main_~_hj_j~0#1, 256 * main_~_hj_i~0#1))));main_~_ha_hashv~0#1 := main_~_ha_hashv~0#1 - main_~_hj_i~0#1;main_~_ha_hashv~0#1 := main_~_ha_hashv~0#1 - main_~_hj_j~0#1;main_~_ha_hashv~0#1 := (if (1 == main_~_ha_hashv~0#1 || 0 == main_~_ha_hashv~0#1) && (1 == main_~_hj_j~0#1 / 8192 || 0 == main_~_hj_j~0#1 / 8192) then (if main_~_ha_hashv~0#1 == main_~_hj_j~0#1 / 8192 then 0 else 1) else (if 0 == main_~_ha_hashv~0#1 then main_~_hj_j~0#1 / 8192 else (if 0 == main_~_hj_j~0#1 / 8192 then main_~_ha_hashv~0#1 else ~bitwiseXOr(main_~_ha_hashv~0#1, main_~_hj_j~0#1 / 8192))));main_~_hj_i~0#1 := main_~_hj_i~0#1 - main_~_hj_j~0#1;main_~_hj_i~0#1 := main_~_hj_i~0#1 - main_~_ha_hashv~0#1;main_~_hj_i~0#1 := (if (1 == main_~_hj_i~0#1 || 0 == main_~_hj_i~0#1) && (1 == main_~_ha_hashv~0#1 / 4096 || 0 == main_~_ha_hashv~0#1 / 4096) then (if main_~_hj_i~0#1 == main_~_ha_hashv~0#1 / 4096 then 0 else 1) else (if 0 == main_~_hj_i~0#1 then main_~_ha_hashv~0#1 / 4096 else (if 0 == main_~_ha_hashv~0#1 / 4096 then main_~_hj_i~0#1 else ~bitwiseXOr(main_~_hj_i~0#1, main_~_ha_hashv~0#1 / 4096))));main_~_hj_j~0#1 := main_~_hj_j~0#1 - main_~_ha_hashv~0#1;main_~_hj_j~0#1 := main_~_hj_j~0#1 - main_~_hj_i~0#1;main_~_hj_j~0#1 := (if (1 == main_~_hj_j~0#1 || 0 == main_~_hj_j~0#1) && (1 == 65536 * main_~_hj_i~0#1 || 0 == 65536 * main_~_hj_i~0#1) then (if main_~_hj_j~0#1 == 65536 * main_~_hj_i~0#1 then 0 else 1) else (if 0 == main_~_hj_j~0#1 then 65536 * main_~_hj_i~0#1 else (if 0 == 65536 * main_~_hj_i~0#1 then main_~_hj_j~0#1 else ~bitwiseXOr(main_~_hj_j~0#1, 65536 * main_~_hj_i~0#1))));main_~_ha_hashv~0#1 := main_~_ha_hashv~0#1 - main_~_hj_i~0#1;main_~_ha_hashv~0#1 := main_~_ha_hashv~0#1 - main_~_hj_j~0#1;main_~_ha_hashv~0#1 := (if (1 == main_~_ha_hashv~0#1 || 0 == main_~_ha_hashv~0#1) && (1 == main_~_hj_j~0#1 / 32 || 0 == main_~_hj_j~0#1 / 32) then (if main_~_ha_hashv~0#1 == main_~_hj_j~0#1 / 32 then 0 else 1) else (if 0 == main_~_ha_hashv~0#1 then main_~_hj_j~0#1 / 32 else (if 0 == main_~_hj_j~0#1 / 32 then main_~_ha_hashv~0#1 else ~bitwiseXOr(main_~_ha_hashv~0#1, main_~_hj_j~0#1 / 32))));main_~_hj_i~0#1 := main_~_hj_i~0#1 - main_~_hj_j~0#1;main_~_hj_i~0#1 := main_~_hj_i~0#1 - main_~_ha_hashv~0#1;main_~_hj_i~0#1 := (if (1 == main_~_hj_i~0#1 || 0 == main_~_hj_i~0#1) && (1 == main_~_ha_hashv~0#1 / 8 || 0 == main_~_ha_hashv~0#1 / 8) then (if main_~_hj_i~0#1 == main_~_ha_hashv~0#1 / 8 then 0 else 1) else (if 0 == main_~_hj_i~0#1 then main_~_ha_hashv~0#1 / 8 else (if 0 == main_~_ha_hashv~0#1 / 8 then main_~_hj_i~0#1 else ~bitwiseXOr(main_~_hj_i~0#1, main_~_ha_hashv~0#1 / 8))));main_~_hj_j~0#1 := main_~_hj_j~0#1 - main_~_ha_hashv~0#1;main_~_hj_j~0#1 := main_~_hj_j~0#1 - main_~_hj_i~0#1;main_~_hj_j~0#1 := (if (1 == main_~_hj_j~0#1 || 0 == main_~_hj_j~0#1) && (1 == 1024 * main_~_hj_i~0#1 || 0 == 1024 * main_~_hj_i~0#1) then (if main_~_hj_j~0#1 == 1024 * main_~_hj_i~0#1 then 0 else 1) else (if 0 == main_~_hj_j~0#1 then 1024 * main_~_hj_i~0#1 else (if 0 == 1024 * main_~_hj_i~0#1 then main_~_hj_j~0#1 else ~bitwiseXOr(main_~_hj_j~0#1, 1024 * main_~_hj_i~0#1))));main_~_ha_hashv~0#1 := main_~_ha_hashv~0#1 - main_~_hj_i~0#1;main_~_ha_hashv~0#1 := main_~_ha_hashv~0#1 - main_~_hj_j~0#1;main_~_ha_hashv~0#1 := (if (1 == main_~_ha_hashv~0#1 || 0 == main_~_ha_hashv~0#1) && (1 == main_~_hj_j~0#1 / 32768 || 0 == main_~_hj_j~0#1 / 32768) then (if main_~_ha_hashv~0#1 == main_~_hj_j~0#1 / 32768 then 0 else 1) else (if 0 == main_~_ha_hashv~0#1 then main_~_hj_j~0#1 / 32768 else (if 0 == main_~_hj_j~0#1 / 32768 then main_~_ha_hashv~0#1 else ~bitwiseXOr(main_~_ha_hashv~0#1, main_~_hj_j~0#1 / 32768)))); {35505#(<= ~alt_bzero_count~0 0)} is VALID [2022-02-21 03:17:12,322 INFO L290 TraceCheckUtils]: 37: Hoare triple {35505#(<= ~alt_bzero_count~0 0)} goto; {35505#(<= ~alt_bzero_count~0 0)} is VALID [2022-02-21 03:17:12,323 INFO L290 TraceCheckUtils]: 38: Hoare triple {35505#(<= ~alt_bzero_count~0 0)} goto; {35505#(<= ~alt_bzero_count~0 0)} is VALID [2022-02-21 03:17:12,323 INFO L290 TraceCheckUtils]: 39: Hoare triple {35505#(<= ~alt_bzero_count~0 0)} goto; {35505#(<= ~alt_bzero_count~0 0)} is VALID [2022-02-21 03:17:12,323 INFO L290 TraceCheckUtils]: 40: Hoare triple {35505#(<= ~alt_bzero_count~0 0)} call write~int(main_~_ha_hashv~0#1, main_~user~0#1.base, 36 + main_~user~0#1.offset, 4);call write~$Pointer$(main_~user~0#1.base, main_~user~0#1.offset, main_~user~0#1.base, 28 + main_~user~0#1.offset, 4);call write~int(4, main_~user~0#1.base, 32 + main_~user~0#1.offset, 4); {35505#(<= ~alt_bzero_count~0 0)} is VALID [2022-02-21 03:17:12,323 INFO L290 TraceCheckUtils]: 41: Hoare triple {35505#(<= ~alt_bzero_count~0 0)} assume main_~users~0#1.base == 0 && main_~users~0#1.offset == 0;call write~$Pointer$(0, 0, main_~user~0#1.base, 16 + main_~user~0#1.offset, 4);call write~$Pointer$(0, 0, main_~user~0#1.base, 12 + main_~user~0#1.offset, 4); {35505#(<= ~alt_bzero_count~0 0)} is VALID [2022-02-21 03:17:12,324 INFO L272 TraceCheckUtils]: 42: Hoare triple {35505#(<= ~alt_bzero_count~0 0)} call main_#t~ret71#1.base, main_#t~ret71#1.offset := alt_malloc(44); {35505#(<= ~alt_bzero_count~0 0)} is VALID [2022-02-21 03:17:12,324 INFO L290 TraceCheckUtils]: 43: Hoare triple {35505#(<= ~alt_bzero_count~0 0)} ~sz := #in~sz;#t~post31 := ~alt_malloc_balance~0; {35505#(<= ~alt_bzero_count~0 0)} is VALID [2022-02-21 03:17:12,324 INFO L290 TraceCheckUtils]: 44: Hoare triple {35505#(<= ~alt_bzero_count~0 0)} assume 1 + #t~post31 <= 2147483647; {35505#(<= ~alt_bzero_count~0 0)} is VALID [2022-02-21 03:17:12,325 INFO L290 TraceCheckUtils]: 45: Hoare triple {35505#(<= ~alt_bzero_count~0 0)} assume 1 + #t~post31 >= -2147483648;~alt_malloc_balance~0 := 1 + #t~post31;call write~int(~sz, ~#alt_malloc_sizes~0.base, ~#alt_malloc_sizes~0.offset + 4 * #t~post31, 4);havoc #t~post31; {35505#(<= ~alt_bzero_count~0 0)} is VALID [2022-02-21 03:17:12,325 INFO L290 TraceCheckUtils]: 46: Hoare triple {35505#(<= ~alt_bzero_count~0 0)} assume !(1 == ~alt_malloc_balance~0); {35505#(<= ~alt_bzero_count~0 0)} is VALID [2022-02-21 03:17:12,325 INFO L290 TraceCheckUtils]: 47: Hoare triple {35505#(<= ~alt_bzero_count~0 0)} call #t~malloc32.base, #t~malloc32.offset := #Ultimate.allocOnHeap(~sz);#res.base, #res.offset := #t~malloc32.base, #t~malloc32.offset;havoc #t~malloc32.base, #t~malloc32.offset; {35505#(<= ~alt_bzero_count~0 0)} is VALID [2022-02-21 03:17:12,325 INFO L290 TraceCheckUtils]: 48: Hoare triple {35505#(<= ~alt_bzero_count~0 0)} assume true; {35505#(<= ~alt_bzero_count~0 0)} is VALID [2022-02-21 03:17:12,326 INFO L284 TraceCheckUtils]: 49: Hoare quadruple {35505#(<= ~alt_bzero_count~0 0)} {35505#(<= ~alt_bzero_count~0 0)} #855#return; {35505#(<= ~alt_bzero_count~0 0)} is VALID [2022-02-21 03:17:12,326 INFO L290 TraceCheckUtils]: 50: Hoare triple {35505#(<= ~alt_bzero_count~0 0)} call write~$Pointer$(main_#t~ret71#1.base, main_#t~ret71#1.offset, main_~user~0#1.base, 8 + main_~user~0#1.offset, 4);havoc main_#t~ret71#1.base, main_#t~ret71#1.offset;call main_#t~mem72#1.base, main_#t~mem72#1.offset := read~$Pointer$(main_~user~0#1.base, 8 + main_~user~0#1.offset, 4); {35505#(<= ~alt_bzero_count~0 0)} is VALID [2022-02-21 03:17:12,326 INFO L290 TraceCheckUtils]: 51: Hoare triple {35505#(<= ~alt_bzero_count~0 0)} assume !(main_#t~mem72#1.base == 0 && main_#t~mem72#1.offset == 0);havoc main_#t~mem72#1.base, main_#t~mem72#1.offset;call main_#t~mem73#1.base, main_#t~mem73#1.offset := read~$Pointer$(main_~user~0#1.base, 8 + main_~user~0#1.offset, 4); {35505#(<= ~alt_bzero_count~0 0)} is VALID [2022-02-21 03:17:12,327 INFO L272 TraceCheckUtils]: 52: Hoare triple {35505#(<= ~alt_bzero_count~0 0)} call alt_bzero(main_#t~mem73#1.base, main_#t~mem73#1.offset, 44); {35662#(<= ~alt_bzero_count~0 |old(~alt_bzero_count~0)|)} is VALID [2022-02-21 03:17:12,327 INFO L290 TraceCheckUtils]: 53: Hoare triple {35662#(<= ~alt_bzero_count~0 |old(~alt_bzero_count~0)|)} ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; {35662#(<= ~alt_bzero_count~0 |old(~alt_bzero_count~0)|)} is VALID [2022-02-21 03:17:12,328 INFO L290 TraceCheckUtils]: 54: Hoare triple {35662#(<= ~alt_bzero_count~0 |old(~alt_bzero_count~0)|)} assume 1 + ~alt_bzero_count~0 <= 2147483647; {35662#(<= ~alt_bzero_count~0 |old(~alt_bzero_count~0)|)} is VALID [2022-02-21 03:17:12,329 INFO L290 TraceCheckUtils]: 55: Hoare triple {35662#(<= ~alt_bzero_count~0 |old(~alt_bzero_count~0)|)} assume 1 + ~alt_bzero_count~0 >= -2147483648;#t~pre37#1 := 1 + ~alt_bzero_count~0;~alt_bzero_count~0 := 1 + ~alt_bzero_count~0;havoc #t~pre37#1;assume { :begin_inline_#Ultimate.C_memset } true;#Ultimate.C_memset_#ptr#1.base, #Ultimate.C_memset_#ptr#1.offset, #Ultimate.C_memset_#value#1, #Ultimate.C_memset_#amount#1 := ~a#1.base, ~a#1.offset, 0, ~n#1;havoc #Ultimate.C_memset_#res#1.base, #Ultimate.C_memset_#res#1.offset;havoc #Ultimate.C_memset_#t~loopctr269#1;#Ultimate.C_memset_#t~loopctr269#1 := 0; {35672#(<= ~alt_bzero_count~0 (+ |old(~alt_bzero_count~0)| 1))} is VALID [2022-02-21 03:17:12,329 INFO L290 TraceCheckUtils]: 56: Hoare triple {35672#(<= ~alt_bzero_count~0 (+ |old(~alt_bzero_count~0)| 1))} assume !(#Ultimate.C_memset_#t~loopctr269#1 % 4294967296 < #Ultimate.C_memset_#amount#1 % 4294967296); {35672#(<= ~alt_bzero_count~0 (+ |old(~alt_bzero_count~0)| 1))} is VALID [2022-02-21 03:17:12,329 INFO L290 TraceCheckUtils]: 57: Hoare triple {35672#(<= ~alt_bzero_count~0 (+ |old(~alt_bzero_count~0)| 1))} assume #Ultimate.C_memset_#res#1.base == #Ultimate.C_memset_#ptr#1.base && #Ultimate.C_memset_#res#1.offset == #Ultimate.C_memset_#ptr#1.offset;#t~memset~res38#1.base, #t~memset~res38#1.offset := #Ultimate.C_memset_#res#1.base, #Ultimate.C_memset_#res#1.offset;assume { :end_inline_#Ultimate.C_memset } true;havoc #t~memset~res38#1.base, #t~memset~res38#1.offset; {35672#(<= ~alt_bzero_count~0 (+ |old(~alt_bzero_count~0)| 1))} is VALID [2022-02-21 03:17:12,330 INFO L290 TraceCheckUtils]: 58: Hoare triple {35672#(<= ~alt_bzero_count~0 (+ |old(~alt_bzero_count~0)| 1))} assume true; {35672#(<= ~alt_bzero_count~0 (+ |old(~alt_bzero_count~0)| 1))} is VALID [2022-02-21 03:17:12,330 INFO L284 TraceCheckUtils]: 59: Hoare quadruple {35672#(<= ~alt_bzero_count~0 (+ |old(~alt_bzero_count~0)| 1))} {35505#(<= ~alt_bzero_count~0 0)} #857#return; {35685#(<= ~alt_bzero_count~0 1)} is VALID [2022-02-21 03:17:12,331 INFO L290 TraceCheckUtils]: 60: Hoare triple {35685#(<= ~alt_bzero_count~0 1)} havoc main_#t~mem73#1.base, main_#t~mem73#1.offset;call main_#t~mem74#1.base, main_#t~mem74#1.offset := read~$Pointer$(main_~user~0#1.base, 8 + main_~user~0#1.offset, 4);call write~$Pointer$(main_~user~0#1.base, 8 + main_~user~0#1.offset, main_#t~mem74#1.base, 16 + main_#t~mem74#1.offset, 4);havoc main_#t~mem74#1.base, main_#t~mem74#1.offset;call main_#t~mem75#1.base, main_#t~mem75#1.offset := read~$Pointer$(main_~user~0#1.base, 8 + main_~user~0#1.offset, 4);call write~int(32, main_#t~mem75#1.base, 4 + main_#t~mem75#1.offset, 4);havoc main_#t~mem75#1.base, main_#t~mem75#1.offset;call main_#t~mem76#1.base, main_#t~mem76#1.offset := read~$Pointer$(main_~user~0#1.base, 8 + main_~user~0#1.offset, 4);call write~int(5, main_#t~mem76#1.base, 8 + main_#t~mem76#1.offset, 4);havoc main_#t~mem76#1.base, main_#t~mem76#1.offset;call main_#t~mem77#1.base, main_#t~mem77#1.offset := read~$Pointer$(main_~user~0#1.base, 8 + main_~user~0#1.offset, 4);call write~int((if 8 + main_~user~0#1.offset - main_~user~0#1.offset < 0 && 0 != (8 + main_~user~0#1.offset - main_~user~0#1.offset) % 1 then 1 + (8 + main_~user~0#1.offset - main_~user~0#1.offset) / 1 else (8 + main_~user~0#1.offset - main_~user~0#1.offset) / 1), main_#t~mem77#1.base, 20 + main_#t~mem77#1.offset, 4);havoc main_#t~mem77#1.base, main_#t~mem77#1.offset;call main_#t~mem78#1.base, main_#t~mem78#1.offset := read~$Pointer$(main_~user~0#1.base, 8 + main_~user~0#1.offset, 4); {35685#(<= ~alt_bzero_count~0 1)} is VALID [2022-02-21 03:17:12,331 INFO L272 TraceCheckUtils]: 61: Hoare triple {35685#(<= ~alt_bzero_count~0 1)} call main_#t~ret79#1.base, main_#t~ret79#1.offset := alt_malloc(384); {35685#(<= ~alt_bzero_count~0 1)} is VALID [2022-02-21 03:17:12,331 INFO L290 TraceCheckUtils]: 62: Hoare triple {35685#(<= ~alt_bzero_count~0 1)} ~sz := #in~sz;#t~post31 := ~alt_malloc_balance~0; {35685#(<= ~alt_bzero_count~0 1)} is VALID [2022-02-21 03:17:12,331 INFO L290 TraceCheckUtils]: 63: Hoare triple {35685#(<= ~alt_bzero_count~0 1)} assume 1 + #t~post31 <= 2147483647; {35685#(<= ~alt_bzero_count~0 1)} is VALID [2022-02-21 03:17:12,332 INFO L290 TraceCheckUtils]: 64: Hoare triple {35685#(<= ~alt_bzero_count~0 1)} assume 1 + #t~post31 >= -2147483648;~alt_malloc_balance~0 := 1 + #t~post31;call write~int(~sz, ~#alt_malloc_sizes~0.base, ~#alt_malloc_sizes~0.offset + 4 * #t~post31, 4);havoc #t~post31; {35685#(<= ~alt_bzero_count~0 1)} is VALID [2022-02-21 03:17:12,332 INFO L290 TraceCheckUtils]: 65: Hoare triple {35685#(<= ~alt_bzero_count~0 1)} assume !(1 == ~alt_malloc_balance~0); {35685#(<= ~alt_bzero_count~0 1)} is VALID [2022-02-21 03:17:12,332 INFO L290 TraceCheckUtils]: 66: Hoare triple {35685#(<= ~alt_bzero_count~0 1)} call #t~malloc32.base, #t~malloc32.offset := #Ultimate.allocOnHeap(~sz);#res.base, #res.offset := #t~malloc32.base, #t~malloc32.offset;havoc #t~malloc32.base, #t~malloc32.offset; {35685#(<= ~alt_bzero_count~0 1)} is VALID [2022-02-21 03:17:12,333 INFO L290 TraceCheckUtils]: 67: Hoare triple {35685#(<= ~alt_bzero_count~0 1)} assume true; {35685#(<= ~alt_bzero_count~0 1)} is VALID [2022-02-21 03:17:12,333 INFO L284 TraceCheckUtils]: 68: Hoare quadruple {35685#(<= ~alt_bzero_count~0 1)} {35685#(<= ~alt_bzero_count~0 1)} #859#return; {35685#(<= ~alt_bzero_count~0 1)} is VALID [2022-02-21 03:17:12,339 INFO L290 TraceCheckUtils]: 69: Hoare triple {35685#(<= ~alt_bzero_count~0 1)} call write~$Pointer$(main_#t~ret79#1.base, main_#t~ret79#1.offset, main_#t~mem78#1.base, main_#t~mem78#1.offset, 4);havoc main_#t~mem78#1.base, main_#t~mem78#1.offset;havoc main_#t~ret79#1.base, main_#t~ret79#1.offset;call main_#t~mem80#1.base, main_#t~mem80#1.offset := read~$Pointer$(main_~user~0#1.base, 8 + main_~user~0#1.offset, 4);call write~int(2685476833, main_#t~mem80#1.base, 40 + main_#t~mem80#1.offset, 4);havoc main_#t~mem80#1.base, main_#t~mem80#1.offset;call main_#t~mem81#1.base, main_#t~mem81#1.offset := read~$Pointer$(main_~user~0#1.base, 8 + main_~user~0#1.offset, 4);call main_#t~mem82#1.base, main_#t~mem82#1.offset := read~$Pointer$(main_#t~mem81#1.base, main_#t~mem81#1.offset, 4); {35685#(<= ~alt_bzero_count~0 1)} is VALID [2022-02-21 03:17:12,339 INFO L290 TraceCheckUtils]: 70: Hoare triple {35685#(<= ~alt_bzero_count~0 1)} assume !(main_#t~mem82#1.base == 0 && main_#t~mem82#1.offset == 0);havoc main_#t~mem81#1.base, main_#t~mem81#1.offset;havoc main_#t~mem82#1.base, main_#t~mem82#1.offset;call main_#t~mem84#1.base, main_#t~mem84#1.offset := read~$Pointer$(main_~user~0#1.base, 8 + main_~user~0#1.offset, 4);call main_#t~mem85#1.base, main_#t~mem85#1.offset := read~$Pointer$(main_#t~mem84#1.base, main_#t~mem84#1.offset, 4); {35685#(<= ~alt_bzero_count~0 1)} is VALID [2022-02-21 03:17:12,340 INFO L272 TraceCheckUtils]: 71: Hoare triple {35685#(<= ~alt_bzero_count~0 1)} call alt_bzero(main_#t~mem85#1.base, main_#t~mem85#1.offset, 384); {35685#(<= ~alt_bzero_count~0 1)} is VALID [2022-02-21 03:17:12,340 INFO L290 TraceCheckUtils]: 72: Hoare triple {35685#(<= ~alt_bzero_count~0 1)} ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; {35685#(<= ~alt_bzero_count~0 1)} is VALID [2022-02-21 03:17:12,341 INFO L290 TraceCheckUtils]: 73: Hoare triple {35685#(<= ~alt_bzero_count~0 1)} assume !(1 + ~alt_bzero_count~0 <= 2147483647); {35501#false} is VALID [2022-02-21 03:17:12,341 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-21 03:17:12,341 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-21 03:17:12,702 INFO L290 TraceCheckUtils]: 73: Hoare triple {35728#(<= ~alt_bzero_count~0 2147483646)} assume !(1 + ~alt_bzero_count~0 <= 2147483647); {35501#false} is VALID [2022-02-21 03:17:12,703 INFO L290 TraceCheckUtils]: 72: Hoare triple {35728#(<= ~alt_bzero_count~0 2147483646)} ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; {35728#(<= ~alt_bzero_count~0 2147483646)} is VALID [2022-02-21 03:17:12,704 INFO L272 TraceCheckUtils]: 71: Hoare triple {35728#(<= ~alt_bzero_count~0 2147483646)} call alt_bzero(main_#t~mem85#1.base, main_#t~mem85#1.offset, 384); {35728#(<= ~alt_bzero_count~0 2147483646)} is VALID [2022-02-21 03:17:12,704 INFO L290 TraceCheckUtils]: 70: Hoare triple {35728#(<= ~alt_bzero_count~0 2147483646)} assume !(main_#t~mem82#1.base == 0 && main_#t~mem82#1.offset == 0);havoc main_#t~mem81#1.base, main_#t~mem81#1.offset;havoc main_#t~mem82#1.base, main_#t~mem82#1.offset;call main_#t~mem84#1.base, main_#t~mem84#1.offset := read~$Pointer$(main_~user~0#1.base, 8 + main_~user~0#1.offset, 4);call main_#t~mem85#1.base, main_#t~mem85#1.offset := read~$Pointer$(main_#t~mem84#1.base, main_#t~mem84#1.offset, 4); {35728#(<= ~alt_bzero_count~0 2147483646)} is VALID [2022-02-21 03:17:12,704 INFO L290 TraceCheckUtils]: 69: Hoare triple {35728#(<= ~alt_bzero_count~0 2147483646)} call write~$Pointer$(main_#t~ret79#1.base, main_#t~ret79#1.offset, main_#t~mem78#1.base, main_#t~mem78#1.offset, 4);havoc main_#t~mem78#1.base, main_#t~mem78#1.offset;havoc main_#t~ret79#1.base, main_#t~ret79#1.offset;call main_#t~mem80#1.base, main_#t~mem80#1.offset := read~$Pointer$(main_~user~0#1.base, 8 + main_~user~0#1.offset, 4);call write~int(2685476833, main_#t~mem80#1.base, 40 + main_#t~mem80#1.offset, 4);havoc main_#t~mem80#1.base, main_#t~mem80#1.offset;call main_#t~mem81#1.base, main_#t~mem81#1.offset := read~$Pointer$(main_~user~0#1.base, 8 + main_~user~0#1.offset, 4);call main_#t~mem82#1.base, main_#t~mem82#1.offset := read~$Pointer$(main_#t~mem81#1.base, main_#t~mem81#1.offset, 4); {35728#(<= ~alt_bzero_count~0 2147483646)} is VALID [2022-02-21 03:17:12,705 INFO L284 TraceCheckUtils]: 68: Hoare quadruple {35500#true} {35728#(<= ~alt_bzero_count~0 2147483646)} #859#return; {35728#(<= ~alt_bzero_count~0 2147483646)} is VALID [2022-02-21 03:17:12,705 INFO L290 TraceCheckUtils]: 67: Hoare triple {35500#true} assume true; {35500#true} is VALID [2022-02-21 03:17:12,705 INFO L290 TraceCheckUtils]: 66: Hoare triple {35500#true} call #t~malloc32.base, #t~malloc32.offset := #Ultimate.allocOnHeap(~sz);#res.base, #res.offset := #t~malloc32.base, #t~malloc32.offset;havoc #t~malloc32.base, #t~malloc32.offset; {35500#true} is VALID [2022-02-21 03:17:12,705 INFO L290 TraceCheckUtils]: 65: Hoare triple {35500#true} assume !(1 == ~alt_malloc_balance~0); {35500#true} is VALID [2022-02-21 03:17:12,705 INFO L290 TraceCheckUtils]: 64: Hoare triple {35500#true} assume 1 + #t~post31 >= -2147483648;~alt_malloc_balance~0 := 1 + #t~post31;call write~int(~sz, ~#alt_malloc_sizes~0.base, ~#alt_malloc_sizes~0.offset + 4 * #t~post31, 4);havoc #t~post31; {35500#true} is VALID [2022-02-21 03:17:12,705 INFO L290 TraceCheckUtils]: 63: Hoare triple {35500#true} assume 1 + #t~post31 <= 2147483647; {35500#true} is VALID [2022-02-21 03:17:12,705 INFO L290 TraceCheckUtils]: 62: Hoare triple {35500#true} ~sz := #in~sz;#t~post31 := ~alt_malloc_balance~0; {35500#true} is VALID [2022-02-21 03:17:12,705 INFO L272 TraceCheckUtils]: 61: Hoare triple {35728#(<= ~alt_bzero_count~0 2147483646)} call main_#t~ret79#1.base, main_#t~ret79#1.offset := alt_malloc(384); {35500#true} is VALID [2022-02-21 03:17:12,705 INFO L290 TraceCheckUtils]: 60: Hoare triple {35728#(<= ~alt_bzero_count~0 2147483646)} havoc main_#t~mem73#1.base, main_#t~mem73#1.offset;call main_#t~mem74#1.base, main_#t~mem74#1.offset := read~$Pointer$(main_~user~0#1.base, 8 + main_~user~0#1.offset, 4);call write~$Pointer$(main_~user~0#1.base, 8 + main_~user~0#1.offset, main_#t~mem74#1.base, 16 + main_#t~mem74#1.offset, 4);havoc main_#t~mem74#1.base, main_#t~mem74#1.offset;call main_#t~mem75#1.base, main_#t~mem75#1.offset := read~$Pointer$(main_~user~0#1.base, 8 + main_~user~0#1.offset, 4);call write~int(32, main_#t~mem75#1.base, 4 + main_#t~mem75#1.offset, 4);havoc main_#t~mem75#1.base, main_#t~mem75#1.offset;call main_#t~mem76#1.base, main_#t~mem76#1.offset := read~$Pointer$(main_~user~0#1.base, 8 + main_~user~0#1.offset, 4);call write~int(5, main_#t~mem76#1.base, 8 + main_#t~mem76#1.offset, 4);havoc main_#t~mem76#1.base, main_#t~mem76#1.offset;call main_#t~mem77#1.base, main_#t~mem77#1.offset := read~$Pointer$(main_~user~0#1.base, 8 + main_~user~0#1.offset, 4);call write~int((if 8 + main_~user~0#1.offset - main_~user~0#1.offset < 0 && 0 != (8 + main_~user~0#1.offset - main_~user~0#1.offset) % 1 then 1 + (8 + main_~user~0#1.offset - main_~user~0#1.offset) / 1 else (8 + main_~user~0#1.offset - main_~user~0#1.offset) / 1), main_#t~mem77#1.base, 20 + main_#t~mem77#1.offset, 4);havoc main_#t~mem77#1.base, main_#t~mem77#1.offset;call main_#t~mem78#1.base, main_#t~mem78#1.offset := read~$Pointer$(main_~user~0#1.base, 8 + main_~user~0#1.offset, 4); {35728#(<= ~alt_bzero_count~0 2147483646)} is VALID [2022-02-21 03:17:12,706 INFO L284 TraceCheckUtils]: 59: Hoare quadruple {35775#(or (< 2147483645 |old(~alt_bzero_count~0)|) (<= ~alt_bzero_count~0 2147483646))} {35771#(<= ~alt_bzero_count~0 2147483645)} #857#return; {35728#(<= ~alt_bzero_count~0 2147483646)} is VALID [2022-02-21 03:17:12,706 INFO L290 TraceCheckUtils]: 58: Hoare triple {35775#(or (< 2147483645 |old(~alt_bzero_count~0)|) (<= ~alt_bzero_count~0 2147483646))} assume true; {35775#(or (< 2147483645 |old(~alt_bzero_count~0)|) (<= ~alt_bzero_count~0 2147483646))} is VALID [2022-02-21 03:17:12,707 INFO L290 TraceCheckUtils]: 57: Hoare triple {35775#(or (< 2147483645 |old(~alt_bzero_count~0)|) (<= ~alt_bzero_count~0 2147483646))} assume #Ultimate.C_memset_#res#1.base == #Ultimate.C_memset_#ptr#1.base && #Ultimate.C_memset_#res#1.offset == #Ultimate.C_memset_#ptr#1.offset;#t~memset~res38#1.base, #t~memset~res38#1.offset := #Ultimate.C_memset_#res#1.base, #Ultimate.C_memset_#res#1.offset;assume { :end_inline_#Ultimate.C_memset } true;havoc #t~memset~res38#1.base, #t~memset~res38#1.offset; {35775#(or (< 2147483645 |old(~alt_bzero_count~0)|) (<= ~alt_bzero_count~0 2147483646))} is VALID [2022-02-21 03:17:12,707 INFO L290 TraceCheckUtils]: 56: Hoare triple {35775#(or (< 2147483645 |old(~alt_bzero_count~0)|) (<= ~alt_bzero_count~0 2147483646))} assume !(#Ultimate.C_memset_#t~loopctr269#1 % 4294967296 < #Ultimate.C_memset_#amount#1 % 4294967296); {35775#(or (< 2147483645 |old(~alt_bzero_count~0)|) (<= ~alt_bzero_count~0 2147483646))} is VALID [2022-02-21 03:17:12,708 INFO L290 TraceCheckUtils]: 55: Hoare triple {35788#(or (< 2147483645 |old(~alt_bzero_count~0)|) (<= ~alt_bzero_count~0 2147483645))} assume 1 + ~alt_bzero_count~0 >= -2147483648;#t~pre37#1 := 1 + ~alt_bzero_count~0;~alt_bzero_count~0 := 1 + ~alt_bzero_count~0;havoc #t~pre37#1;assume { :begin_inline_#Ultimate.C_memset } true;#Ultimate.C_memset_#ptr#1.base, #Ultimate.C_memset_#ptr#1.offset, #Ultimate.C_memset_#value#1, #Ultimate.C_memset_#amount#1 := ~a#1.base, ~a#1.offset, 0, ~n#1;havoc #Ultimate.C_memset_#res#1.base, #Ultimate.C_memset_#res#1.offset;havoc #Ultimate.C_memset_#t~loopctr269#1;#Ultimate.C_memset_#t~loopctr269#1 := 0; {35775#(or (< 2147483645 |old(~alt_bzero_count~0)|) (<= ~alt_bzero_count~0 2147483646))} is VALID [2022-02-21 03:17:12,708 INFO L290 TraceCheckUtils]: 54: Hoare triple {35788#(or (< 2147483645 |old(~alt_bzero_count~0)|) (<= ~alt_bzero_count~0 2147483645))} assume 1 + ~alt_bzero_count~0 <= 2147483647; {35788#(or (< 2147483645 |old(~alt_bzero_count~0)|) (<= ~alt_bzero_count~0 2147483645))} is VALID [2022-02-21 03:17:12,708 INFO L290 TraceCheckUtils]: 53: Hoare triple {35788#(or (< 2147483645 |old(~alt_bzero_count~0)|) (<= ~alt_bzero_count~0 2147483645))} ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; {35788#(or (< 2147483645 |old(~alt_bzero_count~0)|) (<= ~alt_bzero_count~0 2147483645))} is VALID [2022-02-21 03:17:12,709 INFO L272 TraceCheckUtils]: 52: Hoare triple {35771#(<= ~alt_bzero_count~0 2147483645)} call alt_bzero(main_#t~mem73#1.base, main_#t~mem73#1.offset, 44); {35788#(or (< 2147483645 |old(~alt_bzero_count~0)|) (<= ~alt_bzero_count~0 2147483645))} is VALID [2022-02-21 03:17:12,709 INFO L290 TraceCheckUtils]: 51: Hoare triple {35771#(<= ~alt_bzero_count~0 2147483645)} assume !(main_#t~mem72#1.base == 0 && main_#t~mem72#1.offset == 0);havoc main_#t~mem72#1.base, main_#t~mem72#1.offset;call main_#t~mem73#1.base, main_#t~mem73#1.offset := read~$Pointer$(main_~user~0#1.base, 8 + main_~user~0#1.offset, 4); {35771#(<= ~alt_bzero_count~0 2147483645)} is VALID [2022-02-21 03:17:12,709 INFO L290 TraceCheckUtils]: 50: Hoare triple {35771#(<= ~alt_bzero_count~0 2147483645)} call write~$Pointer$(main_#t~ret71#1.base, main_#t~ret71#1.offset, main_~user~0#1.base, 8 + main_~user~0#1.offset, 4);havoc main_#t~ret71#1.base, main_#t~ret71#1.offset;call main_#t~mem72#1.base, main_#t~mem72#1.offset := read~$Pointer$(main_~user~0#1.base, 8 + main_~user~0#1.offset, 4); {35771#(<= ~alt_bzero_count~0 2147483645)} is VALID [2022-02-21 03:17:12,710 INFO L284 TraceCheckUtils]: 49: Hoare quadruple {35500#true} {35771#(<= ~alt_bzero_count~0 2147483645)} #855#return; {35771#(<= ~alt_bzero_count~0 2147483645)} is VALID [2022-02-21 03:17:12,710 INFO L290 TraceCheckUtils]: 48: Hoare triple {35500#true} assume true; {35500#true} is VALID [2022-02-21 03:17:12,710 INFO L290 TraceCheckUtils]: 47: Hoare triple {35500#true} call #t~malloc32.base, #t~malloc32.offset := #Ultimate.allocOnHeap(~sz);#res.base, #res.offset := #t~malloc32.base, #t~malloc32.offset;havoc #t~malloc32.base, #t~malloc32.offset; {35500#true} is VALID [2022-02-21 03:17:12,710 INFO L290 TraceCheckUtils]: 46: Hoare triple {35500#true} assume !(1 == ~alt_malloc_balance~0); {35500#true} is VALID [2022-02-21 03:17:12,710 INFO L290 TraceCheckUtils]: 45: Hoare triple {35500#true} assume 1 + #t~post31 >= -2147483648;~alt_malloc_balance~0 := 1 + #t~post31;call write~int(~sz, ~#alt_malloc_sizes~0.base, ~#alt_malloc_sizes~0.offset + 4 * #t~post31, 4);havoc #t~post31; {35500#true} is VALID [2022-02-21 03:17:12,710 INFO L290 TraceCheckUtils]: 44: Hoare triple {35500#true} assume 1 + #t~post31 <= 2147483647; {35500#true} is VALID [2022-02-21 03:17:12,710 INFO L290 TraceCheckUtils]: 43: Hoare triple {35500#true} ~sz := #in~sz;#t~post31 := ~alt_malloc_balance~0; {35500#true} is VALID [2022-02-21 03:17:12,710 INFO L272 TraceCheckUtils]: 42: Hoare triple {35771#(<= ~alt_bzero_count~0 2147483645)} call main_#t~ret71#1.base, main_#t~ret71#1.offset := alt_malloc(44); {35500#true} is VALID [2022-02-21 03:17:12,711 INFO L290 TraceCheckUtils]: 41: Hoare triple {35771#(<= ~alt_bzero_count~0 2147483645)} assume main_~users~0#1.base == 0 && main_~users~0#1.offset == 0;call write~$Pointer$(0, 0, main_~user~0#1.base, 16 + main_~user~0#1.offset, 4);call write~$Pointer$(0, 0, main_~user~0#1.base, 12 + main_~user~0#1.offset, 4); {35771#(<= ~alt_bzero_count~0 2147483645)} is VALID [2022-02-21 03:17:12,711 INFO L290 TraceCheckUtils]: 40: Hoare triple {35771#(<= ~alt_bzero_count~0 2147483645)} call write~int(main_~_ha_hashv~0#1, main_~user~0#1.base, 36 + main_~user~0#1.offset, 4);call write~$Pointer$(main_~user~0#1.base, main_~user~0#1.offset, main_~user~0#1.base, 28 + main_~user~0#1.offset, 4);call write~int(4, main_~user~0#1.base, 32 + main_~user~0#1.offset, 4); {35771#(<= ~alt_bzero_count~0 2147483645)} is VALID [2022-02-21 03:17:12,711 INFO L290 TraceCheckUtils]: 39: Hoare triple {35771#(<= ~alt_bzero_count~0 2147483645)} goto; {35771#(<= ~alt_bzero_count~0 2147483645)} is VALID [2022-02-21 03:17:12,711 INFO L290 TraceCheckUtils]: 38: Hoare triple {35771#(<= ~alt_bzero_count~0 2147483645)} goto; {35771#(<= ~alt_bzero_count~0 2147483645)} is VALID [2022-02-21 03:17:12,712 INFO L290 TraceCheckUtils]: 37: Hoare triple {35771#(<= ~alt_bzero_count~0 2147483645)} goto; {35771#(<= ~alt_bzero_count~0 2147483645)} is VALID [2022-02-21 03:17:12,712 INFO L290 TraceCheckUtils]: 36: Hoare triple {35771#(<= ~alt_bzero_count~0 2147483645)} main_~_hj_i~0#1 := main_~_hj_i~0#1 - main_~_hj_j~0#1;main_~_hj_i~0#1 := main_~_hj_i~0#1 - main_~_ha_hashv~0#1;main_~_hj_i~0#1 := (if (1 == main_~_hj_i~0#1 || 0 == main_~_hj_i~0#1) && (1 == main_~_ha_hashv~0#1 / 8192 || 0 == main_~_ha_hashv~0#1 / 8192) then (if main_~_hj_i~0#1 == main_~_ha_hashv~0#1 / 8192 then 0 else 1) else (if 0 == main_~_hj_i~0#1 then main_~_ha_hashv~0#1 / 8192 else (if 0 == main_~_ha_hashv~0#1 / 8192 then main_~_hj_i~0#1 else ~bitwiseXOr(main_~_hj_i~0#1, main_~_ha_hashv~0#1 / 8192))));main_~_hj_j~0#1 := main_~_hj_j~0#1 - main_~_ha_hashv~0#1;main_~_hj_j~0#1 := main_~_hj_j~0#1 - main_~_hj_i~0#1;main_~_hj_j~0#1 := (if (1 == main_~_hj_j~0#1 || 0 == main_~_hj_j~0#1) && (1 == 256 * main_~_hj_i~0#1 || 0 == 256 * main_~_hj_i~0#1) then (if main_~_hj_j~0#1 == 256 * main_~_hj_i~0#1 then 0 else 1) else (if 0 == main_~_hj_j~0#1 then 256 * main_~_hj_i~0#1 else (if 0 == 256 * main_~_hj_i~0#1 then main_~_hj_j~0#1 else ~bitwiseXOr(main_~_hj_j~0#1, 256 * main_~_hj_i~0#1))));main_~_ha_hashv~0#1 := main_~_ha_hashv~0#1 - main_~_hj_i~0#1;main_~_ha_hashv~0#1 := main_~_ha_hashv~0#1 - main_~_hj_j~0#1;main_~_ha_hashv~0#1 := (if (1 == main_~_ha_hashv~0#1 || 0 == main_~_ha_hashv~0#1) && (1 == main_~_hj_j~0#1 / 8192 || 0 == main_~_hj_j~0#1 / 8192) then (if main_~_ha_hashv~0#1 == main_~_hj_j~0#1 / 8192 then 0 else 1) else (if 0 == main_~_ha_hashv~0#1 then main_~_hj_j~0#1 / 8192 else (if 0 == main_~_hj_j~0#1 / 8192 then main_~_ha_hashv~0#1 else ~bitwiseXOr(main_~_ha_hashv~0#1, main_~_hj_j~0#1 / 8192))));main_~_hj_i~0#1 := main_~_hj_i~0#1 - main_~_hj_j~0#1;main_~_hj_i~0#1 := main_~_hj_i~0#1 - main_~_ha_hashv~0#1;main_~_hj_i~0#1 := (if (1 == main_~_hj_i~0#1 || 0 == main_~_hj_i~0#1) && (1 == main_~_ha_hashv~0#1 / 4096 || 0 == main_~_ha_hashv~0#1 / 4096) then (if main_~_hj_i~0#1 == main_~_ha_hashv~0#1 / 4096 then 0 else 1) else (if 0 == main_~_hj_i~0#1 then main_~_ha_hashv~0#1 / 4096 else (if 0 == main_~_ha_hashv~0#1 / 4096 then main_~_hj_i~0#1 else ~bitwiseXOr(main_~_hj_i~0#1, main_~_ha_hashv~0#1 / 4096))));main_~_hj_j~0#1 := main_~_hj_j~0#1 - main_~_ha_hashv~0#1;main_~_hj_j~0#1 := main_~_hj_j~0#1 - main_~_hj_i~0#1;main_~_hj_j~0#1 := (if (1 == main_~_hj_j~0#1 || 0 == main_~_hj_j~0#1) && (1 == 65536 * main_~_hj_i~0#1 || 0 == 65536 * main_~_hj_i~0#1) then (if main_~_hj_j~0#1 == 65536 * main_~_hj_i~0#1 then 0 else 1) else (if 0 == main_~_hj_j~0#1 then 65536 * main_~_hj_i~0#1 else (if 0 == 65536 * main_~_hj_i~0#1 then main_~_hj_j~0#1 else ~bitwiseXOr(main_~_hj_j~0#1, 65536 * main_~_hj_i~0#1))));main_~_ha_hashv~0#1 := main_~_ha_hashv~0#1 - main_~_hj_i~0#1;main_~_ha_hashv~0#1 := main_~_ha_hashv~0#1 - main_~_hj_j~0#1;main_~_ha_hashv~0#1 := (if (1 == main_~_ha_hashv~0#1 || 0 == main_~_ha_hashv~0#1) && (1 == main_~_hj_j~0#1 / 32 || 0 == main_~_hj_j~0#1 / 32) then (if main_~_ha_hashv~0#1 == main_~_hj_j~0#1 / 32 then 0 else 1) else (if 0 == main_~_ha_hashv~0#1 then main_~_hj_j~0#1 / 32 else (if 0 == main_~_hj_j~0#1 / 32 then main_~_ha_hashv~0#1 else ~bitwiseXOr(main_~_ha_hashv~0#1, main_~_hj_j~0#1 / 32))));main_~_hj_i~0#1 := main_~_hj_i~0#1 - main_~_hj_j~0#1;main_~_hj_i~0#1 := main_~_hj_i~0#1 - main_~_ha_hashv~0#1;main_~_hj_i~0#1 := (if (1 == main_~_hj_i~0#1 || 0 == main_~_hj_i~0#1) && (1 == main_~_ha_hashv~0#1 / 8 || 0 == main_~_ha_hashv~0#1 / 8) then (if main_~_hj_i~0#1 == main_~_ha_hashv~0#1 / 8 then 0 else 1) else (if 0 == main_~_hj_i~0#1 then main_~_ha_hashv~0#1 / 8 else (if 0 == main_~_ha_hashv~0#1 / 8 then main_~_hj_i~0#1 else ~bitwiseXOr(main_~_hj_i~0#1, main_~_ha_hashv~0#1 / 8))));main_~_hj_j~0#1 := main_~_hj_j~0#1 - main_~_ha_hashv~0#1;main_~_hj_j~0#1 := main_~_hj_j~0#1 - main_~_hj_i~0#1;main_~_hj_j~0#1 := (if (1 == main_~_hj_j~0#1 || 0 == main_~_hj_j~0#1) && (1 == 1024 * main_~_hj_i~0#1 || 0 == 1024 * main_~_hj_i~0#1) then (if main_~_hj_j~0#1 == 1024 * main_~_hj_i~0#1 then 0 else 1) else (if 0 == main_~_hj_j~0#1 then 1024 * main_~_hj_i~0#1 else (if 0 == 1024 * main_~_hj_i~0#1 then main_~_hj_j~0#1 else ~bitwiseXOr(main_~_hj_j~0#1, 1024 * main_~_hj_i~0#1))));main_~_ha_hashv~0#1 := main_~_ha_hashv~0#1 - main_~_hj_i~0#1;main_~_ha_hashv~0#1 := main_~_ha_hashv~0#1 - main_~_hj_j~0#1;main_~_ha_hashv~0#1 := (if (1 == main_~_ha_hashv~0#1 || 0 == main_~_ha_hashv~0#1) && (1 == main_~_hj_j~0#1 / 32768 || 0 == main_~_hj_j~0#1 / 32768) then (if main_~_ha_hashv~0#1 == main_~_hj_j~0#1 / 32768 then 0 else 1) else (if 0 == main_~_ha_hashv~0#1 then main_~_hj_j~0#1 / 32768 else (if 0 == main_~_hj_j~0#1 / 32768 then main_~_ha_hashv~0#1 else ~bitwiseXOr(main_~_ha_hashv~0#1, main_~_hj_j~0#1 / 32768)))); {35771#(<= ~alt_bzero_count~0 2147483645)} is VALID [2022-02-21 03:17:12,712 INFO L290 TraceCheckUtils]: 35: Hoare triple {35771#(<= ~alt_bzero_count~0 2147483645)} havoc main_#t~switch59#1; {35771#(<= ~alt_bzero_count~0 2147483645)} is VALID [2022-02-21 03:17:12,713 INFO L290 TraceCheckUtils]: 34: Hoare triple {35771#(<= ~alt_bzero_count~0 2147483645)} assume main_#t~switch59#1;call main_#t~mem70#1 := read~int(main_~_hj_key~0#1.base, main_~_hj_key~0#1.offset, 1);main_~_hj_i~0#1 := main_~_hj_i~0#1 + main_#t~mem70#1 % 256;havoc main_#t~mem70#1; {35771#(<= ~alt_bzero_count~0 2147483645)} is VALID [2022-02-21 03:17:12,713 INFO L290 TraceCheckUtils]: 33: Hoare triple {35771#(<= ~alt_bzero_count~0 2147483645)} main_#t~switch59#1 := main_#t~switch59#1 || 1 == main_~_hj_k~0#1; {35771#(<= ~alt_bzero_count~0 2147483645)} is VALID [2022-02-21 03:17:12,713 INFO L290 TraceCheckUtils]: 32: Hoare triple {35771#(<= ~alt_bzero_count~0 2147483645)} assume main_#t~switch59#1;call main_#t~mem69#1 := read~int(main_~_hj_key~0#1.base, 1 + main_~_hj_key~0#1.offset, 1);main_~_hj_i~0#1 := main_~_hj_i~0#1 + 256 * (main_#t~mem69#1 % 256);havoc main_#t~mem69#1; {35771#(<= ~alt_bzero_count~0 2147483645)} is VALID [2022-02-21 03:17:12,713 INFO L290 TraceCheckUtils]: 31: Hoare triple {35771#(<= ~alt_bzero_count~0 2147483645)} main_#t~switch59#1 := main_#t~switch59#1 || 2 == main_~_hj_k~0#1; {35771#(<= ~alt_bzero_count~0 2147483645)} is VALID [2022-02-21 03:17:12,714 INFO L290 TraceCheckUtils]: 30: Hoare triple {35771#(<= ~alt_bzero_count~0 2147483645)} assume main_#t~switch59#1;call main_#t~mem68#1 := read~int(main_~_hj_key~0#1.base, 2 + main_~_hj_key~0#1.offset, 1);main_~_hj_i~0#1 := main_~_hj_i~0#1 + 65536 * (main_#t~mem68#1 % 256);havoc main_#t~mem68#1; {35771#(<= ~alt_bzero_count~0 2147483645)} is VALID [2022-02-21 03:17:12,714 INFO L290 TraceCheckUtils]: 29: Hoare triple {35771#(<= ~alt_bzero_count~0 2147483645)} main_#t~switch59#1 := main_#t~switch59#1 || 3 == main_~_hj_k~0#1; {35771#(<= ~alt_bzero_count~0 2147483645)} is VALID [2022-02-21 03:17:12,714 INFO L290 TraceCheckUtils]: 28: Hoare triple {35771#(<= ~alt_bzero_count~0 2147483645)} assume main_#t~switch59#1;call main_#t~mem67#1 := read~int(main_~_hj_key~0#1.base, 3 + main_~_hj_key~0#1.offset, 1);main_~_hj_i~0#1 := main_~_hj_i~0#1 + 16777216 * (main_#t~mem67#1 % 256);havoc main_#t~mem67#1; {35771#(<= ~alt_bzero_count~0 2147483645)} is VALID [2022-02-21 03:17:12,714 INFO L290 TraceCheckUtils]: 27: Hoare triple {35771#(<= ~alt_bzero_count~0 2147483645)} main_#t~switch59#1 := main_#t~switch59#1 || 4 == main_~_hj_k~0#1; {35771#(<= ~alt_bzero_count~0 2147483645)} is VALID [2022-02-21 03:17:12,715 INFO L290 TraceCheckUtils]: 26: Hoare triple {35771#(<= ~alt_bzero_count~0 2147483645)} assume !main_#t~switch59#1; {35771#(<= ~alt_bzero_count~0 2147483645)} is VALID [2022-02-21 03:17:12,715 INFO L290 TraceCheckUtils]: 25: Hoare triple {35771#(<= ~alt_bzero_count~0 2147483645)} main_#t~switch59#1 := main_#t~switch59#1 || 5 == main_~_hj_k~0#1; {35771#(<= ~alt_bzero_count~0 2147483645)} is VALID [2022-02-21 03:17:12,715 INFO L290 TraceCheckUtils]: 24: Hoare triple {35771#(<= ~alt_bzero_count~0 2147483645)} assume !main_#t~switch59#1; {35771#(<= ~alt_bzero_count~0 2147483645)} is VALID [2022-02-21 03:17:12,715 INFO L290 TraceCheckUtils]: 23: Hoare triple {35771#(<= ~alt_bzero_count~0 2147483645)} main_#t~switch59#1 := main_#t~switch59#1 || 6 == main_~_hj_k~0#1; {35771#(<= ~alt_bzero_count~0 2147483645)} is VALID [2022-02-21 03:17:12,716 INFO L290 TraceCheckUtils]: 22: Hoare triple {35771#(<= ~alt_bzero_count~0 2147483645)} assume !main_#t~switch59#1; {35771#(<= ~alt_bzero_count~0 2147483645)} is VALID [2022-02-21 03:17:12,716 INFO L290 TraceCheckUtils]: 21: Hoare triple {35771#(<= ~alt_bzero_count~0 2147483645)} main_#t~switch59#1 := main_#t~switch59#1 || 7 == main_~_hj_k~0#1; {35771#(<= ~alt_bzero_count~0 2147483645)} is VALID [2022-02-21 03:17:12,716 INFO L290 TraceCheckUtils]: 20: Hoare triple {35771#(<= ~alt_bzero_count~0 2147483645)} assume !main_#t~switch59#1; {35771#(<= ~alt_bzero_count~0 2147483645)} is VALID [2022-02-21 03:17:12,716 INFO L290 TraceCheckUtils]: 19: Hoare triple {35771#(<= ~alt_bzero_count~0 2147483645)} main_#t~switch59#1 := main_#t~switch59#1 || 8 == main_~_hj_k~0#1; {35771#(<= ~alt_bzero_count~0 2147483645)} is VALID [2022-02-21 03:17:12,717 INFO L290 TraceCheckUtils]: 18: Hoare triple {35771#(<= ~alt_bzero_count~0 2147483645)} assume !main_#t~switch59#1; {35771#(<= ~alt_bzero_count~0 2147483645)} is VALID [2022-02-21 03:17:12,717 INFO L290 TraceCheckUtils]: 17: Hoare triple {35771#(<= ~alt_bzero_count~0 2147483645)} main_#t~switch59#1 := main_#t~switch59#1 || 9 == main_~_hj_k~0#1; {35771#(<= ~alt_bzero_count~0 2147483645)} is VALID [2022-02-21 03:17:12,717 INFO L290 TraceCheckUtils]: 16: Hoare triple {35771#(<= ~alt_bzero_count~0 2147483645)} assume !main_#t~switch59#1; {35771#(<= ~alt_bzero_count~0 2147483645)} is VALID [2022-02-21 03:17:12,718 INFO L290 TraceCheckUtils]: 15: Hoare triple {35771#(<= ~alt_bzero_count~0 2147483645)} main_#t~switch59#1 := main_#t~switch59#1 || 10 == main_~_hj_k~0#1; {35771#(<= ~alt_bzero_count~0 2147483645)} is VALID [2022-02-21 03:17:12,722 INFO L290 TraceCheckUtils]: 14: Hoare triple {35771#(<= ~alt_bzero_count~0 2147483645)} assume !main_#t~switch59#1; {35771#(<= ~alt_bzero_count~0 2147483645)} is VALID [2022-02-21 03:17:12,723 INFO L290 TraceCheckUtils]: 13: Hoare triple {35771#(<= ~alt_bzero_count~0 2147483645)} main_~_ha_hashv~0#1 := 4 + main_~_ha_hashv~0#1;main_#t~switch59#1 := 11 == main_~_hj_k~0#1; {35771#(<= ~alt_bzero_count~0 2147483645)} is VALID [2022-02-21 03:17:12,723 INFO L290 TraceCheckUtils]: 12: Hoare triple {35771#(<= ~alt_bzero_count~0 2147483645)} assume !(main_~_hj_k~0#1 % 4294967296 >= 12); {35771#(<= ~alt_bzero_count~0 2147483645)} is VALID [2022-02-21 03:17:12,723 INFO L290 TraceCheckUtils]: 11: Hoare triple {35771#(<= ~alt_bzero_count~0 2147483645)} havoc main_~_hj_i~0#1;havoc main_~_hj_j~0#1;havoc main_~_hj_k~0#1;main_~_hj_key~0#1.base, main_~_hj_key~0#1.offset := main_~user~0#1.base, main_~user~0#1.offset;main_~_ha_hashv~0#1 := 4276993775;main_~_hj_j~0#1 := 2654435769;main_~_hj_i~0#1 := main_~_hj_j~0#1;main_~_hj_k~0#1 := 4; {35771#(<= ~alt_bzero_count~0 2147483645)} is VALID [2022-02-21 03:17:12,723 INFO L290 TraceCheckUtils]: 10: Hoare triple {35771#(<= ~alt_bzero_count~0 2147483645)} goto; {35771#(<= ~alt_bzero_count~0 2147483645)} is VALID [2022-02-21 03:17:12,724 INFO L290 TraceCheckUtils]: 9: Hoare triple {35771#(<= ~alt_bzero_count~0 2147483645)} havoc main_~_ha_hashv~0#1; {35771#(<= ~alt_bzero_count~0 2147483645)} is VALID [2022-02-21 03:17:12,724 INFO L290 TraceCheckUtils]: 8: Hoare triple {35771#(<= ~alt_bzero_count~0 2147483645)} assume main_#t~mem45#1 * main_#t~mem46#1 >= -2147483648;call write~int(main_#t~mem45#1 * main_#t~mem46#1, main_~user~0#1.base, 4 + main_~user~0#1.offset, 4);havoc main_#t~mem45#1;havoc main_#t~mem46#1; {35771#(<= ~alt_bzero_count~0 2147483645)} is VALID [2022-02-21 03:17:12,724 INFO L290 TraceCheckUtils]: 7: Hoare triple {35771#(<= ~alt_bzero_count~0 2147483645)} assume main_#t~mem45#1 * main_#t~mem46#1 <= 2147483647; {35771#(<= ~alt_bzero_count~0 2147483645)} is VALID [2022-02-21 03:17:12,724 INFO L290 TraceCheckUtils]: 6: Hoare triple {35771#(<= ~alt_bzero_count~0 2147483645)} call main_#t~mem44#1 := read~int(main_~#i~0#1.base, main_~#i~0#1.offset, 4);call write~int(main_#t~mem44#1, main_~user~0#1.base, main_~user~0#1.offset, 4);havoc main_#t~mem44#1;call main_#t~mem45#1 := read~int(main_~#i~0#1.base, main_~#i~0#1.offset, 4);call main_#t~mem46#1 := read~int(main_~#i~0#1.base, main_~#i~0#1.offset, 4); {35771#(<= ~alt_bzero_count~0 2147483645)} is VALID [2022-02-21 03:17:12,725 INFO L290 TraceCheckUtils]: 5: Hoare triple {35771#(<= ~alt_bzero_count~0 2147483645)} assume !(main_~user~0#1.base == 0 && main_~user~0#1.offset == 0); {35771#(<= ~alt_bzero_count~0 2147483645)} is VALID [2022-02-21 03:17:12,725 INFO L290 TraceCheckUtils]: 4: Hoare triple {35771#(<= ~alt_bzero_count~0 2147483645)} main_#t~ret43#1.base, main_#t~ret43#1.offset := real_malloc_#res#1.base, real_malloc_#res#1.offset;assume { :end_inline_real_malloc } true;main_~user~0#1.base, main_~user~0#1.offset := main_#t~ret43#1.base, main_#t~ret43#1.offset;havoc main_#t~ret43#1.base, main_#t~ret43#1.offset; {35771#(<= ~alt_bzero_count~0 2147483645)} is VALID [2022-02-21 03:17:12,725 INFO L290 TraceCheckUtils]: 3: Hoare triple {35771#(<= ~alt_bzero_count~0 2147483645)} assume !!(main_#t~mem42#1 < 10);havoc main_#t~mem42#1;assume { :begin_inline_real_malloc } true;real_malloc_#in~n#1 := 40;havoc real_malloc_#res#1.base, real_malloc_#res#1.offset;havoc real_malloc_#t~malloc39#1.base, real_malloc_#t~malloc39#1.offset, real_malloc_~n#1;real_malloc_~n#1 := real_malloc_#in~n#1;call real_malloc_#t~malloc39#1.base, real_malloc_#t~malloc39#1.offset := #Ultimate.allocOnHeap(real_malloc_~n#1);real_malloc_#res#1.base, real_malloc_#res#1.offset := real_malloc_#t~malloc39#1.base, real_malloc_#t~malloc39#1.offset;havoc real_malloc_#t~malloc39#1.base, real_malloc_#t~malloc39#1.offset; {35771#(<= ~alt_bzero_count~0 2147483645)} is VALID [2022-02-21 03:17:12,726 INFO L290 TraceCheckUtils]: 2: Hoare triple {35771#(<= ~alt_bzero_count~0 2147483645)} call main_#t~mem42#1 := read~int(main_~#i~0#1.base, main_~#i~0#1.offset, 4); {35771#(<= ~alt_bzero_count~0 2147483645)} is VALID [2022-02-21 03:17:12,751 INFO L290 TraceCheckUtils]: 1: Hoare triple {35771#(<= ~alt_bzero_count~0 2147483645)} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret43#1.base, main_#t~ret43#1.offset, main_#t~mem44#1, main_#t~mem45#1, main_#t~mem46#1, main_#t~mem48#1, main_#t~mem47#1, main_#t~mem49#1, main_#t~mem50#1, main_#t~mem52#1, main_#t~mem51#1, main_#t~mem53#1, main_#t~mem54#1, main_#t~mem56#1, main_#t~mem55#1, main_#t~mem57#1, main_#t~mem58#1, main_#t~switch59#1, main_#t~mem60#1, main_#t~mem61#1, main_#t~mem62#1, main_#t~mem63#1, main_#t~mem64#1, main_#t~mem65#1, main_#t~mem66#1, main_#t~mem67#1, main_#t~mem68#1, main_#t~mem69#1, main_#t~mem70#1, main_~_hj_i~0#1, main_~_hj_j~0#1, main_~_hj_k~0#1, main_~_hj_key~0#1.base, main_~_hj_key~0#1.offset, main_#t~ret71#1.base, main_#t~ret71#1.offset, main_#t~mem72#1.base, main_#t~mem72#1.offset, main_#t~mem73#1.base, main_#t~mem73#1.offset, main_#t~mem74#1.base, main_#t~mem74#1.offset, main_#t~mem75#1.base, main_#t~mem75#1.offset, main_#t~mem76#1.base, main_#t~mem76#1.offset, main_#t~mem77#1.base, main_#t~mem77#1.offset, main_#t~mem78#1.base, main_#t~mem78#1.offset, main_#t~ret79#1.base, main_#t~ret79#1.offset, main_#t~mem80#1.base, main_#t~mem80#1.offset, main_#t~mem81#1.base, main_#t~mem81#1.offset, main_#t~mem82#1.base, main_#t~mem82#1.offset, main_#t~mem83#1.base, main_#t~mem83#1.offset, main_#t~mem84#1.base, main_#t~mem84#1.offset, main_#t~mem85#1.base, main_#t~mem85#1.offset, main_#t~mem86#1.base, main_#t~mem86#1.offset, main_#t~mem87#1.base, main_#t~mem87#1.offset, main_#t~mem88#1.base, main_#t~mem88#1.offset, main_#t~mem89#1.base, main_#t~mem89#1.offset, main_#t~mem90#1, main_#t~mem91#1.base, main_#t~mem91#1.offset, main_#t~mem92#1.base, main_#t~mem92#1.offset, main_#t~mem93#1.base, main_#t~mem93#1.offset, main_#t~mem94#1.base, main_#t~mem94#1.offset, main_#t~mem95#1, main_#t~post96#1, main_#t~mem97#1.base, main_#t~mem97#1.offset, main_#t~mem98#1, main_#t~mem99#1.base, main_#t~mem99#1.offset, main_#t~mem100#1.base, main_#t~mem100#1.offset, main_#t~mem101#1, main_#t~post102#1, main_#t~mem103#1.base, main_#t~mem103#1.offset, main_#t~mem104#1.base, main_#t~mem104#1.offset, main_#t~mem105#1.base, main_#t~mem105#1.offset, main_#t~mem107#1, main_#t~mem106#1, main_#t~mem108#1.base, main_#t~mem108#1.offset, main_#t~mem109#1, main_#t~short110#1, main_#t~mem111#1.base, main_#t~mem111#1.offset, main_#t~mem112#1, main_#t~ret113#1.base, main_#t~ret113#1.offset, main_#t~mem114#1.base, main_#t~mem114#1.offset, main_#t~mem115#1.base, main_#t~mem115#1.offset, main_#t~mem116#1.base, main_#t~mem116#1.offset, main_#t~mem117#1, main_#t~mem118#1.base, main_#t~mem118#1.offset, main_#t~mem119#1.base, main_#t~mem119#1.offset, main_#t~mem122#1, main_#t~mem120#1.base, main_#t~mem120#1.offset, main_#t~mem121#1, main_#t~mem123#1.base, main_#t~mem123#1.offset, main_#t~mem126#1, main_#t~mem124#1.base, main_#t~mem124#1.offset, main_#t~mem125#1, main_#t~ite127#1, main_#t~mem128#1.base, main_#t~mem128#1.offset, main_#t~mem132#1.base, main_#t~mem132#1.offset, main_#t~mem133#1.base, main_#t~mem133#1.offset, main_#t~mem134#1.base, main_#t~mem134#1.offset, main_#t~mem135#1.base, main_#t~mem135#1.offset, main_#t~mem138#1, main_#t~mem136#1.base, main_#t~mem136#1.offset, main_#t~mem137#1, main_#t~mem139#1.base, main_#t~mem139#1.offset, main_#t~mem140#1, main_#t~pre141#1, main_#t~mem142#1.base, main_#t~mem142#1.offset, main_#t~mem143#1, main_#t~mem144#1.base, main_#t~mem144#1.offset, main_#t~mem145#1, main_#t~post146#1, main_#t~mem150#1, main_#t~mem148#1, main_#t~mem147#1.base, main_#t~mem147#1.offset, main_#t~mem149#1, main_#t~mem151#1, main_#t~post152#1, main_#t~mem153#1.base, main_#t~mem153#1.offset, main_#t~mem154#1.base, main_#t~mem154#1.offset, main_#t~mem155#1.base, main_#t~mem155#1.offset, main_#t~post129#1, main_#t~mem130#1.base, main_#t~mem130#1.offset, main_#t~mem131#1, main_#t~mem156#1.base, main_#t~mem156#1.offset, main_#t~mem157#1.base, main_#t~mem157#1.offset, main_#t~mem158#1.base, main_#t~mem158#1.offset, main_#t~mem159#1, main_#t~mem160#1.base, main_#t~mem160#1.offset, main_#t~mem161#1, main_#t~mem162#1.base, main_#t~mem162#1.offset, main_#t~mem163#1, main_#t~post164#1, main_#t~mem165#1.base, main_#t~mem165#1.offset, main_#t~mem166#1.base, main_#t~mem166#1.offset, main_#t~mem167#1.base, main_#t~mem167#1.offset, main_#t~mem168#1.base, main_#t~mem168#1.offset, main_#t~mem171#1, main_#t~mem169#1.base, main_#t~mem169#1.offset, main_#t~mem170#1, main_#t~ite174#1, main_#t~mem172#1.base, main_#t~mem172#1.offset, main_#t~mem173#1, main_#t~mem175#1.base, main_#t~mem175#1.offset, main_#t~mem176#1, main_#t~mem177#1.base, main_#t~mem177#1.offset, main_~_he_bkt~0#1, main_~_he_bkt_i~0#1, main_~_he_thh~0#1.base, main_~_he_thh~0#1.offset, main_~_he_hh_nxt~0#1.base, main_~_he_hh_nxt~0#1.offset, main_~#_he_new_buckets~0#1.base, main_~#_he_new_buckets~0#1.offset, main_~_he_newbkt~0#1.base, main_~_he_newbkt~0#1.offset, main_~_ha_head~0#1.base, main_~_ha_head~0#1.offset, main_~_ha_bkt~0#1, main_~_ha_hashv~0#1, main_#t~mem40#1, main_#t~post41#1, main_#t~mem42#1, main_#t~mem182#1, main_#t~mem181#1, main_#t~mem183#1, main_#t~mem184#1, main_#t~mem186#1, main_#t~mem185#1, main_#t~mem187#1, main_#t~mem188#1, main_#t~mem190#1, main_#t~mem189#1, main_#t~mem191#1, main_#t~mem192#1, main_#t~switch193#1, main_#t~mem194#1, main_#t~mem195#1, main_#t~mem196#1, main_#t~mem197#1, main_#t~mem198#1, main_#t~mem199#1, main_#t~mem200#1, main_#t~mem201#1, main_#t~mem202#1, main_#t~mem203#1, main_#t~mem204#1, main_~_hj_i~1#1, main_~_hj_j~1#1, main_~_hj_k~1#1, main_~_hj_key~1#1.base, main_~_hj_key~1#1.offset, main_#t~mem205#1.base, main_#t~mem205#1.offset, main_#t~mem206#1, main_#t~mem207#1.base, main_#t~mem207#1.offset, main_#t~mem208#1.base, main_#t~mem208#1.offset, main_#t~mem209#1.base, main_#t~mem209#1.offset, main_#t~mem210#1.base, main_#t~mem210#1.offset, main_#t~mem211#1.base, main_#t~mem211#1.offset, main_#t~mem212#1.base, main_#t~mem212#1.offset, main_#t~mem213#1.base, main_#t~mem213#1.offset, main_#t~mem214#1, main_#t~mem215#1, main_#t~mem216#1, main_#t~short217#1, main_#t~mem218#1.base, main_#t~mem218#1.offset, main_#t~ret219#1, main_#t~mem220#1.base, main_#t~mem220#1.offset, main_#t~mem221#1.base, main_#t~mem221#1.offset, main_#t~mem222#1.base, main_#t~mem222#1.offset, main_#t~mem223#1, main_~_hf_bkt~0#1, main_~_hf_hashv~0#1, main_#t~mem224#1.base, main_#t~mem224#1.offset, main_#t~mem225#1.base, main_#t~mem225#1.offset, main_#t~short226#1, main_#t~mem227#1.base, main_#t~mem227#1.offset, main_#t~mem228#1.base, main_#t~mem228#1.offset, main_#t~mem229#1.base, main_#t~mem229#1.offset, main_#t~mem230#1, main_#t~mem231#1.base, main_#t~mem231#1.offset, main_#t~mem232#1.base, main_#t~mem232#1.offset, main_#t~mem233#1.base, main_#t~mem233#1.offset, main_#t~mem234#1.base, main_#t~mem234#1.offset, main_#t~mem235#1.base, main_#t~mem235#1.offset, main_#t~mem236#1.base, main_#t~mem236#1.offset, main_#t~mem237#1, main_#t~mem238#1.base, main_#t~mem238#1.offset, main_#t~mem239#1.base, main_#t~mem239#1.offset, main_#t~mem240#1.base, main_#t~mem240#1.offset, main_#t~mem241#1, main_#t~mem242#1.base, main_#t~mem242#1.offset, main_#t~mem243#1.base, main_#t~mem243#1.offset, main_#t~mem244#1.base, main_#t~mem244#1.offset, main_#t~mem245#1.base, main_#t~mem245#1.offset, main_#t~mem246#1.base, main_#t~mem246#1.offset, main_#t~mem247#1, main_#t~mem248#1.base, main_#t~mem248#1.offset, main_#t~mem251#1, main_#t~mem249#1.base, main_#t~mem249#1.offset, main_#t~mem250#1, main_#t~mem252#1.base, main_#t~mem252#1.offset, main_#t~mem253#1.base, main_#t~mem253#1.offset, main_#t~mem254#1, main_#t~post255#1, main_#t~mem256#1.base, main_#t~mem256#1.offset, main_#t~mem257#1.base, main_#t~mem257#1.offset, main_#t~mem258#1.base, main_#t~mem258#1.offset, main_#t~mem259#1.base, main_#t~mem259#1.offset, main_#t~mem260#1.base, main_#t~mem260#1.offset, main_#t~mem261#1.base, main_#t~mem261#1.offset, main_#t~mem262#1.base, main_#t~mem262#1.offset, main_#t~mem263#1.base, main_#t~mem263#1.offset, main_~_hd_head~0#1.base, main_~_hd_head~0#1.offset, main_#t~mem264#1.base, main_#t~mem264#1.offset, main_#t~mem265#1, main_#t~post266#1, main_~_hd_bkt~0#1, main_~_hd_hh_del~0#1.base, main_~_hd_hh_del~0#1.offset, main_#t~mem178#1, main_#t~post179#1, main_#t~mem180#1, main_#t~mem267#1.base, main_#t~mem267#1.offset, main_~#i~0#1.base, main_~#i~0#1.offset, main_~user~0#1.base, main_~user~0#1.offset, main_~tmp~0#1.base, main_~tmp~0#1.offset, main_~users~0#1.base, main_~users~0#1.offset;call main_~#i~0#1.base, main_~#i~0#1.offset := #Ultimate.allocOnStack(4);havoc main_~user~0#1.base, main_~user~0#1.offset;havoc main_~tmp~0#1.base, main_~tmp~0#1.offset;main_~users~0#1.base, main_~users~0#1.offset := 0, 0;call write~int(0, main_~#i~0#1.base, main_~#i~0#1.offset, 4); {35771#(<= ~alt_bzero_count~0 2147483645)} is VALID [2022-02-21 03:17:12,752 INFO L290 TraceCheckUtils]: 0: Hoare triple {35500#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(21, 2);~#alt_malloc_sizes~0.base, ~#alt_malloc_sizes~0.offset := 3, 0;call #Ultimate.allocInit(40, 3);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#alt_malloc_sizes~0.base);~alt_malloc_balance~0 := 0;~alt_memcmp_count~0 := 0;~alt_bzero_count~0 := 0; {35771#(<= ~alt_bzero_count~0 2147483645)} is VALID [2022-02-21 03:17:12,752 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-02-21 03:17:12,752 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 03:17:12,752 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [597566255] [2022-02-21 03:17:12,752 WARN L317 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-02-21 03:17:12,752 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2104253537] [2022-02-21 03:17:12,752 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2104253537] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-21 03:17:12,752 INFO L191 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-02-21 03:17:12,753 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 5] total 9 [2022-02-21 03:17:12,753 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [847113682] [2022-02-21 03:17:12,753 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-02-21 03:17:12,753 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 14.222222222222221) internal successors, (128), 10 states have internal predecessors, (128), 4 states have call successors, (8), 6 states have call predecessors, (8), 5 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) Word has length 74 [2022-02-21 03:17:12,754 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-21 03:17:12,754 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 10 states, 9 states have (on average 14.222222222222221) internal successors, (128), 10 states have internal predecessors, (128), 4 states have call successors, (8), 6 states have call predecessors, (8), 5 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) [2022-02-21 03:17:12,856 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 142 edges. 142 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:17:12,856 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-02-21 03:17:12,856 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 03:17:12,857 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-02-21 03:17:12,857 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=55, Unknown=0, NotChecked=0, Total=90 [2022-02-21 03:17:12,857 INFO L87 Difference]: Start difference. First operand 1830 states and 2372 transitions. Second operand has 10 states, 9 states have (on average 14.222222222222221) internal successors, (128), 10 states have internal predecessors, (128), 4 states have call successors, (8), 6 states have call predecessors, (8), 5 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) [2022-02-21 03:17:16,377 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:17:16,378 INFO L93 Difference]: Finished difference Result 3333 states and 4309 transitions. [2022-02-21 03:17:16,378 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-02-21 03:17:16,378 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 14.222222222222221) internal successors, (128), 10 states have internal predecessors, (128), 4 states have call successors, (8), 6 states have call predecessors, (8), 5 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) Word has length 74 [2022-02-21 03:17:16,378 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-21 03:17:16,378 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 9 states have (on average 14.222222222222221) internal successors, (128), 10 states have internal predecessors, (128), 4 states have call successors, (8), 6 states have call predecessors, (8), 5 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) [2022-02-21 03:17:16,382 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 899 transitions. [2022-02-21 03:17:16,382 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 9 states have (on average 14.222222222222221) internal successors, (128), 10 states have internal predecessors, (128), 4 states have call successors, (8), 6 states have call predecessors, (8), 5 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) [2022-02-21 03:17:16,386 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 899 transitions. [2022-02-21 03:17:16,386 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 15 states and 899 transitions. [2022-02-21 03:17:17,059 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 899 edges. 899 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:17:17,421 INFO L225 Difference]: With dead ends: 3333 [2022-02-21 03:17:17,421 INFO L226 Difference]: Without dead ends: 3332 [2022-02-21 03:17:17,422 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 157 GetRequests, 142 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=107, Invalid=165, Unknown=0, NotChecked=0, Total=272 [2022-02-21 03:17:17,422 INFO L933 BasicCegarLoop]: 287 mSDtfsCounter, 1431 mSDsluCounter, 1187 mSDsCounter, 0 mSdLazyCounter, 223 mSolverCounterSat, 99 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1440 SdHoareTripleChecker+Valid, 1474 SdHoareTripleChecker+Invalid, 322 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 99 IncrementalHoareTripleChecker+Valid, 223 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-02-21 03:17:17,423 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1440 Valid, 1474 Invalid, 322 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [99 Valid, 223 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-02-21 03:17:17,424 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3332 states. [2022-02-21 03:17:18,258 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3332 to 2995. [2022-02-21 03:17:18,258 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 03:17:18,262 INFO L82 GeneralOperation]: Start isEquivalent. First operand 3332 states. Second operand has 2995 states, 2839 states have (on average 1.280028178936245) internal successors, (3634), 2856 states have internal predecessors, (3634), 102 states have call successors, (102), 51 states have call predecessors, (102), 41 states have return successors, (135), 88 states have call predecessors, (135), 102 states have call successors, (135) [2022-02-21 03:17:18,264 INFO L74 IsIncluded]: Start isIncluded. First operand 3332 states. Second operand has 2995 states, 2839 states have (on average 1.280028178936245) internal successors, (3634), 2856 states have internal predecessors, (3634), 102 states have call successors, (102), 51 states have call predecessors, (102), 41 states have return successors, (135), 88 states have call predecessors, (135), 102 states have call successors, (135) [2022-02-21 03:17:18,267 INFO L87 Difference]: Start difference. First operand 3332 states. Second operand has 2995 states, 2839 states have (on average 1.280028178936245) internal successors, (3634), 2856 states have internal predecessors, (3634), 102 states have call successors, (102), 51 states have call predecessors, (102), 41 states have return successors, (135), 88 states have call predecessors, (135), 102 states have call successors, (135) [2022-02-21 03:17:18,570 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:17:18,571 INFO L93 Difference]: Finished difference Result 3332 states and 4298 transitions. [2022-02-21 03:17:18,571 INFO L276 IsEmpty]: Start isEmpty. Operand 3332 states and 4298 transitions. [2022-02-21 03:17:18,576 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:17:18,577 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:17:18,581 INFO L74 IsIncluded]: Start isIncluded. First operand has 2995 states, 2839 states have (on average 1.280028178936245) internal successors, (3634), 2856 states have internal predecessors, (3634), 102 states have call successors, (102), 51 states have call predecessors, (102), 41 states have return successors, (135), 88 states have call predecessors, (135), 102 states have call successors, (135) Second operand 3332 states. [2022-02-21 03:17:18,583 INFO L87 Difference]: Start difference. First operand has 2995 states, 2839 states have (on average 1.280028178936245) internal successors, (3634), 2856 states have internal predecessors, (3634), 102 states have call successors, (102), 51 states have call predecessors, (102), 41 states have return successors, (135), 88 states have call predecessors, (135), 102 states have call successors, (135) Second operand 3332 states. [2022-02-21 03:17:18,890 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:17:18,890 INFO L93 Difference]: Finished difference Result 3332 states and 4298 transitions. [2022-02-21 03:17:18,890 INFO L276 IsEmpty]: Start isEmpty. Operand 3332 states and 4298 transitions. [2022-02-21 03:17:18,895 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:17:18,896 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:17:18,896 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 03:17:18,896 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 03:17:18,899 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2995 states, 2839 states have (on average 1.280028178936245) internal successors, (3634), 2856 states have internal predecessors, (3634), 102 states have call successors, (102), 51 states have call predecessors, (102), 41 states have return successors, (135), 88 states have call predecessors, (135), 102 states have call successors, (135) [2022-02-21 03:17:19,175 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2995 states to 2995 states and 3871 transitions. [2022-02-21 03:17:19,175 INFO L78 Accepts]: Start accepts. Automaton has 2995 states and 3871 transitions. Word has length 74 [2022-02-21 03:17:19,175 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-21 03:17:19,175 INFO L470 AbstractCegarLoop]: Abstraction has 2995 states and 3871 transitions. [2022-02-21 03:17:19,176 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 14.222222222222221) internal successors, (128), 10 states have internal predecessors, (128), 4 states have call successors, (8), 6 states have call predecessors, (8), 5 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) [2022-02-21 03:17:19,176 INFO L276 IsEmpty]: Start isEmpty. Operand 2995 states and 3871 transitions. [2022-02-21 03:17:19,178 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2022-02-21 03:17:19,178 INFO L506 BasicCegarLoop]: Found error trace [2022-02-21 03:17:19,178 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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] [2022-02-21 03:17:19,211 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2022-02-21 03:17:19,396 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2022-02-21 03:17:19,396 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [alt_mallocErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, alt_mallocErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, alt_freeErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2022-02-21 03:17:19,397 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:17:19,397 INFO L85 PathProgramCache]: Analyzing trace with hash 573613648, now seen corresponding path program 1 times [2022-02-21 03:17:19,397 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:17:19,397 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2071656386] [2022-02-21 03:17:19,397 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:17:19,397 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:17:19,437 ERROR L252 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-02-21 03:17:19,437 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2067508557] [2022-02-21 03:17:19,438 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:17:19,438 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-21 03:17:19,438 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:17:19,439 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-02-21 03:17:19,440 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2022-02-21 03:17:19,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:17:19,789 INFO L263 TraceCheckSpWp]: Trace formula consists of 766 conjuncts, 19 conjunts are in the unsatisfiable core [2022-02-21 03:17:19,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:17:19,831 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 03:17:20,067 INFO L290 TraceCheckUtils]: 0: Hoare triple {50089#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(21, 2);~#alt_malloc_sizes~0.base, ~#alt_malloc_sizes~0.offset := 3, 0;call #Ultimate.allocInit(40, 3);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#alt_malloc_sizes~0.base);~alt_malloc_balance~0 := 0;~alt_memcmp_count~0 := 0;~alt_bzero_count~0 := 0; {50094#(= ~alt_malloc_balance~0 0)} is VALID [2022-02-21 03:17:20,067 INFO L290 TraceCheckUtils]: 1: Hoare triple {50094#(= ~alt_malloc_balance~0 0)} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret43#1.base, main_#t~ret43#1.offset, main_#t~mem44#1, main_#t~mem45#1, main_#t~mem46#1, main_#t~mem48#1, main_#t~mem47#1, main_#t~mem49#1, main_#t~mem50#1, main_#t~mem52#1, main_#t~mem51#1, main_#t~mem53#1, main_#t~mem54#1, main_#t~mem56#1, main_#t~mem55#1, main_#t~mem57#1, main_#t~mem58#1, main_#t~switch59#1, main_#t~mem60#1, main_#t~mem61#1, main_#t~mem62#1, main_#t~mem63#1, main_#t~mem64#1, main_#t~mem65#1, main_#t~mem66#1, main_#t~mem67#1, main_#t~mem68#1, main_#t~mem69#1, main_#t~mem70#1, main_~_hj_i~0#1, main_~_hj_j~0#1, main_~_hj_k~0#1, main_~_hj_key~0#1.base, main_~_hj_key~0#1.offset, main_#t~ret71#1.base, main_#t~ret71#1.offset, main_#t~mem72#1.base, main_#t~mem72#1.offset, main_#t~mem73#1.base, main_#t~mem73#1.offset, main_#t~mem74#1.base, main_#t~mem74#1.offset, main_#t~mem75#1.base, main_#t~mem75#1.offset, main_#t~mem76#1.base, main_#t~mem76#1.offset, main_#t~mem77#1.base, main_#t~mem77#1.offset, main_#t~mem78#1.base, main_#t~mem78#1.offset, main_#t~ret79#1.base, main_#t~ret79#1.offset, main_#t~mem80#1.base, main_#t~mem80#1.offset, main_#t~mem81#1.base, main_#t~mem81#1.offset, main_#t~mem82#1.base, main_#t~mem82#1.offset, main_#t~mem83#1.base, main_#t~mem83#1.offset, main_#t~mem84#1.base, main_#t~mem84#1.offset, main_#t~mem85#1.base, main_#t~mem85#1.offset, main_#t~mem86#1.base, main_#t~mem86#1.offset, main_#t~mem87#1.base, main_#t~mem87#1.offset, main_#t~mem88#1.base, main_#t~mem88#1.offset, main_#t~mem89#1.base, main_#t~mem89#1.offset, main_#t~mem90#1, main_#t~mem91#1.base, main_#t~mem91#1.offset, main_#t~mem92#1.base, main_#t~mem92#1.offset, main_#t~mem93#1.base, main_#t~mem93#1.offset, main_#t~mem94#1.base, main_#t~mem94#1.offset, main_#t~mem95#1, main_#t~post96#1, main_#t~mem97#1.base, main_#t~mem97#1.offset, main_#t~mem98#1, main_#t~mem99#1.base, main_#t~mem99#1.offset, main_#t~mem100#1.base, main_#t~mem100#1.offset, main_#t~mem101#1, main_#t~post102#1, main_#t~mem103#1.base, main_#t~mem103#1.offset, main_#t~mem104#1.base, main_#t~mem104#1.offset, main_#t~mem105#1.base, main_#t~mem105#1.offset, main_#t~mem107#1, main_#t~mem106#1, main_#t~mem108#1.base, main_#t~mem108#1.offset, main_#t~mem109#1, main_#t~short110#1, main_#t~mem111#1.base, main_#t~mem111#1.offset, main_#t~mem112#1, main_#t~ret113#1.base, main_#t~ret113#1.offset, main_#t~mem114#1.base, main_#t~mem114#1.offset, main_#t~mem115#1.base, main_#t~mem115#1.offset, main_#t~mem116#1.base, main_#t~mem116#1.offset, main_#t~mem117#1, main_#t~mem118#1.base, main_#t~mem118#1.offset, main_#t~mem119#1.base, main_#t~mem119#1.offset, main_#t~mem122#1, main_#t~mem120#1.base, main_#t~mem120#1.offset, main_#t~mem121#1, main_#t~mem123#1.base, main_#t~mem123#1.offset, main_#t~mem126#1, main_#t~mem124#1.base, main_#t~mem124#1.offset, main_#t~mem125#1, main_#t~ite127#1, main_#t~mem128#1.base, main_#t~mem128#1.offset, main_#t~mem132#1.base, main_#t~mem132#1.offset, main_#t~mem133#1.base, main_#t~mem133#1.offset, main_#t~mem134#1.base, main_#t~mem134#1.offset, main_#t~mem135#1.base, main_#t~mem135#1.offset, main_#t~mem138#1, main_#t~mem136#1.base, main_#t~mem136#1.offset, main_#t~mem137#1, main_#t~mem139#1.base, main_#t~mem139#1.offset, main_#t~mem140#1, main_#t~pre141#1, main_#t~mem142#1.base, main_#t~mem142#1.offset, main_#t~mem143#1, main_#t~mem144#1.base, main_#t~mem144#1.offset, main_#t~mem145#1, main_#t~post146#1, main_#t~mem150#1, main_#t~mem148#1, main_#t~mem147#1.base, main_#t~mem147#1.offset, main_#t~mem149#1, main_#t~mem151#1, main_#t~post152#1, main_#t~mem153#1.base, main_#t~mem153#1.offset, main_#t~mem154#1.base, main_#t~mem154#1.offset, main_#t~mem155#1.base, main_#t~mem155#1.offset, main_#t~post129#1, main_#t~mem130#1.base, main_#t~mem130#1.offset, main_#t~mem131#1, main_#t~mem156#1.base, main_#t~mem156#1.offset, main_#t~mem157#1.base, main_#t~mem157#1.offset, main_#t~mem158#1.base, main_#t~mem158#1.offset, main_#t~mem159#1, main_#t~mem160#1.base, main_#t~mem160#1.offset, main_#t~mem161#1, main_#t~mem162#1.base, main_#t~mem162#1.offset, main_#t~mem163#1, main_#t~post164#1, main_#t~mem165#1.base, main_#t~mem165#1.offset, main_#t~mem166#1.base, main_#t~mem166#1.offset, main_#t~mem167#1.base, main_#t~mem167#1.offset, main_#t~mem168#1.base, main_#t~mem168#1.offset, main_#t~mem171#1, main_#t~mem169#1.base, main_#t~mem169#1.offset, main_#t~mem170#1, main_#t~ite174#1, main_#t~mem172#1.base, main_#t~mem172#1.offset, main_#t~mem173#1, main_#t~mem175#1.base, main_#t~mem175#1.offset, main_#t~mem176#1, main_#t~mem177#1.base, main_#t~mem177#1.offset, main_~_he_bkt~0#1, main_~_he_bkt_i~0#1, main_~_he_thh~0#1.base, main_~_he_thh~0#1.offset, main_~_he_hh_nxt~0#1.base, main_~_he_hh_nxt~0#1.offset, main_~#_he_new_buckets~0#1.base, main_~#_he_new_buckets~0#1.offset, main_~_he_newbkt~0#1.base, main_~_he_newbkt~0#1.offset, main_~_ha_head~0#1.base, main_~_ha_head~0#1.offset, main_~_ha_bkt~0#1, main_~_ha_hashv~0#1, main_#t~mem40#1, main_#t~post41#1, main_#t~mem42#1, main_#t~mem182#1, main_#t~mem181#1, main_#t~mem183#1, main_#t~mem184#1, main_#t~mem186#1, main_#t~mem185#1, main_#t~mem187#1, main_#t~mem188#1, main_#t~mem190#1, main_#t~mem189#1, main_#t~mem191#1, main_#t~mem192#1, main_#t~switch193#1, main_#t~mem194#1, main_#t~mem195#1, main_#t~mem196#1, main_#t~mem197#1, main_#t~mem198#1, main_#t~mem199#1, main_#t~mem200#1, main_#t~mem201#1, main_#t~mem202#1, main_#t~mem203#1, main_#t~mem204#1, main_~_hj_i~1#1, main_~_hj_j~1#1, main_~_hj_k~1#1, main_~_hj_key~1#1.base, main_~_hj_key~1#1.offset, main_#t~mem205#1.base, main_#t~mem205#1.offset, main_#t~mem206#1, main_#t~mem207#1.base, main_#t~mem207#1.offset, main_#t~mem208#1.base, main_#t~mem208#1.offset, main_#t~mem209#1.base, main_#t~mem209#1.offset, main_#t~mem210#1.base, main_#t~mem210#1.offset, main_#t~mem211#1.base, main_#t~mem211#1.offset, main_#t~mem212#1.base, main_#t~mem212#1.offset, main_#t~mem213#1.base, main_#t~mem213#1.offset, main_#t~mem214#1, main_#t~mem215#1, main_#t~mem216#1, main_#t~short217#1, main_#t~mem218#1.base, main_#t~mem218#1.offset, main_#t~ret219#1, main_#t~mem220#1.base, main_#t~mem220#1.offset, main_#t~mem221#1.base, main_#t~mem221#1.offset, main_#t~mem222#1.base, main_#t~mem222#1.offset, main_#t~mem223#1, main_~_hf_bkt~0#1, main_~_hf_hashv~0#1, main_#t~mem224#1.base, main_#t~mem224#1.offset, main_#t~mem225#1.base, main_#t~mem225#1.offset, main_#t~short226#1, main_#t~mem227#1.base, main_#t~mem227#1.offset, main_#t~mem228#1.base, main_#t~mem228#1.offset, main_#t~mem229#1.base, main_#t~mem229#1.offset, main_#t~mem230#1, main_#t~mem231#1.base, main_#t~mem231#1.offset, main_#t~mem232#1.base, main_#t~mem232#1.offset, main_#t~mem233#1.base, main_#t~mem233#1.offset, main_#t~mem234#1.base, main_#t~mem234#1.offset, main_#t~mem235#1.base, main_#t~mem235#1.offset, main_#t~mem236#1.base, main_#t~mem236#1.offset, main_#t~mem237#1, main_#t~mem238#1.base, main_#t~mem238#1.offset, main_#t~mem239#1.base, main_#t~mem239#1.offset, main_#t~mem240#1.base, main_#t~mem240#1.offset, main_#t~mem241#1, main_#t~mem242#1.base, main_#t~mem242#1.offset, main_#t~mem243#1.base, main_#t~mem243#1.offset, main_#t~mem244#1.base, main_#t~mem244#1.offset, main_#t~mem245#1.base, main_#t~mem245#1.offset, main_#t~mem246#1.base, main_#t~mem246#1.offset, main_#t~mem247#1, main_#t~mem248#1.base, main_#t~mem248#1.offset, main_#t~mem251#1, main_#t~mem249#1.base, main_#t~mem249#1.offset, main_#t~mem250#1, main_#t~mem252#1.base, main_#t~mem252#1.offset, main_#t~mem253#1.base, main_#t~mem253#1.offset, main_#t~mem254#1, main_#t~post255#1, main_#t~mem256#1.base, main_#t~mem256#1.offset, main_#t~mem257#1.base, main_#t~mem257#1.offset, main_#t~mem258#1.base, main_#t~mem258#1.offset, main_#t~mem259#1.base, main_#t~mem259#1.offset, main_#t~mem260#1.base, main_#t~mem260#1.offset, main_#t~mem261#1.base, main_#t~mem261#1.offset, main_#t~mem262#1.base, main_#t~mem262#1.offset, main_#t~mem263#1.base, main_#t~mem263#1.offset, main_~_hd_head~0#1.base, main_~_hd_head~0#1.offset, main_#t~mem264#1.base, main_#t~mem264#1.offset, main_#t~mem265#1, main_#t~post266#1, main_~_hd_bkt~0#1, main_~_hd_hh_del~0#1.base, main_~_hd_hh_del~0#1.offset, main_#t~mem178#1, main_#t~post179#1, main_#t~mem180#1, main_#t~mem267#1.base, main_#t~mem267#1.offset, main_~#i~0#1.base, main_~#i~0#1.offset, main_~user~0#1.base, main_~user~0#1.offset, main_~tmp~0#1.base, main_~tmp~0#1.offset, main_~users~0#1.base, main_~users~0#1.offset;call main_~#i~0#1.base, main_~#i~0#1.offset := #Ultimate.allocOnStack(4);havoc main_~user~0#1.base, main_~user~0#1.offset;havoc main_~tmp~0#1.base, main_~tmp~0#1.offset;main_~users~0#1.base, main_~users~0#1.offset := 0, 0;call write~int(0, main_~#i~0#1.base, main_~#i~0#1.offset, 4); {50094#(= ~alt_malloc_balance~0 0)} is VALID [2022-02-21 03:17:20,067 INFO L290 TraceCheckUtils]: 2: Hoare triple {50094#(= ~alt_malloc_balance~0 0)} call main_#t~mem42#1 := read~int(main_~#i~0#1.base, main_~#i~0#1.offset, 4); {50094#(= ~alt_malloc_balance~0 0)} is VALID [2022-02-21 03:17:20,068 INFO L290 TraceCheckUtils]: 3: Hoare triple {50094#(= ~alt_malloc_balance~0 0)} assume !!(main_#t~mem42#1 < 10);havoc main_#t~mem42#1;assume { :begin_inline_real_malloc } true;real_malloc_#in~n#1 := 40;havoc real_malloc_#res#1.base, real_malloc_#res#1.offset;havoc real_malloc_#t~malloc39#1.base, real_malloc_#t~malloc39#1.offset, real_malloc_~n#1;real_malloc_~n#1 := real_malloc_#in~n#1;call real_malloc_#t~malloc39#1.base, real_malloc_#t~malloc39#1.offset := #Ultimate.allocOnHeap(real_malloc_~n#1);real_malloc_#res#1.base, real_malloc_#res#1.offset := real_malloc_#t~malloc39#1.base, real_malloc_#t~malloc39#1.offset;havoc real_malloc_#t~malloc39#1.base, real_malloc_#t~malloc39#1.offset; {50094#(= ~alt_malloc_balance~0 0)} is VALID [2022-02-21 03:17:20,068 INFO L290 TraceCheckUtils]: 4: Hoare triple {50094#(= ~alt_malloc_balance~0 0)} main_#t~ret43#1.base, main_#t~ret43#1.offset := real_malloc_#res#1.base, real_malloc_#res#1.offset;assume { :end_inline_real_malloc } true;main_~user~0#1.base, main_~user~0#1.offset := main_#t~ret43#1.base, main_#t~ret43#1.offset;havoc main_#t~ret43#1.base, main_#t~ret43#1.offset; {50094#(= ~alt_malloc_balance~0 0)} is VALID [2022-02-21 03:17:20,068 INFO L290 TraceCheckUtils]: 5: Hoare triple {50094#(= ~alt_malloc_balance~0 0)} assume !(main_~user~0#1.base == 0 && main_~user~0#1.offset == 0); {50094#(= ~alt_malloc_balance~0 0)} is VALID [2022-02-21 03:17:20,069 INFO L290 TraceCheckUtils]: 6: Hoare triple {50094#(= ~alt_malloc_balance~0 0)} call main_#t~mem44#1 := read~int(main_~#i~0#1.base, main_~#i~0#1.offset, 4);call write~int(main_#t~mem44#1, main_~user~0#1.base, main_~user~0#1.offset, 4);havoc main_#t~mem44#1;call main_#t~mem45#1 := read~int(main_~#i~0#1.base, main_~#i~0#1.offset, 4);call main_#t~mem46#1 := read~int(main_~#i~0#1.base, main_~#i~0#1.offset, 4); {50094#(= ~alt_malloc_balance~0 0)} is VALID [2022-02-21 03:17:20,069 INFO L290 TraceCheckUtils]: 7: Hoare triple {50094#(= ~alt_malloc_balance~0 0)} assume main_#t~mem45#1 * main_#t~mem46#1 <= 2147483647; {50094#(= ~alt_malloc_balance~0 0)} is VALID [2022-02-21 03:17:20,069 INFO L290 TraceCheckUtils]: 8: Hoare triple {50094#(= ~alt_malloc_balance~0 0)} assume main_#t~mem45#1 * main_#t~mem46#1 >= -2147483648;call write~int(main_#t~mem45#1 * main_#t~mem46#1, main_~user~0#1.base, 4 + main_~user~0#1.offset, 4);havoc main_#t~mem45#1;havoc main_#t~mem46#1; {50094#(= ~alt_malloc_balance~0 0)} is VALID [2022-02-21 03:17:20,069 INFO L290 TraceCheckUtils]: 9: Hoare triple {50094#(= ~alt_malloc_balance~0 0)} havoc main_~_ha_hashv~0#1; {50094#(= ~alt_malloc_balance~0 0)} is VALID [2022-02-21 03:17:20,070 INFO L290 TraceCheckUtils]: 10: Hoare triple {50094#(= ~alt_malloc_balance~0 0)} goto; {50094#(= ~alt_malloc_balance~0 0)} is VALID [2022-02-21 03:17:20,070 INFO L290 TraceCheckUtils]: 11: Hoare triple {50094#(= ~alt_malloc_balance~0 0)} havoc main_~_hj_i~0#1;havoc main_~_hj_j~0#1;havoc main_~_hj_k~0#1;main_~_hj_key~0#1.base, main_~_hj_key~0#1.offset := main_~user~0#1.base, main_~user~0#1.offset;main_~_ha_hashv~0#1 := 4276993775;main_~_hj_j~0#1 := 2654435769;main_~_hj_i~0#1 := main_~_hj_j~0#1;main_~_hj_k~0#1 := 4; {50094#(= ~alt_malloc_balance~0 0)} is VALID [2022-02-21 03:17:20,070 INFO L290 TraceCheckUtils]: 12: Hoare triple {50094#(= ~alt_malloc_balance~0 0)} assume !(main_~_hj_k~0#1 % 4294967296 >= 12); {50094#(= ~alt_malloc_balance~0 0)} is VALID [2022-02-21 03:17:20,070 INFO L290 TraceCheckUtils]: 13: Hoare triple {50094#(= ~alt_malloc_balance~0 0)} main_~_ha_hashv~0#1 := 4 + main_~_ha_hashv~0#1;main_#t~switch59#1 := 11 == main_~_hj_k~0#1; {50094#(= ~alt_malloc_balance~0 0)} is VALID [2022-02-21 03:17:20,071 INFO L290 TraceCheckUtils]: 14: Hoare triple {50094#(= ~alt_malloc_balance~0 0)} assume !main_#t~switch59#1; {50094#(= ~alt_malloc_balance~0 0)} is VALID [2022-02-21 03:17:20,071 INFO L290 TraceCheckUtils]: 15: Hoare triple {50094#(= ~alt_malloc_balance~0 0)} main_#t~switch59#1 := main_#t~switch59#1 || 10 == main_~_hj_k~0#1; {50094#(= ~alt_malloc_balance~0 0)} is VALID [2022-02-21 03:17:20,071 INFO L290 TraceCheckUtils]: 16: Hoare triple {50094#(= ~alt_malloc_balance~0 0)} assume !main_#t~switch59#1; {50094#(= ~alt_malloc_balance~0 0)} is VALID [2022-02-21 03:17:20,071 INFO L290 TraceCheckUtils]: 17: Hoare triple {50094#(= ~alt_malloc_balance~0 0)} main_#t~switch59#1 := main_#t~switch59#1 || 9 == main_~_hj_k~0#1; {50094#(= ~alt_malloc_balance~0 0)} is VALID [2022-02-21 03:17:20,072 INFO L290 TraceCheckUtils]: 18: Hoare triple {50094#(= ~alt_malloc_balance~0 0)} assume !main_#t~switch59#1; {50094#(= ~alt_malloc_balance~0 0)} is VALID [2022-02-21 03:17:20,072 INFO L290 TraceCheckUtils]: 19: Hoare triple {50094#(= ~alt_malloc_balance~0 0)} main_#t~switch59#1 := main_#t~switch59#1 || 8 == main_~_hj_k~0#1; {50094#(= ~alt_malloc_balance~0 0)} is VALID [2022-02-21 03:17:20,072 INFO L290 TraceCheckUtils]: 20: Hoare triple {50094#(= ~alt_malloc_balance~0 0)} assume !main_#t~switch59#1; {50094#(= ~alt_malloc_balance~0 0)} is VALID [2022-02-21 03:17:20,073 INFO L290 TraceCheckUtils]: 21: Hoare triple {50094#(= ~alt_malloc_balance~0 0)} main_#t~switch59#1 := main_#t~switch59#1 || 7 == main_~_hj_k~0#1; {50094#(= ~alt_malloc_balance~0 0)} is VALID [2022-02-21 03:17:20,073 INFO L290 TraceCheckUtils]: 22: Hoare triple {50094#(= ~alt_malloc_balance~0 0)} assume !main_#t~switch59#1; {50094#(= ~alt_malloc_balance~0 0)} is VALID [2022-02-21 03:17:20,073 INFO L290 TraceCheckUtils]: 23: Hoare triple {50094#(= ~alt_malloc_balance~0 0)} main_#t~switch59#1 := main_#t~switch59#1 || 6 == main_~_hj_k~0#1; {50094#(= ~alt_malloc_balance~0 0)} is VALID [2022-02-21 03:17:20,073 INFO L290 TraceCheckUtils]: 24: Hoare triple {50094#(= ~alt_malloc_balance~0 0)} assume !main_#t~switch59#1; {50094#(= ~alt_malloc_balance~0 0)} is VALID [2022-02-21 03:17:20,074 INFO L290 TraceCheckUtils]: 25: Hoare triple {50094#(= ~alt_malloc_balance~0 0)} main_#t~switch59#1 := main_#t~switch59#1 || 5 == main_~_hj_k~0#1; {50094#(= ~alt_malloc_balance~0 0)} is VALID [2022-02-21 03:17:20,074 INFO L290 TraceCheckUtils]: 26: Hoare triple {50094#(= ~alt_malloc_balance~0 0)} assume !main_#t~switch59#1; {50094#(= ~alt_malloc_balance~0 0)} is VALID [2022-02-21 03:17:20,074 INFO L290 TraceCheckUtils]: 27: Hoare triple {50094#(= ~alt_malloc_balance~0 0)} main_#t~switch59#1 := main_#t~switch59#1 || 4 == main_~_hj_k~0#1; {50094#(= ~alt_malloc_balance~0 0)} is VALID [2022-02-21 03:17:20,074 INFO L290 TraceCheckUtils]: 28: Hoare triple {50094#(= ~alt_malloc_balance~0 0)} assume main_#t~switch59#1;call main_#t~mem67#1 := read~int(main_~_hj_key~0#1.base, 3 + main_~_hj_key~0#1.offset, 1);main_~_hj_i~0#1 := main_~_hj_i~0#1 + 16777216 * (main_#t~mem67#1 % 256);havoc main_#t~mem67#1; {50094#(= ~alt_malloc_balance~0 0)} is VALID [2022-02-21 03:17:20,075 INFO L290 TraceCheckUtils]: 29: Hoare triple {50094#(= ~alt_malloc_balance~0 0)} main_#t~switch59#1 := main_#t~switch59#1 || 3 == main_~_hj_k~0#1; {50094#(= ~alt_malloc_balance~0 0)} is VALID [2022-02-21 03:17:20,075 INFO L290 TraceCheckUtils]: 30: Hoare triple {50094#(= ~alt_malloc_balance~0 0)} assume main_#t~switch59#1;call main_#t~mem68#1 := read~int(main_~_hj_key~0#1.base, 2 + main_~_hj_key~0#1.offset, 1);main_~_hj_i~0#1 := main_~_hj_i~0#1 + 65536 * (main_#t~mem68#1 % 256);havoc main_#t~mem68#1; {50094#(= ~alt_malloc_balance~0 0)} is VALID [2022-02-21 03:17:20,075 INFO L290 TraceCheckUtils]: 31: Hoare triple {50094#(= ~alt_malloc_balance~0 0)} main_#t~switch59#1 := main_#t~switch59#1 || 2 == main_~_hj_k~0#1; {50094#(= ~alt_malloc_balance~0 0)} is VALID [2022-02-21 03:17:20,075 INFO L290 TraceCheckUtils]: 32: Hoare triple {50094#(= ~alt_malloc_balance~0 0)} assume main_#t~switch59#1;call main_#t~mem69#1 := read~int(main_~_hj_key~0#1.base, 1 + main_~_hj_key~0#1.offset, 1);main_~_hj_i~0#1 := main_~_hj_i~0#1 + 256 * (main_#t~mem69#1 % 256);havoc main_#t~mem69#1; {50094#(= ~alt_malloc_balance~0 0)} is VALID [2022-02-21 03:17:20,076 INFO L290 TraceCheckUtils]: 33: Hoare triple {50094#(= ~alt_malloc_balance~0 0)} main_#t~switch59#1 := main_#t~switch59#1 || 1 == main_~_hj_k~0#1; {50094#(= ~alt_malloc_balance~0 0)} is VALID [2022-02-21 03:17:20,076 INFO L290 TraceCheckUtils]: 34: Hoare triple {50094#(= ~alt_malloc_balance~0 0)} assume main_#t~switch59#1;call main_#t~mem70#1 := read~int(main_~_hj_key~0#1.base, main_~_hj_key~0#1.offset, 1);main_~_hj_i~0#1 := main_~_hj_i~0#1 + main_#t~mem70#1 % 256;havoc main_#t~mem70#1; {50094#(= ~alt_malloc_balance~0 0)} is VALID [2022-02-21 03:17:20,076 INFO L290 TraceCheckUtils]: 35: Hoare triple {50094#(= ~alt_malloc_balance~0 0)} havoc main_#t~switch59#1; {50094#(= ~alt_malloc_balance~0 0)} is VALID [2022-02-21 03:17:20,076 INFO L290 TraceCheckUtils]: 36: Hoare triple {50094#(= ~alt_malloc_balance~0 0)} main_~_hj_i~0#1 := main_~_hj_i~0#1 - main_~_hj_j~0#1;main_~_hj_i~0#1 := main_~_hj_i~0#1 - main_~_ha_hashv~0#1;main_~_hj_i~0#1 := (if (1 == main_~_hj_i~0#1 || 0 == main_~_hj_i~0#1) && (1 == main_~_ha_hashv~0#1 / 8192 || 0 == main_~_ha_hashv~0#1 / 8192) then (if main_~_hj_i~0#1 == main_~_ha_hashv~0#1 / 8192 then 0 else 1) else (if 0 == main_~_hj_i~0#1 then main_~_ha_hashv~0#1 / 8192 else (if 0 == main_~_ha_hashv~0#1 / 8192 then main_~_hj_i~0#1 else ~bitwiseXOr(main_~_hj_i~0#1, main_~_ha_hashv~0#1 / 8192))));main_~_hj_j~0#1 := main_~_hj_j~0#1 - main_~_ha_hashv~0#1;main_~_hj_j~0#1 := main_~_hj_j~0#1 - main_~_hj_i~0#1;main_~_hj_j~0#1 := (if (1 == main_~_hj_j~0#1 || 0 == main_~_hj_j~0#1) && (1 == 256 * main_~_hj_i~0#1 || 0 == 256 * main_~_hj_i~0#1) then (if main_~_hj_j~0#1 == 256 * main_~_hj_i~0#1 then 0 else 1) else (if 0 == main_~_hj_j~0#1 then 256 * main_~_hj_i~0#1 else (if 0 == 256 * main_~_hj_i~0#1 then main_~_hj_j~0#1 else ~bitwiseXOr(main_~_hj_j~0#1, 256 * main_~_hj_i~0#1))));main_~_ha_hashv~0#1 := main_~_ha_hashv~0#1 - main_~_hj_i~0#1;main_~_ha_hashv~0#1 := main_~_ha_hashv~0#1 - main_~_hj_j~0#1;main_~_ha_hashv~0#1 := (if (1 == main_~_ha_hashv~0#1 || 0 == main_~_ha_hashv~0#1) && (1 == main_~_hj_j~0#1 / 8192 || 0 == main_~_hj_j~0#1 / 8192) then (if main_~_ha_hashv~0#1 == main_~_hj_j~0#1 / 8192 then 0 else 1) else (if 0 == main_~_ha_hashv~0#1 then main_~_hj_j~0#1 / 8192 else (if 0 == main_~_hj_j~0#1 / 8192 then main_~_ha_hashv~0#1 else ~bitwiseXOr(main_~_ha_hashv~0#1, main_~_hj_j~0#1 / 8192))));main_~_hj_i~0#1 := main_~_hj_i~0#1 - main_~_hj_j~0#1;main_~_hj_i~0#1 := main_~_hj_i~0#1 - main_~_ha_hashv~0#1;main_~_hj_i~0#1 := (if (1 == main_~_hj_i~0#1 || 0 == main_~_hj_i~0#1) && (1 == main_~_ha_hashv~0#1 / 4096 || 0 == main_~_ha_hashv~0#1 / 4096) then (if main_~_hj_i~0#1 == main_~_ha_hashv~0#1 / 4096 then 0 else 1) else (if 0 == main_~_hj_i~0#1 then main_~_ha_hashv~0#1 / 4096 else (if 0 == main_~_ha_hashv~0#1 / 4096 then main_~_hj_i~0#1 else ~bitwiseXOr(main_~_hj_i~0#1, main_~_ha_hashv~0#1 / 4096))));main_~_hj_j~0#1 := main_~_hj_j~0#1 - main_~_ha_hashv~0#1;main_~_hj_j~0#1 := main_~_hj_j~0#1 - main_~_hj_i~0#1;main_~_hj_j~0#1 := (if (1 == main_~_hj_j~0#1 || 0 == main_~_hj_j~0#1) && (1 == 65536 * main_~_hj_i~0#1 || 0 == 65536 * main_~_hj_i~0#1) then (if main_~_hj_j~0#1 == 65536 * main_~_hj_i~0#1 then 0 else 1) else (if 0 == main_~_hj_j~0#1 then 65536 * main_~_hj_i~0#1 else (if 0 == 65536 * main_~_hj_i~0#1 then main_~_hj_j~0#1 else ~bitwiseXOr(main_~_hj_j~0#1, 65536 * main_~_hj_i~0#1))));main_~_ha_hashv~0#1 := main_~_ha_hashv~0#1 - main_~_hj_i~0#1;main_~_ha_hashv~0#1 := main_~_ha_hashv~0#1 - main_~_hj_j~0#1;main_~_ha_hashv~0#1 := (if (1 == main_~_ha_hashv~0#1 || 0 == main_~_ha_hashv~0#1) && (1 == main_~_hj_j~0#1 / 32 || 0 == main_~_hj_j~0#1 / 32) then (if main_~_ha_hashv~0#1 == main_~_hj_j~0#1 / 32 then 0 else 1) else (if 0 == main_~_ha_hashv~0#1 then main_~_hj_j~0#1 / 32 else (if 0 == main_~_hj_j~0#1 / 32 then main_~_ha_hashv~0#1 else ~bitwiseXOr(main_~_ha_hashv~0#1, main_~_hj_j~0#1 / 32))));main_~_hj_i~0#1 := main_~_hj_i~0#1 - main_~_hj_j~0#1;main_~_hj_i~0#1 := main_~_hj_i~0#1 - main_~_ha_hashv~0#1;main_~_hj_i~0#1 := (if (1 == main_~_hj_i~0#1 || 0 == main_~_hj_i~0#1) && (1 == main_~_ha_hashv~0#1 / 8 || 0 == main_~_ha_hashv~0#1 / 8) then (if main_~_hj_i~0#1 == main_~_ha_hashv~0#1 / 8 then 0 else 1) else (if 0 == main_~_hj_i~0#1 then main_~_ha_hashv~0#1 / 8 else (if 0 == main_~_ha_hashv~0#1 / 8 then main_~_hj_i~0#1 else ~bitwiseXOr(main_~_hj_i~0#1, main_~_ha_hashv~0#1 / 8))));main_~_hj_j~0#1 := main_~_hj_j~0#1 - main_~_ha_hashv~0#1;main_~_hj_j~0#1 := main_~_hj_j~0#1 - main_~_hj_i~0#1;main_~_hj_j~0#1 := (if (1 == main_~_hj_j~0#1 || 0 == main_~_hj_j~0#1) && (1 == 1024 * main_~_hj_i~0#1 || 0 == 1024 * main_~_hj_i~0#1) then (if main_~_hj_j~0#1 == 1024 * main_~_hj_i~0#1 then 0 else 1) else (if 0 == main_~_hj_j~0#1 then 1024 * main_~_hj_i~0#1 else (if 0 == 1024 * main_~_hj_i~0#1 then main_~_hj_j~0#1 else ~bitwiseXOr(main_~_hj_j~0#1, 1024 * main_~_hj_i~0#1))));main_~_ha_hashv~0#1 := main_~_ha_hashv~0#1 - main_~_hj_i~0#1;main_~_ha_hashv~0#1 := main_~_ha_hashv~0#1 - main_~_hj_j~0#1;main_~_ha_hashv~0#1 := (if (1 == main_~_ha_hashv~0#1 || 0 == main_~_ha_hashv~0#1) && (1 == main_~_hj_j~0#1 / 32768 || 0 == main_~_hj_j~0#1 / 32768) then (if main_~_ha_hashv~0#1 == main_~_hj_j~0#1 / 32768 then 0 else 1) else (if 0 == main_~_ha_hashv~0#1 then main_~_hj_j~0#1 / 32768 else (if 0 == main_~_hj_j~0#1 / 32768 then main_~_ha_hashv~0#1 else ~bitwiseXOr(main_~_ha_hashv~0#1, main_~_hj_j~0#1 / 32768)))); {50094#(= ~alt_malloc_balance~0 0)} is VALID [2022-02-21 03:17:20,077 INFO L290 TraceCheckUtils]: 37: Hoare triple {50094#(= ~alt_malloc_balance~0 0)} goto; {50094#(= ~alt_malloc_balance~0 0)} is VALID [2022-02-21 03:17:20,077 INFO L290 TraceCheckUtils]: 38: Hoare triple {50094#(= ~alt_malloc_balance~0 0)} goto; {50094#(= ~alt_malloc_balance~0 0)} is VALID [2022-02-21 03:17:20,077 INFO L290 TraceCheckUtils]: 39: Hoare triple {50094#(= ~alt_malloc_balance~0 0)} goto; {50094#(= ~alt_malloc_balance~0 0)} is VALID [2022-02-21 03:17:20,078 INFO L290 TraceCheckUtils]: 40: Hoare triple {50094#(= ~alt_malloc_balance~0 0)} call write~int(main_~_ha_hashv~0#1, main_~user~0#1.base, 36 + main_~user~0#1.offset, 4);call write~$Pointer$(main_~user~0#1.base, main_~user~0#1.offset, main_~user~0#1.base, 28 + main_~user~0#1.offset, 4);call write~int(4, main_~user~0#1.base, 32 + main_~user~0#1.offset, 4); {50094#(= ~alt_malloc_balance~0 0)} is VALID [2022-02-21 03:17:20,078 INFO L290 TraceCheckUtils]: 41: Hoare triple {50094#(= ~alt_malloc_balance~0 0)} assume main_~users~0#1.base == 0 && main_~users~0#1.offset == 0;call write~$Pointer$(0, 0, main_~user~0#1.base, 16 + main_~user~0#1.offset, 4);call write~$Pointer$(0, 0, main_~user~0#1.base, 12 + main_~user~0#1.offset, 4); {50094#(= ~alt_malloc_balance~0 0)} is VALID [2022-02-21 03:17:20,078 INFO L272 TraceCheckUtils]: 42: Hoare triple {50094#(= ~alt_malloc_balance~0 0)} call main_#t~ret71#1.base, main_#t~ret71#1.offset := alt_malloc(44); {50221#(= ~alt_malloc_balance~0 |old(~alt_malloc_balance~0)|)} is VALID [2022-02-21 03:17:20,079 INFO L290 TraceCheckUtils]: 43: Hoare triple {50221#(= ~alt_malloc_balance~0 |old(~alt_malloc_balance~0)|)} ~sz := #in~sz;#t~post31 := ~alt_malloc_balance~0; {50225#(= |alt_malloc_#t~post31| |old(~alt_malloc_balance~0)|)} is VALID [2022-02-21 03:17:20,079 INFO L290 TraceCheckUtils]: 44: Hoare triple {50225#(= |alt_malloc_#t~post31| |old(~alt_malloc_balance~0)|)} assume 1 + #t~post31 <= 2147483647; {50225#(= |alt_malloc_#t~post31| |old(~alt_malloc_balance~0)|)} is VALID [2022-02-21 03:17:20,079 INFO L290 TraceCheckUtils]: 45: Hoare triple {50225#(= |alt_malloc_#t~post31| |old(~alt_malloc_balance~0)|)} assume 1 + #t~post31 >= -2147483648;~alt_malloc_balance~0 := 1 + #t~post31;call write~int(~sz, ~#alt_malloc_sizes~0.base, ~#alt_malloc_sizes~0.offset + 4 * #t~post31, 4);havoc #t~post31; {50232#(= (+ (- 1) ~alt_malloc_balance~0) |old(~alt_malloc_balance~0)|)} is VALID [2022-02-21 03:17:20,080 INFO L290 TraceCheckUtils]: 46: Hoare triple {50232#(= (+ (- 1) ~alt_malloc_balance~0) |old(~alt_malloc_balance~0)|)} assume !(1 == ~alt_malloc_balance~0); {50236#(and (= (+ (- 1) ~alt_malloc_balance~0) |old(~alt_malloc_balance~0)|) (not (= ~alt_malloc_balance~0 1)))} is VALID [2022-02-21 03:17:20,080 INFO L290 TraceCheckUtils]: 47: Hoare triple {50236#(and (= (+ (- 1) ~alt_malloc_balance~0) |old(~alt_malloc_balance~0)|) (not (= ~alt_malloc_balance~0 1)))} call #t~malloc32.base, #t~malloc32.offset := #Ultimate.allocOnHeap(~sz);#res.base, #res.offset := #t~malloc32.base, #t~malloc32.offset;havoc #t~malloc32.base, #t~malloc32.offset; {50236#(and (= (+ (- 1) ~alt_malloc_balance~0) |old(~alt_malloc_balance~0)|) (not (= ~alt_malloc_balance~0 1)))} is VALID [2022-02-21 03:17:20,080 INFO L290 TraceCheckUtils]: 48: Hoare triple {50236#(and (= (+ (- 1) ~alt_malloc_balance~0) |old(~alt_malloc_balance~0)|) (not (= ~alt_malloc_balance~0 1)))} assume true; {50236#(and (= (+ (- 1) ~alt_malloc_balance~0) |old(~alt_malloc_balance~0)|) (not (= ~alt_malloc_balance~0 1)))} is VALID [2022-02-21 03:17:20,081 INFO L284 TraceCheckUtils]: 49: Hoare quadruple {50236#(and (= (+ (- 1) ~alt_malloc_balance~0) |old(~alt_malloc_balance~0)|) (not (= ~alt_malloc_balance~0 1)))} {50094#(= ~alt_malloc_balance~0 0)} #855#return; {50090#false} is VALID [2022-02-21 03:17:20,081 INFO L290 TraceCheckUtils]: 50: Hoare triple {50090#false} call write~$Pointer$(main_#t~ret71#1.base, main_#t~ret71#1.offset, main_~user~0#1.base, 8 + main_~user~0#1.offset, 4);havoc main_#t~ret71#1.base, main_#t~ret71#1.offset;call main_#t~mem72#1.base, main_#t~mem72#1.offset := read~$Pointer$(main_~user~0#1.base, 8 + main_~user~0#1.offset, 4); {50090#false} is VALID [2022-02-21 03:17:20,081 INFO L290 TraceCheckUtils]: 51: Hoare triple {50090#false} assume !(main_#t~mem72#1.base == 0 && main_#t~mem72#1.offset == 0);havoc main_#t~mem72#1.base, main_#t~mem72#1.offset;call main_#t~mem73#1.base, main_#t~mem73#1.offset := read~$Pointer$(main_~user~0#1.base, 8 + main_~user~0#1.offset, 4); {50090#false} is VALID [2022-02-21 03:17:20,081 INFO L272 TraceCheckUtils]: 52: Hoare triple {50090#false} call alt_bzero(main_#t~mem73#1.base, main_#t~mem73#1.offset, 44); {50090#false} is VALID [2022-02-21 03:17:20,081 INFO L290 TraceCheckUtils]: 53: Hoare triple {50090#false} ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; {50090#false} is VALID [2022-02-21 03:17:20,081 INFO L290 TraceCheckUtils]: 54: Hoare triple {50090#false} assume 1 + ~alt_bzero_count~0 <= 2147483647; {50090#false} is VALID [2022-02-21 03:17:20,081 INFO L290 TraceCheckUtils]: 55: Hoare triple {50090#false} assume 1 + ~alt_bzero_count~0 >= -2147483648;#t~pre37#1 := 1 + ~alt_bzero_count~0;~alt_bzero_count~0 := 1 + ~alt_bzero_count~0;havoc #t~pre37#1;assume { :begin_inline_#Ultimate.C_memset } true;#Ultimate.C_memset_#ptr#1.base, #Ultimate.C_memset_#ptr#1.offset, #Ultimate.C_memset_#value#1, #Ultimate.C_memset_#amount#1 := ~a#1.base, ~a#1.offset, 0, ~n#1;havoc #Ultimate.C_memset_#res#1.base, #Ultimate.C_memset_#res#1.offset;havoc #Ultimate.C_memset_#t~loopctr269#1;#Ultimate.C_memset_#t~loopctr269#1 := 0; {50090#false} is VALID [2022-02-21 03:17:20,082 INFO L290 TraceCheckUtils]: 56: Hoare triple {50090#false} assume !(#Ultimate.C_memset_#t~loopctr269#1 % 4294967296 < #Ultimate.C_memset_#amount#1 % 4294967296); {50090#false} is VALID [2022-02-21 03:17:20,082 INFO L290 TraceCheckUtils]: 57: Hoare triple {50090#false} assume #Ultimate.C_memset_#res#1.base == #Ultimate.C_memset_#ptr#1.base && #Ultimate.C_memset_#res#1.offset == #Ultimate.C_memset_#ptr#1.offset;#t~memset~res38#1.base, #t~memset~res38#1.offset := #Ultimate.C_memset_#res#1.base, #Ultimate.C_memset_#res#1.offset;assume { :end_inline_#Ultimate.C_memset } true;havoc #t~memset~res38#1.base, #t~memset~res38#1.offset; {50090#false} is VALID [2022-02-21 03:17:20,082 INFO L290 TraceCheckUtils]: 58: Hoare triple {50090#false} assume true; {50090#false} is VALID [2022-02-21 03:17:20,082 INFO L284 TraceCheckUtils]: 59: Hoare quadruple {50090#false} {50090#false} #857#return; {50090#false} is VALID [2022-02-21 03:17:20,082 INFO L290 TraceCheckUtils]: 60: Hoare triple {50090#false} havoc main_#t~mem73#1.base, main_#t~mem73#1.offset;call main_#t~mem74#1.base, main_#t~mem74#1.offset := read~$Pointer$(main_~user~0#1.base, 8 + main_~user~0#1.offset, 4);call write~$Pointer$(main_~user~0#1.base, 8 + main_~user~0#1.offset, main_#t~mem74#1.base, 16 + main_#t~mem74#1.offset, 4);havoc main_#t~mem74#1.base, main_#t~mem74#1.offset;call main_#t~mem75#1.base, main_#t~mem75#1.offset := read~$Pointer$(main_~user~0#1.base, 8 + main_~user~0#1.offset, 4);call write~int(32, main_#t~mem75#1.base, 4 + main_#t~mem75#1.offset, 4);havoc main_#t~mem75#1.base, main_#t~mem75#1.offset;call main_#t~mem76#1.base, main_#t~mem76#1.offset := read~$Pointer$(main_~user~0#1.base, 8 + main_~user~0#1.offset, 4);call write~int(5, main_#t~mem76#1.base, 8 + main_#t~mem76#1.offset, 4);havoc main_#t~mem76#1.base, main_#t~mem76#1.offset;call main_#t~mem77#1.base, main_#t~mem77#1.offset := read~$Pointer$(main_~user~0#1.base, 8 + main_~user~0#1.offset, 4);call write~int((if 8 + main_~user~0#1.offset - main_~user~0#1.offset < 0 && 0 != (8 + main_~user~0#1.offset - main_~user~0#1.offset) % 1 then 1 + (8 + main_~user~0#1.offset - main_~user~0#1.offset) / 1 else (8 + main_~user~0#1.offset - main_~user~0#1.offset) / 1), main_#t~mem77#1.base, 20 + main_#t~mem77#1.offset, 4);havoc main_#t~mem77#1.base, main_#t~mem77#1.offset;call main_#t~mem78#1.base, main_#t~mem78#1.offset := read~$Pointer$(main_~user~0#1.base, 8 + main_~user~0#1.offset, 4); {50090#false} is VALID [2022-02-21 03:17:20,082 INFO L272 TraceCheckUtils]: 61: Hoare triple {50090#false} call main_#t~ret79#1.base, main_#t~ret79#1.offset := alt_malloc(384); {50090#false} is VALID [2022-02-21 03:17:20,082 INFO L290 TraceCheckUtils]: 62: Hoare triple {50090#false} ~sz := #in~sz;#t~post31 := ~alt_malloc_balance~0; {50090#false} is VALID [2022-02-21 03:17:20,082 INFO L290 TraceCheckUtils]: 63: Hoare triple {50090#false} assume 1 + #t~post31 <= 2147483647; {50090#false} is VALID [2022-02-21 03:17:20,082 INFO L290 TraceCheckUtils]: 64: Hoare triple {50090#false} assume 1 + #t~post31 >= -2147483648;~alt_malloc_balance~0 := 1 + #t~post31;call write~int(~sz, ~#alt_malloc_sizes~0.base, ~#alt_malloc_sizes~0.offset + 4 * #t~post31, 4);havoc #t~post31; {50090#false} is VALID [2022-02-21 03:17:20,082 INFO L290 TraceCheckUtils]: 65: Hoare triple {50090#false} assume !(1 == ~alt_malloc_balance~0); {50090#false} is VALID [2022-02-21 03:17:20,082 INFO L290 TraceCheckUtils]: 66: Hoare triple {50090#false} call #t~malloc32.base, #t~malloc32.offset := #Ultimate.allocOnHeap(~sz);#res.base, #res.offset := #t~malloc32.base, #t~malloc32.offset;havoc #t~malloc32.base, #t~malloc32.offset; {50090#false} is VALID [2022-02-21 03:17:20,082 INFO L290 TraceCheckUtils]: 67: Hoare triple {50090#false} assume true; {50090#false} is VALID [2022-02-21 03:17:20,082 INFO L284 TraceCheckUtils]: 68: Hoare quadruple {50090#false} {50090#false} #859#return; {50090#false} is VALID [2022-02-21 03:17:20,082 INFO L290 TraceCheckUtils]: 69: Hoare triple {50090#false} call write~$Pointer$(main_#t~ret79#1.base, main_#t~ret79#1.offset, main_#t~mem78#1.base, main_#t~mem78#1.offset, 4);havoc main_#t~mem78#1.base, main_#t~mem78#1.offset;havoc main_#t~ret79#1.base, main_#t~ret79#1.offset;call main_#t~mem80#1.base, main_#t~mem80#1.offset := read~$Pointer$(main_~user~0#1.base, 8 + main_~user~0#1.offset, 4);call write~int(2685476833, main_#t~mem80#1.base, 40 + main_#t~mem80#1.offset, 4);havoc main_#t~mem80#1.base, main_#t~mem80#1.offset;call main_#t~mem81#1.base, main_#t~mem81#1.offset := read~$Pointer$(main_~user~0#1.base, 8 + main_~user~0#1.offset, 4);call main_#t~mem82#1.base, main_#t~mem82#1.offset := read~$Pointer$(main_#t~mem81#1.base, main_#t~mem81#1.offset, 4); {50090#false} is VALID [2022-02-21 03:17:20,082 INFO L290 TraceCheckUtils]: 70: Hoare triple {50090#false} assume !(main_#t~mem82#1.base == 0 && main_#t~mem82#1.offset == 0);havoc main_#t~mem81#1.base, main_#t~mem81#1.offset;havoc main_#t~mem82#1.base, main_#t~mem82#1.offset;call main_#t~mem84#1.base, main_#t~mem84#1.offset := read~$Pointer$(main_~user~0#1.base, 8 + main_~user~0#1.offset, 4);call main_#t~mem85#1.base, main_#t~mem85#1.offset := read~$Pointer$(main_#t~mem84#1.base, main_#t~mem84#1.offset, 4); {50090#false} is VALID [2022-02-21 03:17:20,083 INFO L272 TraceCheckUtils]: 71: Hoare triple {50090#false} call alt_bzero(main_#t~mem85#1.base, main_#t~mem85#1.offset, 384); {50090#false} is VALID [2022-02-21 03:17:20,083 INFO L290 TraceCheckUtils]: 72: Hoare triple {50090#false} ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; {50090#false} is VALID [2022-02-21 03:17:20,083 INFO L290 TraceCheckUtils]: 73: Hoare triple {50090#false} assume 1 + ~alt_bzero_count~0 <= 2147483647; {50090#false} is VALID [2022-02-21 03:17:20,083 INFO L290 TraceCheckUtils]: 74: Hoare triple {50090#false} assume 1 + ~alt_bzero_count~0 >= -2147483648;#t~pre37#1 := 1 + ~alt_bzero_count~0;~alt_bzero_count~0 := 1 + ~alt_bzero_count~0;havoc #t~pre37#1;assume { :begin_inline_#Ultimate.C_memset } true;#Ultimate.C_memset_#ptr#1.base, #Ultimate.C_memset_#ptr#1.offset, #Ultimate.C_memset_#value#1, #Ultimate.C_memset_#amount#1 := ~a#1.base, ~a#1.offset, 0, ~n#1;havoc #Ultimate.C_memset_#res#1.base, #Ultimate.C_memset_#res#1.offset;havoc #Ultimate.C_memset_#t~loopctr269#1;#Ultimate.C_memset_#t~loopctr269#1 := 0; {50090#false} is VALID [2022-02-21 03:17:20,083 INFO L290 TraceCheckUtils]: 75: Hoare triple {50090#false} assume !(#Ultimate.C_memset_#t~loopctr269#1 % 4294967296 < #Ultimate.C_memset_#amount#1 % 4294967296); {50090#false} is VALID [2022-02-21 03:17:20,083 INFO L290 TraceCheckUtils]: 76: Hoare triple {50090#false} assume #Ultimate.C_memset_#res#1.base == #Ultimate.C_memset_#ptr#1.base && #Ultimate.C_memset_#res#1.offset == #Ultimate.C_memset_#ptr#1.offset;#t~memset~res38#1.base, #t~memset~res38#1.offset := #Ultimate.C_memset_#res#1.base, #Ultimate.C_memset_#res#1.offset;assume { :end_inline_#Ultimate.C_memset } true;havoc #t~memset~res38#1.base, #t~memset~res38#1.offset; {50090#false} is VALID [2022-02-21 03:17:20,083 INFO L290 TraceCheckUtils]: 77: Hoare triple {50090#false} assume true; {50090#false} is VALID [2022-02-21 03:17:20,083 INFO L284 TraceCheckUtils]: 78: Hoare quadruple {50090#false} {50090#false} #863#return; {50090#false} is VALID [2022-02-21 03:17:20,083 INFO L290 TraceCheckUtils]: 79: Hoare triple {50090#false} havoc main_#t~mem84#1.base, main_#t~mem84#1.offset;havoc main_#t~mem85#1.base, main_#t~mem85#1.offset; {50090#false} is VALID [2022-02-21 03:17:20,083 INFO L290 TraceCheckUtils]: 80: Hoare triple {50090#false} goto; {50090#false} is VALID [2022-02-21 03:17:20,083 INFO L290 TraceCheckUtils]: 81: Hoare triple {50090#false} main_~users~0#1.base, main_~users~0#1.offset := main_~user~0#1.base, main_~user~0#1.offset; {50090#false} is VALID [2022-02-21 03:17:20,083 INFO L290 TraceCheckUtils]: 82: Hoare triple {50090#false} havoc main_~_ha_bkt~0#1;call main_#t~mem94#1.base, main_#t~mem94#1.offset := read~$Pointer$(main_~users~0#1.base, 8 + main_~users~0#1.offset, 4);call main_#t~mem95#1 := read~int(main_#t~mem94#1.base, 12 + main_#t~mem94#1.offset, 4);main_#t~post96#1 := main_#t~mem95#1;call write~int(1 + main_#t~post96#1, main_#t~mem94#1.base, 12 + main_#t~mem94#1.offset, 4);havoc main_#t~mem94#1.base, main_#t~mem94#1.offset;havoc main_#t~mem95#1;havoc main_#t~post96#1; {50090#false} is VALID [2022-02-21 03:17:20,083 INFO L290 TraceCheckUtils]: 83: Hoare triple {50090#false} call main_#t~mem97#1.base, main_#t~mem97#1.offset := read~$Pointer$(main_~users~0#1.base, 8 + main_~users~0#1.offset, 4);call main_#t~mem98#1 := read~int(main_#t~mem97#1.base, 4 + main_#t~mem97#1.offset, 4);main_~_ha_bkt~0#1 := (if 0 == main_~_ha_hashv~0#1 || 0 == main_#t~mem98#1 - 1 then 0 else (if 1 == main_#t~mem98#1 - 1 then (if 1 == main_~_ha_hashv~0#1 || 0 == main_~_ha_hashv~0#1 then main_~_ha_hashv~0#1 else (if main_~_ha_hashv~0#1 >= 0 then main_~_ha_hashv~0#1 % 2 else ~bitwiseAnd(main_~_ha_hashv~0#1, main_#t~mem98#1 - 1))) else (if 1 == main_~_ha_hashv~0#1 then (if 1 == main_#t~mem98#1 - 1 || 0 == main_#t~mem98#1 - 1 then main_#t~mem98#1 - 1 else (if main_#t~mem98#1 - 1 >= 0 then (main_#t~mem98#1 - 1) % 2 else ~bitwiseAnd(main_~_ha_hashv~0#1, main_#t~mem98#1 - 1))) else ~bitwiseAnd(main_~_ha_hashv~0#1, main_#t~mem98#1 - 1))));havoc main_#t~mem97#1.base, main_#t~mem97#1.offset;havoc main_#t~mem98#1; {50090#false} is VALID [2022-02-21 03:17:20,084 INFO L290 TraceCheckUtils]: 84: Hoare triple {50090#false} goto; {50090#false} is VALID [2022-02-21 03:17:20,084 INFO L290 TraceCheckUtils]: 85: Hoare triple {50090#false} call main_#t~mem99#1.base, main_#t~mem99#1.offset := read~$Pointer$(main_~users~0#1.base, 8 + main_~users~0#1.offset, 4);call main_#t~mem100#1.base, main_#t~mem100#1.offset := read~$Pointer$(main_#t~mem99#1.base, main_#t~mem99#1.offset, 4);main_~_ha_head~0#1.base, main_~_ha_head~0#1.offset := main_#t~mem100#1.base, main_#t~mem100#1.offset + 12 * (if main_~_ha_bkt~0#1 % 4294967296 % 4294967296 <= 2147483647 then main_~_ha_bkt~0#1 % 4294967296 % 4294967296 else main_~_ha_bkt~0#1 % 4294967296 % 4294967296 - 4294967296);havoc main_#t~mem99#1.base, main_#t~mem99#1.offset;havoc main_#t~mem100#1.base, main_#t~mem100#1.offset;call main_#t~mem101#1 := read~int(main_~_ha_head~0#1.base, 4 + main_~_ha_head~0#1.offset, 4);main_#t~post102#1 := main_#t~mem101#1;call write~int(1 + main_#t~post102#1, main_~_ha_head~0#1.base, 4 + main_~_ha_head~0#1.offset, 4);havoc main_#t~mem101#1;havoc main_#t~post102#1;call main_#t~mem103#1.base, main_#t~mem103#1.offset := read~$Pointer$(main_~_ha_head~0#1.base, main_~_ha_head~0#1.offset, 4);call write~$Pointer$(main_#t~mem103#1.base, main_#t~mem103#1.offset, main_~user~0#1.base, 24 + main_~user~0#1.offset, 4);havoc main_#t~mem103#1.base, main_#t~mem103#1.offset;call write~$Pointer$(0, 0, main_~user~0#1.base, 20 + main_~user~0#1.offset, 4);call main_#t~mem104#1.base, main_#t~mem104#1.offset := read~$Pointer$(main_~_ha_head~0#1.base, main_~_ha_head~0#1.offset, 4); {50090#false} is VALID [2022-02-21 03:17:20,084 INFO L290 TraceCheckUtils]: 86: Hoare triple {50090#false} assume main_#t~mem104#1.base != 0 || main_#t~mem104#1.offset != 0;havoc main_#t~mem104#1.base, main_#t~mem104#1.offset;call main_#t~mem105#1.base, main_#t~mem105#1.offset := read~$Pointer$(main_~_ha_head~0#1.base, main_~_ha_head~0#1.offset, 4);call write~$Pointer$(main_~user~0#1.base, 8 + main_~user~0#1.offset, main_#t~mem105#1.base, 12 + main_#t~mem105#1.offset, 4);havoc main_#t~mem105#1.base, main_#t~mem105#1.offset; {50090#false} is VALID [2022-02-21 03:17:20,084 INFO L290 TraceCheckUtils]: 87: Hoare triple {50090#false} call write~$Pointer$(main_~user~0#1.base, 8 + main_~user~0#1.offset, main_~_ha_head~0#1.base, main_~_ha_head~0#1.offset, 4);call main_#t~mem107#1 := read~int(main_~_ha_head~0#1.base, 4 + main_~_ha_head~0#1.offset, 4);call main_#t~mem106#1 := read~int(main_~_ha_head~0#1.base, 8 + main_~_ha_head~0#1.offset, 4);main_#t~short110#1 := main_#t~mem107#1 % 4294967296 >= 10 * (1 + main_#t~mem106#1) % 4294967296; {50090#false} is VALID [2022-02-21 03:17:20,084 INFO L290 TraceCheckUtils]: 88: Hoare triple {50090#false} assume main_#t~short110#1;call main_#t~mem108#1.base, main_#t~mem108#1.offset := read~$Pointer$(main_~user~0#1.base, 8 + main_~user~0#1.offset, 4);call main_#t~mem109#1 := read~int(main_#t~mem108#1.base, 36 + main_#t~mem108#1.offset, 4);main_#t~short110#1 := 0 == main_#t~mem109#1 % 4294967296; {50090#false} is VALID [2022-02-21 03:17:20,084 INFO L290 TraceCheckUtils]: 89: Hoare triple {50090#false} assume !main_#t~short110#1;havoc main_#t~mem107#1;havoc main_#t~mem106#1;havoc main_#t~mem108#1.base, main_#t~mem108#1.offset;havoc main_#t~mem109#1;havoc main_#t~short110#1; {50090#false} is VALID [2022-02-21 03:17:20,084 INFO L290 TraceCheckUtils]: 90: Hoare triple {50090#false} goto; {50090#false} is VALID [2022-02-21 03:17:20,084 INFO L290 TraceCheckUtils]: 91: Hoare triple {50090#false} goto; {50090#false} is VALID [2022-02-21 03:17:20,084 INFO L290 TraceCheckUtils]: 92: Hoare triple {50090#false} goto; {50090#false} is VALID [2022-02-21 03:17:20,084 INFO L290 TraceCheckUtils]: 93: Hoare triple {50090#false} goto; {50090#false} is VALID [2022-02-21 03:17:20,084 INFO L290 TraceCheckUtils]: 94: Hoare triple {50090#false} call main_#t~mem40#1 := read~int(main_~#i~0#1.base, main_~#i~0#1.offset, 4);main_#t~post41#1 := main_#t~mem40#1; {50090#false} is VALID [2022-02-21 03:17:20,084 INFO L290 TraceCheckUtils]: 95: Hoare triple {50090#false} assume !(1 + main_#t~post41#1 <= 2147483647); {50090#false} is VALID [2022-02-21 03:17:20,085 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-02-21 03:17:20,085 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-21 03:17:20,085 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 03:17:20,085 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2071656386] [2022-02-21 03:17:20,085 WARN L317 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-02-21 03:17:20,085 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2067508557] [2022-02-21 03:17:20,085 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2067508557] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-21 03:17:20,085 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-21 03:17:20,085 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-02-21 03:17:20,086 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1588299359] [2022-02-21 03:17:20,086 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-21 03:17:20,086 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 11.714285714285714) internal successors, (82), 5 states have internal predecessors, (82), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 1 states have call predecessors, (4), 2 states have call successors, (4) Word has length 96 [2022-02-21 03:17:20,086 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-21 03:17:20,087 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 7 states, 7 states have (on average 11.714285714285714) internal successors, (82), 5 states have internal predecessors, (82), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 1 states have call predecessors, (4), 2 states have call successors, (4) [2022-02-21 03:17:20,170 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 90 edges. 90 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:17:20,171 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-02-21 03:17:20,171 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 03:17:20,171 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-02-21 03:17:20,171 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-02-21 03:17:20,171 INFO L87 Difference]: Start difference. First operand 2995 states and 3871 transitions. Second operand has 7 states, 7 states have (on average 11.714285714285714) internal successors, (82), 5 states have internal predecessors, (82), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 1 states have call predecessors, (4), 2 states have call successors, (4) [2022-02-21 03:17:23,522 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:17:23,522 INFO L93 Difference]: Finished difference Result 5929 states and 7675 transitions. [2022-02-21 03:17:23,522 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-02-21 03:17:23,522 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 11.714285714285714) internal successors, (82), 5 states have internal predecessors, (82), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 1 states have call predecessors, (4), 2 states have call successors, (4) Word has length 96 [2022-02-21 03:17:23,522 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-21 03:17:23,523 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 11.714285714285714) internal successors, (82), 5 states have internal predecessors, (82), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 1 states have call predecessors, (4), 2 states have call successors, (4) [2022-02-21 03:17:23,525 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 627 transitions. [2022-02-21 03:17:23,526 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 11.714285714285714) internal successors, (82), 5 states have internal predecessors, (82), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 1 states have call predecessors, (4), 2 states have call successors, (4) [2022-02-21 03:17:23,528 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 627 transitions. [2022-02-21 03:17:23,528 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 9 states and 627 transitions. [2022-02-21 03:17:23,981 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 627 edges. 627 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:17:24,284 INFO L225 Difference]: With dead ends: 5929 [2022-02-21 03:17:24,284 INFO L226 Difference]: Without dead ends: 2995 [2022-02-21 03:17:24,287 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 90 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2022-02-21 03:17:24,288 INFO L933 BasicCegarLoop]: 273 mSDtfsCounter, 40 mSDsluCounter, 1234 mSDsCounter, 0 mSdLazyCounter, 167 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 41 SdHoareTripleChecker+Valid, 1507 SdHoareTripleChecker+Invalid, 177 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 167 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-21 03:17:24,288 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [41 Valid, 1507 Invalid, 177 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 167 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-21 03:17:24,290 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2995 states. [2022-02-21 03:17:25,084 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2995 to 2995. [2022-02-21 03:17:25,085 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 03:17:25,099 INFO L82 GeneralOperation]: Start isEquivalent. First operand 2995 states. Second operand has 2995 states, 2839 states have (on average 1.2796759422331807) internal successors, (3633), 2855 states have internal predecessors, (3633), 102 states have call successors, (102), 51 states have call predecessors, (102), 41 states have return successors, (135), 88 states have call predecessors, (135), 102 states have call successors, (135) [2022-02-21 03:17:25,104 INFO L74 IsIncluded]: Start isIncluded. First operand 2995 states. Second operand has 2995 states, 2839 states have (on average 1.2796759422331807) internal successors, (3633), 2855 states have internal predecessors, (3633), 102 states have call successors, (102), 51 states have call predecessors, (102), 41 states have return successors, (135), 88 states have call predecessors, (135), 102 states have call successors, (135) [2022-02-21 03:17:25,109 INFO L87 Difference]: Start difference. First operand 2995 states. Second operand has 2995 states, 2839 states have (on average 1.2796759422331807) internal successors, (3633), 2855 states have internal predecessors, (3633), 102 states have call successors, (102), 51 states have call predecessors, (102), 41 states have return successors, (135), 88 states have call predecessors, (135), 102 states have call successors, (135) [2022-02-21 03:17:25,325 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:17:25,327 INFO L93 Difference]: Finished difference Result 2995 states and 3870 transitions. [2022-02-21 03:17:25,327 INFO L276 IsEmpty]: Start isEmpty. Operand 2995 states and 3870 transitions. [2022-02-21 03:17:25,331 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:17:25,332 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:17:25,335 INFO L74 IsIncluded]: Start isIncluded. First operand has 2995 states, 2839 states have (on average 1.2796759422331807) internal successors, (3633), 2855 states have internal predecessors, (3633), 102 states have call successors, (102), 51 states have call predecessors, (102), 41 states have return successors, (135), 88 states have call predecessors, (135), 102 states have call successors, (135) Second operand 2995 states. [2022-02-21 03:17:25,339 INFO L87 Difference]: Start difference. First operand has 2995 states, 2839 states have (on average 1.2796759422331807) internal successors, (3633), 2855 states have internal predecessors, (3633), 102 states have call successors, (102), 51 states have call predecessors, (102), 41 states have return successors, (135), 88 states have call predecessors, (135), 102 states have call successors, (135) Second operand 2995 states. [2022-02-21 03:17:25,567 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:17:25,567 INFO L93 Difference]: Finished difference Result 2995 states and 3870 transitions. [2022-02-21 03:17:25,567 INFO L276 IsEmpty]: Start isEmpty. Operand 2995 states and 3870 transitions. [2022-02-21 03:17:25,572 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:17:25,572 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:17:25,572 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 03:17:25,572 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 03:17:25,576 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2995 states, 2839 states have (on average 1.2796759422331807) internal successors, (3633), 2855 states have internal predecessors, (3633), 102 states have call successors, (102), 51 states have call predecessors, (102), 41 states have return successors, (135), 88 states have call predecessors, (135), 102 states have call successors, (135) [2022-02-21 03:17:25,860 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2995 states to 2995 states and 3870 transitions. [2022-02-21 03:17:25,860 INFO L78 Accepts]: Start accepts. Automaton has 2995 states and 3870 transitions. Word has length 96 [2022-02-21 03:17:25,861 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-21 03:17:25,861 INFO L470 AbstractCegarLoop]: Abstraction has 2995 states and 3870 transitions. [2022-02-21 03:17:25,861 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 11.714285714285714) internal successors, (82), 5 states have internal predecessors, (82), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 1 states have call predecessors, (4), 2 states have call successors, (4) [2022-02-21 03:17:25,861 INFO L276 IsEmpty]: Start isEmpty. Operand 2995 states and 3870 transitions. [2022-02-21 03:17:25,862 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2022-02-21 03:17:25,862 INFO L506 BasicCegarLoop]: Found error trace [2022-02-21 03:17:25,862 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-21 03:17:25,900 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2022-02-21 03:17:26,083 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2022-02-21 03:17:26,083 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [alt_mallocErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, alt_mallocErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, alt_freeErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2022-02-21 03:17:26,084 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:17:26,084 INFO L85 PathProgramCache]: Analyzing trace with hash 120930980, now seen corresponding path program 1 times [2022-02-21 03:17:26,084 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:17:26,084 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [16313498] [2022-02-21 03:17:26,084 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:17:26,084 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:17:26,118 ERROR L252 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-02-21 03:17:26,118 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2140942126] [2022-02-21 03:17:26,118 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:17:26,119 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-21 03:17:26,119 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:17:26,120 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-02-21 03:17:26,122 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2022-02-21 03:17:26,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:17:26,578 INFO L263 TraceCheckSpWp]: Trace formula consists of 776 conjuncts, 18 conjunts are in the unsatisfiable core [2022-02-21 03:17:26,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:17:26,623 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 03:17:26,869 INFO L290 TraceCheckUtils]: 0: Hoare triple {66911#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(21, 2);~#alt_malloc_sizes~0.base, ~#alt_malloc_sizes~0.offset := 3, 0;call #Ultimate.allocInit(40, 3);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#alt_malloc_sizes~0.base);~alt_malloc_balance~0 := 0;~alt_memcmp_count~0 := 0;~alt_bzero_count~0 := 0; {66911#true} is VALID [2022-02-21 03:17:26,869 INFO L290 TraceCheckUtils]: 1: Hoare triple {66911#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret43#1.base, main_#t~ret43#1.offset, main_#t~mem44#1, main_#t~mem45#1, main_#t~mem46#1, main_#t~mem48#1, main_#t~mem47#1, main_#t~mem49#1, main_#t~mem50#1, main_#t~mem52#1, main_#t~mem51#1, main_#t~mem53#1, main_#t~mem54#1, main_#t~mem56#1, main_#t~mem55#1, main_#t~mem57#1, main_#t~mem58#1, main_#t~switch59#1, main_#t~mem60#1, main_#t~mem61#1, main_#t~mem62#1, main_#t~mem63#1, main_#t~mem64#1, main_#t~mem65#1, main_#t~mem66#1, main_#t~mem67#1, main_#t~mem68#1, main_#t~mem69#1, main_#t~mem70#1, main_~_hj_i~0#1, main_~_hj_j~0#1, main_~_hj_k~0#1, main_~_hj_key~0#1.base, main_~_hj_key~0#1.offset, main_#t~ret71#1.base, main_#t~ret71#1.offset, main_#t~mem72#1.base, main_#t~mem72#1.offset, main_#t~mem73#1.base, main_#t~mem73#1.offset, main_#t~mem74#1.base, main_#t~mem74#1.offset, main_#t~mem75#1.base, main_#t~mem75#1.offset, main_#t~mem76#1.base, main_#t~mem76#1.offset, main_#t~mem77#1.base, main_#t~mem77#1.offset, main_#t~mem78#1.base, main_#t~mem78#1.offset, main_#t~ret79#1.base, main_#t~ret79#1.offset, main_#t~mem80#1.base, main_#t~mem80#1.offset, main_#t~mem81#1.base, main_#t~mem81#1.offset, main_#t~mem82#1.base, main_#t~mem82#1.offset, main_#t~mem83#1.base, main_#t~mem83#1.offset, main_#t~mem84#1.base, main_#t~mem84#1.offset, main_#t~mem85#1.base, main_#t~mem85#1.offset, main_#t~mem86#1.base, main_#t~mem86#1.offset, main_#t~mem87#1.base, main_#t~mem87#1.offset, main_#t~mem88#1.base, main_#t~mem88#1.offset, main_#t~mem89#1.base, main_#t~mem89#1.offset, main_#t~mem90#1, main_#t~mem91#1.base, main_#t~mem91#1.offset, main_#t~mem92#1.base, main_#t~mem92#1.offset, main_#t~mem93#1.base, main_#t~mem93#1.offset, main_#t~mem94#1.base, main_#t~mem94#1.offset, main_#t~mem95#1, main_#t~post96#1, main_#t~mem97#1.base, main_#t~mem97#1.offset, main_#t~mem98#1, main_#t~mem99#1.base, main_#t~mem99#1.offset, main_#t~mem100#1.base, main_#t~mem100#1.offset, main_#t~mem101#1, main_#t~post102#1, main_#t~mem103#1.base, main_#t~mem103#1.offset, main_#t~mem104#1.base, main_#t~mem104#1.offset, main_#t~mem105#1.base, main_#t~mem105#1.offset, main_#t~mem107#1, main_#t~mem106#1, main_#t~mem108#1.base, main_#t~mem108#1.offset, main_#t~mem109#1, main_#t~short110#1, main_#t~mem111#1.base, main_#t~mem111#1.offset, main_#t~mem112#1, main_#t~ret113#1.base, main_#t~ret113#1.offset, main_#t~mem114#1.base, main_#t~mem114#1.offset, main_#t~mem115#1.base, main_#t~mem115#1.offset, main_#t~mem116#1.base, main_#t~mem116#1.offset, main_#t~mem117#1, main_#t~mem118#1.base, main_#t~mem118#1.offset, main_#t~mem119#1.base, main_#t~mem119#1.offset, main_#t~mem122#1, main_#t~mem120#1.base, main_#t~mem120#1.offset, main_#t~mem121#1, main_#t~mem123#1.base, main_#t~mem123#1.offset, main_#t~mem126#1, main_#t~mem124#1.base, main_#t~mem124#1.offset, main_#t~mem125#1, main_#t~ite127#1, main_#t~mem128#1.base, main_#t~mem128#1.offset, main_#t~mem132#1.base, main_#t~mem132#1.offset, main_#t~mem133#1.base, main_#t~mem133#1.offset, main_#t~mem134#1.base, main_#t~mem134#1.offset, main_#t~mem135#1.base, main_#t~mem135#1.offset, main_#t~mem138#1, main_#t~mem136#1.base, main_#t~mem136#1.offset, main_#t~mem137#1, main_#t~mem139#1.base, main_#t~mem139#1.offset, main_#t~mem140#1, main_#t~pre141#1, main_#t~mem142#1.base, main_#t~mem142#1.offset, main_#t~mem143#1, main_#t~mem144#1.base, main_#t~mem144#1.offset, main_#t~mem145#1, main_#t~post146#1, main_#t~mem150#1, main_#t~mem148#1, main_#t~mem147#1.base, main_#t~mem147#1.offset, main_#t~mem149#1, main_#t~mem151#1, main_#t~post152#1, main_#t~mem153#1.base, main_#t~mem153#1.offset, main_#t~mem154#1.base, main_#t~mem154#1.offset, main_#t~mem155#1.base, main_#t~mem155#1.offset, main_#t~post129#1, main_#t~mem130#1.base, main_#t~mem130#1.offset, main_#t~mem131#1, main_#t~mem156#1.base, main_#t~mem156#1.offset, main_#t~mem157#1.base, main_#t~mem157#1.offset, main_#t~mem158#1.base, main_#t~mem158#1.offset, main_#t~mem159#1, main_#t~mem160#1.base, main_#t~mem160#1.offset, main_#t~mem161#1, main_#t~mem162#1.base, main_#t~mem162#1.offset, main_#t~mem163#1, main_#t~post164#1, main_#t~mem165#1.base, main_#t~mem165#1.offset, main_#t~mem166#1.base, main_#t~mem166#1.offset, main_#t~mem167#1.base, main_#t~mem167#1.offset, main_#t~mem168#1.base, main_#t~mem168#1.offset, main_#t~mem171#1, main_#t~mem169#1.base, main_#t~mem169#1.offset, main_#t~mem170#1, main_#t~ite174#1, main_#t~mem172#1.base, main_#t~mem172#1.offset, main_#t~mem173#1, main_#t~mem175#1.base, main_#t~mem175#1.offset, main_#t~mem176#1, main_#t~mem177#1.base, main_#t~mem177#1.offset, main_~_he_bkt~0#1, main_~_he_bkt_i~0#1, main_~_he_thh~0#1.base, main_~_he_thh~0#1.offset, main_~_he_hh_nxt~0#1.base, main_~_he_hh_nxt~0#1.offset, main_~#_he_new_buckets~0#1.base, main_~#_he_new_buckets~0#1.offset, main_~_he_newbkt~0#1.base, main_~_he_newbkt~0#1.offset, main_~_ha_head~0#1.base, main_~_ha_head~0#1.offset, main_~_ha_bkt~0#1, main_~_ha_hashv~0#1, main_#t~mem40#1, main_#t~post41#1, main_#t~mem42#1, main_#t~mem182#1, main_#t~mem181#1, main_#t~mem183#1, main_#t~mem184#1, main_#t~mem186#1, main_#t~mem185#1, main_#t~mem187#1, main_#t~mem188#1, main_#t~mem190#1, main_#t~mem189#1, main_#t~mem191#1, main_#t~mem192#1, main_#t~switch193#1, main_#t~mem194#1, main_#t~mem195#1, main_#t~mem196#1, main_#t~mem197#1, main_#t~mem198#1, main_#t~mem199#1, main_#t~mem200#1, main_#t~mem201#1, main_#t~mem202#1, main_#t~mem203#1, main_#t~mem204#1, main_~_hj_i~1#1, main_~_hj_j~1#1, main_~_hj_k~1#1, main_~_hj_key~1#1.base, main_~_hj_key~1#1.offset, main_#t~mem205#1.base, main_#t~mem205#1.offset, main_#t~mem206#1, main_#t~mem207#1.base, main_#t~mem207#1.offset, main_#t~mem208#1.base, main_#t~mem208#1.offset, main_#t~mem209#1.base, main_#t~mem209#1.offset, main_#t~mem210#1.base, main_#t~mem210#1.offset, main_#t~mem211#1.base, main_#t~mem211#1.offset, main_#t~mem212#1.base, main_#t~mem212#1.offset, main_#t~mem213#1.base, main_#t~mem213#1.offset, main_#t~mem214#1, main_#t~mem215#1, main_#t~mem216#1, main_#t~short217#1, main_#t~mem218#1.base, main_#t~mem218#1.offset, main_#t~ret219#1, main_#t~mem220#1.base, main_#t~mem220#1.offset, main_#t~mem221#1.base, main_#t~mem221#1.offset, main_#t~mem222#1.base, main_#t~mem222#1.offset, main_#t~mem223#1, main_~_hf_bkt~0#1, main_~_hf_hashv~0#1, main_#t~mem224#1.base, main_#t~mem224#1.offset, main_#t~mem225#1.base, main_#t~mem225#1.offset, main_#t~short226#1, main_#t~mem227#1.base, main_#t~mem227#1.offset, main_#t~mem228#1.base, main_#t~mem228#1.offset, main_#t~mem229#1.base, main_#t~mem229#1.offset, main_#t~mem230#1, main_#t~mem231#1.base, main_#t~mem231#1.offset, main_#t~mem232#1.base, main_#t~mem232#1.offset, main_#t~mem233#1.base, main_#t~mem233#1.offset, main_#t~mem234#1.base, main_#t~mem234#1.offset, main_#t~mem235#1.base, main_#t~mem235#1.offset, main_#t~mem236#1.base, main_#t~mem236#1.offset, main_#t~mem237#1, main_#t~mem238#1.base, main_#t~mem238#1.offset, main_#t~mem239#1.base, main_#t~mem239#1.offset, main_#t~mem240#1.base, main_#t~mem240#1.offset, main_#t~mem241#1, main_#t~mem242#1.base, main_#t~mem242#1.offset, main_#t~mem243#1.base, main_#t~mem243#1.offset, main_#t~mem244#1.base, main_#t~mem244#1.offset, main_#t~mem245#1.base, main_#t~mem245#1.offset, main_#t~mem246#1.base, main_#t~mem246#1.offset, main_#t~mem247#1, main_#t~mem248#1.base, main_#t~mem248#1.offset, main_#t~mem251#1, main_#t~mem249#1.base, main_#t~mem249#1.offset, main_#t~mem250#1, main_#t~mem252#1.base, main_#t~mem252#1.offset, main_#t~mem253#1.base, main_#t~mem253#1.offset, main_#t~mem254#1, main_#t~post255#1, main_#t~mem256#1.base, main_#t~mem256#1.offset, main_#t~mem257#1.base, main_#t~mem257#1.offset, main_#t~mem258#1.base, main_#t~mem258#1.offset, main_#t~mem259#1.base, main_#t~mem259#1.offset, main_#t~mem260#1.base, main_#t~mem260#1.offset, main_#t~mem261#1.base, main_#t~mem261#1.offset, main_#t~mem262#1.base, main_#t~mem262#1.offset, main_#t~mem263#1.base, main_#t~mem263#1.offset, main_~_hd_head~0#1.base, main_~_hd_head~0#1.offset, main_#t~mem264#1.base, main_#t~mem264#1.offset, main_#t~mem265#1, main_#t~post266#1, main_~_hd_bkt~0#1, main_~_hd_hh_del~0#1.base, main_~_hd_hh_del~0#1.offset, main_#t~mem178#1, main_#t~post179#1, main_#t~mem180#1, main_#t~mem267#1.base, main_#t~mem267#1.offset, main_~#i~0#1.base, main_~#i~0#1.offset, main_~user~0#1.base, main_~user~0#1.offset, main_~tmp~0#1.base, main_~tmp~0#1.offset, main_~users~0#1.base, main_~users~0#1.offset;call main_~#i~0#1.base, main_~#i~0#1.offset := #Ultimate.allocOnStack(4);havoc main_~user~0#1.base, main_~user~0#1.offset;havoc main_~tmp~0#1.base, main_~tmp~0#1.offset;main_~users~0#1.base, main_~users~0#1.offset := 0, 0;call write~int(0, main_~#i~0#1.base, main_~#i~0#1.offset, 4); {66911#true} is VALID [2022-02-21 03:17:26,869 INFO L290 TraceCheckUtils]: 2: Hoare triple {66911#true} call main_#t~mem42#1 := read~int(main_~#i~0#1.base, main_~#i~0#1.offset, 4); {66911#true} is VALID [2022-02-21 03:17:26,869 INFO L290 TraceCheckUtils]: 3: Hoare triple {66911#true} assume !!(main_#t~mem42#1 < 10);havoc main_#t~mem42#1;assume { :begin_inline_real_malloc } true;real_malloc_#in~n#1 := 40;havoc real_malloc_#res#1.base, real_malloc_#res#1.offset;havoc real_malloc_#t~malloc39#1.base, real_malloc_#t~malloc39#1.offset, real_malloc_~n#1;real_malloc_~n#1 := real_malloc_#in~n#1;call real_malloc_#t~malloc39#1.base, real_malloc_#t~malloc39#1.offset := #Ultimate.allocOnHeap(real_malloc_~n#1);real_malloc_#res#1.base, real_malloc_#res#1.offset := real_malloc_#t~malloc39#1.base, real_malloc_#t~malloc39#1.offset;havoc real_malloc_#t~malloc39#1.base, real_malloc_#t~malloc39#1.offset; {66911#true} is VALID [2022-02-21 03:17:26,869 INFO L290 TraceCheckUtils]: 4: Hoare triple {66911#true} main_#t~ret43#1.base, main_#t~ret43#1.offset := real_malloc_#res#1.base, real_malloc_#res#1.offset;assume { :end_inline_real_malloc } true;main_~user~0#1.base, main_~user~0#1.offset := main_#t~ret43#1.base, main_#t~ret43#1.offset;havoc main_#t~ret43#1.base, main_#t~ret43#1.offset; {66911#true} is VALID [2022-02-21 03:17:26,869 INFO L290 TraceCheckUtils]: 5: Hoare triple {66911#true} assume !(main_~user~0#1.base == 0 && main_~user~0#1.offset == 0); {66911#true} is VALID [2022-02-21 03:17:26,869 INFO L290 TraceCheckUtils]: 6: Hoare triple {66911#true} call main_#t~mem44#1 := read~int(main_~#i~0#1.base, main_~#i~0#1.offset, 4);call write~int(main_#t~mem44#1, main_~user~0#1.base, main_~user~0#1.offset, 4);havoc main_#t~mem44#1;call main_#t~mem45#1 := read~int(main_~#i~0#1.base, main_~#i~0#1.offset, 4);call main_#t~mem46#1 := read~int(main_~#i~0#1.base, main_~#i~0#1.offset, 4); {66911#true} is VALID [2022-02-21 03:17:26,869 INFO L290 TraceCheckUtils]: 7: Hoare triple {66911#true} assume main_#t~mem45#1 * main_#t~mem46#1 <= 2147483647; {66911#true} is VALID [2022-02-21 03:17:26,869 INFO L290 TraceCheckUtils]: 8: Hoare triple {66911#true} assume main_#t~mem45#1 * main_#t~mem46#1 >= -2147483648;call write~int(main_#t~mem45#1 * main_#t~mem46#1, main_~user~0#1.base, 4 + main_~user~0#1.offset, 4);havoc main_#t~mem45#1;havoc main_#t~mem46#1; {66911#true} is VALID [2022-02-21 03:17:26,870 INFO L290 TraceCheckUtils]: 9: Hoare triple {66911#true} havoc main_~_ha_hashv~0#1; {66911#true} is VALID [2022-02-21 03:17:26,870 INFO L290 TraceCheckUtils]: 10: Hoare triple {66911#true} goto; {66911#true} is VALID [2022-02-21 03:17:26,870 INFO L290 TraceCheckUtils]: 11: Hoare triple {66911#true} havoc main_~_hj_i~0#1;havoc main_~_hj_j~0#1;havoc main_~_hj_k~0#1;main_~_hj_key~0#1.base, main_~_hj_key~0#1.offset := main_~user~0#1.base, main_~user~0#1.offset;main_~_ha_hashv~0#1 := 4276993775;main_~_hj_j~0#1 := 2654435769;main_~_hj_i~0#1 := main_~_hj_j~0#1;main_~_hj_k~0#1 := 4; {66911#true} is VALID [2022-02-21 03:17:26,870 INFO L290 TraceCheckUtils]: 12: Hoare triple {66911#true} assume !(main_~_hj_k~0#1 % 4294967296 >= 12); {66911#true} is VALID [2022-02-21 03:17:26,870 INFO L290 TraceCheckUtils]: 13: Hoare triple {66911#true} main_~_ha_hashv~0#1 := 4 + main_~_ha_hashv~0#1;main_#t~switch59#1 := 11 == main_~_hj_k~0#1; {66911#true} is VALID [2022-02-21 03:17:26,870 INFO L290 TraceCheckUtils]: 14: Hoare triple {66911#true} assume !main_#t~switch59#1; {66911#true} is VALID [2022-02-21 03:17:26,870 INFO L290 TraceCheckUtils]: 15: Hoare triple {66911#true} main_#t~switch59#1 := main_#t~switch59#1 || 10 == main_~_hj_k~0#1; {66911#true} is VALID [2022-02-21 03:17:26,870 INFO L290 TraceCheckUtils]: 16: Hoare triple {66911#true} assume !main_#t~switch59#1; {66911#true} is VALID [2022-02-21 03:17:26,870 INFO L290 TraceCheckUtils]: 17: Hoare triple {66911#true} main_#t~switch59#1 := main_#t~switch59#1 || 9 == main_~_hj_k~0#1; {66911#true} is VALID [2022-02-21 03:17:26,870 INFO L290 TraceCheckUtils]: 18: Hoare triple {66911#true} assume !main_#t~switch59#1; {66911#true} is VALID [2022-02-21 03:17:26,870 INFO L290 TraceCheckUtils]: 19: Hoare triple {66911#true} main_#t~switch59#1 := main_#t~switch59#1 || 8 == main_~_hj_k~0#1; {66911#true} is VALID [2022-02-21 03:17:26,870 INFO L290 TraceCheckUtils]: 20: Hoare triple {66911#true} assume !main_#t~switch59#1; {66911#true} is VALID [2022-02-21 03:17:26,870 INFO L290 TraceCheckUtils]: 21: Hoare triple {66911#true} main_#t~switch59#1 := main_#t~switch59#1 || 7 == main_~_hj_k~0#1; {66911#true} is VALID [2022-02-21 03:17:26,870 INFO L290 TraceCheckUtils]: 22: Hoare triple {66911#true} assume !main_#t~switch59#1; {66911#true} is VALID [2022-02-21 03:17:26,870 INFO L290 TraceCheckUtils]: 23: Hoare triple {66911#true} main_#t~switch59#1 := main_#t~switch59#1 || 6 == main_~_hj_k~0#1; {66911#true} is VALID [2022-02-21 03:17:26,870 INFO L290 TraceCheckUtils]: 24: Hoare triple {66911#true} assume !main_#t~switch59#1; {66911#true} is VALID [2022-02-21 03:17:26,870 INFO L290 TraceCheckUtils]: 25: Hoare triple {66911#true} main_#t~switch59#1 := main_#t~switch59#1 || 5 == main_~_hj_k~0#1; {66911#true} is VALID [2022-02-21 03:17:26,871 INFO L290 TraceCheckUtils]: 26: Hoare triple {66911#true} assume !main_#t~switch59#1; {66911#true} is VALID [2022-02-21 03:17:26,871 INFO L290 TraceCheckUtils]: 27: Hoare triple {66911#true} main_#t~switch59#1 := main_#t~switch59#1 || 4 == main_~_hj_k~0#1; {66911#true} is VALID [2022-02-21 03:17:26,871 INFO L290 TraceCheckUtils]: 28: Hoare triple {66911#true} assume main_#t~switch59#1;call main_#t~mem67#1 := read~int(main_~_hj_key~0#1.base, 3 + main_~_hj_key~0#1.offset, 1);main_~_hj_i~0#1 := main_~_hj_i~0#1 + 16777216 * (main_#t~mem67#1 % 256);havoc main_#t~mem67#1; {66911#true} is VALID [2022-02-21 03:17:26,871 INFO L290 TraceCheckUtils]: 29: Hoare triple {66911#true} main_#t~switch59#1 := main_#t~switch59#1 || 3 == main_~_hj_k~0#1; {66911#true} is VALID [2022-02-21 03:17:26,871 INFO L290 TraceCheckUtils]: 30: Hoare triple {66911#true} assume main_#t~switch59#1;call main_#t~mem68#1 := read~int(main_~_hj_key~0#1.base, 2 + main_~_hj_key~0#1.offset, 1);main_~_hj_i~0#1 := main_~_hj_i~0#1 + 65536 * (main_#t~mem68#1 % 256);havoc main_#t~mem68#1; {66911#true} is VALID [2022-02-21 03:17:26,871 INFO L290 TraceCheckUtils]: 31: Hoare triple {66911#true} main_#t~switch59#1 := main_#t~switch59#1 || 2 == main_~_hj_k~0#1; {66911#true} is VALID [2022-02-21 03:17:26,871 INFO L290 TraceCheckUtils]: 32: Hoare triple {66911#true} assume main_#t~switch59#1;call main_#t~mem69#1 := read~int(main_~_hj_key~0#1.base, 1 + main_~_hj_key~0#1.offset, 1);main_~_hj_i~0#1 := main_~_hj_i~0#1 + 256 * (main_#t~mem69#1 % 256);havoc main_#t~mem69#1; {66911#true} is VALID [2022-02-21 03:17:26,871 INFO L290 TraceCheckUtils]: 33: Hoare triple {66911#true} main_#t~switch59#1 := main_#t~switch59#1 || 1 == main_~_hj_k~0#1; {66911#true} is VALID [2022-02-21 03:17:26,871 INFO L290 TraceCheckUtils]: 34: Hoare triple {66911#true} assume main_#t~switch59#1;call main_#t~mem70#1 := read~int(main_~_hj_key~0#1.base, main_~_hj_key~0#1.offset, 1);main_~_hj_i~0#1 := main_~_hj_i~0#1 + main_#t~mem70#1 % 256;havoc main_#t~mem70#1; {66911#true} is VALID [2022-02-21 03:17:26,871 INFO L290 TraceCheckUtils]: 35: Hoare triple {66911#true} havoc main_#t~switch59#1; {66911#true} is VALID [2022-02-21 03:17:26,871 INFO L290 TraceCheckUtils]: 36: Hoare triple {66911#true} main_~_hj_i~0#1 := main_~_hj_i~0#1 - main_~_hj_j~0#1;main_~_hj_i~0#1 := main_~_hj_i~0#1 - main_~_ha_hashv~0#1;main_~_hj_i~0#1 := (if (1 == main_~_hj_i~0#1 || 0 == main_~_hj_i~0#1) && (1 == main_~_ha_hashv~0#1 / 8192 || 0 == main_~_ha_hashv~0#1 / 8192) then (if main_~_hj_i~0#1 == main_~_ha_hashv~0#1 / 8192 then 0 else 1) else (if 0 == main_~_hj_i~0#1 then main_~_ha_hashv~0#1 / 8192 else (if 0 == main_~_ha_hashv~0#1 / 8192 then main_~_hj_i~0#1 else ~bitwiseXOr(main_~_hj_i~0#1, main_~_ha_hashv~0#1 / 8192))));main_~_hj_j~0#1 := main_~_hj_j~0#1 - main_~_ha_hashv~0#1;main_~_hj_j~0#1 := main_~_hj_j~0#1 - main_~_hj_i~0#1;main_~_hj_j~0#1 := (if (1 == main_~_hj_j~0#1 || 0 == main_~_hj_j~0#1) && (1 == 256 * main_~_hj_i~0#1 || 0 == 256 * main_~_hj_i~0#1) then (if main_~_hj_j~0#1 == 256 * main_~_hj_i~0#1 then 0 else 1) else (if 0 == main_~_hj_j~0#1 then 256 * main_~_hj_i~0#1 else (if 0 == 256 * main_~_hj_i~0#1 then main_~_hj_j~0#1 else ~bitwiseXOr(main_~_hj_j~0#1, 256 * main_~_hj_i~0#1))));main_~_ha_hashv~0#1 := main_~_ha_hashv~0#1 - main_~_hj_i~0#1;main_~_ha_hashv~0#1 := main_~_ha_hashv~0#1 - main_~_hj_j~0#1;main_~_ha_hashv~0#1 := (if (1 == main_~_ha_hashv~0#1 || 0 == main_~_ha_hashv~0#1) && (1 == main_~_hj_j~0#1 / 8192 || 0 == main_~_hj_j~0#1 / 8192) then (if main_~_ha_hashv~0#1 == main_~_hj_j~0#1 / 8192 then 0 else 1) else (if 0 == main_~_ha_hashv~0#1 then main_~_hj_j~0#1 / 8192 else (if 0 == main_~_hj_j~0#1 / 8192 then main_~_ha_hashv~0#1 else ~bitwiseXOr(main_~_ha_hashv~0#1, main_~_hj_j~0#1 / 8192))));main_~_hj_i~0#1 := main_~_hj_i~0#1 - main_~_hj_j~0#1;main_~_hj_i~0#1 := main_~_hj_i~0#1 - main_~_ha_hashv~0#1;main_~_hj_i~0#1 := (if (1 == main_~_hj_i~0#1 || 0 == main_~_hj_i~0#1) && (1 == main_~_ha_hashv~0#1 / 4096 || 0 == main_~_ha_hashv~0#1 / 4096) then (if main_~_hj_i~0#1 == main_~_ha_hashv~0#1 / 4096 then 0 else 1) else (if 0 == main_~_hj_i~0#1 then main_~_ha_hashv~0#1 / 4096 else (if 0 == main_~_ha_hashv~0#1 / 4096 then main_~_hj_i~0#1 else ~bitwiseXOr(main_~_hj_i~0#1, main_~_ha_hashv~0#1 / 4096))));main_~_hj_j~0#1 := main_~_hj_j~0#1 - main_~_ha_hashv~0#1;main_~_hj_j~0#1 := main_~_hj_j~0#1 - main_~_hj_i~0#1;main_~_hj_j~0#1 := (if (1 == main_~_hj_j~0#1 || 0 == main_~_hj_j~0#1) && (1 == 65536 * main_~_hj_i~0#1 || 0 == 65536 * main_~_hj_i~0#1) then (if main_~_hj_j~0#1 == 65536 * main_~_hj_i~0#1 then 0 else 1) else (if 0 == main_~_hj_j~0#1 then 65536 * main_~_hj_i~0#1 else (if 0 == 65536 * main_~_hj_i~0#1 then main_~_hj_j~0#1 else ~bitwiseXOr(main_~_hj_j~0#1, 65536 * main_~_hj_i~0#1))));main_~_ha_hashv~0#1 := main_~_ha_hashv~0#1 - main_~_hj_i~0#1;main_~_ha_hashv~0#1 := main_~_ha_hashv~0#1 - main_~_hj_j~0#1;main_~_ha_hashv~0#1 := (if (1 == main_~_ha_hashv~0#1 || 0 == main_~_ha_hashv~0#1) && (1 == main_~_hj_j~0#1 / 32 || 0 == main_~_hj_j~0#1 / 32) then (if main_~_ha_hashv~0#1 == main_~_hj_j~0#1 / 32 then 0 else 1) else (if 0 == main_~_ha_hashv~0#1 then main_~_hj_j~0#1 / 32 else (if 0 == main_~_hj_j~0#1 / 32 then main_~_ha_hashv~0#1 else ~bitwiseXOr(main_~_ha_hashv~0#1, main_~_hj_j~0#1 / 32))));main_~_hj_i~0#1 := main_~_hj_i~0#1 - main_~_hj_j~0#1;main_~_hj_i~0#1 := main_~_hj_i~0#1 - main_~_ha_hashv~0#1;main_~_hj_i~0#1 := (if (1 == main_~_hj_i~0#1 || 0 == main_~_hj_i~0#1) && (1 == main_~_ha_hashv~0#1 / 8 || 0 == main_~_ha_hashv~0#1 / 8) then (if main_~_hj_i~0#1 == main_~_ha_hashv~0#1 / 8 then 0 else 1) else (if 0 == main_~_hj_i~0#1 then main_~_ha_hashv~0#1 / 8 else (if 0 == main_~_ha_hashv~0#1 / 8 then main_~_hj_i~0#1 else ~bitwiseXOr(main_~_hj_i~0#1, main_~_ha_hashv~0#1 / 8))));main_~_hj_j~0#1 := main_~_hj_j~0#1 - main_~_ha_hashv~0#1;main_~_hj_j~0#1 := main_~_hj_j~0#1 - main_~_hj_i~0#1;main_~_hj_j~0#1 := (if (1 == main_~_hj_j~0#1 || 0 == main_~_hj_j~0#1) && (1 == 1024 * main_~_hj_i~0#1 || 0 == 1024 * main_~_hj_i~0#1) then (if main_~_hj_j~0#1 == 1024 * main_~_hj_i~0#1 then 0 else 1) else (if 0 == main_~_hj_j~0#1 then 1024 * main_~_hj_i~0#1 else (if 0 == 1024 * main_~_hj_i~0#1 then main_~_hj_j~0#1 else ~bitwiseXOr(main_~_hj_j~0#1, 1024 * main_~_hj_i~0#1))));main_~_ha_hashv~0#1 := main_~_ha_hashv~0#1 - main_~_hj_i~0#1;main_~_ha_hashv~0#1 := main_~_ha_hashv~0#1 - main_~_hj_j~0#1;main_~_ha_hashv~0#1 := (if (1 == main_~_ha_hashv~0#1 || 0 == main_~_ha_hashv~0#1) && (1 == main_~_hj_j~0#1 / 32768 || 0 == main_~_hj_j~0#1 / 32768) then (if main_~_ha_hashv~0#1 == main_~_hj_j~0#1 / 32768 then 0 else 1) else (if 0 == main_~_ha_hashv~0#1 then main_~_hj_j~0#1 / 32768 else (if 0 == main_~_hj_j~0#1 / 32768 then main_~_ha_hashv~0#1 else ~bitwiseXOr(main_~_ha_hashv~0#1, main_~_hj_j~0#1 / 32768)))); {66911#true} is VALID [2022-02-21 03:17:26,871 INFO L290 TraceCheckUtils]: 37: Hoare triple {66911#true} goto; {66911#true} is VALID [2022-02-21 03:17:26,871 INFO L290 TraceCheckUtils]: 38: Hoare triple {66911#true} goto; {66911#true} is VALID [2022-02-21 03:17:26,871 INFO L290 TraceCheckUtils]: 39: Hoare triple {66911#true} goto; {66911#true} is VALID [2022-02-21 03:17:26,871 INFO L290 TraceCheckUtils]: 40: Hoare triple {66911#true} call write~int(main_~_ha_hashv~0#1, main_~user~0#1.base, 36 + main_~user~0#1.offset, 4);call write~$Pointer$(main_~user~0#1.base, main_~user~0#1.offset, main_~user~0#1.base, 28 + main_~user~0#1.offset, 4);call write~int(4, main_~user~0#1.base, 32 + main_~user~0#1.offset, 4); {66911#true} is VALID [2022-02-21 03:17:26,871 INFO L290 TraceCheckUtils]: 41: Hoare triple {66911#true} assume main_~users~0#1.base == 0 && main_~users~0#1.offset == 0;call write~$Pointer$(0, 0, main_~user~0#1.base, 16 + main_~user~0#1.offset, 4);call write~$Pointer$(0, 0, main_~user~0#1.base, 12 + main_~user~0#1.offset, 4); {66911#true} is VALID [2022-02-21 03:17:26,871 INFO L272 TraceCheckUtils]: 42: Hoare triple {66911#true} call main_#t~ret71#1.base, main_#t~ret71#1.offset := alt_malloc(44); {66911#true} is VALID [2022-02-21 03:17:26,872 INFO L290 TraceCheckUtils]: 43: Hoare triple {66911#true} ~sz := #in~sz;#t~post31 := ~alt_malloc_balance~0; {67045#(= |alt_malloc_#in~sz| alt_malloc_~sz)} is VALID [2022-02-21 03:17:26,872 INFO L290 TraceCheckUtils]: 44: Hoare triple {67045#(= |alt_malloc_#in~sz| alt_malloc_~sz)} assume 1 + #t~post31 <= 2147483647; {67045#(= |alt_malloc_#in~sz| alt_malloc_~sz)} is VALID [2022-02-21 03:17:26,873 INFO L290 TraceCheckUtils]: 45: Hoare triple {67045#(= |alt_malloc_#in~sz| alt_malloc_~sz)} assume 1 + #t~post31 >= -2147483648;~alt_malloc_balance~0 := 1 + #t~post31;call write~int(~sz, ~#alt_malloc_sizes~0.base, ~#alt_malloc_sizes~0.offset + 4 * #t~post31, 4);havoc #t~post31; {67045#(= |alt_malloc_#in~sz| alt_malloc_~sz)} is VALID [2022-02-21 03:17:26,887 INFO L290 TraceCheckUtils]: 46: Hoare triple {67045#(= |alt_malloc_#in~sz| alt_malloc_~sz)} assume 1 == ~alt_malloc_balance~0; {67045#(= |alt_malloc_#in~sz| alt_malloc_~sz)} is VALID [2022-02-21 03:17:26,888 INFO L272 TraceCheckUtils]: 47: Hoare triple {67045#(= |alt_malloc_#in~sz| alt_malloc_~sz)} call __VERIFIER_assert((if 44 == ~sz % 4294967296 then 1 else 0)); {66911#true} is VALID [2022-02-21 03:17:26,888 INFO L290 TraceCheckUtils]: 48: Hoare triple {66911#true} ~cond := #in~cond; {67061#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-02-21 03:17:26,888 INFO L290 TraceCheckUtils]: 49: Hoare triple {67061#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {67065#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-02-21 03:17:26,889 INFO L290 TraceCheckUtils]: 50: Hoare triple {67065#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {67065#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-02-21 03:17:26,889 INFO L284 TraceCheckUtils]: 51: Hoare quadruple {67065#(not (= |__VERIFIER_assert_#in~cond| 0))} {67045#(= |alt_malloc_#in~sz| alt_malloc_~sz)} #853#return; {67072#(= 44 (mod |alt_malloc_#in~sz| 4294967296))} is VALID [2022-02-21 03:17:26,889 INFO L290 TraceCheckUtils]: 52: Hoare triple {67072#(= 44 (mod |alt_malloc_#in~sz| 4294967296))} call #t~malloc32.base, #t~malloc32.offset := #Ultimate.allocOnHeap(~sz);#res.base, #res.offset := #t~malloc32.base, #t~malloc32.offset;havoc #t~malloc32.base, #t~malloc32.offset; {67072#(= 44 (mod |alt_malloc_#in~sz| 4294967296))} is VALID [2022-02-21 03:17:26,890 INFO L290 TraceCheckUtils]: 53: Hoare triple {67072#(= 44 (mod |alt_malloc_#in~sz| 4294967296))} assume true; {67072#(= 44 (mod |alt_malloc_#in~sz| 4294967296))} is VALID [2022-02-21 03:17:26,890 INFO L284 TraceCheckUtils]: 54: Hoare quadruple {67072#(= 44 (mod |alt_malloc_#in~sz| 4294967296))} {66911#true} #855#return; {66911#true} is VALID [2022-02-21 03:17:26,890 INFO L290 TraceCheckUtils]: 55: Hoare triple {66911#true} call write~$Pointer$(main_#t~ret71#1.base, main_#t~ret71#1.offset, main_~user~0#1.base, 8 + main_~user~0#1.offset, 4);havoc main_#t~ret71#1.base, main_#t~ret71#1.offset;call main_#t~mem72#1.base, main_#t~mem72#1.offset := read~$Pointer$(main_~user~0#1.base, 8 + main_~user~0#1.offset, 4); {66911#true} is VALID [2022-02-21 03:17:26,890 INFO L290 TraceCheckUtils]: 56: Hoare triple {66911#true} assume !(main_#t~mem72#1.base == 0 && main_#t~mem72#1.offset == 0);havoc main_#t~mem72#1.base, main_#t~mem72#1.offset;call main_#t~mem73#1.base, main_#t~mem73#1.offset := read~$Pointer$(main_~user~0#1.base, 8 + main_~user~0#1.offset, 4); {66911#true} is VALID [2022-02-21 03:17:26,890 INFO L272 TraceCheckUtils]: 57: Hoare triple {66911#true} call alt_bzero(main_#t~mem73#1.base, main_#t~mem73#1.offset, 44); {66911#true} is VALID [2022-02-21 03:17:26,891 INFO L290 TraceCheckUtils]: 58: Hoare triple {66911#true} ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; {67094#(= |alt_bzero_#in~n#1| |alt_bzero_~n#1|)} is VALID [2022-02-21 03:17:26,891 INFO L290 TraceCheckUtils]: 59: Hoare triple {67094#(= |alt_bzero_#in~n#1| |alt_bzero_~n#1|)} assume 1 + ~alt_bzero_count~0 <= 2147483647; {67094#(= |alt_bzero_#in~n#1| |alt_bzero_~n#1|)} is VALID [2022-02-21 03:17:26,891 INFO L290 TraceCheckUtils]: 60: Hoare triple {67094#(= |alt_bzero_#in~n#1| |alt_bzero_~n#1|)} assume 1 + ~alt_bzero_count~0 >= -2147483648;#t~pre37#1 := 1 + ~alt_bzero_count~0;~alt_bzero_count~0 := 1 + ~alt_bzero_count~0;havoc #t~pre37#1;assume { :begin_inline_#Ultimate.C_memset } true;#Ultimate.C_memset_#ptr#1.base, #Ultimate.C_memset_#ptr#1.offset, #Ultimate.C_memset_#value#1, #Ultimate.C_memset_#amount#1 := ~a#1.base, ~a#1.offset, 0, ~n#1;havoc #Ultimate.C_memset_#res#1.base, #Ultimate.C_memset_#res#1.offset;havoc #Ultimate.C_memset_#t~loopctr269#1;#Ultimate.C_memset_#t~loopctr269#1 := 0; {67101#(and (= |alt_bzero_#Ultimate.C_memset_#t~loopctr269#1| 0) (= |alt_bzero_#in~n#1| |alt_bzero_#Ultimate.C_memset_#amount#1|))} is VALID [2022-02-21 03:17:26,892 INFO L290 TraceCheckUtils]: 61: Hoare triple {67101#(and (= |alt_bzero_#Ultimate.C_memset_#t~loopctr269#1| 0) (= |alt_bzero_#in~n#1| |alt_bzero_#Ultimate.C_memset_#amount#1|))} assume !(#Ultimate.C_memset_#t~loopctr269#1 % 4294967296 < #Ultimate.C_memset_#amount#1 % 4294967296); {67105#(not (< 0 (mod |alt_bzero_#in~n#1| 4294967296)))} is VALID [2022-02-21 03:17:26,892 INFO L290 TraceCheckUtils]: 62: Hoare triple {67105#(not (< 0 (mod |alt_bzero_#in~n#1| 4294967296)))} assume #Ultimate.C_memset_#res#1.base == #Ultimate.C_memset_#ptr#1.base && #Ultimate.C_memset_#res#1.offset == #Ultimate.C_memset_#ptr#1.offset;#t~memset~res38#1.base, #t~memset~res38#1.offset := #Ultimate.C_memset_#res#1.base, #Ultimate.C_memset_#res#1.offset;assume { :end_inline_#Ultimate.C_memset } true;havoc #t~memset~res38#1.base, #t~memset~res38#1.offset; {67105#(not (< 0 (mod |alt_bzero_#in~n#1| 4294967296)))} is VALID [2022-02-21 03:17:26,892 INFO L290 TraceCheckUtils]: 63: Hoare triple {67105#(not (< 0 (mod |alt_bzero_#in~n#1| 4294967296)))} assume true; {67105#(not (< 0 (mod |alt_bzero_#in~n#1| 4294967296)))} is VALID [2022-02-21 03:17:26,893 INFO L284 TraceCheckUtils]: 64: Hoare quadruple {67105#(not (< 0 (mod |alt_bzero_#in~n#1| 4294967296)))} {66911#true} #857#return; {66912#false} is VALID [2022-02-21 03:17:26,893 INFO L290 TraceCheckUtils]: 65: Hoare triple {66912#false} havoc main_#t~mem73#1.base, main_#t~mem73#1.offset;call main_#t~mem74#1.base, main_#t~mem74#1.offset := read~$Pointer$(main_~user~0#1.base, 8 + main_~user~0#1.offset, 4);call write~$Pointer$(main_~user~0#1.base, 8 + main_~user~0#1.offset, main_#t~mem74#1.base, 16 + main_#t~mem74#1.offset, 4);havoc main_#t~mem74#1.base, main_#t~mem74#1.offset;call main_#t~mem75#1.base, main_#t~mem75#1.offset := read~$Pointer$(main_~user~0#1.base, 8 + main_~user~0#1.offset, 4);call write~int(32, main_#t~mem75#1.base, 4 + main_#t~mem75#1.offset, 4);havoc main_#t~mem75#1.base, main_#t~mem75#1.offset;call main_#t~mem76#1.base, main_#t~mem76#1.offset := read~$Pointer$(main_~user~0#1.base, 8 + main_~user~0#1.offset, 4);call write~int(5, main_#t~mem76#1.base, 8 + main_#t~mem76#1.offset, 4);havoc main_#t~mem76#1.base, main_#t~mem76#1.offset;call main_#t~mem77#1.base, main_#t~mem77#1.offset := read~$Pointer$(main_~user~0#1.base, 8 + main_~user~0#1.offset, 4);call write~int((if 8 + main_~user~0#1.offset - main_~user~0#1.offset < 0 && 0 != (8 + main_~user~0#1.offset - main_~user~0#1.offset) % 1 then 1 + (8 + main_~user~0#1.offset - main_~user~0#1.offset) / 1 else (8 + main_~user~0#1.offset - main_~user~0#1.offset) / 1), main_#t~mem77#1.base, 20 + main_#t~mem77#1.offset, 4);havoc main_#t~mem77#1.base, main_#t~mem77#1.offset;call main_#t~mem78#1.base, main_#t~mem78#1.offset := read~$Pointer$(main_~user~0#1.base, 8 + main_~user~0#1.offset, 4); {66912#false} is VALID [2022-02-21 03:17:26,893 INFO L272 TraceCheckUtils]: 66: Hoare triple {66912#false} call main_#t~ret79#1.base, main_#t~ret79#1.offset := alt_malloc(384); {66912#false} is VALID [2022-02-21 03:17:26,893 INFO L290 TraceCheckUtils]: 67: Hoare triple {66912#false} ~sz := #in~sz;#t~post31 := ~alt_malloc_balance~0; {66912#false} is VALID [2022-02-21 03:17:26,893 INFO L290 TraceCheckUtils]: 68: Hoare triple {66912#false} assume 1 + #t~post31 <= 2147483647; {66912#false} is VALID [2022-02-21 03:17:26,893 INFO L290 TraceCheckUtils]: 69: Hoare triple {66912#false} assume 1 + #t~post31 >= -2147483648;~alt_malloc_balance~0 := 1 + #t~post31;call write~int(~sz, ~#alt_malloc_sizes~0.base, ~#alt_malloc_sizes~0.offset + 4 * #t~post31, 4);havoc #t~post31; {66912#false} is VALID [2022-02-21 03:17:26,894 INFO L290 TraceCheckUtils]: 70: Hoare triple {66912#false} assume !(1 == ~alt_malloc_balance~0); {66912#false} is VALID [2022-02-21 03:17:26,894 INFO L290 TraceCheckUtils]: 71: Hoare triple {66912#false} call #t~malloc32.base, #t~malloc32.offset := #Ultimate.allocOnHeap(~sz);#res.base, #res.offset := #t~malloc32.base, #t~malloc32.offset;havoc #t~malloc32.base, #t~malloc32.offset; {66912#false} is VALID [2022-02-21 03:17:26,894 INFO L290 TraceCheckUtils]: 72: Hoare triple {66912#false} assume true; {66912#false} is VALID [2022-02-21 03:17:26,894 INFO L284 TraceCheckUtils]: 73: Hoare quadruple {66912#false} {66912#false} #859#return; {66912#false} is VALID [2022-02-21 03:17:26,894 INFO L290 TraceCheckUtils]: 74: Hoare triple {66912#false} call write~$Pointer$(main_#t~ret79#1.base, main_#t~ret79#1.offset, main_#t~mem78#1.base, main_#t~mem78#1.offset, 4);havoc main_#t~mem78#1.base, main_#t~mem78#1.offset;havoc main_#t~ret79#1.base, main_#t~ret79#1.offset;call main_#t~mem80#1.base, main_#t~mem80#1.offset := read~$Pointer$(main_~user~0#1.base, 8 + main_~user~0#1.offset, 4);call write~int(2685476833, main_#t~mem80#1.base, 40 + main_#t~mem80#1.offset, 4);havoc main_#t~mem80#1.base, main_#t~mem80#1.offset;call main_#t~mem81#1.base, main_#t~mem81#1.offset := read~$Pointer$(main_~user~0#1.base, 8 + main_~user~0#1.offset, 4);call main_#t~mem82#1.base, main_#t~mem82#1.offset := read~$Pointer$(main_#t~mem81#1.base, main_#t~mem81#1.offset, 4); {66912#false} is VALID [2022-02-21 03:17:26,894 INFO L290 TraceCheckUtils]: 75: Hoare triple {66912#false} assume !(main_#t~mem82#1.base == 0 && main_#t~mem82#1.offset == 0);havoc main_#t~mem81#1.base, main_#t~mem81#1.offset;havoc main_#t~mem82#1.base, main_#t~mem82#1.offset;call main_#t~mem84#1.base, main_#t~mem84#1.offset := read~$Pointer$(main_~user~0#1.base, 8 + main_~user~0#1.offset, 4);call main_#t~mem85#1.base, main_#t~mem85#1.offset := read~$Pointer$(main_#t~mem84#1.base, main_#t~mem84#1.offset, 4); {66912#false} is VALID [2022-02-21 03:17:26,894 INFO L272 TraceCheckUtils]: 76: Hoare triple {66912#false} call alt_bzero(main_#t~mem85#1.base, main_#t~mem85#1.offset, 384); {66912#false} is VALID [2022-02-21 03:17:26,894 INFO L290 TraceCheckUtils]: 77: Hoare triple {66912#false} ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; {66912#false} is VALID [2022-02-21 03:17:26,894 INFO L290 TraceCheckUtils]: 78: Hoare triple {66912#false} assume 1 + ~alt_bzero_count~0 <= 2147483647; {66912#false} is VALID [2022-02-21 03:17:26,895 INFO L290 TraceCheckUtils]: 79: Hoare triple {66912#false} assume 1 + ~alt_bzero_count~0 >= -2147483648;#t~pre37#1 := 1 + ~alt_bzero_count~0;~alt_bzero_count~0 := 1 + ~alt_bzero_count~0;havoc #t~pre37#1;assume { :begin_inline_#Ultimate.C_memset } true;#Ultimate.C_memset_#ptr#1.base, #Ultimate.C_memset_#ptr#1.offset, #Ultimate.C_memset_#value#1, #Ultimate.C_memset_#amount#1 := ~a#1.base, ~a#1.offset, 0, ~n#1;havoc #Ultimate.C_memset_#res#1.base, #Ultimate.C_memset_#res#1.offset;havoc #Ultimate.C_memset_#t~loopctr269#1;#Ultimate.C_memset_#t~loopctr269#1 := 0; {66912#false} is VALID [2022-02-21 03:17:26,895 INFO L290 TraceCheckUtils]: 80: Hoare triple {66912#false} assume !(#Ultimate.C_memset_#t~loopctr269#1 % 4294967296 < #Ultimate.C_memset_#amount#1 % 4294967296); {66912#false} is VALID [2022-02-21 03:17:26,895 INFO L290 TraceCheckUtils]: 81: Hoare triple {66912#false} assume #Ultimate.C_memset_#res#1.base == #Ultimate.C_memset_#ptr#1.base && #Ultimate.C_memset_#res#1.offset == #Ultimate.C_memset_#ptr#1.offset;#t~memset~res38#1.base, #t~memset~res38#1.offset := #Ultimate.C_memset_#res#1.base, #Ultimate.C_memset_#res#1.offset;assume { :end_inline_#Ultimate.C_memset } true;havoc #t~memset~res38#1.base, #t~memset~res38#1.offset; {66912#false} is VALID [2022-02-21 03:17:26,895 INFO L290 TraceCheckUtils]: 82: Hoare triple {66912#false} assume true; {66912#false} is VALID [2022-02-21 03:17:26,895 INFO L284 TraceCheckUtils]: 83: Hoare quadruple {66912#false} {66912#false} #863#return; {66912#false} is VALID [2022-02-21 03:17:26,895 INFO L290 TraceCheckUtils]: 84: Hoare triple {66912#false} havoc main_#t~mem84#1.base, main_#t~mem84#1.offset;havoc main_#t~mem85#1.base, main_#t~mem85#1.offset; {66912#false} is VALID [2022-02-21 03:17:26,895 INFO L290 TraceCheckUtils]: 85: Hoare triple {66912#false} goto; {66912#false} is VALID [2022-02-21 03:17:26,895 INFO L290 TraceCheckUtils]: 86: Hoare triple {66912#false} main_~users~0#1.base, main_~users~0#1.offset := main_~user~0#1.base, main_~user~0#1.offset; {66912#false} is VALID [2022-02-21 03:17:26,896 INFO L290 TraceCheckUtils]: 87: Hoare triple {66912#false} havoc main_~_ha_bkt~0#1;call main_#t~mem94#1.base, main_#t~mem94#1.offset := read~$Pointer$(main_~users~0#1.base, 8 + main_~users~0#1.offset, 4);call main_#t~mem95#1 := read~int(main_#t~mem94#1.base, 12 + main_#t~mem94#1.offset, 4);main_#t~post96#1 := main_#t~mem95#1;call write~int(1 + main_#t~post96#1, main_#t~mem94#1.base, 12 + main_#t~mem94#1.offset, 4);havoc main_#t~mem94#1.base, main_#t~mem94#1.offset;havoc main_#t~mem95#1;havoc main_#t~post96#1; {66912#false} is VALID [2022-02-21 03:17:26,896 INFO L290 TraceCheckUtils]: 88: Hoare triple {66912#false} call main_#t~mem97#1.base, main_#t~mem97#1.offset := read~$Pointer$(main_~users~0#1.base, 8 + main_~users~0#1.offset, 4);call main_#t~mem98#1 := read~int(main_#t~mem97#1.base, 4 + main_#t~mem97#1.offset, 4);main_~_ha_bkt~0#1 := (if 0 == main_~_ha_hashv~0#1 || 0 == main_#t~mem98#1 - 1 then 0 else (if 1 == main_#t~mem98#1 - 1 then (if 1 == main_~_ha_hashv~0#1 || 0 == main_~_ha_hashv~0#1 then main_~_ha_hashv~0#1 else (if main_~_ha_hashv~0#1 >= 0 then main_~_ha_hashv~0#1 % 2 else ~bitwiseAnd(main_~_ha_hashv~0#1, main_#t~mem98#1 - 1))) else (if 1 == main_~_ha_hashv~0#1 then (if 1 == main_#t~mem98#1 - 1 || 0 == main_#t~mem98#1 - 1 then main_#t~mem98#1 - 1 else (if main_#t~mem98#1 - 1 >= 0 then (main_#t~mem98#1 - 1) % 2 else ~bitwiseAnd(main_~_ha_hashv~0#1, main_#t~mem98#1 - 1))) else ~bitwiseAnd(main_~_ha_hashv~0#1, main_#t~mem98#1 - 1))));havoc main_#t~mem97#1.base, main_#t~mem97#1.offset;havoc main_#t~mem98#1; {66912#false} is VALID [2022-02-21 03:17:26,896 INFO L290 TraceCheckUtils]: 89: Hoare triple {66912#false} goto; {66912#false} is VALID [2022-02-21 03:17:26,896 INFO L290 TraceCheckUtils]: 90: Hoare triple {66912#false} call main_#t~mem99#1.base, main_#t~mem99#1.offset := read~$Pointer$(main_~users~0#1.base, 8 + main_~users~0#1.offset, 4);call main_#t~mem100#1.base, main_#t~mem100#1.offset := read~$Pointer$(main_#t~mem99#1.base, main_#t~mem99#1.offset, 4);main_~_ha_head~0#1.base, main_~_ha_head~0#1.offset := main_#t~mem100#1.base, main_#t~mem100#1.offset + 12 * (if main_~_ha_bkt~0#1 % 4294967296 % 4294967296 <= 2147483647 then main_~_ha_bkt~0#1 % 4294967296 % 4294967296 else main_~_ha_bkt~0#1 % 4294967296 % 4294967296 - 4294967296);havoc main_#t~mem99#1.base, main_#t~mem99#1.offset;havoc main_#t~mem100#1.base, main_#t~mem100#1.offset;call main_#t~mem101#1 := read~int(main_~_ha_head~0#1.base, 4 + main_~_ha_head~0#1.offset, 4);main_#t~post102#1 := main_#t~mem101#1;call write~int(1 + main_#t~post102#1, main_~_ha_head~0#1.base, 4 + main_~_ha_head~0#1.offset, 4);havoc main_#t~mem101#1;havoc main_#t~post102#1;call main_#t~mem103#1.base, main_#t~mem103#1.offset := read~$Pointer$(main_~_ha_head~0#1.base, main_~_ha_head~0#1.offset, 4);call write~$Pointer$(main_#t~mem103#1.base, main_#t~mem103#1.offset, main_~user~0#1.base, 24 + main_~user~0#1.offset, 4);havoc main_#t~mem103#1.base, main_#t~mem103#1.offset;call write~$Pointer$(0, 0, main_~user~0#1.base, 20 + main_~user~0#1.offset, 4);call main_#t~mem104#1.base, main_#t~mem104#1.offset := read~$Pointer$(main_~_ha_head~0#1.base, main_~_ha_head~0#1.offset, 4); {66912#false} is VALID [2022-02-21 03:17:26,896 INFO L290 TraceCheckUtils]: 91: Hoare triple {66912#false} assume main_#t~mem104#1.base != 0 || main_#t~mem104#1.offset != 0;havoc main_#t~mem104#1.base, main_#t~mem104#1.offset;call main_#t~mem105#1.base, main_#t~mem105#1.offset := read~$Pointer$(main_~_ha_head~0#1.base, main_~_ha_head~0#1.offset, 4);call write~$Pointer$(main_~user~0#1.base, 8 + main_~user~0#1.offset, main_#t~mem105#1.base, 12 + main_#t~mem105#1.offset, 4);havoc main_#t~mem105#1.base, main_#t~mem105#1.offset; {66912#false} is VALID [2022-02-21 03:17:26,896 INFO L290 TraceCheckUtils]: 92: Hoare triple {66912#false} call write~$Pointer$(main_~user~0#1.base, 8 + main_~user~0#1.offset, main_~_ha_head~0#1.base, main_~_ha_head~0#1.offset, 4);call main_#t~mem107#1 := read~int(main_~_ha_head~0#1.base, 4 + main_~_ha_head~0#1.offset, 4);call main_#t~mem106#1 := read~int(main_~_ha_head~0#1.base, 8 + main_~_ha_head~0#1.offset, 4);main_#t~short110#1 := main_#t~mem107#1 % 4294967296 >= 10 * (1 + main_#t~mem106#1) % 4294967296; {66912#false} is VALID [2022-02-21 03:17:26,896 INFO L290 TraceCheckUtils]: 93: Hoare triple {66912#false} assume main_#t~short110#1;call main_#t~mem108#1.base, main_#t~mem108#1.offset := read~$Pointer$(main_~user~0#1.base, 8 + main_~user~0#1.offset, 4);call main_#t~mem109#1 := read~int(main_#t~mem108#1.base, 36 + main_#t~mem108#1.offset, 4);main_#t~short110#1 := 0 == main_#t~mem109#1 % 4294967296; {66912#false} is VALID [2022-02-21 03:17:26,896 INFO L290 TraceCheckUtils]: 94: Hoare triple {66912#false} assume !main_#t~short110#1;havoc main_#t~mem107#1;havoc main_#t~mem106#1;havoc main_#t~mem108#1.base, main_#t~mem108#1.offset;havoc main_#t~mem109#1;havoc main_#t~short110#1; {66912#false} is VALID [2022-02-21 03:17:26,897 INFO L290 TraceCheckUtils]: 95: Hoare triple {66912#false} goto; {66912#false} is VALID [2022-02-21 03:17:26,897 INFO L290 TraceCheckUtils]: 96: Hoare triple {66912#false} goto; {66912#false} is VALID [2022-02-21 03:17:26,897 INFO L290 TraceCheckUtils]: 97: Hoare triple {66912#false} goto; {66912#false} is VALID [2022-02-21 03:17:26,897 INFO L290 TraceCheckUtils]: 98: Hoare triple {66912#false} goto; {66912#false} is VALID [2022-02-21 03:17:26,897 INFO L290 TraceCheckUtils]: 99: Hoare triple {66912#false} call main_#t~mem40#1 := read~int(main_~#i~0#1.base, main_~#i~0#1.offset, 4);main_#t~post41#1 := main_#t~mem40#1; {66912#false} is VALID [2022-02-21 03:17:26,897 INFO L290 TraceCheckUtils]: 100: Hoare triple {66912#false} assume !(1 + main_#t~post41#1 <= 2147483647); {66912#false} is VALID [2022-02-21 03:17:26,897 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-21 03:17:26,898 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-21 03:17:26,898 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 03:17:26,898 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [16313498] [2022-02-21 03:17:26,898 WARN L317 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-02-21 03:17:26,898 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2140942126] [2022-02-21 03:17:26,898 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2140942126] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-21 03:17:26,899 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-21 03:17:26,899 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-02-21 03:17:26,899 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1499462041] [2022-02-21 03:17:26,901 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-21 03:17:26,902 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 10.11111111111111) internal successors, (91), 9 states have internal predecessors, (91), 3 states have call successors, (5), 2 states have call predecessors, (5), 4 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Word has length 101 [2022-02-21 03:17:26,902 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-21 03:17:26,903 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 9 states, 9 states have (on average 10.11111111111111) internal successors, (91), 9 states have internal predecessors, (91), 3 states have call successors, (5), 2 states have call predecessors, (5), 4 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) [2022-02-21 03:17:26,973 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 101 edges. 101 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:17:26,973 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-02-21 03:17:26,974 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 03:17:26,974 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-02-21 03:17:26,974 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2022-02-21 03:17:26,974 INFO L87 Difference]: Start difference. First operand 2995 states and 3870 transitions. Second operand has 9 states, 9 states have (on average 10.11111111111111) internal successors, (91), 9 states have internal predecessors, (91), 3 states have call successors, (5), 2 states have call predecessors, (5), 4 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) [2022-02-21 03:17:30,145 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:17:30,145 INFO L93 Difference]: Finished difference Result 4984 states and 6449 transitions. [2022-02-21 03:17:30,145 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-02-21 03:17:30,146 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 10.11111111111111) internal successors, (91), 9 states have internal predecessors, (91), 3 states have call successors, (5), 2 states have call predecessors, (5), 4 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Word has length 101 [2022-02-21 03:17:30,146 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-21 03:17:30,146 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 10.11111111111111) internal successors, (91), 9 states have internal predecessors, (91), 3 states have call successors, (5), 2 states have call predecessors, (5), 4 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) [2022-02-21 03:17:30,148 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 590 transitions. [2022-02-21 03:17:30,149 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 10.11111111111111) internal successors, (91), 9 states have internal predecessors, (91), 3 states have call successors, (5), 2 states have call predecessors, (5), 4 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) [2022-02-21 03:17:30,151 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 590 transitions. [2022-02-21 03:17:30,151 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 11 states and 590 transitions. [2022-02-21 03:17:30,575 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 590 edges. 590 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:17:30,736 INFO L225 Difference]: With dead ends: 4984 [2022-02-21 03:17:30,736 INFO L226 Difference]: Without dead ends: 2031 [2022-02-21 03:17:30,740 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 104 GetRequests, 93 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=123, Unknown=0, NotChecked=0, Total=156 [2022-02-21 03:17:30,740 INFO L933 BasicCegarLoop]: 272 mSDtfsCounter, 31 mSDsluCounter, 1869 mSDsCounter, 0 mSdLazyCounter, 131 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 2141 SdHoareTripleChecker+Invalid, 138 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 131 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-02-21 03:17:30,740 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [32 Valid, 2141 Invalid, 138 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 131 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-02-21 03:17:30,741 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2031 states. [2022-02-21 03:17:31,346 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2031 to 2029. [2022-02-21 03:17:31,346 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 03:17:31,349 INFO L82 GeneralOperation]: Start isEquivalent. First operand 2031 states. Second operand has 2029 states, 1914 states have (on average 1.2795193312434692) internal successors, (2449), 1931 states have internal predecessors, (2449), 63 states have call successors, (63), 43 states have call predecessors, (63), 39 states have return successors, (75), 54 states have call predecessors, (75), 63 states have call successors, (75) [2022-02-21 03:17:31,350 INFO L74 IsIncluded]: Start isIncluded. First operand 2031 states. Second operand has 2029 states, 1914 states have (on average 1.2795193312434692) internal successors, (2449), 1931 states have internal predecessors, (2449), 63 states have call successors, (63), 43 states have call predecessors, (63), 39 states have return successors, (75), 54 states have call predecessors, (75), 63 states have call successors, (75) [2022-02-21 03:17:31,351 INFO L87 Difference]: Start difference. First operand 2031 states. Second operand has 2029 states, 1914 states have (on average 1.2795193312434692) internal successors, (2449), 1931 states have internal predecessors, (2449), 63 states have call successors, (63), 43 states have call predecessors, (63), 39 states have return successors, (75), 54 states have call predecessors, (75), 63 states have call successors, (75) [2022-02-21 03:17:31,453 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:17:31,453 INFO L93 Difference]: Finished difference Result 2031 states and 2587 transitions. [2022-02-21 03:17:31,453 INFO L276 IsEmpty]: Start isEmpty. Operand 2031 states and 2587 transitions. [2022-02-21 03:17:31,456 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:17:31,456 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:17:31,458 INFO L74 IsIncluded]: Start isIncluded. First operand has 2029 states, 1914 states have (on average 1.2795193312434692) internal successors, (2449), 1931 states have internal predecessors, (2449), 63 states have call successors, (63), 43 states have call predecessors, (63), 39 states have return successors, (75), 54 states have call predecessors, (75), 63 states have call successors, (75) Second operand 2031 states. [2022-02-21 03:17:31,459 INFO L87 Difference]: Start difference. First operand has 2029 states, 1914 states have (on average 1.2795193312434692) internal successors, (2449), 1931 states have internal predecessors, (2449), 63 states have call successors, (63), 43 states have call predecessors, (63), 39 states have return successors, (75), 54 states have call predecessors, (75), 63 states have call successors, (75) Second operand 2031 states. [2022-02-21 03:17:31,563 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:17:31,564 INFO L93 Difference]: Finished difference Result 2031 states and 2587 transitions. [2022-02-21 03:17:31,564 INFO L276 IsEmpty]: Start isEmpty. Operand 2031 states and 2587 transitions. [2022-02-21 03:17:31,566 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:17:31,566 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:17:31,566 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 03:17:31,566 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 03:17:31,569 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2029 states, 1914 states have (on average 1.2795193312434692) internal successors, (2449), 1931 states have internal predecessors, (2449), 63 states have call successors, (63), 43 states have call predecessors, (63), 39 states have return successors, (75), 54 states have call predecessors, (75), 63 states have call successors, (75) [2022-02-21 03:17:31,703 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2029 states to 2029 states and 2587 transitions. [2022-02-21 03:17:31,705 INFO L78 Accepts]: Start accepts. Automaton has 2029 states and 2587 transitions. Word has length 101 [2022-02-21 03:17:31,705 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-21 03:17:31,705 INFO L470 AbstractCegarLoop]: Abstraction has 2029 states and 2587 transitions. [2022-02-21 03:17:31,705 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 10.11111111111111) internal successors, (91), 9 states have internal predecessors, (91), 3 states have call successors, (5), 2 states have call predecessors, (5), 4 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) [2022-02-21 03:17:31,705 INFO L276 IsEmpty]: Start isEmpty. Operand 2029 states and 2587 transitions. [2022-02-21 03:17:31,706 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2022-02-21 03:17:31,706 INFO L506 BasicCegarLoop]: Found error trace [2022-02-21 03:17:31,706 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-21 03:17:31,729 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2022-02-21 03:17:31,927 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2022-02-21 03:17:31,927 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [alt_mallocErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, alt_mallocErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, alt_freeErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2022-02-21 03:17:31,928 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:17:31,928 INFO L85 PathProgramCache]: Analyzing trace with hash -1967918926, now seen corresponding path program 1 times [2022-02-21 03:17:31,928 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:17:31,928 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1251779830] [2022-02-21 03:17:31,928 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:17:31,928 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:17:31,970 ERROR L252 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-02-21 03:17:31,970 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [205034509] [2022-02-21 03:17:31,971 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:17:31,971 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-21 03:17:31,971 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:17:31,972 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-02-21 03:17:31,974 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2022-02-21 03:17:32,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:17:32,485 INFO L263 TraceCheckSpWp]: Trace formula consists of 806 conjuncts, 20 conjunts are in the unsatisfiable core [2022-02-21 03:17:32,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:17:32,523 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 03:17:32,762 INFO L290 TraceCheckUtils]: 0: Hoare triple {79576#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(21, 2);~#alt_malloc_sizes~0.base, ~#alt_malloc_sizes~0.offset := 3, 0;call #Ultimate.allocInit(40, 3);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#alt_malloc_sizes~0.base);~alt_malloc_balance~0 := 0;~alt_memcmp_count~0 := 0;~alt_bzero_count~0 := 0; {79576#true} is VALID [2022-02-21 03:17:32,762 INFO L290 TraceCheckUtils]: 1: Hoare triple {79576#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret43#1.base, main_#t~ret43#1.offset, main_#t~mem44#1, main_#t~mem45#1, main_#t~mem46#1, main_#t~mem48#1, main_#t~mem47#1, main_#t~mem49#1, main_#t~mem50#1, main_#t~mem52#1, main_#t~mem51#1, main_#t~mem53#1, main_#t~mem54#1, main_#t~mem56#1, main_#t~mem55#1, main_#t~mem57#1, main_#t~mem58#1, main_#t~switch59#1, main_#t~mem60#1, main_#t~mem61#1, main_#t~mem62#1, main_#t~mem63#1, main_#t~mem64#1, main_#t~mem65#1, main_#t~mem66#1, main_#t~mem67#1, main_#t~mem68#1, main_#t~mem69#1, main_#t~mem70#1, main_~_hj_i~0#1, main_~_hj_j~0#1, main_~_hj_k~0#1, main_~_hj_key~0#1.base, main_~_hj_key~0#1.offset, main_#t~ret71#1.base, main_#t~ret71#1.offset, main_#t~mem72#1.base, main_#t~mem72#1.offset, main_#t~mem73#1.base, main_#t~mem73#1.offset, main_#t~mem74#1.base, main_#t~mem74#1.offset, main_#t~mem75#1.base, main_#t~mem75#1.offset, main_#t~mem76#1.base, main_#t~mem76#1.offset, main_#t~mem77#1.base, main_#t~mem77#1.offset, main_#t~mem78#1.base, main_#t~mem78#1.offset, main_#t~ret79#1.base, main_#t~ret79#1.offset, main_#t~mem80#1.base, main_#t~mem80#1.offset, main_#t~mem81#1.base, main_#t~mem81#1.offset, main_#t~mem82#1.base, main_#t~mem82#1.offset, main_#t~mem83#1.base, main_#t~mem83#1.offset, main_#t~mem84#1.base, main_#t~mem84#1.offset, main_#t~mem85#1.base, main_#t~mem85#1.offset, main_#t~mem86#1.base, main_#t~mem86#1.offset, main_#t~mem87#1.base, main_#t~mem87#1.offset, main_#t~mem88#1.base, main_#t~mem88#1.offset, main_#t~mem89#1.base, main_#t~mem89#1.offset, main_#t~mem90#1, main_#t~mem91#1.base, main_#t~mem91#1.offset, main_#t~mem92#1.base, main_#t~mem92#1.offset, main_#t~mem93#1.base, main_#t~mem93#1.offset, main_#t~mem94#1.base, main_#t~mem94#1.offset, main_#t~mem95#1, main_#t~post96#1, main_#t~mem97#1.base, main_#t~mem97#1.offset, main_#t~mem98#1, main_#t~mem99#1.base, main_#t~mem99#1.offset, main_#t~mem100#1.base, main_#t~mem100#1.offset, main_#t~mem101#1, main_#t~post102#1, main_#t~mem103#1.base, main_#t~mem103#1.offset, main_#t~mem104#1.base, main_#t~mem104#1.offset, main_#t~mem105#1.base, main_#t~mem105#1.offset, main_#t~mem107#1, main_#t~mem106#1, main_#t~mem108#1.base, main_#t~mem108#1.offset, main_#t~mem109#1, main_#t~short110#1, main_#t~mem111#1.base, main_#t~mem111#1.offset, main_#t~mem112#1, main_#t~ret113#1.base, main_#t~ret113#1.offset, main_#t~mem114#1.base, main_#t~mem114#1.offset, main_#t~mem115#1.base, main_#t~mem115#1.offset, main_#t~mem116#1.base, main_#t~mem116#1.offset, main_#t~mem117#1, main_#t~mem118#1.base, main_#t~mem118#1.offset, main_#t~mem119#1.base, main_#t~mem119#1.offset, main_#t~mem122#1, main_#t~mem120#1.base, main_#t~mem120#1.offset, main_#t~mem121#1, main_#t~mem123#1.base, main_#t~mem123#1.offset, main_#t~mem126#1, main_#t~mem124#1.base, main_#t~mem124#1.offset, main_#t~mem125#1, main_#t~ite127#1, main_#t~mem128#1.base, main_#t~mem128#1.offset, main_#t~mem132#1.base, main_#t~mem132#1.offset, main_#t~mem133#1.base, main_#t~mem133#1.offset, main_#t~mem134#1.base, main_#t~mem134#1.offset, main_#t~mem135#1.base, main_#t~mem135#1.offset, main_#t~mem138#1, main_#t~mem136#1.base, main_#t~mem136#1.offset, main_#t~mem137#1, main_#t~mem139#1.base, main_#t~mem139#1.offset, main_#t~mem140#1, main_#t~pre141#1, main_#t~mem142#1.base, main_#t~mem142#1.offset, main_#t~mem143#1, main_#t~mem144#1.base, main_#t~mem144#1.offset, main_#t~mem145#1, main_#t~post146#1, main_#t~mem150#1, main_#t~mem148#1, main_#t~mem147#1.base, main_#t~mem147#1.offset, main_#t~mem149#1, main_#t~mem151#1, main_#t~post152#1, main_#t~mem153#1.base, main_#t~mem153#1.offset, main_#t~mem154#1.base, main_#t~mem154#1.offset, main_#t~mem155#1.base, main_#t~mem155#1.offset, main_#t~post129#1, main_#t~mem130#1.base, main_#t~mem130#1.offset, main_#t~mem131#1, main_#t~mem156#1.base, main_#t~mem156#1.offset, main_#t~mem157#1.base, main_#t~mem157#1.offset, main_#t~mem158#1.base, main_#t~mem158#1.offset, main_#t~mem159#1, main_#t~mem160#1.base, main_#t~mem160#1.offset, main_#t~mem161#1, main_#t~mem162#1.base, main_#t~mem162#1.offset, main_#t~mem163#1, main_#t~post164#1, main_#t~mem165#1.base, main_#t~mem165#1.offset, main_#t~mem166#1.base, main_#t~mem166#1.offset, main_#t~mem167#1.base, main_#t~mem167#1.offset, main_#t~mem168#1.base, main_#t~mem168#1.offset, main_#t~mem171#1, main_#t~mem169#1.base, main_#t~mem169#1.offset, main_#t~mem170#1, main_#t~ite174#1, main_#t~mem172#1.base, main_#t~mem172#1.offset, main_#t~mem173#1, main_#t~mem175#1.base, main_#t~mem175#1.offset, main_#t~mem176#1, main_#t~mem177#1.base, main_#t~mem177#1.offset, main_~_he_bkt~0#1, main_~_he_bkt_i~0#1, main_~_he_thh~0#1.base, main_~_he_thh~0#1.offset, main_~_he_hh_nxt~0#1.base, main_~_he_hh_nxt~0#1.offset, main_~#_he_new_buckets~0#1.base, main_~#_he_new_buckets~0#1.offset, main_~_he_newbkt~0#1.base, main_~_he_newbkt~0#1.offset, main_~_ha_head~0#1.base, main_~_ha_head~0#1.offset, main_~_ha_bkt~0#1, main_~_ha_hashv~0#1, main_#t~mem40#1, main_#t~post41#1, main_#t~mem42#1, main_#t~mem182#1, main_#t~mem181#1, main_#t~mem183#1, main_#t~mem184#1, main_#t~mem186#1, main_#t~mem185#1, main_#t~mem187#1, main_#t~mem188#1, main_#t~mem190#1, main_#t~mem189#1, main_#t~mem191#1, main_#t~mem192#1, main_#t~switch193#1, main_#t~mem194#1, main_#t~mem195#1, main_#t~mem196#1, main_#t~mem197#1, main_#t~mem198#1, main_#t~mem199#1, main_#t~mem200#1, main_#t~mem201#1, main_#t~mem202#1, main_#t~mem203#1, main_#t~mem204#1, main_~_hj_i~1#1, main_~_hj_j~1#1, main_~_hj_k~1#1, main_~_hj_key~1#1.base, main_~_hj_key~1#1.offset, main_#t~mem205#1.base, main_#t~mem205#1.offset, main_#t~mem206#1, main_#t~mem207#1.base, main_#t~mem207#1.offset, main_#t~mem208#1.base, main_#t~mem208#1.offset, main_#t~mem209#1.base, main_#t~mem209#1.offset, main_#t~mem210#1.base, main_#t~mem210#1.offset, main_#t~mem211#1.base, main_#t~mem211#1.offset, main_#t~mem212#1.base, main_#t~mem212#1.offset, main_#t~mem213#1.base, main_#t~mem213#1.offset, main_#t~mem214#1, main_#t~mem215#1, main_#t~mem216#1, main_#t~short217#1, main_#t~mem218#1.base, main_#t~mem218#1.offset, main_#t~ret219#1, main_#t~mem220#1.base, main_#t~mem220#1.offset, main_#t~mem221#1.base, main_#t~mem221#1.offset, main_#t~mem222#1.base, main_#t~mem222#1.offset, main_#t~mem223#1, main_~_hf_bkt~0#1, main_~_hf_hashv~0#1, main_#t~mem224#1.base, main_#t~mem224#1.offset, main_#t~mem225#1.base, main_#t~mem225#1.offset, main_#t~short226#1, main_#t~mem227#1.base, main_#t~mem227#1.offset, main_#t~mem228#1.base, main_#t~mem228#1.offset, main_#t~mem229#1.base, main_#t~mem229#1.offset, main_#t~mem230#1, main_#t~mem231#1.base, main_#t~mem231#1.offset, main_#t~mem232#1.base, main_#t~mem232#1.offset, main_#t~mem233#1.base, main_#t~mem233#1.offset, main_#t~mem234#1.base, main_#t~mem234#1.offset, main_#t~mem235#1.base, main_#t~mem235#1.offset, main_#t~mem236#1.base, main_#t~mem236#1.offset, main_#t~mem237#1, main_#t~mem238#1.base, main_#t~mem238#1.offset, main_#t~mem239#1.base, main_#t~mem239#1.offset, main_#t~mem240#1.base, main_#t~mem240#1.offset, main_#t~mem241#1, main_#t~mem242#1.base, main_#t~mem242#1.offset, main_#t~mem243#1.base, main_#t~mem243#1.offset, main_#t~mem244#1.base, main_#t~mem244#1.offset, main_#t~mem245#1.base, main_#t~mem245#1.offset, main_#t~mem246#1.base, main_#t~mem246#1.offset, main_#t~mem247#1, main_#t~mem248#1.base, main_#t~mem248#1.offset, main_#t~mem251#1, main_#t~mem249#1.base, main_#t~mem249#1.offset, main_#t~mem250#1, main_#t~mem252#1.base, main_#t~mem252#1.offset, main_#t~mem253#1.base, main_#t~mem253#1.offset, main_#t~mem254#1, main_#t~post255#1, main_#t~mem256#1.base, main_#t~mem256#1.offset, main_#t~mem257#1.base, main_#t~mem257#1.offset, main_#t~mem258#1.base, main_#t~mem258#1.offset, main_#t~mem259#1.base, main_#t~mem259#1.offset, main_#t~mem260#1.base, main_#t~mem260#1.offset, main_#t~mem261#1.base, main_#t~mem261#1.offset, main_#t~mem262#1.base, main_#t~mem262#1.offset, main_#t~mem263#1.base, main_#t~mem263#1.offset, main_~_hd_head~0#1.base, main_~_hd_head~0#1.offset, main_#t~mem264#1.base, main_#t~mem264#1.offset, main_#t~mem265#1, main_#t~post266#1, main_~_hd_bkt~0#1, main_~_hd_hh_del~0#1.base, main_~_hd_hh_del~0#1.offset, main_#t~mem178#1, main_#t~post179#1, main_#t~mem180#1, main_#t~mem267#1.base, main_#t~mem267#1.offset, main_~#i~0#1.base, main_~#i~0#1.offset, main_~user~0#1.base, main_~user~0#1.offset, main_~tmp~0#1.base, main_~tmp~0#1.offset, main_~users~0#1.base, main_~users~0#1.offset;call main_~#i~0#1.base, main_~#i~0#1.offset := #Ultimate.allocOnStack(4);havoc main_~user~0#1.base, main_~user~0#1.offset;havoc main_~tmp~0#1.base, main_~tmp~0#1.offset;main_~users~0#1.base, main_~users~0#1.offset := 0, 0;call write~int(0, main_~#i~0#1.base, main_~#i~0#1.offset, 4); {79576#true} is VALID [2022-02-21 03:17:32,762 INFO L290 TraceCheckUtils]: 2: Hoare triple {79576#true} call main_#t~mem42#1 := read~int(main_~#i~0#1.base, main_~#i~0#1.offset, 4); {79576#true} is VALID [2022-02-21 03:17:32,762 INFO L290 TraceCheckUtils]: 3: Hoare triple {79576#true} assume !!(main_#t~mem42#1 < 10);havoc main_#t~mem42#1;assume { :begin_inline_real_malloc } true;real_malloc_#in~n#1 := 40;havoc real_malloc_#res#1.base, real_malloc_#res#1.offset;havoc real_malloc_#t~malloc39#1.base, real_malloc_#t~malloc39#1.offset, real_malloc_~n#1;real_malloc_~n#1 := real_malloc_#in~n#1;call real_malloc_#t~malloc39#1.base, real_malloc_#t~malloc39#1.offset := #Ultimate.allocOnHeap(real_malloc_~n#1);real_malloc_#res#1.base, real_malloc_#res#1.offset := real_malloc_#t~malloc39#1.base, real_malloc_#t~malloc39#1.offset;havoc real_malloc_#t~malloc39#1.base, real_malloc_#t~malloc39#1.offset; {79576#true} is VALID [2022-02-21 03:17:32,763 INFO L290 TraceCheckUtils]: 4: Hoare triple {79576#true} main_#t~ret43#1.base, main_#t~ret43#1.offset := real_malloc_#res#1.base, real_malloc_#res#1.offset;assume { :end_inline_real_malloc } true;main_~user~0#1.base, main_~user~0#1.offset := main_#t~ret43#1.base, main_#t~ret43#1.offset;havoc main_#t~ret43#1.base, main_#t~ret43#1.offset; {79576#true} is VALID [2022-02-21 03:17:32,763 INFO L290 TraceCheckUtils]: 5: Hoare triple {79576#true} assume !(main_~user~0#1.base == 0 && main_~user~0#1.offset == 0); {79576#true} is VALID [2022-02-21 03:17:32,763 INFO L290 TraceCheckUtils]: 6: Hoare triple {79576#true} call main_#t~mem44#1 := read~int(main_~#i~0#1.base, main_~#i~0#1.offset, 4);call write~int(main_#t~mem44#1, main_~user~0#1.base, main_~user~0#1.offset, 4);havoc main_#t~mem44#1;call main_#t~mem45#1 := read~int(main_~#i~0#1.base, main_~#i~0#1.offset, 4);call main_#t~mem46#1 := read~int(main_~#i~0#1.base, main_~#i~0#1.offset, 4); {79576#true} is VALID [2022-02-21 03:17:32,763 INFO L290 TraceCheckUtils]: 7: Hoare triple {79576#true} assume main_#t~mem45#1 * main_#t~mem46#1 <= 2147483647; {79576#true} is VALID [2022-02-21 03:17:32,763 INFO L290 TraceCheckUtils]: 8: Hoare triple {79576#true} assume main_#t~mem45#1 * main_#t~mem46#1 >= -2147483648;call write~int(main_#t~mem45#1 * main_#t~mem46#1, main_~user~0#1.base, 4 + main_~user~0#1.offset, 4);havoc main_#t~mem45#1;havoc main_#t~mem46#1; {79576#true} is VALID [2022-02-21 03:17:32,763 INFO L290 TraceCheckUtils]: 9: Hoare triple {79576#true} havoc main_~_ha_hashv~0#1; {79576#true} is VALID [2022-02-21 03:17:32,763 INFO L290 TraceCheckUtils]: 10: Hoare triple {79576#true} goto; {79576#true} is VALID [2022-02-21 03:17:32,763 INFO L290 TraceCheckUtils]: 11: Hoare triple {79576#true} havoc main_~_hj_i~0#1;havoc main_~_hj_j~0#1;havoc main_~_hj_k~0#1;main_~_hj_key~0#1.base, main_~_hj_key~0#1.offset := main_~user~0#1.base, main_~user~0#1.offset;main_~_ha_hashv~0#1 := 4276993775;main_~_hj_j~0#1 := 2654435769;main_~_hj_i~0#1 := main_~_hj_j~0#1;main_~_hj_k~0#1 := 4; {79576#true} is VALID [2022-02-21 03:17:32,763 INFO L290 TraceCheckUtils]: 12: Hoare triple {79576#true} assume !(main_~_hj_k~0#1 % 4294967296 >= 12); {79576#true} is VALID [2022-02-21 03:17:32,763 INFO L290 TraceCheckUtils]: 13: Hoare triple {79576#true} main_~_ha_hashv~0#1 := 4 + main_~_ha_hashv~0#1;main_#t~switch59#1 := 11 == main_~_hj_k~0#1; {79576#true} is VALID [2022-02-21 03:17:32,763 INFO L290 TraceCheckUtils]: 14: Hoare triple {79576#true} assume !main_#t~switch59#1; {79576#true} is VALID [2022-02-21 03:17:32,763 INFO L290 TraceCheckUtils]: 15: Hoare triple {79576#true} main_#t~switch59#1 := main_#t~switch59#1 || 10 == main_~_hj_k~0#1; {79576#true} is VALID [2022-02-21 03:17:32,763 INFO L290 TraceCheckUtils]: 16: Hoare triple {79576#true} assume !main_#t~switch59#1; {79576#true} is VALID [2022-02-21 03:17:32,764 INFO L290 TraceCheckUtils]: 17: Hoare triple {79576#true} main_#t~switch59#1 := main_#t~switch59#1 || 9 == main_~_hj_k~0#1; {79576#true} is VALID [2022-02-21 03:17:32,764 INFO L290 TraceCheckUtils]: 18: Hoare triple {79576#true} assume !main_#t~switch59#1; {79576#true} is VALID [2022-02-21 03:17:32,764 INFO L290 TraceCheckUtils]: 19: Hoare triple {79576#true} main_#t~switch59#1 := main_#t~switch59#1 || 8 == main_~_hj_k~0#1; {79576#true} is VALID [2022-02-21 03:17:32,764 INFO L290 TraceCheckUtils]: 20: Hoare triple {79576#true} assume !main_#t~switch59#1; {79576#true} is VALID [2022-02-21 03:17:32,764 INFO L290 TraceCheckUtils]: 21: Hoare triple {79576#true} main_#t~switch59#1 := main_#t~switch59#1 || 7 == main_~_hj_k~0#1; {79576#true} is VALID [2022-02-21 03:17:32,764 INFO L290 TraceCheckUtils]: 22: Hoare triple {79576#true} assume !main_#t~switch59#1; {79576#true} is VALID [2022-02-21 03:17:32,764 INFO L290 TraceCheckUtils]: 23: Hoare triple {79576#true} main_#t~switch59#1 := main_#t~switch59#1 || 6 == main_~_hj_k~0#1; {79576#true} is VALID [2022-02-21 03:17:32,764 INFO L290 TraceCheckUtils]: 24: Hoare triple {79576#true} assume !main_#t~switch59#1; {79576#true} is VALID [2022-02-21 03:17:32,764 INFO L290 TraceCheckUtils]: 25: Hoare triple {79576#true} main_#t~switch59#1 := main_#t~switch59#1 || 5 == main_~_hj_k~0#1; {79576#true} is VALID [2022-02-21 03:17:32,764 INFO L290 TraceCheckUtils]: 26: Hoare triple {79576#true} assume !main_#t~switch59#1; {79576#true} is VALID [2022-02-21 03:17:32,764 INFO L290 TraceCheckUtils]: 27: Hoare triple {79576#true} main_#t~switch59#1 := main_#t~switch59#1 || 4 == main_~_hj_k~0#1; {79576#true} is VALID [2022-02-21 03:17:32,764 INFO L290 TraceCheckUtils]: 28: Hoare triple {79576#true} assume main_#t~switch59#1;call main_#t~mem67#1 := read~int(main_~_hj_key~0#1.base, 3 + main_~_hj_key~0#1.offset, 1);main_~_hj_i~0#1 := main_~_hj_i~0#1 + 16777216 * (main_#t~mem67#1 % 256);havoc main_#t~mem67#1; {79576#true} is VALID [2022-02-21 03:17:32,764 INFO L290 TraceCheckUtils]: 29: Hoare triple {79576#true} main_#t~switch59#1 := main_#t~switch59#1 || 3 == main_~_hj_k~0#1; {79576#true} is VALID [2022-02-21 03:17:32,765 INFO L290 TraceCheckUtils]: 30: Hoare triple {79576#true} assume main_#t~switch59#1;call main_#t~mem68#1 := read~int(main_~_hj_key~0#1.base, 2 + main_~_hj_key~0#1.offset, 1);main_~_hj_i~0#1 := main_~_hj_i~0#1 + 65536 * (main_#t~mem68#1 % 256);havoc main_#t~mem68#1; {79576#true} is VALID [2022-02-21 03:17:32,765 INFO L290 TraceCheckUtils]: 31: Hoare triple {79576#true} main_#t~switch59#1 := main_#t~switch59#1 || 2 == main_~_hj_k~0#1; {79576#true} is VALID [2022-02-21 03:17:32,765 INFO L290 TraceCheckUtils]: 32: Hoare triple {79576#true} assume main_#t~switch59#1;call main_#t~mem69#1 := read~int(main_~_hj_key~0#1.base, 1 + main_~_hj_key~0#1.offset, 1);main_~_hj_i~0#1 := main_~_hj_i~0#1 + 256 * (main_#t~mem69#1 % 256);havoc main_#t~mem69#1; {79576#true} is VALID [2022-02-21 03:17:32,765 INFO L290 TraceCheckUtils]: 33: Hoare triple {79576#true} main_#t~switch59#1 := main_#t~switch59#1 || 1 == main_~_hj_k~0#1; {79576#true} is VALID [2022-02-21 03:17:32,765 INFO L290 TraceCheckUtils]: 34: Hoare triple {79576#true} assume main_#t~switch59#1;call main_#t~mem70#1 := read~int(main_~_hj_key~0#1.base, main_~_hj_key~0#1.offset, 1);main_~_hj_i~0#1 := main_~_hj_i~0#1 + main_#t~mem70#1 % 256;havoc main_#t~mem70#1; {79576#true} is VALID [2022-02-21 03:17:32,765 INFO L290 TraceCheckUtils]: 35: Hoare triple {79576#true} havoc main_#t~switch59#1; {79576#true} is VALID [2022-02-21 03:17:32,765 INFO L290 TraceCheckUtils]: 36: Hoare triple {79576#true} main_~_hj_i~0#1 := main_~_hj_i~0#1 - main_~_hj_j~0#1;main_~_hj_i~0#1 := main_~_hj_i~0#1 - main_~_ha_hashv~0#1;main_~_hj_i~0#1 := (if (1 == main_~_hj_i~0#1 || 0 == main_~_hj_i~0#1) && (1 == main_~_ha_hashv~0#1 / 8192 || 0 == main_~_ha_hashv~0#1 / 8192) then (if main_~_hj_i~0#1 == main_~_ha_hashv~0#1 / 8192 then 0 else 1) else (if 0 == main_~_hj_i~0#1 then main_~_ha_hashv~0#1 / 8192 else (if 0 == main_~_ha_hashv~0#1 / 8192 then main_~_hj_i~0#1 else ~bitwiseXOr(main_~_hj_i~0#1, main_~_ha_hashv~0#1 / 8192))));main_~_hj_j~0#1 := main_~_hj_j~0#1 - main_~_ha_hashv~0#1;main_~_hj_j~0#1 := main_~_hj_j~0#1 - main_~_hj_i~0#1;main_~_hj_j~0#1 := (if (1 == main_~_hj_j~0#1 || 0 == main_~_hj_j~0#1) && (1 == 256 * main_~_hj_i~0#1 || 0 == 256 * main_~_hj_i~0#1) then (if main_~_hj_j~0#1 == 256 * main_~_hj_i~0#1 then 0 else 1) else (if 0 == main_~_hj_j~0#1 then 256 * main_~_hj_i~0#1 else (if 0 == 256 * main_~_hj_i~0#1 then main_~_hj_j~0#1 else ~bitwiseXOr(main_~_hj_j~0#1, 256 * main_~_hj_i~0#1))));main_~_ha_hashv~0#1 := main_~_ha_hashv~0#1 - main_~_hj_i~0#1;main_~_ha_hashv~0#1 := main_~_ha_hashv~0#1 - main_~_hj_j~0#1;main_~_ha_hashv~0#1 := (if (1 == main_~_ha_hashv~0#1 || 0 == main_~_ha_hashv~0#1) && (1 == main_~_hj_j~0#1 / 8192 || 0 == main_~_hj_j~0#1 / 8192) then (if main_~_ha_hashv~0#1 == main_~_hj_j~0#1 / 8192 then 0 else 1) else (if 0 == main_~_ha_hashv~0#1 then main_~_hj_j~0#1 / 8192 else (if 0 == main_~_hj_j~0#1 / 8192 then main_~_ha_hashv~0#1 else ~bitwiseXOr(main_~_ha_hashv~0#1, main_~_hj_j~0#1 / 8192))));main_~_hj_i~0#1 := main_~_hj_i~0#1 - main_~_hj_j~0#1;main_~_hj_i~0#1 := main_~_hj_i~0#1 - main_~_ha_hashv~0#1;main_~_hj_i~0#1 := (if (1 == main_~_hj_i~0#1 || 0 == main_~_hj_i~0#1) && (1 == main_~_ha_hashv~0#1 / 4096 || 0 == main_~_ha_hashv~0#1 / 4096) then (if main_~_hj_i~0#1 == main_~_ha_hashv~0#1 / 4096 then 0 else 1) else (if 0 == main_~_hj_i~0#1 then main_~_ha_hashv~0#1 / 4096 else (if 0 == main_~_ha_hashv~0#1 / 4096 then main_~_hj_i~0#1 else ~bitwiseXOr(main_~_hj_i~0#1, main_~_ha_hashv~0#1 / 4096))));main_~_hj_j~0#1 := main_~_hj_j~0#1 - main_~_ha_hashv~0#1;main_~_hj_j~0#1 := main_~_hj_j~0#1 - main_~_hj_i~0#1;main_~_hj_j~0#1 := (if (1 == main_~_hj_j~0#1 || 0 == main_~_hj_j~0#1) && (1 == 65536 * main_~_hj_i~0#1 || 0 == 65536 * main_~_hj_i~0#1) then (if main_~_hj_j~0#1 == 65536 * main_~_hj_i~0#1 then 0 else 1) else (if 0 == main_~_hj_j~0#1 then 65536 * main_~_hj_i~0#1 else (if 0 == 65536 * main_~_hj_i~0#1 then main_~_hj_j~0#1 else ~bitwiseXOr(main_~_hj_j~0#1, 65536 * main_~_hj_i~0#1))));main_~_ha_hashv~0#1 := main_~_ha_hashv~0#1 - main_~_hj_i~0#1;main_~_ha_hashv~0#1 := main_~_ha_hashv~0#1 - main_~_hj_j~0#1;main_~_ha_hashv~0#1 := (if (1 == main_~_ha_hashv~0#1 || 0 == main_~_ha_hashv~0#1) && (1 == main_~_hj_j~0#1 / 32 || 0 == main_~_hj_j~0#1 / 32) then (if main_~_ha_hashv~0#1 == main_~_hj_j~0#1 / 32 then 0 else 1) else (if 0 == main_~_ha_hashv~0#1 then main_~_hj_j~0#1 / 32 else (if 0 == main_~_hj_j~0#1 / 32 then main_~_ha_hashv~0#1 else ~bitwiseXOr(main_~_ha_hashv~0#1, main_~_hj_j~0#1 / 32))));main_~_hj_i~0#1 := main_~_hj_i~0#1 - main_~_hj_j~0#1;main_~_hj_i~0#1 := main_~_hj_i~0#1 - main_~_ha_hashv~0#1;main_~_hj_i~0#1 := (if (1 == main_~_hj_i~0#1 || 0 == main_~_hj_i~0#1) && (1 == main_~_ha_hashv~0#1 / 8 || 0 == main_~_ha_hashv~0#1 / 8) then (if main_~_hj_i~0#1 == main_~_ha_hashv~0#1 / 8 then 0 else 1) else (if 0 == main_~_hj_i~0#1 then main_~_ha_hashv~0#1 / 8 else (if 0 == main_~_ha_hashv~0#1 / 8 then main_~_hj_i~0#1 else ~bitwiseXOr(main_~_hj_i~0#1, main_~_ha_hashv~0#1 / 8))));main_~_hj_j~0#1 := main_~_hj_j~0#1 - main_~_ha_hashv~0#1;main_~_hj_j~0#1 := main_~_hj_j~0#1 - main_~_hj_i~0#1;main_~_hj_j~0#1 := (if (1 == main_~_hj_j~0#1 || 0 == main_~_hj_j~0#1) && (1 == 1024 * main_~_hj_i~0#1 || 0 == 1024 * main_~_hj_i~0#1) then (if main_~_hj_j~0#1 == 1024 * main_~_hj_i~0#1 then 0 else 1) else (if 0 == main_~_hj_j~0#1 then 1024 * main_~_hj_i~0#1 else (if 0 == 1024 * main_~_hj_i~0#1 then main_~_hj_j~0#1 else ~bitwiseXOr(main_~_hj_j~0#1, 1024 * main_~_hj_i~0#1))));main_~_ha_hashv~0#1 := main_~_ha_hashv~0#1 - main_~_hj_i~0#1;main_~_ha_hashv~0#1 := main_~_ha_hashv~0#1 - main_~_hj_j~0#1;main_~_ha_hashv~0#1 := (if (1 == main_~_ha_hashv~0#1 || 0 == main_~_ha_hashv~0#1) && (1 == main_~_hj_j~0#1 / 32768 || 0 == main_~_hj_j~0#1 / 32768) then (if main_~_ha_hashv~0#1 == main_~_hj_j~0#1 / 32768 then 0 else 1) else (if 0 == main_~_ha_hashv~0#1 then main_~_hj_j~0#1 / 32768 else (if 0 == main_~_hj_j~0#1 / 32768 then main_~_ha_hashv~0#1 else ~bitwiseXOr(main_~_ha_hashv~0#1, main_~_hj_j~0#1 / 32768)))); {79576#true} is VALID [2022-02-21 03:17:32,765 INFO L290 TraceCheckUtils]: 37: Hoare triple {79576#true} goto; {79576#true} is VALID [2022-02-21 03:17:32,765 INFO L290 TraceCheckUtils]: 38: Hoare triple {79576#true} goto; {79576#true} is VALID [2022-02-21 03:17:32,765 INFO L290 TraceCheckUtils]: 39: Hoare triple {79576#true} goto; {79576#true} is VALID [2022-02-21 03:17:32,765 INFO L290 TraceCheckUtils]: 40: Hoare triple {79576#true} call write~int(main_~_ha_hashv~0#1, main_~user~0#1.base, 36 + main_~user~0#1.offset, 4);call write~$Pointer$(main_~user~0#1.base, main_~user~0#1.offset, main_~user~0#1.base, 28 + main_~user~0#1.offset, 4);call write~int(4, main_~user~0#1.base, 32 + main_~user~0#1.offset, 4); {79576#true} is VALID [2022-02-21 03:17:32,765 INFO L290 TraceCheckUtils]: 41: Hoare triple {79576#true} assume main_~users~0#1.base == 0 && main_~users~0#1.offset == 0;call write~$Pointer$(0, 0, main_~user~0#1.base, 16 + main_~user~0#1.offset, 4);call write~$Pointer$(0, 0, main_~user~0#1.base, 12 + main_~user~0#1.offset, 4); {79576#true} is VALID [2022-02-21 03:17:32,765 INFO L272 TraceCheckUtils]: 42: Hoare triple {79576#true} call main_#t~ret71#1.base, main_#t~ret71#1.offset := alt_malloc(44); {79576#true} is VALID [2022-02-21 03:17:32,766 INFO L290 TraceCheckUtils]: 43: Hoare triple {79576#true} ~sz := #in~sz;#t~post31 := ~alt_malloc_balance~0; {79710#(= |alt_malloc_#in~sz| alt_malloc_~sz)} is VALID [2022-02-21 03:17:32,766 INFO L290 TraceCheckUtils]: 44: Hoare triple {79710#(= |alt_malloc_#in~sz| alt_malloc_~sz)} assume 1 + #t~post31 <= 2147483647; {79710#(= |alt_malloc_#in~sz| alt_malloc_~sz)} is VALID [2022-02-21 03:17:32,767 INFO L290 TraceCheckUtils]: 45: Hoare triple {79710#(= |alt_malloc_#in~sz| alt_malloc_~sz)} assume 1 + #t~post31 >= -2147483648;~alt_malloc_balance~0 := 1 + #t~post31;call write~int(~sz, ~#alt_malloc_sizes~0.base, ~#alt_malloc_sizes~0.offset + 4 * #t~post31, 4);havoc #t~post31; {79710#(= |alt_malloc_#in~sz| alt_malloc_~sz)} is VALID [2022-02-21 03:17:32,767 INFO L290 TraceCheckUtils]: 46: Hoare triple {79710#(= |alt_malloc_#in~sz| alt_malloc_~sz)} assume 1 == ~alt_malloc_balance~0; {79710#(= |alt_malloc_#in~sz| alt_malloc_~sz)} is VALID [2022-02-21 03:17:32,767 INFO L272 TraceCheckUtils]: 47: Hoare triple {79710#(= |alt_malloc_#in~sz| alt_malloc_~sz)} call __VERIFIER_assert((if 44 == ~sz % 4294967296 then 1 else 0)); {79576#true} is VALID [2022-02-21 03:17:32,767 INFO L290 TraceCheckUtils]: 48: Hoare triple {79576#true} ~cond := #in~cond; {79726#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-02-21 03:17:32,768 INFO L290 TraceCheckUtils]: 49: Hoare triple {79726#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {79730#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-02-21 03:17:32,768 INFO L290 TraceCheckUtils]: 50: Hoare triple {79730#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {79730#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-02-21 03:17:32,769 INFO L284 TraceCheckUtils]: 51: Hoare quadruple {79730#(not (= |__VERIFIER_assert_#in~cond| 0))} {79710#(= |alt_malloc_#in~sz| alt_malloc_~sz)} #853#return; {79737#(= 44 (mod |alt_malloc_#in~sz| 4294967296))} is VALID [2022-02-21 03:17:32,769 INFO L290 TraceCheckUtils]: 52: Hoare triple {79737#(= 44 (mod |alt_malloc_#in~sz| 4294967296))} call #t~malloc32.base, #t~malloc32.offset := #Ultimate.allocOnHeap(~sz);#res.base, #res.offset := #t~malloc32.base, #t~malloc32.offset;havoc #t~malloc32.base, #t~malloc32.offset; {79737#(= 44 (mod |alt_malloc_#in~sz| 4294967296))} is VALID [2022-02-21 03:17:32,769 INFO L290 TraceCheckUtils]: 53: Hoare triple {79737#(= 44 (mod |alt_malloc_#in~sz| 4294967296))} assume true; {79737#(= 44 (mod |alt_malloc_#in~sz| 4294967296))} is VALID [2022-02-21 03:17:32,769 INFO L284 TraceCheckUtils]: 54: Hoare quadruple {79737#(= 44 (mod |alt_malloc_#in~sz| 4294967296))} {79576#true} #855#return; {79576#true} is VALID [2022-02-21 03:17:32,769 INFO L290 TraceCheckUtils]: 55: Hoare triple {79576#true} call write~$Pointer$(main_#t~ret71#1.base, main_#t~ret71#1.offset, main_~user~0#1.base, 8 + main_~user~0#1.offset, 4);havoc main_#t~ret71#1.base, main_#t~ret71#1.offset;call main_#t~mem72#1.base, main_#t~mem72#1.offset := read~$Pointer$(main_~user~0#1.base, 8 + main_~user~0#1.offset, 4); {79576#true} is VALID [2022-02-21 03:17:32,769 INFO L290 TraceCheckUtils]: 56: Hoare triple {79576#true} assume !(main_#t~mem72#1.base == 0 && main_#t~mem72#1.offset == 0);havoc main_#t~mem72#1.base, main_#t~mem72#1.offset;call main_#t~mem73#1.base, main_#t~mem73#1.offset := read~$Pointer$(main_~user~0#1.base, 8 + main_~user~0#1.offset, 4); {79576#true} is VALID [2022-02-21 03:17:32,770 INFO L272 TraceCheckUtils]: 57: Hoare triple {79576#true} call alt_bzero(main_#t~mem73#1.base, main_#t~mem73#1.offset, 44); {79576#true} is VALID [2022-02-21 03:17:32,770 INFO L290 TraceCheckUtils]: 58: Hoare triple {79576#true} ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; {79759#(= |alt_bzero_#in~n#1| |alt_bzero_~n#1|)} is VALID [2022-02-21 03:17:32,770 INFO L290 TraceCheckUtils]: 59: Hoare triple {79759#(= |alt_bzero_#in~n#1| |alt_bzero_~n#1|)} assume 1 + ~alt_bzero_count~0 <= 2147483647; {79759#(= |alt_bzero_#in~n#1| |alt_bzero_~n#1|)} is VALID [2022-02-21 03:17:32,771 INFO L290 TraceCheckUtils]: 60: Hoare triple {79759#(= |alt_bzero_#in~n#1| |alt_bzero_~n#1|)} assume 1 + ~alt_bzero_count~0 >= -2147483648;#t~pre37#1 := 1 + ~alt_bzero_count~0;~alt_bzero_count~0 := 1 + ~alt_bzero_count~0;havoc #t~pre37#1;assume { :begin_inline_#Ultimate.C_memset } true;#Ultimate.C_memset_#ptr#1.base, #Ultimate.C_memset_#ptr#1.offset, #Ultimate.C_memset_#value#1, #Ultimate.C_memset_#amount#1 := ~a#1.base, ~a#1.offset, 0, ~n#1;havoc #Ultimate.C_memset_#res#1.base, #Ultimate.C_memset_#res#1.offset;havoc #Ultimate.C_memset_#t~loopctr269#1;#Ultimate.C_memset_#t~loopctr269#1 := 0; {79766#(and (= |alt_bzero_#Ultimate.C_memset_#t~loopctr269#1| 0) (= |alt_bzero_#in~n#1| |alt_bzero_#Ultimate.C_memset_#amount#1|))} is VALID [2022-02-21 03:17:32,771 INFO L290 TraceCheckUtils]: 61: Hoare triple {79766#(and (= |alt_bzero_#Ultimate.C_memset_#t~loopctr269#1| 0) (= |alt_bzero_#in~n#1| |alt_bzero_#Ultimate.C_memset_#amount#1|))} assume #Ultimate.C_memset_#t~loopctr269#1 % 4294967296 < #Ultimate.C_memset_#amount#1 % 4294967296;#memory_int := #memory_int[#Ultimate.C_memset_#ptr#1.base,#Ultimate.C_memset_#ptr#1.offset + #Ultimate.C_memset_#t~loopctr269#1 := #Ultimate.C_memset_#value#1];#memory_$Pointer$.base, #memory_$Pointer$.offset := #memory_$Pointer$.base[#Ultimate.C_memset_#ptr#1.base,#Ultimate.C_memset_#ptr#1.offset + #Ultimate.C_memset_#t~loopctr269#1 := 0], #memory_$Pointer$.offset[#Ultimate.C_memset_#ptr#1.base,#Ultimate.C_memset_#ptr#1.offset + #Ultimate.C_memset_#t~loopctr269#1 := #Ultimate.C_memset_#value#1 % 256];#Ultimate.C_memset_#t~loopctr269#1 := 1 + #Ultimate.C_memset_#t~loopctr269#1; {79770#(and (= |alt_bzero_#in~n#1| |alt_bzero_#Ultimate.C_memset_#amount#1|) (= (+ (- 1) |alt_bzero_#Ultimate.C_memset_#t~loopctr269#1|) 0))} is VALID [2022-02-21 03:17:32,773 INFO L290 TraceCheckUtils]: 62: Hoare triple {79770#(and (= |alt_bzero_#in~n#1| |alt_bzero_#Ultimate.C_memset_#amount#1|) (= (+ (- 1) |alt_bzero_#Ultimate.C_memset_#t~loopctr269#1|) 0))} assume !(#Ultimate.C_memset_#t~loopctr269#1 % 4294967296 < #Ultimate.C_memset_#amount#1 % 4294967296); {79774#(not (< 1 (mod |alt_bzero_#in~n#1| 4294967296)))} is VALID [2022-02-21 03:17:32,773 INFO L290 TraceCheckUtils]: 63: Hoare triple {79774#(not (< 1 (mod |alt_bzero_#in~n#1| 4294967296)))} assume #Ultimate.C_memset_#res#1.base == #Ultimate.C_memset_#ptr#1.base && #Ultimate.C_memset_#res#1.offset == #Ultimate.C_memset_#ptr#1.offset;#t~memset~res38#1.base, #t~memset~res38#1.offset := #Ultimate.C_memset_#res#1.base, #Ultimate.C_memset_#res#1.offset;assume { :end_inline_#Ultimate.C_memset } true;havoc #t~memset~res38#1.base, #t~memset~res38#1.offset; {79774#(not (< 1 (mod |alt_bzero_#in~n#1| 4294967296)))} is VALID [2022-02-21 03:17:32,773 INFO L290 TraceCheckUtils]: 64: Hoare triple {79774#(not (< 1 (mod |alt_bzero_#in~n#1| 4294967296)))} assume true; {79774#(not (< 1 (mod |alt_bzero_#in~n#1| 4294967296)))} is VALID [2022-02-21 03:17:32,774 INFO L284 TraceCheckUtils]: 65: Hoare quadruple {79774#(not (< 1 (mod |alt_bzero_#in~n#1| 4294967296)))} {79576#true} #857#return; {79577#false} is VALID [2022-02-21 03:17:32,774 INFO L290 TraceCheckUtils]: 66: Hoare triple {79577#false} havoc main_#t~mem73#1.base, main_#t~mem73#1.offset;call main_#t~mem74#1.base, main_#t~mem74#1.offset := read~$Pointer$(main_~user~0#1.base, 8 + main_~user~0#1.offset, 4);call write~$Pointer$(main_~user~0#1.base, 8 + main_~user~0#1.offset, main_#t~mem74#1.base, 16 + main_#t~mem74#1.offset, 4);havoc main_#t~mem74#1.base, main_#t~mem74#1.offset;call main_#t~mem75#1.base, main_#t~mem75#1.offset := read~$Pointer$(main_~user~0#1.base, 8 + main_~user~0#1.offset, 4);call write~int(32, main_#t~mem75#1.base, 4 + main_#t~mem75#1.offset, 4);havoc main_#t~mem75#1.base, main_#t~mem75#1.offset;call main_#t~mem76#1.base, main_#t~mem76#1.offset := read~$Pointer$(main_~user~0#1.base, 8 + main_~user~0#1.offset, 4);call write~int(5, main_#t~mem76#1.base, 8 + main_#t~mem76#1.offset, 4);havoc main_#t~mem76#1.base, main_#t~mem76#1.offset;call main_#t~mem77#1.base, main_#t~mem77#1.offset := read~$Pointer$(main_~user~0#1.base, 8 + main_~user~0#1.offset, 4);call write~int((if 8 + main_~user~0#1.offset - main_~user~0#1.offset < 0 && 0 != (8 + main_~user~0#1.offset - main_~user~0#1.offset) % 1 then 1 + (8 + main_~user~0#1.offset - main_~user~0#1.offset) / 1 else (8 + main_~user~0#1.offset - main_~user~0#1.offset) / 1), main_#t~mem77#1.base, 20 + main_#t~mem77#1.offset, 4);havoc main_#t~mem77#1.base, main_#t~mem77#1.offset;call main_#t~mem78#1.base, main_#t~mem78#1.offset := read~$Pointer$(main_~user~0#1.base, 8 + main_~user~0#1.offset, 4); {79577#false} is VALID [2022-02-21 03:17:32,774 INFO L272 TraceCheckUtils]: 67: Hoare triple {79577#false} call main_#t~ret79#1.base, main_#t~ret79#1.offset := alt_malloc(384); {79577#false} is VALID [2022-02-21 03:17:32,774 INFO L290 TraceCheckUtils]: 68: Hoare triple {79577#false} ~sz := #in~sz;#t~post31 := ~alt_malloc_balance~0; {79577#false} is VALID [2022-02-21 03:17:32,774 INFO L290 TraceCheckUtils]: 69: Hoare triple {79577#false} assume 1 + #t~post31 <= 2147483647; {79577#false} is VALID [2022-02-21 03:17:32,774 INFO L290 TraceCheckUtils]: 70: Hoare triple {79577#false} assume 1 + #t~post31 >= -2147483648;~alt_malloc_balance~0 := 1 + #t~post31;call write~int(~sz, ~#alt_malloc_sizes~0.base, ~#alt_malloc_sizes~0.offset + 4 * #t~post31, 4);havoc #t~post31; {79577#false} is VALID [2022-02-21 03:17:32,774 INFO L290 TraceCheckUtils]: 71: Hoare triple {79577#false} assume !(1 == ~alt_malloc_balance~0); {79577#false} is VALID [2022-02-21 03:17:32,774 INFO L290 TraceCheckUtils]: 72: Hoare triple {79577#false} call #t~malloc32.base, #t~malloc32.offset := #Ultimate.allocOnHeap(~sz);#res.base, #res.offset := #t~malloc32.base, #t~malloc32.offset;havoc #t~malloc32.base, #t~malloc32.offset; {79577#false} is VALID [2022-02-21 03:17:32,774 INFO L290 TraceCheckUtils]: 73: Hoare triple {79577#false} assume true; {79577#false} is VALID [2022-02-21 03:17:32,774 INFO L284 TraceCheckUtils]: 74: Hoare quadruple {79577#false} {79577#false} #859#return; {79577#false} is VALID [2022-02-21 03:17:32,775 INFO L290 TraceCheckUtils]: 75: Hoare triple {79577#false} call write~$Pointer$(main_#t~ret79#1.base, main_#t~ret79#1.offset, main_#t~mem78#1.base, main_#t~mem78#1.offset, 4);havoc main_#t~mem78#1.base, main_#t~mem78#1.offset;havoc main_#t~ret79#1.base, main_#t~ret79#1.offset;call main_#t~mem80#1.base, main_#t~mem80#1.offset := read~$Pointer$(main_~user~0#1.base, 8 + main_~user~0#1.offset, 4);call write~int(2685476833, main_#t~mem80#1.base, 40 + main_#t~mem80#1.offset, 4);havoc main_#t~mem80#1.base, main_#t~mem80#1.offset;call main_#t~mem81#1.base, main_#t~mem81#1.offset := read~$Pointer$(main_~user~0#1.base, 8 + main_~user~0#1.offset, 4);call main_#t~mem82#1.base, main_#t~mem82#1.offset := read~$Pointer$(main_#t~mem81#1.base, main_#t~mem81#1.offset, 4); {79577#false} is VALID [2022-02-21 03:17:32,775 INFO L290 TraceCheckUtils]: 76: Hoare triple {79577#false} assume !(main_#t~mem82#1.base == 0 && main_#t~mem82#1.offset == 0);havoc main_#t~mem81#1.base, main_#t~mem81#1.offset;havoc main_#t~mem82#1.base, main_#t~mem82#1.offset;call main_#t~mem84#1.base, main_#t~mem84#1.offset := read~$Pointer$(main_~user~0#1.base, 8 + main_~user~0#1.offset, 4);call main_#t~mem85#1.base, main_#t~mem85#1.offset := read~$Pointer$(main_#t~mem84#1.base, main_#t~mem84#1.offset, 4); {79577#false} is VALID [2022-02-21 03:17:32,775 INFO L272 TraceCheckUtils]: 77: Hoare triple {79577#false} call alt_bzero(main_#t~mem85#1.base, main_#t~mem85#1.offset, 384); {79577#false} is VALID [2022-02-21 03:17:32,775 INFO L290 TraceCheckUtils]: 78: Hoare triple {79577#false} ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; {79577#false} is VALID [2022-02-21 03:17:32,775 INFO L290 TraceCheckUtils]: 79: Hoare triple {79577#false} assume 1 + ~alt_bzero_count~0 <= 2147483647; {79577#false} is VALID [2022-02-21 03:17:32,775 INFO L290 TraceCheckUtils]: 80: Hoare triple {79577#false} assume 1 + ~alt_bzero_count~0 >= -2147483648;#t~pre37#1 := 1 + ~alt_bzero_count~0;~alt_bzero_count~0 := 1 + ~alt_bzero_count~0;havoc #t~pre37#1;assume { :begin_inline_#Ultimate.C_memset } true;#Ultimate.C_memset_#ptr#1.base, #Ultimate.C_memset_#ptr#1.offset, #Ultimate.C_memset_#value#1, #Ultimate.C_memset_#amount#1 := ~a#1.base, ~a#1.offset, 0, ~n#1;havoc #Ultimate.C_memset_#res#1.base, #Ultimate.C_memset_#res#1.offset;havoc #Ultimate.C_memset_#t~loopctr269#1;#Ultimate.C_memset_#t~loopctr269#1 := 0; {79577#false} is VALID [2022-02-21 03:17:32,775 INFO L290 TraceCheckUtils]: 81: Hoare triple {79577#false} assume #Ultimate.C_memset_#t~loopctr269#1 % 4294967296 < #Ultimate.C_memset_#amount#1 % 4294967296;#memory_int := #memory_int[#Ultimate.C_memset_#ptr#1.base,#Ultimate.C_memset_#ptr#1.offset + #Ultimate.C_memset_#t~loopctr269#1 := #Ultimate.C_memset_#value#1];#memory_$Pointer$.base, #memory_$Pointer$.offset := #memory_$Pointer$.base[#Ultimate.C_memset_#ptr#1.base,#Ultimate.C_memset_#ptr#1.offset + #Ultimate.C_memset_#t~loopctr269#1 := 0], #memory_$Pointer$.offset[#Ultimate.C_memset_#ptr#1.base,#Ultimate.C_memset_#ptr#1.offset + #Ultimate.C_memset_#t~loopctr269#1 := #Ultimate.C_memset_#value#1 % 256];#Ultimate.C_memset_#t~loopctr269#1 := 1 + #Ultimate.C_memset_#t~loopctr269#1; {79577#false} is VALID [2022-02-21 03:17:32,775 INFO L290 TraceCheckUtils]: 82: Hoare triple {79577#false} assume !(#Ultimate.C_memset_#t~loopctr269#1 % 4294967296 < #Ultimate.C_memset_#amount#1 % 4294967296); {79577#false} is VALID [2022-02-21 03:17:32,775 INFO L290 TraceCheckUtils]: 83: Hoare triple {79577#false} assume #Ultimate.C_memset_#res#1.base == #Ultimate.C_memset_#ptr#1.base && #Ultimate.C_memset_#res#1.offset == #Ultimate.C_memset_#ptr#1.offset;#t~memset~res38#1.base, #t~memset~res38#1.offset := #Ultimate.C_memset_#res#1.base, #Ultimate.C_memset_#res#1.offset;assume { :end_inline_#Ultimate.C_memset } true;havoc #t~memset~res38#1.base, #t~memset~res38#1.offset; {79577#false} is VALID [2022-02-21 03:17:32,775 INFO L290 TraceCheckUtils]: 84: Hoare triple {79577#false} assume true; {79577#false} is VALID [2022-02-21 03:17:32,775 INFO L284 TraceCheckUtils]: 85: Hoare quadruple {79577#false} {79577#false} #863#return; {79577#false} is VALID [2022-02-21 03:17:32,775 INFO L290 TraceCheckUtils]: 86: Hoare triple {79577#false} havoc main_#t~mem84#1.base, main_#t~mem84#1.offset;havoc main_#t~mem85#1.base, main_#t~mem85#1.offset; {79577#false} is VALID [2022-02-21 03:17:32,775 INFO L290 TraceCheckUtils]: 87: Hoare triple {79577#false} goto; {79577#false} is VALID [2022-02-21 03:17:32,775 INFO L290 TraceCheckUtils]: 88: Hoare triple {79577#false} main_~users~0#1.base, main_~users~0#1.offset := main_~user~0#1.base, main_~user~0#1.offset; {79577#false} is VALID [2022-02-21 03:17:32,776 INFO L290 TraceCheckUtils]: 89: Hoare triple {79577#false} havoc main_~_ha_bkt~0#1;call main_#t~mem94#1.base, main_#t~mem94#1.offset := read~$Pointer$(main_~users~0#1.base, 8 + main_~users~0#1.offset, 4);call main_#t~mem95#1 := read~int(main_#t~mem94#1.base, 12 + main_#t~mem94#1.offset, 4);main_#t~post96#1 := main_#t~mem95#1;call write~int(1 + main_#t~post96#1, main_#t~mem94#1.base, 12 + main_#t~mem94#1.offset, 4);havoc main_#t~mem94#1.base, main_#t~mem94#1.offset;havoc main_#t~mem95#1;havoc main_#t~post96#1; {79577#false} is VALID [2022-02-21 03:17:32,776 INFO L290 TraceCheckUtils]: 90: Hoare triple {79577#false} call main_#t~mem97#1.base, main_#t~mem97#1.offset := read~$Pointer$(main_~users~0#1.base, 8 + main_~users~0#1.offset, 4);call main_#t~mem98#1 := read~int(main_#t~mem97#1.base, 4 + main_#t~mem97#1.offset, 4);main_~_ha_bkt~0#1 := (if 0 == main_~_ha_hashv~0#1 || 0 == main_#t~mem98#1 - 1 then 0 else (if 1 == main_#t~mem98#1 - 1 then (if 1 == main_~_ha_hashv~0#1 || 0 == main_~_ha_hashv~0#1 then main_~_ha_hashv~0#1 else (if main_~_ha_hashv~0#1 >= 0 then main_~_ha_hashv~0#1 % 2 else ~bitwiseAnd(main_~_ha_hashv~0#1, main_#t~mem98#1 - 1))) else (if 1 == main_~_ha_hashv~0#1 then (if 1 == main_#t~mem98#1 - 1 || 0 == main_#t~mem98#1 - 1 then main_#t~mem98#1 - 1 else (if main_#t~mem98#1 - 1 >= 0 then (main_#t~mem98#1 - 1) % 2 else ~bitwiseAnd(main_~_ha_hashv~0#1, main_#t~mem98#1 - 1))) else ~bitwiseAnd(main_~_ha_hashv~0#1, main_#t~mem98#1 - 1))));havoc main_#t~mem97#1.base, main_#t~mem97#1.offset;havoc main_#t~mem98#1; {79577#false} is VALID [2022-02-21 03:17:32,776 INFO L290 TraceCheckUtils]: 91: Hoare triple {79577#false} goto; {79577#false} is VALID [2022-02-21 03:17:32,776 INFO L290 TraceCheckUtils]: 92: Hoare triple {79577#false} call main_#t~mem99#1.base, main_#t~mem99#1.offset := read~$Pointer$(main_~users~0#1.base, 8 + main_~users~0#1.offset, 4);call main_#t~mem100#1.base, main_#t~mem100#1.offset := read~$Pointer$(main_#t~mem99#1.base, main_#t~mem99#1.offset, 4);main_~_ha_head~0#1.base, main_~_ha_head~0#1.offset := main_#t~mem100#1.base, main_#t~mem100#1.offset + 12 * (if main_~_ha_bkt~0#1 % 4294967296 % 4294967296 <= 2147483647 then main_~_ha_bkt~0#1 % 4294967296 % 4294967296 else main_~_ha_bkt~0#1 % 4294967296 % 4294967296 - 4294967296);havoc main_#t~mem99#1.base, main_#t~mem99#1.offset;havoc main_#t~mem100#1.base, main_#t~mem100#1.offset;call main_#t~mem101#1 := read~int(main_~_ha_head~0#1.base, 4 + main_~_ha_head~0#1.offset, 4);main_#t~post102#1 := main_#t~mem101#1;call write~int(1 + main_#t~post102#1, main_~_ha_head~0#1.base, 4 + main_~_ha_head~0#1.offset, 4);havoc main_#t~mem101#1;havoc main_#t~post102#1;call main_#t~mem103#1.base, main_#t~mem103#1.offset := read~$Pointer$(main_~_ha_head~0#1.base, main_~_ha_head~0#1.offset, 4);call write~$Pointer$(main_#t~mem103#1.base, main_#t~mem103#1.offset, main_~user~0#1.base, 24 + main_~user~0#1.offset, 4);havoc main_#t~mem103#1.base, main_#t~mem103#1.offset;call write~$Pointer$(0, 0, main_~user~0#1.base, 20 + main_~user~0#1.offset, 4);call main_#t~mem104#1.base, main_#t~mem104#1.offset := read~$Pointer$(main_~_ha_head~0#1.base, main_~_ha_head~0#1.offset, 4); {79577#false} is VALID [2022-02-21 03:17:32,776 INFO L290 TraceCheckUtils]: 93: Hoare triple {79577#false} assume main_#t~mem104#1.base != 0 || main_#t~mem104#1.offset != 0;havoc main_#t~mem104#1.base, main_#t~mem104#1.offset;call main_#t~mem105#1.base, main_#t~mem105#1.offset := read~$Pointer$(main_~_ha_head~0#1.base, main_~_ha_head~0#1.offset, 4);call write~$Pointer$(main_~user~0#1.base, 8 + main_~user~0#1.offset, main_#t~mem105#1.base, 12 + main_#t~mem105#1.offset, 4);havoc main_#t~mem105#1.base, main_#t~mem105#1.offset; {79577#false} is VALID [2022-02-21 03:17:32,776 INFO L290 TraceCheckUtils]: 94: Hoare triple {79577#false} call write~$Pointer$(main_~user~0#1.base, 8 + main_~user~0#1.offset, main_~_ha_head~0#1.base, main_~_ha_head~0#1.offset, 4);call main_#t~mem107#1 := read~int(main_~_ha_head~0#1.base, 4 + main_~_ha_head~0#1.offset, 4);call main_#t~mem106#1 := read~int(main_~_ha_head~0#1.base, 8 + main_~_ha_head~0#1.offset, 4);main_#t~short110#1 := main_#t~mem107#1 % 4294967296 >= 10 * (1 + main_#t~mem106#1) % 4294967296; {79577#false} is VALID [2022-02-21 03:17:32,776 INFO L290 TraceCheckUtils]: 95: Hoare triple {79577#false} assume main_#t~short110#1;call main_#t~mem108#1.base, main_#t~mem108#1.offset := read~$Pointer$(main_~user~0#1.base, 8 + main_~user~0#1.offset, 4);call main_#t~mem109#1 := read~int(main_#t~mem108#1.base, 36 + main_#t~mem108#1.offset, 4);main_#t~short110#1 := 0 == main_#t~mem109#1 % 4294967296; {79577#false} is VALID [2022-02-21 03:17:32,776 INFO L290 TraceCheckUtils]: 96: Hoare triple {79577#false} assume !main_#t~short110#1;havoc main_#t~mem107#1;havoc main_#t~mem106#1;havoc main_#t~mem108#1.base, main_#t~mem108#1.offset;havoc main_#t~mem109#1;havoc main_#t~short110#1; {79577#false} is VALID [2022-02-21 03:17:32,776 INFO L290 TraceCheckUtils]: 97: Hoare triple {79577#false} goto; {79577#false} is VALID [2022-02-21 03:17:32,776 INFO L290 TraceCheckUtils]: 98: Hoare triple {79577#false} goto; {79577#false} is VALID [2022-02-21 03:17:32,776 INFO L290 TraceCheckUtils]: 99: Hoare triple {79577#false} goto; {79577#false} is VALID [2022-02-21 03:17:32,776 INFO L290 TraceCheckUtils]: 100: Hoare triple {79577#false} goto; {79577#false} is VALID [2022-02-21 03:17:32,776 INFO L290 TraceCheckUtils]: 101: Hoare triple {79577#false} call main_#t~mem40#1 := read~int(main_~#i~0#1.base, main_~#i~0#1.offset, 4);main_#t~post41#1 := main_#t~mem40#1; {79577#false} is VALID [2022-02-21 03:17:32,776 INFO L290 TraceCheckUtils]: 102: Hoare triple {79577#false} assume !(1 + main_#t~post41#1 <= 2147483647); {79577#false} is VALID [2022-02-21 03:17:32,777 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 17 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-02-21 03:17:32,777 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-21 03:17:33,473 INFO L290 TraceCheckUtils]: 102: Hoare triple {79577#false} assume !(1 + main_#t~post41#1 <= 2147483647); {79577#false} is VALID [2022-02-21 03:17:33,473 INFO L290 TraceCheckUtils]: 101: Hoare triple {79577#false} call main_#t~mem40#1 := read~int(main_~#i~0#1.base, main_~#i~0#1.offset, 4);main_#t~post41#1 := main_#t~mem40#1; {79577#false} is VALID [2022-02-21 03:17:33,473 INFO L290 TraceCheckUtils]: 100: Hoare triple {79577#false} goto; {79577#false} is VALID [2022-02-21 03:17:33,473 INFO L290 TraceCheckUtils]: 99: Hoare triple {79577#false} goto; {79577#false} is VALID [2022-02-21 03:17:33,473 INFO L290 TraceCheckUtils]: 98: Hoare triple {79577#false} goto; {79577#false} is VALID [2022-02-21 03:17:33,473 INFO L290 TraceCheckUtils]: 97: Hoare triple {79577#false} goto; {79577#false} is VALID [2022-02-21 03:17:33,473 INFO L290 TraceCheckUtils]: 96: Hoare triple {79577#false} assume !main_#t~short110#1;havoc main_#t~mem107#1;havoc main_#t~mem106#1;havoc main_#t~mem108#1.base, main_#t~mem108#1.offset;havoc main_#t~mem109#1;havoc main_#t~short110#1; {79577#false} is VALID [2022-02-21 03:17:33,473 INFO L290 TraceCheckUtils]: 95: Hoare triple {79577#false} assume main_#t~short110#1;call main_#t~mem108#1.base, main_#t~mem108#1.offset := read~$Pointer$(main_~user~0#1.base, 8 + main_~user~0#1.offset, 4);call main_#t~mem109#1 := read~int(main_#t~mem108#1.base, 36 + main_#t~mem108#1.offset, 4);main_#t~short110#1 := 0 == main_#t~mem109#1 % 4294967296; {79577#false} is VALID [2022-02-21 03:17:33,473 INFO L290 TraceCheckUtils]: 94: Hoare triple {79577#false} call write~$Pointer$(main_~user~0#1.base, 8 + main_~user~0#1.offset, main_~_ha_head~0#1.base, main_~_ha_head~0#1.offset, 4);call main_#t~mem107#1 := read~int(main_~_ha_head~0#1.base, 4 + main_~_ha_head~0#1.offset, 4);call main_#t~mem106#1 := read~int(main_~_ha_head~0#1.base, 8 + main_~_ha_head~0#1.offset, 4);main_#t~short110#1 := main_#t~mem107#1 % 4294967296 >= 10 * (1 + main_#t~mem106#1) % 4294967296; {79577#false} is VALID [2022-02-21 03:17:33,473 INFO L290 TraceCheckUtils]: 93: Hoare triple {79577#false} assume main_#t~mem104#1.base != 0 || main_#t~mem104#1.offset != 0;havoc main_#t~mem104#1.base, main_#t~mem104#1.offset;call main_#t~mem105#1.base, main_#t~mem105#1.offset := read~$Pointer$(main_~_ha_head~0#1.base, main_~_ha_head~0#1.offset, 4);call write~$Pointer$(main_~user~0#1.base, 8 + main_~user~0#1.offset, main_#t~mem105#1.base, 12 + main_#t~mem105#1.offset, 4);havoc main_#t~mem105#1.base, main_#t~mem105#1.offset; {79577#false} is VALID [2022-02-21 03:17:33,473 INFO L290 TraceCheckUtils]: 92: Hoare triple {79577#false} call main_#t~mem99#1.base, main_#t~mem99#1.offset := read~$Pointer$(main_~users~0#1.base, 8 + main_~users~0#1.offset, 4);call main_#t~mem100#1.base, main_#t~mem100#1.offset := read~$Pointer$(main_#t~mem99#1.base, main_#t~mem99#1.offset, 4);main_~_ha_head~0#1.base, main_~_ha_head~0#1.offset := main_#t~mem100#1.base, main_#t~mem100#1.offset + 12 * (if main_~_ha_bkt~0#1 % 4294967296 % 4294967296 <= 2147483647 then main_~_ha_bkt~0#1 % 4294967296 % 4294967296 else main_~_ha_bkt~0#1 % 4294967296 % 4294967296 - 4294967296);havoc main_#t~mem99#1.base, main_#t~mem99#1.offset;havoc main_#t~mem100#1.base, main_#t~mem100#1.offset;call main_#t~mem101#1 := read~int(main_~_ha_head~0#1.base, 4 + main_~_ha_head~0#1.offset, 4);main_#t~post102#1 := main_#t~mem101#1;call write~int(1 + main_#t~post102#1, main_~_ha_head~0#1.base, 4 + main_~_ha_head~0#1.offset, 4);havoc main_#t~mem101#1;havoc main_#t~post102#1;call main_#t~mem103#1.base, main_#t~mem103#1.offset := read~$Pointer$(main_~_ha_head~0#1.base, main_~_ha_head~0#1.offset, 4);call write~$Pointer$(main_#t~mem103#1.base, main_#t~mem103#1.offset, main_~user~0#1.base, 24 + main_~user~0#1.offset, 4);havoc main_#t~mem103#1.base, main_#t~mem103#1.offset;call write~$Pointer$(0, 0, main_~user~0#1.base, 20 + main_~user~0#1.offset, 4);call main_#t~mem104#1.base, main_#t~mem104#1.offset := read~$Pointer$(main_~_ha_head~0#1.base, main_~_ha_head~0#1.offset, 4); {79577#false} is VALID [2022-02-21 03:17:33,473 INFO L290 TraceCheckUtils]: 91: Hoare triple {79577#false} goto; {79577#false} is VALID [2022-02-21 03:17:33,473 INFO L290 TraceCheckUtils]: 90: Hoare triple {79577#false} call main_#t~mem97#1.base, main_#t~mem97#1.offset := read~$Pointer$(main_~users~0#1.base, 8 + main_~users~0#1.offset, 4);call main_#t~mem98#1 := read~int(main_#t~mem97#1.base, 4 + main_#t~mem97#1.offset, 4);main_~_ha_bkt~0#1 := (if 0 == main_~_ha_hashv~0#1 || 0 == main_#t~mem98#1 - 1 then 0 else (if 1 == main_#t~mem98#1 - 1 then (if 1 == main_~_ha_hashv~0#1 || 0 == main_~_ha_hashv~0#1 then main_~_ha_hashv~0#1 else (if main_~_ha_hashv~0#1 >= 0 then main_~_ha_hashv~0#1 % 2 else ~bitwiseAnd(main_~_ha_hashv~0#1, main_#t~mem98#1 - 1))) else (if 1 == main_~_ha_hashv~0#1 then (if 1 == main_#t~mem98#1 - 1 || 0 == main_#t~mem98#1 - 1 then main_#t~mem98#1 - 1 else (if main_#t~mem98#1 - 1 >= 0 then (main_#t~mem98#1 - 1) % 2 else ~bitwiseAnd(main_~_ha_hashv~0#1, main_#t~mem98#1 - 1))) else ~bitwiseAnd(main_~_ha_hashv~0#1, main_#t~mem98#1 - 1))));havoc main_#t~mem97#1.base, main_#t~mem97#1.offset;havoc main_#t~mem98#1; {79577#false} is VALID [2022-02-21 03:17:33,474 INFO L290 TraceCheckUtils]: 89: Hoare triple {79577#false} havoc main_~_ha_bkt~0#1;call main_#t~mem94#1.base, main_#t~mem94#1.offset := read~$Pointer$(main_~users~0#1.base, 8 + main_~users~0#1.offset, 4);call main_#t~mem95#1 := read~int(main_#t~mem94#1.base, 12 + main_#t~mem94#1.offset, 4);main_#t~post96#1 := main_#t~mem95#1;call write~int(1 + main_#t~post96#1, main_#t~mem94#1.base, 12 + main_#t~mem94#1.offset, 4);havoc main_#t~mem94#1.base, main_#t~mem94#1.offset;havoc main_#t~mem95#1;havoc main_#t~post96#1; {79577#false} is VALID [2022-02-21 03:17:33,474 INFO L290 TraceCheckUtils]: 88: Hoare triple {79577#false} main_~users~0#1.base, main_~users~0#1.offset := main_~user~0#1.base, main_~user~0#1.offset; {79577#false} is VALID [2022-02-21 03:17:33,474 INFO L290 TraceCheckUtils]: 87: Hoare triple {79577#false} goto; {79577#false} is VALID [2022-02-21 03:17:33,474 INFO L290 TraceCheckUtils]: 86: Hoare triple {79577#false} havoc main_#t~mem84#1.base, main_#t~mem84#1.offset;havoc main_#t~mem85#1.base, main_#t~mem85#1.offset; {79577#false} is VALID [2022-02-21 03:17:33,474 INFO L284 TraceCheckUtils]: 85: Hoare quadruple {79576#true} {79577#false} #863#return; {79577#false} is VALID [2022-02-21 03:17:33,474 INFO L290 TraceCheckUtils]: 84: Hoare triple {79576#true} assume true; {79576#true} is VALID [2022-02-21 03:17:33,474 INFO L290 TraceCheckUtils]: 83: Hoare triple {79576#true} assume #Ultimate.C_memset_#res#1.base == #Ultimate.C_memset_#ptr#1.base && #Ultimate.C_memset_#res#1.offset == #Ultimate.C_memset_#ptr#1.offset;#t~memset~res38#1.base, #t~memset~res38#1.offset := #Ultimate.C_memset_#res#1.base, #Ultimate.C_memset_#res#1.offset;assume { :end_inline_#Ultimate.C_memset } true;havoc #t~memset~res38#1.base, #t~memset~res38#1.offset; {79576#true} is VALID [2022-02-21 03:17:33,474 INFO L290 TraceCheckUtils]: 82: Hoare triple {79576#true} assume !(#Ultimate.C_memset_#t~loopctr269#1 % 4294967296 < #Ultimate.C_memset_#amount#1 % 4294967296); {79576#true} is VALID [2022-02-21 03:17:33,474 INFO L290 TraceCheckUtils]: 81: Hoare triple {79576#true} assume #Ultimate.C_memset_#t~loopctr269#1 % 4294967296 < #Ultimate.C_memset_#amount#1 % 4294967296;#memory_int := #memory_int[#Ultimate.C_memset_#ptr#1.base,#Ultimate.C_memset_#ptr#1.offset + #Ultimate.C_memset_#t~loopctr269#1 := #Ultimate.C_memset_#value#1];#memory_$Pointer$.base, #memory_$Pointer$.offset := #memory_$Pointer$.base[#Ultimate.C_memset_#ptr#1.base,#Ultimate.C_memset_#ptr#1.offset + #Ultimate.C_memset_#t~loopctr269#1 := 0], #memory_$Pointer$.offset[#Ultimate.C_memset_#ptr#1.base,#Ultimate.C_memset_#ptr#1.offset + #Ultimate.C_memset_#t~loopctr269#1 := #Ultimate.C_memset_#value#1 % 256];#Ultimate.C_memset_#t~loopctr269#1 := 1 + #Ultimate.C_memset_#t~loopctr269#1; {79576#true} is VALID [2022-02-21 03:17:33,474 INFO L290 TraceCheckUtils]: 80: Hoare triple {79576#true} assume 1 + ~alt_bzero_count~0 >= -2147483648;#t~pre37#1 := 1 + ~alt_bzero_count~0;~alt_bzero_count~0 := 1 + ~alt_bzero_count~0;havoc #t~pre37#1;assume { :begin_inline_#Ultimate.C_memset } true;#Ultimate.C_memset_#ptr#1.base, #Ultimate.C_memset_#ptr#1.offset, #Ultimate.C_memset_#value#1, #Ultimate.C_memset_#amount#1 := ~a#1.base, ~a#1.offset, 0, ~n#1;havoc #Ultimate.C_memset_#res#1.base, #Ultimate.C_memset_#res#1.offset;havoc #Ultimate.C_memset_#t~loopctr269#1;#Ultimate.C_memset_#t~loopctr269#1 := 0; {79576#true} is VALID [2022-02-21 03:17:33,474 INFO L290 TraceCheckUtils]: 79: Hoare triple {79576#true} assume 1 + ~alt_bzero_count~0 <= 2147483647; {79576#true} is VALID [2022-02-21 03:17:33,474 INFO L290 TraceCheckUtils]: 78: Hoare triple {79576#true} ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; {79576#true} is VALID [2022-02-21 03:17:33,474 INFO L272 TraceCheckUtils]: 77: Hoare triple {79577#false} call alt_bzero(main_#t~mem85#1.base, main_#t~mem85#1.offset, 384); {79576#true} is VALID [2022-02-21 03:17:33,474 INFO L290 TraceCheckUtils]: 76: Hoare triple {79577#false} assume !(main_#t~mem82#1.base == 0 && main_#t~mem82#1.offset == 0);havoc main_#t~mem81#1.base, main_#t~mem81#1.offset;havoc main_#t~mem82#1.base, main_#t~mem82#1.offset;call main_#t~mem84#1.base, main_#t~mem84#1.offset := read~$Pointer$(main_~user~0#1.base, 8 + main_~user~0#1.offset, 4);call main_#t~mem85#1.base, main_#t~mem85#1.offset := read~$Pointer$(main_#t~mem84#1.base, main_#t~mem84#1.offset, 4); {79577#false} is VALID [2022-02-21 03:17:33,474 INFO L290 TraceCheckUtils]: 75: Hoare triple {79577#false} call write~$Pointer$(main_#t~ret79#1.base, main_#t~ret79#1.offset, main_#t~mem78#1.base, main_#t~mem78#1.offset, 4);havoc main_#t~mem78#1.base, main_#t~mem78#1.offset;havoc main_#t~ret79#1.base, main_#t~ret79#1.offset;call main_#t~mem80#1.base, main_#t~mem80#1.offset := read~$Pointer$(main_~user~0#1.base, 8 + main_~user~0#1.offset, 4);call write~int(2685476833, main_#t~mem80#1.base, 40 + main_#t~mem80#1.offset, 4);havoc main_#t~mem80#1.base, main_#t~mem80#1.offset;call main_#t~mem81#1.base, main_#t~mem81#1.offset := read~$Pointer$(main_~user~0#1.base, 8 + main_~user~0#1.offset, 4);call main_#t~mem82#1.base, main_#t~mem82#1.offset := read~$Pointer$(main_#t~mem81#1.base, main_#t~mem81#1.offset, 4); {79577#false} is VALID [2022-02-21 03:17:33,474 INFO L284 TraceCheckUtils]: 74: Hoare quadruple {79576#true} {79577#false} #859#return; {79577#false} is VALID [2022-02-21 03:17:33,475 INFO L290 TraceCheckUtils]: 73: Hoare triple {79576#true} assume true; {79576#true} is VALID [2022-02-21 03:17:33,475 INFO L290 TraceCheckUtils]: 72: Hoare triple {79576#true} call #t~malloc32.base, #t~malloc32.offset := #Ultimate.allocOnHeap(~sz);#res.base, #res.offset := #t~malloc32.base, #t~malloc32.offset;havoc #t~malloc32.base, #t~malloc32.offset; {79576#true} is VALID [2022-02-21 03:17:33,475 INFO L290 TraceCheckUtils]: 71: Hoare triple {79576#true} assume !(1 == ~alt_malloc_balance~0); {79576#true} is VALID [2022-02-21 03:17:33,475 INFO L290 TraceCheckUtils]: 70: Hoare triple {79576#true} assume 1 + #t~post31 >= -2147483648;~alt_malloc_balance~0 := 1 + #t~post31;call write~int(~sz, ~#alt_malloc_sizes~0.base, ~#alt_malloc_sizes~0.offset + 4 * #t~post31, 4);havoc #t~post31; {79576#true} is VALID [2022-02-21 03:17:33,475 INFO L290 TraceCheckUtils]: 69: Hoare triple {79576#true} assume 1 + #t~post31 <= 2147483647; {79576#true} is VALID [2022-02-21 03:17:33,475 INFO L290 TraceCheckUtils]: 68: Hoare triple {79576#true} ~sz := #in~sz;#t~post31 := ~alt_malloc_balance~0; {79576#true} is VALID [2022-02-21 03:17:33,475 INFO L272 TraceCheckUtils]: 67: Hoare triple {79577#false} call main_#t~ret79#1.base, main_#t~ret79#1.offset := alt_malloc(384); {79576#true} is VALID [2022-02-21 03:17:33,475 INFO L290 TraceCheckUtils]: 66: Hoare triple {79577#false} havoc main_#t~mem73#1.base, main_#t~mem73#1.offset;call main_#t~mem74#1.base, main_#t~mem74#1.offset := read~$Pointer$(main_~user~0#1.base, 8 + main_~user~0#1.offset, 4);call write~$Pointer$(main_~user~0#1.base, 8 + main_~user~0#1.offset, main_#t~mem74#1.base, 16 + main_#t~mem74#1.offset, 4);havoc main_#t~mem74#1.base, main_#t~mem74#1.offset;call main_#t~mem75#1.base, main_#t~mem75#1.offset := read~$Pointer$(main_~user~0#1.base, 8 + main_~user~0#1.offset, 4);call write~int(32, main_#t~mem75#1.base, 4 + main_#t~mem75#1.offset, 4);havoc main_#t~mem75#1.base, main_#t~mem75#1.offset;call main_#t~mem76#1.base, main_#t~mem76#1.offset := read~$Pointer$(main_~user~0#1.base, 8 + main_~user~0#1.offset, 4);call write~int(5, main_#t~mem76#1.base, 8 + main_#t~mem76#1.offset, 4);havoc main_#t~mem76#1.base, main_#t~mem76#1.offset;call main_#t~mem77#1.base, main_#t~mem77#1.offset := read~$Pointer$(main_~user~0#1.base, 8 + main_~user~0#1.offset, 4);call write~int((if 8 + main_~user~0#1.offset - main_~user~0#1.offset < 0 && 0 != (8 + main_~user~0#1.offset - main_~user~0#1.offset) % 1 then 1 + (8 + main_~user~0#1.offset - main_~user~0#1.offset) / 1 else (8 + main_~user~0#1.offset - main_~user~0#1.offset) / 1), main_#t~mem77#1.base, 20 + main_#t~mem77#1.offset, 4);havoc main_#t~mem77#1.base, main_#t~mem77#1.offset;call main_#t~mem78#1.base, main_#t~mem78#1.offset := read~$Pointer$(main_~user~0#1.base, 8 + main_~user~0#1.offset, 4); {79577#false} is VALID [2022-02-21 03:17:33,476 INFO L284 TraceCheckUtils]: 65: Hoare quadruple {80009#(not (= |alt_bzero_#in~n#1| 44))} {79576#true} #857#return; {79577#false} is VALID [2022-02-21 03:17:33,476 INFO L290 TraceCheckUtils]: 64: Hoare triple {80009#(not (= |alt_bzero_#in~n#1| 44))} assume true; {80009#(not (= |alt_bzero_#in~n#1| 44))} is VALID [2022-02-21 03:17:33,476 INFO L290 TraceCheckUtils]: 63: Hoare triple {80009#(not (= |alt_bzero_#in~n#1| 44))} assume #Ultimate.C_memset_#res#1.base == #Ultimate.C_memset_#ptr#1.base && #Ultimate.C_memset_#res#1.offset == #Ultimate.C_memset_#ptr#1.offset;#t~memset~res38#1.base, #t~memset~res38#1.offset := #Ultimate.C_memset_#res#1.base, #Ultimate.C_memset_#res#1.offset;assume { :end_inline_#Ultimate.C_memset } true;havoc #t~memset~res38#1.base, #t~memset~res38#1.offset; {80009#(not (= |alt_bzero_#in~n#1| 44))} is VALID [2022-02-21 03:17:33,477 INFO L290 TraceCheckUtils]: 62: Hoare triple {80019#(or (< (mod |alt_bzero_#Ultimate.C_memset_#t~loopctr269#1| 4294967296) (mod |alt_bzero_#Ultimate.C_memset_#amount#1| 4294967296)) (not (= |alt_bzero_#in~n#1| 44)))} assume !(#Ultimate.C_memset_#t~loopctr269#1 % 4294967296 < #Ultimate.C_memset_#amount#1 % 4294967296); {80009#(not (= |alt_bzero_#in~n#1| 44))} is VALID [2022-02-21 03:17:33,478 INFO L290 TraceCheckUtils]: 61: Hoare triple {80023#(or (< (mod (+ |alt_bzero_#Ultimate.C_memset_#t~loopctr269#1| 1) 4294967296) (mod |alt_bzero_#Ultimate.C_memset_#amount#1| 4294967296)) (not (= |alt_bzero_#in~n#1| 44)))} assume #Ultimate.C_memset_#t~loopctr269#1 % 4294967296 < #Ultimate.C_memset_#amount#1 % 4294967296;#memory_int := #memory_int[#Ultimate.C_memset_#ptr#1.base,#Ultimate.C_memset_#ptr#1.offset + #Ultimate.C_memset_#t~loopctr269#1 := #Ultimate.C_memset_#value#1];#memory_$Pointer$.base, #memory_$Pointer$.offset := #memory_$Pointer$.base[#Ultimate.C_memset_#ptr#1.base,#Ultimate.C_memset_#ptr#1.offset + #Ultimate.C_memset_#t~loopctr269#1 := 0], #memory_$Pointer$.offset[#Ultimate.C_memset_#ptr#1.base,#Ultimate.C_memset_#ptr#1.offset + #Ultimate.C_memset_#t~loopctr269#1 := #Ultimate.C_memset_#value#1 % 256];#Ultimate.C_memset_#t~loopctr269#1 := 1 + #Ultimate.C_memset_#t~loopctr269#1; {80019#(or (< (mod |alt_bzero_#Ultimate.C_memset_#t~loopctr269#1| 4294967296) (mod |alt_bzero_#Ultimate.C_memset_#amount#1| 4294967296)) (not (= |alt_bzero_#in~n#1| 44)))} is VALID [2022-02-21 03:17:33,479 INFO L290 TraceCheckUtils]: 60: Hoare triple {80027#(or (< 1 (mod |alt_bzero_~n#1| 4294967296)) (not (= |alt_bzero_#in~n#1| 44)))} assume 1 + ~alt_bzero_count~0 >= -2147483648;#t~pre37#1 := 1 + ~alt_bzero_count~0;~alt_bzero_count~0 := 1 + ~alt_bzero_count~0;havoc #t~pre37#1;assume { :begin_inline_#Ultimate.C_memset } true;#Ultimate.C_memset_#ptr#1.base, #Ultimate.C_memset_#ptr#1.offset, #Ultimate.C_memset_#value#1, #Ultimate.C_memset_#amount#1 := ~a#1.base, ~a#1.offset, 0, ~n#1;havoc #Ultimate.C_memset_#res#1.base, #Ultimate.C_memset_#res#1.offset;havoc #Ultimate.C_memset_#t~loopctr269#1;#Ultimate.C_memset_#t~loopctr269#1 := 0; {80023#(or (< (mod (+ |alt_bzero_#Ultimate.C_memset_#t~loopctr269#1| 1) 4294967296) (mod |alt_bzero_#Ultimate.C_memset_#amount#1| 4294967296)) (not (= |alt_bzero_#in~n#1| 44)))} is VALID [2022-02-21 03:17:33,480 INFO L290 TraceCheckUtils]: 59: Hoare triple {80027#(or (< 1 (mod |alt_bzero_~n#1| 4294967296)) (not (= |alt_bzero_#in~n#1| 44)))} assume 1 + ~alt_bzero_count~0 <= 2147483647; {80027#(or (< 1 (mod |alt_bzero_~n#1| 4294967296)) (not (= |alt_bzero_#in~n#1| 44)))} is VALID [2022-02-21 03:17:33,480 INFO L290 TraceCheckUtils]: 58: Hoare triple {79576#true} ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; {80027#(or (< 1 (mod |alt_bzero_~n#1| 4294967296)) (not (= |alt_bzero_#in~n#1| 44)))} is VALID [2022-02-21 03:17:33,480 INFO L272 TraceCheckUtils]: 57: Hoare triple {79576#true} call alt_bzero(main_#t~mem73#1.base, main_#t~mem73#1.offset, 44); {79576#true} is VALID [2022-02-21 03:17:33,480 INFO L290 TraceCheckUtils]: 56: Hoare triple {79576#true} assume !(main_#t~mem72#1.base == 0 && main_#t~mem72#1.offset == 0);havoc main_#t~mem72#1.base, main_#t~mem72#1.offset;call main_#t~mem73#1.base, main_#t~mem73#1.offset := read~$Pointer$(main_~user~0#1.base, 8 + main_~user~0#1.offset, 4); {79576#true} is VALID [2022-02-21 03:17:33,480 INFO L290 TraceCheckUtils]: 55: Hoare triple {79576#true} call write~$Pointer$(main_#t~ret71#1.base, main_#t~ret71#1.offset, main_~user~0#1.base, 8 + main_~user~0#1.offset, 4);havoc main_#t~ret71#1.base, main_#t~ret71#1.offset;call main_#t~mem72#1.base, main_#t~mem72#1.offset := read~$Pointer$(main_~user~0#1.base, 8 + main_~user~0#1.offset, 4); {79576#true} is VALID [2022-02-21 03:17:33,481 INFO L284 TraceCheckUtils]: 54: Hoare quadruple {79576#true} {79576#true} #855#return; {79576#true} is VALID [2022-02-21 03:17:33,481 INFO L290 TraceCheckUtils]: 53: Hoare triple {79576#true} assume true; {79576#true} is VALID [2022-02-21 03:17:33,481 INFO L290 TraceCheckUtils]: 52: Hoare triple {79576#true} call #t~malloc32.base, #t~malloc32.offset := #Ultimate.allocOnHeap(~sz);#res.base, #res.offset := #t~malloc32.base, #t~malloc32.offset;havoc #t~malloc32.base, #t~malloc32.offset; {79576#true} is VALID [2022-02-21 03:17:33,481 INFO L284 TraceCheckUtils]: 51: Hoare quadruple {79576#true} {79576#true} #853#return; {79576#true} is VALID [2022-02-21 03:17:33,481 INFO L290 TraceCheckUtils]: 50: Hoare triple {79576#true} assume true; {79576#true} is VALID [2022-02-21 03:17:33,481 INFO L290 TraceCheckUtils]: 49: Hoare triple {79576#true} assume !(0 == ~cond); {79576#true} is VALID [2022-02-21 03:17:33,481 INFO L290 TraceCheckUtils]: 48: Hoare triple {79576#true} ~cond := #in~cond; {79576#true} is VALID [2022-02-21 03:17:33,481 INFO L272 TraceCheckUtils]: 47: Hoare triple {79576#true} call __VERIFIER_assert((if 44 == ~sz % 4294967296 then 1 else 0)); {79576#true} is VALID [2022-02-21 03:17:33,482 INFO L290 TraceCheckUtils]: 46: Hoare triple {79576#true} assume 1 == ~alt_malloc_balance~0; {79576#true} is VALID [2022-02-21 03:17:33,482 INFO L290 TraceCheckUtils]: 45: Hoare triple {79576#true} assume 1 + #t~post31 >= -2147483648;~alt_malloc_balance~0 := 1 + #t~post31;call write~int(~sz, ~#alt_malloc_sizes~0.base, ~#alt_malloc_sizes~0.offset + 4 * #t~post31, 4);havoc #t~post31; {79576#true} is VALID [2022-02-21 03:17:33,482 INFO L290 TraceCheckUtils]: 44: Hoare triple {79576#true} assume 1 + #t~post31 <= 2147483647; {79576#true} is VALID [2022-02-21 03:17:33,482 INFO L290 TraceCheckUtils]: 43: Hoare triple {79576#true} ~sz := #in~sz;#t~post31 := ~alt_malloc_balance~0; {79576#true} is VALID [2022-02-21 03:17:33,482 INFO L272 TraceCheckUtils]: 42: Hoare triple {79576#true} call main_#t~ret71#1.base, main_#t~ret71#1.offset := alt_malloc(44); {79576#true} is VALID [2022-02-21 03:17:33,482 INFO L290 TraceCheckUtils]: 41: Hoare triple {79576#true} assume main_~users~0#1.base == 0 && main_~users~0#1.offset == 0;call write~$Pointer$(0, 0, main_~user~0#1.base, 16 + main_~user~0#1.offset, 4);call write~$Pointer$(0, 0, main_~user~0#1.base, 12 + main_~user~0#1.offset, 4); {79576#true} is VALID [2022-02-21 03:17:33,482 INFO L290 TraceCheckUtils]: 40: Hoare triple {79576#true} call write~int(main_~_ha_hashv~0#1, main_~user~0#1.base, 36 + main_~user~0#1.offset, 4);call write~$Pointer$(main_~user~0#1.base, main_~user~0#1.offset, main_~user~0#1.base, 28 + main_~user~0#1.offset, 4);call write~int(4, main_~user~0#1.base, 32 + main_~user~0#1.offset, 4); {79576#true} is VALID [2022-02-21 03:17:33,482 INFO L290 TraceCheckUtils]: 39: Hoare triple {79576#true} goto; {79576#true} is VALID [2022-02-21 03:17:33,482 INFO L290 TraceCheckUtils]: 38: Hoare triple {79576#true} goto; {79576#true} is VALID [2022-02-21 03:17:33,483 INFO L290 TraceCheckUtils]: 37: Hoare triple {79576#true} goto; {79576#true} is VALID [2022-02-21 03:17:33,483 INFO L290 TraceCheckUtils]: 36: Hoare triple {79576#true} main_~_hj_i~0#1 := main_~_hj_i~0#1 - main_~_hj_j~0#1;main_~_hj_i~0#1 := main_~_hj_i~0#1 - main_~_ha_hashv~0#1;main_~_hj_i~0#1 := (if (1 == main_~_hj_i~0#1 || 0 == main_~_hj_i~0#1) && (1 == main_~_ha_hashv~0#1 / 8192 || 0 == main_~_ha_hashv~0#1 / 8192) then (if main_~_hj_i~0#1 == main_~_ha_hashv~0#1 / 8192 then 0 else 1) else (if 0 == main_~_hj_i~0#1 then main_~_ha_hashv~0#1 / 8192 else (if 0 == main_~_ha_hashv~0#1 / 8192 then main_~_hj_i~0#1 else ~bitwiseXOr(main_~_hj_i~0#1, main_~_ha_hashv~0#1 / 8192))));main_~_hj_j~0#1 := main_~_hj_j~0#1 - main_~_ha_hashv~0#1;main_~_hj_j~0#1 := main_~_hj_j~0#1 - main_~_hj_i~0#1;main_~_hj_j~0#1 := (if (1 == main_~_hj_j~0#1 || 0 == main_~_hj_j~0#1) && (1 == 256 * main_~_hj_i~0#1 || 0 == 256 * main_~_hj_i~0#1) then (if main_~_hj_j~0#1 == 256 * main_~_hj_i~0#1 then 0 else 1) else (if 0 == main_~_hj_j~0#1 then 256 * main_~_hj_i~0#1 else (if 0 == 256 * main_~_hj_i~0#1 then main_~_hj_j~0#1 else ~bitwiseXOr(main_~_hj_j~0#1, 256 * main_~_hj_i~0#1))));main_~_ha_hashv~0#1 := main_~_ha_hashv~0#1 - main_~_hj_i~0#1;main_~_ha_hashv~0#1 := main_~_ha_hashv~0#1 - main_~_hj_j~0#1;main_~_ha_hashv~0#1 := (if (1 == main_~_ha_hashv~0#1 || 0 == main_~_ha_hashv~0#1) && (1 == main_~_hj_j~0#1 / 8192 || 0 == main_~_hj_j~0#1 / 8192) then (if main_~_ha_hashv~0#1 == main_~_hj_j~0#1 / 8192 then 0 else 1) else (if 0 == main_~_ha_hashv~0#1 then main_~_hj_j~0#1 / 8192 else (if 0 == main_~_hj_j~0#1 / 8192 then main_~_ha_hashv~0#1 else ~bitwiseXOr(main_~_ha_hashv~0#1, main_~_hj_j~0#1 / 8192))));main_~_hj_i~0#1 := main_~_hj_i~0#1 - main_~_hj_j~0#1;main_~_hj_i~0#1 := main_~_hj_i~0#1 - main_~_ha_hashv~0#1;main_~_hj_i~0#1 := (if (1 == main_~_hj_i~0#1 || 0 == main_~_hj_i~0#1) && (1 == main_~_ha_hashv~0#1 / 4096 || 0 == main_~_ha_hashv~0#1 / 4096) then (if main_~_hj_i~0#1 == main_~_ha_hashv~0#1 / 4096 then 0 else 1) else (if 0 == main_~_hj_i~0#1 then main_~_ha_hashv~0#1 / 4096 else (if 0 == main_~_ha_hashv~0#1 / 4096 then main_~_hj_i~0#1 else ~bitwiseXOr(main_~_hj_i~0#1, main_~_ha_hashv~0#1 / 4096))));main_~_hj_j~0#1 := main_~_hj_j~0#1 - main_~_ha_hashv~0#1;main_~_hj_j~0#1 := main_~_hj_j~0#1 - main_~_hj_i~0#1;main_~_hj_j~0#1 := (if (1 == main_~_hj_j~0#1 || 0 == main_~_hj_j~0#1) && (1 == 65536 * main_~_hj_i~0#1 || 0 == 65536 * main_~_hj_i~0#1) then (if main_~_hj_j~0#1 == 65536 * main_~_hj_i~0#1 then 0 else 1) else (if 0 == main_~_hj_j~0#1 then 65536 * main_~_hj_i~0#1 else (if 0 == 65536 * main_~_hj_i~0#1 then main_~_hj_j~0#1 else ~bitwiseXOr(main_~_hj_j~0#1, 65536 * main_~_hj_i~0#1))));main_~_ha_hashv~0#1 := main_~_ha_hashv~0#1 - main_~_hj_i~0#1;main_~_ha_hashv~0#1 := main_~_ha_hashv~0#1 - main_~_hj_j~0#1;main_~_ha_hashv~0#1 := (if (1 == main_~_ha_hashv~0#1 || 0 == main_~_ha_hashv~0#1) && (1 == main_~_hj_j~0#1 / 32 || 0 == main_~_hj_j~0#1 / 32) then (if main_~_ha_hashv~0#1 == main_~_hj_j~0#1 / 32 then 0 else 1) else (if 0 == main_~_ha_hashv~0#1 then main_~_hj_j~0#1 / 32 else (if 0 == main_~_hj_j~0#1 / 32 then main_~_ha_hashv~0#1 else ~bitwiseXOr(main_~_ha_hashv~0#1, main_~_hj_j~0#1 / 32))));main_~_hj_i~0#1 := main_~_hj_i~0#1 - main_~_hj_j~0#1;main_~_hj_i~0#1 := main_~_hj_i~0#1 - main_~_ha_hashv~0#1;main_~_hj_i~0#1 := (if (1 == main_~_hj_i~0#1 || 0 == main_~_hj_i~0#1) && (1 == main_~_ha_hashv~0#1 / 8 || 0 == main_~_ha_hashv~0#1 / 8) then (if main_~_hj_i~0#1 == main_~_ha_hashv~0#1 / 8 then 0 else 1) else (if 0 == main_~_hj_i~0#1 then main_~_ha_hashv~0#1 / 8 else (if 0 == main_~_ha_hashv~0#1 / 8 then main_~_hj_i~0#1 else ~bitwiseXOr(main_~_hj_i~0#1, main_~_ha_hashv~0#1 / 8))));main_~_hj_j~0#1 := main_~_hj_j~0#1 - main_~_ha_hashv~0#1;main_~_hj_j~0#1 := main_~_hj_j~0#1 - main_~_hj_i~0#1;main_~_hj_j~0#1 := (if (1 == main_~_hj_j~0#1 || 0 == main_~_hj_j~0#1) && (1 == 1024 * main_~_hj_i~0#1 || 0 == 1024 * main_~_hj_i~0#1) then (if main_~_hj_j~0#1 == 1024 * main_~_hj_i~0#1 then 0 else 1) else (if 0 == main_~_hj_j~0#1 then 1024 * main_~_hj_i~0#1 else (if 0 == 1024 * main_~_hj_i~0#1 then main_~_hj_j~0#1 else ~bitwiseXOr(main_~_hj_j~0#1, 1024 * main_~_hj_i~0#1))));main_~_ha_hashv~0#1 := main_~_ha_hashv~0#1 - main_~_hj_i~0#1;main_~_ha_hashv~0#1 := main_~_ha_hashv~0#1 - main_~_hj_j~0#1;main_~_ha_hashv~0#1 := (if (1 == main_~_ha_hashv~0#1 || 0 == main_~_ha_hashv~0#1) && (1 == main_~_hj_j~0#1 / 32768 || 0 == main_~_hj_j~0#1 / 32768) then (if main_~_ha_hashv~0#1 == main_~_hj_j~0#1 / 32768 then 0 else 1) else (if 0 == main_~_ha_hashv~0#1 then main_~_hj_j~0#1 / 32768 else (if 0 == main_~_hj_j~0#1 / 32768 then main_~_ha_hashv~0#1 else ~bitwiseXOr(main_~_ha_hashv~0#1, main_~_hj_j~0#1 / 32768)))); {79576#true} is VALID [2022-02-21 03:17:33,483 INFO L290 TraceCheckUtils]: 35: Hoare triple {79576#true} havoc main_#t~switch59#1; {79576#true} is VALID [2022-02-21 03:17:33,483 INFO L290 TraceCheckUtils]: 34: Hoare triple {79576#true} assume main_#t~switch59#1;call main_#t~mem70#1 := read~int(main_~_hj_key~0#1.base, main_~_hj_key~0#1.offset, 1);main_~_hj_i~0#1 := main_~_hj_i~0#1 + main_#t~mem70#1 % 256;havoc main_#t~mem70#1; {79576#true} is VALID [2022-02-21 03:17:33,483 INFO L290 TraceCheckUtils]: 33: Hoare triple {79576#true} main_#t~switch59#1 := main_#t~switch59#1 || 1 == main_~_hj_k~0#1; {79576#true} is VALID [2022-02-21 03:17:33,483 INFO L290 TraceCheckUtils]: 32: Hoare triple {79576#true} assume main_#t~switch59#1;call main_#t~mem69#1 := read~int(main_~_hj_key~0#1.base, 1 + main_~_hj_key~0#1.offset, 1);main_~_hj_i~0#1 := main_~_hj_i~0#1 + 256 * (main_#t~mem69#1 % 256);havoc main_#t~mem69#1; {79576#true} is VALID [2022-02-21 03:17:33,483 INFO L290 TraceCheckUtils]: 31: Hoare triple {79576#true} main_#t~switch59#1 := main_#t~switch59#1 || 2 == main_~_hj_k~0#1; {79576#true} is VALID [2022-02-21 03:17:33,484 INFO L290 TraceCheckUtils]: 30: Hoare triple {79576#true} assume main_#t~switch59#1;call main_#t~mem68#1 := read~int(main_~_hj_key~0#1.base, 2 + main_~_hj_key~0#1.offset, 1);main_~_hj_i~0#1 := main_~_hj_i~0#1 + 65536 * (main_#t~mem68#1 % 256);havoc main_#t~mem68#1; {79576#true} is VALID [2022-02-21 03:17:33,484 INFO L290 TraceCheckUtils]: 29: Hoare triple {79576#true} main_#t~switch59#1 := main_#t~switch59#1 || 3 == main_~_hj_k~0#1; {79576#true} is VALID [2022-02-21 03:17:33,484 INFO L290 TraceCheckUtils]: 28: Hoare triple {79576#true} assume main_#t~switch59#1;call main_#t~mem67#1 := read~int(main_~_hj_key~0#1.base, 3 + main_~_hj_key~0#1.offset, 1);main_~_hj_i~0#1 := main_~_hj_i~0#1 + 16777216 * (main_#t~mem67#1 % 256);havoc main_#t~mem67#1; {79576#true} is VALID [2022-02-21 03:17:33,484 INFO L290 TraceCheckUtils]: 27: Hoare triple {79576#true} main_#t~switch59#1 := main_#t~switch59#1 || 4 == main_~_hj_k~0#1; {79576#true} is VALID [2022-02-21 03:17:33,484 INFO L290 TraceCheckUtils]: 26: Hoare triple {79576#true} assume !main_#t~switch59#1; {79576#true} is VALID [2022-02-21 03:17:33,484 INFO L290 TraceCheckUtils]: 25: Hoare triple {79576#true} main_#t~switch59#1 := main_#t~switch59#1 || 5 == main_~_hj_k~0#1; {79576#true} is VALID [2022-02-21 03:17:33,484 INFO L290 TraceCheckUtils]: 24: Hoare triple {79576#true} assume !main_#t~switch59#1; {79576#true} is VALID [2022-02-21 03:17:33,484 INFO L290 TraceCheckUtils]: 23: Hoare triple {79576#true} main_#t~switch59#1 := main_#t~switch59#1 || 6 == main_~_hj_k~0#1; {79576#true} is VALID [2022-02-21 03:17:33,484 INFO L290 TraceCheckUtils]: 22: Hoare triple {79576#true} assume !main_#t~switch59#1; {79576#true} is VALID [2022-02-21 03:17:33,485 INFO L290 TraceCheckUtils]: 21: Hoare triple {79576#true} main_#t~switch59#1 := main_#t~switch59#1 || 7 == main_~_hj_k~0#1; {79576#true} is VALID [2022-02-21 03:17:33,485 INFO L290 TraceCheckUtils]: 20: Hoare triple {79576#true} assume !main_#t~switch59#1; {79576#true} is VALID [2022-02-21 03:17:33,485 INFO L290 TraceCheckUtils]: 19: Hoare triple {79576#true} main_#t~switch59#1 := main_#t~switch59#1 || 8 == main_~_hj_k~0#1; {79576#true} is VALID [2022-02-21 03:17:33,485 INFO L290 TraceCheckUtils]: 18: Hoare triple {79576#true} assume !main_#t~switch59#1; {79576#true} is VALID [2022-02-21 03:17:33,485 INFO L290 TraceCheckUtils]: 17: Hoare triple {79576#true} main_#t~switch59#1 := main_#t~switch59#1 || 9 == main_~_hj_k~0#1; {79576#true} is VALID [2022-02-21 03:17:33,485 INFO L290 TraceCheckUtils]: 16: Hoare triple {79576#true} assume !main_#t~switch59#1; {79576#true} is VALID [2022-02-21 03:17:33,485 INFO L290 TraceCheckUtils]: 15: Hoare triple {79576#true} main_#t~switch59#1 := main_#t~switch59#1 || 10 == main_~_hj_k~0#1; {79576#true} is VALID [2022-02-21 03:17:33,485 INFO L290 TraceCheckUtils]: 14: Hoare triple {79576#true} assume !main_#t~switch59#1; {79576#true} is VALID [2022-02-21 03:17:33,485 INFO L290 TraceCheckUtils]: 13: Hoare triple {79576#true} main_~_ha_hashv~0#1 := 4 + main_~_ha_hashv~0#1;main_#t~switch59#1 := 11 == main_~_hj_k~0#1; {79576#true} is VALID [2022-02-21 03:17:33,486 INFO L290 TraceCheckUtils]: 12: Hoare triple {79576#true} assume !(main_~_hj_k~0#1 % 4294967296 >= 12); {79576#true} is VALID [2022-02-21 03:17:33,486 INFO L290 TraceCheckUtils]: 11: Hoare triple {79576#true} havoc main_~_hj_i~0#1;havoc main_~_hj_j~0#1;havoc main_~_hj_k~0#1;main_~_hj_key~0#1.base, main_~_hj_key~0#1.offset := main_~user~0#1.base, main_~user~0#1.offset;main_~_ha_hashv~0#1 := 4276993775;main_~_hj_j~0#1 := 2654435769;main_~_hj_i~0#1 := main_~_hj_j~0#1;main_~_hj_k~0#1 := 4; {79576#true} is VALID [2022-02-21 03:17:33,486 INFO L290 TraceCheckUtils]: 10: Hoare triple {79576#true} goto; {79576#true} is VALID [2022-02-21 03:17:33,486 INFO L290 TraceCheckUtils]: 9: Hoare triple {79576#true} havoc main_~_ha_hashv~0#1; {79576#true} is VALID [2022-02-21 03:17:33,486 INFO L290 TraceCheckUtils]: 8: Hoare triple {79576#true} assume main_#t~mem45#1 * main_#t~mem46#1 >= -2147483648;call write~int(main_#t~mem45#1 * main_#t~mem46#1, main_~user~0#1.base, 4 + main_~user~0#1.offset, 4);havoc main_#t~mem45#1;havoc main_#t~mem46#1; {79576#true} is VALID [2022-02-21 03:17:33,486 INFO L290 TraceCheckUtils]: 7: Hoare triple {79576#true} assume main_#t~mem45#1 * main_#t~mem46#1 <= 2147483647; {79576#true} is VALID [2022-02-21 03:17:33,486 INFO L290 TraceCheckUtils]: 6: Hoare triple {79576#true} call main_#t~mem44#1 := read~int(main_~#i~0#1.base, main_~#i~0#1.offset, 4);call write~int(main_#t~mem44#1, main_~user~0#1.base, main_~user~0#1.offset, 4);havoc main_#t~mem44#1;call main_#t~mem45#1 := read~int(main_~#i~0#1.base, main_~#i~0#1.offset, 4);call main_#t~mem46#1 := read~int(main_~#i~0#1.base, main_~#i~0#1.offset, 4); {79576#true} is VALID [2022-02-21 03:17:33,486 INFO L290 TraceCheckUtils]: 5: Hoare triple {79576#true} assume !(main_~user~0#1.base == 0 && main_~user~0#1.offset == 0); {79576#true} is VALID [2022-02-21 03:17:33,487 INFO L290 TraceCheckUtils]: 4: Hoare triple {79576#true} main_#t~ret43#1.base, main_#t~ret43#1.offset := real_malloc_#res#1.base, real_malloc_#res#1.offset;assume { :end_inline_real_malloc } true;main_~user~0#1.base, main_~user~0#1.offset := main_#t~ret43#1.base, main_#t~ret43#1.offset;havoc main_#t~ret43#1.base, main_#t~ret43#1.offset; {79576#true} is VALID [2022-02-21 03:17:33,487 INFO L290 TraceCheckUtils]: 3: Hoare triple {79576#true} assume !!(main_#t~mem42#1 < 10);havoc main_#t~mem42#1;assume { :begin_inline_real_malloc } true;real_malloc_#in~n#1 := 40;havoc real_malloc_#res#1.base, real_malloc_#res#1.offset;havoc real_malloc_#t~malloc39#1.base, real_malloc_#t~malloc39#1.offset, real_malloc_~n#1;real_malloc_~n#1 := real_malloc_#in~n#1;call real_malloc_#t~malloc39#1.base, real_malloc_#t~malloc39#1.offset := #Ultimate.allocOnHeap(real_malloc_~n#1);real_malloc_#res#1.base, real_malloc_#res#1.offset := real_malloc_#t~malloc39#1.base, real_malloc_#t~malloc39#1.offset;havoc real_malloc_#t~malloc39#1.base, real_malloc_#t~malloc39#1.offset; {79576#true} is VALID [2022-02-21 03:17:33,487 INFO L290 TraceCheckUtils]: 2: Hoare triple {79576#true} call main_#t~mem42#1 := read~int(main_~#i~0#1.base, main_~#i~0#1.offset, 4); {79576#true} is VALID [2022-02-21 03:17:33,487 INFO L290 TraceCheckUtils]: 1: Hoare triple {79576#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret43#1.base, main_#t~ret43#1.offset, main_#t~mem44#1, main_#t~mem45#1, main_#t~mem46#1, main_#t~mem48#1, main_#t~mem47#1, main_#t~mem49#1, main_#t~mem50#1, main_#t~mem52#1, main_#t~mem51#1, main_#t~mem53#1, main_#t~mem54#1, main_#t~mem56#1, main_#t~mem55#1, main_#t~mem57#1, main_#t~mem58#1, main_#t~switch59#1, main_#t~mem60#1, main_#t~mem61#1, main_#t~mem62#1, main_#t~mem63#1, main_#t~mem64#1, main_#t~mem65#1, main_#t~mem66#1, main_#t~mem67#1, main_#t~mem68#1, main_#t~mem69#1, main_#t~mem70#1, main_~_hj_i~0#1, main_~_hj_j~0#1, main_~_hj_k~0#1, main_~_hj_key~0#1.base, main_~_hj_key~0#1.offset, main_#t~ret71#1.base, main_#t~ret71#1.offset, main_#t~mem72#1.base, main_#t~mem72#1.offset, main_#t~mem73#1.base, main_#t~mem73#1.offset, main_#t~mem74#1.base, main_#t~mem74#1.offset, main_#t~mem75#1.base, main_#t~mem75#1.offset, main_#t~mem76#1.base, main_#t~mem76#1.offset, main_#t~mem77#1.base, main_#t~mem77#1.offset, main_#t~mem78#1.base, main_#t~mem78#1.offset, main_#t~ret79#1.base, main_#t~ret79#1.offset, main_#t~mem80#1.base, main_#t~mem80#1.offset, main_#t~mem81#1.base, main_#t~mem81#1.offset, main_#t~mem82#1.base, main_#t~mem82#1.offset, main_#t~mem83#1.base, main_#t~mem83#1.offset, main_#t~mem84#1.base, main_#t~mem84#1.offset, main_#t~mem85#1.base, main_#t~mem85#1.offset, main_#t~mem86#1.base, main_#t~mem86#1.offset, main_#t~mem87#1.base, main_#t~mem87#1.offset, main_#t~mem88#1.base, main_#t~mem88#1.offset, main_#t~mem89#1.base, main_#t~mem89#1.offset, main_#t~mem90#1, main_#t~mem91#1.base, main_#t~mem91#1.offset, main_#t~mem92#1.base, main_#t~mem92#1.offset, main_#t~mem93#1.base, main_#t~mem93#1.offset, main_#t~mem94#1.base, main_#t~mem94#1.offset, main_#t~mem95#1, main_#t~post96#1, main_#t~mem97#1.base, main_#t~mem97#1.offset, main_#t~mem98#1, main_#t~mem99#1.base, main_#t~mem99#1.offset, main_#t~mem100#1.base, main_#t~mem100#1.offset, main_#t~mem101#1, main_#t~post102#1, main_#t~mem103#1.base, main_#t~mem103#1.offset, main_#t~mem104#1.base, main_#t~mem104#1.offset, main_#t~mem105#1.base, main_#t~mem105#1.offset, main_#t~mem107#1, main_#t~mem106#1, main_#t~mem108#1.base, main_#t~mem108#1.offset, main_#t~mem109#1, main_#t~short110#1, main_#t~mem111#1.base, main_#t~mem111#1.offset, main_#t~mem112#1, main_#t~ret113#1.base, main_#t~ret113#1.offset, main_#t~mem114#1.base, main_#t~mem114#1.offset, main_#t~mem115#1.base, main_#t~mem115#1.offset, main_#t~mem116#1.base, main_#t~mem116#1.offset, main_#t~mem117#1, main_#t~mem118#1.base, main_#t~mem118#1.offset, main_#t~mem119#1.base, main_#t~mem119#1.offset, main_#t~mem122#1, main_#t~mem120#1.base, main_#t~mem120#1.offset, main_#t~mem121#1, main_#t~mem123#1.base, main_#t~mem123#1.offset, main_#t~mem126#1, main_#t~mem124#1.base, main_#t~mem124#1.offset, main_#t~mem125#1, main_#t~ite127#1, main_#t~mem128#1.base, main_#t~mem128#1.offset, main_#t~mem132#1.base, main_#t~mem132#1.offset, main_#t~mem133#1.base, main_#t~mem133#1.offset, main_#t~mem134#1.base, main_#t~mem134#1.offset, main_#t~mem135#1.base, main_#t~mem135#1.offset, main_#t~mem138#1, main_#t~mem136#1.base, main_#t~mem136#1.offset, main_#t~mem137#1, main_#t~mem139#1.base, main_#t~mem139#1.offset, main_#t~mem140#1, main_#t~pre141#1, main_#t~mem142#1.base, main_#t~mem142#1.offset, main_#t~mem143#1, main_#t~mem144#1.base, main_#t~mem144#1.offset, main_#t~mem145#1, main_#t~post146#1, main_#t~mem150#1, main_#t~mem148#1, main_#t~mem147#1.base, main_#t~mem147#1.offset, main_#t~mem149#1, main_#t~mem151#1, main_#t~post152#1, main_#t~mem153#1.base, main_#t~mem153#1.offset, main_#t~mem154#1.base, main_#t~mem154#1.offset, main_#t~mem155#1.base, main_#t~mem155#1.offset, main_#t~post129#1, main_#t~mem130#1.base, main_#t~mem130#1.offset, main_#t~mem131#1, main_#t~mem156#1.base, main_#t~mem156#1.offset, main_#t~mem157#1.base, main_#t~mem157#1.offset, main_#t~mem158#1.base, main_#t~mem158#1.offset, main_#t~mem159#1, main_#t~mem160#1.base, main_#t~mem160#1.offset, main_#t~mem161#1, main_#t~mem162#1.base, main_#t~mem162#1.offset, main_#t~mem163#1, main_#t~post164#1, main_#t~mem165#1.base, main_#t~mem165#1.offset, main_#t~mem166#1.base, main_#t~mem166#1.offset, main_#t~mem167#1.base, main_#t~mem167#1.offset, main_#t~mem168#1.base, main_#t~mem168#1.offset, main_#t~mem171#1, main_#t~mem169#1.base, main_#t~mem169#1.offset, main_#t~mem170#1, main_#t~ite174#1, main_#t~mem172#1.base, main_#t~mem172#1.offset, main_#t~mem173#1, main_#t~mem175#1.base, main_#t~mem175#1.offset, main_#t~mem176#1, main_#t~mem177#1.base, main_#t~mem177#1.offset, main_~_he_bkt~0#1, main_~_he_bkt_i~0#1, main_~_he_thh~0#1.base, main_~_he_thh~0#1.offset, main_~_he_hh_nxt~0#1.base, main_~_he_hh_nxt~0#1.offset, main_~#_he_new_buckets~0#1.base, main_~#_he_new_buckets~0#1.offset, main_~_he_newbkt~0#1.base, main_~_he_newbkt~0#1.offset, main_~_ha_head~0#1.base, main_~_ha_head~0#1.offset, main_~_ha_bkt~0#1, main_~_ha_hashv~0#1, main_#t~mem40#1, main_#t~post41#1, main_#t~mem42#1, main_#t~mem182#1, main_#t~mem181#1, main_#t~mem183#1, main_#t~mem184#1, main_#t~mem186#1, main_#t~mem185#1, main_#t~mem187#1, main_#t~mem188#1, main_#t~mem190#1, main_#t~mem189#1, main_#t~mem191#1, main_#t~mem192#1, main_#t~switch193#1, main_#t~mem194#1, main_#t~mem195#1, main_#t~mem196#1, main_#t~mem197#1, main_#t~mem198#1, main_#t~mem199#1, main_#t~mem200#1, main_#t~mem201#1, main_#t~mem202#1, main_#t~mem203#1, main_#t~mem204#1, main_~_hj_i~1#1, main_~_hj_j~1#1, main_~_hj_k~1#1, main_~_hj_key~1#1.base, main_~_hj_key~1#1.offset, main_#t~mem205#1.base, main_#t~mem205#1.offset, main_#t~mem206#1, main_#t~mem207#1.base, main_#t~mem207#1.offset, main_#t~mem208#1.base, main_#t~mem208#1.offset, main_#t~mem209#1.base, main_#t~mem209#1.offset, main_#t~mem210#1.base, main_#t~mem210#1.offset, main_#t~mem211#1.base, main_#t~mem211#1.offset, main_#t~mem212#1.base, main_#t~mem212#1.offset, main_#t~mem213#1.base, main_#t~mem213#1.offset, main_#t~mem214#1, main_#t~mem215#1, main_#t~mem216#1, main_#t~short217#1, main_#t~mem218#1.base, main_#t~mem218#1.offset, main_#t~ret219#1, main_#t~mem220#1.base, main_#t~mem220#1.offset, main_#t~mem221#1.base, main_#t~mem221#1.offset, main_#t~mem222#1.base, main_#t~mem222#1.offset, main_#t~mem223#1, main_~_hf_bkt~0#1, main_~_hf_hashv~0#1, main_#t~mem224#1.base, main_#t~mem224#1.offset, main_#t~mem225#1.base, main_#t~mem225#1.offset, main_#t~short226#1, main_#t~mem227#1.base, main_#t~mem227#1.offset, main_#t~mem228#1.base, main_#t~mem228#1.offset, main_#t~mem229#1.base, main_#t~mem229#1.offset, main_#t~mem230#1, main_#t~mem231#1.base, main_#t~mem231#1.offset, main_#t~mem232#1.base, main_#t~mem232#1.offset, main_#t~mem233#1.base, main_#t~mem233#1.offset, main_#t~mem234#1.base, main_#t~mem234#1.offset, main_#t~mem235#1.base, main_#t~mem235#1.offset, main_#t~mem236#1.base, main_#t~mem236#1.offset, main_#t~mem237#1, main_#t~mem238#1.base, main_#t~mem238#1.offset, main_#t~mem239#1.base, main_#t~mem239#1.offset, main_#t~mem240#1.base, main_#t~mem240#1.offset, main_#t~mem241#1, main_#t~mem242#1.base, main_#t~mem242#1.offset, main_#t~mem243#1.base, main_#t~mem243#1.offset, main_#t~mem244#1.base, main_#t~mem244#1.offset, main_#t~mem245#1.base, main_#t~mem245#1.offset, main_#t~mem246#1.base, main_#t~mem246#1.offset, main_#t~mem247#1, main_#t~mem248#1.base, main_#t~mem248#1.offset, main_#t~mem251#1, main_#t~mem249#1.base, main_#t~mem249#1.offset, main_#t~mem250#1, main_#t~mem252#1.base, main_#t~mem252#1.offset, main_#t~mem253#1.base, main_#t~mem253#1.offset, main_#t~mem254#1, main_#t~post255#1, main_#t~mem256#1.base, main_#t~mem256#1.offset, main_#t~mem257#1.base, main_#t~mem257#1.offset, main_#t~mem258#1.base, main_#t~mem258#1.offset, main_#t~mem259#1.base, main_#t~mem259#1.offset, main_#t~mem260#1.base, main_#t~mem260#1.offset, main_#t~mem261#1.base, main_#t~mem261#1.offset, main_#t~mem262#1.base, main_#t~mem262#1.offset, main_#t~mem263#1.base, main_#t~mem263#1.offset, main_~_hd_head~0#1.base, main_~_hd_head~0#1.offset, main_#t~mem264#1.base, main_#t~mem264#1.offset, main_#t~mem265#1, main_#t~post266#1, main_~_hd_bkt~0#1, main_~_hd_hh_del~0#1.base, main_~_hd_hh_del~0#1.offset, main_#t~mem178#1, main_#t~post179#1, main_#t~mem180#1, main_#t~mem267#1.base, main_#t~mem267#1.offset, main_~#i~0#1.base, main_~#i~0#1.offset, main_~user~0#1.base, main_~user~0#1.offset, main_~tmp~0#1.base, main_~tmp~0#1.offset, main_~users~0#1.base, main_~users~0#1.offset;call main_~#i~0#1.base, main_~#i~0#1.offset := #Ultimate.allocOnStack(4);havoc main_~user~0#1.base, main_~user~0#1.offset;havoc main_~tmp~0#1.base, main_~tmp~0#1.offset;main_~users~0#1.base, main_~users~0#1.offset := 0, 0;call write~int(0, main_~#i~0#1.base, main_~#i~0#1.offset, 4); {79576#true} is VALID [2022-02-21 03:17:33,487 INFO L290 TraceCheckUtils]: 0: Hoare triple {79576#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(21, 2);~#alt_malloc_sizes~0.base, ~#alt_malloc_sizes~0.offset := 3, 0;call #Ultimate.allocInit(40, 3);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#alt_malloc_sizes~0.base);~alt_malloc_balance~0 := 0;~alt_memcmp_count~0 := 0;~alt_bzero_count~0 := 0; {79576#true} is VALID [2022-02-21 03:17:33,487 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-02-21 03:17:33,488 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 03:17:33,488 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1251779830] [2022-02-21 03:17:33,488 WARN L317 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-02-21 03:17:33,488 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [205034509] [2022-02-21 03:17:33,488 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [205034509] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-21 03:17:33,488 INFO L191 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-02-21 03:17:33,488 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 6] total 14 [2022-02-21 03:17:33,489 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1306481223] [2022-02-21 03:17:33,489 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-02-21 03:17:33,489 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 8.357142857142858) internal successors, (117), 14 states have internal predecessors, (117), 3 states have call successors, (8), 2 states have call predecessors, (8), 6 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) Word has length 103 [2022-02-21 03:17:33,490 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-21 03:17:33,490 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 14 states, 14 states have (on average 8.357142857142858) internal successors, (117), 14 states have internal predecessors, (117), 3 states have call successors, (8), 2 states have call predecessors, (8), 6 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) [2022-02-21 03:17:33,597 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 135 edges. 135 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:17:33,597 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-02-21 03:17:33,597 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 03:17:33,598 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-02-21 03:17:33,598 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=145, Unknown=0, NotChecked=0, Total=182 [2022-02-21 03:17:33,598 INFO L87 Difference]: Start difference. First operand 2029 states and 2587 transitions. Second operand has 14 states, 14 states have (on average 8.357142857142858) internal successors, (117), 14 states have internal predecessors, (117), 3 states have call successors, (8), 2 states have call predecessors, (8), 6 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) [2022-02-21 03:17:37,367 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:17:37,367 INFO L93 Difference]: Finished difference Result 4098 states and 5264 transitions. [2022-02-21 03:17:37,367 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-02-21 03:17:37,367 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 8.357142857142858) internal successors, (117), 14 states have internal predecessors, (117), 3 states have call successors, (8), 2 states have call predecessors, (8), 6 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) Word has length 103 [2022-02-21 03:17:37,368 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-21 03:17:37,368 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 14 states have (on average 8.357142857142858) internal successors, (117), 14 states have internal predecessors, (117), 3 states have call successors, (8), 2 states have call predecessors, (8), 6 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) [2022-02-21 03:17:37,370 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 605 transitions. [2022-02-21 03:17:37,371 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 14 states have (on average 8.357142857142858) internal successors, (117), 14 states have internal predecessors, (117), 3 states have call successors, (8), 2 states have call predecessors, (8), 6 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) [2022-02-21 03:17:37,373 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 605 transitions. [2022-02-21 03:17:37,373 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 18 states and 605 transitions. [2022-02-21 03:17:37,852 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 605 edges. 605 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:17:38,009 INFO L225 Difference]: With dead ends: 4098 [2022-02-21 03:17:38,010 INFO L226 Difference]: Without dead ends: 2120 [2022-02-21 03:17:38,013 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 217 GetRequests, 194 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 49 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=136, Invalid=464, Unknown=0, NotChecked=0, Total=600 [2022-02-21 03:17:38,014 INFO L933 BasicCegarLoop]: 275 mSDtfsCounter, 54 mSDsluCounter, 2427 mSDsCounter, 0 mSdLazyCounter, 220 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 54 SdHoareTripleChecker+Valid, 2702 SdHoareTripleChecker+Invalid, 238 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 220 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-02-21 03:17:38,014 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [54 Valid, 2702 Invalid, 238 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 220 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-02-21 03:17:38,016 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2120 states. [2022-02-21 03:17:38,687 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2120 to 2087. [2022-02-21 03:17:38,687 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 03:17:38,689 INFO L82 GeneralOperation]: Start isEquivalent. First operand 2120 states. Second operand has 2087 states, 1970 states have (on average 1.2857868020304568) internal successors, (2533), 1983 states have internal predecessors, (2533), 63 states have call successors, (63), 49 states have call predecessors, (63), 41 states have return successors, (71), 54 states have call predecessors, (71), 63 states have call successors, (71) [2022-02-21 03:17:38,691 INFO L74 IsIncluded]: Start isIncluded. First operand 2120 states. Second operand has 2087 states, 1970 states have (on average 1.2857868020304568) internal successors, (2533), 1983 states have internal predecessors, (2533), 63 states have call successors, (63), 49 states have call predecessors, (63), 41 states have return successors, (71), 54 states have call predecessors, (71), 63 states have call successors, (71) [2022-02-21 03:17:38,692 INFO L87 Difference]: Start difference. First operand 2120 states. Second operand has 2087 states, 1970 states have (on average 1.2857868020304568) internal successors, (2533), 1983 states have internal predecessors, (2533), 63 states have call successors, (63), 49 states have call predecessors, (63), 41 states have return successors, (71), 54 states have call predecessors, (71), 63 states have call successors, (71)