./Ultimate.py --spec ../sv-benchmarks/c/properties/no-overflow.prp --file ../sv-benchmarks/c/uthash-2.0.2/uthash_BER_test1-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_BER_test1-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 a2f43006c9a8080eee594d7c3e874c7ea5bb3a923f26b30531e1d07ef5cff7d9 --- Real Ultimate output --- This is Ultimate 0.2.2-dev-03d7b7b [2022-02-21 03:13:06,211 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-02-21 03:13:06,213 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-02-21 03:13:06,264 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-02-21 03:13:06,264 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-02-21 03:13:06,267 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-02-21 03:13:06,268 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-02-21 03:13:06,270 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-02-21 03:13:06,271 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-02-21 03:13:06,274 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-02-21 03:13:06,275 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-02-21 03:13:06,276 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-02-21 03:13:06,276 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-02-21 03:13:06,278 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-02-21 03:13:06,279 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-02-21 03:13:06,281 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-02-21 03:13:06,282 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-02-21 03:13:06,282 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-02-21 03:13:06,284 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-02-21 03:13:06,288 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-02-21 03:13:06,289 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-02-21 03:13:06,289 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-02-21 03:13:06,291 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-02-21 03:13:06,291 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-02-21 03:13:06,296 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-02-21 03:13:06,296 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-02-21 03:13:06,296 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-02-21 03:13:06,297 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-02-21 03:13:06,297 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-02-21 03:13:06,298 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-02-21 03:13:06,298 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-02-21 03:13:06,299 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-02-21 03:13:06,300 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-02-21 03:13:06,300 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-02-21 03:13:06,302 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-02-21 03:13:06,302 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-02-21 03:13:06,303 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-02-21 03:13:06,303 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-02-21 03:13:06,303 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-02-21 03:13:06,303 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-02-21 03:13:06,304 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-02-21 03:13:06,305 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:13:06,327 INFO L113 SettingsManager]: Loading preferences was successful [2022-02-21 03:13:06,327 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-02-21 03:13:06,328 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-02-21 03:13:06,328 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-02-21 03:13:06,328 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-02-21 03:13:06,329 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-02-21 03:13:06,329 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-02-21 03:13:06,329 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-02-21 03:13:06,329 INFO L138 SettingsManager]: * Use SBE=true [2022-02-21 03:13:06,329 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-02-21 03:13:06,330 INFO L138 SettingsManager]: * sizeof long=4 [2022-02-21 03:13:06,330 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-02-21 03:13:06,330 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-02-21 03:13:06,330 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-02-21 03:13:06,331 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-02-21 03:13:06,331 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-02-21 03:13:06,331 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-02-21 03:13:06,331 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-02-21 03:13:06,331 INFO L138 SettingsManager]: * Check absence of signed integer overflows=true [2022-02-21 03:13:06,331 INFO L138 SettingsManager]: * sizeof long double=12 [2022-02-21 03:13:06,332 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-02-21 03:13:06,332 INFO L138 SettingsManager]: * Use constant arrays=true [2022-02-21 03:13:06,332 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-02-21 03:13:06,332 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-02-21 03:13:06,332 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-02-21 03:13:06,332 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-02-21 03:13:06,332 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-21 03:13:06,333 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-02-21 03:13:06,333 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-02-21 03:13:06,333 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-02-21 03:13:06,333 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-02-21 03:13:06,333 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-02-21 03:13:06,333 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-02-21 03:13:06,334 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 -> a2f43006c9a8080eee594d7c3e874c7ea5bb3a923f26b30531e1d07ef5cff7d9 [2022-02-21 03:13:06,518 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-02-21 03:13:06,547 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-02-21 03:13:06,548 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-02-21 03:13:06,549 INFO L271 PluginConnector]: Initializing CDTParser... [2022-02-21 03:13:06,550 INFO L275 PluginConnector]: CDTParser initialized [2022-02-21 03:13:06,551 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/uthash-2.0.2/uthash_BER_test1-1.i [2022-02-21 03:13:06,605 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/877d40ea5/d1adc8d2fdcb4ca5a9b8d7a27904d555/FLAG861d95ebc [2022-02-21 03:13:07,011 INFO L306 CDTParser]: Found 1 translation units. [2022-02-21 03:13:07,014 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_BER_test1-1.i [2022-02-21 03:13:07,032 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/877d40ea5/d1adc8d2fdcb4ca5a9b8d7a27904d555/FLAG861d95ebc [2022-02-21 03:13:07,354 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/877d40ea5/d1adc8d2fdcb4ca5a9b8d7a27904d555 [2022-02-21 03:13:07,355 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-02-21 03:13:07,356 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-02-21 03:13:07,357 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-02-21 03:13:07,357 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-02-21 03:13:07,359 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-02-21 03:13:07,360 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.02 03:13:07" (1/1) ... [2022-02-21 03:13:07,361 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@20398ec7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:13:07, skipping insertion in model container [2022-02-21 03:13:07,361 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.02 03:13:07" (1/1) ... [2022-02-21 03:13:07,366 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-02-21 03:13:07,401 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-21 03:13:07,670 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_BER_test1-1.i[33021,33034] [2022-02-21 03:13:07,737 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-21 03:13:07,743 INFO L203 MainTranslator]: Completed pre-run [2022-02-21 03:13:07,771 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_BER_test1-1.i[33021,33034] [2022-02-21 03:13:07,823 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-21 03:13:07,853 INFO L208 MainTranslator]: Completed translation [2022-02-21 03:13:07,853 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:13:07 WrapperNode [2022-02-21 03:13:07,853 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-02-21 03:13:07,854 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-02-21 03:13:07,854 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-02-21 03:13:07,854 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-02-21 03:13:07,860 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:13:07" (1/1) ... [2022-02-21 03:13:07,910 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:13:07" (1/1) ... [2022-02-21 03:13:07,960 INFO L137 Inliner]: procedures = 177, calls = 186, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 627 [2022-02-21 03:13:07,960 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-02-21 03:13:07,961 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-02-21 03:13:07,961 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-02-21 03:13:07,961 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-02-21 03:13:07,967 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:13:07" (1/1) ... [2022-02-21 03:13:07,967 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:13:07" (1/1) ... [2022-02-21 03:13:07,981 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:13:07" (1/1) ... [2022-02-21 03:13:07,981 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:13:07" (1/1) ... [2022-02-21 03:13:08,005 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:13:07" (1/1) ... [2022-02-21 03:13:08,011 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:13:07" (1/1) ... [2022-02-21 03:13:08,014 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:13:07" (1/1) ... [2022-02-21 03:13:08,018 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-02-21 03:13:08,019 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-02-21 03:13:08,019 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-02-21 03:13:08,019 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-02-21 03:13:08,032 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:13:07" (1/1) ... [2022-02-21 03:13:08,037 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-21 03:13:08,045 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:13:08,056 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:13:08,067 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:13:08,093 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-02-21 03:13:08,094 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-02-21 03:13:08,094 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-02-21 03:13:08,094 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-02-21 03:13:08,094 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset [2022-02-21 03:13:08,094 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset [2022-02-21 03:13:08,094 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-02-21 03:13:08,095 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-02-21 03:13:08,096 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-02-21 03:13:08,096 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-02-21 03:13:08,096 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-02-21 03:13:08,096 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-02-21 03:13:08,096 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-02-21 03:13:08,097 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-02-21 03:13:08,097 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-02-21 03:13:08,244 INFO L234 CfgBuilder]: Building ICFG [2022-02-21 03:13:08,246 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-02-21 03:13:09,462 INFO L275 CfgBuilder]: Performing block encoding [2022-02-21 03:13:09,471 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-02-21 03:13:09,471 INFO L299 CfgBuilder]: Removed 31 assume(true) statements. [2022-02-21 03:13:09,473 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.02 03:13:09 BoogieIcfgContainer [2022-02-21 03:13:09,473 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-02-21 03:13:09,474 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-02-21 03:13:09,474 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-02-21 03:13:09,477 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-02-21 03:13:09,477 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 21.02 03:13:07" (1/3) ... [2022-02-21 03:13:09,478 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@57cffb5a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.02 03:13:09, skipping insertion in model container [2022-02-21 03:13:09,478 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:13:07" (2/3) ... [2022-02-21 03:13:09,478 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@57cffb5a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.02 03:13:09, skipping insertion in model container [2022-02-21 03:13:09,478 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.02 03:13:09" (3/3) ... [2022-02-21 03:13:09,479 INFO L111 eAbstractionObserver]: Analyzing ICFG uthash_BER_test1-1.i [2022-02-21 03:13:09,483 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-02-21 03:13:09,483 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 6 error locations. [2022-02-21 03:13:09,529 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-02-21 03:13:09,533 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:13:09,533 INFO L340 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2022-02-21 03:13:09,548 INFO L276 IsEmpty]: Start isEmpty. Operand has 138 states, 116 states have (on average 1.6810344827586208) internal successors, (195), 132 states have internal predecessors, (195), 13 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (13), 4 states have call predecessors, (13), 13 states have call successors, (13) [2022-02-21 03:13:09,550 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2022-02-21 03:13:09,550 INFO L506 BasicCegarLoop]: Found error trace [2022-02-21 03:13:09,550 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2022-02-21 03:13:09,551 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2022-02-21 03:13:09,553 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:13:09,554 INFO L85 PathProgramCache]: Analyzing trace with hash 1126635289, now seen corresponding path program 1 times [2022-02-21 03:13:09,559 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:13:09,560 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1917548419] [2022-02-21 03:13:09,560 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:13:09,560 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:13:09,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:13:09,672 INFO L290 TraceCheckUtils]: 0: Hoare triple {141#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);~count_int_int~0 := 0; {141#true} is VALID [2022-02-21 03:13:09,672 INFO L290 TraceCheckUtils]: 1: Hoare triple {141#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc6#1.base, main_#t~malloc6#1.offset, main_#t~mem8#1, main_#t~mem7#1, main_#t~mem9#1, main_#t~mem10#1, main_#t~mem12#1, main_#t~mem11#1, main_#t~mem13#1, main_#t~mem14#1, main_#t~mem16#1, main_#t~mem15#1, main_#t~mem17#1, main_#t~mem18#1, main_#t~switch19#1, main_#t~mem20#1, main_#t~mem21#1, main_#t~mem22#1, main_#t~mem23#1, main_#t~mem24#1, main_#t~mem25#1, main_#t~mem26#1, main_#t~mem27#1, main_#t~mem28#1, main_#t~mem29#1, main_#t~mem30#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~malloc31#1.base, main_#t~malloc31#1.offset, main_#t~mem32#1.base, main_#t~mem32#1.offset, main_#t~mem33#1.base, main_#t~mem33#1.offset, main_#t~memset~res34#1.base, main_#t~memset~res34#1.offset, main_#t~mem35#1.base, main_#t~mem35#1.offset, main_#t~mem36#1.base, main_#t~mem36#1.offset, main_#t~mem37#1.base, main_#t~mem37#1.offset, main_#t~mem38#1.base, main_#t~mem38#1.offset, main_#t~mem39#1.base, main_#t~mem39#1.offset, main_#t~malloc40#1.base, main_#t~malloc40#1.offset, main_#t~mem41#1.base, main_#t~mem41#1.offset, main_#t~mem42#1.base, main_#t~mem42#1.offset, main_#t~mem43#1.base, main_#t~mem43#1.offset, main_#t~mem44#1.base, main_#t~mem44#1.offset, main_#t~mem45#1.base, main_#t~mem45#1.offset, main_#t~mem46#1.base, main_#t~mem46#1.offset, main_#t~memset~res47#1.base, main_#t~memset~res47#1.offset, main_#t~mem48#1.base, main_#t~mem48#1.offset, main_#t~mem49#1.base, main_#t~mem49#1.offset, main_#t~mem50#1.base, main_#t~mem50#1.offset, main_#t~mem51#1.base, main_#t~mem51#1.offset, main_#t~mem52#1, main_#t~mem53#1.base, main_#t~mem53#1.offset, main_#t~mem54#1.base, main_#t~mem54#1.offset, main_#t~mem55#1.base, main_#t~mem55#1.offset, main_#t~mem56#1.base, main_#t~mem56#1.offset, main_#t~mem57#1, main_#t~post58#1, main_#t~mem59#1.base, main_#t~mem59#1.offset, main_#t~mem60#1, main_#t~mem61#1.base, main_#t~mem61#1.offset, main_#t~mem62#1.base, main_#t~mem62#1.offset, main_#t~mem63#1, main_#t~post64#1, main_#t~mem65#1.base, main_#t~mem65#1.offset, main_#t~mem66#1.base, main_#t~mem66#1.offset, main_#t~mem67#1.base, main_#t~mem67#1.offset, main_#t~mem69#1, main_#t~mem68#1, main_#t~mem70#1.base, main_#t~mem70#1.offset, main_#t~mem71#1, main_#t~short72#1, main_#t~mem73#1.base, main_#t~mem73#1.offset, main_#t~mem74#1, main_#t~malloc75#1.base, main_#t~malloc75#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~mem79#1, main_#t~memset~res80#1.base, main_#t~memset~res80#1.offset, main_#t~mem81#1.base, main_#t~mem81#1.offset, main_#t~mem82#1.base, main_#t~mem82#1.offset, main_#t~mem85#1, main_#t~mem83#1.base, main_#t~mem83#1.offset, main_#t~mem84#1, main_#t~mem86#1.base, main_#t~mem86#1.offset, main_#t~mem89#1, main_#t~mem87#1.base, main_#t~mem87#1.offset, main_#t~mem88#1, main_#t~ite90#1, main_#t~mem91#1.base, main_#t~mem91#1.offset, main_#t~mem95#1.base, main_#t~mem95#1.offset, main_#t~mem96#1.base, main_#t~mem96#1.offset, main_#t~mem97#1.base, main_#t~mem97#1.offset, main_#t~mem98#1.base, main_#t~mem98#1.offset, main_#t~mem101#1, main_#t~mem99#1.base, main_#t~mem99#1.offset, main_#t~mem100#1, main_#t~mem102#1.base, main_#t~mem102#1.offset, main_#t~mem103#1, main_#t~pre104#1, main_#t~mem105#1.base, main_#t~mem105#1.offset, main_#t~mem106#1, main_#t~mem107#1.base, main_#t~mem107#1.offset, main_#t~mem108#1, main_#t~post109#1, main_#t~mem113#1, main_#t~mem111#1, main_#t~mem110#1.base, main_#t~mem110#1.offset, main_#t~mem112#1, main_#t~mem114#1, main_#t~post115#1, main_#t~mem116#1.base, main_#t~mem116#1.offset, main_#t~mem117#1.base, main_#t~mem117#1.offset, main_#t~mem118#1.base, main_#t~mem118#1.offset, main_#t~post92#1, main_#t~mem93#1.base, main_#t~mem93#1.offset, main_#t~mem94#1, main_#t~mem119#1.base, main_#t~mem119#1.offset, main_#t~mem120#1.base, main_#t~mem120#1.offset, main_#t~mem121#1.base, main_#t~mem121#1.offset, main_#t~mem122#1, main_#t~mem123#1.base, main_#t~mem123#1.offset, main_#t~mem124#1, main_#t~post125#1, main_#t~mem126#1.base, main_#t~mem126#1.offset, main_#t~mem127#1.base, main_#t~mem127#1.offset, main_#t~mem128#1.base, main_#t~mem128#1.offset, main_#t~mem129#1.base, main_#t~mem129#1.offset, main_#t~mem132#1, main_#t~mem130#1.base, main_#t~mem130#1.offset, main_#t~mem131#1, main_#t~ite135#1, main_#t~mem133#1.base, main_#t~mem133#1.offset, main_#t~mem134#1, main_#t~mem136#1.base, main_#t~mem136#1.offset, main_#t~mem137#1, main_#t~mem138#1.base, main_#t~mem138#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~post5#1, main_#t~mem140#1, main_#t~mem141#1, main_#t~mem139#1.base, main_#t~mem139#1.offset, main_~i~0#1, main_~user~0#1.base, main_~user~0#1.offset, main_~users~0#1.base, main_~users~0#1.offset;havoc main_~i~0#1;havoc main_~user~0#1.base, main_~user~0#1.offset;main_~users~0#1.base, main_~users~0#1.offset := 0, 0;main_~i~0#1 := 0; {143#(= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-21 03:13:09,673 INFO L290 TraceCheckUtils]: 2: Hoare triple {143#(= |ULTIMATE.start_main_~i~0#1| 0)} assume !(main_~i~0#1 < 10); {142#false} is VALID [2022-02-21 03:13:09,673 INFO L290 TraceCheckUtils]: 3: Hoare triple {142#false} main_~user~0#1.base, main_~user~0#1.offset := main_~users~0#1.base, main_~users~0#1.offset; {142#false} is VALID [2022-02-21 03:13:09,674 INFO L290 TraceCheckUtils]: 4: Hoare triple {142#false} assume !!(main_~user~0#1.base != 0 || main_~user~0#1.offset != 0);call main_#t~mem140#1 := read~int(main_~user~0#1.base, main_~user~0#1.offset, 4);call main_#t~mem141#1 := read~int(main_~user~0#1.base, 4 + main_~user~0#1.offset, 4);assume { :begin_inline_test_int_int } true;test_int_int_#in~a#1, test_int_int_#in~b#1 := main_#t~mem140#1, main_#t~mem141#1;havoc test_int_int_#t~post3#1, test_int_int_#t~switch4#1, test_int_int_~a#1, test_int_int_~b#1;test_int_int_~a#1 := test_int_int_#in~a#1;test_int_int_~b#1 := test_int_int_#in~b#1;test_int_int_#t~post3#1 := ~count_int_int~0; {142#false} is VALID [2022-02-21 03:13:09,674 INFO L290 TraceCheckUtils]: 5: Hoare triple {142#false} assume !(1 + test_int_int_#t~post3#1 <= 2147483647); {142#false} is VALID [2022-02-21 03:13:09,675 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:13:09,675 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 03:13:09,675 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1917548419] [2022-02-21 03:13:09,676 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1917548419] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-21 03:13:09,676 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-21 03:13:09,676 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-21 03:13:09,677 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1045462288] [2022-02-21 03:13:09,678 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-21 03:13:09,681 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 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 6 [2022-02-21 03:13:09,682 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-21 03:13:09,684 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 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:13:09,693 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 6 edges. 6 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:13:09,694 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-21 03:13:09,694 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 03:13:09,714 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-21 03:13:09,715 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-21 03:13:09,721 INFO L87 Difference]: Start difference. First operand has 138 states, 116 states have (on average 1.6810344827586208) internal successors, (195), 132 states have internal predecessors, (195), 13 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (13), 4 states have call predecessors, (13), 13 states have call successors, (13) Second operand has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 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:13:10,256 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:13:10,256 INFO L93 Difference]: Finished difference Result 366 states and 607 transitions. [2022-02-21 03:13:10,257 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-21 03:13:10,257 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 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 6 [2022-02-21 03:13:10,257 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-21 03:13:10,258 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 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:13:10,285 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 607 transitions. [2022-02-21 03:13:10,285 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 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:13:10,293 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 607 transitions. [2022-02-21 03:13:10,294 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 607 transitions. [2022-02-21 03:13:10,780 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 607 edges. 607 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:13:10,792 INFO L225 Difference]: With dead ends: 366 [2022-02-21 03:13:10,793 INFO L226 Difference]: Without dead ends: 226 [2022-02-21 03:13:10,795 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 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:13:10,797 INFO L933 BasicCegarLoop]: 211 mSDtfsCounter, 113 mSDsluCounter, 175 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 116 SdHoareTripleChecker+Valid, 386 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-21 03:13:10,797 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [116 Valid, 386 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-21 03:13:10,817 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 226 states. [2022-02-21 03:13:10,849 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 226 to 137. [2022-02-21 03:13:10,850 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 03:13:10,851 INFO L82 GeneralOperation]: Start isEquivalent. First operand 226 states. Second operand has 137 states, 117 states have (on average 1.3504273504273505) internal successors, (158), 131 states have internal predecessors, (158), 13 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (13), 4 states have call predecessors, (13), 13 states have call successors, (13) [2022-02-21 03:13:10,852 INFO L74 IsIncluded]: Start isIncluded. First operand 226 states. Second operand has 137 states, 117 states have (on average 1.3504273504273505) internal successors, (158), 131 states have internal predecessors, (158), 13 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (13), 4 states have call predecessors, (13), 13 states have call successors, (13) [2022-02-21 03:13:10,852 INFO L87 Difference]: Start difference. First operand 226 states. Second operand has 137 states, 117 states have (on average 1.3504273504273505) internal successors, (158), 131 states have internal predecessors, (158), 13 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (13), 4 states have call predecessors, (13), 13 states have call successors, (13) [2022-02-21 03:13:10,862 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:13:10,862 INFO L93 Difference]: Finished difference Result 226 states and 300 transitions. [2022-02-21 03:13:10,862 INFO L276 IsEmpty]: Start isEmpty. Operand 226 states and 300 transitions. [2022-02-21 03:13:10,867 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:13:10,868 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:13:10,869 INFO L74 IsIncluded]: Start isIncluded. First operand has 137 states, 117 states have (on average 1.3504273504273505) internal successors, (158), 131 states have internal predecessors, (158), 13 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (13), 4 states have call predecessors, (13), 13 states have call successors, (13) Second operand 226 states. [2022-02-21 03:13:10,870 INFO L87 Difference]: Start difference. First operand has 137 states, 117 states have (on average 1.3504273504273505) internal successors, (158), 131 states have internal predecessors, (158), 13 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (13), 4 states have call predecessors, (13), 13 states have call successors, (13) Second operand 226 states. [2022-02-21 03:13:10,880 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:13:10,881 INFO L93 Difference]: Finished difference Result 226 states and 300 transitions. [2022-02-21 03:13:10,881 INFO L276 IsEmpty]: Start isEmpty. Operand 226 states and 300 transitions. [2022-02-21 03:13:10,887 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:13:10,888 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:13:10,888 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 03:13:10,888 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 03:13:10,889 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 137 states, 117 states have (on average 1.3504273504273505) internal successors, (158), 131 states have internal predecessors, (158), 13 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (13), 4 states have call predecessors, (13), 13 states have call successors, (13) [2022-02-21 03:13:10,897 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 184 transitions. [2022-02-21 03:13:10,899 INFO L78 Accepts]: Start accepts. Automaton has 137 states and 184 transitions. Word has length 6 [2022-02-21 03:13:10,900 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-21 03:13:10,900 INFO L470 AbstractCegarLoop]: Abstraction has 137 states and 184 transitions. [2022-02-21 03:13:10,900 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 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:13:10,902 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 184 transitions. [2022-02-21 03:13:10,903 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2022-02-21 03:13:10,904 INFO L506 BasicCegarLoop]: Found error trace [2022-02-21 03:13:10,905 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:13:10,906 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-02-21 03:13:10,907 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2022-02-21 03:13:10,908 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:13:10,908 INFO L85 PathProgramCache]: Analyzing trace with hash -1116651610, now seen corresponding path program 1 times [2022-02-21 03:13:10,908 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:13:10,909 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2090540247] [2022-02-21 03:13:10,909 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:13:10,909 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:13:11,019 ERROR L252 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-02-21 03:13:11,020 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1166468903] [2022-02-21 03:13:11,020 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:13:11,020 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-21 03:13:11,020 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:13:11,022 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:13:11,027 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:13:11,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:13:11,442 INFO L263 TraceCheckSpWp]: Trace formula consists of 1517 conjuncts, 3 conjunts are in the unsatisfiable core [2022-02-21 03:13:11,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:13:11,481 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 03:13:11,581 INFO L290 TraceCheckUtils]: 0: Hoare triple {1217#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);~count_int_int~0 := 0; {1217#true} is VALID [2022-02-21 03:13:11,582 INFO L290 TraceCheckUtils]: 1: Hoare triple {1217#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc6#1.base, main_#t~malloc6#1.offset, main_#t~mem8#1, main_#t~mem7#1, main_#t~mem9#1, main_#t~mem10#1, main_#t~mem12#1, main_#t~mem11#1, main_#t~mem13#1, main_#t~mem14#1, main_#t~mem16#1, main_#t~mem15#1, main_#t~mem17#1, main_#t~mem18#1, main_#t~switch19#1, main_#t~mem20#1, main_#t~mem21#1, main_#t~mem22#1, main_#t~mem23#1, main_#t~mem24#1, main_#t~mem25#1, main_#t~mem26#1, main_#t~mem27#1, main_#t~mem28#1, main_#t~mem29#1, main_#t~mem30#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~malloc31#1.base, main_#t~malloc31#1.offset, main_#t~mem32#1.base, main_#t~mem32#1.offset, main_#t~mem33#1.base, main_#t~mem33#1.offset, main_#t~memset~res34#1.base, main_#t~memset~res34#1.offset, main_#t~mem35#1.base, main_#t~mem35#1.offset, main_#t~mem36#1.base, main_#t~mem36#1.offset, main_#t~mem37#1.base, main_#t~mem37#1.offset, main_#t~mem38#1.base, main_#t~mem38#1.offset, main_#t~mem39#1.base, main_#t~mem39#1.offset, main_#t~malloc40#1.base, main_#t~malloc40#1.offset, main_#t~mem41#1.base, main_#t~mem41#1.offset, main_#t~mem42#1.base, main_#t~mem42#1.offset, main_#t~mem43#1.base, main_#t~mem43#1.offset, main_#t~mem44#1.base, main_#t~mem44#1.offset, main_#t~mem45#1.base, main_#t~mem45#1.offset, main_#t~mem46#1.base, main_#t~mem46#1.offset, main_#t~memset~res47#1.base, main_#t~memset~res47#1.offset, main_#t~mem48#1.base, main_#t~mem48#1.offset, main_#t~mem49#1.base, main_#t~mem49#1.offset, main_#t~mem50#1.base, main_#t~mem50#1.offset, main_#t~mem51#1.base, main_#t~mem51#1.offset, main_#t~mem52#1, main_#t~mem53#1.base, main_#t~mem53#1.offset, main_#t~mem54#1.base, main_#t~mem54#1.offset, main_#t~mem55#1.base, main_#t~mem55#1.offset, main_#t~mem56#1.base, main_#t~mem56#1.offset, main_#t~mem57#1, main_#t~post58#1, main_#t~mem59#1.base, main_#t~mem59#1.offset, main_#t~mem60#1, main_#t~mem61#1.base, main_#t~mem61#1.offset, main_#t~mem62#1.base, main_#t~mem62#1.offset, main_#t~mem63#1, main_#t~post64#1, main_#t~mem65#1.base, main_#t~mem65#1.offset, main_#t~mem66#1.base, main_#t~mem66#1.offset, main_#t~mem67#1.base, main_#t~mem67#1.offset, main_#t~mem69#1, main_#t~mem68#1, main_#t~mem70#1.base, main_#t~mem70#1.offset, main_#t~mem71#1, main_#t~short72#1, main_#t~mem73#1.base, main_#t~mem73#1.offset, main_#t~mem74#1, main_#t~malloc75#1.base, main_#t~malloc75#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~mem79#1, main_#t~memset~res80#1.base, main_#t~memset~res80#1.offset, main_#t~mem81#1.base, main_#t~mem81#1.offset, main_#t~mem82#1.base, main_#t~mem82#1.offset, main_#t~mem85#1, main_#t~mem83#1.base, main_#t~mem83#1.offset, main_#t~mem84#1, main_#t~mem86#1.base, main_#t~mem86#1.offset, main_#t~mem89#1, main_#t~mem87#1.base, main_#t~mem87#1.offset, main_#t~mem88#1, main_#t~ite90#1, main_#t~mem91#1.base, main_#t~mem91#1.offset, main_#t~mem95#1.base, main_#t~mem95#1.offset, main_#t~mem96#1.base, main_#t~mem96#1.offset, main_#t~mem97#1.base, main_#t~mem97#1.offset, main_#t~mem98#1.base, main_#t~mem98#1.offset, main_#t~mem101#1, main_#t~mem99#1.base, main_#t~mem99#1.offset, main_#t~mem100#1, main_#t~mem102#1.base, main_#t~mem102#1.offset, main_#t~mem103#1, main_#t~pre104#1, main_#t~mem105#1.base, main_#t~mem105#1.offset, main_#t~mem106#1, main_#t~mem107#1.base, main_#t~mem107#1.offset, main_#t~mem108#1, main_#t~post109#1, main_#t~mem113#1, main_#t~mem111#1, main_#t~mem110#1.base, main_#t~mem110#1.offset, main_#t~mem112#1, main_#t~mem114#1, main_#t~post115#1, main_#t~mem116#1.base, main_#t~mem116#1.offset, main_#t~mem117#1.base, main_#t~mem117#1.offset, main_#t~mem118#1.base, main_#t~mem118#1.offset, main_#t~post92#1, main_#t~mem93#1.base, main_#t~mem93#1.offset, main_#t~mem94#1, main_#t~mem119#1.base, main_#t~mem119#1.offset, main_#t~mem120#1.base, main_#t~mem120#1.offset, main_#t~mem121#1.base, main_#t~mem121#1.offset, main_#t~mem122#1, main_#t~mem123#1.base, main_#t~mem123#1.offset, main_#t~mem124#1, main_#t~post125#1, main_#t~mem126#1.base, main_#t~mem126#1.offset, main_#t~mem127#1.base, main_#t~mem127#1.offset, main_#t~mem128#1.base, main_#t~mem128#1.offset, main_#t~mem129#1.base, main_#t~mem129#1.offset, main_#t~mem132#1, main_#t~mem130#1.base, main_#t~mem130#1.offset, main_#t~mem131#1, main_#t~ite135#1, main_#t~mem133#1.base, main_#t~mem133#1.offset, main_#t~mem134#1, main_#t~mem136#1.base, main_#t~mem136#1.offset, main_#t~mem137#1, main_#t~mem138#1.base, main_#t~mem138#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~post5#1, main_#t~mem140#1, main_#t~mem141#1, main_#t~mem139#1.base, main_#t~mem139#1.offset, main_~i~0#1, main_~user~0#1.base, main_~user~0#1.offset, main_~users~0#1.base, main_~users~0#1.offset;havoc main_~i~0#1;havoc main_~user~0#1.base, main_~user~0#1.offset;main_~users~0#1.base, main_~users~0#1.offset := 0, 0;main_~i~0#1 := 0; {1217#true} is VALID [2022-02-21 03:13:11,582 INFO L290 TraceCheckUtils]: 2: Hoare triple {1217#true} assume !!(main_~i~0#1 < 10);call main_#t~malloc6#1.base, main_#t~malloc6#1.offset := #Ultimate.allocOnHeap(40);main_~user~0#1.base, main_~user~0#1.offset := main_#t~malloc6#1.base, main_#t~malloc6#1.offset;havoc main_#t~malloc6#1.base, main_#t~malloc6#1.offset; {1217#true} is VALID [2022-02-21 03:13:11,582 INFO L290 TraceCheckUtils]: 3: Hoare triple {1217#true} assume !(main_~user~0#1.base == 0 && main_~user~0#1.offset == 0); {1217#true} is VALID [2022-02-21 03:13:11,583 INFO L290 TraceCheckUtils]: 4: Hoare triple {1217#true} call write~int(main_~i~0#1, main_~user~0#1.base, main_~user~0#1.offset, 4); {1217#true} is VALID [2022-02-21 03:13:11,583 INFO L290 TraceCheckUtils]: 5: Hoare triple {1217#true} assume main_~i~0#1 * main_~i~0#1 <= 2147483647; {1217#true} is VALID [2022-02-21 03:13:11,583 INFO L290 TraceCheckUtils]: 6: Hoare triple {1217#true} assume main_~i~0#1 * main_~i~0#1 >= -2147483648;call write~int(main_~i~0#1 * main_~i~0#1, main_~user~0#1.base, 4 + main_~user~0#1.offset, 4); {1217#true} is VALID [2022-02-21 03:13:11,583 INFO L290 TraceCheckUtils]: 7: Hoare triple {1217#true} havoc main_~_ha_hashv~0#1; {1217#true} is VALID [2022-02-21 03:13:11,583 INFO L290 TraceCheckUtils]: 8: Hoare triple {1217#true} goto; {1217#true} is VALID [2022-02-21 03:13:11,584 INFO L290 TraceCheckUtils]: 9: Hoare triple {1217#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; {1217#true} is VALID [2022-02-21 03:13:11,584 INFO L290 TraceCheckUtils]: 10: Hoare triple {1217#true} assume !(main_~_hj_k~0#1 % 4294967296 >= 12); {1217#true} is VALID [2022-02-21 03:13:11,584 INFO L290 TraceCheckUtils]: 11: Hoare triple {1217#true} main_~_ha_hashv~0#1 := 4 + main_~_ha_hashv~0#1;main_#t~switch19#1 := 11 == main_~_hj_k~0#1; {1217#true} is VALID [2022-02-21 03:13:11,584 INFO L290 TraceCheckUtils]: 12: Hoare triple {1217#true} assume main_#t~switch19#1;call main_#t~mem20#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~mem20#1 % 256);havoc main_#t~mem20#1; {1217#true} is VALID [2022-02-21 03:13:11,584 INFO L290 TraceCheckUtils]: 13: Hoare triple {1217#true} main_#t~switch19#1 := main_#t~switch19#1 || 10 == main_~_hj_k~0#1; {1217#true} is VALID [2022-02-21 03:13:11,585 INFO L290 TraceCheckUtils]: 14: Hoare triple {1217#true} assume main_#t~switch19#1;call main_#t~mem21#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~mem21#1 % 256);havoc main_#t~mem21#1; {1217#true} is VALID [2022-02-21 03:13:11,585 INFO L290 TraceCheckUtils]: 15: Hoare triple {1217#true} main_#t~switch19#1 := main_#t~switch19#1 || 9 == main_~_hj_k~0#1; {1217#true} is VALID [2022-02-21 03:13:11,585 INFO L290 TraceCheckUtils]: 16: Hoare triple {1217#true} assume main_#t~switch19#1;call main_#t~mem22#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~mem22#1 % 256);havoc main_#t~mem22#1; {1217#true} is VALID [2022-02-21 03:13:11,585 INFO L290 TraceCheckUtils]: 17: Hoare triple {1217#true} main_#t~switch19#1 := main_#t~switch19#1 || 8 == main_~_hj_k~0#1; {1217#true} is VALID [2022-02-21 03:13:11,585 INFO L290 TraceCheckUtils]: 18: Hoare triple {1217#true} assume main_#t~switch19#1;call main_#t~mem23#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~mem23#1 % 256);havoc main_#t~mem23#1; {1217#true} is VALID [2022-02-21 03:13:11,586 INFO L290 TraceCheckUtils]: 19: Hoare triple {1217#true} main_#t~switch19#1 := main_#t~switch19#1 || 7 == main_~_hj_k~0#1; {1217#true} is VALID [2022-02-21 03:13:11,586 INFO L290 TraceCheckUtils]: 20: Hoare triple {1217#true} assume main_#t~switch19#1;call main_#t~mem24#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~mem24#1 % 256);havoc main_#t~mem24#1; {1217#true} is VALID [2022-02-21 03:13:11,586 INFO L290 TraceCheckUtils]: 21: Hoare triple {1217#true} main_#t~switch19#1 := main_#t~switch19#1 || 6 == main_~_hj_k~0#1; {1217#true} is VALID [2022-02-21 03:13:11,587 INFO L290 TraceCheckUtils]: 22: Hoare triple {1217#true} assume main_#t~switch19#1;call main_#t~mem25#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~mem25#1 % 256);havoc main_#t~mem25#1; {1288#|ULTIMATE.start_main_#t~switch19#1|} is VALID [2022-02-21 03:13:11,587 INFO L290 TraceCheckUtils]: 23: Hoare triple {1288#|ULTIMATE.start_main_#t~switch19#1|} main_#t~switch19#1 := main_#t~switch19#1 || 5 == main_~_hj_k~0#1; {1288#|ULTIMATE.start_main_#t~switch19#1|} is VALID [2022-02-21 03:13:11,587 INFO L290 TraceCheckUtils]: 24: Hoare triple {1288#|ULTIMATE.start_main_#t~switch19#1|} assume !main_#t~switch19#1; {1218#false} is VALID [2022-02-21 03:13:11,588 INFO L290 TraceCheckUtils]: 25: Hoare triple {1218#false} main_#t~switch19#1 := main_#t~switch19#1 || 4 == main_~_hj_k~0#1; {1218#false} is VALID [2022-02-21 03:13:11,588 INFO L290 TraceCheckUtils]: 26: Hoare triple {1218#false} assume main_#t~switch19#1;call main_#t~mem27#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~mem27#1 % 256);havoc main_#t~mem27#1; {1218#false} is VALID [2022-02-21 03:13:11,588 INFO L290 TraceCheckUtils]: 27: Hoare triple {1218#false} main_#t~switch19#1 := main_#t~switch19#1 || 3 == main_~_hj_k~0#1; {1218#false} is VALID [2022-02-21 03:13:11,588 INFO L290 TraceCheckUtils]: 28: Hoare triple {1218#false} assume main_#t~switch19#1;call main_#t~mem28#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~mem28#1 % 256);havoc main_#t~mem28#1; {1218#false} is VALID [2022-02-21 03:13:11,588 INFO L290 TraceCheckUtils]: 29: Hoare triple {1218#false} main_#t~switch19#1 := main_#t~switch19#1 || 2 == main_~_hj_k~0#1; {1218#false} is VALID [2022-02-21 03:13:11,589 INFO L290 TraceCheckUtils]: 30: Hoare triple {1218#false} assume main_#t~switch19#1;call main_#t~mem29#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~mem29#1 % 256);havoc main_#t~mem29#1; {1218#false} is VALID [2022-02-21 03:13:11,589 INFO L290 TraceCheckUtils]: 31: Hoare triple {1218#false} main_#t~switch19#1 := main_#t~switch19#1 || 1 == main_~_hj_k~0#1; {1218#false} is VALID [2022-02-21 03:13:11,589 INFO L290 TraceCheckUtils]: 32: Hoare triple {1218#false} assume main_#t~switch19#1;call main_#t~mem30#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~mem30#1 % 256;havoc main_#t~mem30#1; {1218#false} is VALID [2022-02-21 03:13:11,589 INFO L290 TraceCheckUtils]: 33: Hoare triple {1218#false} havoc main_#t~switch19#1; {1218#false} is VALID [2022-02-21 03:13:11,590 INFO L290 TraceCheckUtils]: 34: Hoare triple {1218#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)))); {1218#false} is VALID [2022-02-21 03:13:11,590 INFO L290 TraceCheckUtils]: 35: Hoare triple {1218#false} goto; {1218#false} is VALID [2022-02-21 03:13:11,590 INFO L290 TraceCheckUtils]: 36: Hoare triple {1218#false} goto; {1218#false} is VALID [2022-02-21 03:13:11,590 INFO L290 TraceCheckUtils]: 37: Hoare triple {1218#false} goto; {1218#false} is VALID [2022-02-21 03:13:11,590 INFO L290 TraceCheckUtils]: 38: Hoare triple {1218#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); {1218#false} is VALID [2022-02-21 03:13:11,591 INFO L290 TraceCheckUtils]: 39: Hoare triple {1218#false} assume !(main_~users~0#1.base == 0 && main_~users~0#1.offset == 0);call main_#t~mem48#1.base, main_#t~mem48#1.offset := read~$Pointer$(main_~users~0#1.base, 8 + main_~users~0#1.offset, 4);call write~$Pointer$(main_#t~mem48#1.base, main_#t~mem48#1.offset, main_~user~0#1.base, 8 + main_~user~0#1.offset, 4);havoc main_#t~mem48#1.base, main_#t~mem48#1.offset; {1218#false} is VALID [2022-02-21 03:13:11,591 INFO L290 TraceCheckUtils]: 40: Hoare triple {1218#false} call write~$Pointer$(0, 0, main_~user~0#1.base, 16 + main_~user~0#1.offset, 4);call main_#t~mem49#1.base, main_#t~mem49#1.offset := read~$Pointer$(main_~users~0#1.base, 8 + main_~users~0#1.offset, 4);call main_#t~mem50#1.base, main_#t~mem50#1.offset := read~$Pointer$(main_#t~mem49#1.base, 16 + main_#t~mem49#1.offset, 4);call main_#t~mem51#1.base, main_#t~mem51#1.offset := read~$Pointer$(main_~users~0#1.base, 8 + main_~users~0#1.offset, 4);call main_#t~mem52#1 := read~int(main_#t~mem51#1.base, 20 + main_#t~mem51#1.offset, 4);call write~$Pointer$(main_#t~mem50#1.base, main_#t~mem50#1.offset - main_#t~mem52#1, main_~user~0#1.base, 12 + main_~user~0#1.offset, 4);havoc main_#t~mem49#1.base, main_#t~mem49#1.offset;havoc main_#t~mem50#1.base, main_#t~mem50#1.offset;havoc main_#t~mem51#1.base, main_#t~mem51#1.offset;havoc main_#t~mem52#1;call main_#t~mem53#1.base, main_#t~mem53#1.offset := read~$Pointer$(main_~users~0#1.base, 8 + main_~users~0#1.offset, 4);call main_#t~mem54#1.base, main_#t~mem54#1.offset := read~$Pointer$(main_#t~mem53#1.base, 16 + main_#t~mem53#1.offset, 4);call write~$Pointer$(main_~user~0#1.base, main_~user~0#1.offset, main_#t~mem54#1.base, 8 + main_#t~mem54#1.offset, 4);havoc main_#t~mem53#1.base, main_#t~mem53#1.offset;havoc main_#t~mem54#1.base, main_#t~mem54#1.offset;call main_#t~mem55#1.base, main_#t~mem55#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~mem55#1.base, 16 + main_#t~mem55#1.offset, 4);havoc main_#t~mem55#1.base, main_#t~mem55#1.offset; {1218#false} is VALID [2022-02-21 03:13:11,591 INFO L290 TraceCheckUtils]: 41: Hoare triple {1218#false} goto; {1218#false} is VALID [2022-02-21 03:13:11,591 INFO L290 TraceCheckUtils]: 42: Hoare triple {1218#false} havoc main_~_ha_bkt~0#1;call main_#t~mem56#1.base, main_#t~mem56#1.offset := read~$Pointer$(main_~users~0#1.base, 8 + main_~users~0#1.offset, 4);call main_#t~mem57#1 := read~int(main_#t~mem56#1.base, 12 + main_#t~mem56#1.offset, 4);main_#t~post58#1 := main_#t~mem57#1;call write~int(1 + main_#t~post58#1, main_#t~mem56#1.base, 12 + main_#t~mem56#1.offset, 4);havoc main_#t~mem56#1.base, main_#t~mem56#1.offset;havoc main_#t~mem57#1;havoc main_#t~post58#1; {1218#false} is VALID [2022-02-21 03:13:11,592 INFO L290 TraceCheckUtils]: 43: Hoare triple {1218#false} call main_#t~mem59#1.base, main_#t~mem59#1.offset := read~$Pointer$(main_~users~0#1.base, 8 + main_~users~0#1.offset, 4);call main_#t~mem60#1 := read~int(main_#t~mem59#1.base, 4 + main_#t~mem59#1.offset, 4);main_~_ha_bkt~0#1 := (if 0 == main_~_ha_hashv~0#1 || 0 == main_#t~mem60#1 - 1 then 0 else (if 1 == main_#t~mem60#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~mem60#1 - 1))) else (if 1 == main_~_ha_hashv~0#1 then (if 1 == main_#t~mem60#1 - 1 || 0 == main_#t~mem60#1 - 1 then main_#t~mem60#1 - 1 else (if main_#t~mem60#1 - 1 >= 0 then (main_#t~mem60#1 - 1) % 2 else ~bitwiseAnd(main_~_ha_hashv~0#1, main_#t~mem60#1 - 1))) else ~bitwiseAnd(main_~_ha_hashv~0#1, main_#t~mem60#1 - 1))));havoc main_#t~mem59#1.base, main_#t~mem59#1.offset;havoc main_#t~mem60#1; {1218#false} is VALID [2022-02-21 03:13:11,592 INFO L290 TraceCheckUtils]: 44: Hoare triple {1218#false} goto; {1218#false} is VALID [2022-02-21 03:13:11,592 INFO L290 TraceCheckUtils]: 45: Hoare triple {1218#false} call main_#t~mem61#1.base, main_#t~mem61#1.offset := read~$Pointer$(main_~users~0#1.base, 8 + main_~users~0#1.offset, 4);call main_#t~mem62#1.base, main_#t~mem62#1.offset := read~$Pointer$(main_#t~mem61#1.base, main_#t~mem61#1.offset, 4);main_~_ha_head~0#1.base, main_~_ha_head~0#1.offset := main_#t~mem62#1.base, main_#t~mem62#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~mem61#1.base, main_#t~mem61#1.offset;havoc main_#t~mem62#1.base, main_#t~mem62#1.offset;call main_#t~mem63#1 := read~int(main_~_ha_head~0#1.base, 4 + main_~_ha_head~0#1.offset, 4);main_#t~post64#1 := main_#t~mem63#1;call write~int(1 + main_#t~post64#1, main_~_ha_head~0#1.base, 4 + main_~_ha_head~0#1.offset, 4);havoc main_#t~mem63#1;havoc main_#t~post64#1;call main_#t~mem65#1.base, main_#t~mem65#1.offset := read~$Pointer$(main_~_ha_head~0#1.base, main_~_ha_head~0#1.offset, 4);call write~$Pointer$(main_#t~mem65#1.base, main_#t~mem65#1.offset, main_~user~0#1.base, 24 + main_~user~0#1.offset, 4);havoc main_#t~mem65#1.base, main_#t~mem65#1.offset;call write~$Pointer$(0, 0, main_~user~0#1.base, 20 + main_~user~0#1.offset, 4);call main_#t~mem66#1.base, main_#t~mem66#1.offset := read~$Pointer$(main_~_ha_head~0#1.base, main_~_ha_head~0#1.offset, 4); {1218#false} is VALID [2022-02-21 03:13:11,592 INFO L290 TraceCheckUtils]: 46: Hoare triple {1218#false} assume main_#t~mem66#1.base != 0 || main_#t~mem66#1.offset != 0;havoc main_#t~mem66#1.base, main_#t~mem66#1.offset;call main_#t~mem67#1.base, main_#t~mem67#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~mem67#1.base, 12 + main_#t~mem67#1.offset, 4);havoc main_#t~mem67#1.base, main_#t~mem67#1.offset; {1218#false} is VALID [2022-02-21 03:13:11,593 INFO L290 TraceCheckUtils]: 47: Hoare triple {1218#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~mem69#1 := read~int(main_~_ha_head~0#1.base, 4 + main_~_ha_head~0#1.offset, 4);call main_#t~mem68#1 := read~int(main_~_ha_head~0#1.base, 8 + main_~_ha_head~0#1.offset, 4);main_#t~short72#1 := main_#t~mem69#1 % 4294967296 >= 10 * (1 + main_#t~mem68#1) % 4294967296; {1218#false} is VALID [2022-02-21 03:13:11,593 INFO L290 TraceCheckUtils]: 48: Hoare triple {1218#false} assume main_#t~short72#1;call main_#t~mem70#1.base, main_#t~mem70#1.offset := read~$Pointer$(main_~user~0#1.base, 8 + main_~user~0#1.offset, 4);call main_#t~mem71#1 := read~int(main_#t~mem70#1.base, 36 + main_#t~mem70#1.offset, 4);main_#t~short72#1 := 0 == main_#t~mem71#1 % 4294967296; {1218#false} is VALID [2022-02-21 03:13:11,593 INFO L290 TraceCheckUtils]: 49: Hoare triple {1218#false} assume !main_#t~short72#1;havoc main_#t~mem69#1;havoc main_#t~mem68#1;havoc main_#t~mem70#1.base, main_#t~mem70#1.offset;havoc main_#t~mem71#1;havoc main_#t~short72#1; {1218#false} is VALID [2022-02-21 03:13:11,593 INFO L290 TraceCheckUtils]: 50: Hoare triple {1218#false} goto; {1218#false} is VALID [2022-02-21 03:13:11,593 INFO L290 TraceCheckUtils]: 51: Hoare triple {1218#false} goto; {1218#false} is VALID [2022-02-21 03:13:11,594 INFO L290 TraceCheckUtils]: 52: Hoare triple {1218#false} goto; {1218#false} is VALID [2022-02-21 03:13:11,594 INFO L290 TraceCheckUtils]: 53: Hoare triple {1218#false} goto; {1218#false} is VALID [2022-02-21 03:13:11,594 INFO L290 TraceCheckUtils]: 54: Hoare triple {1218#false} main_#t~post5#1 := main_~i~0#1; {1218#false} is VALID [2022-02-21 03:13:11,594 INFO L290 TraceCheckUtils]: 55: Hoare triple {1218#false} assume !(1 + main_#t~post5#1 <= 2147483647); {1218#false} is VALID [2022-02-21 03:13:11,595 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:13:11,595 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-21 03:13:11,595 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 03:13:11,595 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2090540247] [2022-02-21 03:13:11,595 WARN L317 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-02-21 03:13:11,596 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1166468903] [2022-02-21 03:13:11,596 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1166468903] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-21 03:13:11,596 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-21 03:13:11,596 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-21 03:13:11,597 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [635767957] [2022-02-21 03:13:11,597 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-21 03:13:11,597 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 18.666666666666668) internal successors, (56), 3 states have internal predecessors, (56), 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 56 [2022-02-21 03:13:11,598 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-21 03:13:11,598 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 18.666666666666668) internal successors, (56), 3 states have internal predecessors, (56), 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:13:11,639 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:13:11,639 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-21 03:13:11,639 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 03:13:11,639 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-21 03:13:11,639 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-21 03:13:11,640 INFO L87 Difference]: Start difference. First operand 137 states and 184 transitions. Second operand has 3 states, 3 states have (on average 18.666666666666668) internal successors, (56), 3 states have internal predecessors, (56), 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:13:11,999 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:13:12,000 INFO L93 Difference]: Finished difference Result 289 states and 393 transitions. [2022-02-21 03:13:12,000 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-21 03:13:12,000 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 18.666666666666668) internal successors, (56), 3 states have internal predecessors, (56), 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 56 [2022-02-21 03:13:12,001 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-21 03:13:12,001 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 18.666666666666668) internal successors, (56), 3 states have internal predecessors, (56), 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:13:12,004 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 389 transitions. [2022-02-21 03:13:12,005 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 18.666666666666668) internal successors, (56), 3 states have internal predecessors, (56), 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:13:12,008 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 389 transitions. [2022-02-21 03:13:12,008 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 389 transitions. [2022-02-21 03:13:12,314 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 389 edges. 389 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:13:12,316 INFO L225 Difference]: With dead ends: 289 [2022-02-21 03:13:12,316 INFO L226 Difference]: Without dead ends: 158 [2022-02-21 03:13:12,317 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:13:12,318 INFO L933 BasicCegarLoop]: 160 mSDtfsCounter, 9 mSDsluCounter, 145 mSDsCounter, 0 mSdLazyCounter, 44 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 305 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:13:12,318 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [9 Valid, 305 Invalid, 72 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 44 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-21 03:13:12,319 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 158 states. [2022-02-21 03:13:12,324 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 158 to 157. [2022-02-21 03:13:12,324 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 03:13:12,325 INFO L82 GeneralOperation]: Start isEquivalent. First operand 158 states. Second operand has 157 states, 137 states have (on average 1.2992700729927007) internal successors, (178), 151 states have internal predecessors, (178), 13 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (13), 4 states have call predecessors, (13), 13 states have call successors, (13) [2022-02-21 03:13:12,325 INFO L74 IsIncluded]: Start isIncluded. First operand 158 states. Second operand has 157 states, 137 states have (on average 1.2992700729927007) internal successors, (178), 151 states have internal predecessors, (178), 13 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (13), 4 states have call predecessors, (13), 13 states have call successors, (13) [2022-02-21 03:13:12,326 INFO L87 Difference]: Start difference. First operand 158 states. Second operand has 157 states, 137 states have (on average 1.2992700729927007) internal successors, (178), 151 states have internal predecessors, (178), 13 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (13), 4 states have call predecessors, (13), 13 states have call successors, (13) [2022-02-21 03:13:12,329 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:13:12,329 INFO L93 Difference]: Finished difference Result 158 states and 205 transitions. [2022-02-21 03:13:12,329 INFO L276 IsEmpty]: Start isEmpty. Operand 158 states and 205 transitions. [2022-02-21 03:13:12,330 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:13:12,330 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:13:12,330 INFO L74 IsIncluded]: Start isIncluded. First operand has 157 states, 137 states have (on average 1.2992700729927007) internal successors, (178), 151 states have internal predecessors, (178), 13 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (13), 4 states have call predecessors, (13), 13 states have call successors, (13) Second operand 158 states. [2022-02-21 03:13:12,331 INFO L87 Difference]: Start difference. First operand has 157 states, 137 states have (on average 1.2992700729927007) internal successors, (178), 151 states have internal predecessors, (178), 13 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (13), 4 states have call predecessors, (13), 13 states have call successors, (13) Second operand 158 states. [2022-02-21 03:13:12,334 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:13:12,334 INFO L93 Difference]: Finished difference Result 158 states and 205 transitions. [2022-02-21 03:13:12,334 INFO L276 IsEmpty]: Start isEmpty. Operand 158 states and 205 transitions. [2022-02-21 03:13:12,335 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:13:12,335 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:13:12,335 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 03:13:12,335 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 03:13:12,336 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 157 states, 137 states have (on average 1.2992700729927007) internal successors, (178), 151 states have internal predecessors, (178), 13 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (13), 4 states have call predecessors, (13), 13 states have call successors, (13) [2022-02-21 03:13:12,339 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157 states to 157 states and 204 transitions. [2022-02-21 03:13:12,339 INFO L78 Accepts]: Start accepts. Automaton has 157 states and 204 transitions. Word has length 56 [2022-02-21 03:13:12,339 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-21 03:13:12,340 INFO L470 AbstractCegarLoop]: Abstraction has 157 states and 204 transitions. [2022-02-21 03:13:12,340 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 18.666666666666668) internal successors, (56), 3 states have internal predecessors, (56), 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:13:12,340 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 204 transitions. [2022-02-21 03:13:12,341 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2022-02-21 03:13:12,341 INFO L506 BasicCegarLoop]: Found error trace [2022-02-21 03:13:12,341 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:13:12,363 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-02-21 03:13:12,560 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:13:12,561 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2022-02-21 03:13:12,561 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:13:12,561 INFO L85 PathProgramCache]: Analyzing trace with hash -1391411224, now seen corresponding path program 1 times [2022-02-21 03:13:12,562 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:13:12,562 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2104412452] [2022-02-21 03:13:12,562 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:13:12,562 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:13:12,633 ERROR L252 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-02-21 03:13:12,634 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1127869317] [2022-02-21 03:13:12,634 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:13:12,634 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-21 03:13:12,634 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:13:12,636 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:13:12,663 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:13:13,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:13:13,117 INFO L263 TraceCheckSpWp]: Trace formula consists of 1519 conjuncts, 3 conjunts are in the unsatisfiable core [2022-02-21 03:13:13,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:13:13,136 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 03:13:13,269 INFO L290 TraceCheckUtils]: 0: Hoare triple {2247#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);~count_int_int~0 := 0; {2247#true} is VALID [2022-02-21 03:13:13,269 INFO L290 TraceCheckUtils]: 1: Hoare triple {2247#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc6#1.base, main_#t~malloc6#1.offset, main_#t~mem8#1, main_#t~mem7#1, main_#t~mem9#1, main_#t~mem10#1, main_#t~mem12#1, main_#t~mem11#1, main_#t~mem13#1, main_#t~mem14#1, main_#t~mem16#1, main_#t~mem15#1, main_#t~mem17#1, main_#t~mem18#1, main_#t~switch19#1, main_#t~mem20#1, main_#t~mem21#1, main_#t~mem22#1, main_#t~mem23#1, main_#t~mem24#1, main_#t~mem25#1, main_#t~mem26#1, main_#t~mem27#1, main_#t~mem28#1, main_#t~mem29#1, main_#t~mem30#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~malloc31#1.base, main_#t~malloc31#1.offset, main_#t~mem32#1.base, main_#t~mem32#1.offset, main_#t~mem33#1.base, main_#t~mem33#1.offset, main_#t~memset~res34#1.base, main_#t~memset~res34#1.offset, main_#t~mem35#1.base, main_#t~mem35#1.offset, main_#t~mem36#1.base, main_#t~mem36#1.offset, main_#t~mem37#1.base, main_#t~mem37#1.offset, main_#t~mem38#1.base, main_#t~mem38#1.offset, main_#t~mem39#1.base, main_#t~mem39#1.offset, main_#t~malloc40#1.base, main_#t~malloc40#1.offset, main_#t~mem41#1.base, main_#t~mem41#1.offset, main_#t~mem42#1.base, main_#t~mem42#1.offset, main_#t~mem43#1.base, main_#t~mem43#1.offset, main_#t~mem44#1.base, main_#t~mem44#1.offset, main_#t~mem45#1.base, main_#t~mem45#1.offset, main_#t~mem46#1.base, main_#t~mem46#1.offset, main_#t~memset~res47#1.base, main_#t~memset~res47#1.offset, main_#t~mem48#1.base, main_#t~mem48#1.offset, main_#t~mem49#1.base, main_#t~mem49#1.offset, main_#t~mem50#1.base, main_#t~mem50#1.offset, main_#t~mem51#1.base, main_#t~mem51#1.offset, main_#t~mem52#1, main_#t~mem53#1.base, main_#t~mem53#1.offset, main_#t~mem54#1.base, main_#t~mem54#1.offset, main_#t~mem55#1.base, main_#t~mem55#1.offset, main_#t~mem56#1.base, main_#t~mem56#1.offset, main_#t~mem57#1, main_#t~post58#1, main_#t~mem59#1.base, main_#t~mem59#1.offset, main_#t~mem60#1, main_#t~mem61#1.base, main_#t~mem61#1.offset, main_#t~mem62#1.base, main_#t~mem62#1.offset, main_#t~mem63#1, main_#t~post64#1, main_#t~mem65#1.base, main_#t~mem65#1.offset, main_#t~mem66#1.base, main_#t~mem66#1.offset, main_#t~mem67#1.base, main_#t~mem67#1.offset, main_#t~mem69#1, main_#t~mem68#1, main_#t~mem70#1.base, main_#t~mem70#1.offset, main_#t~mem71#1, main_#t~short72#1, main_#t~mem73#1.base, main_#t~mem73#1.offset, main_#t~mem74#1, main_#t~malloc75#1.base, main_#t~malloc75#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~mem79#1, main_#t~memset~res80#1.base, main_#t~memset~res80#1.offset, main_#t~mem81#1.base, main_#t~mem81#1.offset, main_#t~mem82#1.base, main_#t~mem82#1.offset, main_#t~mem85#1, main_#t~mem83#1.base, main_#t~mem83#1.offset, main_#t~mem84#1, main_#t~mem86#1.base, main_#t~mem86#1.offset, main_#t~mem89#1, main_#t~mem87#1.base, main_#t~mem87#1.offset, main_#t~mem88#1, main_#t~ite90#1, main_#t~mem91#1.base, main_#t~mem91#1.offset, main_#t~mem95#1.base, main_#t~mem95#1.offset, main_#t~mem96#1.base, main_#t~mem96#1.offset, main_#t~mem97#1.base, main_#t~mem97#1.offset, main_#t~mem98#1.base, main_#t~mem98#1.offset, main_#t~mem101#1, main_#t~mem99#1.base, main_#t~mem99#1.offset, main_#t~mem100#1, main_#t~mem102#1.base, main_#t~mem102#1.offset, main_#t~mem103#1, main_#t~pre104#1, main_#t~mem105#1.base, main_#t~mem105#1.offset, main_#t~mem106#1, main_#t~mem107#1.base, main_#t~mem107#1.offset, main_#t~mem108#1, main_#t~post109#1, main_#t~mem113#1, main_#t~mem111#1, main_#t~mem110#1.base, main_#t~mem110#1.offset, main_#t~mem112#1, main_#t~mem114#1, main_#t~post115#1, main_#t~mem116#1.base, main_#t~mem116#1.offset, main_#t~mem117#1.base, main_#t~mem117#1.offset, main_#t~mem118#1.base, main_#t~mem118#1.offset, main_#t~post92#1, main_#t~mem93#1.base, main_#t~mem93#1.offset, main_#t~mem94#1, main_#t~mem119#1.base, main_#t~mem119#1.offset, main_#t~mem120#1.base, main_#t~mem120#1.offset, main_#t~mem121#1.base, main_#t~mem121#1.offset, main_#t~mem122#1, main_#t~mem123#1.base, main_#t~mem123#1.offset, main_#t~mem124#1, main_#t~post125#1, main_#t~mem126#1.base, main_#t~mem126#1.offset, main_#t~mem127#1.base, main_#t~mem127#1.offset, main_#t~mem128#1.base, main_#t~mem128#1.offset, main_#t~mem129#1.base, main_#t~mem129#1.offset, main_#t~mem132#1, main_#t~mem130#1.base, main_#t~mem130#1.offset, main_#t~mem131#1, main_#t~ite135#1, main_#t~mem133#1.base, main_#t~mem133#1.offset, main_#t~mem134#1, main_#t~mem136#1.base, main_#t~mem136#1.offset, main_#t~mem137#1, main_#t~mem138#1.base, main_#t~mem138#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~post5#1, main_#t~mem140#1, main_#t~mem141#1, main_#t~mem139#1.base, main_#t~mem139#1.offset, main_~i~0#1, main_~user~0#1.base, main_~user~0#1.offset, main_~users~0#1.base, main_~users~0#1.offset;havoc main_~i~0#1;havoc main_~user~0#1.base, main_~user~0#1.offset;main_~users~0#1.base, main_~users~0#1.offset := 0, 0;main_~i~0#1 := 0; {2247#true} is VALID [2022-02-21 03:13:13,269 INFO L290 TraceCheckUtils]: 2: Hoare triple {2247#true} assume !!(main_~i~0#1 < 10);call main_#t~malloc6#1.base, main_#t~malloc6#1.offset := #Ultimate.allocOnHeap(40);main_~user~0#1.base, main_~user~0#1.offset := main_#t~malloc6#1.base, main_#t~malloc6#1.offset;havoc main_#t~malloc6#1.base, main_#t~malloc6#1.offset; {2247#true} is VALID [2022-02-21 03:13:13,269 INFO L290 TraceCheckUtils]: 3: Hoare triple {2247#true} assume !(main_~user~0#1.base == 0 && main_~user~0#1.offset == 0); {2247#true} is VALID [2022-02-21 03:13:13,270 INFO L290 TraceCheckUtils]: 4: Hoare triple {2247#true} call write~int(main_~i~0#1, main_~user~0#1.base, main_~user~0#1.offset, 4); {2247#true} is VALID [2022-02-21 03:13:13,270 INFO L290 TraceCheckUtils]: 5: Hoare triple {2247#true} assume main_~i~0#1 * main_~i~0#1 <= 2147483647; {2247#true} is VALID [2022-02-21 03:13:13,270 INFO L290 TraceCheckUtils]: 6: Hoare triple {2247#true} assume main_~i~0#1 * main_~i~0#1 >= -2147483648;call write~int(main_~i~0#1 * main_~i~0#1, main_~user~0#1.base, 4 + main_~user~0#1.offset, 4); {2247#true} is VALID [2022-02-21 03:13:13,270 INFO L290 TraceCheckUtils]: 7: Hoare triple {2247#true} havoc main_~_ha_hashv~0#1; {2247#true} is VALID [2022-02-21 03:13:13,270 INFO L290 TraceCheckUtils]: 8: Hoare triple {2247#true} goto; {2247#true} is VALID [2022-02-21 03:13:13,271 INFO L290 TraceCheckUtils]: 9: Hoare triple {2247#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; {2279#(<= |ULTIMATE.start_main_~_hj_k~0#1| 4)} is VALID [2022-02-21 03:13:13,271 INFO L290 TraceCheckUtils]: 10: Hoare triple {2279#(<= |ULTIMATE.start_main_~_hj_k~0#1| 4)} assume !(main_~_hj_k~0#1 % 4294967296 >= 12); {2279#(<= |ULTIMATE.start_main_~_hj_k~0#1| 4)} is VALID [2022-02-21 03:13:13,272 INFO L290 TraceCheckUtils]: 11: Hoare triple {2279#(<= |ULTIMATE.start_main_~_hj_k~0#1| 4)} main_~_ha_hashv~0#1 := 4 + main_~_ha_hashv~0#1;main_#t~switch19#1 := 11 == main_~_hj_k~0#1; {2286#(not |ULTIMATE.start_main_#t~switch19#1|)} is VALID [2022-02-21 03:13:13,272 INFO L290 TraceCheckUtils]: 12: Hoare triple {2286#(not |ULTIMATE.start_main_#t~switch19#1|)} assume main_#t~switch19#1;call main_#t~mem20#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~mem20#1 % 256);havoc main_#t~mem20#1; {2248#false} is VALID [2022-02-21 03:13:13,272 INFO L290 TraceCheckUtils]: 13: Hoare triple {2248#false} main_#t~switch19#1 := main_#t~switch19#1 || 10 == main_~_hj_k~0#1; {2248#false} is VALID [2022-02-21 03:13:13,272 INFO L290 TraceCheckUtils]: 14: Hoare triple {2248#false} assume main_#t~switch19#1;call main_#t~mem21#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~mem21#1 % 256);havoc main_#t~mem21#1; {2248#false} is VALID [2022-02-21 03:13:13,273 INFO L290 TraceCheckUtils]: 15: Hoare triple {2248#false} main_#t~switch19#1 := main_#t~switch19#1 || 9 == main_~_hj_k~0#1; {2248#false} is VALID [2022-02-21 03:13:13,273 INFO L290 TraceCheckUtils]: 16: Hoare triple {2248#false} assume main_#t~switch19#1;call main_#t~mem22#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~mem22#1 % 256);havoc main_#t~mem22#1; {2248#false} is VALID [2022-02-21 03:13:13,273 INFO L290 TraceCheckUtils]: 17: Hoare triple {2248#false} main_#t~switch19#1 := main_#t~switch19#1 || 8 == main_~_hj_k~0#1; {2248#false} is VALID [2022-02-21 03:13:13,273 INFO L290 TraceCheckUtils]: 18: Hoare triple {2248#false} assume main_#t~switch19#1;call main_#t~mem23#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~mem23#1 % 256);havoc main_#t~mem23#1; {2248#false} is VALID [2022-02-21 03:13:13,273 INFO L290 TraceCheckUtils]: 19: Hoare triple {2248#false} main_#t~switch19#1 := main_#t~switch19#1 || 7 == main_~_hj_k~0#1; {2248#false} is VALID [2022-02-21 03:13:13,273 INFO L290 TraceCheckUtils]: 20: Hoare triple {2248#false} assume main_#t~switch19#1;call main_#t~mem24#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~mem24#1 % 256);havoc main_#t~mem24#1; {2248#false} is VALID [2022-02-21 03:13:13,273 INFO L290 TraceCheckUtils]: 21: Hoare triple {2248#false} main_#t~switch19#1 := main_#t~switch19#1 || 6 == main_~_hj_k~0#1; {2248#false} is VALID [2022-02-21 03:13:13,273 INFO L290 TraceCheckUtils]: 22: Hoare triple {2248#false} assume main_#t~switch19#1;call main_#t~mem25#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~mem25#1 % 256);havoc main_#t~mem25#1; {2248#false} is VALID [2022-02-21 03:13:13,274 INFO L290 TraceCheckUtils]: 23: Hoare triple {2248#false} main_#t~switch19#1 := main_#t~switch19#1 || 5 == main_~_hj_k~0#1; {2248#false} is VALID [2022-02-21 03:13:13,274 INFO L290 TraceCheckUtils]: 24: Hoare triple {2248#false} assume main_#t~switch19#1;call main_#t~mem26#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~mem26#1 % 256;havoc main_#t~mem26#1; {2248#false} is VALID [2022-02-21 03:13:13,274 INFO L290 TraceCheckUtils]: 25: Hoare triple {2248#false} main_#t~switch19#1 := main_#t~switch19#1 || 4 == main_~_hj_k~0#1; {2248#false} is VALID [2022-02-21 03:13:13,274 INFO L290 TraceCheckUtils]: 26: Hoare triple {2248#false} assume main_#t~switch19#1;call main_#t~mem27#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~mem27#1 % 256);havoc main_#t~mem27#1; {2248#false} is VALID [2022-02-21 03:13:13,274 INFO L290 TraceCheckUtils]: 27: Hoare triple {2248#false} main_#t~switch19#1 := main_#t~switch19#1 || 3 == main_~_hj_k~0#1; {2248#false} is VALID [2022-02-21 03:13:13,274 INFO L290 TraceCheckUtils]: 28: Hoare triple {2248#false} assume main_#t~switch19#1;call main_#t~mem28#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~mem28#1 % 256);havoc main_#t~mem28#1; {2248#false} is VALID [2022-02-21 03:13:13,274 INFO L290 TraceCheckUtils]: 29: Hoare triple {2248#false} main_#t~switch19#1 := main_#t~switch19#1 || 2 == main_~_hj_k~0#1; {2248#false} is VALID [2022-02-21 03:13:13,274 INFO L290 TraceCheckUtils]: 30: Hoare triple {2248#false} assume main_#t~switch19#1;call main_#t~mem29#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~mem29#1 % 256);havoc main_#t~mem29#1; {2248#false} is VALID [2022-02-21 03:13:13,279 INFO L290 TraceCheckUtils]: 31: Hoare triple {2248#false} main_#t~switch19#1 := main_#t~switch19#1 || 1 == main_~_hj_k~0#1; {2248#false} is VALID [2022-02-21 03:13:13,279 INFO L290 TraceCheckUtils]: 32: Hoare triple {2248#false} assume main_#t~switch19#1;call main_#t~mem30#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~mem30#1 % 256;havoc main_#t~mem30#1; {2248#false} is VALID [2022-02-21 03:13:13,279 INFO L290 TraceCheckUtils]: 33: Hoare triple {2248#false} havoc main_#t~switch19#1; {2248#false} is VALID [2022-02-21 03:13:13,279 INFO L290 TraceCheckUtils]: 34: Hoare triple {2248#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)))); {2248#false} is VALID [2022-02-21 03:13:13,280 INFO L290 TraceCheckUtils]: 35: Hoare triple {2248#false} goto; {2248#false} is VALID [2022-02-21 03:13:13,280 INFO L290 TraceCheckUtils]: 36: Hoare triple {2248#false} goto; {2248#false} is VALID [2022-02-21 03:13:13,280 INFO L290 TraceCheckUtils]: 37: Hoare triple {2248#false} goto; {2248#false} is VALID [2022-02-21 03:13:13,281 INFO L290 TraceCheckUtils]: 38: Hoare triple {2248#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); {2248#false} is VALID [2022-02-21 03:13:13,281 INFO L290 TraceCheckUtils]: 39: Hoare triple {2248#false} assume !(main_~users~0#1.base == 0 && main_~users~0#1.offset == 0);call main_#t~mem48#1.base, main_#t~mem48#1.offset := read~$Pointer$(main_~users~0#1.base, 8 + main_~users~0#1.offset, 4);call write~$Pointer$(main_#t~mem48#1.base, main_#t~mem48#1.offset, main_~user~0#1.base, 8 + main_~user~0#1.offset, 4);havoc main_#t~mem48#1.base, main_#t~mem48#1.offset; {2248#false} is VALID [2022-02-21 03:13:13,282 INFO L290 TraceCheckUtils]: 40: Hoare triple {2248#false} call write~$Pointer$(0, 0, main_~user~0#1.base, 16 + main_~user~0#1.offset, 4);call main_#t~mem49#1.base, main_#t~mem49#1.offset := read~$Pointer$(main_~users~0#1.base, 8 + main_~users~0#1.offset, 4);call main_#t~mem50#1.base, main_#t~mem50#1.offset := read~$Pointer$(main_#t~mem49#1.base, 16 + main_#t~mem49#1.offset, 4);call main_#t~mem51#1.base, main_#t~mem51#1.offset := read~$Pointer$(main_~users~0#1.base, 8 + main_~users~0#1.offset, 4);call main_#t~mem52#1 := read~int(main_#t~mem51#1.base, 20 + main_#t~mem51#1.offset, 4);call write~$Pointer$(main_#t~mem50#1.base, main_#t~mem50#1.offset - main_#t~mem52#1, main_~user~0#1.base, 12 + main_~user~0#1.offset, 4);havoc main_#t~mem49#1.base, main_#t~mem49#1.offset;havoc main_#t~mem50#1.base, main_#t~mem50#1.offset;havoc main_#t~mem51#1.base, main_#t~mem51#1.offset;havoc main_#t~mem52#1;call main_#t~mem53#1.base, main_#t~mem53#1.offset := read~$Pointer$(main_~users~0#1.base, 8 + main_~users~0#1.offset, 4);call main_#t~mem54#1.base, main_#t~mem54#1.offset := read~$Pointer$(main_#t~mem53#1.base, 16 + main_#t~mem53#1.offset, 4);call write~$Pointer$(main_~user~0#1.base, main_~user~0#1.offset, main_#t~mem54#1.base, 8 + main_#t~mem54#1.offset, 4);havoc main_#t~mem53#1.base, main_#t~mem53#1.offset;havoc main_#t~mem54#1.base, main_#t~mem54#1.offset;call main_#t~mem55#1.base, main_#t~mem55#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~mem55#1.base, 16 + main_#t~mem55#1.offset, 4);havoc main_#t~mem55#1.base, main_#t~mem55#1.offset; {2248#false} is VALID [2022-02-21 03:13:13,283 INFO L290 TraceCheckUtils]: 41: Hoare triple {2248#false} goto; {2248#false} is VALID [2022-02-21 03:13:13,283 INFO L290 TraceCheckUtils]: 42: Hoare triple {2248#false} havoc main_~_ha_bkt~0#1;call main_#t~mem56#1.base, main_#t~mem56#1.offset := read~$Pointer$(main_~users~0#1.base, 8 + main_~users~0#1.offset, 4);call main_#t~mem57#1 := read~int(main_#t~mem56#1.base, 12 + main_#t~mem56#1.offset, 4);main_#t~post58#1 := main_#t~mem57#1;call write~int(1 + main_#t~post58#1, main_#t~mem56#1.base, 12 + main_#t~mem56#1.offset, 4);havoc main_#t~mem56#1.base, main_#t~mem56#1.offset;havoc main_#t~mem57#1;havoc main_#t~post58#1; {2248#false} is VALID [2022-02-21 03:13:13,283 INFO L290 TraceCheckUtils]: 43: Hoare triple {2248#false} call main_#t~mem59#1.base, main_#t~mem59#1.offset := read~$Pointer$(main_~users~0#1.base, 8 + main_~users~0#1.offset, 4);call main_#t~mem60#1 := read~int(main_#t~mem59#1.base, 4 + main_#t~mem59#1.offset, 4);main_~_ha_bkt~0#1 := (if 0 == main_~_ha_hashv~0#1 || 0 == main_#t~mem60#1 - 1 then 0 else (if 1 == main_#t~mem60#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~mem60#1 - 1))) else (if 1 == main_~_ha_hashv~0#1 then (if 1 == main_#t~mem60#1 - 1 || 0 == main_#t~mem60#1 - 1 then main_#t~mem60#1 - 1 else (if main_#t~mem60#1 - 1 >= 0 then (main_#t~mem60#1 - 1) % 2 else ~bitwiseAnd(main_~_ha_hashv~0#1, main_#t~mem60#1 - 1))) else ~bitwiseAnd(main_~_ha_hashv~0#1, main_#t~mem60#1 - 1))));havoc main_#t~mem59#1.base, main_#t~mem59#1.offset;havoc main_#t~mem60#1; {2248#false} is VALID [2022-02-21 03:13:13,285 INFO L290 TraceCheckUtils]: 44: Hoare triple {2248#false} goto; {2248#false} is VALID [2022-02-21 03:13:13,286 INFO L290 TraceCheckUtils]: 45: Hoare triple {2248#false} call main_#t~mem61#1.base, main_#t~mem61#1.offset := read~$Pointer$(main_~users~0#1.base, 8 + main_~users~0#1.offset, 4);call main_#t~mem62#1.base, main_#t~mem62#1.offset := read~$Pointer$(main_#t~mem61#1.base, main_#t~mem61#1.offset, 4);main_~_ha_head~0#1.base, main_~_ha_head~0#1.offset := main_#t~mem62#1.base, main_#t~mem62#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~mem61#1.base, main_#t~mem61#1.offset;havoc main_#t~mem62#1.base, main_#t~mem62#1.offset;call main_#t~mem63#1 := read~int(main_~_ha_head~0#1.base, 4 + main_~_ha_head~0#1.offset, 4);main_#t~post64#1 := main_#t~mem63#1;call write~int(1 + main_#t~post64#1, main_~_ha_head~0#1.base, 4 + main_~_ha_head~0#1.offset, 4);havoc main_#t~mem63#1;havoc main_#t~post64#1;call main_#t~mem65#1.base, main_#t~mem65#1.offset := read~$Pointer$(main_~_ha_head~0#1.base, main_~_ha_head~0#1.offset, 4);call write~$Pointer$(main_#t~mem65#1.base, main_#t~mem65#1.offset, main_~user~0#1.base, 24 + main_~user~0#1.offset, 4);havoc main_#t~mem65#1.base, main_#t~mem65#1.offset;call write~$Pointer$(0, 0, main_~user~0#1.base, 20 + main_~user~0#1.offset, 4);call main_#t~mem66#1.base, main_#t~mem66#1.offset := read~$Pointer$(main_~_ha_head~0#1.base, main_~_ha_head~0#1.offset, 4); {2248#false} is VALID [2022-02-21 03:13:13,286 INFO L290 TraceCheckUtils]: 46: Hoare triple {2248#false} assume main_#t~mem66#1.base != 0 || main_#t~mem66#1.offset != 0;havoc main_#t~mem66#1.base, main_#t~mem66#1.offset;call main_#t~mem67#1.base, main_#t~mem67#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~mem67#1.base, 12 + main_#t~mem67#1.offset, 4);havoc main_#t~mem67#1.base, main_#t~mem67#1.offset; {2248#false} is VALID [2022-02-21 03:13:13,286 INFO L290 TraceCheckUtils]: 47: Hoare triple {2248#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~mem69#1 := read~int(main_~_ha_head~0#1.base, 4 + main_~_ha_head~0#1.offset, 4);call main_#t~mem68#1 := read~int(main_~_ha_head~0#1.base, 8 + main_~_ha_head~0#1.offset, 4);main_#t~short72#1 := main_#t~mem69#1 % 4294967296 >= 10 * (1 + main_#t~mem68#1) % 4294967296; {2248#false} is VALID [2022-02-21 03:13:13,286 INFO L290 TraceCheckUtils]: 48: Hoare triple {2248#false} assume main_#t~short72#1;call main_#t~mem70#1.base, main_#t~mem70#1.offset := read~$Pointer$(main_~user~0#1.base, 8 + main_~user~0#1.offset, 4);call main_#t~mem71#1 := read~int(main_#t~mem70#1.base, 36 + main_#t~mem70#1.offset, 4);main_#t~short72#1 := 0 == main_#t~mem71#1 % 4294967296; {2248#false} is VALID [2022-02-21 03:13:13,286 INFO L290 TraceCheckUtils]: 49: Hoare triple {2248#false} assume !main_#t~short72#1;havoc main_#t~mem69#1;havoc main_#t~mem68#1;havoc main_#t~mem70#1.base, main_#t~mem70#1.offset;havoc main_#t~mem71#1;havoc main_#t~short72#1; {2248#false} is VALID [2022-02-21 03:13:13,286 INFO L290 TraceCheckUtils]: 50: Hoare triple {2248#false} goto; {2248#false} is VALID [2022-02-21 03:13:13,286 INFO L290 TraceCheckUtils]: 51: Hoare triple {2248#false} goto; {2248#false} is VALID [2022-02-21 03:13:13,287 INFO L290 TraceCheckUtils]: 52: Hoare triple {2248#false} goto; {2248#false} is VALID [2022-02-21 03:13:13,287 INFO L290 TraceCheckUtils]: 53: Hoare triple {2248#false} goto; {2248#false} is VALID [2022-02-21 03:13:13,287 INFO L290 TraceCheckUtils]: 54: Hoare triple {2248#false} main_#t~post5#1 := main_~i~0#1; {2248#false} is VALID [2022-02-21 03:13:13,288 INFO L290 TraceCheckUtils]: 55: Hoare triple {2248#false} assume !(1 + main_#t~post5#1 <= 2147483647); {2248#false} is VALID [2022-02-21 03:13:13,288 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:13:13,288 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-21 03:13:13,288 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 03:13:13,288 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2104412452] [2022-02-21 03:13:13,289 WARN L317 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-02-21 03:13:13,289 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1127869317] [2022-02-21 03:13:13,290 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1127869317] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-21 03:13:13,290 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-21 03:13:13,290 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-02-21 03:13:13,290 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [142140031] [2022-02-21 03:13:13,290 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-21 03:13:13,291 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 14.0) internal successors, (56), 4 states have internal predecessors, (56), 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 56 [2022-02-21 03:13:13,291 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-21 03:13:13,291 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 14.0) internal successors, (56), 4 states have internal predecessors, (56), 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:13:13,325 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:13:13,325 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-02-21 03:13:13,325 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 03:13:13,326 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-02-21 03:13:13,326 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-02-21 03:13:13,326 INFO L87 Difference]: Start difference. First operand 157 states and 204 transitions. Second operand has 4 states, 4 states have (on average 14.0) internal successors, (56), 4 states have internal predecessors, (56), 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:13:13,790 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:13:13,790 INFO L93 Difference]: Finished difference Result 299 states and 393 transitions. [2022-02-21 03:13:13,790 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-02-21 03:13:13,790 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 14.0) internal successors, (56), 4 states have internal predecessors, (56), 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 56 [2022-02-21 03:13:13,790 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-21 03:13:13,790 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 14.0) internal successors, (56), 4 states have internal predecessors, (56), 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:13:13,794 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 370 transitions. [2022-02-21 03:13:13,794 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 14.0) internal successors, (56), 4 states have internal predecessors, (56), 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:13:13,798 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 370 transitions. [2022-02-21 03:13:13,798 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 370 transitions. [2022-02-21 03:13:14,066 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 370 edges. 370 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:13:14,068 INFO L225 Difference]: With dead ends: 299 [2022-02-21 03:13:14,068 INFO L226 Difference]: Without dead ends: 148 [2022-02-21 03:13:14,069 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 53 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:13:14,070 INFO L933 BasicCegarLoop]: 161 mSDtfsCounter, 135 mSDsluCounter, 178 mSDsCounter, 0 mSdLazyCounter, 42 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 148 SdHoareTripleChecker+Valid, 339 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:13:14,070 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [148 Valid, 339 Invalid, 66 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 42 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-21 03:13:14,071 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 148 states. [2022-02-21 03:13:14,097 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 148 to 143. [2022-02-21 03:13:14,097 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 03:13:14,098 INFO L82 GeneralOperation]: Start isEquivalent. First operand 148 states. Second operand has 143 states, 123 states have (on average 1.2764227642276422) internal successors, (157), 137 states have internal predecessors, (157), 13 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (13), 4 states have call predecessors, (13), 13 states have call successors, (13) [2022-02-21 03:13:14,098 INFO L74 IsIncluded]: Start isIncluded. First operand 148 states. Second operand has 143 states, 123 states have (on average 1.2764227642276422) internal successors, (157), 137 states have internal predecessors, (157), 13 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (13), 4 states have call predecessors, (13), 13 states have call successors, (13) [2022-02-21 03:13:14,099 INFO L87 Difference]: Start difference. First operand 148 states. Second operand has 143 states, 123 states have (on average 1.2764227642276422) internal successors, (157), 137 states have internal predecessors, (157), 13 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (13), 4 states have call predecessors, (13), 13 states have call successors, (13) [2022-02-21 03:13:14,102 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:13:14,102 INFO L93 Difference]: Finished difference Result 148 states and 188 transitions. [2022-02-21 03:13:14,102 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states and 188 transitions. [2022-02-21 03:13:14,102 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:13:14,102 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:13:14,103 INFO L74 IsIncluded]: Start isIncluded. First operand has 143 states, 123 states have (on average 1.2764227642276422) internal successors, (157), 137 states have internal predecessors, (157), 13 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (13), 4 states have call predecessors, (13), 13 states have call successors, (13) Second operand 148 states. [2022-02-21 03:13:14,103 INFO L87 Difference]: Start difference. First operand has 143 states, 123 states have (on average 1.2764227642276422) internal successors, (157), 137 states have internal predecessors, (157), 13 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (13), 4 states have call predecessors, (13), 13 states have call successors, (13) Second operand 148 states. [2022-02-21 03:13:14,106 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:13:14,106 INFO L93 Difference]: Finished difference Result 148 states and 188 transitions. [2022-02-21 03:13:14,106 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states and 188 transitions. [2022-02-21 03:13:14,107 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:13:14,107 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:13:14,107 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 03:13:14,109 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 03:13:14,110 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 143 states, 123 states have (on average 1.2764227642276422) internal successors, (157), 137 states have internal predecessors, (157), 13 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (13), 4 states have call predecessors, (13), 13 states have call successors, (13) [2022-02-21 03:13:14,113 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143 states to 143 states and 183 transitions. [2022-02-21 03:13:14,114 INFO L78 Accepts]: Start accepts. Automaton has 143 states and 183 transitions. Word has length 56 [2022-02-21 03:13:14,114 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-21 03:13:14,115 INFO L470 AbstractCegarLoop]: Abstraction has 143 states and 183 transitions. [2022-02-21 03:13:14,115 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.0) internal successors, (56), 4 states have internal predecessors, (56), 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:13:14,115 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 183 transitions. [2022-02-21 03:13:14,116 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2022-02-21 03:13:14,118 INFO L506 BasicCegarLoop]: Found error trace [2022-02-21 03:13:14,119 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:13:14,145 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:13:14,335 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:13:14,335 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2022-02-21 03:13:14,336 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:13:14,336 INFO L85 PathProgramCache]: Analyzing trace with hash 632524954, now seen corresponding path program 1 times [2022-02-21 03:13:14,336 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:13:14,336 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [954475607] [2022-02-21 03:13:14,336 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:13:14,336 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:13:14,427 ERROR L252 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-02-21 03:13:14,429 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1095166495] [2022-02-21 03:13:14,429 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:13:14,429 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-21 03:13:14,429 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:13:14,436 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:13:14,438 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:13:14,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:13:14,930 INFO L263 TraceCheckSpWp]: Trace formula consists of 1505 conjuncts, 3 conjunts are in the unsatisfiable core [2022-02-21 03:13:14,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:13:14,955 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 03:13:15,162 INFO L290 TraceCheckUtils]: 0: Hoare triple {3259#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);~count_int_int~0 := 0; {3259#true} is VALID [2022-02-21 03:13:15,163 INFO L290 TraceCheckUtils]: 1: Hoare triple {3259#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc6#1.base, main_#t~malloc6#1.offset, main_#t~mem8#1, main_#t~mem7#1, main_#t~mem9#1, main_#t~mem10#1, main_#t~mem12#1, main_#t~mem11#1, main_#t~mem13#1, main_#t~mem14#1, main_#t~mem16#1, main_#t~mem15#1, main_#t~mem17#1, main_#t~mem18#1, main_#t~switch19#1, main_#t~mem20#1, main_#t~mem21#1, main_#t~mem22#1, main_#t~mem23#1, main_#t~mem24#1, main_#t~mem25#1, main_#t~mem26#1, main_#t~mem27#1, main_#t~mem28#1, main_#t~mem29#1, main_#t~mem30#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~malloc31#1.base, main_#t~malloc31#1.offset, main_#t~mem32#1.base, main_#t~mem32#1.offset, main_#t~mem33#1.base, main_#t~mem33#1.offset, main_#t~memset~res34#1.base, main_#t~memset~res34#1.offset, main_#t~mem35#1.base, main_#t~mem35#1.offset, main_#t~mem36#1.base, main_#t~mem36#1.offset, main_#t~mem37#1.base, main_#t~mem37#1.offset, main_#t~mem38#1.base, main_#t~mem38#1.offset, main_#t~mem39#1.base, main_#t~mem39#1.offset, main_#t~malloc40#1.base, main_#t~malloc40#1.offset, main_#t~mem41#1.base, main_#t~mem41#1.offset, main_#t~mem42#1.base, main_#t~mem42#1.offset, main_#t~mem43#1.base, main_#t~mem43#1.offset, main_#t~mem44#1.base, main_#t~mem44#1.offset, main_#t~mem45#1.base, main_#t~mem45#1.offset, main_#t~mem46#1.base, main_#t~mem46#1.offset, main_#t~memset~res47#1.base, main_#t~memset~res47#1.offset, main_#t~mem48#1.base, main_#t~mem48#1.offset, main_#t~mem49#1.base, main_#t~mem49#1.offset, main_#t~mem50#1.base, main_#t~mem50#1.offset, main_#t~mem51#1.base, main_#t~mem51#1.offset, main_#t~mem52#1, main_#t~mem53#1.base, main_#t~mem53#1.offset, main_#t~mem54#1.base, main_#t~mem54#1.offset, main_#t~mem55#1.base, main_#t~mem55#1.offset, main_#t~mem56#1.base, main_#t~mem56#1.offset, main_#t~mem57#1, main_#t~post58#1, main_#t~mem59#1.base, main_#t~mem59#1.offset, main_#t~mem60#1, main_#t~mem61#1.base, main_#t~mem61#1.offset, main_#t~mem62#1.base, main_#t~mem62#1.offset, main_#t~mem63#1, main_#t~post64#1, main_#t~mem65#1.base, main_#t~mem65#1.offset, main_#t~mem66#1.base, main_#t~mem66#1.offset, main_#t~mem67#1.base, main_#t~mem67#1.offset, main_#t~mem69#1, main_#t~mem68#1, main_#t~mem70#1.base, main_#t~mem70#1.offset, main_#t~mem71#1, main_#t~short72#1, main_#t~mem73#1.base, main_#t~mem73#1.offset, main_#t~mem74#1, main_#t~malloc75#1.base, main_#t~malloc75#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~mem79#1, main_#t~memset~res80#1.base, main_#t~memset~res80#1.offset, main_#t~mem81#1.base, main_#t~mem81#1.offset, main_#t~mem82#1.base, main_#t~mem82#1.offset, main_#t~mem85#1, main_#t~mem83#1.base, main_#t~mem83#1.offset, main_#t~mem84#1, main_#t~mem86#1.base, main_#t~mem86#1.offset, main_#t~mem89#1, main_#t~mem87#1.base, main_#t~mem87#1.offset, main_#t~mem88#1, main_#t~ite90#1, main_#t~mem91#1.base, main_#t~mem91#1.offset, main_#t~mem95#1.base, main_#t~mem95#1.offset, main_#t~mem96#1.base, main_#t~mem96#1.offset, main_#t~mem97#1.base, main_#t~mem97#1.offset, main_#t~mem98#1.base, main_#t~mem98#1.offset, main_#t~mem101#1, main_#t~mem99#1.base, main_#t~mem99#1.offset, main_#t~mem100#1, main_#t~mem102#1.base, main_#t~mem102#1.offset, main_#t~mem103#1, main_#t~pre104#1, main_#t~mem105#1.base, main_#t~mem105#1.offset, main_#t~mem106#1, main_#t~mem107#1.base, main_#t~mem107#1.offset, main_#t~mem108#1, main_#t~post109#1, main_#t~mem113#1, main_#t~mem111#1, main_#t~mem110#1.base, main_#t~mem110#1.offset, main_#t~mem112#1, main_#t~mem114#1, main_#t~post115#1, main_#t~mem116#1.base, main_#t~mem116#1.offset, main_#t~mem117#1.base, main_#t~mem117#1.offset, main_#t~mem118#1.base, main_#t~mem118#1.offset, main_#t~post92#1, main_#t~mem93#1.base, main_#t~mem93#1.offset, main_#t~mem94#1, main_#t~mem119#1.base, main_#t~mem119#1.offset, main_#t~mem120#1.base, main_#t~mem120#1.offset, main_#t~mem121#1.base, main_#t~mem121#1.offset, main_#t~mem122#1, main_#t~mem123#1.base, main_#t~mem123#1.offset, main_#t~mem124#1, main_#t~post125#1, main_#t~mem126#1.base, main_#t~mem126#1.offset, main_#t~mem127#1.base, main_#t~mem127#1.offset, main_#t~mem128#1.base, main_#t~mem128#1.offset, main_#t~mem129#1.base, main_#t~mem129#1.offset, main_#t~mem132#1, main_#t~mem130#1.base, main_#t~mem130#1.offset, main_#t~mem131#1, main_#t~ite135#1, main_#t~mem133#1.base, main_#t~mem133#1.offset, main_#t~mem134#1, main_#t~mem136#1.base, main_#t~mem136#1.offset, main_#t~mem137#1, main_#t~mem138#1.base, main_#t~mem138#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~post5#1, main_#t~mem140#1, main_#t~mem141#1, main_#t~mem139#1.base, main_#t~mem139#1.offset, main_~i~0#1, main_~user~0#1.base, main_~user~0#1.offset, main_~users~0#1.base, main_~users~0#1.offset;havoc main_~i~0#1;havoc main_~user~0#1.base, main_~user~0#1.offset;main_~users~0#1.base, main_~users~0#1.offset := 0, 0;main_~i~0#1 := 0; {3267#(<= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-21 03:13:15,163 INFO L290 TraceCheckUtils]: 2: Hoare triple {3267#(<= |ULTIMATE.start_main_~i~0#1| 0)} assume !!(main_~i~0#1 < 10);call main_#t~malloc6#1.base, main_#t~malloc6#1.offset := #Ultimate.allocOnHeap(40);main_~user~0#1.base, main_~user~0#1.offset := main_#t~malloc6#1.base, main_#t~malloc6#1.offset;havoc main_#t~malloc6#1.base, main_#t~malloc6#1.offset; {3267#(<= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-21 03:13:15,165 INFO L290 TraceCheckUtils]: 3: Hoare triple {3267#(<= |ULTIMATE.start_main_~i~0#1| 0)} assume !(main_~user~0#1.base == 0 && main_~user~0#1.offset == 0); {3267#(<= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-21 03:13:15,165 INFO L290 TraceCheckUtils]: 4: Hoare triple {3267#(<= |ULTIMATE.start_main_~i~0#1| 0)} call write~int(main_~i~0#1, main_~user~0#1.base, main_~user~0#1.offset, 4); {3267#(<= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-21 03:13:15,171 INFO L290 TraceCheckUtils]: 5: Hoare triple {3267#(<= |ULTIMATE.start_main_~i~0#1| 0)} assume main_~i~0#1 * main_~i~0#1 <= 2147483647; {3267#(<= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-21 03:13:15,172 INFO L290 TraceCheckUtils]: 6: Hoare triple {3267#(<= |ULTIMATE.start_main_~i~0#1| 0)} assume main_~i~0#1 * main_~i~0#1 >= -2147483648;call write~int(main_~i~0#1 * main_~i~0#1, main_~user~0#1.base, 4 + main_~user~0#1.offset, 4); {3267#(<= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-21 03:13:15,172 INFO L290 TraceCheckUtils]: 7: Hoare triple {3267#(<= |ULTIMATE.start_main_~i~0#1| 0)} havoc main_~_ha_hashv~0#1; {3267#(<= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-21 03:13:15,172 INFO L290 TraceCheckUtils]: 8: Hoare triple {3267#(<= |ULTIMATE.start_main_~i~0#1| 0)} goto; {3267#(<= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-21 03:13:15,172 INFO L290 TraceCheckUtils]: 9: Hoare triple {3267#(<= |ULTIMATE.start_main_~i~0#1| 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; {3267#(<= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-21 03:13:15,173 INFO L290 TraceCheckUtils]: 10: Hoare triple {3267#(<= |ULTIMATE.start_main_~i~0#1| 0)} assume !(main_~_hj_k~0#1 % 4294967296 >= 12); {3267#(<= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-21 03:13:15,173 INFO L290 TraceCheckUtils]: 11: Hoare triple {3267#(<= |ULTIMATE.start_main_~i~0#1| 0)} main_~_ha_hashv~0#1 := 4 + main_~_ha_hashv~0#1;main_#t~switch19#1 := 11 == main_~_hj_k~0#1; {3267#(<= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-21 03:13:15,173 INFO L290 TraceCheckUtils]: 12: Hoare triple {3267#(<= |ULTIMATE.start_main_~i~0#1| 0)} assume !main_#t~switch19#1; {3267#(<= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-21 03:13:15,174 INFO L290 TraceCheckUtils]: 13: Hoare triple {3267#(<= |ULTIMATE.start_main_~i~0#1| 0)} main_#t~switch19#1 := main_#t~switch19#1 || 10 == main_~_hj_k~0#1; {3267#(<= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-21 03:13:15,174 INFO L290 TraceCheckUtils]: 14: Hoare triple {3267#(<= |ULTIMATE.start_main_~i~0#1| 0)} assume !main_#t~switch19#1; {3267#(<= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-21 03:13:15,174 INFO L290 TraceCheckUtils]: 15: Hoare triple {3267#(<= |ULTIMATE.start_main_~i~0#1| 0)} main_#t~switch19#1 := main_#t~switch19#1 || 9 == main_~_hj_k~0#1; {3267#(<= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-21 03:13:15,175 INFO L290 TraceCheckUtils]: 16: Hoare triple {3267#(<= |ULTIMATE.start_main_~i~0#1| 0)} assume !main_#t~switch19#1; {3267#(<= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-21 03:13:15,175 INFO L290 TraceCheckUtils]: 17: Hoare triple {3267#(<= |ULTIMATE.start_main_~i~0#1| 0)} main_#t~switch19#1 := main_#t~switch19#1 || 8 == main_~_hj_k~0#1; {3267#(<= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-21 03:13:15,175 INFO L290 TraceCheckUtils]: 18: Hoare triple {3267#(<= |ULTIMATE.start_main_~i~0#1| 0)} assume !main_#t~switch19#1; {3267#(<= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-21 03:13:15,175 INFO L290 TraceCheckUtils]: 19: Hoare triple {3267#(<= |ULTIMATE.start_main_~i~0#1| 0)} main_#t~switch19#1 := main_#t~switch19#1 || 7 == main_~_hj_k~0#1; {3267#(<= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-21 03:13:15,176 INFO L290 TraceCheckUtils]: 20: Hoare triple {3267#(<= |ULTIMATE.start_main_~i~0#1| 0)} assume !main_#t~switch19#1; {3267#(<= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-21 03:13:15,176 INFO L290 TraceCheckUtils]: 21: Hoare triple {3267#(<= |ULTIMATE.start_main_~i~0#1| 0)} main_#t~switch19#1 := main_#t~switch19#1 || 6 == main_~_hj_k~0#1; {3267#(<= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-21 03:13:15,176 INFO L290 TraceCheckUtils]: 22: Hoare triple {3267#(<= |ULTIMATE.start_main_~i~0#1| 0)} assume !main_#t~switch19#1; {3267#(<= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-21 03:13:15,177 INFO L290 TraceCheckUtils]: 23: Hoare triple {3267#(<= |ULTIMATE.start_main_~i~0#1| 0)} main_#t~switch19#1 := main_#t~switch19#1 || 5 == main_~_hj_k~0#1; {3267#(<= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-21 03:13:15,177 INFO L290 TraceCheckUtils]: 24: Hoare triple {3267#(<= |ULTIMATE.start_main_~i~0#1| 0)} assume !main_#t~switch19#1; {3267#(<= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-21 03:13:15,177 INFO L290 TraceCheckUtils]: 25: Hoare triple {3267#(<= |ULTIMATE.start_main_~i~0#1| 0)} main_#t~switch19#1 := main_#t~switch19#1 || 4 == main_~_hj_k~0#1; {3267#(<= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-21 03:13:15,178 INFO L290 TraceCheckUtils]: 26: Hoare triple {3267#(<= |ULTIMATE.start_main_~i~0#1| 0)} assume main_#t~switch19#1;call main_#t~mem27#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~mem27#1 % 256);havoc main_#t~mem27#1; {3267#(<= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-21 03:13:15,178 INFO L290 TraceCheckUtils]: 27: Hoare triple {3267#(<= |ULTIMATE.start_main_~i~0#1| 0)} main_#t~switch19#1 := main_#t~switch19#1 || 3 == main_~_hj_k~0#1; {3267#(<= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-21 03:13:15,178 INFO L290 TraceCheckUtils]: 28: Hoare triple {3267#(<= |ULTIMATE.start_main_~i~0#1| 0)} assume main_#t~switch19#1;call main_#t~mem28#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~mem28#1 % 256);havoc main_#t~mem28#1; {3267#(<= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-21 03:13:15,178 INFO L290 TraceCheckUtils]: 29: Hoare triple {3267#(<= |ULTIMATE.start_main_~i~0#1| 0)} main_#t~switch19#1 := main_#t~switch19#1 || 2 == main_~_hj_k~0#1; {3267#(<= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-21 03:13:15,179 INFO L290 TraceCheckUtils]: 30: Hoare triple {3267#(<= |ULTIMATE.start_main_~i~0#1| 0)} assume main_#t~switch19#1;call main_#t~mem29#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~mem29#1 % 256);havoc main_#t~mem29#1; {3267#(<= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-21 03:13:15,179 INFO L290 TraceCheckUtils]: 31: Hoare triple {3267#(<= |ULTIMATE.start_main_~i~0#1| 0)} main_#t~switch19#1 := main_#t~switch19#1 || 1 == main_~_hj_k~0#1; {3267#(<= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-21 03:13:15,179 INFO L290 TraceCheckUtils]: 32: Hoare triple {3267#(<= |ULTIMATE.start_main_~i~0#1| 0)} assume main_#t~switch19#1;call main_#t~mem30#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~mem30#1 % 256;havoc main_#t~mem30#1; {3267#(<= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-21 03:13:15,180 INFO L290 TraceCheckUtils]: 33: Hoare triple {3267#(<= |ULTIMATE.start_main_~i~0#1| 0)} havoc main_#t~switch19#1; {3267#(<= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-21 03:13:15,180 INFO L290 TraceCheckUtils]: 34: Hoare triple {3267#(<= |ULTIMATE.start_main_~i~0#1| 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)))); {3267#(<= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-21 03:13:15,180 INFO L290 TraceCheckUtils]: 35: Hoare triple {3267#(<= |ULTIMATE.start_main_~i~0#1| 0)} goto; {3267#(<= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-21 03:13:15,180 INFO L290 TraceCheckUtils]: 36: Hoare triple {3267#(<= |ULTIMATE.start_main_~i~0#1| 0)} goto; {3267#(<= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-21 03:13:15,181 INFO L290 TraceCheckUtils]: 37: Hoare triple {3267#(<= |ULTIMATE.start_main_~i~0#1| 0)} goto; {3267#(<= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-21 03:13:15,181 INFO L290 TraceCheckUtils]: 38: Hoare triple {3267#(<= |ULTIMATE.start_main_~i~0#1| 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); {3267#(<= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-21 03:13:15,181 INFO L290 TraceCheckUtils]: 39: Hoare triple {3267#(<= |ULTIMATE.start_main_~i~0#1| 0)} assume !(main_~users~0#1.base == 0 && main_~users~0#1.offset == 0);call main_#t~mem48#1.base, main_#t~mem48#1.offset := read~$Pointer$(main_~users~0#1.base, 8 + main_~users~0#1.offset, 4);call write~$Pointer$(main_#t~mem48#1.base, main_#t~mem48#1.offset, main_~user~0#1.base, 8 + main_~user~0#1.offset, 4);havoc main_#t~mem48#1.base, main_#t~mem48#1.offset; {3267#(<= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-21 03:13:15,182 INFO L290 TraceCheckUtils]: 40: Hoare triple {3267#(<= |ULTIMATE.start_main_~i~0#1| 0)} call write~$Pointer$(0, 0, main_~user~0#1.base, 16 + main_~user~0#1.offset, 4);call main_#t~mem49#1.base, main_#t~mem49#1.offset := read~$Pointer$(main_~users~0#1.base, 8 + main_~users~0#1.offset, 4);call main_#t~mem50#1.base, main_#t~mem50#1.offset := read~$Pointer$(main_#t~mem49#1.base, 16 + main_#t~mem49#1.offset, 4);call main_#t~mem51#1.base, main_#t~mem51#1.offset := read~$Pointer$(main_~users~0#1.base, 8 + main_~users~0#1.offset, 4);call main_#t~mem52#1 := read~int(main_#t~mem51#1.base, 20 + main_#t~mem51#1.offset, 4);call write~$Pointer$(main_#t~mem50#1.base, main_#t~mem50#1.offset - main_#t~mem52#1, main_~user~0#1.base, 12 + main_~user~0#1.offset, 4);havoc main_#t~mem49#1.base, main_#t~mem49#1.offset;havoc main_#t~mem50#1.base, main_#t~mem50#1.offset;havoc main_#t~mem51#1.base, main_#t~mem51#1.offset;havoc main_#t~mem52#1;call main_#t~mem53#1.base, main_#t~mem53#1.offset := read~$Pointer$(main_~users~0#1.base, 8 + main_~users~0#1.offset, 4);call main_#t~mem54#1.base, main_#t~mem54#1.offset := read~$Pointer$(main_#t~mem53#1.base, 16 + main_#t~mem53#1.offset, 4);call write~$Pointer$(main_~user~0#1.base, main_~user~0#1.offset, main_#t~mem54#1.base, 8 + main_#t~mem54#1.offset, 4);havoc main_#t~mem53#1.base, main_#t~mem53#1.offset;havoc main_#t~mem54#1.base, main_#t~mem54#1.offset;call main_#t~mem55#1.base, main_#t~mem55#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~mem55#1.base, 16 + main_#t~mem55#1.offset, 4);havoc main_#t~mem55#1.base, main_#t~mem55#1.offset; {3267#(<= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-21 03:13:15,182 INFO L290 TraceCheckUtils]: 41: Hoare triple {3267#(<= |ULTIMATE.start_main_~i~0#1| 0)} goto; {3267#(<= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-21 03:13:15,182 INFO L290 TraceCheckUtils]: 42: Hoare triple {3267#(<= |ULTIMATE.start_main_~i~0#1| 0)} havoc main_~_ha_bkt~0#1;call main_#t~mem56#1.base, main_#t~mem56#1.offset := read~$Pointer$(main_~users~0#1.base, 8 + main_~users~0#1.offset, 4);call main_#t~mem57#1 := read~int(main_#t~mem56#1.base, 12 + main_#t~mem56#1.offset, 4);main_#t~post58#1 := main_#t~mem57#1;call write~int(1 + main_#t~post58#1, main_#t~mem56#1.base, 12 + main_#t~mem56#1.offset, 4);havoc main_#t~mem56#1.base, main_#t~mem56#1.offset;havoc main_#t~mem57#1;havoc main_#t~post58#1; {3267#(<= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-21 03:13:15,182 INFO L290 TraceCheckUtils]: 43: Hoare triple {3267#(<= |ULTIMATE.start_main_~i~0#1| 0)} call main_#t~mem59#1.base, main_#t~mem59#1.offset := read~$Pointer$(main_~users~0#1.base, 8 + main_~users~0#1.offset, 4);call main_#t~mem60#1 := read~int(main_#t~mem59#1.base, 4 + main_#t~mem59#1.offset, 4);main_~_ha_bkt~0#1 := (if 0 == main_~_ha_hashv~0#1 || 0 == main_#t~mem60#1 - 1 then 0 else (if 1 == main_#t~mem60#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~mem60#1 - 1))) else (if 1 == main_~_ha_hashv~0#1 then (if 1 == main_#t~mem60#1 - 1 || 0 == main_#t~mem60#1 - 1 then main_#t~mem60#1 - 1 else (if main_#t~mem60#1 - 1 >= 0 then (main_#t~mem60#1 - 1) % 2 else ~bitwiseAnd(main_~_ha_hashv~0#1, main_#t~mem60#1 - 1))) else ~bitwiseAnd(main_~_ha_hashv~0#1, main_#t~mem60#1 - 1))));havoc main_#t~mem59#1.base, main_#t~mem59#1.offset;havoc main_#t~mem60#1; {3267#(<= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-21 03:13:15,183 INFO L290 TraceCheckUtils]: 44: Hoare triple {3267#(<= |ULTIMATE.start_main_~i~0#1| 0)} goto; {3267#(<= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-21 03:13:15,183 INFO L290 TraceCheckUtils]: 45: Hoare triple {3267#(<= |ULTIMATE.start_main_~i~0#1| 0)} call main_#t~mem61#1.base, main_#t~mem61#1.offset := read~$Pointer$(main_~users~0#1.base, 8 + main_~users~0#1.offset, 4);call main_#t~mem62#1.base, main_#t~mem62#1.offset := read~$Pointer$(main_#t~mem61#1.base, main_#t~mem61#1.offset, 4);main_~_ha_head~0#1.base, main_~_ha_head~0#1.offset := main_#t~mem62#1.base, main_#t~mem62#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~mem61#1.base, main_#t~mem61#1.offset;havoc main_#t~mem62#1.base, main_#t~mem62#1.offset;call main_#t~mem63#1 := read~int(main_~_ha_head~0#1.base, 4 + main_~_ha_head~0#1.offset, 4);main_#t~post64#1 := main_#t~mem63#1;call write~int(1 + main_#t~post64#1, main_~_ha_head~0#1.base, 4 + main_~_ha_head~0#1.offset, 4);havoc main_#t~mem63#1;havoc main_#t~post64#1;call main_#t~mem65#1.base, main_#t~mem65#1.offset := read~$Pointer$(main_~_ha_head~0#1.base, main_~_ha_head~0#1.offset, 4);call write~$Pointer$(main_#t~mem65#1.base, main_#t~mem65#1.offset, main_~user~0#1.base, 24 + main_~user~0#1.offset, 4);havoc main_#t~mem65#1.base, main_#t~mem65#1.offset;call write~$Pointer$(0, 0, main_~user~0#1.base, 20 + main_~user~0#1.offset, 4);call main_#t~mem66#1.base, main_#t~mem66#1.offset := read~$Pointer$(main_~_ha_head~0#1.base, main_~_ha_head~0#1.offset, 4); {3267#(<= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-21 03:13:15,183 INFO L290 TraceCheckUtils]: 46: Hoare triple {3267#(<= |ULTIMATE.start_main_~i~0#1| 0)} assume main_#t~mem66#1.base != 0 || main_#t~mem66#1.offset != 0;havoc main_#t~mem66#1.base, main_#t~mem66#1.offset;call main_#t~mem67#1.base, main_#t~mem67#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~mem67#1.base, 12 + main_#t~mem67#1.offset, 4);havoc main_#t~mem67#1.base, main_#t~mem67#1.offset; {3267#(<= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-21 03:13:15,184 INFO L290 TraceCheckUtils]: 47: Hoare triple {3267#(<= |ULTIMATE.start_main_~i~0#1| 0)} 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~mem69#1 := read~int(main_~_ha_head~0#1.base, 4 + main_~_ha_head~0#1.offset, 4);call main_#t~mem68#1 := read~int(main_~_ha_head~0#1.base, 8 + main_~_ha_head~0#1.offset, 4);main_#t~short72#1 := main_#t~mem69#1 % 4294967296 >= 10 * (1 + main_#t~mem68#1) % 4294967296; {3267#(<= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-21 03:13:15,184 INFO L290 TraceCheckUtils]: 48: Hoare triple {3267#(<= |ULTIMATE.start_main_~i~0#1| 0)} assume main_#t~short72#1;call main_#t~mem70#1.base, main_#t~mem70#1.offset := read~$Pointer$(main_~user~0#1.base, 8 + main_~user~0#1.offset, 4);call main_#t~mem71#1 := read~int(main_#t~mem70#1.base, 36 + main_#t~mem70#1.offset, 4);main_#t~short72#1 := 0 == main_#t~mem71#1 % 4294967296; {3267#(<= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-21 03:13:15,184 INFO L290 TraceCheckUtils]: 49: Hoare triple {3267#(<= |ULTIMATE.start_main_~i~0#1| 0)} assume !main_#t~short72#1;havoc main_#t~mem69#1;havoc main_#t~mem68#1;havoc main_#t~mem70#1.base, main_#t~mem70#1.offset;havoc main_#t~mem71#1;havoc main_#t~short72#1; {3267#(<= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-21 03:13:15,184 INFO L290 TraceCheckUtils]: 50: Hoare triple {3267#(<= |ULTIMATE.start_main_~i~0#1| 0)} goto; {3267#(<= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-21 03:13:15,185 INFO L290 TraceCheckUtils]: 51: Hoare triple {3267#(<= |ULTIMATE.start_main_~i~0#1| 0)} goto; {3267#(<= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-21 03:13:15,185 INFO L290 TraceCheckUtils]: 52: Hoare triple {3267#(<= |ULTIMATE.start_main_~i~0#1| 0)} goto; {3267#(<= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-21 03:13:15,185 INFO L290 TraceCheckUtils]: 53: Hoare triple {3267#(<= |ULTIMATE.start_main_~i~0#1| 0)} goto; {3267#(<= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-21 03:13:15,186 INFO L290 TraceCheckUtils]: 54: Hoare triple {3267#(<= |ULTIMATE.start_main_~i~0#1| 0)} main_#t~post5#1 := main_~i~0#1; {3427#(<= |ULTIMATE.start_main_#t~post5#1| 0)} is VALID [2022-02-21 03:13:15,186 INFO L290 TraceCheckUtils]: 55: Hoare triple {3427#(<= |ULTIMATE.start_main_#t~post5#1| 0)} assume !(1 + main_#t~post5#1 <= 2147483647); {3260#false} is VALID [2022-02-21 03:13:15,186 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:13:15,186 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-21 03:13:15,186 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 03:13:15,187 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [954475607] [2022-02-21 03:13:15,187 WARN L317 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-02-21 03:13:15,187 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1095166495] [2022-02-21 03:13:15,187 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1095166495] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-21 03:13:15,187 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-21 03:13:15,187 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-21 03:13:15,187 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1454223184] [2022-02-21 03:13:15,187 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-21 03:13:15,187 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 18.666666666666668) internal successors, (56), 4 states have internal predecessors, (56), 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 56 [2022-02-21 03:13:15,188 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-21 03:13:15,188 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 4 states, 3 states have (on average 18.666666666666668) internal successors, (56), 4 states have internal predecessors, (56), 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:13:15,227 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:13:15,227 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-02-21 03:13:15,227 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 03:13:15,227 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-02-21 03:13:15,227 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-02-21 03:13:15,228 INFO L87 Difference]: Start difference. First operand 143 states and 183 transitions. Second operand has 4 states, 3 states have (on average 18.666666666666668) internal successors, (56), 4 states have internal predecessors, (56), 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:13:15,749 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:13:15,750 INFO L93 Difference]: Finished difference Result 238 states and 298 transitions. [2022-02-21 03:13:15,750 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-02-21 03:13:15,750 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 18.666666666666668) internal successors, (56), 4 states have internal predecessors, (56), 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 56 [2022-02-21 03:13:15,750 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-21 03:13:15,750 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 3 states have (on average 18.666666666666668) internal successors, (56), 4 states have internal predecessors, (56), 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:13:15,752 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 286 transitions. [2022-02-21 03:13:15,752 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 3 states have (on average 18.666666666666668) internal successors, (56), 4 states have internal predecessors, (56), 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:13:15,754 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 286 transitions. [2022-02-21 03:13:15,754 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 286 transitions. [2022-02-21 03:13:15,954 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:13:15,958 INFO L225 Difference]: With dead ends: 238 [2022-02-21 03:13:15,958 INFO L226 Difference]: Without dead ends: 237 [2022-02-21 03:13:15,958 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 53 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:13:15,959 INFO L933 BasicCegarLoop]: 168 mSDtfsCounter, 55 mSDsluCounter, 330 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 58 SdHoareTripleChecker+Valid, 498 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-21 03:13:15,959 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [58 Valid, 498 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-21 03:13:15,960 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 237 states. [2022-02-21 03:13:15,999 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 237 to 235. [2022-02-21 03:13:15,999 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 03:13:15,999 INFO L82 GeneralOperation]: Start isEquivalent. First operand 237 states. Second operand has 235 states, 212 states have (on average 1.240566037735849) internal successors, (263), 226 states have internal predecessors, (263), 16 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 7 states have call predecessors, (16), 16 states have call successors, (16) [2022-02-21 03:13:16,000 INFO L74 IsIncluded]: Start isIncluded. First operand 237 states. Second operand has 235 states, 212 states have (on average 1.240566037735849) internal successors, (263), 226 states have internal predecessors, (263), 16 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 7 states have call predecessors, (16), 16 states have call successors, (16) [2022-02-21 03:13:16,000 INFO L87 Difference]: Start difference. First operand 237 states. Second operand has 235 states, 212 states have (on average 1.240566037735849) internal successors, (263), 226 states have internal predecessors, (263), 16 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 7 states have call predecessors, (16), 16 states have call successors, (16) [2022-02-21 03:13:16,005 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:13:16,005 INFO L93 Difference]: Finished difference Result 237 states and 297 transitions. [2022-02-21 03:13:16,005 INFO L276 IsEmpty]: Start isEmpty. Operand 237 states and 297 transitions. [2022-02-21 03:13:16,005 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:13:16,005 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:13:16,006 INFO L74 IsIncluded]: Start isIncluded. First operand has 235 states, 212 states have (on average 1.240566037735849) internal successors, (263), 226 states have internal predecessors, (263), 16 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 7 states have call predecessors, (16), 16 states have call successors, (16) Second operand 237 states. [2022-02-21 03:13:16,006 INFO L87 Difference]: Start difference. First operand has 235 states, 212 states have (on average 1.240566037735849) internal successors, (263), 226 states have internal predecessors, (263), 16 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 7 states have call predecessors, (16), 16 states have call successors, (16) Second operand 237 states. [2022-02-21 03:13:16,011 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:13:16,011 INFO L93 Difference]: Finished difference Result 237 states and 297 transitions. [2022-02-21 03:13:16,011 INFO L276 IsEmpty]: Start isEmpty. Operand 237 states and 297 transitions. [2022-02-21 03:13:16,012 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:13:16,012 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:13:16,012 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 03:13:16,012 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 03:13:16,013 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 235 states, 212 states have (on average 1.240566037735849) internal successors, (263), 226 states have internal predecessors, (263), 16 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 7 states have call predecessors, (16), 16 states have call successors, (16) [2022-02-21 03:13:16,017 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 235 states to 235 states and 295 transitions. [2022-02-21 03:13:16,017 INFO L78 Accepts]: Start accepts. Automaton has 235 states and 295 transitions. Word has length 56 [2022-02-21 03:13:16,017 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-21 03:13:16,017 INFO L470 AbstractCegarLoop]: Abstraction has 235 states and 295 transitions. [2022-02-21 03:13:16,017 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 18.666666666666668) internal successors, (56), 4 states have internal predecessors, (56), 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:13:16,017 INFO L276 IsEmpty]: Start isEmpty. Operand 235 states and 295 transitions. [2022-02-21 03:13:16,018 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2022-02-21 03:13:16,018 INFO L506 BasicCegarLoop]: Found error trace [2022-02-21 03:13:16,018 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] [2022-02-21 03:13:16,041 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:13:16,235 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:13:16,235 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2022-02-21 03:13:16,236 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:13:16,236 INFO L85 PathProgramCache]: Analyzing trace with hash -1866562491, now seen corresponding path program 1 times [2022-02-21 03:13:16,236 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:13:16,236 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [288706140] [2022-02-21 03:13:16,236 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:13:16,236 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:13:16,304 ERROR L252 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-02-21 03:13:16,304 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1416061340] [2022-02-21 03:13:16,304 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:13:16,304 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-21 03:13:16,305 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:13:16,308 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:13:16,339 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:13:16,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:13:16,869 INFO L263 TraceCheckSpWp]: Trace formula consists of 1506 conjuncts, 3 conjunts are in the unsatisfiable core [2022-02-21 03:13:16,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:13:16,921 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 03:13:17,105 INFO L290 TraceCheckUtils]: 0: Hoare triple {4477#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);~count_int_int~0 := 0; {4477#true} is VALID [2022-02-21 03:13:17,105 INFO L290 TraceCheckUtils]: 1: Hoare triple {4477#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc6#1.base, main_#t~malloc6#1.offset, main_#t~mem8#1, main_#t~mem7#1, main_#t~mem9#1, main_#t~mem10#1, main_#t~mem12#1, main_#t~mem11#1, main_#t~mem13#1, main_#t~mem14#1, main_#t~mem16#1, main_#t~mem15#1, main_#t~mem17#1, main_#t~mem18#1, main_#t~switch19#1, main_#t~mem20#1, main_#t~mem21#1, main_#t~mem22#1, main_#t~mem23#1, main_#t~mem24#1, main_#t~mem25#1, main_#t~mem26#1, main_#t~mem27#1, main_#t~mem28#1, main_#t~mem29#1, main_#t~mem30#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~malloc31#1.base, main_#t~malloc31#1.offset, main_#t~mem32#1.base, main_#t~mem32#1.offset, main_#t~mem33#1.base, main_#t~mem33#1.offset, main_#t~memset~res34#1.base, main_#t~memset~res34#1.offset, main_#t~mem35#1.base, main_#t~mem35#1.offset, main_#t~mem36#1.base, main_#t~mem36#1.offset, main_#t~mem37#1.base, main_#t~mem37#1.offset, main_#t~mem38#1.base, main_#t~mem38#1.offset, main_#t~mem39#1.base, main_#t~mem39#1.offset, main_#t~malloc40#1.base, main_#t~malloc40#1.offset, main_#t~mem41#1.base, main_#t~mem41#1.offset, main_#t~mem42#1.base, main_#t~mem42#1.offset, main_#t~mem43#1.base, main_#t~mem43#1.offset, main_#t~mem44#1.base, main_#t~mem44#1.offset, main_#t~mem45#1.base, main_#t~mem45#1.offset, main_#t~mem46#1.base, main_#t~mem46#1.offset, main_#t~memset~res47#1.base, main_#t~memset~res47#1.offset, main_#t~mem48#1.base, main_#t~mem48#1.offset, main_#t~mem49#1.base, main_#t~mem49#1.offset, main_#t~mem50#1.base, main_#t~mem50#1.offset, main_#t~mem51#1.base, main_#t~mem51#1.offset, main_#t~mem52#1, main_#t~mem53#1.base, main_#t~mem53#1.offset, main_#t~mem54#1.base, main_#t~mem54#1.offset, main_#t~mem55#1.base, main_#t~mem55#1.offset, main_#t~mem56#1.base, main_#t~mem56#1.offset, main_#t~mem57#1, main_#t~post58#1, main_#t~mem59#1.base, main_#t~mem59#1.offset, main_#t~mem60#1, main_#t~mem61#1.base, main_#t~mem61#1.offset, main_#t~mem62#1.base, main_#t~mem62#1.offset, main_#t~mem63#1, main_#t~post64#1, main_#t~mem65#1.base, main_#t~mem65#1.offset, main_#t~mem66#1.base, main_#t~mem66#1.offset, main_#t~mem67#1.base, main_#t~mem67#1.offset, main_#t~mem69#1, main_#t~mem68#1, main_#t~mem70#1.base, main_#t~mem70#1.offset, main_#t~mem71#1, main_#t~short72#1, main_#t~mem73#1.base, main_#t~mem73#1.offset, main_#t~mem74#1, main_#t~malloc75#1.base, main_#t~malloc75#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~mem79#1, main_#t~memset~res80#1.base, main_#t~memset~res80#1.offset, main_#t~mem81#1.base, main_#t~mem81#1.offset, main_#t~mem82#1.base, main_#t~mem82#1.offset, main_#t~mem85#1, main_#t~mem83#1.base, main_#t~mem83#1.offset, main_#t~mem84#1, main_#t~mem86#1.base, main_#t~mem86#1.offset, main_#t~mem89#1, main_#t~mem87#1.base, main_#t~mem87#1.offset, main_#t~mem88#1, main_#t~ite90#1, main_#t~mem91#1.base, main_#t~mem91#1.offset, main_#t~mem95#1.base, main_#t~mem95#1.offset, main_#t~mem96#1.base, main_#t~mem96#1.offset, main_#t~mem97#1.base, main_#t~mem97#1.offset, main_#t~mem98#1.base, main_#t~mem98#1.offset, main_#t~mem101#1, main_#t~mem99#1.base, main_#t~mem99#1.offset, main_#t~mem100#1, main_#t~mem102#1.base, main_#t~mem102#1.offset, main_#t~mem103#1, main_#t~pre104#1, main_#t~mem105#1.base, main_#t~mem105#1.offset, main_#t~mem106#1, main_#t~mem107#1.base, main_#t~mem107#1.offset, main_#t~mem108#1, main_#t~post109#1, main_#t~mem113#1, main_#t~mem111#1, main_#t~mem110#1.base, main_#t~mem110#1.offset, main_#t~mem112#1, main_#t~mem114#1, main_#t~post115#1, main_#t~mem116#1.base, main_#t~mem116#1.offset, main_#t~mem117#1.base, main_#t~mem117#1.offset, main_#t~mem118#1.base, main_#t~mem118#1.offset, main_#t~post92#1, main_#t~mem93#1.base, main_#t~mem93#1.offset, main_#t~mem94#1, main_#t~mem119#1.base, main_#t~mem119#1.offset, main_#t~mem120#1.base, main_#t~mem120#1.offset, main_#t~mem121#1.base, main_#t~mem121#1.offset, main_#t~mem122#1, main_#t~mem123#1.base, main_#t~mem123#1.offset, main_#t~mem124#1, main_#t~post125#1, main_#t~mem126#1.base, main_#t~mem126#1.offset, main_#t~mem127#1.base, main_#t~mem127#1.offset, main_#t~mem128#1.base, main_#t~mem128#1.offset, main_#t~mem129#1.base, main_#t~mem129#1.offset, main_#t~mem132#1, main_#t~mem130#1.base, main_#t~mem130#1.offset, main_#t~mem131#1, main_#t~ite135#1, main_#t~mem133#1.base, main_#t~mem133#1.offset, main_#t~mem134#1, main_#t~mem136#1.base, main_#t~mem136#1.offset, main_#t~mem137#1, main_#t~mem138#1.base, main_#t~mem138#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~post5#1, main_#t~mem140#1, main_#t~mem141#1, main_#t~mem139#1.base, main_#t~mem139#1.offset, main_~i~0#1, main_~user~0#1.base, main_~user~0#1.offset, main_~users~0#1.base, main_~users~0#1.offset;havoc main_~i~0#1;havoc main_~user~0#1.base, main_~user~0#1.offset;main_~users~0#1.base, main_~users~0#1.offset := 0, 0;main_~i~0#1 := 0; {4485#(<= 0 |ULTIMATE.start_main_~i~0#1|)} is VALID [2022-02-21 03:13:17,106 INFO L290 TraceCheckUtils]: 2: Hoare triple {4485#(<= 0 |ULTIMATE.start_main_~i~0#1|)} assume !!(main_~i~0#1 < 10);call main_#t~malloc6#1.base, main_#t~malloc6#1.offset := #Ultimate.allocOnHeap(40);main_~user~0#1.base, main_~user~0#1.offset := main_#t~malloc6#1.base, main_#t~malloc6#1.offset;havoc main_#t~malloc6#1.base, main_#t~malloc6#1.offset; {4485#(<= 0 |ULTIMATE.start_main_~i~0#1|)} is VALID [2022-02-21 03:13:17,106 INFO L290 TraceCheckUtils]: 3: Hoare triple {4485#(<= 0 |ULTIMATE.start_main_~i~0#1|)} assume !(main_~user~0#1.base == 0 && main_~user~0#1.offset == 0); {4485#(<= 0 |ULTIMATE.start_main_~i~0#1|)} is VALID [2022-02-21 03:13:17,113 INFO L290 TraceCheckUtils]: 4: Hoare triple {4485#(<= 0 |ULTIMATE.start_main_~i~0#1|)} call write~int(main_~i~0#1, main_~user~0#1.base, main_~user~0#1.offset, 4); {4485#(<= 0 |ULTIMATE.start_main_~i~0#1|)} is VALID [2022-02-21 03:13:17,113 INFO L290 TraceCheckUtils]: 5: Hoare triple {4485#(<= 0 |ULTIMATE.start_main_~i~0#1|)} assume main_~i~0#1 * main_~i~0#1 <= 2147483647; {4485#(<= 0 |ULTIMATE.start_main_~i~0#1|)} is VALID [2022-02-21 03:13:17,113 INFO L290 TraceCheckUtils]: 6: Hoare triple {4485#(<= 0 |ULTIMATE.start_main_~i~0#1|)} assume main_~i~0#1 * main_~i~0#1 >= -2147483648;call write~int(main_~i~0#1 * main_~i~0#1, main_~user~0#1.base, 4 + main_~user~0#1.offset, 4); {4485#(<= 0 |ULTIMATE.start_main_~i~0#1|)} is VALID [2022-02-21 03:13:17,114 INFO L290 TraceCheckUtils]: 7: Hoare triple {4485#(<= 0 |ULTIMATE.start_main_~i~0#1|)} havoc main_~_ha_hashv~0#1; {4485#(<= 0 |ULTIMATE.start_main_~i~0#1|)} is VALID [2022-02-21 03:13:17,114 INFO L290 TraceCheckUtils]: 8: Hoare triple {4485#(<= 0 |ULTIMATE.start_main_~i~0#1|)} goto; {4485#(<= 0 |ULTIMATE.start_main_~i~0#1|)} is VALID [2022-02-21 03:13:17,114 INFO L290 TraceCheckUtils]: 9: Hoare triple {4485#(<= 0 |ULTIMATE.start_main_~i~0#1|)} 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; {4485#(<= 0 |ULTIMATE.start_main_~i~0#1|)} is VALID [2022-02-21 03:13:17,114 INFO L290 TraceCheckUtils]: 10: Hoare triple {4485#(<= 0 |ULTIMATE.start_main_~i~0#1|)} assume !(main_~_hj_k~0#1 % 4294967296 >= 12); {4485#(<= 0 |ULTIMATE.start_main_~i~0#1|)} is VALID [2022-02-21 03:13:17,115 INFO L290 TraceCheckUtils]: 11: Hoare triple {4485#(<= 0 |ULTIMATE.start_main_~i~0#1|)} main_~_ha_hashv~0#1 := 4 + main_~_ha_hashv~0#1;main_#t~switch19#1 := 11 == main_~_hj_k~0#1; {4485#(<= 0 |ULTIMATE.start_main_~i~0#1|)} is VALID [2022-02-21 03:13:17,115 INFO L290 TraceCheckUtils]: 12: Hoare triple {4485#(<= 0 |ULTIMATE.start_main_~i~0#1|)} assume !main_#t~switch19#1; {4485#(<= 0 |ULTIMATE.start_main_~i~0#1|)} is VALID [2022-02-21 03:13:17,116 INFO L290 TraceCheckUtils]: 13: Hoare triple {4485#(<= 0 |ULTIMATE.start_main_~i~0#1|)} main_#t~switch19#1 := main_#t~switch19#1 || 10 == main_~_hj_k~0#1; {4485#(<= 0 |ULTIMATE.start_main_~i~0#1|)} is VALID [2022-02-21 03:13:17,118 INFO L290 TraceCheckUtils]: 14: Hoare triple {4485#(<= 0 |ULTIMATE.start_main_~i~0#1|)} assume !main_#t~switch19#1; {4485#(<= 0 |ULTIMATE.start_main_~i~0#1|)} is VALID [2022-02-21 03:13:17,119 INFO L290 TraceCheckUtils]: 15: Hoare triple {4485#(<= 0 |ULTIMATE.start_main_~i~0#1|)} main_#t~switch19#1 := main_#t~switch19#1 || 9 == main_~_hj_k~0#1; {4485#(<= 0 |ULTIMATE.start_main_~i~0#1|)} is VALID [2022-02-21 03:13:17,119 INFO L290 TraceCheckUtils]: 16: Hoare triple {4485#(<= 0 |ULTIMATE.start_main_~i~0#1|)} assume !main_#t~switch19#1; {4485#(<= 0 |ULTIMATE.start_main_~i~0#1|)} is VALID [2022-02-21 03:13:17,119 INFO L290 TraceCheckUtils]: 17: Hoare triple {4485#(<= 0 |ULTIMATE.start_main_~i~0#1|)} main_#t~switch19#1 := main_#t~switch19#1 || 8 == main_~_hj_k~0#1; {4485#(<= 0 |ULTIMATE.start_main_~i~0#1|)} is VALID [2022-02-21 03:13:17,120 INFO L290 TraceCheckUtils]: 18: Hoare triple {4485#(<= 0 |ULTIMATE.start_main_~i~0#1|)} assume !main_#t~switch19#1; {4485#(<= 0 |ULTIMATE.start_main_~i~0#1|)} is VALID [2022-02-21 03:13:17,120 INFO L290 TraceCheckUtils]: 19: Hoare triple {4485#(<= 0 |ULTIMATE.start_main_~i~0#1|)} main_#t~switch19#1 := main_#t~switch19#1 || 7 == main_~_hj_k~0#1; {4485#(<= 0 |ULTIMATE.start_main_~i~0#1|)} is VALID [2022-02-21 03:13:17,121 INFO L290 TraceCheckUtils]: 20: Hoare triple {4485#(<= 0 |ULTIMATE.start_main_~i~0#1|)} assume !main_#t~switch19#1; {4485#(<= 0 |ULTIMATE.start_main_~i~0#1|)} is VALID [2022-02-21 03:13:17,121 INFO L290 TraceCheckUtils]: 21: Hoare triple {4485#(<= 0 |ULTIMATE.start_main_~i~0#1|)} main_#t~switch19#1 := main_#t~switch19#1 || 6 == main_~_hj_k~0#1; {4485#(<= 0 |ULTIMATE.start_main_~i~0#1|)} is VALID [2022-02-21 03:13:17,121 INFO L290 TraceCheckUtils]: 22: Hoare triple {4485#(<= 0 |ULTIMATE.start_main_~i~0#1|)} assume !main_#t~switch19#1; {4485#(<= 0 |ULTIMATE.start_main_~i~0#1|)} is VALID [2022-02-21 03:13:17,122 INFO L290 TraceCheckUtils]: 23: Hoare triple {4485#(<= 0 |ULTIMATE.start_main_~i~0#1|)} main_#t~switch19#1 := main_#t~switch19#1 || 5 == main_~_hj_k~0#1; {4485#(<= 0 |ULTIMATE.start_main_~i~0#1|)} is VALID [2022-02-21 03:13:17,122 INFO L290 TraceCheckUtils]: 24: Hoare triple {4485#(<= 0 |ULTIMATE.start_main_~i~0#1|)} assume !main_#t~switch19#1; {4485#(<= 0 |ULTIMATE.start_main_~i~0#1|)} is VALID [2022-02-21 03:13:17,123 INFO L290 TraceCheckUtils]: 25: Hoare triple {4485#(<= 0 |ULTIMATE.start_main_~i~0#1|)} main_#t~switch19#1 := main_#t~switch19#1 || 4 == main_~_hj_k~0#1; {4485#(<= 0 |ULTIMATE.start_main_~i~0#1|)} is VALID [2022-02-21 03:13:17,123 INFO L290 TraceCheckUtils]: 26: Hoare triple {4485#(<= 0 |ULTIMATE.start_main_~i~0#1|)} assume main_#t~switch19#1;call main_#t~mem27#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~mem27#1 % 256);havoc main_#t~mem27#1; {4485#(<= 0 |ULTIMATE.start_main_~i~0#1|)} is VALID [2022-02-21 03:13:17,123 INFO L290 TraceCheckUtils]: 27: Hoare triple {4485#(<= 0 |ULTIMATE.start_main_~i~0#1|)} main_#t~switch19#1 := main_#t~switch19#1 || 3 == main_~_hj_k~0#1; {4485#(<= 0 |ULTIMATE.start_main_~i~0#1|)} is VALID [2022-02-21 03:13:17,123 INFO L290 TraceCheckUtils]: 28: Hoare triple {4485#(<= 0 |ULTIMATE.start_main_~i~0#1|)} assume main_#t~switch19#1;call main_#t~mem28#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~mem28#1 % 256);havoc main_#t~mem28#1; {4485#(<= 0 |ULTIMATE.start_main_~i~0#1|)} is VALID [2022-02-21 03:13:17,124 INFO L290 TraceCheckUtils]: 29: Hoare triple {4485#(<= 0 |ULTIMATE.start_main_~i~0#1|)} main_#t~switch19#1 := main_#t~switch19#1 || 2 == main_~_hj_k~0#1; {4485#(<= 0 |ULTIMATE.start_main_~i~0#1|)} is VALID [2022-02-21 03:13:17,124 INFO L290 TraceCheckUtils]: 30: Hoare triple {4485#(<= 0 |ULTIMATE.start_main_~i~0#1|)} assume main_#t~switch19#1;call main_#t~mem29#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~mem29#1 % 256);havoc main_#t~mem29#1; {4485#(<= 0 |ULTIMATE.start_main_~i~0#1|)} is VALID [2022-02-21 03:13:17,127 INFO L290 TraceCheckUtils]: 31: Hoare triple {4485#(<= 0 |ULTIMATE.start_main_~i~0#1|)} main_#t~switch19#1 := main_#t~switch19#1 || 1 == main_~_hj_k~0#1; {4485#(<= 0 |ULTIMATE.start_main_~i~0#1|)} is VALID [2022-02-21 03:13:17,128 INFO L290 TraceCheckUtils]: 32: Hoare triple {4485#(<= 0 |ULTIMATE.start_main_~i~0#1|)} assume main_#t~switch19#1;call main_#t~mem30#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~mem30#1 % 256;havoc main_#t~mem30#1; {4485#(<= 0 |ULTIMATE.start_main_~i~0#1|)} is VALID [2022-02-21 03:13:17,128 INFO L290 TraceCheckUtils]: 33: Hoare triple {4485#(<= 0 |ULTIMATE.start_main_~i~0#1|)} havoc main_#t~switch19#1; {4485#(<= 0 |ULTIMATE.start_main_~i~0#1|)} is VALID [2022-02-21 03:13:17,128 INFO L290 TraceCheckUtils]: 34: Hoare triple {4485#(<= 0 |ULTIMATE.start_main_~i~0#1|)} 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)))); {4485#(<= 0 |ULTIMATE.start_main_~i~0#1|)} is VALID [2022-02-21 03:13:17,128 INFO L290 TraceCheckUtils]: 35: Hoare triple {4485#(<= 0 |ULTIMATE.start_main_~i~0#1|)} goto; {4485#(<= 0 |ULTIMATE.start_main_~i~0#1|)} is VALID [2022-02-21 03:13:17,129 INFO L290 TraceCheckUtils]: 36: Hoare triple {4485#(<= 0 |ULTIMATE.start_main_~i~0#1|)} goto; {4485#(<= 0 |ULTIMATE.start_main_~i~0#1|)} is VALID [2022-02-21 03:13:17,129 INFO L290 TraceCheckUtils]: 37: Hoare triple {4485#(<= 0 |ULTIMATE.start_main_~i~0#1|)} goto; {4485#(<= 0 |ULTIMATE.start_main_~i~0#1|)} is VALID [2022-02-21 03:13:17,129 INFO L290 TraceCheckUtils]: 38: Hoare triple {4485#(<= 0 |ULTIMATE.start_main_~i~0#1|)} 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); {4485#(<= 0 |ULTIMATE.start_main_~i~0#1|)} is VALID [2022-02-21 03:13:17,130 INFO L290 TraceCheckUtils]: 39: Hoare triple {4485#(<= 0 |ULTIMATE.start_main_~i~0#1|)} assume !(main_~users~0#1.base == 0 && main_~users~0#1.offset == 0);call main_#t~mem48#1.base, main_#t~mem48#1.offset := read~$Pointer$(main_~users~0#1.base, 8 + main_~users~0#1.offset, 4);call write~$Pointer$(main_#t~mem48#1.base, main_#t~mem48#1.offset, main_~user~0#1.base, 8 + main_~user~0#1.offset, 4);havoc main_#t~mem48#1.base, main_#t~mem48#1.offset; {4485#(<= 0 |ULTIMATE.start_main_~i~0#1|)} is VALID [2022-02-21 03:13:17,130 INFO L290 TraceCheckUtils]: 40: Hoare triple {4485#(<= 0 |ULTIMATE.start_main_~i~0#1|)} call write~$Pointer$(0, 0, main_~user~0#1.base, 16 + main_~user~0#1.offset, 4);call main_#t~mem49#1.base, main_#t~mem49#1.offset := read~$Pointer$(main_~users~0#1.base, 8 + main_~users~0#1.offset, 4);call main_#t~mem50#1.base, main_#t~mem50#1.offset := read~$Pointer$(main_#t~mem49#1.base, 16 + main_#t~mem49#1.offset, 4);call main_#t~mem51#1.base, main_#t~mem51#1.offset := read~$Pointer$(main_~users~0#1.base, 8 + main_~users~0#1.offset, 4);call main_#t~mem52#1 := read~int(main_#t~mem51#1.base, 20 + main_#t~mem51#1.offset, 4);call write~$Pointer$(main_#t~mem50#1.base, main_#t~mem50#1.offset - main_#t~mem52#1, main_~user~0#1.base, 12 + main_~user~0#1.offset, 4);havoc main_#t~mem49#1.base, main_#t~mem49#1.offset;havoc main_#t~mem50#1.base, main_#t~mem50#1.offset;havoc main_#t~mem51#1.base, main_#t~mem51#1.offset;havoc main_#t~mem52#1;call main_#t~mem53#1.base, main_#t~mem53#1.offset := read~$Pointer$(main_~users~0#1.base, 8 + main_~users~0#1.offset, 4);call main_#t~mem54#1.base, main_#t~mem54#1.offset := read~$Pointer$(main_#t~mem53#1.base, 16 + main_#t~mem53#1.offset, 4);call write~$Pointer$(main_~user~0#1.base, main_~user~0#1.offset, main_#t~mem54#1.base, 8 + main_#t~mem54#1.offset, 4);havoc main_#t~mem53#1.base, main_#t~mem53#1.offset;havoc main_#t~mem54#1.base, main_#t~mem54#1.offset;call main_#t~mem55#1.base, main_#t~mem55#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~mem55#1.base, 16 + main_#t~mem55#1.offset, 4);havoc main_#t~mem55#1.base, main_#t~mem55#1.offset; {4485#(<= 0 |ULTIMATE.start_main_~i~0#1|)} is VALID [2022-02-21 03:13:17,130 INFO L290 TraceCheckUtils]: 41: Hoare triple {4485#(<= 0 |ULTIMATE.start_main_~i~0#1|)} goto; {4485#(<= 0 |ULTIMATE.start_main_~i~0#1|)} is VALID [2022-02-21 03:13:17,130 INFO L290 TraceCheckUtils]: 42: Hoare triple {4485#(<= 0 |ULTIMATE.start_main_~i~0#1|)} havoc main_~_ha_bkt~0#1;call main_#t~mem56#1.base, main_#t~mem56#1.offset := read~$Pointer$(main_~users~0#1.base, 8 + main_~users~0#1.offset, 4);call main_#t~mem57#1 := read~int(main_#t~mem56#1.base, 12 + main_#t~mem56#1.offset, 4);main_#t~post58#1 := main_#t~mem57#1;call write~int(1 + main_#t~post58#1, main_#t~mem56#1.base, 12 + main_#t~mem56#1.offset, 4);havoc main_#t~mem56#1.base, main_#t~mem56#1.offset;havoc main_#t~mem57#1;havoc main_#t~post58#1; {4485#(<= 0 |ULTIMATE.start_main_~i~0#1|)} is VALID [2022-02-21 03:13:17,131 INFO L290 TraceCheckUtils]: 43: Hoare triple {4485#(<= 0 |ULTIMATE.start_main_~i~0#1|)} call main_#t~mem59#1.base, main_#t~mem59#1.offset := read~$Pointer$(main_~users~0#1.base, 8 + main_~users~0#1.offset, 4);call main_#t~mem60#1 := read~int(main_#t~mem59#1.base, 4 + main_#t~mem59#1.offset, 4);main_~_ha_bkt~0#1 := (if 0 == main_~_ha_hashv~0#1 || 0 == main_#t~mem60#1 - 1 then 0 else (if 1 == main_#t~mem60#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~mem60#1 - 1))) else (if 1 == main_~_ha_hashv~0#1 then (if 1 == main_#t~mem60#1 - 1 || 0 == main_#t~mem60#1 - 1 then main_#t~mem60#1 - 1 else (if main_#t~mem60#1 - 1 >= 0 then (main_#t~mem60#1 - 1) % 2 else ~bitwiseAnd(main_~_ha_hashv~0#1, main_#t~mem60#1 - 1))) else ~bitwiseAnd(main_~_ha_hashv~0#1, main_#t~mem60#1 - 1))));havoc main_#t~mem59#1.base, main_#t~mem59#1.offset;havoc main_#t~mem60#1; {4485#(<= 0 |ULTIMATE.start_main_~i~0#1|)} is VALID [2022-02-21 03:13:17,131 INFO L290 TraceCheckUtils]: 44: Hoare triple {4485#(<= 0 |ULTIMATE.start_main_~i~0#1|)} goto; {4485#(<= 0 |ULTIMATE.start_main_~i~0#1|)} is VALID [2022-02-21 03:13:17,131 INFO L290 TraceCheckUtils]: 45: Hoare triple {4485#(<= 0 |ULTIMATE.start_main_~i~0#1|)} call main_#t~mem61#1.base, main_#t~mem61#1.offset := read~$Pointer$(main_~users~0#1.base, 8 + main_~users~0#1.offset, 4);call main_#t~mem62#1.base, main_#t~mem62#1.offset := read~$Pointer$(main_#t~mem61#1.base, main_#t~mem61#1.offset, 4);main_~_ha_head~0#1.base, main_~_ha_head~0#1.offset := main_#t~mem62#1.base, main_#t~mem62#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~mem61#1.base, main_#t~mem61#1.offset;havoc main_#t~mem62#1.base, main_#t~mem62#1.offset;call main_#t~mem63#1 := read~int(main_~_ha_head~0#1.base, 4 + main_~_ha_head~0#1.offset, 4);main_#t~post64#1 := main_#t~mem63#1;call write~int(1 + main_#t~post64#1, main_~_ha_head~0#1.base, 4 + main_~_ha_head~0#1.offset, 4);havoc main_#t~mem63#1;havoc main_#t~post64#1;call main_#t~mem65#1.base, main_#t~mem65#1.offset := read~$Pointer$(main_~_ha_head~0#1.base, main_~_ha_head~0#1.offset, 4);call write~$Pointer$(main_#t~mem65#1.base, main_#t~mem65#1.offset, main_~user~0#1.base, 24 + main_~user~0#1.offset, 4);havoc main_#t~mem65#1.base, main_#t~mem65#1.offset;call write~$Pointer$(0, 0, main_~user~0#1.base, 20 + main_~user~0#1.offset, 4);call main_#t~mem66#1.base, main_#t~mem66#1.offset := read~$Pointer$(main_~_ha_head~0#1.base, main_~_ha_head~0#1.offset, 4); {4485#(<= 0 |ULTIMATE.start_main_~i~0#1|)} is VALID [2022-02-21 03:13:17,143 INFO L290 TraceCheckUtils]: 46: Hoare triple {4485#(<= 0 |ULTIMATE.start_main_~i~0#1|)} assume main_#t~mem66#1.base != 0 || main_#t~mem66#1.offset != 0;havoc main_#t~mem66#1.base, main_#t~mem66#1.offset;call main_#t~mem67#1.base, main_#t~mem67#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~mem67#1.base, 12 + main_#t~mem67#1.offset, 4);havoc main_#t~mem67#1.base, main_#t~mem67#1.offset; {4485#(<= 0 |ULTIMATE.start_main_~i~0#1|)} is VALID [2022-02-21 03:13:17,143 INFO L290 TraceCheckUtils]: 47: Hoare triple {4485#(<= 0 |ULTIMATE.start_main_~i~0#1|)} 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~mem69#1 := read~int(main_~_ha_head~0#1.base, 4 + main_~_ha_head~0#1.offset, 4);call main_#t~mem68#1 := read~int(main_~_ha_head~0#1.base, 8 + main_~_ha_head~0#1.offset, 4);main_#t~short72#1 := main_#t~mem69#1 % 4294967296 >= 10 * (1 + main_#t~mem68#1) % 4294967296; {4485#(<= 0 |ULTIMATE.start_main_~i~0#1|)} is VALID [2022-02-21 03:13:17,144 INFO L290 TraceCheckUtils]: 48: Hoare triple {4485#(<= 0 |ULTIMATE.start_main_~i~0#1|)} assume main_#t~short72#1;call main_#t~mem70#1.base, main_#t~mem70#1.offset := read~$Pointer$(main_~user~0#1.base, 8 + main_~user~0#1.offset, 4);call main_#t~mem71#1 := read~int(main_#t~mem70#1.base, 36 + main_#t~mem70#1.offset, 4);main_#t~short72#1 := 0 == main_#t~mem71#1 % 4294967296; {4485#(<= 0 |ULTIMATE.start_main_~i~0#1|)} is VALID [2022-02-21 03:13:17,144 INFO L290 TraceCheckUtils]: 49: Hoare triple {4485#(<= 0 |ULTIMATE.start_main_~i~0#1|)} assume !main_#t~short72#1;havoc main_#t~mem69#1;havoc main_#t~mem68#1;havoc main_#t~mem70#1.base, main_#t~mem70#1.offset;havoc main_#t~mem71#1;havoc main_#t~short72#1; {4485#(<= 0 |ULTIMATE.start_main_~i~0#1|)} is VALID [2022-02-21 03:13:17,144 INFO L290 TraceCheckUtils]: 50: Hoare triple {4485#(<= 0 |ULTIMATE.start_main_~i~0#1|)} goto; {4485#(<= 0 |ULTIMATE.start_main_~i~0#1|)} is VALID [2022-02-21 03:13:17,145 INFO L290 TraceCheckUtils]: 51: Hoare triple {4485#(<= 0 |ULTIMATE.start_main_~i~0#1|)} goto; {4485#(<= 0 |ULTIMATE.start_main_~i~0#1|)} is VALID [2022-02-21 03:13:17,145 INFO L290 TraceCheckUtils]: 52: Hoare triple {4485#(<= 0 |ULTIMATE.start_main_~i~0#1|)} goto; {4485#(<= 0 |ULTIMATE.start_main_~i~0#1|)} is VALID [2022-02-21 03:13:17,145 INFO L290 TraceCheckUtils]: 53: Hoare triple {4485#(<= 0 |ULTIMATE.start_main_~i~0#1|)} goto; {4485#(<= 0 |ULTIMATE.start_main_~i~0#1|)} is VALID [2022-02-21 03:13:17,146 INFO L290 TraceCheckUtils]: 54: Hoare triple {4485#(<= 0 |ULTIMATE.start_main_~i~0#1|)} main_#t~post5#1 := main_~i~0#1; {4645#(<= 0 |ULTIMATE.start_main_#t~post5#1|)} is VALID [2022-02-21 03:13:17,150 INFO L290 TraceCheckUtils]: 55: Hoare triple {4645#(<= 0 |ULTIMATE.start_main_#t~post5#1|)} assume 1 + main_#t~post5#1 <= 2147483647; {4645#(<= 0 |ULTIMATE.start_main_#t~post5#1|)} is VALID [2022-02-21 03:13:17,151 INFO L290 TraceCheckUtils]: 56: Hoare triple {4645#(<= 0 |ULTIMATE.start_main_#t~post5#1|)} assume !(1 + main_#t~post5#1 >= -2147483648); {4478#false} is VALID [2022-02-21 03:13:17,151 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:13:17,152 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-21 03:13:17,152 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 03:13:17,152 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [288706140] [2022-02-21 03:13:17,152 WARN L317 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-02-21 03:13:17,152 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1416061340] [2022-02-21 03:13:17,153 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1416061340] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-21 03:13:17,153 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-21 03:13:17,153 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-21 03:13:17,153 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [594386688] [2022-02-21 03:13:17,153 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-21 03:13:17,153 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 19.0) internal successors, (57), 4 states have internal predecessors, (57), 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 57 [2022-02-21 03:13:17,154 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-21 03:13:17,154 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 4 states, 3 states have (on average 19.0) internal successors, (57), 4 states have internal predecessors, (57), 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:13:17,194 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 57 edges. 57 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:13:17,194 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-02-21 03:13:17,194 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 03:13:17,195 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-02-21 03:13:17,195 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-02-21 03:13:17,195 INFO L87 Difference]: Start difference. First operand 235 states and 295 transitions. Second operand has 4 states, 3 states have (on average 19.0) internal successors, (57), 4 states have internal predecessors, (57), 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:13:17,587 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:13:17,588 INFO L93 Difference]: Finished difference Result 235 states and 295 transitions. [2022-02-21 03:13:17,588 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-02-21 03:13:17,588 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 19.0) internal successors, (57), 4 states have internal predecessors, (57), 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 57 [2022-02-21 03:13:17,588 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-21 03:13:17,588 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 3 states have (on average 19.0) internal successors, (57), 4 states have internal predecessors, (57), 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:13:17,590 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 173 transitions. [2022-02-21 03:13:17,590 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 3 states have (on average 19.0) internal successors, (57), 4 states have internal predecessors, (57), 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:13:17,591 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 173 transitions. [2022-02-21 03:13:17,591 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 173 transitions. [2022-02-21 03:13:17,718 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 173 edges. 173 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:13:17,721 INFO L225 Difference]: With dead ends: 235 [2022-02-21 03:13:17,721 INFO L226 Difference]: Without dead ends: 234 [2022-02-21 03:13:17,721 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 54 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:13:17,722 INFO L933 BasicCegarLoop]: 162 mSDtfsCounter, 85 mSDsluCounter, 182 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 98 SdHoareTripleChecker+Valid, 344 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-21 03:13:17,722 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [98 Valid, 344 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-21 03:13:17,722 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 234 states. [2022-02-21 03:13:17,784 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 234 to 234. [2022-02-21 03:13:17,784 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 03:13:17,785 INFO L82 GeneralOperation]: Start isEquivalent. First operand 234 states. Second operand has 234 states, 212 states have (on average 1.2358490566037736) internal successors, (262), 225 states have internal predecessors, (262), 16 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 7 states have call predecessors, (16), 16 states have call successors, (16) [2022-02-21 03:13:17,785 INFO L74 IsIncluded]: Start isIncluded. First operand 234 states. Second operand has 234 states, 212 states have (on average 1.2358490566037736) internal successors, (262), 225 states have internal predecessors, (262), 16 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 7 states have call predecessors, (16), 16 states have call successors, (16) [2022-02-21 03:13:17,786 INFO L87 Difference]: Start difference. First operand 234 states. Second operand has 234 states, 212 states have (on average 1.2358490566037736) internal successors, (262), 225 states have internal predecessors, (262), 16 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 7 states have call predecessors, (16), 16 states have call successors, (16) [2022-02-21 03:13:17,789 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:13:17,789 INFO L93 Difference]: Finished difference Result 234 states and 294 transitions. [2022-02-21 03:13:17,790 INFO L276 IsEmpty]: Start isEmpty. Operand 234 states and 294 transitions. [2022-02-21 03:13:17,790 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:13:17,790 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:13:17,791 INFO L74 IsIncluded]: Start isIncluded. First operand has 234 states, 212 states have (on average 1.2358490566037736) internal successors, (262), 225 states have internal predecessors, (262), 16 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 7 states have call predecessors, (16), 16 states have call successors, (16) Second operand 234 states. [2022-02-21 03:13:17,791 INFO L87 Difference]: Start difference. First operand has 234 states, 212 states have (on average 1.2358490566037736) internal successors, (262), 225 states have internal predecessors, (262), 16 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 7 states have call predecessors, (16), 16 states have call successors, (16) Second operand 234 states. [2022-02-21 03:13:17,794 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:13:17,794 INFO L93 Difference]: Finished difference Result 234 states and 294 transitions. [2022-02-21 03:13:17,795 INFO L276 IsEmpty]: Start isEmpty. Operand 234 states and 294 transitions. [2022-02-21 03:13:17,795 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:13:17,795 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:13:17,795 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 03:13:17,795 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 03:13:17,796 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 234 states, 212 states have (on average 1.2358490566037736) internal successors, (262), 225 states have internal predecessors, (262), 16 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 7 states have call predecessors, (16), 16 states have call successors, (16) [2022-02-21 03:13:17,800 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 234 states to 234 states and 294 transitions. [2022-02-21 03:13:17,800 INFO L78 Accepts]: Start accepts. Automaton has 234 states and 294 transitions. Word has length 57 [2022-02-21 03:13:17,800 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-21 03:13:17,802 INFO L470 AbstractCegarLoop]: Abstraction has 234 states and 294 transitions. [2022-02-21 03:13:17,802 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 19.0) internal successors, (57), 4 states have internal predecessors, (57), 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:13:17,802 INFO L276 IsEmpty]: Start isEmpty. Operand 234 states and 294 transitions. [2022-02-21 03:13:17,803 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2022-02-21 03:13:17,803 INFO L506 BasicCegarLoop]: Found error trace [2022-02-21 03:13:17,803 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, 1, 1, 1] [2022-02-21 03:13:17,829 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:13:18,026 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:13:18,026 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2022-02-21 03:13:18,027 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:13:18,027 INFO L85 PathProgramCache]: Analyzing trace with hash 1237589276, now seen corresponding path program 1 times [2022-02-21 03:13:18,027 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:13:18,027 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [833257857] [2022-02-21 03:13:18,027 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:13:18,027 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:13:18,125 ERROR L252 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-02-21 03:13:18,125 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [416622836] [2022-02-21 03:13:18,125 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:13:18,126 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-21 03:13:18,126 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:13:18,128 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:13:18,133 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:13:18,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:13:18,745 INFO L263 TraceCheckSpWp]: Trace formula consists of 1529 conjuncts, 4 conjunts are in the unsatisfiable core [2022-02-21 03:13:18,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:13:18,769 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 03:13:19,021 INFO L290 TraceCheckUtils]: 0: Hoare triple {5688#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);~count_int_int~0 := 0; {5688#true} is VALID [2022-02-21 03:13:19,022 INFO L290 TraceCheckUtils]: 1: Hoare triple {5688#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc6#1.base, main_#t~malloc6#1.offset, main_#t~mem8#1, main_#t~mem7#1, main_#t~mem9#1, main_#t~mem10#1, main_#t~mem12#1, main_#t~mem11#1, main_#t~mem13#1, main_#t~mem14#1, main_#t~mem16#1, main_#t~mem15#1, main_#t~mem17#1, main_#t~mem18#1, main_#t~switch19#1, main_#t~mem20#1, main_#t~mem21#1, main_#t~mem22#1, main_#t~mem23#1, main_#t~mem24#1, main_#t~mem25#1, main_#t~mem26#1, main_#t~mem27#1, main_#t~mem28#1, main_#t~mem29#1, main_#t~mem30#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~malloc31#1.base, main_#t~malloc31#1.offset, main_#t~mem32#1.base, main_#t~mem32#1.offset, main_#t~mem33#1.base, main_#t~mem33#1.offset, main_#t~memset~res34#1.base, main_#t~memset~res34#1.offset, main_#t~mem35#1.base, main_#t~mem35#1.offset, main_#t~mem36#1.base, main_#t~mem36#1.offset, main_#t~mem37#1.base, main_#t~mem37#1.offset, main_#t~mem38#1.base, main_#t~mem38#1.offset, main_#t~mem39#1.base, main_#t~mem39#1.offset, main_#t~malloc40#1.base, main_#t~malloc40#1.offset, main_#t~mem41#1.base, main_#t~mem41#1.offset, main_#t~mem42#1.base, main_#t~mem42#1.offset, main_#t~mem43#1.base, main_#t~mem43#1.offset, main_#t~mem44#1.base, main_#t~mem44#1.offset, main_#t~mem45#1.base, main_#t~mem45#1.offset, main_#t~mem46#1.base, main_#t~mem46#1.offset, main_#t~memset~res47#1.base, main_#t~memset~res47#1.offset, main_#t~mem48#1.base, main_#t~mem48#1.offset, main_#t~mem49#1.base, main_#t~mem49#1.offset, main_#t~mem50#1.base, main_#t~mem50#1.offset, main_#t~mem51#1.base, main_#t~mem51#1.offset, main_#t~mem52#1, main_#t~mem53#1.base, main_#t~mem53#1.offset, main_#t~mem54#1.base, main_#t~mem54#1.offset, main_#t~mem55#1.base, main_#t~mem55#1.offset, main_#t~mem56#1.base, main_#t~mem56#1.offset, main_#t~mem57#1, main_#t~post58#1, main_#t~mem59#1.base, main_#t~mem59#1.offset, main_#t~mem60#1, main_#t~mem61#1.base, main_#t~mem61#1.offset, main_#t~mem62#1.base, main_#t~mem62#1.offset, main_#t~mem63#1, main_#t~post64#1, main_#t~mem65#1.base, main_#t~mem65#1.offset, main_#t~mem66#1.base, main_#t~mem66#1.offset, main_#t~mem67#1.base, main_#t~mem67#1.offset, main_#t~mem69#1, main_#t~mem68#1, main_#t~mem70#1.base, main_#t~mem70#1.offset, main_#t~mem71#1, main_#t~short72#1, main_#t~mem73#1.base, main_#t~mem73#1.offset, main_#t~mem74#1, main_#t~malloc75#1.base, main_#t~malloc75#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~mem79#1, main_#t~memset~res80#1.base, main_#t~memset~res80#1.offset, main_#t~mem81#1.base, main_#t~mem81#1.offset, main_#t~mem82#1.base, main_#t~mem82#1.offset, main_#t~mem85#1, main_#t~mem83#1.base, main_#t~mem83#1.offset, main_#t~mem84#1, main_#t~mem86#1.base, main_#t~mem86#1.offset, main_#t~mem89#1, main_#t~mem87#1.base, main_#t~mem87#1.offset, main_#t~mem88#1, main_#t~ite90#1, main_#t~mem91#1.base, main_#t~mem91#1.offset, main_#t~mem95#1.base, main_#t~mem95#1.offset, main_#t~mem96#1.base, main_#t~mem96#1.offset, main_#t~mem97#1.base, main_#t~mem97#1.offset, main_#t~mem98#1.base, main_#t~mem98#1.offset, main_#t~mem101#1, main_#t~mem99#1.base, main_#t~mem99#1.offset, main_#t~mem100#1, main_#t~mem102#1.base, main_#t~mem102#1.offset, main_#t~mem103#1, main_#t~pre104#1, main_#t~mem105#1.base, main_#t~mem105#1.offset, main_#t~mem106#1, main_#t~mem107#1.base, main_#t~mem107#1.offset, main_#t~mem108#1, main_#t~post109#1, main_#t~mem113#1, main_#t~mem111#1, main_#t~mem110#1.base, main_#t~mem110#1.offset, main_#t~mem112#1, main_#t~mem114#1, main_#t~post115#1, main_#t~mem116#1.base, main_#t~mem116#1.offset, main_#t~mem117#1.base, main_#t~mem117#1.offset, main_#t~mem118#1.base, main_#t~mem118#1.offset, main_#t~post92#1, main_#t~mem93#1.base, main_#t~mem93#1.offset, main_#t~mem94#1, main_#t~mem119#1.base, main_#t~mem119#1.offset, main_#t~mem120#1.base, main_#t~mem120#1.offset, main_#t~mem121#1.base, main_#t~mem121#1.offset, main_#t~mem122#1, main_#t~mem123#1.base, main_#t~mem123#1.offset, main_#t~mem124#1, main_#t~post125#1, main_#t~mem126#1.base, main_#t~mem126#1.offset, main_#t~mem127#1.base, main_#t~mem127#1.offset, main_#t~mem128#1.base, main_#t~mem128#1.offset, main_#t~mem129#1.base, main_#t~mem129#1.offset, main_#t~mem132#1, main_#t~mem130#1.base, main_#t~mem130#1.offset, main_#t~mem131#1, main_#t~ite135#1, main_#t~mem133#1.base, main_#t~mem133#1.offset, main_#t~mem134#1, main_#t~mem136#1.base, main_#t~mem136#1.offset, main_#t~mem137#1, main_#t~mem138#1.base, main_#t~mem138#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~post5#1, main_#t~mem140#1, main_#t~mem141#1, main_#t~mem139#1.base, main_#t~mem139#1.offset, main_~i~0#1, main_~user~0#1.base, main_~user~0#1.offset, main_~users~0#1.base, main_~users~0#1.offset;havoc main_~i~0#1;havoc main_~user~0#1.base, main_~user~0#1.offset;main_~users~0#1.base, main_~users~0#1.offset := 0, 0;main_~i~0#1 := 0; {5696#(<= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-21 03:13:19,022 INFO L290 TraceCheckUtils]: 2: Hoare triple {5696#(<= |ULTIMATE.start_main_~i~0#1| 0)} assume !!(main_~i~0#1 < 10);call main_#t~malloc6#1.base, main_#t~malloc6#1.offset := #Ultimate.allocOnHeap(40);main_~user~0#1.base, main_~user~0#1.offset := main_#t~malloc6#1.base, main_#t~malloc6#1.offset;havoc main_#t~malloc6#1.base, main_#t~malloc6#1.offset; {5696#(<= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-21 03:13:19,023 INFO L290 TraceCheckUtils]: 3: Hoare triple {5696#(<= |ULTIMATE.start_main_~i~0#1| 0)} assume !(main_~user~0#1.base == 0 && main_~user~0#1.offset == 0); {5696#(<= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-21 03:13:19,023 INFO L290 TraceCheckUtils]: 4: Hoare triple {5696#(<= |ULTIMATE.start_main_~i~0#1| 0)} call write~int(main_~i~0#1, main_~user~0#1.base, main_~user~0#1.offset, 4); {5696#(<= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-21 03:13:19,023 INFO L290 TraceCheckUtils]: 5: Hoare triple {5696#(<= |ULTIMATE.start_main_~i~0#1| 0)} assume main_~i~0#1 * main_~i~0#1 <= 2147483647; {5696#(<= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-21 03:13:19,023 INFO L290 TraceCheckUtils]: 6: Hoare triple {5696#(<= |ULTIMATE.start_main_~i~0#1| 0)} assume main_~i~0#1 * main_~i~0#1 >= -2147483648;call write~int(main_~i~0#1 * main_~i~0#1, main_~user~0#1.base, 4 + main_~user~0#1.offset, 4); {5696#(<= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-21 03:13:19,024 INFO L290 TraceCheckUtils]: 7: Hoare triple {5696#(<= |ULTIMATE.start_main_~i~0#1| 0)} havoc main_~_ha_hashv~0#1; {5696#(<= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-21 03:13:19,024 INFO L290 TraceCheckUtils]: 8: Hoare triple {5696#(<= |ULTIMATE.start_main_~i~0#1| 0)} goto; {5696#(<= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-21 03:13:19,024 INFO L290 TraceCheckUtils]: 9: Hoare triple {5696#(<= |ULTIMATE.start_main_~i~0#1| 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; {5696#(<= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-21 03:13:19,025 INFO L290 TraceCheckUtils]: 10: Hoare triple {5696#(<= |ULTIMATE.start_main_~i~0#1| 0)} assume !(main_~_hj_k~0#1 % 4294967296 >= 12); {5696#(<= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-21 03:13:19,025 INFO L290 TraceCheckUtils]: 11: Hoare triple {5696#(<= |ULTIMATE.start_main_~i~0#1| 0)} main_~_ha_hashv~0#1 := 4 + main_~_ha_hashv~0#1;main_#t~switch19#1 := 11 == main_~_hj_k~0#1; {5696#(<= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-21 03:13:19,025 INFO L290 TraceCheckUtils]: 12: Hoare triple {5696#(<= |ULTIMATE.start_main_~i~0#1| 0)} assume !main_#t~switch19#1; {5696#(<= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-21 03:13:19,025 INFO L290 TraceCheckUtils]: 13: Hoare triple {5696#(<= |ULTIMATE.start_main_~i~0#1| 0)} main_#t~switch19#1 := main_#t~switch19#1 || 10 == main_~_hj_k~0#1; {5696#(<= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-21 03:13:19,026 INFO L290 TraceCheckUtils]: 14: Hoare triple {5696#(<= |ULTIMATE.start_main_~i~0#1| 0)} assume !main_#t~switch19#1; {5696#(<= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-21 03:13:19,026 INFO L290 TraceCheckUtils]: 15: Hoare triple {5696#(<= |ULTIMATE.start_main_~i~0#1| 0)} main_#t~switch19#1 := main_#t~switch19#1 || 9 == main_~_hj_k~0#1; {5696#(<= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-21 03:13:19,026 INFO L290 TraceCheckUtils]: 16: Hoare triple {5696#(<= |ULTIMATE.start_main_~i~0#1| 0)} assume !main_#t~switch19#1; {5696#(<= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-21 03:13:19,027 INFO L290 TraceCheckUtils]: 17: Hoare triple {5696#(<= |ULTIMATE.start_main_~i~0#1| 0)} main_#t~switch19#1 := main_#t~switch19#1 || 8 == main_~_hj_k~0#1; {5696#(<= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-21 03:13:19,027 INFO L290 TraceCheckUtils]: 18: Hoare triple {5696#(<= |ULTIMATE.start_main_~i~0#1| 0)} assume !main_#t~switch19#1; {5696#(<= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-21 03:13:19,028 INFO L290 TraceCheckUtils]: 19: Hoare triple {5696#(<= |ULTIMATE.start_main_~i~0#1| 0)} main_#t~switch19#1 := main_#t~switch19#1 || 7 == main_~_hj_k~0#1; {5696#(<= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-21 03:13:19,029 INFO L290 TraceCheckUtils]: 20: Hoare triple {5696#(<= |ULTIMATE.start_main_~i~0#1| 0)} assume !main_#t~switch19#1; {5696#(<= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-21 03:13:19,031 INFO L290 TraceCheckUtils]: 21: Hoare triple {5696#(<= |ULTIMATE.start_main_~i~0#1| 0)} main_#t~switch19#1 := main_#t~switch19#1 || 6 == main_~_hj_k~0#1; {5696#(<= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-21 03:13:19,031 INFO L290 TraceCheckUtils]: 22: Hoare triple {5696#(<= |ULTIMATE.start_main_~i~0#1| 0)} assume !main_#t~switch19#1; {5696#(<= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-21 03:13:19,032 INFO L290 TraceCheckUtils]: 23: Hoare triple {5696#(<= |ULTIMATE.start_main_~i~0#1| 0)} main_#t~switch19#1 := main_#t~switch19#1 || 5 == main_~_hj_k~0#1; {5696#(<= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-21 03:13:19,034 INFO L290 TraceCheckUtils]: 24: Hoare triple {5696#(<= |ULTIMATE.start_main_~i~0#1| 0)} assume !main_#t~switch19#1; {5696#(<= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-21 03:13:19,034 INFO L290 TraceCheckUtils]: 25: Hoare triple {5696#(<= |ULTIMATE.start_main_~i~0#1| 0)} main_#t~switch19#1 := main_#t~switch19#1 || 4 == main_~_hj_k~0#1; {5696#(<= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-21 03:13:19,035 INFO L290 TraceCheckUtils]: 26: Hoare triple {5696#(<= |ULTIMATE.start_main_~i~0#1| 0)} assume main_#t~switch19#1;call main_#t~mem27#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~mem27#1 % 256);havoc main_#t~mem27#1; {5696#(<= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-21 03:13:19,035 INFO L290 TraceCheckUtils]: 27: Hoare triple {5696#(<= |ULTIMATE.start_main_~i~0#1| 0)} main_#t~switch19#1 := main_#t~switch19#1 || 3 == main_~_hj_k~0#1; {5696#(<= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-21 03:13:19,035 INFO L290 TraceCheckUtils]: 28: Hoare triple {5696#(<= |ULTIMATE.start_main_~i~0#1| 0)} assume main_#t~switch19#1;call main_#t~mem28#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~mem28#1 % 256);havoc main_#t~mem28#1; {5696#(<= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-21 03:13:19,036 INFO L290 TraceCheckUtils]: 29: Hoare triple {5696#(<= |ULTIMATE.start_main_~i~0#1| 0)} main_#t~switch19#1 := main_#t~switch19#1 || 2 == main_~_hj_k~0#1; {5696#(<= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-21 03:13:19,036 INFO L290 TraceCheckUtils]: 30: Hoare triple {5696#(<= |ULTIMATE.start_main_~i~0#1| 0)} assume main_#t~switch19#1;call main_#t~mem29#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~mem29#1 % 256);havoc main_#t~mem29#1; {5696#(<= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-21 03:13:19,036 INFO L290 TraceCheckUtils]: 31: Hoare triple {5696#(<= |ULTIMATE.start_main_~i~0#1| 0)} main_#t~switch19#1 := main_#t~switch19#1 || 1 == main_~_hj_k~0#1; {5696#(<= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-21 03:13:19,036 INFO L290 TraceCheckUtils]: 32: Hoare triple {5696#(<= |ULTIMATE.start_main_~i~0#1| 0)} assume main_#t~switch19#1;call main_#t~mem30#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~mem30#1 % 256;havoc main_#t~mem30#1; {5696#(<= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-21 03:13:19,037 INFO L290 TraceCheckUtils]: 33: Hoare triple {5696#(<= |ULTIMATE.start_main_~i~0#1| 0)} havoc main_#t~switch19#1; {5696#(<= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-21 03:13:19,037 INFO L290 TraceCheckUtils]: 34: Hoare triple {5696#(<= |ULTIMATE.start_main_~i~0#1| 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)))); {5696#(<= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-21 03:13:19,037 INFO L290 TraceCheckUtils]: 35: Hoare triple {5696#(<= |ULTIMATE.start_main_~i~0#1| 0)} goto; {5696#(<= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-21 03:13:19,037 INFO L290 TraceCheckUtils]: 36: Hoare triple {5696#(<= |ULTIMATE.start_main_~i~0#1| 0)} goto; {5696#(<= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-21 03:13:19,038 INFO L290 TraceCheckUtils]: 37: Hoare triple {5696#(<= |ULTIMATE.start_main_~i~0#1| 0)} goto; {5696#(<= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-21 03:13:19,038 INFO L290 TraceCheckUtils]: 38: Hoare triple {5696#(<= |ULTIMATE.start_main_~i~0#1| 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); {5696#(<= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-21 03:13:19,038 INFO L290 TraceCheckUtils]: 39: Hoare triple {5696#(<= |ULTIMATE.start_main_~i~0#1| 0)} assume !(main_~users~0#1.base == 0 && main_~users~0#1.offset == 0);call main_#t~mem48#1.base, main_#t~mem48#1.offset := read~$Pointer$(main_~users~0#1.base, 8 + main_~users~0#1.offset, 4);call write~$Pointer$(main_#t~mem48#1.base, main_#t~mem48#1.offset, main_~user~0#1.base, 8 + main_~user~0#1.offset, 4);havoc main_#t~mem48#1.base, main_#t~mem48#1.offset; {5696#(<= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-21 03:13:19,039 INFO L290 TraceCheckUtils]: 40: Hoare triple {5696#(<= |ULTIMATE.start_main_~i~0#1| 0)} call write~$Pointer$(0, 0, main_~user~0#1.base, 16 + main_~user~0#1.offset, 4);call main_#t~mem49#1.base, main_#t~mem49#1.offset := read~$Pointer$(main_~users~0#1.base, 8 + main_~users~0#1.offset, 4);call main_#t~mem50#1.base, main_#t~mem50#1.offset := read~$Pointer$(main_#t~mem49#1.base, 16 + main_#t~mem49#1.offset, 4);call main_#t~mem51#1.base, main_#t~mem51#1.offset := read~$Pointer$(main_~users~0#1.base, 8 + main_~users~0#1.offset, 4);call main_#t~mem52#1 := read~int(main_#t~mem51#1.base, 20 + main_#t~mem51#1.offset, 4);call write~$Pointer$(main_#t~mem50#1.base, main_#t~mem50#1.offset - main_#t~mem52#1, main_~user~0#1.base, 12 + main_~user~0#1.offset, 4);havoc main_#t~mem49#1.base, main_#t~mem49#1.offset;havoc main_#t~mem50#1.base, main_#t~mem50#1.offset;havoc main_#t~mem51#1.base, main_#t~mem51#1.offset;havoc main_#t~mem52#1;call main_#t~mem53#1.base, main_#t~mem53#1.offset := read~$Pointer$(main_~users~0#1.base, 8 + main_~users~0#1.offset, 4);call main_#t~mem54#1.base, main_#t~mem54#1.offset := read~$Pointer$(main_#t~mem53#1.base, 16 + main_#t~mem53#1.offset, 4);call write~$Pointer$(main_~user~0#1.base, main_~user~0#1.offset, main_#t~mem54#1.base, 8 + main_#t~mem54#1.offset, 4);havoc main_#t~mem53#1.base, main_#t~mem53#1.offset;havoc main_#t~mem54#1.base, main_#t~mem54#1.offset;call main_#t~mem55#1.base, main_#t~mem55#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~mem55#1.base, 16 + main_#t~mem55#1.offset, 4);havoc main_#t~mem55#1.base, main_#t~mem55#1.offset; {5696#(<= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-21 03:13:19,039 INFO L290 TraceCheckUtils]: 41: Hoare triple {5696#(<= |ULTIMATE.start_main_~i~0#1| 0)} goto; {5696#(<= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-21 03:13:19,039 INFO L290 TraceCheckUtils]: 42: Hoare triple {5696#(<= |ULTIMATE.start_main_~i~0#1| 0)} havoc main_~_ha_bkt~0#1;call main_#t~mem56#1.base, main_#t~mem56#1.offset := read~$Pointer$(main_~users~0#1.base, 8 + main_~users~0#1.offset, 4);call main_#t~mem57#1 := read~int(main_#t~mem56#1.base, 12 + main_#t~mem56#1.offset, 4);main_#t~post58#1 := main_#t~mem57#1;call write~int(1 + main_#t~post58#1, main_#t~mem56#1.base, 12 + main_#t~mem56#1.offset, 4);havoc main_#t~mem56#1.base, main_#t~mem56#1.offset;havoc main_#t~mem57#1;havoc main_#t~post58#1; {5696#(<= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-21 03:13:19,039 INFO L290 TraceCheckUtils]: 43: Hoare triple {5696#(<= |ULTIMATE.start_main_~i~0#1| 0)} call main_#t~mem59#1.base, main_#t~mem59#1.offset := read~$Pointer$(main_~users~0#1.base, 8 + main_~users~0#1.offset, 4);call main_#t~mem60#1 := read~int(main_#t~mem59#1.base, 4 + main_#t~mem59#1.offset, 4);main_~_ha_bkt~0#1 := (if 0 == main_~_ha_hashv~0#1 || 0 == main_#t~mem60#1 - 1 then 0 else (if 1 == main_#t~mem60#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~mem60#1 - 1))) else (if 1 == main_~_ha_hashv~0#1 then (if 1 == main_#t~mem60#1 - 1 || 0 == main_#t~mem60#1 - 1 then main_#t~mem60#1 - 1 else (if main_#t~mem60#1 - 1 >= 0 then (main_#t~mem60#1 - 1) % 2 else ~bitwiseAnd(main_~_ha_hashv~0#1, main_#t~mem60#1 - 1))) else ~bitwiseAnd(main_~_ha_hashv~0#1, main_#t~mem60#1 - 1))));havoc main_#t~mem59#1.base, main_#t~mem59#1.offset;havoc main_#t~mem60#1; {5696#(<= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-21 03:13:19,040 INFO L290 TraceCheckUtils]: 44: Hoare triple {5696#(<= |ULTIMATE.start_main_~i~0#1| 0)} goto; {5696#(<= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-21 03:13:19,040 INFO L290 TraceCheckUtils]: 45: Hoare triple {5696#(<= |ULTIMATE.start_main_~i~0#1| 0)} call main_#t~mem61#1.base, main_#t~mem61#1.offset := read~$Pointer$(main_~users~0#1.base, 8 + main_~users~0#1.offset, 4);call main_#t~mem62#1.base, main_#t~mem62#1.offset := read~$Pointer$(main_#t~mem61#1.base, main_#t~mem61#1.offset, 4);main_~_ha_head~0#1.base, main_~_ha_head~0#1.offset := main_#t~mem62#1.base, main_#t~mem62#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~mem61#1.base, main_#t~mem61#1.offset;havoc main_#t~mem62#1.base, main_#t~mem62#1.offset;call main_#t~mem63#1 := read~int(main_~_ha_head~0#1.base, 4 + main_~_ha_head~0#1.offset, 4);main_#t~post64#1 := main_#t~mem63#1;call write~int(1 + main_#t~post64#1, main_~_ha_head~0#1.base, 4 + main_~_ha_head~0#1.offset, 4);havoc main_#t~mem63#1;havoc main_#t~post64#1;call main_#t~mem65#1.base, main_#t~mem65#1.offset := read~$Pointer$(main_~_ha_head~0#1.base, main_~_ha_head~0#1.offset, 4);call write~$Pointer$(main_#t~mem65#1.base, main_#t~mem65#1.offset, main_~user~0#1.base, 24 + main_~user~0#1.offset, 4);havoc main_#t~mem65#1.base, main_#t~mem65#1.offset;call write~$Pointer$(0, 0, main_~user~0#1.base, 20 + main_~user~0#1.offset, 4);call main_#t~mem66#1.base, main_#t~mem66#1.offset := read~$Pointer$(main_~_ha_head~0#1.base, main_~_ha_head~0#1.offset, 4); {5696#(<= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-21 03:13:19,040 INFO L290 TraceCheckUtils]: 46: Hoare triple {5696#(<= |ULTIMATE.start_main_~i~0#1| 0)} assume main_#t~mem66#1.base != 0 || main_#t~mem66#1.offset != 0;havoc main_#t~mem66#1.base, main_#t~mem66#1.offset;call main_#t~mem67#1.base, main_#t~mem67#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~mem67#1.base, 12 + main_#t~mem67#1.offset, 4);havoc main_#t~mem67#1.base, main_#t~mem67#1.offset; {5696#(<= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-21 03:13:19,040 INFO L290 TraceCheckUtils]: 47: Hoare triple {5696#(<= |ULTIMATE.start_main_~i~0#1| 0)} 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~mem69#1 := read~int(main_~_ha_head~0#1.base, 4 + main_~_ha_head~0#1.offset, 4);call main_#t~mem68#1 := read~int(main_~_ha_head~0#1.base, 8 + main_~_ha_head~0#1.offset, 4);main_#t~short72#1 := main_#t~mem69#1 % 4294967296 >= 10 * (1 + main_#t~mem68#1) % 4294967296; {5696#(<= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-21 03:13:19,041 INFO L290 TraceCheckUtils]: 48: Hoare triple {5696#(<= |ULTIMATE.start_main_~i~0#1| 0)} assume main_#t~short72#1;call main_#t~mem70#1.base, main_#t~mem70#1.offset := read~$Pointer$(main_~user~0#1.base, 8 + main_~user~0#1.offset, 4);call main_#t~mem71#1 := read~int(main_#t~mem70#1.base, 36 + main_#t~mem70#1.offset, 4);main_#t~short72#1 := 0 == main_#t~mem71#1 % 4294967296; {5696#(<= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-21 03:13:19,041 INFO L290 TraceCheckUtils]: 49: Hoare triple {5696#(<= |ULTIMATE.start_main_~i~0#1| 0)} assume !main_#t~short72#1;havoc main_#t~mem69#1;havoc main_#t~mem68#1;havoc main_#t~mem70#1.base, main_#t~mem70#1.offset;havoc main_#t~mem71#1;havoc main_#t~short72#1; {5696#(<= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-21 03:13:19,041 INFO L290 TraceCheckUtils]: 50: Hoare triple {5696#(<= |ULTIMATE.start_main_~i~0#1| 0)} goto; {5696#(<= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-21 03:13:19,042 INFO L290 TraceCheckUtils]: 51: Hoare triple {5696#(<= |ULTIMATE.start_main_~i~0#1| 0)} goto; {5696#(<= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-21 03:13:19,042 INFO L290 TraceCheckUtils]: 52: Hoare triple {5696#(<= |ULTIMATE.start_main_~i~0#1| 0)} goto; {5696#(<= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-21 03:13:19,042 INFO L290 TraceCheckUtils]: 53: Hoare triple {5696#(<= |ULTIMATE.start_main_~i~0#1| 0)} goto; {5696#(<= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-21 03:13:19,042 INFO L290 TraceCheckUtils]: 54: Hoare triple {5696#(<= |ULTIMATE.start_main_~i~0#1| 0)} main_#t~post5#1 := main_~i~0#1; {5856#(<= |ULTIMATE.start_main_#t~post5#1| 0)} is VALID [2022-02-21 03:13:19,043 INFO L290 TraceCheckUtils]: 55: Hoare triple {5856#(<= |ULTIMATE.start_main_#t~post5#1| 0)} assume 1 + main_#t~post5#1 <= 2147483647; {5856#(<= |ULTIMATE.start_main_#t~post5#1| 0)} is VALID [2022-02-21 03:13:19,043 INFO L290 TraceCheckUtils]: 56: Hoare triple {5856#(<= |ULTIMATE.start_main_#t~post5#1| 0)} assume 1 + main_#t~post5#1 >= -2147483648;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; {5863#(<= |ULTIMATE.start_main_~i~0#1| 1)} is VALID [2022-02-21 03:13:19,044 INFO L290 TraceCheckUtils]: 57: Hoare triple {5863#(<= |ULTIMATE.start_main_~i~0#1| 1)} assume !(main_~i~0#1 < 10); {5689#false} is VALID [2022-02-21 03:13:19,044 INFO L290 TraceCheckUtils]: 58: Hoare triple {5689#false} main_~user~0#1.base, main_~user~0#1.offset := main_~users~0#1.base, main_~users~0#1.offset; {5689#false} is VALID [2022-02-21 03:13:19,044 INFO L290 TraceCheckUtils]: 59: Hoare triple {5689#false} assume !!(main_~user~0#1.base != 0 || main_~user~0#1.offset != 0);call main_#t~mem140#1 := read~int(main_~user~0#1.base, main_~user~0#1.offset, 4);call main_#t~mem141#1 := read~int(main_~user~0#1.base, 4 + main_~user~0#1.offset, 4);assume { :begin_inline_test_int_int } true;test_int_int_#in~a#1, test_int_int_#in~b#1 := main_#t~mem140#1, main_#t~mem141#1;havoc test_int_int_#t~post3#1, test_int_int_#t~switch4#1, test_int_int_~a#1, test_int_int_~b#1;test_int_int_~a#1 := test_int_int_#in~a#1;test_int_int_~b#1 := test_int_int_#in~b#1;test_int_int_#t~post3#1 := ~count_int_int~0; {5689#false} is VALID [2022-02-21 03:13:19,044 INFO L290 TraceCheckUtils]: 60: Hoare triple {5689#false} assume !(1 + test_int_int_#t~post3#1 <= 2147483647); {5689#false} is VALID [2022-02-21 03:13:19,044 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-21 03:13:19,044 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-21 03:13:19,304 INFO L290 TraceCheckUtils]: 60: Hoare triple {5689#false} assume !(1 + test_int_int_#t~post3#1 <= 2147483647); {5689#false} is VALID [2022-02-21 03:13:19,304 INFO L290 TraceCheckUtils]: 59: Hoare triple {5689#false} assume !!(main_~user~0#1.base != 0 || main_~user~0#1.offset != 0);call main_#t~mem140#1 := read~int(main_~user~0#1.base, main_~user~0#1.offset, 4);call main_#t~mem141#1 := read~int(main_~user~0#1.base, 4 + main_~user~0#1.offset, 4);assume { :begin_inline_test_int_int } true;test_int_int_#in~a#1, test_int_int_#in~b#1 := main_#t~mem140#1, main_#t~mem141#1;havoc test_int_int_#t~post3#1, test_int_int_#t~switch4#1, test_int_int_~a#1, test_int_int_~b#1;test_int_int_~a#1 := test_int_int_#in~a#1;test_int_int_~b#1 := test_int_int_#in~b#1;test_int_int_#t~post3#1 := ~count_int_int~0; {5689#false} is VALID [2022-02-21 03:13:19,304 INFO L290 TraceCheckUtils]: 58: Hoare triple {5689#false} main_~user~0#1.base, main_~user~0#1.offset := main_~users~0#1.base, main_~users~0#1.offset; {5689#false} is VALID [2022-02-21 03:13:19,304 INFO L290 TraceCheckUtils]: 57: Hoare triple {5885#(< |ULTIMATE.start_main_~i~0#1| 10)} assume !(main_~i~0#1 < 10); {5689#false} is VALID [2022-02-21 03:13:19,306 INFO L290 TraceCheckUtils]: 56: Hoare triple {5889#(< |ULTIMATE.start_main_#t~post5#1| 9)} assume 1 + main_#t~post5#1 >= -2147483648;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; {5885#(< |ULTIMATE.start_main_~i~0#1| 10)} is VALID [2022-02-21 03:13:19,306 INFO L290 TraceCheckUtils]: 55: Hoare triple {5889#(< |ULTIMATE.start_main_#t~post5#1| 9)} assume 1 + main_#t~post5#1 <= 2147483647; {5889#(< |ULTIMATE.start_main_#t~post5#1| 9)} is VALID [2022-02-21 03:13:19,306 INFO L290 TraceCheckUtils]: 54: Hoare triple {5896#(< |ULTIMATE.start_main_~i~0#1| 9)} main_#t~post5#1 := main_~i~0#1; {5889#(< |ULTIMATE.start_main_#t~post5#1| 9)} is VALID [2022-02-21 03:13:19,307 INFO L290 TraceCheckUtils]: 53: Hoare triple {5896#(< |ULTIMATE.start_main_~i~0#1| 9)} goto; {5896#(< |ULTIMATE.start_main_~i~0#1| 9)} is VALID [2022-02-21 03:13:19,307 INFO L290 TraceCheckUtils]: 52: Hoare triple {5896#(< |ULTIMATE.start_main_~i~0#1| 9)} goto; {5896#(< |ULTIMATE.start_main_~i~0#1| 9)} is VALID [2022-02-21 03:13:19,307 INFO L290 TraceCheckUtils]: 51: Hoare triple {5896#(< |ULTIMATE.start_main_~i~0#1| 9)} goto; {5896#(< |ULTIMATE.start_main_~i~0#1| 9)} is VALID [2022-02-21 03:13:19,308 INFO L290 TraceCheckUtils]: 50: Hoare triple {5896#(< |ULTIMATE.start_main_~i~0#1| 9)} goto; {5896#(< |ULTIMATE.start_main_~i~0#1| 9)} is VALID [2022-02-21 03:13:19,308 INFO L290 TraceCheckUtils]: 49: Hoare triple {5896#(< |ULTIMATE.start_main_~i~0#1| 9)} assume !main_#t~short72#1;havoc main_#t~mem69#1;havoc main_#t~mem68#1;havoc main_#t~mem70#1.base, main_#t~mem70#1.offset;havoc main_#t~mem71#1;havoc main_#t~short72#1; {5896#(< |ULTIMATE.start_main_~i~0#1| 9)} is VALID [2022-02-21 03:13:19,308 INFO L290 TraceCheckUtils]: 48: Hoare triple {5896#(< |ULTIMATE.start_main_~i~0#1| 9)} assume main_#t~short72#1;call main_#t~mem70#1.base, main_#t~mem70#1.offset := read~$Pointer$(main_~user~0#1.base, 8 + main_~user~0#1.offset, 4);call main_#t~mem71#1 := read~int(main_#t~mem70#1.base, 36 + main_#t~mem70#1.offset, 4);main_#t~short72#1 := 0 == main_#t~mem71#1 % 4294967296; {5896#(< |ULTIMATE.start_main_~i~0#1| 9)} is VALID [2022-02-21 03:13:19,308 INFO L290 TraceCheckUtils]: 47: Hoare triple {5896#(< |ULTIMATE.start_main_~i~0#1| 9)} 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~mem69#1 := read~int(main_~_ha_head~0#1.base, 4 + main_~_ha_head~0#1.offset, 4);call main_#t~mem68#1 := read~int(main_~_ha_head~0#1.base, 8 + main_~_ha_head~0#1.offset, 4);main_#t~short72#1 := main_#t~mem69#1 % 4294967296 >= 10 * (1 + main_#t~mem68#1) % 4294967296; {5896#(< |ULTIMATE.start_main_~i~0#1| 9)} is VALID [2022-02-21 03:13:19,309 INFO L290 TraceCheckUtils]: 46: Hoare triple {5896#(< |ULTIMATE.start_main_~i~0#1| 9)} assume main_#t~mem66#1.base != 0 || main_#t~mem66#1.offset != 0;havoc main_#t~mem66#1.base, main_#t~mem66#1.offset;call main_#t~mem67#1.base, main_#t~mem67#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~mem67#1.base, 12 + main_#t~mem67#1.offset, 4);havoc main_#t~mem67#1.base, main_#t~mem67#1.offset; {5896#(< |ULTIMATE.start_main_~i~0#1| 9)} is VALID [2022-02-21 03:13:19,309 INFO L290 TraceCheckUtils]: 45: Hoare triple {5896#(< |ULTIMATE.start_main_~i~0#1| 9)} call main_#t~mem61#1.base, main_#t~mem61#1.offset := read~$Pointer$(main_~users~0#1.base, 8 + main_~users~0#1.offset, 4);call main_#t~mem62#1.base, main_#t~mem62#1.offset := read~$Pointer$(main_#t~mem61#1.base, main_#t~mem61#1.offset, 4);main_~_ha_head~0#1.base, main_~_ha_head~0#1.offset := main_#t~mem62#1.base, main_#t~mem62#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~mem61#1.base, main_#t~mem61#1.offset;havoc main_#t~mem62#1.base, main_#t~mem62#1.offset;call main_#t~mem63#1 := read~int(main_~_ha_head~0#1.base, 4 + main_~_ha_head~0#1.offset, 4);main_#t~post64#1 := main_#t~mem63#1;call write~int(1 + main_#t~post64#1, main_~_ha_head~0#1.base, 4 + main_~_ha_head~0#1.offset, 4);havoc main_#t~mem63#1;havoc main_#t~post64#1;call main_#t~mem65#1.base, main_#t~mem65#1.offset := read~$Pointer$(main_~_ha_head~0#1.base, main_~_ha_head~0#1.offset, 4);call write~$Pointer$(main_#t~mem65#1.base, main_#t~mem65#1.offset, main_~user~0#1.base, 24 + main_~user~0#1.offset, 4);havoc main_#t~mem65#1.base, main_#t~mem65#1.offset;call write~$Pointer$(0, 0, main_~user~0#1.base, 20 + main_~user~0#1.offset, 4);call main_#t~mem66#1.base, main_#t~mem66#1.offset := read~$Pointer$(main_~_ha_head~0#1.base, main_~_ha_head~0#1.offset, 4); {5896#(< |ULTIMATE.start_main_~i~0#1| 9)} is VALID [2022-02-21 03:13:19,309 INFO L290 TraceCheckUtils]: 44: Hoare triple {5896#(< |ULTIMATE.start_main_~i~0#1| 9)} goto; {5896#(< |ULTIMATE.start_main_~i~0#1| 9)} is VALID [2022-02-21 03:13:19,310 INFO L290 TraceCheckUtils]: 43: Hoare triple {5896#(< |ULTIMATE.start_main_~i~0#1| 9)} call main_#t~mem59#1.base, main_#t~mem59#1.offset := read~$Pointer$(main_~users~0#1.base, 8 + main_~users~0#1.offset, 4);call main_#t~mem60#1 := read~int(main_#t~mem59#1.base, 4 + main_#t~mem59#1.offset, 4);main_~_ha_bkt~0#1 := (if 0 == main_~_ha_hashv~0#1 || 0 == main_#t~mem60#1 - 1 then 0 else (if 1 == main_#t~mem60#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~mem60#1 - 1))) else (if 1 == main_~_ha_hashv~0#1 then (if 1 == main_#t~mem60#1 - 1 || 0 == main_#t~mem60#1 - 1 then main_#t~mem60#1 - 1 else (if main_#t~mem60#1 - 1 >= 0 then (main_#t~mem60#1 - 1) % 2 else ~bitwiseAnd(main_~_ha_hashv~0#1, main_#t~mem60#1 - 1))) else ~bitwiseAnd(main_~_ha_hashv~0#1, main_#t~mem60#1 - 1))));havoc main_#t~mem59#1.base, main_#t~mem59#1.offset;havoc main_#t~mem60#1; {5896#(< |ULTIMATE.start_main_~i~0#1| 9)} is VALID [2022-02-21 03:13:19,310 INFO L290 TraceCheckUtils]: 42: Hoare triple {5896#(< |ULTIMATE.start_main_~i~0#1| 9)} havoc main_~_ha_bkt~0#1;call main_#t~mem56#1.base, main_#t~mem56#1.offset := read~$Pointer$(main_~users~0#1.base, 8 + main_~users~0#1.offset, 4);call main_#t~mem57#1 := read~int(main_#t~mem56#1.base, 12 + main_#t~mem56#1.offset, 4);main_#t~post58#1 := main_#t~mem57#1;call write~int(1 + main_#t~post58#1, main_#t~mem56#1.base, 12 + main_#t~mem56#1.offset, 4);havoc main_#t~mem56#1.base, main_#t~mem56#1.offset;havoc main_#t~mem57#1;havoc main_#t~post58#1; {5896#(< |ULTIMATE.start_main_~i~0#1| 9)} is VALID [2022-02-21 03:13:19,311 INFO L290 TraceCheckUtils]: 41: Hoare triple {5896#(< |ULTIMATE.start_main_~i~0#1| 9)} goto; {5896#(< |ULTIMATE.start_main_~i~0#1| 9)} is VALID [2022-02-21 03:13:19,311 INFO L290 TraceCheckUtils]: 40: Hoare triple {5896#(< |ULTIMATE.start_main_~i~0#1| 9)} call write~$Pointer$(0, 0, main_~user~0#1.base, 16 + main_~user~0#1.offset, 4);call main_#t~mem49#1.base, main_#t~mem49#1.offset := read~$Pointer$(main_~users~0#1.base, 8 + main_~users~0#1.offset, 4);call main_#t~mem50#1.base, main_#t~mem50#1.offset := read~$Pointer$(main_#t~mem49#1.base, 16 + main_#t~mem49#1.offset, 4);call main_#t~mem51#1.base, main_#t~mem51#1.offset := read~$Pointer$(main_~users~0#1.base, 8 + main_~users~0#1.offset, 4);call main_#t~mem52#1 := read~int(main_#t~mem51#1.base, 20 + main_#t~mem51#1.offset, 4);call write~$Pointer$(main_#t~mem50#1.base, main_#t~mem50#1.offset - main_#t~mem52#1, main_~user~0#1.base, 12 + main_~user~0#1.offset, 4);havoc main_#t~mem49#1.base, main_#t~mem49#1.offset;havoc main_#t~mem50#1.base, main_#t~mem50#1.offset;havoc main_#t~mem51#1.base, main_#t~mem51#1.offset;havoc main_#t~mem52#1;call main_#t~mem53#1.base, main_#t~mem53#1.offset := read~$Pointer$(main_~users~0#1.base, 8 + main_~users~0#1.offset, 4);call main_#t~mem54#1.base, main_#t~mem54#1.offset := read~$Pointer$(main_#t~mem53#1.base, 16 + main_#t~mem53#1.offset, 4);call write~$Pointer$(main_~user~0#1.base, main_~user~0#1.offset, main_#t~mem54#1.base, 8 + main_#t~mem54#1.offset, 4);havoc main_#t~mem53#1.base, main_#t~mem53#1.offset;havoc main_#t~mem54#1.base, main_#t~mem54#1.offset;call main_#t~mem55#1.base, main_#t~mem55#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~mem55#1.base, 16 + main_#t~mem55#1.offset, 4);havoc main_#t~mem55#1.base, main_#t~mem55#1.offset; {5896#(< |ULTIMATE.start_main_~i~0#1| 9)} is VALID [2022-02-21 03:13:19,312 INFO L290 TraceCheckUtils]: 39: Hoare triple {5896#(< |ULTIMATE.start_main_~i~0#1| 9)} assume !(main_~users~0#1.base == 0 && main_~users~0#1.offset == 0);call main_#t~mem48#1.base, main_#t~mem48#1.offset := read~$Pointer$(main_~users~0#1.base, 8 + main_~users~0#1.offset, 4);call write~$Pointer$(main_#t~mem48#1.base, main_#t~mem48#1.offset, main_~user~0#1.base, 8 + main_~user~0#1.offset, 4);havoc main_#t~mem48#1.base, main_#t~mem48#1.offset; {5896#(< |ULTIMATE.start_main_~i~0#1| 9)} is VALID [2022-02-21 03:13:19,312 INFO L290 TraceCheckUtils]: 38: Hoare triple {5896#(< |ULTIMATE.start_main_~i~0#1| 9)} 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); {5896#(< |ULTIMATE.start_main_~i~0#1| 9)} is VALID [2022-02-21 03:13:19,312 INFO L290 TraceCheckUtils]: 37: Hoare triple {5896#(< |ULTIMATE.start_main_~i~0#1| 9)} goto; {5896#(< |ULTIMATE.start_main_~i~0#1| 9)} is VALID [2022-02-21 03:13:19,312 INFO L290 TraceCheckUtils]: 36: Hoare triple {5896#(< |ULTIMATE.start_main_~i~0#1| 9)} goto; {5896#(< |ULTIMATE.start_main_~i~0#1| 9)} is VALID [2022-02-21 03:13:19,313 INFO L290 TraceCheckUtils]: 35: Hoare triple {5896#(< |ULTIMATE.start_main_~i~0#1| 9)} goto; {5896#(< |ULTIMATE.start_main_~i~0#1| 9)} is VALID [2022-02-21 03:13:19,313 INFO L290 TraceCheckUtils]: 34: Hoare triple {5896#(< |ULTIMATE.start_main_~i~0#1| 9)} 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)))); {5896#(< |ULTIMATE.start_main_~i~0#1| 9)} is VALID [2022-02-21 03:13:19,314 INFO L290 TraceCheckUtils]: 33: Hoare triple {5896#(< |ULTIMATE.start_main_~i~0#1| 9)} havoc main_#t~switch19#1; {5896#(< |ULTIMATE.start_main_~i~0#1| 9)} is VALID [2022-02-21 03:13:19,314 INFO L290 TraceCheckUtils]: 32: Hoare triple {5896#(< |ULTIMATE.start_main_~i~0#1| 9)} assume main_#t~switch19#1;call main_#t~mem30#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~mem30#1 % 256;havoc main_#t~mem30#1; {5896#(< |ULTIMATE.start_main_~i~0#1| 9)} is VALID [2022-02-21 03:13:19,314 INFO L290 TraceCheckUtils]: 31: Hoare triple {5896#(< |ULTIMATE.start_main_~i~0#1| 9)} main_#t~switch19#1 := main_#t~switch19#1 || 1 == main_~_hj_k~0#1; {5896#(< |ULTIMATE.start_main_~i~0#1| 9)} is VALID [2022-02-21 03:13:19,314 INFO L290 TraceCheckUtils]: 30: Hoare triple {5896#(< |ULTIMATE.start_main_~i~0#1| 9)} assume main_#t~switch19#1;call main_#t~mem29#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~mem29#1 % 256);havoc main_#t~mem29#1; {5896#(< |ULTIMATE.start_main_~i~0#1| 9)} is VALID [2022-02-21 03:13:19,315 INFO L290 TraceCheckUtils]: 29: Hoare triple {5896#(< |ULTIMATE.start_main_~i~0#1| 9)} main_#t~switch19#1 := main_#t~switch19#1 || 2 == main_~_hj_k~0#1; {5896#(< |ULTIMATE.start_main_~i~0#1| 9)} is VALID [2022-02-21 03:13:19,315 INFO L290 TraceCheckUtils]: 28: Hoare triple {5896#(< |ULTIMATE.start_main_~i~0#1| 9)} assume main_#t~switch19#1;call main_#t~mem28#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~mem28#1 % 256);havoc main_#t~mem28#1; {5896#(< |ULTIMATE.start_main_~i~0#1| 9)} is VALID [2022-02-21 03:13:19,315 INFO L290 TraceCheckUtils]: 27: Hoare triple {5896#(< |ULTIMATE.start_main_~i~0#1| 9)} main_#t~switch19#1 := main_#t~switch19#1 || 3 == main_~_hj_k~0#1; {5896#(< |ULTIMATE.start_main_~i~0#1| 9)} is VALID [2022-02-21 03:13:19,315 INFO L290 TraceCheckUtils]: 26: Hoare triple {5896#(< |ULTIMATE.start_main_~i~0#1| 9)} assume main_#t~switch19#1;call main_#t~mem27#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~mem27#1 % 256);havoc main_#t~mem27#1; {5896#(< |ULTIMATE.start_main_~i~0#1| 9)} is VALID [2022-02-21 03:13:19,316 INFO L290 TraceCheckUtils]: 25: Hoare triple {5896#(< |ULTIMATE.start_main_~i~0#1| 9)} main_#t~switch19#1 := main_#t~switch19#1 || 4 == main_~_hj_k~0#1; {5896#(< |ULTIMATE.start_main_~i~0#1| 9)} is VALID [2022-02-21 03:13:19,316 INFO L290 TraceCheckUtils]: 24: Hoare triple {5896#(< |ULTIMATE.start_main_~i~0#1| 9)} assume !main_#t~switch19#1; {5896#(< |ULTIMATE.start_main_~i~0#1| 9)} is VALID [2022-02-21 03:13:19,316 INFO L290 TraceCheckUtils]: 23: Hoare triple {5896#(< |ULTIMATE.start_main_~i~0#1| 9)} main_#t~switch19#1 := main_#t~switch19#1 || 5 == main_~_hj_k~0#1; {5896#(< |ULTIMATE.start_main_~i~0#1| 9)} is VALID [2022-02-21 03:13:19,316 INFO L290 TraceCheckUtils]: 22: Hoare triple {5896#(< |ULTIMATE.start_main_~i~0#1| 9)} assume !main_#t~switch19#1; {5896#(< |ULTIMATE.start_main_~i~0#1| 9)} is VALID [2022-02-21 03:13:19,317 INFO L290 TraceCheckUtils]: 21: Hoare triple {5896#(< |ULTIMATE.start_main_~i~0#1| 9)} main_#t~switch19#1 := main_#t~switch19#1 || 6 == main_~_hj_k~0#1; {5896#(< |ULTIMATE.start_main_~i~0#1| 9)} is VALID [2022-02-21 03:13:19,317 INFO L290 TraceCheckUtils]: 20: Hoare triple {5896#(< |ULTIMATE.start_main_~i~0#1| 9)} assume !main_#t~switch19#1; {5896#(< |ULTIMATE.start_main_~i~0#1| 9)} is VALID [2022-02-21 03:13:19,317 INFO L290 TraceCheckUtils]: 19: Hoare triple {5896#(< |ULTIMATE.start_main_~i~0#1| 9)} main_#t~switch19#1 := main_#t~switch19#1 || 7 == main_~_hj_k~0#1; {5896#(< |ULTIMATE.start_main_~i~0#1| 9)} is VALID [2022-02-21 03:13:19,317 INFO L290 TraceCheckUtils]: 18: Hoare triple {5896#(< |ULTIMATE.start_main_~i~0#1| 9)} assume !main_#t~switch19#1; {5896#(< |ULTIMATE.start_main_~i~0#1| 9)} is VALID [2022-02-21 03:13:19,318 INFO L290 TraceCheckUtils]: 17: Hoare triple {5896#(< |ULTIMATE.start_main_~i~0#1| 9)} main_#t~switch19#1 := main_#t~switch19#1 || 8 == main_~_hj_k~0#1; {5896#(< |ULTIMATE.start_main_~i~0#1| 9)} is VALID [2022-02-21 03:13:19,318 INFO L290 TraceCheckUtils]: 16: Hoare triple {5896#(< |ULTIMATE.start_main_~i~0#1| 9)} assume !main_#t~switch19#1; {5896#(< |ULTIMATE.start_main_~i~0#1| 9)} is VALID [2022-02-21 03:13:19,319 INFO L290 TraceCheckUtils]: 15: Hoare triple {5896#(< |ULTIMATE.start_main_~i~0#1| 9)} main_#t~switch19#1 := main_#t~switch19#1 || 9 == main_~_hj_k~0#1; {5896#(< |ULTIMATE.start_main_~i~0#1| 9)} is VALID [2022-02-21 03:13:19,319 INFO L290 TraceCheckUtils]: 14: Hoare triple {5896#(< |ULTIMATE.start_main_~i~0#1| 9)} assume !main_#t~switch19#1; {5896#(< |ULTIMATE.start_main_~i~0#1| 9)} is VALID [2022-02-21 03:13:19,319 INFO L290 TraceCheckUtils]: 13: Hoare triple {5896#(< |ULTIMATE.start_main_~i~0#1| 9)} main_#t~switch19#1 := main_#t~switch19#1 || 10 == main_~_hj_k~0#1; {5896#(< |ULTIMATE.start_main_~i~0#1| 9)} is VALID [2022-02-21 03:13:19,319 INFO L290 TraceCheckUtils]: 12: Hoare triple {5896#(< |ULTIMATE.start_main_~i~0#1| 9)} assume !main_#t~switch19#1; {5896#(< |ULTIMATE.start_main_~i~0#1| 9)} is VALID [2022-02-21 03:13:19,320 INFO L290 TraceCheckUtils]: 11: Hoare triple {5896#(< |ULTIMATE.start_main_~i~0#1| 9)} main_~_ha_hashv~0#1 := 4 + main_~_ha_hashv~0#1;main_#t~switch19#1 := 11 == main_~_hj_k~0#1; {5896#(< |ULTIMATE.start_main_~i~0#1| 9)} is VALID [2022-02-21 03:13:19,320 INFO L290 TraceCheckUtils]: 10: Hoare triple {5896#(< |ULTIMATE.start_main_~i~0#1| 9)} assume !(main_~_hj_k~0#1 % 4294967296 >= 12); {5896#(< |ULTIMATE.start_main_~i~0#1| 9)} is VALID [2022-02-21 03:13:19,320 INFO L290 TraceCheckUtils]: 9: Hoare triple {5896#(< |ULTIMATE.start_main_~i~0#1| 9)} 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; {5896#(< |ULTIMATE.start_main_~i~0#1| 9)} is VALID [2022-02-21 03:13:19,321 INFO L290 TraceCheckUtils]: 8: Hoare triple {5896#(< |ULTIMATE.start_main_~i~0#1| 9)} goto; {5896#(< |ULTIMATE.start_main_~i~0#1| 9)} is VALID [2022-02-21 03:13:19,321 INFO L290 TraceCheckUtils]: 7: Hoare triple {5896#(< |ULTIMATE.start_main_~i~0#1| 9)} havoc main_~_ha_hashv~0#1; {5896#(< |ULTIMATE.start_main_~i~0#1| 9)} is VALID [2022-02-21 03:13:19,321 INFO L290 TraceCheckUtils]: 6: Hoare triple {5896#(< |ULTIMATE.start_main_~i~0#1| 9)} assume main_~i~0#1 * main_~i~0#1 >= -2147483648;call write~int(main_~i~0#1 * main_~i~0#1, main_~user~0#1.base, 4 + main_~user~0#1.offset, 4); {5896#(< |ULTIMATE.start_main_~i~0#1| 9)} is VALID [2022-02-21 03:13:19,321 INFO L290 TraceCheckUtils]: 5: Hoare triple {5896#(< |ULTIMATE.start_main_~i~0#1| 9)} assume main_~i~0#1 * main_~i~0#1 <= 2147483647; {5896#(< |ULTIMATE.start_main_~i~0#1| 9)} is VALID [2022-02-21 03:13:19,322 INFO L290 TraceCheckUtils]: 4: Hoare triple {5896#(< |ULTIMATE.start_main_~i~0#1| 9)} call write~int(main_~i~0#1, main_~user~0#1.base, main_~user~0#1.offset, 4); {5896#(< |ULTIMATE.start_main_~i~0#1| 9)} is VALID [2022-02-21 03:13:19,322 INFO L290 TraceCheckUtils]: 3: Hoare triple {5896#(< |ULTIMATE.start_main_~i~0#1| 9)} assume !(main_~user~0#1.base == 0 && main_~user~0#1.offset == 0); {5896#(< |ULTIMATE.start_main_~i~0#1| 9)} is VALID [2022-02-21 03:13:19,322 INFO L290 TraceCheckUtils]: 2: Hoare triple {5896#(< |ULTIMATE.start_main_~i~0#1| 9)} assume !!(main_~i~0#1 < 10);call main_#t~malloc6#1.base, main_#t~malloc6#1.offset := #Ultimate.allocOnHeap(40);main_~user~0#1.base, main_~user~0#1.offset := main_#t~malloc6#1.base, main_#t~malloc6#1.offset;havoc main_#t~malloc6#1.base, main_#t~malloc6#1.offset; {5896#(< |ULTIMATE.start_main_~i~0#1| 9)} is VALID [2022-02-21 03:13:19,322 INFO L290 TraceCheckUtils]: 1: Hoare triple {5688#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc6#1.base, main_#t~malloc6#1.offset, main_#t~mem8#1, main_#t~mem7#1, main_#t~mem9#1, main_#t~mem10#1, main_#t~mem12#1, main_#t~mem11#1, main_#t~mem13#1, main_#t~mem14#1, main_#t~mem16#1, main_#t~mem15#1, main_#t~mem17#1, main_#t~mem18#1, main_#t~switch19#1, main_#t~mem20#1, main_#t~mem21#1, main_#t~mem22#1, main_#t~mem23#1, main_#t~mem24#1, main_#t~mem25#1, main_#t~mem26#1, main_#t~mem27#1, main_#t~mem28#1, main_#t~mem29#1, main_#t~mem30#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~malloc31#1.base, main_#t~malloc31#1.offset, main_#t~mem32#1.base, main_#t~mem32#1.offset, main_#t~mem33#1.base, main_#t~mem33#1.offset, main_#t~memset~res34#1.base, main_#t~memset~res34#1.offset, main_#t~mem35#1.base, main_#t~mem35#1.offset, main_#t~mem36#1.base, main_#t~mem36#1.offset, main_#t~mem37#1.base, main_#t~mem37#1.offset, main_#t~mem38#1.base, main_#t~mem38#1.offset, main_#t~mem39#1.base, main_#t~mem39#1.offset, main_#t~malloc40#1.base, main_#t~malloc40#1.offset, main_#t~mem41#1.base, main_#t~mem41#1.offset, main_#t~mem42#1.base, main_#t~mem42#1.offset, main_#t~mem43#1.base, main_#t~mem43#1.offset, main_#t~mem44#1.base, main_#t~mem44#1.offset, main_#t~mem45#1.base, main_#t~mem45#1.offset, main_#t~mem46#1.base, main_#t~mem46#1.offset, main_#t~memset~res47#1.base, main_#t~memset~res47#1.offset, main_#t~mem48#1.base, main_#t~mem48#1.offset, main_#t~mem49#1.base, main_#t~mem49#1.offset, main_#t~mem50#1.base, main_#t~mem50#1.offset, main_#t~mem51#1.base, main_#t~mem51#1.offset, main_#t~mem52#1, main_#t~mem53#1.base, main_#t~mem53#1.offset, main_#t~mem54#1.base, main_#t~mem54#1.offset, main_#t~mem55#1.base, main_#t~mem55#1.offset, main_#t~mem56#1.base, main_#t~mem56#1.offset, main_#t~mem57#1, main_#t~post58#1, main_#t~mem59#1.base, main_#t~mem59#1.offset, main_#t~mem60#1, main_#t~mem61#1.base, main_#t~mem61#1.offset, main_#t~mem62#1.base, main_#t~mem62#1.offset, main_#t~mem63#1, main_#t~post64#1, main_#t~mem65#1.base, main_#t~mem65#1.offset, main_#t~mem66#1.base, main_#t~mem66#1.offset, main_#t~mem67#1.base, main_#t~mem67#1.offset, main_#t~mem69#1, main_#t~mem68#1, main_#t~mem70#1.base, main_#t~mem70#1.offset, main_#t~mem71#1, main_#t~short72#1, main_#t~mem73#1.base, main_#t~mem73#1.offset, main_#t~mem74#1, main_#t~malloc75#1.base, main_#t~malloc75#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~mem79#1, main_#t~memset~res80#1.base, main_#t~memset~res80#1.offset, main_#t~mem81#1.base, main_#t~mem81#1.offset, main_#t~mem82#1.base, main_#t~mem82#1.offset, main_#t~mem85#1, main_#t~mem83#1.base, main_#t~mem83#1.offset, main_#t~mem84#1, main_#t~mem86#1.base, main_#t~mem86#1.offset, main_#t~mem89#1, main_#t~mem87#1.base, main_#t~mem87#1.offset, main_#t~mem88#1, main_#t~ite90#1, main_#t~mem91#1.base, main_#t~mem91#1.offset, main_#t~mem95#1.base, main_#t~mem95#1.offset, main_#t~mem96#1.base, main_#t~mem96#1.offset, main_#t~mem97#1.base, main_#t~mem97#1.offset, main_#t~mem98#1.base, main_#t~mem98#1.offset, main_#t~mem101#1, main_#t~mem99#1.base, main_#t~mem99#1.offset, main_#t~mem100#1, main_#t~mem102#1.base, main_#t~mem102#1.offset, main_#t~mem103#1, main_#t~pre104#1, main_#t~mem105#1.base, main_#t~mem105#1.offset, main_#t~mem106#1, main_#t~mem107#1.base, main_#t~mem107#1.offset, main_#t~mem108#1, main_#t~post109#1, main_#t~mem113#1, main_#t~mem111#1, main_#t~mem110#1.base, main_#t~mem110#1.offset, main_#t~mem112#1, main_#t~mem114#1, main_#t~post115#1, main_#t~mem116#1.base, main_#t~mem116#1.offset, main_#t~mem117#1.base, main_#t~mem117#1.offset, main_#t~mem118#1.base, main_#t~mem118#1.offset, main_#t~post92#1, main_#t~mem93#1.base, main_#t~mem93#1.offset, main_#t~mem94#1, main_#t~mem119#1.base, main_#t~mem119#1.offset, main_#t~mem120#1.base, main_#t~mem120#1.offset, main_#t~mem121#1.base, main_#t~mem121#1.offset, main_#t~mem122#1, main_#t~mem123#1.base, main_#t~mem123#1.offset, main_#t~mem124#1, main_#t~post125#1, main_#t~mem126#1.base, main_#t~mem126#1.offset, main_#t~mem127#1.base, main_#t~mem127#1.offset, main_#t~mem128#1.base, main_#t~mem128#1.offset, main_#t~mem129#1.base, main_#t~mem129#1.offset, main_#t~mem132#1, main_#t~mem130#1.base, main_#t~mem130#1.offset, main_#t~mem131#1, main_#t~ite135#1, main_#t~mem133#1.base, main_#t~mem133#1.offset, main_#t~mem134#1, main_#t~mem136#1.base, main_#t~mem136#1.offset, main_#t~mem137#1, main_#t~mem138#1.base, main_#t~mem138#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~post5#1, main_#t~mem140#1, main_#t~mem141#1, main_#t~mem139#1.base, main_#t~mem139#1.offset, main_~i~0#1, main_~user~0#1.base, main_~user~0#1.offset, main_~users~0#1.base, main_~users~0#1.offset;havoc main_~i~0#1;havoc main_~user~0#1.base, main_~user~0#1.offset;main_~users~0#1.base, main_~users~0#1.offset := 0, 0;main_~i~0#1 := 0; {5896#(< |ULTIMATE.start_main_~i~0#1| 9)} is VALID [2022-02-21 03:13:19,322 INFO L290 TraceCheckUtils]: 0: Hoare triple {5688#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);~count_int_int~0 := 0; {5688#true} is VALID [2022-02-21 03:13:19,323 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-21 03:13:19,323 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 03:13:19,323 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [833257857] [2022-02-21 03:13:19,323 WARN L317 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-02-21 03:13:19,323 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [416622836] [2022-02-21 03:13:19,323 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [416622836] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-21 03:13:19,323 INFO L191 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-02-21 03:13:19,323 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2022-02-21 03:13:19,323 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [814709086] [2022-02-21 03:13:19,323 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-02-21 03:13:19,324 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 14.75) internal successors, (118), 8 states have internal predecessors, (118), 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 61 [2022-02-21 03:13:19,324 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-21 03:13:19,324 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 8 states, 8 states have (on average 14.75) internal successors, (118), 8 states have internal predecessors, (118), 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:13:19,402 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 118 edges. 118 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:13:19,402 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-02-21 03:13:19,402 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 03:13:19,403 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-02-21 03:13:19,403 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2022-02-21 03:13:19,403 INFO L87 Difference]: Start difference. First operand 234 states and 294 transitions. Second operand has 8 states, 8 states have (on average 14.75) internal successors, (118), 8 states have internal predecessors, (118), 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:13:20,451 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:13:20,451 INFO L93 Difference]: Finished difference Result 367 states and 469 transitions. [2022-02-21 03:13:20,451 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-02-21 03:13:20,451 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 14.75) internal successors, (118), 8 states have internal predecessors, (118), 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 61 [2022-02-21 03:13:20,452 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-21 03:13:20,452 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 14.75) internal successors, (118), 8 states have internal predecessors, (118), 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:13:20,454 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 451 transitions. [2022-02-21 03:13:20,455 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 14.75) internal successors, (118), 8 states have internal predecessors, (118), 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:13:20,457 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 451 transitions. [2022-02-21 03:13:20,457 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states and 451 transitions. [2022-02-21 03:13:20,805 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 451 edges. 451 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:13:20,810 INFO L225 Difference]: With dead ends: 367 [2022-02-21 03:13:20,810 INFO L226 Difference]: Without dead ends: 333 [2022-02-21 03:13:20,811 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 122 GetRequests, 114 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=35, Invalid=55, Unknown=0, NotChecked=0, Total=90 [2022-02-21 03:13:20,813 INFO L933 BasicCegarLoop]: 170 mSDtfsCounter, 466 mSDsluCounter, 590 mSDsCounter, 0 mSdLazyCounter, 54 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 475 SdHoareTripleChecker+Valid, 760 SdHoareTripleChecker+Invalid, 64 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 54 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-21 03:13:20,813 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [475 Valid, 760 Invalid, 64 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 54 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-21 03:13:20,815 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 333 states. [2022-02-21 03:13:20,885 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 333 to 333. [2022-02-21 03:13:20,885 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 03:13:20,886 INFO L82 GeneralOperation]: Start isEquivalent. First operand 333 states. Second operand has 333 states, 308 states have (on average 1.2207792207792207) internal successors, (376), 321 states have internal predecessors, (376), 19 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (19), 10 states have call predecessors, (19), 19 states have call successors, (19) [2022-02-21 03:13:20,887 INFO L74 IsIncluded]: Start isIncluded. First operand 333 states. Second operand has 333 states, 308 states have (on average 1.2207792207792207) internal successors, (376), 321 states have internal predecessors, (376), 19 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (19), 10 states have call predecessors, (19), 19 states have call successors, (19) [2022-02-21 03:13:20,887 INFO L87 Difference]: Start difference. First operand 333 states. Second operand has 333 states, 308 states have (on average 1.2207792207792207) internal successors, (376), 321 states have internal predecessors, (376), 19 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (19), 10 states have call predecessors, (19), 19 states have call successors, (19) [2022-02-21 03:13:20,893 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:13:20,893 INFO L93 Difference]: Finished difference Result 333 states and 414 transitions. [2022-02-21 03:13:20,893 INFO L276 IsEmpty]: Start isEmpty. Operand 333 states and 414 transitions. [2022-02-21 03:13:20,893 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:13:20,894 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:13:20,894 INFO L74 IsIncluded]: Start isIncluded. First operand has 333 states, 308 states have (on average 1.2207792207792207) internal successors, (376), 321 states have internal predecessors, (376), 19 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (19), 10 states have call predecessors, (19), 19 states have call successors, (19) Second operand 333 states. [2022-02-21 03:13:20,895 INFO L87 Difference]: Start difference. First operand has 333 states, 308 states have (on average 1.2207792207792207) internal successors, (376), 321 states have internal predecessors, (376), 19 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (19), 10 states have call predecessors, (19), 19 states have call successors, (19) Second operand 333 states. [2022-02-21 03:13:20,900 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:13:20,900 INFO L93 Difference]: Finished difference Result 333 states and 414 transitions. [2022-02-21 03:13:20,900 INFO L276 IsEmpty]: Start isEmpty. Operand 333 states and 414 transitions. [2022-02-21 03:13:20,900 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:13:20,901 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:13:20,901 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 03:13:20,901 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 03:13:20,901 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 333 states, 308 states have (on average 1.2207792207792207) internal successors, (376), 321 states have internal predecessors, (376), 19 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (19), 10 states have call predecessors, (19), 19 states have call successors, (19) [2022-02-21 03:13:20,907 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 333 states to 333 states and 414 transitions. [2022-02-21 03:13:20,907 INFO L78 Accepts]: Start accepts. Automaton has 333 states and 414 transitions. Word has length 61 [2022-02-21 03:13:20,907 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-21 03:13:20,907 INFO L470 AbstractCegarLoop]: Abstraction has 333 states and 414 transitions. [2022-02-21 03:13:20,907 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 14.75) internal successors, (118), 8 states have internal predecessors, (118), 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:13:20,907 INFO L276 IsEmpty]: Start isEmpty. Operand 333 states and 414 transitions. [2022-02-21 03:13:20,908 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2022-02-21 03:13:20,908 INFO L506 BasicCegarLoop]: Found error trace [2022-02-21 03:13:20,908 INFO L514 BasicCegarLoop]: trace histogram [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] [2022-02-21 03:13:20,930 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:13:21,128 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:13:21,129 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2022-02-21 03:13:21,129 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:13:21,129 INFO L85 PathProgramCache]: Analyzing trace with hash 1237285228, now seen corresponding path program 1 times [2022-02-21 03:13:21,129 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:13:21,129 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1038006355] [2022-02-21 03:13:21,129 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:13:21,129 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:13:21,194 ERROR L252 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-02-21 03:13:21,194 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1923842601] [2022-02-21 03:13:21,195 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:13:21,195 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-21 03:13:21,195 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:13:21,196 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:13:21,197 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:13:21,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:13:21,895 INFO L263 TraceCheckSpWp]: Trace formula consists of 1535 conjuncts, 5 conjunts are in the unsatisfiable core [2022-02-21 03:13:21,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:13:21,910 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 03:13:22,141 INFO L290 TraceCheckUtils]: 0: Hoare triple {7575#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);~count_int_int~0 := 0; {7575#true} is VALID [2022-02-21 03:13:22,142 INFO L290 TraceCheckUtils]: 1: Hoare triple {7575#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc6#1.base, main_#t~malloc6#1.offset, main_#t~mem8#1, main_#t~mem7#1, main_#t~mem9#1, main_#t~mem10#1, main_#t~mem12#1, main_#t~mem11#1, main_#t~mem13#1, main_#t~mem14#1, main_#t~mem16#1, main_#t~mem15#1, main_#t~mem17#1, main_#t~mem18#1, main_#t~switch19#1, main_#t~mem20#1, main_#t~mem21#1, main_#t~mem22#1, main_#t~mem23#1, main_#t~mem24#1, main_#t~mem25#1, main_#t~mem26#1, main_#t~mem27#1, main_#t~mem28#1, main_#t~mem29#1, main_#t~mem30#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~malloc31#1.base, main_#t~malloc31#1.offset, main_#t~mem32#1.base, main_#t~mem32#1.offset, main_#t~mem33#1.base, main_#t~mem33#1.offset, main_#t~memset~res34#1.base, main_#t~memset~res34#1.offset, main_#t~mem35#1.base, main_#t~mem35#1.offset, main_#t~mem36#1.base, main_#t~mem36#1.offset, main_#t~mem37#1.base, main_#t~mem37#1.offset, main_#t~mem38#1.base, main_#t~mem38#1.offset, main_#t~mem39#1.base, main_#t~mem39#1.offset, main_#t~malloc40#1.base, main_#t~malloc40#1.offset, main_#t~mem41#1.base, main_#t~mem41#1.offset, main_#t~mem42#1.base, main_#t~mem42#1.offset, main_#t~mem43#1.base, main_#t~mem43#1.offset, main_#t~mem44#1.base, main_#t~mem44#1.offset, main_#t~mem45#1.base, main_#t~mem45#1.offset, main_#t~mem46#1.base, main_#t~mem46#1.offset, main_#t~memset~res47#1.base, main_#t~memset~res47#1.offset, main_#t~mem48#1.base, main_#t~mem48#1.offset, main_#t~mem49#1.base, main_#t~mem49#1.offset, main_#t~mem50#1.base, main_#t~mem50#1.offset, main_#t~mem51#1.base, main_#t~mem51#1.offset, main_#t~mem52#1, main_#t~mem53#1.base, main_#t~mem53#1.offset, main_#t~mem54#1.base, main_#t~mem54#1.offset, main_#t~mem55#1.base, main_#t~mem55#1.offset, main_#t~mem56#1.base, main_#t~mem56#1.offset, main_#t~mem57#1, main_#t~post58#1, main_#t~mem59#1.base, main_#t~mem59#1.offset, main_#t~mem60#1, main_#t~mem61#1.base, main_#t~mem61#1.offset, main_#t~mem62#1.base, main_#t~mem62#1.offset, main_#t~mem63#1, main_#t~post64#1, main_#t~mem65#1.base, main_#t~mem65#1.offset, main_#t~mem66#1.base, main_#t~mem66#1.offset, main_#t~mem67#1.base, main_#t~mem67#1.offset, main_#t~mem69#1, main_#t~mem68#1, main_#t~mem70#1.base, main_#t~mem70#1.offset, main_#t~mem71#1, main_#t~short72#1, main_#t~mem73#1.base, main_#t~mem73#1.offset, main_#t~mem74#1, main_#t~malloc75#1.base, main_#t~malloc75#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~mem79#1, main_#t~memset~res80#1.base, main_#t~memset~res80#1.offset, main_#t~mem81#1.base, main_#t~mem81#1.offset, main_#t~mem82#1.base, main_#t~mem82#1.offset, main_#t~mem85#1, main_#t~mem83#1.base, main_#t~mem83#1.offset, main_#t~mem84#1, main_#t~mem86#1.base, main_#t~mem86#1.offset, main_#t~mem89#1, main_#t~mem87#1.base, main_#t~mem87#1.offset, main_#t~mem88#1, main_#t~ite90#1, main_#t~mem91#1.base, main_#t~mem91#1.offset, main_#t~mem95#1.base, main_#t~mem95#1.offset, main_#t~mem96#1.base, main_#t~mem96#1.offset, main_#t~mem97#1.base, main_#t~mem97#1.offset, main_#t~mem98#1.base, main_#t~mem98#1.offset, main_#t~mem101#1, main_#t~mem99#1.base, main_#t~mem99#1.offset, main_#t~mem100#1, main_#t~mem102#1.base, main_#t~mem102#1.offset, main_#t~mem103#1, main_#t~pre104#1, main_#t~mem105#1.base, main_#t~mem105#1.offset, main_#t~mem106#1, main_#t~mem107#1.base, main_#t~mem107#1.offset, main_#t~mem108#1, main_#t~post109#1, main_#t~mem113#1, main_#t~mem111#1, main_#t~mem110#1.base, main_#t~mem110#1.offset, main_#t~mem112#1, main_#t~mem114#1, main_#t~post115#1, main_#t~mem116#1.base, main_#t~mem116#1.offset, main_#t~mem117#1.base, main_#t~mem117#1.offset, main_#t~mem118#1.base, main_#t~mem118#1.offset, main_#t~post92#1, main_#t~mem93#1.base, main_#t~mem93#1.offset, main_#t~mem94#1, main_#t~mem119#1.base, main_#t~mem119#1.offset, main_#t~mem120#1.base, main_#t~mem120#1.offset, main_#t~mem121#1.base, main_#t~mem121#1.offset, main_#t~mem122#1, main_#t~mem123#1.base, main_#t~mem123#1.offset, main_#t~mem124#1, main_#t~post125#1, main_#t~mem126#1.base, main_#t~mem126#1.offset, main_#t~mem127#1.base, main_#t~mem127#1.offset, main_#t~mem128#1.base, main_#t~mem128#1.offset, main_#t~mem129#1.base, main_#t~mem129#1.offset, main_#t~mem132#1, main_#t~mem130#1.base, main_#t~mem130#1.offset, main_#t~mem131#1, main_#t~ite135#1, main_#t~mem133#1.base, main_#t~mem133#1.offset, main_#t~mem134#1, main_#t~mem136#1.base, main_#t~mem136#1.offset, main_#t~mem137#1, main_#t~mem138#1.base, main_#t~mem138#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~post5#1, main_#t~mem140#1, main_#t~mem141#1, main_#t~mem139#1.base, main_#t~mem139#1.offset, main_~i~0#1, main_~user~0#1.base, main_~user~0#1.offset, main_~users~0#1.base, main_~users~0#1.offset;havoc main_~i~0#1;havoc main_~user~0#1.base, main_~user~0#1.offset;main_~users~0#1.base, main_~users~0#1.offset := 0, 0;main_~i~0#1 := 0; {7583#(and (= |ULTIMATE.start_main_~users~0#1.offset| 0) (= |ULTIMATE.start_main_~users~0#1.base| 0))} is VALID [2022-02-21 03:13:22,142 INFO L290 TraceCheckUtils]: 2: Hoare triple {7583#(and (= |ULTIMATE.start_main_~users~0#1.offset| 0) (= |ULTIMATE.start_main_~users~0#1.base| 0))} assume !!(main_~i~0#1 < 10);call main_#t~malloc6#1.base, main_#t~malloc6#1.offset := #Ultimate.allocOnHeap(40);main_~user~0#1.base, main_~user~0#1.offset := main_#t~malloc6#1.base, main_#t~malloc6#1.offset;havoc main_#t~malloc6#1.base, main_#t~malloc6#1.offset; {7583#(and (= |ULTIMATE.start_main_~users~0#1.offset| 0) (= |ULTIMATE.start_main_~users~0#1.base| 0))} is VALID [2022-02-21 03:13:22,143 INFO L290 TraceCheckUtils]: 3: Hoare triple {7583#(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); {7583#(and (= |ULTIMATE.start_main_~users~0#1.offset| 0) (= |ULTIMATE.start_main_~users~0#1.base| 0))} is VALID [2022-02-21 03:13:22,143 INFO L290 TraceCheckUtils]: 4: Hoare triple {7583#(and (= |ULTIMATE.start_main_~users~0#1.offset| 0) (= |ULTIMATE.start_main_~users~0#1.base| 0))} call write~int(main_~i~0#1, main_~user~0#1.base, main_~user~0#1.offset, 4); {7583#(and (= |ULTIMATE.start_main_~users~0#1.offset| 0) (= |ULTIMATE.start_main_~users~0#1.base| 0))} is VALID [2022-02-21 03:13:22,144 INFO L290 TraceCheckUtils]: 5: Hoare triple {7583#(and (= |ULTIMATE.start_main_~users~0#1.offset| 0) (= |ULTIMATE.start_main_~users~0#1.base| 0))} assume main_~i~0#1 * main_~i~0#1 <= 2147483647; {7583#(and (= |ULTIMATE.start_main_~users~0#1.offset| 0) (= |ULTIMATE.start_main_~users~0#1.base| 0))} is VALID [2022-02-21 03:13:22,144 INFO L290 TraceCheckUtils]: 6: Hoare triple {7583#(and (= |ULTIMATE.start_main_~users~0#1.offset| 0) (= |ULTIMATE.start_main_~users~0#1.base| 0))} assume main_~i~0#1 * main_~i~0#1 >= -2147483648;call write~int(main_~i~0#1 * main_~i~0#1, main_~user~0#1.base, 4 + main_~user~0#1.offset, 4); {7583#(and (= |ULTIMATE.start_main_~users~0#1.offset| 0) (= |ULTIMATE.start_main_~users~0#1.base| 0))} is VALID [2022-02-21 03:13:22,144 INFO L290 TraceCheckUtils]: 7: Hoare triple {7583#(and (= |ULTIMATE.start_main_~users~0#1.offset| 0) (= |ULTIMATE.start_main_~users~0#1.base| 0))} havoc main_~_ha_hashv~0#1; {7583#(and (= |ULTIMATE.start_main_~users~0#1.offset| 0) (= |ULTIMATE.start_main_~users~0#1.base| 0))} is VALID [2022-02-21 03:13:22,145 INFO L290 TraceCheckUtils]: 8: Hoare triple {7583#(and (= |ULTIMATE.start_main_~users~0#1.offset| 0) (= |ULTIMATE.start_main_~users~0#1.base| 0))} goto; {7583#(and (= |ULTIMATE.start_main_~users~0#1.offset| 0) (= |ULTIMATE.start_main_~users~0#1.base| 0))} is VALID [2022-02-21 03:13:22,145 INFO L290 TraceCheckUtils]: 9: Hoare triple {7583#(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; {7583#(and (= |ULTIMATE.start_main_~users~0#1.offset| 0) (= |ULTIMATE.start_main_~users~0#1.base| 0))} is VALID [2022-02-21 03:13:22,145 INFO L290 TraceCheckUtils]: 10: Hoare triple {7583#(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); {7583#(and (= |ULTIMATE.start_main_~users~0#1.offset| 0) (= |ULTIMATE.start_main_~users~0#1.base| 0))} is VALID [2022-02-21 03:13:22,146 INFO L290 TraceCheckUtils]: 11: Hoare triple {7583#(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~switch19#1 := 11 == main_~_hj_k~0#1; {7583#(and (= |ULTIMATE.start_main_~users~0#1.offset| 0) (= |ULTIMATE.start_main_~users~0#1.base| 0))} is VALID [2022-02-21 03:13:22,146 INFO L290 TraceCheckUtils]: 12: Hoare triple {7583#(and (= |ULTIMATE.start_main_~users~0#1.offset| 0) (= |ULTIMATE.start_main_~users~0#1.base| 0))} assume !main_#t~switch19#1; {7583#(and (= |ULTIMATE.start_main_~users~0#1.offset| 0) (= |ULTIMATE.start_main_~users~0#1.base| 0))} is VALID [2022-02-21 03:13:22,147 INFO L290 TraceCheckUtils]: 13: Hoare triple {7583#(and (= |ULTIMATE.start_main_~users~0#1.offset| 0) (= |ULTIMATE.start_main_~users~0#1.base| 0))} main_#t~switch19#1 := main_#t~switch19#1 || 10 == main_~_hj_k~0#1; {7583#(and (= |ULTIMATE.start_main_~users~0#1.offset| 0) (= |ULTIMATE.start_main_~users~0#1.base| 0))} is VALID [2022-02-21 03:13:22,147 INFO L290 TraceCheckUtils]: 14: Hoare triple {7583#(and (= |ULTIMATE.start_main_~users~0#1.offset| 0) (= |ULTIMATE.start_main_~users~0#1.base| 0))} assume !main_#t~switch19#1; {7583#(and (= |ULTIMATE.start_main_~users~0#1.offset| 0) (= |ULTIMATE.start_main_~users~0#1.base| 0))} is VALID [2022-02-21 03:13:22,147 INFO L290 TraceCheckUtils]: 15: Hoare triple {7583#(and (= |ULTIMATE.start_main_~users~0#1.offset| 0) (= |ULTIMATE.start_main_~users~0#1.base| 0))} main_#t~switch19#1 := main_#t~switch19#1 || 9 == main_~_hj_k~0#1; {7583#(and (= |ULTIMATE.start_main_~users~0#1.offset| 0) (= |ULTIMATE.start_main_~users~0#1.base| 0))} is VALID [2022-02-21 03:13:22,148 INFO L290 TraceCheckUtils]: 16: Hoare triple {7583#(and (= |ULTIMATE.start_main_~users~0#1.offset| 0) (= |ULTIMATE.start_main_~users~0#1.base| 0))} assume !main_#t~switch19#1; {7583#(and (= |ULTIMATE.start_main_~users~0#1.offset| 0) (= |ULTIMATE.start_main_~users~0#1.base| 0))} is VALID [2022-02-21 03:13:22,148 INFO L290 TraceCheckUtils]: 17: Hoare triple {7583#(and (= |ULTIMATE.start_main_~users~0#1.offset| 0) (= |ULTIMATE.start_main_~users~0#1.base| 0))} main_#t~switch19#1 := main_#t~switch19#1 || 8 == main_~_hj_k~0#1; {7583#(and (= |ULTIMATE.start_main_~users~0#1.offset| 0) (= |ULTIMATE.start_main_~users~0#1.base| 0))} is VALID [2022-02-21 03:13:22,148 INFO L290 TraceCheckUtils]: 18: Hoare triple {7583#(and (= |ULTIMATE.start_main_~users~0#1.offset| 0) (= |ULTIMATE.start_main_~users~0#1.base| 0))} assume !main_#t~switch19#1; {7583#(and (= |ULTIMATE.start_main_~users~0#1.offset| 0) (= |ULTIMATE.start_main_~users~0#1.base| 0))} is VALID [2022-02-21 03:13:22,149 INFO L290 TraceCheckUtils]: 19: Hoare triple {7583#(and (= |ULTIMATE.start_main_~users~0#1.offset| 0) (= |ULTIMATE.start_main_~users~0#1.base| 0))} main_#t~switch19#1 := main_#t~switch19#1 || 7 == main_~_hj_k~0#1; {7583#(and (= |ULTIMATE.start_main_~users~0#1.offset| 0) (= |ULTIMATE.start_main_~users~0#1.base| 0))} is VALID [2022-02-21 03:13:22,149 INFO L290 TraceCheckUtils]: 20: Hoare triple {7583#(and (= |ULTIMATE.start_main_~users~0#1.offset| 0) (= |ULTIMATE.start_main_~users~0#1.base| 0))} assume !main_#t~switch19#1; {7583#(and (= |ULTIMATE.start_main_~users~0#1.offset| 0) (= |ULTIMATE.start_main_~users~0#1.base| 0))} is VALID [2022-02-21 03:13:22,149 INFO L290 TraceCheckUtils]: 21: Hoare triple {7583#(and (= |ULTIMATE.start_main_~users~0#1.offset| 0) (= |ULTIMATE.start_main_~users~0#1.base| 0))} main_#t~switch19#1 := main_#t~switch19#1 || 6 == main_~_hj_k~0#1; {7583#(and (= |ULTIMATE.start_main_~users~0#1.offset| 0) (= |ULTIMATE.start_main_~users~0#1.base| 0))} is VALID [2022-02-21 03:13:22,150 INFO L290 TraceCheckUtils]: 22: Hoare triple {7583#(and (= |ULTIMATE.start_main_~users~0#1.offset| 0) (= |ULTIMATE.start_main_~users~0#1.base| 0))} assume !main_#t~switch19#1; {7583#(and (= |ULTIMATE.start_main_~users~0#1.offset| 0) (= |ULTIMATE.start_main_~users~0#1.base| 0))} is VALID [2022-02-21 03:13:22,150 INFO L290 TraceCheckUtils]: 23: Hoare triple {7583#(and (= |ULTIMATE.start_main_~users~0#1.offset| 0) (= |ULTIMATE.start_main_~users~0#1.base| 0))} main_#t~switch19#1 := main_#t~switch19#1 || 5 == main_~_hj_k~0#1; {7583#(and (= |ULTIMATE.start_main_~users~0#1.offset| 0) (= |ULTIMATE.start_main_~users~0#1.base| 0))} is VALID [2022-02-21 03:13:22,150 INFO L290 TraceCheckUtils]: 24: Hoare triple {7583#(and (= |ULTIMATE.start_main_~users~0#1.offset| 0) (= |ULTIMATE.start_main_~users~0#1.base| 0))} assume !main_#t~switch19#1; {7583#(and (= |ULTIMATE.start_main_~users~0#1.offset| 0) (= |ULTIMATE.start_main_~users~0#1.base| 0))} is VALID [2022-02-21 03:13:22,155 INFO L290 TraceCheckUtils]: 25: Hoare triple {7583#(and (= |ULTIMATE.start_main_~users~0#1.offset| 0) (= |ULTIMATE.start_main_~users~0#1.base| 0))} main_#t~switch19#1 := main_#t~switch19#1 || 4 == main_~_hj_k~0#1; {7583#(and (= |ULTIMATE.start_main_~users~0#1.offset| 0) (= |ULTIMATE.start_main_~users~0#1.base| 0))} is VALID [2022-02-21 03:13:22,156 INFO L290 TraceCheckUtils]: 26: Hoare triple {7583#(and (= |ULTIMATE.start_main_~users~0#1.offset| 0) (= |ULTIMATE.start_main_~users~0#1.base| 0))} assume main_#t~switch19#1;call main_#t~mem27#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~mem27#1 % 256);havoc main_#t~mem27#1; {7583#(and (= |ULTIMATE.start_main_~users~0#1.offset| 0) (= |ULTIMATE.start_main_~users~0#1.base| 0))} is VALID [2022-02-21 03:13:22,159 INFO L290 TraceCheckUtils]: 27: Hoare triple {7583#(and (= |ULTIMATE.start_main_~users~0#1.offset| 0) (= |ULTIMATE.start_main_~users~0#1.base| 0))} main_#t~switch19#1 := main_#t~switch19#1 || 3 == main_~_hj_k~0#1; {7583#(and (= |ULTIMATE.start_main_~users~0#1.offset| 0) (= |ULTIMATE.start_main_~users~0#1.base| 0))} is VALID [2022-02-21 03:13:22,160 INFO L290 TraceCheckUtils]: 28: Hoare triple {7583#(and (= |ULTIMATE.start_main_~users~0#1.offset| 0) (= |ULTIMATE.start_main_~users~0#1.base| 0))} assume main_#t~switch19#1;call main_#t~mem28#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~mem28#1 % 256);havoc main_#t~mem28#1; {7583#(and (= |ULTIMATE.start_main_~users~0#1.offset| 0) (= |ULTIMATE.start_main_~users~0#1.base| 0))} is VALID [2022-02-21 03:13:22,160 INFO L290 TraceCheckUtils]: 29: Hoare triple {7583#(and (= |ULTIMATE.start_main_~users~0#1.offset| 0) (= |ULTIMATE.start_main_~users~0#1.base| 0))} main_#t~switch19#1 := main_#t~switch19#1 || 2 == main_~_hj_k~0#1; {7583#(and (= |ULTIMATE.start_main_~users~0#1.offset| 0) (= |ULTIMATE.start_main_~users~0#1.base| 0))} is VALID [2022-02-21 03:13:22,161 INFO L290 TraceCheckUtils]: 30: Hoare triple {7583#(and (= |ULTIMATE.start_main_~users~0#1.offset| 0) (= |ULTIMATE.start_main_~users~0#1.base| 0))} assume main_#t~switch19#1;call main_#t~mem29#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~mem29#1 % 256);havoc main_#t~mem29#1; {7583#(and (= |ULTIMATE.start_main_~users~0#1.offset| 0) (= |ULTIMATE.start_main_~users~0#1.base| 0))} is VALID [2022-02-21 03:13:22,161 INFO L290 TraceCheckUtils]: 31: Hoare triple {7583#(and (= |ULTIMATE.start_main_~users~0#1.offset| 0) (= |ULTIMATE.start_main_~users~0#1.base| 0))} main_#t~switch19#1 := main_#t~switch19#1 || 1 == main_~_hj_k~0#1; {7583#(and (= |ULTIMATE.start_main_~users~0#1.offset| 0) (= |ULTIMATE.start_main_~users~0#1.base| 0))} is VALID [2022-02-21 03:13:22,162 INFO L290 TraceCheckUtils]: 32: Hoare triple {7583#(and (= |ULTIMATE.start_main_~users~0#1.offset| 0) (= |ULTIMATE.start_main_~users~0#1.base| 0))} assume main_#t~switch19#1;call main_#t~mem30#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~mem30#1 % 256;havoc main_#t~mem30#1; {7583#(and (= |ULTIMATE.start_main_~users~0#1.offset| 0) (= |ULTIMATE.start_main_~users~0#1.base| 0))} is VALID [2022-02-21 03:13:22,162 INFO L290 TraceCheckUtils]: 33: Hoare triple {7583#(and (= |ULTIMATE.start_main_~users~0#1.offset| 0) (= |ULTIMATE.start_main_~users~0#1.base| 0))} havoc main_#t~switch19#1; {7583#(and (= |ULTIMATE.start_main_~users~0#1.offset| 0) (= |ULTIMATE.start_main_~users~0#1.base| 0))} is VALID [2022-02-21 03:13:22,163 INFO L290 TraceCheckUtils]: 34: Hoare triple {7583#(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)))); {7583#(and (= |ULTIMATE.start_main_~users~0#1.offset| 0) (= |ULTIMATE.start_main_~users~0#1.base| 0))} is VALID [2022-02-21 03:13:22,164 INFO L290 TraceCheckUtils]: 35: Hoare triple {7583#(and (= |ULTIMATE.start_main_~users~0#1.offset| 0) (= |ULTIMATE.start_main_~users~0#1.base| 0))} goto; {7583#(and (= |ULTIMATE.start_main_~users~0#1.offset| 0) (= |ULTIMATE.start_main_~users~0#1.base| 0))} is VALID [2022-02-21 03:13:22,164 INFO L290 TraceCheckUtils]: 36: Hoare triple {7583#(and (= |ULTIMATE.start_main_~users~0#1.offset| 0) (= |ULTIMATE.start_main_~users~0#1.base| 0))} goto; {7583#(and (= |ULTIMATE.start_main_~users~0#1.offset| 0) (= |ULTIMATE.start_main_~users~0#1.base| 0))} is VALID [2022-02-21 03:13:22,164 INFO L290 TraceCheckUtils]: 37: Hoare triple {7583#(and (= |ULTIMATE.start_main_~users~0#1.offset| 0) (= |ULTIMATE.start_main_~users~0#1.base| 0))} goto; {7583#(and (= |ULTIMATE.start_main_~users~0#1.offset| 0) (= |ULTIMATE.start_main_~users~0#1.base| 0))} is VALID [2022-02-21 03:13:22,165 INFO L290 TraceCheckUtils]: 38: Hoare triple {7583#(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); {7583#(and (= |ULTIMATE.start_main_~users~0#1.offset| 0) (= |ULTIMATE.start_main_~users~0#1.base| 0))} is VALID [2022-02-21 03:13:22,165 INFO L290 TraceCheckUtils]: 39: Hoare triple {7583#(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~mem48#1.base, main_#t~mem48#1.offset := read~$Pointer$(main_~users~0#1.base, 8 + main_~users~0#1.offset, 4);call write~$Pointer$(main_#t~mem48#1.base, main_#t~mem48#1.offset, main_~user~0#1.base, 8 + main_~user~0#1.offset, 4);havoc main_#t~mem48#1.base, main_#t~mem48#1.offset; {7576#false} is VALID [2022-02-21 03:13:22,165 INFO L290 TraceCheckUtils]: 40: Hoare triple {7576#false} call write~$Pointer$(0, 0, main_~user~0#1.base, 16 + main_~user~0#1.offset, 4);call main_#t~mem49#1.base, main_#t~mem49#1.offset := read~$Pointer$(main_~users~0#1.base, 8 + main_~users~0#1.offset, 4);call main_#t~mem50#1.base, main_#t~mem50#1.offset := read~$Pointer$(main_#t~mem49#1.base, 16 + main_#t~mem49#1.offset, 4);call main_#t~mem51#1.base, main_#t~mem51#1.offset := read~$Pointer$(main_~users~0#1.base, 8 + main_~users~0#1.offset, 4);call main_#t~mem52#1 := read~int(main_#t~mem51#1.base, 20 + main_#t~mem51#1.offset, 4);call write~$Pointer$(main_#t~mem50#1.base, main_#t~mem50#1.offset - main_#t~mem52#1, main_~user~0#1.base, 12 + main_~user~0#1.offset, 4);havoc main_#t~mem49#1.base, main_#t~mem49#1.offset;havoc main_#t~mem50#1.base, main_#t~mem50#1.offset;havoc main_#t~mem51#1.base, main_#t~mem51#1.offset;havoc main_#t~mem52#1;call main_#t~mem53#1.base, main_#t~mem53#1.offset := read~$Pointer$(main_~users~0#1.base, 8 + main_~users~0#1.offset, 4);call main_#t~mem54#1.base, main_#t~mem54#1.offset := read~$Pointer$(main_#t~mem53#1.base, 16 + main_#t~mem53#1.offset, 4);call write~$Pointer$(main_~user~0#1.base, main_~user~0#1.offset, main_#t~mem54#1.base, 8 + main_#t~mem54#1.offset, 4);havoc main_#t~mem53#1.base, main_#t~mem53#1.offset;havoc main_#t~mem54#1.base, main_#t~mem54#1.offset;call main_#t~mem55#1.base, main_#t~mem55#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~mem55#1.base, 16 + main_#t~mem55#1.offset, 4);havoc main_#t~mem55#1.base, main_#t~mem55#1.offset; {7576#false} is VALID [2022-02-21 03:13:22,165 INFO L290 TraceCheckUtils]: 41: Hoare triple {7576#false} goto; {7576#false} is VALID [2022-02-21 03:13:22,166 INFO L290 TraceCheckUtils]: 42: Hoare triple {7576#false} havoc main_~_ha_bkt~0#1;call main_#t~mem56#1.base, main_#t~mem56#1.offset := read~$Pointer$(main_~users~0#1.base, 8 + main_~users~0#1.offset, 4);call main_#t~mem57#1 := read~int(main_#t~mem56#1.base, 12 + main_#t~mem56#1.offset, 4);main_#t~post58#1 := main_#t~mem57#1;call write~int(1 + main_#t~post58#1, main_#t~mem56#1.base, 12 + main_#t~mem56#1.offset, 4);havoc main_#t~mem56#1.base, main_#t~mem56#1.offset;havoc main_#t~mem57#1;havoc main_#t~post58#1; {7576#false} is VALID [2022-02-21 03:13:22,166 INFO L290 TraceCheckUtils]: 43: Hoare triple {7576#false} call main_#t~mem59#1.base, main_#t~mem59#1.offset := read~$Pointer$(main_~users~0#1.base, 8 + main_~users~0#1.offset, 4);call main_#t~mem60#1 := read~int(main_#t~mem59#1.base, 4 + main_#t~mem59#1.offset, 4);main_~_ha_bkt~0#1 := (if 0 == main_~_ha_hashv~0#1 || 0 == main_#t~mem60#1 - 1 then 0 else (if 1 == main_#t~mem60#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~mem60#1 - 1))) else (if 1 == main_~_ha_hashv~0#1 then (if 1 == main_#t~mem60#1 - 1 || 0 == main_#t~mem60#1 - 1 then main_#t~mem60#1 - 1 else (if main_#t~mem60#1 - 1 >= 0 then (main_#t~mem60#1 - 1) % 2 else ~bitwiseAnd(main_~_ha_hashv~0#1, main_#t~mem60#1 - 1))) else ~bitwiseAnd(main_~_ha_hashv~0#1, main_#t~mem60#1 - 1))));havoc main_#t~mem59#1.base, main_#t~mem59#1.offset;havoc main_#t~mem60#1; {7576#false} is VALID [2022-02-21 03:13:22,166 INFO L290 TraceCheckUtils]: 44: Hoare triple {7576#false} goto; {7576#false} is VALID [2022-02-21 03:13:22,166 INFO L290 TraceCheckUtils]: 45: Hoare triple {7576#false} call main_#t~mem61#1.base, main_#t~mem61#1.offset := read~$Pointer$(main_~users~0#1.base, 8 + main_~users~0#1.offset, 4);call main_#t~mem62#1.base, main_#t~mem62#1.offset := read~$Pointer$(main_#t~mem61#1.base, main_#t~mem61#1.offset, 4);main_~_ha_head~0#1.base, main_~_ha_head~0#1.offset := main_#t~mem62#1.base, main_#t~mem62#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~mem61#1.base, main_#t~mem61#1.offset;havoc main_#t~mem62#1.base, main_#t~mem62#1.offset;call main_#t~mem63#1 := read~int(main_~_ha_head~0#1.base, 4 + main_~_ha_head~0#1.offset, 4);main_#t~post64#1 := main_#t~mem63#1;call write~int(1 + main_#t~post64#1, main_~_ha_head~0#1.base, 4 + main_~_ha_head~0#1.offset, 4);havoc main_#t~mem63#1;havoc main_#t~post64#1;call main_#t~mem65#1.base, main_#t~mem65#1.offset := read~$Pointer$(main_~_ha_head~0#1.base, main_~_ha_head~0#1.offset, 4);call write~$Pointer$(main_#t~mem65#1.base, main_#t~mem65#1.offset, main_~user~0#1.base, 24 + main_~user~0#1.offset, 4);havoc main_#t~mem65#1.base, main_#t~mem65#1.offset;call write~$Pointer$(0, 0, main_~user~0#1.base, 20 + main_~user~0#1.offset, 4);call main_#t~mem66#1.base, main_#t~mem66#1.offset := read~$Pointer$(main_~_ha_head~0#1.base, main_~_ha_head~0#1.offset, 4); {7576#false} is VALID [2022-02-21 03:13:22,166 INFO L290 TraceCheckUtils]: 46: Hoare triple {7576#false} assume main_#t~mem66#1.base != 0 || main_#t~mem66#1.offset != 0;havoc main_#t~mem66#1.base, main_#t~mem66#1.offset;call main_#t~mem67#1.base, main_#t~mem67#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~mem67#1.base, 12 + main_#t~mem67#1.offset, 4);havoc main_#t~mem67#1.base, main_#t~mem67#1.offset; {7576#false} is VALID [2022-02-21 03:13:22,166 INFO L290 TraceCheckUtils]: 47: Hoare triple {7576#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~mem69#1 := read~int(main_~_ha_head~0#1.base, 4 + main_~_ha_head~0#1.offset, 4);call main_#t~mem68#1 := read~int(main_~_ha_head~0#1.base, 8 + main_~_ha_head~0#1.offset, 4);main_#t~short72#1 := main_#t~mem69#1 % 4294967296 >= 10 * (1 + main_#t~mem68#1) % 4294967296; {7576#false} is VALID [2022-02-21 03:13:22,166 INFO L290 TraceCheckUtils]: 48: Hoare triple {7576#false} assume main_#t~short72#1;call main_#t~mem70#1.base, main_#t~mem70#1.offset := read~$Pointer$(main_~user~0#1.base, 8 + main_~user~0#1.offset, 4);call main_#t~mem71#1 := read~int(main_#t~mem70#1.base, 36 + main_#t~mem70#1.offset, 4);main_#t~short72#1 := 0 == main_#t~mem71#1 % 4294967296; {7576#false} is VALID [2022-02-21 03:13:22,166 INFO L290 TraceCheckUtils]: 49: Hoare triple {7576#false} assume !main_#t~short72#1;havoc main_#t~mem69#1;havoc main_#t~mem68#1;havoc main_#t~mem70#1.base, main_#t~mem70#1.offset;havoc main_#t~mem71#1;havoc main_#t~short72#1; {7576#false} is VALID [2022-02-21 03:13:22,166 INFO L290 TraceCheckUtils]: 50: Hoare triple {7576#false} goto; {7576#false} is VALID [2022-02-21 03:13:22,166 INFO L290 TraceCheckUtils]: 51: Hoare triple {7576#false} goto; {7576#false} is VALID [2022-02-21 03:13:22,166 INFO L290 TraceCheckUtils]: 52: Hoare triple {7576#false} goto; {7576#false} is VALID [2022-02-21 03:13:22,166 INFO L290 TraceCheckUtils]: 53: Hoare triple {7576#false} goto; {7576#false} is VALID [2022-02-21 03:13:22,166 INFO L290 TraceCheckUtils]: 54: Hoare triple {7576#false} main_#t~post5#1 := main_~i~0#1; {7576#false} is VALID [2022-02-21 03:13:22,166 INFO L290 TraceCheckUtils]: 55: Hoare triple {7576#false} assume 1 + main_#t~post5#1 <= 2147483647; {7576#false} is VALID [2022-02-21 03:13:22,166 INFO L290 TraceCheckUtils]: 56: Hoare triple {7576#false} assume 1 + main_#t~post5#1 >= -2147483648;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; {7576#false} is VALID [2022-02-21 03:13:22,166 INFO L290 TraceCheckUtils]: 57: Hoare triple {7576#false} assume !!(main_~i~0#1 < 10);call main_#t~malloc6#1.base, main_#t~malloc6#1.offset := #Ultimate.allocOnHeap(40);main_~user~0#1.base, main_~user~0#1.offset := main_#t~malloc6#1.base, main_#t~malloc6#1.offset;havoc main_#t~malloc6#1.base, main_#t~malloc6#1.offset; {7576#false} is VALID [2022-02-21 03:13:22,166 INFO L290 TraceCheckUtils]: 58: Hoare triple {7576#false} assume !(main_~user~0#1.base == 0 && main_~user~0#1.offset == 0); {7576#false} is VALID [2022-02-21 03:13:22,166 INFO L290 TraceCheckUtils]: 59: Hoare triple {7576#false} call write~int(main_~i~0#1, main_~user~0#1.base, main_~user~0#1.offset, 4); {7576#false} is VALID [2022-02-21 03:13:22,167 INFO L290 TraceCheckUtils]: 60: Hoare triple {7576#false} assume !(main_~i~0#1 * main_~i~0#1 <= 2147483647); {7576#false} is VALID [2022-02-21 03:13:22,167 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-21 03:13:22,167 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-21 03:13:22,167 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 03:13:22,167 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1038006355] [2022-02-21 03:13:22,167 WARN L317 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-02-21 03:13:22,167 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1923842601] [2022-02-21 03:13:22,167 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1923842601] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-21 03:13:22,167 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-21 03:13:22,167 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-21 03:13:22,168 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2023480125] [2022-02-21 03:13:22,168 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-21 03:13:22,168 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 20.333333333333332) internal successors, (61), 3 states have internal predecessors, (61), 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 61 [2022-02-21 03:13:22,168 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-21 03:13:22,168 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 20.333333333333332) internal successors, (61), 3 states have internal predecessors, (61), 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:13:22,209 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 61 edges. 61 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:13:22,209 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-21 03:13:22,209 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 03:13:22,210 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-21 03:13:22,210 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-21 03:13:22,210 INFO L87 Difference]: Start difference. First operand 333 states and 414 transitions. Second operand has 3 states, 3 states have (on average 20.333333333333332) internal successors, (61), 3 states have internal predecessors, (61), 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:13:22,622 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:13:22,622 INFO L93 Difference]: Finished difference Result 606 states and 760 transitions. [2022-02-21 03:13:22,623 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-21 03:13:22,623 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 20.333333333333332) internal successors, (61), 3 states have internal predecessors, (61), 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 61 [2022-02-21 03:13:22,623 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-21 03:13:22,623 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 20.333333333333332) internal successors, (61), 3 states have internal predecessors, (61), 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:13:22,625 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 389 transitions. [2022-02-21 03:13:22,625 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 20.333333333333332) internal successors, (61), 3 states have internal predecessors, (61), 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:13:22,627 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 389 transitions. [2022-02-21 03:13:22,628 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 389 transitions. [2022-02-21 03:13:22,897 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 389 edges. 389 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:13:22,901 INFO L225 Difference]: With dead ends: 606 [2022-02-21 03:13:22,901 INFO L226 Difference]: Without dead ends: 331 [2022-02-21 03:13:22,902 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 59 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:13:22,902 INFO L933 BasicCegarLoop]: 171 mSDtfsCounter, 15 mSDsluCounter, 155 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 326 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-21 03:13:22,902 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [17 Valid, 326 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-21 03:13:22,903 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 331 states. [2022-02-21 03:13:22,978 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 331 to 331. [2022-02-21 03:13:22,978 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 03:13:22,979 INFO L82 GeneralOperation]: Start isEquivalent. First operand 331 states. Second operand has 331 states, 306 states have (on average 1.2189542483660132) internal successors, (373), 319 states have internal predecessors, (373), 19 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (19), 10 states have call predecessors, (19), 19 states have call successors, (19) [2022-02-21 03:13:22,980 INFO L74 IsIncluded]: Start isIncluded. First operand 331 states. Second operand has 331 states, 306 states have (on average 1.2189542483660132) internal successors, (373), 319 states have internal predecessors, (373), 19 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (19), 10 states have call predecessors, (19), 19 states have call successors, (19) [2022-02-21 03:13:22,980 INFO L87 Difference]: Start difference. First operand 331 states. Second operand has 331 states, 306 states have (on average 1.2189542483660132) internal successors, (373), 319 states have internal predecessors, (373), 19 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (19), 10 states have call predecessors, (19), 19 states have call successors, (19) [2022-02-21 03:13:22,985 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:13:22,985 INFO L93 Difference]: Finished difference Result 331 states and 411 transitions. [2022-02-21 03:13:22,985 INFO L276 IsEmpty]: Start isEmpty. Operand 331 states and 411 transitions. [2022-02-21 03:13:22,986 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:13:22,986 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:13:22,988 INFO L74 IsIncluded]: Start isIncluded. First operand has 331 states, 306 states have (on average 1.2189542483660132) internal successors, (373), 319 states have internal predecessors, (373), 19 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (19), 10 states have call predecessors, (19), 19 states have call successors, (19) Second operand 331 states. [2022-02-21 03:13:22,989 INFO L87 Difference]: Start difference. First operand has 331 states, 306 states have (on average 1.2189542483660132) internal successors, (373), 319 states have internal predecessors, (373), 19 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (19), 10 states have call predecessors, (19), 19 states have call successors, (19) Second operand 331 states. [2022-02-21 03:13:22,994 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:13:22,994 INFO L93 Difference]: Finished difference Result 331 states and 411 transitions. [2022-02-21 03:13:22,995 INFO L276 IsEmpty]: Start isEmpty. Operand 331 states and 411 transitions. [2022-02-21 03:13:22,996 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:13:22,996 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:13:22,996 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 03:13:22,996 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 03:13:22,996 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 331 states, 306 states have (on average 1.2189542483660132) internal successors, (373), 319 states have internal predecessors, (373), 19 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (19), 10 states have call predecessors, (19), 19 states have call successors, (19) [2022-02-21 03:13:23,001 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 331 states to 331 states and 411 transitions. [2022-02-21 03:13:23,002 INFO L78 Accepts]: Start accepts. Automaton has 331 states and 411 transitions. Word has length 61 [2022-02-21 03:13:23,002 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-21 03:13:23,002 INFO L470 AbstractCegarLoop]: Abstraction has 331 states and 411 transitions. [2022-02-21 03:13:23,002 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 20.333333333333332) internal successors, (61), 3 states have internal predecessors, (61), 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:13:23,002 INFO L276 IsEmpty]: Start isEmpty. Operand 331 states and 411 transitions. [2022-02-21 03:13:23,003 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2022-02-21 03:13:23,003 INFO L506 BasicCegarLoop]: Found error trace [2022-02-21 03:13:23,003 INFO L514 BasicCegarLoop]: trace histogram [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] [2022-02-21 03:13:23,025 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2022-02-21 03:13:23,221 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-21 03:13:23,221 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2022-02-21 03:13:23,221 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:13:23,221 INFO L85 PathProgramCache]: Analyzing trace with hash -1438130325, now seen corresponding path program 1 times [2022-02-21 03:13:23,221 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:13:23,221 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1698254957] [2022-02-21 03:13:23,222 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:13:23,222 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:13:23,263 ERROR L252 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-02-21 03:13:23,263 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1850833715] [2022-02-21 03:13:23,263 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:13:23,263 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-21 03:13:23,263 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:13:23,265 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:13:23,265 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:13:42,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:13:42,634 INFO L263 TraceCheckSpWp]: Trace formula consists of 672 conjuncts, 5 conjunts are in the unsatisfiable core [2022-02-21 03:13:42,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:13:42,667 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 03:13:42,804 INFO L290 TraceCheckUtils]: 0: Hoare triple {9548#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);~count_int_int~0 := 0; {9548#true} is VALID [2022-02-21 03:13:42,804 INFO L290 TraceCheckUtils]: 1: Hoare triple {9548#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc6#1.base, main_#t~malloc6#1.offset, main_#t~mem8#1, main_#t~mem7#1, main_#t~mem9#1, main_#t~mem10#1, main_#t~mem12#1, main_#t~mem11#1, main_#t~mem13#1, main_#t~mem14#1, main_#t~mem16#1, main_#t~mem15#1, main_#t~mem17#1, main_#t~mem18#1, main_#t~switch19#1, main_#t~mem20#1, main_#t~mem21#1, main_#t~mem22#1, main_#t~mem23#1, main_#t~mem24#1, main_#t~mem25#1, main_#t~mem26#1, main_#t~mem27#1, main_#t~mem28#1, main_#t~mem29#1, main_#t~mem30#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~malloc31#1.base, main_#t~malloc31#1.offset, main_#t~mem32#1.base, main_#t~mem32#1.offset, main_#t~mem33#1.base, main_#t~mem33#1.offset, main_#t~memset~res34#1.base, main_#t~memset~res34#1.offset, main_#t~mem35#1.base, main_#t~mem35#1.offset, main_#t~mem36#1.base, main_#t~mem36#1.offset, main_#t~mem37#1.base, main_#t~mem37#1.offset, main_#t~mem38#1.base, main_#t~mem38#1.offset, main_#t~mem39#1.base, main_#t~mem39#1.offset, main_#t~malloc40#1.base, main_#t~malloc40#1.offset, main_#t~mem41#1.base, main_#t~mem41#1.offset, main_#t~mem42#1.base, main_#t~mem42#1.offset, main_#t~mem43#1.base, main_#t~mem43#1.offset, main_#t~mem44#1.base, main_#t~mem44#1.offset, main_#t~mem45#1.base, main_#t~mem45#1.offset, main_#t~mem46#1.base, main_#t~mem46#1.offset, main_#t~memset~res47#1.base, main_#t~memset~res47#1.offset, main_#t~mem48#1.base, main_#t~mem48#1.offset, main_#t~mem49#1.base, main_#t~mem49#1.offset, main_#t~mem50#1.base, main_#t~mem50#1.offset, main_#t~mem51#1.base, main_#t~mem51#1.offset, main_#t~mem52#1, main_#t~mem53#1.base, main_#t~mem53#1.offset, main_#t~mem54#1.base, main_#t~mem54#1.offset, main_#t~mem55#1.base, main_#t~mem55#1.offset, main_#t~mem56#1.base, main_#t~mem56#1.offset, main_#t~mem57#1, main_#t~post58#1, main_#t~mem59#1.base, main_#t~mem59#1.offset, main_#t~mem60#1, main_#t~mem61#1.base, main_#t~mem61#1.offset, main_#t~mem62#1.base, main_#t~mem62#1.offset, main_#t~mem63#1, main_#t~post64#1, main_#t~mem65#1.base, main_#t~mem65#1.offset, main_#t~mem66#1.base, main_#t~mem66#1.offset, main_#t~mem67#1.base, main_#t~mem67#1.offset, main_#t~mem69#1, main_#t~mem68#1, main_#t~mem70#1.base, main_#t~mem70#1.offset, main_#t~mem71#1, main_#t~short72#1, main_#t~mem73#1.base, main_#t~mem73#1.offset, main_#t~mem74#1, main_#t~malloc75#1.base, main_#t~malloc75#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~mem79#1, main_#t~memset~res80#1.base, main_#t~memset~res80#1.offset, main_#t~mem81#1.base, main_#t~mem81#1.offset, main_#t~mem82#1.base, main_#t~mem82#1.offset, main_#t~mem85#1, main_#t~mem83#1.base, main_#t~mem83#1.offset, main_#t~mem84#1, main_#t~mem86#1.base, main_#t~mem86#1.offset, main_#t~mem89#1, main_#t~mem87#1.base, main_#t~mem87#1.offset, main_#t~mem88#1, main_#t~ite90#1, main_#t~mem91#1.base, main_#t~mem91#1.offset, main_#t~mem95#1.base, main_#t~mem95#1.offset, main_#t~mem96#1.base, main_#t~mem96#1.offset, main_#t~mem97#1.base, main_#t~mem97#1.offset, main_#t~mem98#1.base, main_#t~mem98#1.offset, main_#t~mem101#1, main_#t~mem99#1.base, main_#t~mem99#1.offset, main_#t~mem100#1, main_#t~mem102#1.base, main_#t~mem102#1.offset, main_#t~mem103#1, main_#t~pre104#1, main_#t~mem105#1.base, main_#t~mem105#1.offset, main_#t~mem106#1, main_#t~mem107#1.base, main_#t~mem107#1.offset, main_#t~mem108#1, main_#t~post109#1, main_#t~mem113#1, main_#t~mem111#1, main_#t~mem110#1.base, main_#t~mem110#1.offset, main_#t~mem112#1, main_#t~mem114#1, main_#t~post115#1, main_#t~mem116#1.base, main_#t~mem116#1.offset, main_#t~mem117#1.base, main_#t~mem117#1.offset, main_#t~mem118#1.base, main_#t~mem118#1.offset, main_#t~post92#1, main_#t~mem93#1.base, main_#t~mem93#1.offset, main_#t~mem94#1, main_#t~mem119#1.base, main_#t~mem119#1.offset, main_#t~mem120#1.base, main_#t~mem120#1.offset, main_#t~mem121#1.base, main_#t~mem121#1.offset, main_#t~mem122#1, main_#t~mem123#1.base, main_#t~mem123#1.offset, main_#t~mem124#1, main_#t~post125#1, main_#t~mem126#1.base, main_#t~mem126#1.offset, main_#t~mem127#1.base, main_#t~mem127#1.offset, main_#t~mem128#1.base, main_#t~mem128#1.offset, main_#t~mem129#1.base, main_#t~mem129#1.offset, main_#t~mem132#1, main_#t~mem130#1.base, main_#t~mem130#1.offset, main_#t~mem131#1, main_#t~ite135#1, main_#t~mem133#1.base, main_#t~mem133#1.offset, main_#t~mem134#1, main_#t~mem136#1.base, main_#t~mem136#1.offset, main_#t~mem137#1, main_#t~mem138#1.base, main_#t~mem138#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~post5#1, main_#t~mem140#1, main_#t~mem141#1, main_#t~mem139#1.base, main_#t~mem139#1.offset, main_~i~0#1, main_~user~0#1.base, main_~user~0#1.offset, main_~users~0#1.base, main_~users~0#1.offset;havoc main_~i~0#1;havoc main_~user~0#1.base, main_~user~0#1.offset;main_~users~0#1.base, main_~users~0#1.offset := 0, 0;main_~i~0#1 := 0; {9548#true} is VALID [2022-02-21 03:13:42,804 INFO L290 TraceCheckUtils]: 2: Hoare triple {9548#true} assume !!(main_~i~0#1 < 10);call main_#t~malloc6#1.base, main_#t~malloc6#1.offset := #Ultimate.allocOnHeap(40);main_~user~0#1.base, main_~user~0#1.offset := main_#t~malloc6#1.base, main_#t~malloc6#1.offset;havoc main_#t~malloc6#1.base, main_#t~malloc6#1.offset; {9548#true} is VALID [2022-02-21 03:13:42,804 INFO L290 TraceCheckUtils]: 3: Hoare triple {9548#true} assume !(main_~user~0#1.base == 0 && main_~user~0#1.offset == 0); {9548#true} is VALID [2022-02-21 03:13:42,805 INFO L290 TraceCheckUtils]: 4: Hoare triple {9548#true} call write~int(main_~i~0#1, main_~user~0#1.base, main_~user~0#1.offset, 4); {9548#true} is VALID [2022-02-21 03:13:42,805 INFO L290 TraceCheckUtils]: 5: Hoare triple {9548#true} assume main_~i~0#1 * main_~i~0#1 <= 2147483647; {9548#true} is VALID [2022-02-21 03:13:42,805 INFO L290 TraceCheckUtils]: 6: Hoare triple {9548#true} assume main_~i~0#1 * main_~i~0#1 >= -2147483648;call write~int(main_~i~0#1 * main_~i~0#1, main_~user~0#1.base, 4 + main_~user~0#1.offset, 4); {9548#true} is VALID [2022-02-21 03:13:42,805 INFO L290 TraceCheckUtils]: 7: Hoare triple {9548#true} havoc main_~_ha_hashv~0#1; {9548#true} is VALID [2022-02-21 03:13:42,805 INFO L290 TraceCheckUtils]: 8: Hoare triple {9548#true} goto; {9548#true} is VALID [2022-02-21 03:13:42,805 INFO L290 TraceCheckUtils]: 9: Hoare triple {9548#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; {9548#true} is VALID [2022-02-21 03:13:42,805 INFO L290 TraceCheckUtils]: 10: Hoare triple {9548#true} assume !(main_~_hj_k~0#1 % 4294967296 >= 12); {9548#true} is VALID [2022-02-21 03:13:42,805 INFO L290 TraceCheckUtils]: 11: Hoare triple {9548#true} main_~_ha_hashv~0#1 := 4 + main_~_ha_hashv~0#1;main_#t~switch19#1 := 11 == main_~_hj_k~0#1; {9548#true} is VALID [2022-02-21 03:13:42,805 INFO L290 TraceCheckUtils]: 12: Hoare triple {9548#true} assume !main_#t~switch19#1; {9548#true} is VALID [2022-02-21 03:13:42,805 INFO L290 TraceCheckUtils]: 13: Hoare triple {9548#true} main_#t~switch19#1 := main_#t~switch19#1 || 10 == main_~_hj_k~0#1; {9548#true} is VALID [2022-02-21 03:13:42,805 INFO L290 TraceCheckUtils]: 14: Hoare triple {9548#true} assume !main_#t~switch19#1; {9548#true} is VALID [2022-02-21 03:13:42,805 INFO L290 TraceCheckUtils]: 15: Hoare triple {9548#true} main_#t~switch19#1 := main_#t~switch19#1 || 9 == main_~_hj_k~0#1; {9548#true} is VALID [2022-02-21 03:13:42,805 INFO L290 TraceCheckUtils]: 16: Hoare triple {9548#true} assume !main_#t~switch19#1; {9548#true} is VALID [2022-02-21 03:13:42,806 INFO L290 TraceCheckUtils]: 17: Hoare triple {9548#true} main_#t~switch19#1 := main_#t~switch19#1 || 8 == main_~_hj_k~0#1; {9548#true} is VALID [2022-02-21 03:13:42,806 INFO L290 TraceCheckUtils]: 18: Hoare triple {9548#true} assume !main_#t~switch19#1; {9548#true} is VALID [2022-02-21 03:13:42,806 INFO L290 TraceCheckUtils]: 19: Hoare triple {9548#true} main_#t~switch19#1 := main_#t~switch19#1 || 7 == main_~_hj_k~0#1; {9548#true} is VALID [2022-02-21 03:13:42,806 INFO L290 TraceCheckUtils]: 20: Hoare triple {9548#true} assume !main_#t~switch19#1; {9548#true} is VALID [2022-02-21 03:13:42,806 INFO L290 TraceCheckUtils]: 21: Hoare triple {9548#true} main_#t~switch19#1 := main_#t~switch19#1 || 6 == main_~_hj_k~0#1; {9548#true} is VALID [2022-02-21 03:13:42,806 INFO L290 TraceCheckUtils]: 22: Hoare triple {9548#true} assume !main_#t~switch19#1; {9548#true} is VALID [2022-02-21 03:13:42,806 INFO L290 TraceCheckUtils]: 23: Hoare triple {9548#true} main_#t~switch19#1 := main_#t~switch19#1 || 5 == main_~_hj_k~0#1; {9548#true} is VALID [2022-02-21 03:13:42,806 INFO L290 TraceCheckUtils]: 24: Hoare triple {9548#true} assume !main_#t~switch19#1; {9548#true} is VALID [2022-02-21 03:13:42,806 INFO L290 TraceCheckUtils]: 25: Hoare triple {9548#true} main_#t~switch19#1 := main_#t~switch19#1 || 4 == main_~_hj_k~0#1; {9548#true} is VALID [2022-02-21 03:13:42,806 INFO L290 TraceCheckUtils]: 26: Hoare triple {9548#true} assume main_#t~switch19#1;call main_#t~mem27#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~mem27#1 % 256);havoc main_#t~mem27#1; {9548#true} is VALID [2022-02-21 03:13:42,806 INFO L290 TraceCheckUtils]: 27: Hoare triple {9548#true} main_#t~switch19#1 := main_#t~switch19#1 || 3 == main_~_hj_k~0#1; {9548#true} is VALID [2022-02-21 03:13:42,806 INFO L290 TraceCheckUtils]: 28: Hoare triple {9548#true} assume main_#t~switch19#1;call main_#t~mem28#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~mem28#1 % 256);havoc main_#t~mem28#1; {9548#true} is VALID [2022-02-21 03:13:42,806 INFO L290 TraceCheckUtils]: 29: Hoare triple {9548#true} main_#t~switch19#1 := main_#t~switch19#1 || 2 == main_~_hj_k~0#1; {9548#true} is VALID [2022-02-21 03:13:42,806 INFO L290 TraceCheckUtils]: 30: Hoare triple {9548#true} assume main_#t~switch19#1;call main_#t~mem29#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~mem29#1 % 256);havoc main_#t~mem29#1; {9548#true} is VALID [2022-02-21 03:13:42,806 INFO L290 TraceCheckUtils]: 31: Hoare triple {9548#true} main_#t~switch19#1 := main_#t~switch19#1 || 1 == main_~_hj_k~0#1; {9548#true} is VALID [2022-02-21 03:13:42,806 INFO L290 TraceCheckUtils]: 32: Hoare triple {9548#true} assume main_#t~switch19#1;call main_#t~mem30#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~mem30#1 % 256;havoc main_#t~mem30#1; {9548#true} is VALID [2022-02-21 03:13:42,806 INFO L290 TraceCheckUtils]: 33: Hoare triple {9548#true} havoc main_#t~switch19#1; {9548#true} is VALID [2022-02-21 03:13:42,807 INFO L290 TraceCheckUtils]: 34: Hoare triple {9548#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)))); {9548#true} is VALID [2022-02-21 03:13:42,807 INFO L290 TraceCheckUtils]: 35: Hoare triple {9548#true} goto; {9548#true} is VALID [2022-02-21 03:13:42,807 INFO L290 TraceCheckUtils]: 36: Hoare triple {9548#true} goto; {9548#true} is VALID [2022-02-21 03:13:42,807 INFO L290 TraceCheckUtils]: 37: Hoare triple {9548#true} goto; {9548#true} is VALID [2022-02-21 03:13:42,807 INFO L290 TraceCheckUtils]: 38: Hoare triple {9548#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); {9548#true} is VALID [2022-02-21 03:13:42,807 INFO L290 TraceCheckUtils]: 39: Hoare triple {9548#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); {9548#true} is VALID [2022-02-21 03:13:42,807 INFO L290 TraceCheckUtils]: 40: Hoare triple {9548#true} call main_#t~malloc31#1.base, main_#t~malloc31#1.offset := #Ultimate.allocOnHeap(44);call write~$Pointer$(main_#t~malloc31#1.base, main_#t~malloc31#1.offset, main_~user~0#1.base, 8 + main_~user~0#1.offset, 4);havoc main_#t~malloc31#1.base, main_#t~malloc31#1.offset;call main_#t~mem32#1.base, main_#t~mem32#1.offset := read~$Pointer$(main_~user~0#1.base, 8 + main_~user~0#1.offset, 4); {9548#true} is VALID [2022-02-21 03:13:42,807 INFO L290 TraceCheckUtils]: 41: Hoare triple {9548#true} assume !(main_#t~mem32#1.base == 0 && main_#t~mem32#1.offset == 0);havoc main_#t~mem32#1.base, main_#t~mem32#1.offset;call main_#t~mem33#1.base, main_#t~mem33#1.offset := read~$Pointer$(main_~user~0#1.base, 8 + main_~user~0#1.offset, 4); {9548#true} is VALID [2022-02-21 03:13:42,807 INFO L272 TraceCheckUtils]: 42: Hoare triple {9548#true} call main_#t~memset~res34#1.base, main_#t~memset~res34#1.offset := #Ultimate.C_memset(main_#t~mem33#1.base, main_#t~mem33#1.offset, 0, 44); {9548#true} is VALID [2022-02-21 03:13:42,807 INFO L290 TraceCheckUtils]: 43: Hoare triple {9548#true} #t~loopctr143 := 0; {9682#(= |#Ultimate.C_memset_#t~loopctr143| 0)} is VALID [2022-02-21 03:13:42,808 INFO L290 TraceCheckUtils]: 44: Hoare triple {9682#(= |#Ultimate.C_memset_#t~loopctr143| 0)} assume !(#t~loopctr143 % 4294967296 < #amount % 4294967296); {9686#(not (< 0 (mod |#Ultimate.C_memset_#amount| 4294967296)))} is VALID [2022-02-21 03:13:42,808 INFO L290 TraceCheckUtils]: 45: Hoare triple {9686#(not (< 0 (mod |#Ultimate.C_memset_#amount| 4294967296)))} assume #res.base == #ptr.base && #res.offset == #ptr.offset; {9686#(not (< 0 (mod |#Ultimate.C_memset_#amount| 4294967296)))} is VALID [2022-02-21 03:13:42,809 INFO L284 TraceCheckUtils]: 46: Hoare quadruple {9686#(not (< 0 (mod |#Ultimate.C_memset_#amount| 4294967296)))} {9548#true} #484#return; {9549#false} is VALID [2022-02-21 03:13:42,809 INFO L290 TraceCheckUtils]: 47: Hoare triple {9549#false} havoc main_#t~mem33#1.base, main_#t~mem33#1.offset;havoc main_#t~memset~res34#1.base, main_#t~memset~res34#1.offset;call main_#t~mem35#1.base, main_#t~mem35#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~mem35#1.base, 16 + main_#t~mem35#1.offset, 4);havoc main_#t~mem35#1.base, main_#t~mem35#1.offset;call main_#t~mem36#1.base, main_#t~mem36#1.offset := read~$Pointer$(main_~user~0#1.base, 8 + main_~user~0#1.offset, 4);call write~int(32, main_#t~mem36#1.base, 4 + main_#t~mem36#1.offset, 4);havoc main_#t~mem36#1.base, main_#t~mem36#1.offset;call main_#t~mem37#1.base, main_#t~mem37#1.offset := read~$Pointer$(main_~user~0#1.base, 8 + main_~user~0#1.offset, 4);call write~int(5, main_#t~mem37#1.base, 8 + main_#t~mem37#1.offset, 4);havoc main_#t~mem37#1.base, main_#t~mem37#1.offset;call main_#t~mem38#1.base, main_#t~mem38#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~mem38#1.base, 20 + main_#t~mem38#1.offset, 4);havoc main_#t~mem38#1.base, main_#t~mem38#1.offset;call main_#t~mem39#1.base, main_#t~mem39#1.offset := read~$Pointer$(main_~user~0#1.base, 8 + main_~user~0#1.offset, 4);call main_#t~malloc40#1.base, main_#t~malloc40#1.offset := #Ultimate.allocOnHeap(384);call write~$Pointer$(main_#t~malloc40#1.base, main_#t~malloc40#1.offset, main_#t~mem39#1.base, main_#t~mem39#1.offset, 4);havoc main_#t~mem39#1.base, main_#t~mem39#1.offset;havoc main_#t~malloc40#1.base, main_#t~malloc40#1.offset;call main_#t~mem41#1.base, main_#t~mem41#1.offset := read~$Pointer$(main_~user~0#1.base, 8 + main_~user~0#1.offset, 4);call write~int(2685476833, main_#t~mem41#1.base, 40 + main_#t~mem41#1.offset, 4);havoc main_#t~mem41#1.base, main_#t~mem41#1.offset;call main_#t~mem42#1.base, main_#t~mem42#1.offset := read~$Pointer$(main_~user~0#1.base, 8 + main_~user~0#1.offset, 4);call main_#t~mem43#1.base, main_#t~mem43#1.offset := read~$Pointer$(main_#t~mem42#1.base, main_#t~mem42#1.offset, 4); {9549#false} is VALID [2022-02-21 03:13:42,809 INFO L290 TraceCheckUtils]: 48: Hoare triple {9549#false} assume !(main_#t~mem43#1.base == 0 && main_#t~mem43#1.offset == 0);havoc main_#t~mem42#1.base, main_#t~mem42#1.offset;havoc main_#t~mem43#1.base, main_#t~mem43#1.offset;call main_#t~mem45#1.base, main_#t~mem45#1.offset := read~$Pointer$(main_~user~0#1.base, 8 + main_~user~0#1.offset, 4);call main_#t~mem46#1.base, main_#t~mem46#1.offset := read~$Pointer$(main_#t~mem45#1.base, main_#t~mem45#1.offset, 4); {9549#false} is VALID [2022-02-21 03:13:42,809 INFO L272 TraceCheckUtils]: 49: Hoare triple {9549#false} call main_#t~memset~res47#1.base, main_#t~memset~res47#1.offset := #Ultimate.C_memset(main_#t~mem46#1.base, main_#t~mem46#1.offset, 0, 384); {9549#false} is VALID [2022-02-21 03:13:42,809 INFO L290 TraceCheckUtils]: 50: Hoare triple {9549#false} #t~loopctr143 := 0; {9549#false} is VALID [2022-02-21 03:13:42,810 INFO L290 TraceCheckUtils]: 51: Hoare triple {9549#false} assume !(#t~loopctr143 % 4294967296 < #amount % 4294967296); {9549#false} is VALID [2022-02-21 03:13:42,810 INFO L290 TraceCheckUtils]: 52: Hoare triple {9549#false} assume #res.base == #ptr.base && #res.offset == #ptr.offset; {9549#false} is VALID [2022-02-21 03:13:42,810 INFO L284 TraceCheckUtils]: 53: Hoare quadruple {9549#false} {9549#false} #486#return; {9549#false} is VALID [2022-02-21 03:13:42,810 INFO L290 TraceCheckUtils]: 54: Hoare triple {9549#false} havoc main_#t~mem45#1.base, main_#t~mem45#1.offset;havoc main_#t~mem46#1.base, main_#t~mem46#1.offset;havoc main_#t~memset~res47#1.base, main_#t~memset~res47#1.offset; {9549#false} is VALID [2022-02-21 03:13:42,810 INFO L290 TraceCheckUtils]: 55: Hoare triple {9549#false} goto; {9549#false} is VALID [2022-02-21 03:13:42,810 INFO L290 TraceCheckUtils]: 56: Hoare triple {9549#false} main_~users~0#1.base, main_~users~0#1.offset := main_~user~0#1.base, main_~user~0#1.offset; {9549#false} is VALID [2022-02-21 03:13:42,810 INFO L290 TraceCheckUtils]: 57: Hoare triple {9549#false} havoc main_~_ha_bkt~0#1;call main_#t~mem56#1.base, main_#t~mem56#1.offset := read~$Pointer$(main_~users~0#1.base, 8 + main_~users~0#1.offset, 4);call main_#t~mem57#1 := read~int(main_#t~mem56#1.base, 12 + main_#t~mem56#1.offset, 4);main_#t~post58#1 := main_#t~mem57#1;call write~int(1 + main_#t~post58#1, main_#t~mem56#1.base, 12 + main_#t~mem56#1.offset, 4);havoc main_#t~mem56#1.base, main_#t~mem56#1.offset;havoc main_#t~mem57#1;havoc main_#t~post58#1; {9549#false} is VALID [2022-02-21 03:13:42,810 INFO L290 TraceCheckUtils]: 58: Hoare triple {9549#false} call main_#t~mem59#1.base, main_#t~mem59#1.offset := read~$Pointer$(main_~users~0#1.base, 8 + main_~users~0#1.offset, 4);call main_#t~mem60#1 := read~int(main_#t~mem59#1.base, 4 + main_#t~mem59#1.offset, 4);main_~_ha_bkt~0#1 := (if 0 == main_~_ha_hashv~0#1 || 0 == main_#t~mem60#1 - 1 then 0 else (if 1 == main_#t~mem60#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~mem60#1 - 1))) else (if 1 == main_~_ha_hashv~0#1 then (if 1 == main_#t~mem60#1 - 1 || 0 == main_#t~mem60#1 - 1 then main_#t~mem60#1 - 1 else (if main_#t~mem60#1 - 1 >= 0 then (main_#t~mem60#1 - 1) % 2 else ~bitwiseAnd(main_~_ha_hashv~0#1, main_#t~mem60#1 - 1))) else ~bitwiseAnd(main_~_ha_hashv~0#1, main_#t~mem60#1 - 1))));havoc main_#t~mem59#1.base, main_#t~mem59#1.offset;havoc main_#t~mem60#1; {9549#false} is VALID [2022-02-21 03:13:42,810 INFO L290 TraceCheckUtils]: 59: Hoare triple {9549#false} goto; {9549#false} is VALID [2022-02-21 03:13:42,810 INFO L290 TraceCheckUtils]: 60: Hoare triple {9549#false} call main_#t~mem61#1.base, main_#t~mem61#1.offset := read~$Pointer$(main_~users~0#1.base, 8 + main_~users~0#1.offset, 4);call main_#t~mem62#1.base, main_#t~mem62#1.offset := read~$Pointer$(main_#t~mem61#1.base, main_#t~mem61#1.offset, 4);main_~_ha_head~0#1.base, main_~_ha_head~0#1.offset := main_#t~mem62#1.base, main_#t~mem62#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~mem61#1.base, main_#t~mem61#1.offset;havoc main_#t~mem62#1.base, main_#t~mem62#1.offset;call main_#t~mem63#1 := read~int(main_~_ha_head~0#1.base, 4 + main_~_ha_head~0#1.offset, 4);main_#t~post64#1 := main_#t~mem63#1;call write~int(1 + main_#t~post64#1, main_~_ha_head~0#1.base, 4 + main_~_ha_head~0#1.offset, 4);havoc main_#t~mem63#1;havoc main_#t~post64#1;call main_#t~mem65#1.base, main_#t~mem65#1.offset := read~$Pointer$(main_~_ha_head~0#1.base, main_~_ha_head~0#1.offset, 4);call write~$Pointer$(main_#t~mem65#1.base, main_#t~mem65#1.offset, main_~user~0#1.base, 24 + main_~user~0#1.offset, 4);havoc main_#t~mem65#1.base, main_#t~mem65#1.offset;call write~$Pointer$(0, 0, main_~user~0#1.base, 20 + main_~user~0#1.offset, 4);call main_#t~mem66#1.base, main_#t~mem66#1.offset := read~$Pointer$(main_~_ha_head~0#1.base, main_~_ha_head~0#1.offset, 4); {9549#false} is VALID [2022-02-21 03:13:42,810 INFO L290 TraceCheckUtils]: 61: Hoare triple {9549#false} assume main_#t~mem66#1.base != 0 || main_#t~mem66#1.offset != 0;havoc main_#t~mem66#1.base, main_#t~mem66#1.offset;call main_#t~mem67#1.base, main_#t~mem67#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~mem67#1.base, 12 + main_#t~mem67#1.offset, 4);havoc main_#t~mem67#1.base, main_#t~mem67#1.offset; {9549#false} is VALID [2022-02-21 03:13:42,810 INFO L290 TraceCheckUtils]: 62: Hoare triple {9549#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~mem69#1 := read~int(main_~_ha_head~0#1.base, 4 + main_~_ha_head~0#1.offset, 4);call main_#t~mem68#1 := read~int(main_~_ha_head~0#1.base, 8 + main_~_ha_head~0#1.offset, 4);main_#t~short72#1 := main_#t~mem69#1 % 4294967296 >= 10 * (1 + main_#t~mem68#1) % 4294967296; {9549#false} is VALID [2022-02-21 03:13:42,810 INFO L290 TraceCheckUtils]: 63: Hoare triple {9549#false} assume main_#t~short72#1;call main_#t~mem70#1.base, main_#t~mem70#1.offset := read~$Pointer$(main_~user~0#1.base, 8 + main_~user~0#1.offset, 4);call main_#t~mem71#1 := read~int(main_#t~mem70#1.base, 36 + main_#t~mem70#1.offset, 4);main_#t~short72#1 := 0 == main_#t~mem71#1 % 4294967296; {9549#false} is VALID [2022-02-21 03:13:42,810 INFO L290 TraceCheckUtils]: 64: Hoare triple {9549#false} assume !main_#t~short72#1;havoc main_#t~mem69#1;havoc main_#t~mem68#1;havoc main_#t~mem70#1.base, main_#t~mem70#1.offset;havoc main_#t~mem71#1;havoc main_#t~short72#1; {9549#false} is VALID [2022-02-21 03:13:42,810 INFO L290 TraceCheckUtils]: 65: Hoare triple {9549#false} goto; {9549#false} is VALID [2022-02-21 03:13:42,810 INFO L290 TraceCheckUtils]: 66: Hoare triple {9549#false} goto; {9549#false} is VALID [2022-02-21 03:13:42,810 INFO L290 TraceCheckUtils]: 67: Hoare triple {9549#false} goto; {9549#false} is VALID [2022-02-21 03:13:42,810 INFO L290 TraceCheckUtils]: 68: Hoare triple {9549#false} goto; {9549#false} is VALID [2022-02-21 03:13:42,810 INFO L290 TraceCheckUtils]: 69: Hoare triple {9549#false} main_#t~post5#1 := main_~i~0#1; {9549#false} is VALID [2022-02-21 03:13:42,811 INFO L290 TraceCheckUtils]: 70: Hoare triple {9549#false} assume 1 + main_#t~post5#1 <= 2147483647; {9549#false} is VALID [2022-02-21 03:13:42,811 INFO L290 TraceCheckUtils]: 71: Hoare triple {9549#false} assume 1 + main_#t~post5#1 >= -2147483648;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; {9549#false} is VALID [2022-02-21 03:13:42,811 INFO L290 TraceCheckUtils]: 72: Hoare triple {9549#false} assume !!(main_~i~0#1 < 10);call main_#t~malloc6#1.base, main_#t~malloc6#1.offset := #Ultimate.allocOnHeap(40);main_~user~0#1.base, main_~user~0#1.offset := main_#t~malloc6#1.base, main_#t~malloc6#1.offset;havoc main_#t~malloc6#1.base, main_#t~malloc6#1.offset; {9549#false} is VALID [2022-02-21 03:13:42,811 INFO L290 TraceCheckUtils]: 73: Hoare triple {9549#false} assume !(main_~user~0#1.base == 0 && main_~user~0#1.offset == 0); {9549#false} is VALID [2022-02-21 03:13:42,811 INFO L290 TraceCheckUtils]: 74: Hoare triple {9549#false} call write~int(main_~i~0#1, main_~user~0#1.base, main_~user~0#1.offset, 4); {9549#false} is VALID [2022-02-21 03:13:42,811 INFO L290 TraceCheckUtils]: 75: Hoare triple {9549#false} assume !(main_~i~0#1 * main_~i~0#1 <= 2147483647); {9549#false} is VALID [2022-02-21 03:13:42,811 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-21 03:13:42,811 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-21 03:13:42,811 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 03:13:42,811 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1698254957] [2022-02-21 03:13:42,811 WARN L317 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-02-21 03:13:42,811 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1850833715] [2022-02-21 03:13:42,811 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1850833715] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-21 03:13:42,812 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-21 03:13:42,812 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-02-21 03:13:42,812 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1054755913] [2022-02-21 03:13:42,812 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-21 03:13:42,812 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 18.0) internal successors, (72), 4 states have internal predecessors, (72), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Word has length 76 [2022-02-21 03:13:42,812 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-21 03:13:42,812 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 18.0) internal successors, (72), 4 states have internal predecessors, (72), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-21 03:13:42,863 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 76 edges. 76 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:13:42,863 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-02-21 03:13:42,863 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 03:13:42,863 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-02-21 03:13:42,864 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-02-21 03:13:42,864 INFO L87 Difference]: Start difference. First operand 331 states and 411 transitions. Second operand has 4 states, 4 states have (on average 18.0) internal successors, (72), 4 states have internal predecessors, (72), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-21 03:13:43,550 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:13:43,550 INFO L93 Difference]: Finished difference Result 613 states and 776 transitions. [2022-02-21 03:13:43,550 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-02-21 03:13:43,550 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 18.0) internal successors, (72), 4 states have internal predecessors, (72), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Word has length 76 [2022-02-21 03:13:43,550 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-21 03:13:43,551 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 18.0) internal successors, (72), 4 states have internal predecessors, (72), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-21 03:13:43,553 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 348 transitions. [2022-02-21 03:13:43,553 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 18.0) internal successors, (72), 4 states have internal predecessors, (72), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-21 03:13:43,555 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 348 transitions. [2022-02-21 03:13:43,555 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 348 transitions. [2022-02-21 03:13:43,806 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 348 edges. 348 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:13:43,813 INFO L225 Difference]: With dead ends: 613 [2022-02-21 03:13:43,813 INFO L226 Difference]: Without dead ends: 334 [2022-02-21 03:13:43,814 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 73 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:13:43,814 INFO L933 BasicCegarLoop]: 169 mSDtfsCounter, 2 mSDsluCounter, 334 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 503 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-21 03:13:43,814 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2 Valid, 503 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-21 03:13:43,815 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 334 states. [2022-02-21 03:13:43,896 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 334 to 334. [2022-02-21 03:13:43,896 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 03:13:43,898 INFO L82 GeneralOperation]: Start isEquivalent. First operand 334 states. Second operand has 334 states, 308 states have (on average 1.2207792207792207) internal successors, (376), 322 states have internal predecessors, (376), 19 states have call successors, (19), 2 states have call predecessors, (19), 3 states have return successors, (22), 10 states have call predecessors, (22), 19 states have call successors, (22) [2022-02-21 03:13:43,903 INFO L74 IsIncluded]: Start isIncluded. First operand 334 states. Second operand has 334 states, 308 states have (on average 1.2207792207792207) internal successors, (376), 322 states have internal predecessors, (376), 19 states have call successors, (19), 2 states have call predecessors, (19), 3 states have return successors, (22), 10 states have call predecessors, (22), 19 states have call successors, (22) [2022-02-21 03:13:43,905 INFO L87 Difference]: Start difference. First operand 334 states. Second operand has 334 states, 308 states have (on average 1.2207792207792207) internal successors, (376), 322 states have internal predecessors, (376), 19 states have call successors, (19), 2 states have call predecessors, (19), 3 states have return successors, (22), 10 states have call predecessors, (22), 19 states have call successors, (22) [2022-02-21 03:13:43,911 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:13:43,911 INFO L93 Difference]: Finished difference Result 334 states and 417 transitions. [2022-02-21 03:13:43,911 INFO L276 IsEmpty]: Start isEmpty. Operand 334 states and 417 transitions. [2022-02-21 03:13:43,912 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:13:43,912 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:13:43,912 INFO L74 IsIncluded]: Start isIncluded. First operand has 334 states, 308 states have (on average 1.2207792207792207) internal successors, (376), 322 states have internal predecessors, (376), 19 states have call successors, (19), 2 states have call predecessors, (19), 3 states have return successors, (22), 10 states have call predecessors, (22), 19 states have call successors, (22) Second operand 334 states. [2022-02-21 03:13:43,912 INFO L87 Difference]: Start difference. First operand has 334 states, 308 states have (on average 1.2207792207792207) internal successors, (376), 322 states have internal predecessors, (376), 19 states have call successors, (19), 2 states have call predecessors, (19), 3 states have return successors, (22), 10 states have call predecessors, (22), 19 states have call successors, (22) Second operand 334 states. [2022-02-21 03:13:43,917 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:13:43,918 INFO L93 Difference]: Finished difference Result 334 states and 417 transitions. [2022-02-21 03:13:43,918 INFO L276 IsEmpty]: Start isEmpty. Operand 334 states and 417 transitions. [2022-02-21 03:13:43,919 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:13:43,919 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:13:43,919 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 03:13:43,919 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 03:13:43,919 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 334 states, 308 states have (on average 1.2207792207792207) internal successors, (376), 322 states have internal predecessors, (376), 19 states have call successors, (19), 2 states have call predecessors, (19), 3 states have return successors, (22), 10 states have call predecessors, (22), 19 states have call successors, (22) [2022-02-21 03:13:43,925 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 334 states to 334 states and 417 transitions. [2022-02-21 03:13:43,925 INFO L78 Accepts]: Start accepts. Automaton has 334 states and 417 transitions. Word has length 76 [2022-02-21 03:13:43,925 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-21 03:13:43,925 INFO L470 AbstractCegarLoop]: Abstraction has 334 states and 417 transitions. [2022-02-21 03:13:43,926 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 18.0) internal successors, (72), 4 states have internal predecessors, (72), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-21 03:13:43,926 INFO L276 IsEmpty]: Start isEmpty. Operand 334 states and 417 transitions. [2022-02-21 03:13:43,926 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2022-02-21 03:13:43,926 INFO L506 BasicCegarLoop]: Found error trace [2022-02-21 03:13:43,926 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, 1, 1, 1, 1] [2022-02-21 03:13:43,960 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:13:44,139 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-21 03:13:44,139 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2022-02-21 03:13:44,140 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:13:44,140 INFO L85 PathProgramCache]: Analyzing trace with hash 766935497, now seen corresponding path program 1 times [2022-02-21 03:13:44,140 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:13:44,140 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [731309819] [2022-02-21 03:13:44,140 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:13:44,140 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:13:44,190 ERROR L252 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-02-21 03:13:44,190 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [181666423] [2022-02-21 03:13:44,190 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:13:44,190 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-21 03:13:44,190 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:13:44,197 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:13:44,197 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:13:45,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:13:45,259 INFO L263 TraceCheckSpWp]: Trace formula consists of 702 conjuncts, 7 conjunts are in the unsatisfiable core [2022-02-21 03:13:45,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:13:45,287 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 03:13:45,435 INFO L290 TraceCheckUtils]: 0: Hoare triple {11587#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);~count_int_int~0 := 0; {11587#true} is VALID [2022-02-21 03:13:45,435 INFO L290 TraceCheckUtils]: 1: Hoare triple {11587#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc6#1.base, main_#t~malloc6#1.offset, main_#t~mem8#1, main_#t~mem7#1, main_#t~mem9#1, main_#t~mem10#1, main_#t~mem12#1, main_#t~mem11#1, main_#t~mem13#1, main_#t~mem14#1, main_#t~mem16#1, main_#t~mem15#1, main_#t~mem17#1, main_#t~mem18#1, main_#t~switch19#1, main_#t~mem20#1, main_#t~mem21#1, main_#t~mem22#1, main_#t~mem23#1, main_#t~mem24#1, main_#t~mem25#1, main_#t~mem26#1, main_#t~mem27#1, main_#t~mem28#1, main_#t~mem29#1, main_#t~mem30#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~malloc31#1.base, main_#t~malloc31#1.offset, main_#t~mem32#1.base, main_#t~mem32#1.offset, main_#t~mem33#1.base, main_#t~mem33#1.offset, main_#t~memset~res34#1.base, main_#t~memset~res34#1.offset, main_#t~mem35#1.base, main_#t~mem35#1.offset, main_#t~mem36#1.base, main_#t~mem36#1.offset, main_#t~mem37#1.base, main_#t~mem37#1.offset, main_#t~mem38#1.base, main_#t~mem38#1.offset, main_#t~mem39#1.base, main_#t~mem39#1.offset, main_#t~malloc40#1.base, main_#t~malloc40#1.offset, main_#t~mem41#1.base, main_#t~mem41#1.offset, main_#t~mem42#1.base, main_#t~mem42#1.offset, main_#t~mem43#1.base, main_#t~mem43#1.offset, main_#t~mem44#1.base, main_#t~mem44#1.offset, main_#t~mem45#1.base, main_#t~mem45#1.offset, main_#t~mem46#1.base, main_#t~mem46#1.offset, main_#t~memset~res47#1.base, main_#t~memset~res47#1.offset, main_#t~mem48#1.base, main_#t~mem48#1.offset, main_#t~mem49#1.base, main_#t~mem49#1.offset, main_#t~mem50#1.base, main_#t~mem50#1.offset, main_#t~mem51#1.base, main_#t~mem51#1.offset, main_#t~mem52#1, main_#t~mem53#1.base, main_#t~mem53#1.offset, main_#t~mem54#1.base, main_#t~mem54#1.offset, main_#t~mem55#1.base, main_#t~mem55#1.offset, main_#t~mem56#1.base, main_#t~mem56#1.offset, main_#t~mem57#1, main_#t~post58#1, main_#t~mem59#1.base, main_#t~mem59#1.offset, main_#t~mem60#1, main_#t~mem61#1.base, main_#t~mem61#1.offset, main_#t~mem62#1.base, main_#t~mem62#1.offset, main_#t~mem63#1, main_#t~post64#1, main_#t~mem65#1.base, main_#t~mem65#1.offset, main_#t~mem66#1.base, main_#t~mem66#1.offset, main_#t~mem67#1.base, main_#t~mem67#1.offset, main_#t~mem69#1, main_#t~mem68#1, main_#t~mem70#1.base, main_#t~mem70#1.offset, main_#t~mem71#1, main_#t~short72#1, main_#t~mem73#1.base, main_#t~mem73#1.offset, main_#t~mem74#1, main_#t~malloc75#1.base, main_#t~malloc75#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~mem79#1, main_#t~memset~res80#1.base, main_#t~memset~res80#1.offset, main_#t~mem81#1.base, main_#t~mem81#1.offset, main_#t~mem82#1.base, main_#t~mem82#1.offset, main_#t~mem85#1, main_#t~mem83#1.base, main_#t~mem83#1.offset, main_#t~mem84#1, main_#t~mem86#1.base, main_#t~mem86#1.offset, main_#t~mem89#1, main_#t~mem87#1.base, main_#t~mem87#1.offset, main_#t~mem88#1, main_#t~ite90#1, main_#t~mem91#1.base, main_#t~mem91#1.offset, main_#t~mem95#1.base, main_#t~mem95#1.offset, main_#t~mem96#1.base, main_#t~mem96#1.offset, main_#t~mem97#1.base, main_#t~mem97#1.offset, main_#t~mem98#1.base, main_#t~mem98#1.offset, main_#t~mem101#1, main_#t~mem99#1.base, main_#t~mem99#1.offset, main_#t~mem100#1, main_#t~mem102#1.base, main_#t~mem102#1.offset, main_#t~mem103#1, main_#t~pre104#1, main_#t~mem105#1.base, main_#t~mem105#1.offset, main_#t~mem106#1, main_#t~mem107#1.base, main_#t~mem107#1.offset, main_#t~mem108#1, main_#t~post109#1, main_#t~mem113#1, main_#t~mem111#1, main_#t~mem110#1.base, main_#t~mem110#1.offset, main_#t~mem112#1, main_#t~mem114#1, main_#t~post115#1, main_#t~mem116#1.base, main_#t~mem116#1.offset, main_#t~mem117#1.base, main_#t~mem117#1.offset, main_#t~mem118#1.base, main_#t~mem118#1.offset, main_#t~post92#1, main_#t~mem93#1.base, main_#t~mem93#1.offset, main_#t~mem94#1, main_#t~mem119#1.base, main_#t~mem119#1.offset, main_#t~mem120#1.base, main_#t~mem120#1.offset, main_#t~mem121#1.base, main_#t~mem121#1.offset, main_#t~mem122#1, main_#t~mem123#1.base, main_#t~mem123#1.offset, main_#t~mem124#1, main_#t~post125#1, main_#t~mem126#1.base, main_#t~mem126#1.offset, main_#t~mem127#1.base, main_#t~mem127#1.offset, main_#t~mem128#1.base, main_#t~mem128#1.offset, main_#t~mem129#1.base, main_#t~mem129#1.offset, main_#t~mem132#1, main_#t~mem130#1.base, main_#t~mem130#1.offset, main_#t~mem131#1, main_#t~ite135#1, main_#t~mem133#1.base, main_#t~mem133#1.offset, main_#t~mem134#1, main_#t~mem136#1.base, main_#t~mem136#1.offset, main_#t~mem137#1, main_#t~mem138#1.base, main_#t~mem138#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~post5#1, main_#t~mem140#1, main_#t~mem141#1, main_#t~mem139#1.base, main_#t~mem139#1.offset, main_~i~0#1, main_~user~0#1.base, main_~user~0#1.offset, main_~users~0#1.base, main_~users~0#1.offset;havoc main_~i~0#1;havoc main_~user~0#1.base, main_~user~0#1.offset;main_~users~0#1.base, main_~users~0#1.offset := 0, 0;main_~i~0#1 := 0; {11587#true} is VALID [2022-02-21 03:13:45,435 INFO L290 TraceCheckUtils]: 2: Hoare triple {11587#true} assume !!(main_~i~0#1 < 10);call main_#t~malloc6#1.base, main_#t~malloc6#1.offset := #Ultimate.allocOnHeap(40);main_~user~0#1.base, main_~user~0#1.offset := main_#t~malloc6#1.base, main_#t~malloc6#1.offset;havoc main_#t~malloc6#1.base, main_#t~malloc6#1.offset; {11587#true} is VALID [2022-02-21 03:13:45,435 INFO L290 TraceCheckUtils]: 3: Hoare triple {11587#true} assume !(main_~user~0#1.base == 0 && main_~user~0#1.offset == 0); {11587#true} is VALID [2022-02-21 03:13:45,435 INFO L290 TraceCheckUtils]: 4: Hoare triple {11587#true} call write~int(main_~i~0#1, main_~user~0#1.base, main_~user~0#1.offset, 4); {11587#true} is VALID [2022-02-21 03:13:45,435 INFO L290 TraceCheckUtils]: 5: Hoare triple {11587#true} assume main_~i~0#1 * main_~i~0#1 <= 2147483647; {11587#true} is VALID [2022-02-21 03:13:45,435 INFO L290 TraceCheckUtils]: 6: Hoare triple {11587#true} assume main_~i~0#1 * main_~i~0#1 >= -2147483648;call write~int(main_~i~0#1 * main_~i~0#1, main_~user~0#1.base, 4 + main_~user~0#1.offset, 4); {11587#true} is VALID [2022-02-21 03:13:45,435 INFO L290 TraceCheckUtils]: 7: Hoare triple {11587#true} havoc main_~_ha_hashv~0#1; {11587#true} is VALID [2022-02-21 03:13:45,436 INFO L290 TraceCheckUtils]: 8: Hoare triple {11587#true} goto; {11587#true} is VALID [2022-02-21 03:13:45,436 INFO L290 TraceCheckUtils]: 9: Hoare triple {11587#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; {11587#true} is VALID [2022-02-21 03:13:45,436 INFO L290 TraceCheckUtils]: 10: Hoare triple {11587#true} assume !(main_~_hj_k~0#1 % 4294967296 >= 12); {11587#true} is VALID [2022-02-21 03:13:45,436 INFO L290 TraceCheckUtils]: 11: Hoare triple {11587#true} main_~_ha_hashv~0#1 := 4 + main_~_ha_hashv~0#1;main_#t~switch19#1 := 11 == main_~_hj_k~0#1; {11587#true} is VALID [2022-02-21 03:13:45,436 INFO L290 TraceCheckUtils]: 12: Hoare triple {11587#true} assume !main_#t~switch19#1; {11587#true} is VALID [2022-02-21 03:13:45,436 INFO L290 TraceCheckUtils]: 13: Hoare triple {11587#true} main_#t~switch19#1 := main_#t~switch19#1 || 10 == main_~_hj_k~0#1; {11587#true} is VALID [2022-02-21 03:13:45,436 INFO L290 TraceCheckUtils]: 14: Hoare triple {11587#true} assume !main_#t~switch19#1; {11587#true} is VALID [2022-02-21 03:13:45,436 INFO L290 TraceCheckUtils]: 15: Hoare triple {11587#true} main_#t~switch19#1 := main_#t~switch19#1 || 9 == main_~_hj_k~0#1; {11587#true} is VALID [2022-02-21 03:13:45,436 INFO L290 TraceCheckUtils]: 16: Hoare triple {11587#true} assume !main_#t~switch19#1; {11587#true} is VALID [2022-02-21 03:13:45,436 INFO L290 TraceCheckUtils]: 17: Hoare triple {11587#true} main_#t~switch19#1 := main_#t~switch19#1 || 8 == main_~_hj_k~0#1; {11587#true} is VALID [2022-02-21 03:13:45,436 INFO L290 TraceCheckUtils]: 18: Hoare triple {11587#true} assume !main_#t~switch19#1; {11587#true} is VALID [2022-02-21 03:13:45,436 INFO L290 TraceCheckUtils]: 19: Hoare triple {11587#true} main_#t~switch19#1 := main_#t~switch19#1 || 7 == main_~_hj_k~0#1; {11587#true} is VALID [2022-02-21 03:13:45,436 INFO L290 TraceCheckUtils]: 20: Hoare triple {11587#true} assume !main_#t~switch19#1; {11587#true} is VALID [2022-02-21 03:13:45,436 INFO L290 TraceCheckUtils]: 21: Hoare triple {11587#true} main_#t~switch19#1 := main_#t~switch19#1 || 6 == main_~_hj_k~0#1; {11587#true} is VALID [2022-02-21 03:13:45,436 INFO L290 TraceCheckUtils]: 22: Hoare triple {11587#true} assume !main_#t~switch19#1; {11587#true} is VALID [2022-02-21 03:13:45,436 INFO L290 TraceCheckUtils]: 23: Hoare triple {11587#true} main_#t~switch19#1 := main_#t~switch19#1 || 5 == main_~_hj_k~0#1; {11587#true} is VALID [2022-02-21 03:13:45,436 INFO L290 TraceCheckUtils]: 24: Hoare triple {11587#true} assume !main_#t~switch19#1; {11587#true} is VALID [2022-02-21 03:13:45,437 INFO L290 TraceCheckUtils]: 25: Hoare triple {11587#true} main_#t~switch19#1 := main_#t~switch19#1 || 4 == main_~_hj_k~0#1; {11587#true} is VALID [2022-02-21 03:13:45,437 INFO L290 TraceCheckUtils]: 26: Hoare triple {11587#true} assume main_#t~switch19#1;call main_#t~mem27#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~mem27#1 % 256);havoc main_#t~mem27#1; {11587#true} is VALID [2022-02-21 03:13:45,437 INFO L290 TraceCheckUtils]: 27: Hoare triple {11587#true} main_#t~switch19#1 := main_#t~switch19#1 || 3 == main_~_hj_k~0#1; {11587#true} is VALID [2022-02-21 03:13:45,437 INFO L290 TraceCheckUtils]: 28: Hoare triple {11587#true} assume main_#t~switch19#1;call main_#t~mem28#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~mem28#1 % 256);havoc main_#t~mem28#1; {11587#true} is VALID [2022-02-21 03:13:45,437 INFO L290 TraceCheckUtils]: 29: Hoare triple {11587#true} main_#t~switch19#1 := main_#t~switch19#1 || 2 == main_~_hj_k~0#1; {11587#true} is VALID [2022-02-21 03:13:45,437 INFO L290 TraceCheckUtils]: 30: Hoare triple {11587#true} assume main_#t~switch19#1;call main_#t~mem29#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~mem29#1 % 256);havoc main_#t~mem29#1; {11587#true} is VALID [2022-02-21 03:13:45,437 INFO L290 TraceCheckUtils]: 31: Hoare triple {11587#true} main_#t~switch19#1 := main_#t~switch19#1 || 1 == main_~_hj_k~0#1; {11587#true} is VALID [2022-02-21 03:13:45,437 INFO L290 TraceCheckUtils]: 32: Hoare triple {11587#true} assume main_#t~switch19#1;call main_#t~mem30#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~mem30#1 % 256;havoc main_#t~mem30#1; {11587#true} is VALID [2022-02-21 03:13:45,437 INFO L290 TraceCheckUtils]: 33: Hoare triple {11587#true} havoc main_#t~switch19#1; {11587#true} is VALID [2022-02-21 03:13:45,437 INFO L290 TraceCheckUtils]: 34: Hoare triple {11587#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)))); {11587#true} is VALID [2022-02-21 03:13:45,437 INFO L290 TraceCheckUtils]: 35: Hoare triple {11587#true} goto; {11587#true} is VALID [2022-02-21 03:13:45,437 INFO L290 TraceCheckUtils]: 36: Hoare triple {11587#true} goto; {11587#true} is VALID [2022-02-21 03:13:45,437 INFO L290 TraceCheckUtils]: 37: Hoare triple {11587#true} goto; {11587#true} is VALID [2022-02-21 03:13:45,437 INFO L290 TraceCheckUtils]: 38: Hoare triple {11587#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); {11587#true} is VALID [2022-02-21 03:13:45,438 INFO L290 TraceCheckUtils]: 39: Hoare triple {11587#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); {11587#true} is VALID [2022-02-21 03:13:45,438 INFO L290 TraceCheckUtils]: 40: Hoare triple {11587#true} call main_#t~malloc31#1.base, main_#t~malloc31#1.offset := #Ultimate.allocOnHeap(44);call write~$Pointer$(main_#t~malloc31#1.base, main_#t~malloc31#1.offset, main_~user~0#1.base, 8 + main_~user~0#1.offset, 4);havoc main_#t~malloc31#1.base, main_#t~malloc31#1.offset;call main_#t~mem32#1.base, main_#t~mem32#1.offset := read~$Pointer$(main_~user~0#1.base, 8 + main_~user~0#1.offset, 4); {11587#true} is VALID [2022-02-21 03:13:45,438 INFO L290 TraceCheckUtils]: 41: Hoare triple {11587#true} assume !(main_#t~mem32#1.base == 0 && main_#t~mem32#1.offset == 0);havoc main_#t~mem32#1.base, main_#t~mem32#1.offset;call main_#t~mem33#1.base, main_#t~mem33#1.offset := read~$Pointer$(main_~user~0#1.base, 8 + main_~user~0#1.offset, 4); {11587#true} is VALID [2022-02-21 03:13:45,438 INFO L272 TraceCheckUtils]: 42: Hoare triple {11587#true} call main_#t~memset~res34#1.base, main_#t~memset~res34#1.offset := #Ultimate.C_memset(main_#t~mem33#1.base, main_#t~mem33#1.offset, 0, 44); {11587#true} is VALID [2022-02-21 03:13:45,438 INFO L290 TraceCheckUtils]: 43: Hoare triple {11587#true} #t~loopctr143 := 0; {11721#(= |#Ultimate.C_memset_#t~loopctr143| 0)} is VALID [2022-02-21 03:13:45,439 INFO L290 TraceCheckUtils]: 44: Hoare triple {11721#(= |#Ultimate.C_memset_#t~loopctr143| 0)} assume #t~loopctr143 % 4294967296 < #amount % 4294967296;#memory_$Pointer$.base, #memory_$Pointer$.offset := #memory_$Pointer$.base[#ptr.base,#ptr.offset + #t~loopctr143 := 0], #memory_$Pointer$.offset[#ptr.base,#ptr.offset + #t~loopctr143 := #value % 256];#memory_int := #memory_int[#ptr.base,#ptr.offset + #t~loopctr143 := #value];#t~loopctr143 := 1 + #t~loopctr143; {11725#(= |#Ultimate.C_memset_#t~loopctr143| 1)} is VALID [2022-02-21 03:13:45,439 INFO L290 TraceCheckUtils]: 45: Hoare triple {11725#(= |#Ultimate.C_memset_#t~loopctr143| 1)} assume !(#t~loopctr143 % 4294967296 < #amount % 4294967296); {11729#(not (< 1 (mod |#Ultimate.C_memset_#amount| 4294967296)))} is VALID [2022-02-21 03:13:45,440 INFO L290 TraceCheckUtils]: 46: Hoare triple {11729#(not (< 1 (mod |#Ultimate.C_memset_#amount| 4294967296)))} assume #res.base == #ptr.base && #res.offset == #ptr.offset; {11729#(not (< 1 (mod |#Ultimate.C_memset_#amount| 4294967296)))} is VALID [2022-02-21 03:13:45,440 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {11729#(not (< 1 (mod |#Ultimate.C_memset_#amount| 4294967296)))} {11587#true} #484#return; {11588#false} is VALID [2022-02-21 03:13:45,441 INFO L290 TraceCheckUtils]: 48: Hoare triple {11588#false} havoc main_#t~mem33#1.base, main_#t~mem33#1.offset;havoc main_#t~memset~res34#1.base, main_#t~memset~res34#1.offset;call main_#t~mem35#1.base, main_#t~mem35#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~mem35#1.base, 16 + main_#t~mem35#1.offset, 4);havoc main_#t~mem35#1.base, main_#t~mem35#1.offset;call main_#t~mem36#1.base, main_#t~mem36#1.offset := read~$Pointer$(main_~user~0#1.base, 8 + main_~user~0#1.offset, 4);call write~int(32, main_#t~mem36#1.base, 4 + main_#t~mem36#1.offset, 4);havoc main_#t~mem36#1.base, main_#t~mem36#1.offset;call main_#t~mem37#1.base, main_#t~mem37#1.offset := read~$Pointer$(main_~user~0#1.base, 8 + main_~user~0#1.offset, 4);call write~int(5, main_#t~mem37#1.base, 8 + main_#t~mem37#1.offset, 4);havoc main_#t~mem37#1.base, main_#t~mem37#1.offset;call main_#t~mem38#1.base, main_#t~mem38#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~mem38#1.base, 20 + main_#t~mem38#1.offset, 4);havoc main_#t~mem38#1.base, main_#t~mem38#1.offset;call main_#t~mem39#1.base, main_#t~mem39#1.offset := read~$Pointer$(main_~user~0#1.base, 8 + main_~user~0#1.offset, 4);call main_#t~malloc40#1.base, main_#t~malloc40#1.offset := #Ultimate.allocOnHeap(384);call write~$Pointer$(main_#t~malloc40#1.base, main_#t~malloc40#1.offset, main_#t~mem39#1.base, main_#t~mem39#1.offset, 4);havoc main_#t~mem39#1.base, main_#t~mem39#1.offset;havoc main_#t~malloc40#1.base, main_#t~malloc40#1.offset;call main_#t~mem41#1.base, main_#t~mem41#1.offset := read~$Pointer$(main_~user~0#1.base, 8 + main_~user~0#1.offset, 4);call write~int(2685476833, main_#t~mem41#1.base, 40 + main_#t~mem41#1.offset, 4);havoc main_#t~mem41#1.base, main_#t~mem41#1.offset;call main_#t~mem42#1.base, main_#t~mem42#1.offset := read~$Pointer$(main_~user~0#1.base, 8 + main_~user~0#1.offset, 4);call main_#t~mem43#1.base, main_#t~mem43#1.offset := read~$Pointer$(main_#t~mem42#1.base, main_#t~mem42#1.offset, 4); {11588#false} is VALID [2022-02-21 03:13:45,441 INFO L290 TraceCheckUtils]: 49: Hoare triple {11588#false} assume !(main_#t~mem43#1.base == 0 && main_#t~mem43#1.offset == 0);havoc main_#t~mem42#1.base, main_#t~mem42#1.offset;havoc main_#t~mem43#1.base, main_#t~mem43#1.offset;call main_#t~mem45#1.base, main_#t~mem45#1.offset := read~$Pointer$(main_~user~0#1.base, 8 + main_~user~0#1.offset, 4);call main_#t~mem46#1.base, main_#t~mem46#1.offset := read~$Pointer$(main_#t~mem45#1.base, main_#t~mem45#1.offset, 4); {11588#false} is VALID [2022-02-21 03:13:45,441 INFO L272 TraceCheckUtils]: 50: Hoare triple {11588#false} call main_#t~memset~res47#1.base, main_#t~memset~res47#1.offset := #Ultimate.C_memset(main_#t~mem46#1.base, main_#t~mem46#1.offset, 0, 384); {11588#false} is VALID [2022-02-21 03:13:45,441 INFO L290 TraceCheckUtils]: 51: Hoare triple {11588#false} #t~loopctr143 := 0; {11588#false} is VALID [2022-02-21 03:13:45,441 INFO L290 TraceCheckUtils]: 52: Hoare triple {11588#false} assume #t~loopctr143 % 4294967296 < #amount % 4294967296;#memory_$Pointer$.base, #memory_$Pointer$.offset := #memory_$Pointer$.base[#ptr.base,#ptr.offset + #t~loopctr143 := 0], #memory_$Pointer$.offset[#ptr.base,#ptr.offset + #t~loopctr143 := #value % 256];#memory_int := #memory_int[#ptr.base,#ptr.offset + #t~loopctr143 := #value];#t~loopctr143 := 1 + #t~loopctr143; {11588#false} is VALID [2022-02-21 03:13:45,441 INFO L290 TraceCheckUtils]: 53: Hoare triple {11588#false} assume !(#t~loopctr143 % 4294967296 < #amount % 4294967296); {11588#false} is VALID [2022-02-21 03:13:45,441 INFO L290 TraceCheckUtils]: 54: Hoare triple {11588#false} assume #res.base == #ptr.base && #res.offset == #ptr.offset; {11588#false} is VALID [2022-02-21 03:13:45,441 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {11588#false} {11588#false} #486#return; {11588#false} is VALID [2022-02-21 03:13:45,441 INFO L290 TraceCheckUtils]: 56: Hoare triple {11588#false} havoc main_#t~mem45#1.base, main_#t~mem45#1.offset;havoc main_#t~mem46#1.base, main_#t~mem46#1.offset;havoc main_#t~memset~res47#1.base, main_#t~memset~res47#1.offset; {11588#false} is VALID [2022-02-21 03:13:45,442 INFO L290 TraceCheckUtils]: 57: Hoare triple {11588#false} goto; {11588#false} is VALID [2022-02-21 03:13:45,442 INFO L290 TraceCheckUtils]: 58: Hoare triple {11588#false} main_~users~0#1.base, main_~users~0#1.offset := main_~user~0#1.base, main_~user~0#1.offset; {11588#false} is VALID [2022-02-21 03:13:45,442 INFO L290 TraceCheckUtils]: 59: Hoare triple {11588#false} havoc main_~_ha_bkt~0#1;call main_#t~mem56#1.base, main_#t~mem56#1.offset := read~$Pointer$(main_~users~0#1.base, 8 + main_~users~0#1.offset, 4);call main_#t~mem57#1 := read~int(main_#t~mem56#1.base, 12 + main_#t~mem56#1.offset, 4);main_#t~post58#1 := main_#t~mem57#1;call write~int(1 + main_#t~post58#1, main_#t~mem56#1.base, 12 + main_#t~mem56#1.offset, 4);havoc main_#t~mem56#1.base, main_#t~mem56#1.offset;havoc main_#t~mem57#1;havoc main_#t~post58#1; {11588#false} is VALID [2022-02-21 03:13:45,442 INFO L290 TraceCheckUtils]: 60: Hoare triple {11588#false} call main_#t~mem59#1.base, main_#t~mem59#1.offset := read~$Pointer$(main_~users~0#1.base, 8 + main_~users~0#1.offset, 4);call main_#t~mem60#1 := read~int(main_#t~mem59#1.base, 4 + main_#t~mem59#1.offset, 4);main_~_ha_bkt~0#1 := (if 0 == main_~_ha_hashv~0#1 || 0 == main_#t~mem60#1 - 1 then 0 else (if 1 == main_#t~mem60#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~mem60#1 - 1))) else (if 1 == main_~_ha_hashv~0#1 then (if 1 == main_#t~mem60#1 - 1 || 0 == main_#t~mem60#1 - 1 then main_#t~mem60#1 - 1 else (if main_#t~mem60#1 - 1 >= 0 then (main_#t~mem60#1 - 1) % 2 else ~bitwiseAnd(main_~_ha_hashv~0#1, main_#t~mem60#1 - 1))) else ~bitwiseAnd(main_~_ha_hashv~0#1, main_#t~mem60#1 - 1))));havoc main_#t~mem59#1.base, main_#t~mem59#1.offset;havoc main_#t~mem60#1; {11588#false} is VALID [2022-02-21 03:13:45,442 INFO L290 TraceCheckUtils]: 61: Hoare triple {11588#false} goto; {11588#false} is VALID [2022-02-21 03:13:45,442 INFO L290 TraceCheckUtils]: 62: Hoare triple {11588#false} call main_#t~mem61#1.base, main_#t~mem61#1.offset := read~$Pointer$(main_~users~0#1.base, 8 + main_~users~0#1.offset, 4);call main_#t~mem62#1.base, main_#t~mem62#1.offset := read~$Pointer$(main_#t~mem61#1.base, main_#t~mem61#1.offset, 4);main_~_ha_head~0#1.base, main_~_ha_head~0#1.offset := main_#t~mem62#1.base, main_#t~mem62#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~mem61#1.base, main_#t~mem61#1.offset;havoc main_#t~mem62#1.base, main_#t~mem62#1.offset;call main_#t~mem63#1 := read~int(main_~_ha_head~0#1.base, 4 + main_~_ha_head~0#1.offset, 4);main_#t~post64#1 := main_#t~mem63#1;call write~int(1 + main_#t~post64#1, main_~_ha_head~0#1.base, 4 + main_~_ha_head~0#1.offset, 4);havoc main_#t~mem63#1;havoc main_#t~post64#1;call main_#t~mem65#1.base, main_#t~mem65#1.offset := read~$Pointer$(main_~_ha_head~0#1.base, main_~_ha_head~0#1.offset, 4);call write~$Pointer$(main_#t~mem65#1.base, main_#t~mem65#1.offset, main_~user~0#1.base, 24 + main_~user~0#1.offset, 4);havoc main_#t~mem65#1.base, main_#t~mem65#1.offset;call write~$Pointer$(0, 0, main_~user~0#1.base, 20 + main_~user~0#1.offset, 4);call main_#t~mem66#1.base, main_#t~mem66#1.offset := read~$Pointer$(main_~_ha_head~0#1.base, main_~_ha_head~0#1.offset, 4); {11588#false} is VALID [2022-02-21 03:13:45,442 INFO L290 TraceCheckUtils]: 63: Hoare triple {11588#false} assume main_#t~mem66#1.base != 0 || main_#t~mem66#1.offset != 0;havoc main_#t~mem66#1.base, main_#t~mem66#1.offset;call main_#t~mem67#1.base, main_#t~mem67#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~mem67#1.base, 12 + main_#t~mem67#1.offset, 4);havoc main_#t~mem67#1.base, main_#t~mem67#1.offset; {11588#false} is VALID [2022-02-21 03:13:45,442 INFO L290 TraceCheckUtils]: 64: Hoare triple {11588#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~mem69#1 := read~int(main_~_ha_head~0#1.base, 4 + main_~_ha_head~0#1.offset, 4);call main_#t~mem68#1 := read~int(main_~_ha_head~0#1.base, 8 + main_~_ha_head~0#1.offset, 4);main_#t~short72#1 := main_#t~mem69#1 % 4294967296 >= 10 * (1 + main_#t~mem68#1) % 4294967296; {11588#false} is VALID [2022-02-21 03:13:45,442 INFO L290 TraceCheckUtils]: 65: Hoare triple {11588#false} assume main_#t~short72#1;call main_#t~mem70#1.base, main_#t~mem70#1.offset := read~$Pointer$(main_~user~0#1.base, 8 + main_~user~0#1.offset, 4);call main_#t~mem71#1 := read~int(main_#t~mem70#1.base, 36 + main_#t~mem70#1.offset, 4);main_#t~short72#1 := 0 == main_#t~mem71#1 % 4294967296; {11588#false} is VALID [2022-02-21 03:13:45,443 INFO L290 TraceCheckUtils]: 66: Hoare triple {11588#false} assume !main_#t~short72#1;havoc main_#t~mem69#1;havoc main_#t~mem68#1;havoc main_#t~mem70#1.base, main_#t~mem70#1.offset;havoc main_#t~mem71#1;havoc main_#t~short72#1; {11588#false} is VALID [2022-02-21 03:13:45,443 INFO L290 TraceCheckUtils]: 67: Hoare triple {11588#false} goto; {11588#false} is VALID [2022-02-21 03:13:45,443 INFO L290 TraceCheckUtils]: 68: Hoare triple {11588#false} goto; {11588#false} is VALID [2022-02-21 03:13:45,443 INFO L290 TraceCheckUtils]: 69: Hoare triple {11588#false} goto; {11588#false} is VALID [2022-02-21 03:13:45,443 INFO L290 TraceCheckUtils]: 70: Hoare triple {11588#false} goto; {11588#false} is VALID [2022-02-21 03:13:45,443 INFO L290 TraceCheckUtils]: 71: Hoare triple {11588#false} main_#t~post5#1 := main_~i~0#1; {11588#false} is VALID [2022-02-21 03:13:45,443 INFO L290 TraceCheckUtils]: 72: Hoare triple {11588#false} assume 1 + main_#t~post5#1 <= 2147483647; {11588#false} is VALID [2022-02-21 03:13:45,443 INFO L290 TraceCheckUtils]: 73: Hoare triple {11588#false} assume 1 + main_#t~post5#1 >= -2147483648;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; {11588#false} is VALID [2022-02-21 03:13:45,443 INFO L290 TraceCheckUtils]: 74: Hoare triple {11588#false} assume !!(main_~i~0#1 < 10);call main_#t~malloc6#1.base, main_#t~malloc6#1.offset := #Ultimate.allocOnHeap(40);main_~user~0#1.base, main_~user~0#1.offset := main_#t~malloc6#1.base, main_#t~malloc6#1.offset;havoc main_#t~malloc6#1.base, main_#t~malloc6#1.offset; {11588#false} is VALID [2022-02-21 03:13:45,444 INFO L290 TraceCheckUtils]: 75: Hoare triple {11588#false} assume !(main_~user~0#1.base == 0 && main_~user~0#1.offset == 0); {11588#false} is VALID [2022-02-21 03:13:45,444 INFO L290 TraceCheckUtils]: 76: Hoare triple {11588#false} call write~int(main_~i~0#1, main_~user~0#1.base, main_~user~0#1.offset, 4); {11588#false} is VALID [2022-02-21 03:13:45,444 INFO L290 TraceCheckUtils]: 77: Hoare triple {11588#false} assume !(main_~i~0#1 * main_~i~0#1 <= 2147483647); {11588#false} is VALID [2022-02-21 03:13:45,444 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 11 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-02-21 03:13:45,444 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-21 03:13:45,641 INFO L290 TraceCheckUtils]: 77: Hoare triple {11588#false} assume !(main_~i~0#1 * main_~i~0#1 <= 2147483647); {11588#false} is VALID [2022-02-21 03:13:45,641 INFO L290 TraceCheckUtils]: 76: Hoare triple {11588#false} call write~int(main_~i~0#1, main_~user~0#1.base, main_~user~0#1.offset, 4); {11588#false} is VALID [2022-02-21 03:13:45,641 INFO L290 TraceCheckUtils]: 75: Hoare triple {11588#false} assume !(main_~user~0#1.base == 0 && main_~user~0#1.offset == 0); {11588#false} is VALID [2022-02-21 03:13:45,641 INFO L290 TraceCheckUtils]: 74: Hoare triple {11588#false} assume !!(main_~i~0#1 < 10);call main_#t~malloc6#1.base, main_#t~malloc6#1.offset := #Ultimate.allocOnHeap(40);main_~user~0#1.base, main_~user~0#1.offset := main_#t~malloc6#1.base, main_#t~malloc6#1.offset;havoc main_#t~malloc6#1.base, main_#t~malloc6#1.offset; {11588#false} is VALID [2022-02-21 03:13:45,641 INFO L290 TraceCheckUtils]: 73: Hoare triple {11588#false} assume 1 + main_#t~post5#1 >= -2147483648;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; {11588#false} is VALID [2022-02-21 03:13:45,641 INFO L290 TraceCheckUtils]: 72: Hoare triple {11588#false} assume 1 + main_#t~post5#1 <= 2147483647; {11588#false} is VALID [2022-02-21 03:13:45,641 INFO L290 TraceCheckUtils]: 71: Hoare triple {11588#false} main_#t~post5#1 := main_~i~0#1; {11588#false} is VALID [2022-02-21 03:13:45,641 INFO L290 TraceCheckUtils]: 70: Hoare triple {11588#false} goto; {11588#false} is VALID [2022-02-21 03:13:45,641 INFO L290 TraceCheckUtils]: 69: Hoare triple {11588#false} goto; {11588#false} is VALID [2022-02-21 03:13:45,641 INFO L290 TraceCheckUtils]: 68: Hoare triple {11588#false} goto; {11588#false} is VALID [2022-02-21 03:13:45,641 INFO L290 TraceCheckUtils]: 67: Hoare triple {11588#false} goto; {11588#false} is VALID [2022-02-21 03:13:45,642 INFO L290 TraceCheckUtils]: 66: Hoare triple {11588#false} assume !main_#t~short72#1;havoc main_#t~mem69#1;havoc main_#t~mem68#1;havoc main_#t~mem70#1.base, main_#t~mem70#1.offset;havoc main_#t~mem71#1;havoc main_#t~short72#1; {11588#false} is VALID [2022-02-21 03:13:45,642 INFO L290 TraceCheckUtils]: 65: Hoare triple {11588#false} assume main_#t~short72#1;call main_#t~mem70#1.base, main_#t~mem70#1.offset := read~$Pointer$(main_~user~0#1.base, 8 + main_~user~0#1.offset, 4);call main_#t~mem71#1 := read~int(main_#t~mem70#1.base, 36 + main_#t~mem70#1.offset, 4);main_#t~short72#1 := 0 == main_#t~mem71#1 % 4294967296; {11588#false} is VALID [2022-02-21 03:13:45,642 INFO L290 TraceCheckUtils]: 64: Hoare triple {11588#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~mem69#1 := read~int(main_~_ha_head~0#1.base, 4 + main_~_ha_head~0#1.offset, 4);call main_#t~mem68#1 := read~int(main_~_ha_head~0#1.base, 8 + main_~_ha_head~0#1.offset, 4);main_#t~short72#1 := main_#t~mem69#1 % 4294967296 >= 10 * (1 + main_#t~mem68#1) % 4294967296; {11588#false} is VALID [2022-02-21 03:13:45,642 INFO L290 TraceCheckUtils]: 63: Hoare triple {11588#false} assume main_#t~mem66#1.base != 0 || main_#t~mem66#1.offset != 0;havoc main_#t~mem66#1.base, main_#t~mem66#1.offset;call main_#t~mem67#1.base, main_#t~mem67#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~mem67#1.base, 12 + main_#t~mem67#1.offset, 4);havoc main_#t~mem67#1.base, main_#t~mem67#1.offset; {11588#false} is VALID [2022-02-21 03:13:45,642 INFO L290 TraceCheckUtils]: 62: Hoare triple {11588#false} call main_#t~mem61#1.base, main_#t~mem61#1.offset := read~$Pointer$(main_~users~0#1.base, 8 + main_~users~0#1.offset, 4);call main_#t~mem62#1.base, main_#t~mem62#1.offset := read~$Pointer$(main_#t~mem61#1.base, main_#t~mem61#1.offset, 4);main_~_ha_head~0#1.base, main_~_ha_head~0#1.offset := main_#t~mem62#1.base, main_#t~mem62#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~mem61#1.base, main_#t~mem61#1.offset;havoc main_#t~mem62#1.base, main_#t~mem62#1.offset;call main_#t~mem63#1 := read~int(main_~_ha_head~0#1.base, 4 + main_~_ha_head~0#1.offset, 4);main_#t~post64#1 := main_#t~mem63#1;call write~int(1 + main_#t~post64#1, main_~_ha_head~0#1.base, 4 + main_~_ha_head~0#1.offset, 4);havoc main_#t~mem63#1;havoc main_#t~post64#1;call main_#t~mem65#1.base, main_#t~mem65#1.offset := read~$Pointer$(main_~_ha_head~0#1.base, main_~_ha_head~0#1.offset, 4);call write~$Pointer$(main_#t~mem65#1.base, main_#t~mem65#1.offset, main_~user~0#1.base, 24 + main_~user~0#1.offset, 4);havoc main_#t~mem65#1.base, main_#t~mem65#1.offset;call write~$Pointer$(0, 0, main_~user~0#1.base, 20 + main_~user~0#1.offset, 4);call main_#t~mem66#1.base, main_#t~mem66#1.offset := read~$Pointer$(main_~_ha_head~0#1.base, main_~_ha_head~0#1.offset, 4); {11588#false} is VALID [2022-02-21 03:13:45,642 INFO L290 TraceCheckUtils]: 61: Hoare triple {11588#false} goto; {11588#false} is VALID [2022-02-21 03:13:45,642 INFO L290 TraceCheckUtils]: 60: Hoare triple {11588#false} call main_#t~mem59#1.base, main_#t~mem59#1.offset := read~$Pointer$(main_~users~0#1.base, 8 + main_~users~0#1.offset, 4);call main_#t~mem60#1 := read~int(main_#t~mem59#1.base, 4 + main_#t~mem59#1.offset, 4);main_~_ha_bkt~0#1 := (if 0 == main_~_ha_hashv~0#1 || 0 == main_#t~mem60#1 - 1 then 0 else (if 1 == main_#t~mem60#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~mem60#1 - 1))) else (if 1 == main_~_ha_hashv~0#1 then (if 1 == main_#t~mem60#1 - 1 || 0 == main_#t~mem60#1 - 1 then main_#t~mem60#1 - 1 else (if main_#t~mem60#1 - 1 >= 0 then (main_#t~mem60#1 - 1) % 2 else ~bitwiseAnd(main_~_ha_hashv~0#1, main_#t~mem60#1 - 1))) else ~bitwiseAnd(main_~_ha_hashv~0#1, main_#t~mem60#1 - 1))));havoc main_#t~mem59#1.base, main_#t~mem59#1.offset;havoc main_#t~mem60#1; {11588#false} is VALID [2022-02-21 03:13:45,642 INFO L290 TraceCheckUtils]: 59: Hoare triple {11588#false} havoc main_~_ha_bkt~0#1;call main_#t~mem56#1.base, main_#t~mem56#1.offset := read~$Pointer$(main_~users~0#1.base, 8 + main_~users~0#1.offset, 4);call main_#t~mem57#1 := read~int(main_#t~mem56#1.base, 12 + main_#t~mem56#1.offset, 4);main_#t~post58#1 := main_#t~mem57#1;call write~int(1 + main_#t~post58#1, main_#t~mem56#1.base, 12 + main_#t~mem56#1.offset, 4);havoc main_#t~mem56#1.base, main_#t~mem56#1.offset;havoc main_#t~mem57#1;havoc main_#t~post58#1; {11588#false} is VALID [2022-02-21 03:13:45,642 INFO L290 TraceCheckUtils]: 58: Hoare triple {11588#false} main_~users~0#1.base, main_~users~0#1.offset := main_~user~0#1.base, main_~user~0#1.offset; {11588#false} is VALID [2022-02-21 03:13:45,643 INFO L290 TraceCheckUtils]: 57: Hoare triple {11588#false} goto; {11588#false} is VALID [2022-02-21 03:13:45,643 INFO L290 TraceCheckUtils]: 56: Hoare triple {11588#false} havoc main_#t~mem45#1.base, main_#t~mem45#1.offset;havoc main_#t~mem46#1.base, main_#t~mem46#1.offset;havoc main_#t~memset~res47#1.base, main_#t~memset~res47#1.offset; {11588#false} is VALID [2022-02-21 03:13:45,643 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {11587#true} {11588#false} #486#return; {11588#false} is VALID [2022-02-21 03:13:45,643 INFO L290 TraceCheckUtils]: 54: Hoare triple {11587#true} assume #res.base == #ptr.base && #res.offset == #ptr.offset; {11587#true} is VALID [2022-02-21 03:13:45,643 INFO L290 TraceCheckUtils]: 53: Hoare triple {11587#true} assume !(#t~loopctr143 % 4294967296 < #amount % 4294967296); {11587#true} is VALID [2022-02-21 03:13:45,643 INFO L290 TraceCheckUtils]: 52: Hoare triple {11587#true} assume #t~loopctr143 % 4294967296 < #amount % 4294967296;#memory_$Pointer$.base, #memory_$Pointer$.offset := #memory_$Pointer$.base[#ptr.base,#ptr.offset + #t~loopctr143 := 0], #memory_$Pointer$.offset[#ptr.base,#ptr.offset + #t~loopctr143 := #value % 256];#memory_int := #memory_int[#ptr.base,#ptr.offset + #t~loopctr143 := #value];#t~loopctr143 := 1 + #t~loopctr143; {11587#true} is VALID [2022-02-21 03:13:45,643 INFO L290 TraceCheckUtils]: 51: Hoare triple {11587#true} #t~loopctr143 := 0; {11587#true} is VALID [2022-02-21 03:13:45,643 INFO L272 TraceCheckUtils]: 50: Hoare triple {11588#false} call main_#t~memset~res47#1.base, main_#t~memset~res47#1.offset := #Ultimate.C_memset(main_#t~mem46#1.base, main_#t~mem46#1.offset, 0, 384); {11587#true} is VALID [2022-02-21 03:13:45,643 INFO L290 TraceCheckUtils]: 49: Hoare triple {11588#false} assume !(main_#t~mem43#1.base == 0 && main_#t~mem43#1.offset == 0);havoc main_#t~mem42#1.base, main_#t~mem42#1.offset;havoc main_#t~mem43#1.base, main_#t~mem43#1.offset;call main_#t~mem45#1.base, main_#t~mem45#1.offset := read~$Pointer$(main_~user~0#1.base, 8 + main_~user~0#1.offset, 4);call main_#t~mem46#1.base, main_#t~mem46#1.offset := read~$Pointer$(main_#t~mem45#1.base, main_#t~mem45#1.offset, 4); {11588#false} is VALID [2022-02-21 03:13:45,644 INFO L290 TraceCheckUtils]: 48: Hoare triple {11588#false} havoc main_#t~mem33#1.base, main_#t~mem33#1.offset;havoc main_#t~memset~res34#1.base, main_#t~memset~res34#1.offset;call main_#t~mem35#1.base, main_#t~mem35#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~mem35#1.base, 16 + main_#t~mem35#1.offset, 4);havoc main_#t~mem35#1.base, main_#t~mem35#1.offset;call main_#t~mem36#1.base, main_#t~mem36#1.offset := read~$Pointer$(main_~user~0#1.base, 8 + main_~user~0#1.offset, 4);call write~int(32, main_#t~mem36#1.base, 4 + main_#t~mem36#1.offset, 4);havoc main_#t~mem36#1.base, main_#t~mem36#1.offset;call main_#t~mem37#1.base, main_#t~mem37#1.offset := read~$Pointer$(main_~user~0#1.base, 8 + main_~user~0#1.offset, 4);call write~int(5, main_#t~mem37#1.base, 8 + main_#t~mem37#1.offset, 4);havoc main_#t~mem37#1.base, main_#t~mem37#1.offset;call main_#t~mem38#1.base, main_#t~mem38#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~mem38#1.base, 20 + main_#t~mem38#1.offset, 4);havoc main_#t~mem38#1.base, main_#t~mem38#1.offset;call main_#t~mem39#1.base, main_#t~mem39#1.offset := read~$Pointer$(main_~user~0#1.base, 8 + main_~user~0#1.offset, 4);call main_#t~malloc40#1.base, main_#t~malloc40#1.offset := #Ultimate.allocOnHeap(384);call write~$Pointer$(main_#t~malloc40#1.base, main_#t~malloc40#1.offset, main_#t~mem39#1.base, main_#t~mem39#1.offset, 4);havoc main_#t~mem39#1.base, main_#t~mem39#1.offset;havoc main_#t~malloc40#1.base, main_#t~malloc40#1.offset;call main_#t~mem41#1.base, main_#t~mem41#1.offset := read~$Pointer$(main_~user~0#1.base, 8 + main_~user~0#1.offset, 4);call write~int(2685476833, main_#t~mem41#1.base, 40 + main_#t~mem41#1.offset, 4);havoc main_#t~mem41#1.base, main_#t~mem41#1.offset;call main_#t~mem42#1.base, main_#t~mem42#1.offset := read~$Pointer$(main_~user~0#1.base, 8 + main_~user~0#1.offset, 4);call main_#t~mem43#1.base, main_#t~mem43#1.offset := read~$Pointer$(main_#t~mem42#1.base, main_#t~mem42#1.offset, 4); {11588#false} is VALID [2022-02-21 03:13:45,646 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {11919#(not (= 44 |#Ultimate.C_memset_#amount|))} {11587#true} #484#return; {11588#false} is VALID [2022-02-21 03:13:45,647 INFO L290 TraceCheckUtils]: 46: Hoare triple {11919#(not (= 44 |#Ultimate.C_memset_#amount|))} assume #res.base == #ptr.base && #res.offset == #ptr.offset; {11919#(not (= 44 |#Ultimate.C_memset_#amount|))} is VALID [2022-02-21 03:13:45,647 INFO L290 TraceCheckUtils]: 45: Hoare triple {11926#(or (< (mod |#Ultimate.C_memset_#t~loopctr143| 4294967296) (mod |#Ultimate.C_memset_#amount| 4294967296)) (not (= 44 |#Ultimate.C_memset_#amount|)))} assume !(#t~loopctr143 % 4294967296 < #amount % 4294967296); {11919#(not (= 44 |#Ultimate.C_memset_#amount|))} is VALID [2022-02-21 03:13:45,648 INFO L290 TraceCheckUtils]: 44: Hoare triple {11930#(or (not (= 44 |#Ultimate.C_memset_#amount|)) (< (mod (+ |#Ultimate.C_memset_#t~loopctr143| 1) 4294967296) (mod |#Ultimate.C_memset_#amount| 4294967296)))} assume #t~loopctr143 % 4294967296 < #amount % 4294967296;#memory_$Pointer$.base, #memory_$Pointer$.offset := #memory_$Pointer$.base[#ptr.base,#ptr.offset + #t~loopctr143 := 0], #memory_$Pointer$.offset[#ptr.base,#ptr.offset + #t~loopctr143 := #value % 256];#memory_int := #memory_int[#ptr.base,#ptr.offset + #t~loopctr143 := #value];#t~loopctr143 := 1 + #t~loopctr143; {11926#(or (< (mod |#Ultimate.C_memset_#t~loopctr143| 4294967296) (mod |#Ultimate.C_memset_#amount| 4294967296)) (not (= 44 |#Ultimate.C_memset_#amount|)))} is VALID [2022-02-21 03:13:45,648 INFO L290 TraceCheckUtils]: 43: Hoare triple {11587#true} #t~loopctr143 := 0; {11930#(or (not (= 44 |#Ultimate.C_memset_#amount|)) (< (mod (+ |#Ultimate.C_memset_#t~loopctr143| 1) 4294967296) (mod |#Ultimate.C_memset_#amount| 4294967296)))} is VALID [2022-02-21 03:13:45,648 INFO L272 TraceCheckUtils]: 42: Hoare triple {11587#true} call main_#t~memset~res34#1.base, main_#t~memset~res34#1.offset := #Ultimate.C_memset(main_#t~mem33#1.base, main_#t~mem33#1.offset, 0, 44); {11587#true} is VALID [2022-02-21 03:13:45,648 INFO L290 TraceCheckUtils]: 41: Hoare triple {11587#true} assume !(main_#t~mem32#1.base == 0 && main_#t~mem32#1.offset == 0);havoc main_#t~mem32#1.base, main_#t~mem32#1.offset;call main_#t~mem33#1.base, main_#t~mem33#1.offset := read~$Pointer$(main_~user~0#1.base, 8 + main_~user~0#1.offset, 4); {11587#true} is VALID [2022-02-21 03:13:45,649 INFO L290 TraceCheckUtils]: 40: Hoare triple {11587#true} call main_#t~malloc31#1.base, main_#t~malloc31#1.offset := #Ultimate.allocOnHeap(44);call write~$Pointer$(main_#t~malloc31#1.base, main_#t~malloc31#1.offset, main_~user~0#1.base, 8 + main_~user~0#1.offset, 4);havoc main_#t~malloc31#1.base, main_#t~malloc31#1.offset;call main_#t~mem32#1.base, main_#t~mem32#1.offset := read~$Pointer$(main_~user~0#1.base, 8 + main_~user~0#1.offset, 4); {11587#true} is VALID [2022-02-21 03:13:45,649 INFO L290 TraceCheckUtils]: 39: Hoare triple {11587#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); {11587#true} is VALID [2022-02-21 03:13:45,649 INFO L290 TraceCheckUtils]: 38: Hoare triple {11587#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); {11587#true} is VALID [2022-02-21 03:13:45,649 INFO L290 TraceCheckUtils]: 37: Hoare triple {11587#true} goto; {11587#true} is VALID [2022-02-21 03:13:45,649 INFO L290 TraceCheckUtils]: 36: Hoare triple {11587#true} goto; {11587#true} is VALID [2022-02-21 03:13:45,649 INFO L290 TraceCheckUtils]: 35: Hoare triple {11587#true} goto; {11587#true} is VALID [2022-02-21 03:13:45,649 INFO L290 TraceCheckUtils]: 34: Hoare triple {11587#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)))); {11587#true} is VALID [2022-02-21 03:13:45,649 INFO L290 TraceCheckUtils]: 33: Hoare triple {11587#true} havoc main_#t~switch19#1; {11587#true} is VALID [2022-02-21 03:13:45,649 INFO L290 TraceCheckUtils]: 32: Hoare triple {11587#true} assume main_#t~switch19#1;call main_#t~mem30#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~mem30#1 % 256;havoc main_#t~mem30#1; {11587#true} is VALID [2022-02-21 03:13:45,649 INFO L290 TraceCheckUtils]: 31: Hoare triple {11587#true} main_#t~switch19#1 := main_#t~switch19#1 || 1 == main_~_hj_k~0#1; {11587#true} is VALID [2022-02-21 03:13:45,649 INFO L290 TraceCheckUtils]: 30: Hoare triple {11587#true} assume main_#t~switch19#1;call main_#t~mem29#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~mem29#1 % 256);havoc main_#t~mem29#1; {11587#true} is VALID [2022-02-21 03:13:45,649 INFO L290 TraceCheckUtils]: 29: Hoare triple {11587#true} main_#t~switch19#1 := main_#t~switch19#1 || 2 == main_~_hj_k~0#1; {11587#true} is VALID [2022-02-21 03:13:45,649 INFO L290 TraceCheckUtils]: 28: Hoare triple {11587#true} assume main_#t~switch19#1;call main_#t~mem28#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~mem28#1 % 256);havoc main_#t~mem28#1; {11587#true} is VALID [2022-02-21 03:13:45,649 INFO L290 TraceCheckUtils]: 27: Hoare triple {11587#true} main_#t~switch19#1 := main_#t~switch19#1 || 3 == main_~_hj_k~0#1; {11587#true} is VALID [2022-02-21 03:13:45,649 INFO L290 TraceCheckUtils]: 26: Hoare triple {11587#true} assume main_#t~switch19#1;call main_#t~mem27#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~mem27#1 % 256);havoc main_#t~mem27#1; {11587#true} is VALID [2022-02-21 03:13:45,649 INFO L290 TraceCheckUtils]: 25: Hoare triple {11587#true} main_#t~switch19#1 := main_#t~switch19#1 || 4 == main_~_hj_k~0#1; {11587#true} is VALID [2022-02-21 03:13:45,649 INFO L290 TraceCheckUtils]: 24: Hoare triple {11587#true} assume !main_#t~switch19#1; {11587#true} is VALID [2022-02-21 03:13:45,649 INFO L290 TraceCheckUtils]: 23: Hoare triple {11587#true} main_#t~switch19#1 := main_#t~switch19#1 || 5 == main_~_hj_k~0#1; {11587#true} is VALID [2022-02-21 03:13:45,649 INFO L290 TraceCheckUtils]: 22: Hoare triple {11587#true} assume !main_#t~switch19#1; {11587#true} is VALID [2022-02-21 03:13:45,650 INFO L290 TraceCheckUtils]: 21: Hoare triple {11587#true} main_#t~switch19#1 := main_#t~switch19#1 || 6 == main_~_hj_k~0#1; {11587#true} is VALID [2022-02-21 03:13:45,650 INFO L290 TraceCheckUtils]: 20: Hoare triple {11587#true} assume !main_#t~switch19#1; {11587#true} is VALID [2022-02-21 03:13:45,650 INFO L290 TraceCheckUtils]: 19: Hoare triple {11587#true} main_#t~switch19#1 := main_#t~switch19#1 || 7 == main_~_hj_k~0#1; {11587#true} is VALID [2022-02-21 03:13:45,650 INFO L290 TraceCheckUtils]: 18: Hoare triple {11587#true} assume !main_#t~switch19#1; {11587#true} is VALID [2022-02-21 03:13:45,650 INFO L290 TraceCheckUtils]: 17: Hoare triple {11587#true} main_#t~switch19#1 := main_#t~switch19#1 || 8 == main_~_hj_k~0#1; {11587#true} is VALID [2022-02-21 03:13:45,650 INFO L290 TraceCheckUtils]: 16: Hoare triple {11587#true} assume !main_#t~switch19#1; {11587#true} is VALID [2022-02-21 03:13:45,650 INFO L290 TraceCheckUtils]: 15: Hoare triple {11587#true} main_#t~switch19#1 := main_#t~switch19#1 || 9 == main_~_hj_k~0#1; {11587#true} is VALID [2022-02-21 03:13:45,650 INFO L290 TraceCheckUtils]: 14: Hoare triple {11587#true} assume !main_#t~switch19#1; {11587#true} is VALID [2022-02-21 03:13:45,650 INFO L290 TraceCheckUtils]: 13: Hoare triple {11587#true} main_#t~switch19#1 := main_#t~switch19#1 || 10 == main_~_hj_k~0#1; {11587#true} is VALID [2022-02-21 03:13:45,650 INFO L290 TraceCheckUtils]: 12: Hoare triple {11587#true} assume !main_#t~switch19#1; {11587#true} is VALID [2022-02-21 03:13:45,650 INFO L290 TraceCheckUtils]: 11: Hoare triple {11587#true} main_~_ha_hashv~0#1 := 4 + main_~_ha_hashv~0#1;main_#t~switch19#1 := 11 == main_~_hj_k~0#1; {11587#true} is VALID [2022-02-21 03:13:45,650 INFO L290 TraceCheckUtils]: 10: Hoare triple {11587#true} assume !(main_~_hj_k~0#1 % 4294967296 >= 12); {11587#true} is VALID [2022-02-21 03:13:45,650 INFO L290 TraceCheckUtils]: 9: Hoare triple {11587#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; {11587#true} is VALID [2022-02-21 03:13:45,650 INFO L290 TraceCheckUtils]: 8: Hoare triple {11587#true} goto; {11587#true} is VALID [2022-02-21 03:13:45,650 INFO L290 TraceCheckUtils]: 7: Hoare triple {11587#true} havoc main_~_ha_hashv~0#1; {11587#true} is VALID [2022-02-21 03:13:45,650 INFO L290 TraceCheckUtils]: 6: Hoare triple {11587#true} assume main_~i~0#1 * main_~i~0#1 >= -2147483648;call write~int(main_~i~0#1 * main_~i~0#1, main_~user~0#1.base, 4 + main_~user~0#1.offset, 4); {11587#true} is VALID [2022-02-21 03:13:45,650 INFO L290 TraceCheckUtils]: 5: Hoare triple {11587#true} assume main_~i~0#1 * main_~i~0#1 <= 2147483647; {11587#true} is VALID [2022-02-21 03:13:45,650 INFO L290 TraceCheckUtils]: 4: Hoare triple {11587#true} call write~int(main_~i~0#1, main_~user~0#1.base, main_~user~0#1.offset, 4); {11587#true} is VALID [2022-02-21 03:13:45,650 INFO L290 TraceCheckUtils]: 3: Hoare triple {11587#true} assume !(main_~user~0#1.base == 0 && main_~user~0#1.offset == 0); {11587#true} is VALID [2022-02-21 03:13:45,650 INFO L290 TraceCheckUtils]: 2: Hoare triple {11587#true} assume !!(main_~i~0#1 < 10);call main_#t~malloc6#1.base, main_#t~malloc6#1.offset := #Ultimate.allocOnHeap(40);main_~user~0#1.base, main_~user~0#1.offset := main_#t~malloc6#1.base, main_#t~malloc6#1.offset;havoc main_#t~malloc6#1.base, main_#t~malloc6#1.offset; {11587#true} is VALID [2022-02-21 03:13:45,650 INFO L290 TraceCheckUtils]: 1: Hoare triple {11587#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc6#1.base, main_#t~malloc6#1.offset, main_#t~mem8#1, main_#t~mem7#1, main_#t~mem9#1, main_#t~mem10#1, main_#t~mem12#1, main_#t~mem11#1, main_#t~mem13#1, main_#t~mem14#1, main_#t~mem16#1, main_#t~mem15#1, main_#t~mem17#1, main_#t~mem18#1, main_#t~switch19#1, main_#t~mem20#1, main_#t~mem21#1, main_#t~mem22#1, main_#t~mem23#1, main_#t~mem24#1, main_#t~mem25#1, main_#t~mem26#1, main_#t~mem27#1, main_#t~mem28#1, main_#t~mem29#1, main_#t~mem30#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~malloc31#1.base, main_#t~malloc31#1.offset, main_#t~mem32#1.base, main_#t~mem32#1.offset, main_#t~mem33#1.base, main_#t~mem33#1.offset, main_#t~memset~res34#1.base, main_#t~memset~res34#1.offset, main_#t~mem35#1.base, main_#t~mem35#1.offset, main_#t~mem36#1.base, main_#t~mem36#1.offset, main_#t~mem37#1.base, main_#t~mem37#1.offset, main_#t~mem38#1.base, main_#t~mem38#1.offset, main_#t~mem39#1.base, main_#t~mem39#1.offset, main_#t~malloc40#1.base, main_#t~malloc40#1.offset, main_#t~mem41#1.base, main_#t~mem41#1.offset, main_#t~mem42#1.base, main_#t~mem42#1.offset, main_#t~mem43#1.base, main_#t~mem43#1.offset, main_#t~mem44#1.base, main_#t~mem44#1.offset, main_#t~mem45#1.base, main_#t~mem45#1.offset, main_#t~mem46#1.base, main_#t~mem46#1.offset, main_#t~memset~res47#1.base, main_#t~memset~res47#1.offset, main_#t~mem48#1.base, main_#t~mem48#1.offset, main_#t~mem49#1.base, main_#t~mem49#1.offset, main_#t~mem50#1.base, main_#t~mem50#1.offset, main_#t~mem51#1.base, main_#t~mem51#1.offset, main_#t~mem52#1, main_#t~mem53#1.base, main_#t~mem53#1.offset, main_#t~mem54#1.base, main_#t~mem54#1.offset, main_#t~mem55#1.base, main_#t~mem55#1.offset, main_#t~mem56#1.base, main_#t~mem56#1.offset, main_#t~mem57#1, main_#t~post58#1, main_#t~mem59#1.base, main_#t~mem59#1.offset, main_#t~mem60#1, main_#t~mem61#1.base, main_#t~mem61#1.offset, main_#t~mem62#1.base, main_#t~mem62#1.offset, main_#t~mem63#1, main_#t~post64#1, main_#t~mem65#1.base, main_#t~mem65#1.offset, main_#t~mem66#1.base, main_#t~mem66#1.offset, main_#t~mem67#1.base, main_#t~mem67#1.offset, main_#t~mem69#1, main_#t~mem68#1, main_#t~mem70#1.base, main_#t~mem70#1.offset, main_#t~mem71#1, main_#t~short72#1, main_#t~mem73#1.base, main_#t~mem73#1.offset, main_#t~mem74#1, main_#t~malloc75#1.base, main_#t~malloc75#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~mem79#1, main_#t~memset~res80#1.base, main_#t~memset~res80#1.offset, main_#t~mem81#1.base, main_#t~mem81#1.offset, main_#t~mem82#1.base, main_#t~mem82#1.offset, main_#t~mem85#1, main_#t~mem83#1.base, main_#t~mem83#1.offset, main_#t~mem84#1, main_#t~mem86#1.base, main_#t~mem86#1.offset, main_#t~mem89#1, main_#t~mem87#1.base, main_#t~mem87#1.offset, main_#t~mem88#1, main_#t~ite90#1, main_#t~mem91#1.base, main_#t~mem91#1.offset, main_#t~mem95#1.base, main_#t~mem95#1.offset, main_#t~mem96#1.base, main_#t~mem96#1.offset, main_#t~mem97#1.base, main_#t~mem97#1.offset, main_#t~mem98#1.base, main_#t~mem98#1.offset, main_#t~mem101#1, main_#t~mem99#1.base, main_#t~mem99#1.offset, main_#t~mem100#1, main_#t~mem102#1.base, main_#t~mem102#1.offset, main_#t~mem103#1, main_#t~pre104#1, main_#t~mem105#1.base, main_#t~mem105#1.offset, main_#t~mem106#1, main_#t~mem107#1.base, main_#t~mem107#1.offset, main_#t~mem108#1, main_#t~post109#1, main_#t~mem113#1, main_#t~mem111#1, main_#t~mem110#1.base, main_#t~mem110#1.offset, main_#t~mem112#1, main_#t~mem114#1, main_#t~post115#1, main_#t~mem116#1.base, main_#t~mem116#1.offset, main_#t~mem117#1.base, main_#t~mem117#1.offset, main_#t~mem118#1.base, main_#t~mem118#1.offset, main_#t~post92#1, main_#t~mem93#1.base, main_#t~mem93#1.offset, main_#t~mem94#1, main_#t~mem119#1.base, main_#t~mem119#1.offset, main_#t~mem120#1.base, main_#t~mem120#1.offset, main_#t~mem121#1.base, main_#t~mem121#1.offset, main_#t~mem122#1, main_#t~mem123#1.base, main_#t~mem123#1.offset, main_#t~mem124#1, main_#t~post125#1, main_#t~mem126#1.base, main_#t~mem126#1.offset, main_#t~mem127#1.base, main_#t~mem127#1.offset, main_#t~mem128#1.base, main_#t~mem128#1.offset, main_#t~mem129#1.base, main_#t~mem129#1.offset, main_#t~mem132#1, main_#t~mem130#1.base, main_#t~mem130#1.offset, main_#t~mem131#1, main_#t~ite135#1, main_#t~mem133#1.base, main_#t~mem133#1.offset, main_#t~mem134#1, main_#t~mem136#1.base, main_#t~mem136#1.offset, main_#t~mem137#1, main_#t~mem138#1.base, main_#t~mem138#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~post5#1, main_#t~mem140#1, main_#t~mem141#1, main_#t~mem139#1.base, main_#t~mem139#1.offset, main_~i~0#1, main_~user~0#1.base, main_~user~0#1.offset, main_~users~0#1.base, main_~users~0#1.offset;havoc main_~i~0#1;havoc main_~user~0#1.base, main_~user~0#1.offset;main_~users~0#1.base, main_~users~0#1.offset := 0, 0;main_~i~0#1 := 0; {11587#true} is VALID [2022-02-21 03:13:45,651 INFO L290 TraceCheckUtils]: 0: Hoare triple {11587#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);~count_int_int~0 := 0; {11587#true} is VALID [2022-02-21 03:13:45,651 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 4 proven. 7 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-02-21 03:13:45,651 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 03:13:45,651 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [731309819] [2022-02-21 03:13:45,651 WARN L317 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-02-21 03:13:45,651 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [181666423] [2022-02-21 03:13:45,651 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [181666423] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-21 03:13:45,651 INFO L191 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-02-21 03:13:45,651 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2022-02-21 03:13:45,651 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2008280955] [2022-02-21 03:13:45,652 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-02-21 03:13:45,652 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 10.25) internal successors, (82), 8 states have internal predecessors, (82), 2 states have call successors, (3), 2 states have call predecessors, (3), 4 states have return successors, (4), 1 states have call predecessors, (4), 2 states have call successors, (4) Word has length 78 [2022-02-21 03:13:45,652 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-21 03:13:45,653 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 8 states, 8 states have (on average 10.25) internal successors, (82), 8 states have internal predecessors, (82), 2 states have call successors, (3), 2 states have call predecessors, (3), 4 states have return successors, (4), 1 states have call predecessors, (4), 2 states have call successors, (4) [2022-02-21 03:13:45,722 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 89 edges. 89 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:13:45,722 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-02-21 03:13:45,722 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 03:13:45,722 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-02-21 03:13:45,722 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2022-02-21 03:13:45,723 INFO L87 Difference]: Start difference. First operand 334 states and 417 transitions. Second operand has 8 states, 8 states have (on average 10.25) internal successors, (82), 8 states have internal predecessors, (82), 2 states have call successors, (3), 2 states have call predecessors, (3), 4 states have return successors, (4), 1 states have call predecessors, (4), 2 states have call successors, (4) [2022-02-21 03:13:46,748 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:13:46,748 INFO L93 Difference]: Finished difference Result 627 states and 803 transitions. [2022-02-21 03:13:46,748 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-02-21 03:13:46,748 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 10.25) internal successors, (82), 8 states have internal predecessors, (82), 2 states have call successors, (3), 2 states have call predecessors, (3), 4 states have return successors, (4), 1 states have call predecessors, (4), 2 states have call successors, (4) Word has length 78 [2022-02-21 03:13:46,749 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-21 03:13:46,749 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 10.25) internal successors, (82), 8 states have internal predecessors, (82), 2 states have call successors, (3), 2 states have call predecessors, (3), 4 states have return successors, (4), 1 states have call predecessors, (4), 2 states have call successors, (4) [2022-02-21 03:13:46,752 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 365 transitions. [2022-02-21 03:13:46,752 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 10.25) internal successors, (82), 8 states have internal predecessors, (82), 2 states have call successors, (3), 2 states have call predecessors, (3), 4 states have return successors, (4), 1 states have call predecessors, (4), 2 states have call successors, (4) [2022-02-21 03:13:46,755 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 365 transitions. [2022-02-21 03:13:46,755 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 11 states and 365 transitions. [2022-02-21 03:13:47,038 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 365 edges. 365 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:13:47,044 INFO L225 Difference]: With dead ends: 627 [2022-02-21 03:13:47,044 INFO L226 Difference]: Without dead ends: 345 [2022-02-21 03:13:47,045 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 159 GetRequests, 148 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=62, Invalid=94, Unknown=0, NotChecked=0, Total=156 [2022-02-21 03:13:47,045 INFO L933 BasicCegarLoop]: 170 mSDtfsCounter, 14 mSDsluCounter, 501 mSDsCounter, 0 mSdLazyCounter, 46 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 671 SdHoareTripleChecker+Invalid, 58 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 46 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-21 03:13:47,045 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [14 Valid, 671 Invalid, 58 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 46 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-21 03:13:47,046 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 345 states. [2022-02-21 03:13:47,123 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 345 to 343. [2022-02-21 03:13:47,123 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 03:13:47,124 INFO L82 GeneralOperation]: Start isEquivalent. First operand 345 states. Second operand has 343 states, 316 states have (on average 1.2341772151898733) internal successors, (390), 330 states have internal predecessors, (390), 19 states have call successors, (19), 3 states have call predecessors, (19), 4 states have return successors, (22), 10 states have call predecessors, (22), 19 states have call successors, (22) [2022-02-21 03:13:47,124 INFO L74 IsIncluded]: Start isIncluded. First operand 345 states. Second operand has 343 states, 316 states have (on average 1.2341772151898733) internal successors, (390), 330 states have internal predecessors, (390), 19 states have call successors, (19), 3 states have call predecessors, (19), 4 states have return successors, (22), 10 states have call predecessors, (22), 19 states have call successors, (22) [2022-02-21 03:13:47,126 INFO L87 Difference]: Start difference. First operand 345 states. Second operand has 343 states, 316 states have (on average 1.2341772151898733) internal successors, (390), 330 states have internal predecessors, (390), 19 states have call successors, (19), 3 states have call predecessors, (19), 4 states have return successors, (22), 10 states have call predecessors, (22), 19 states have call successors, (22) [2022-02-21 03:13:47,132 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:13:47,132 INFO L93 Difference]: Finished difference Result 345 states and 435 transitions. [2022-02-21 03:13:47,132 INFO L276 IsEmpty]: Start isEmpty. Operand 345 states and 435 transitions. [2022-02-21 03:13:47,133 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:13:47,133 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:13:47,134 INFO L74 IsIncluded]: Start isIncluded. First operand has 343 states, 316 states have (on average 1.2341772151898733) internal successors, (390), 330 states have internal predecessors, (390), 19 states have call successors, (19), 3 states have call predecessors, (19), 4 states have return successors, (22), 10 states have call predecessors, (22), 19 states have call successors, (22) Second operand 345 states. [2022-02-21 03:13:47,134 INFO L87 Difference]: Start difference. First operand has 343 states, 316 states have (on average 1.2341772151898733) internal successors, (390), 330 states have internal predecessors, (390), 19 states have call successors, (19), 3 states have call predecessors, (19), 4 states have return successors, (22), 10 states have call predecessors, (22), 19 states have call successors, (22) Second operand 345 states. [2022-02-21 03:13:47,140 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:13:47,140 INFO L93 Difference]: Finished difference Result 345 states and 435 transitions. [2022-02-21 03:13:47,140 INFO L276 IsEmpty]: Start isEmpty. Operand 345 states and 435 transitions. [2022-02-21 03:13:47,140 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:13:47,140 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:13:47,141 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 03:13:47,141 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 03:13:47,141 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 343 states, 316 states have (on average 1.2341772151898733) internal successors, (390), 330 states have internal predecessors, (390), 19 states have call successors, (19), 3 states have call predecessors, (19), 4 states have return successors, (22), 10 states have call predecessors, (22), 19 states have call successors, (22) [2022-02-21 03:13:47,147 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 343 states to 343 states and 431 transitions. [2022-02-21 03:13:47,147 INFO L78 Accepts]: Start accepts. Automaton has 343 states and 431 transitions. Word has length 78 [2022-02-21 03:13:47,147 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-21 03:13:47,147 INFO L470 AbstractCegarLoop]: Abstraction has 343 states and 431 transitions. [2022-02-21 03:13:47,147 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 10.25) internal successors, (82), 8 states have internal predecessors, (82), 2 states have call successors, (3), 2 states have call predecessors, (3), 4 states have return successors, (4), 1 states have call predecessors, (4), 2 states have call successors, (4) [2022-02-21 03:13:47,147 INFO L276 IsEmpty]: Start isEmpty. Operand 343 states and 431 transitions. [2022-02-21 03:13:47,148 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2022-02-21 03:13:47,148 INFO L506 BasicCegarLoop]: Found error trace [2022-02-21 03:13:47,148 INFO L514 BasicCegarLoop]: trace histogram [6, 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] [2022-02-21 03:13:47,162 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:13:47,359 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,SelfDestructingSolverStorable8 [2022-02-21 03:13:47,360 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2022-02-21 03:13:47,360 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:13:47,360 INFO L85 PathProgramCache]: Analyzing trace with hash 432269099, now seen corresponding path program 2 times [2022-02-21 03:13:47,360 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:13:47,360 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1465793128] [2022-02-21 03:13:47,360 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:13:47,360 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:13:47,407 ERROR L252 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-02-21 03:13:47,407 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [634798197] [2022-02-21 03:13:47,408 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-02-21 03:13:47,408 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-21 03:13:47,408 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:13:47,409 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:13:47,410 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:13:48,310 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-02-21 03:13:48,310 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-02-21 03:13:48,315 INFO L263 TraceCheckSpWp]: Trace formula consists of 762 conjuncts, 16 conjunts are in the unsatisfiable core [2022-02-21 03:13:48,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:13:48,343 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 03:13:48,509 INFO L290 TraceCheckUtils]: 0: Hoare triple {13935#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);~count_int_int~0 := 0; {13935#true} is VALID [2022-02-21 03:13:48,509 INFO L290 TraceCheckUtils]: 1: Hoare triple {13935#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc6#1.base, main_#t~malloc6#1.offset, main_#t~mem8#1, main_#t~mem7#1, main_#t~mem9#1, main_#t~mem10#1, main_#t~mem12#1, main_#t~mem11#1, main_#t~mem13#1, main_#t~mem14#1, main_#t~mem16#1, main_#t~mem15#1, main_#t~mem17#1, main_#t~mem18#1, main_#t~switch19#1, main_#t~mem20#1, main_#t~mem21#1, main_#t~mem22#1, main_#t~mem23#1, main_#t~mem24#1, main_#t~mem25#1, main_#t~mem26#1, main_#t~mem27#1, main_#t~mem28#1, main_#t~mem29#1, main_#t~mem30#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~malloc31#1.base, main_#t~malloc31#1.offset, main_#t~mem32#1.base, main_#t~mem32#1.offset, main_#t~mem33#1.base, main_#t~mem33#1.offset, main_#t~memset~res34#1.base, main_#t~memset~res34#1.offset, main_#t~mem35#1.base, main_#t~mem35#1.offset, main_#t~mem36#1.base, main_#t~mem36#1.offset, main_#t~mem37#1.base, main_#t~mem37#1.offset, main_#t~mem38#1.base, main_#t~mem38#1.offset, main_#t~mem39#1.base, main_#t~mem39#1.offset, main_#t~malloc40#1.base, main_#t~malloc40#1.offset, main_#t~mem41#1.base, main_#t~mem41#1.offset, main_#t~mem42#1.base, main_#t~mem42#1.offset, main_#t~mem43#1.base, main_#t~mem43#1.offset, main_#t~mem44#1.base, main_#t~mem44#1.offset, main_#t~mem45#1.base, main_#t~mem45#1.offset, main_#t~mem46#1.base, main_#t~mem46#1.offset, main_#t~memset~res47#1.base, main_#t~memset~res47#1.offset, main_#t~mem48#1.base, main_#t~mem48#1.offset, main_#t~mem49#1.base, main_#t~mem49#1.offset, main_#t~mem50#1.base, main_#t~mem50#1.offset, main_#t~mem51#1.base, main_#t~mem51#1.offset, main_#t~mem52#1, main_#t~mem53#1.base, main_#t~mem53#1.offset, main_#t~mem54#1.base, main_#t~mem54#1.offset, main_#t~mem55#1.base, main_#t~mem55#1.offset, main_#t~mem56#1.base, main_#t~mem56#1.offset, main_#t~mem57#1, main_#t~post58#1, main_#t~mem59#1.base, main_#t~mem59#1.offset, main_#t~mem60#1, main_#t~mem61#1.base, main_#t~mem61#1.offset, main_#t~mem62#1.base, main_#t~mem62#1.offset, main_#t~mem63#1, main_#t~post64#1, main_#t~mem65#1.base, main_#t~mem65#1.offset, main_#t~mem66#1.base, main_#t~mem66#1.offset, main_#t~mem67#1.base, main_#t~mem67#1.offset, main_#t~mem69#1, main_#t~mem68#1, main_#t~mem70#1.base, main_#t~mem70#1.offset, main_#t~mem71#1, main_#t~short72#1, main_#t~mem73#1.base, main_#t~mem73#1.offset, main_#t~mem74#1, main_#t~malloc75#1.base, main_#t~malloc75#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~mem79#1, main_#t~memset~res80#1.base, main_#t~memset~res80#1.offset, main_#t~mem81#1.base, main_#t~mem81#1.offset, main_#t~mem82#1.base, main_#t~mem82#1.offset, main_#t~mem85#1, main_#t~mem83#1.base, main_#t~mem83#1.offset, main_#t~mem84#1, main_#t~mem86#1.base, main_#t~mem86#1.offset, main_#t~mem89#1, main_#t~mem87#1.base, main_#t~mem87#1.offset, main_#t~mem88#1, main_#t~ite90#1, main_#t~mem91#1.base, main_#t~mem91#1.offset, main_#t~mem95#1.base, main_#t~mem95#1.offset, main_#t~mem96#1.base, main_#t~mem96#1.offset, main_#t~mem97#1.base, main_#t~mem97#1.offset, main_#t~mem98#1.base, main_#t~mem98#1.offset, main_#t~mem101#1, main_#t~mem99#1.base, main_#t~mem99#1.offset, main_#t~mem100#1, main_#t~mem102#1.base, main_#t~mem102#1.offset, main_#t~mem103#1, main_#t~pre104#1, main_#t~mem105#1.base, main_#t~mem105#1.offset, main_#t~mem106#1, main_#t~mem107#1.base, main_#t~mem107#1.offset, main_#t~mem108#1, main_#t~post109#1, main_#t~mem113#1, main_#t~mem111#1, main_#t~mem110#1.base, main_#t~mem110#1.offset, main_#t~mem112#1, main_#t~mem114#1, main_#t~post115#1, main_#t~mem116#1.base, main_#t~mem116#1.offset, main_#t~mem117#1.base, main_#t~mem117#1.offset, main_#t~mem118#1.base, main_#t~mem118#1.offset, main_#t~post92#1, main_#t~mem93#1.base, main_#t~mem93#1.offset, main_#t~mem94#1, main_#t~mem119#1.base, main_#t~mem119#1.offset, main_#t~mem120#1.base, main_#t~mem120#1.offset, main_#t~mem121#1.base, main_#t~mem121#1.offset, main_#t~mem122#1, main_#t~mem123#1.base, main_#t~mem123#1.offset, main_#t~mem124#1, main_#t~post125#1, main_#t~mem126#1.base, main_#t~mem126#1.offset, main_#t~mem127#1.base, main_#t~mem127#1.offset, main_#t~mem128#1.base, main_#t~mem128#1.offset, main_#t~mem129#1.base, main_#t~mem129#1.offset, main_#t~mem132#1, main_#t~mem130#1.base, main_#t~mem130#1.offset, main_#t~mem131#1, main_#t~ite135#1, main_#t~mem133#1.base, main_#t~mem133#1.offset, main_#t~mem134#1, main_#t~mem136#1.base, main_#t~mem136#1.offset, main_#t~mem137#1, main_#t~mem138#1.base, main_#t~mem138#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~post5#1, main_#t~mem140#1, main_#t~mem141#1, main_#t~mem139#1.base, main_#t~mem139#1.offset, main_~i~0#1, main_~user~0#1.base, main_~user~0#1.offset, main_~users~0#1.base, main_~users~0#1.offset;havoc main_~i~0#1;havoc main_~user~0#1.base, main_~user~0#1.offset;main_~users~0#1.base, main_~users~0#1.offset := 0, 0;main_~i~0#1 := 0; {13935#true} is VALID [2022-02-21 03:13:48,509 INFO L290 TraceCheckUtils]: 2: Hoare triple {13935#true} assume !!(main_~i~0#1 < 10);call main_#t~malloc6#1.base, main_#t~malloc6#1.offset := #Ultimate.allocOnHeap(40);main_~user~0#1.base, main_~user~0#1.offset := main_#t~malloc6#1.base, main_#t~malloc6#1.offset;havoc main_#t~malloc6#1.base, main_#t~malloc6#1.offset; {13935#true} is VALID [2022-02-21 03:13:48,509 INFO L290 TraceCheckUtils]: 3: Hoare triple {13935#true} assume !(main_~user~0#1.base == 0 && main_~user~0#1.offset == 0); {13935#true} is VALID [2022-02-21 03:13:48,509 INFO L290 TraceCheckUtils]: 4: Hoare triple {13935#true} call write~int(main_~i~0#1, main_~user~0#1.base, main_~user~0#1.offset, 4); {13935#true} is VALID [2022-02-21 03:13:48,509 INFO L290 TraceCheckUtils]: 5: Hoare triple {13935#true} assume main_~i~0#1 * main_~i~0#1 <= 2147483647; {13935#true} is VALID [2022-02-21 03:13:48,509 INFO L290 TraceCheckUtils]: 6: Hoare triple {13935#true} assume main_~i~0#1 * main_~i~0#1 >= -2147483648;call write~int(main_~i~0#1 * main_~i~0#1, main_~user~0#1.base, 4 + main_~user~0#1.offset, 4); {13935#true} is VALID [2022-02-21 03:13:48,509 INFO L290 TraceCheckUtils]: 7: Hoare triple {13935#true} havoc main_~_ha_hashv~0#1; {13935#true} is VALID [2022-02-21 03:13:48,509 INFO L290 TraceCheckUtils]: 8: Hoare triple {13935#true} goto; {13935#true} is VALID [2022-02-21 03:13:48,510 INFO L290 TraceCheckUtils]: 9: Hoare triple {13935#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; {13967#(= 4 |ULTIMATE.start_main_~_hj_k~0#1|)} is VALID [2022-02-21 03:13:48,510 INFO L290 TraceCheckUtils]: 10: Hoare triple {13967#(= 4 |ULTIMATE.start_main_~_hj_k~0#1|)} assume !(main_~_hj_k~0#1 % 4294967296 >= 12); {13935#true} is VALID [2022-02-21 03:13:48,510 INFO L290 TraceCheckUtils]: 11: Hoare triple {13935#true} main_~_ha_hashv~0#1 := 4 + main_~_ha_hashv~0#1;main_#t~switch19#1 := 11 == main_~_hj_k~0#1; {13935#true} is VALID [2022-02-21 03:13:48,510 INFO L290 TraceCheckUtils]: 12: Hoare triple {13935#true} assume !main_#t~switch19#1; {13935#true} is VALID [2022-02-21 03:13:48,510 INFO L290 TraceCheckUtils]: 13: Hoare triple {13935#true} main_#t~switch19#1 := main_#t~switch19#1 || 10 == main_~_hj_k~0#1; {13935#true} is VALID [2022-02-21 03:13:48,510 INFO L290 TraceCheckUtils]: 14: Hoare triple {13935#true} assume !main_#t~switch19#1; {13935#true} is VALID [2022-02-21 03:13:48,510 INFO L290 TraceCheckUtils]: 15: Hoare triple {13935#true} main_#t~switch19#1 := main_#t~switch19#1 || 9 == main_~_hj_k~0#1; {13935#true} is VALID [2022-02-21 03:13:48,510 INFO L290 TraceCheckUtils]: 16: Hoare triple {13935#true} assume !main_#t~switch19#1; {13935#true} is VALID [2022-02-21 03:13:48,510 INFO L290 TraceCheckUtils]: 17: Hoare triple {13935#true} main_#t~switch19#1 := main_#t~switch19#1 || 8 == main_~_hj_k~0#1; {13935#true} is VALID [2022-02-21 03:13:48,510 INFO L290 TraceCheckUtils]: 18: Hoare triple {13935#true} assume !main_#t~switch19#1; {13935#true} is VALID [2022-02-21 03:13:48,510 INFO L290 TraceCheckUtils]: 19: Hoare triple {13935#true} main_#t~switch19#1 := main_#t~switch19#1 || 7 == main_~_hj_k~0#1; {13935#true} is VALID [2022-02-21 03:13:48,510 INFO L290 TraceCheckUtils]: 20: Hoare triple {13935#true} assume !main_#t~switch19#1; {13935#true} is VALID [2022-02-21 03:13:48,510 INFO L290 TraceCheckUtils]: 21: Hoare triple {13935#true} main_#t~switch19#1 := main_#t~switch19#1 || 6 == main_~_hj_k~0#1; {13935#true} is VALID [2022-02-21 03:13:48,510 INFO L290 TraceCheckUtils]: 22: Hoare triple {13935#true} assume !main_#t~switch19#1; {13935#true} is VALID [2022-02-21 03:13:48,510 INFO L290 TraceCheckUtils]: 23: Hoare triple {13935#true} main_#t~switch19#1 := main_#t~switch19#1 || 5 == main_~_hj_k~0#1; {13935#true} is VALID [2022-02-21 03:13:48,510 INFO L290 TraceCheckUtils]: 24: Hoare triple {13935#true} assume !main_#t~switch19#1; {13935#true} is VALID [2022-02-21 03:13:48,510 INFO L290 TraceCheckUtils]: 25: Hoare triple {13935#true} main_#t~switch19#1 := main_#t~switch19#1 || 4 == main_~_hj_k~0#1; {13935#true} is VALID [2022-02-21 03:13:48,510 INFO L290 TraceCheckUtils]: 26: Hoare triple {13935#true} assume main_#t~switch19#1;call main_#t~mem27#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~mem27#1 % 256);havoc main_#t~mem27#1; {13935#true} is VALID [2022-02-21 03:13:48,510 INFO L290 TraceCheckUtils]: 27: Hoare triple {13935#true} main_#t~switch19#1 := main_#t~switch19#1 || 3 == main_~_hj_k~0#1; {13935#true} is VALID [2022-02-21 03:13:48,510 INFO L290 TraceCheckUtils]: 28: Hoare triple {13935#true} assume main_#t~switch19#1;call main_#t~mem28#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~mem28#1 % 256);havoc main_#t~mem28#1; {13935#true} is VALID [2022-02-21 03:13:48,511 INFO L290 TraceCheckUtils]: 29: Hoare triple {13935#true} main_#t~switch19#1 := main_#t~switch19#1 || 2 == main_~_hj_k~0#1; {13935#true} is VALID [2022-02-21 03:13:48,511 INFO L290 TraceCheckUtils]: 30: Hoare triple {13935#true} assume main_#t~switch19#1;call main_#t~mem29#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~mem29#1 % 256);havoc main_#t~mem29#1; {13935#true} is VALID [2022-02-21 03:13:48,511 INFO L290 TraceCheckUtils]: 31: Hoare triple {13935#true} main_#t~switch19#1 := main_#t~switch19#1 || 1 == main_~_hj_k~0#1; {13935#true} is VALID [2022-02-21 03:13:48,511 INFO L290 TraceCheckUtils]: 32: Hoare triple {13935#true} assume main_#t~switch19#1;call main_#t~mem30#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~mem30#1 % 256;havoc main_#t~mem30#1; {13935#true} is VALID [2022-02-21 03:13:48,511 INFO L290 TraceCheckUtils]: 33: Hoare triple {13935#true} havoc main_#t~switch19#1; {13935#true} is VALID [2022-02-21 03:13:48,511 INFO L290 TraceCheckUtils]: 34: Hoare triple {13935#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)))); {13935#true} is VALID [2022-02-21 03:13:48,511 INFO L290 TraceCheckUtils]: 35: Hoare triple {13935#true} goto; {13935#true} is VALID [2022-02-21 03:13:48,511 INFO L290 TraceCheckUtils]: 36: Hoare triple {13935#true} goto; {13935#true} is VALID [2022-02-21 03:13:48,511 INFO L290 TraceCheckUtils]: 37: Hoare triple {13935#true} goto; {13935#true} is VALID [2022-02-21 03:13:48,511 INFO L290 TraceCheckUtils]: 38: Hoare triple {13935#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); {13935#true} is VALID [2022-02-21 03:13:48,511 INFO L290 TraceCheckUtils]: 39: Hoare triple {13935#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); {13935#true} is VALID [2022-02-21 03:13:48,511 INFO L290 TraceCheckUtils]: 40: Hoare triple {13935#true} call main_#t~malloc31#1.base, main_#t~malloc31#1.offset := #Ultimate.allocOnHeap(44);call write~$Pointer$(main_#t~malloc31#1.base, main_#t~malloc31#1.offset, main_~user~0#1.base, 8 + main_~user~0#1.offset, 4);havoc main_#t~malloc31#1.base, main_#t~malloc31#1.offset;call main_#t~mem32#1.base, main_#t~mem32#1.offset := read~$Pointer$(main_~user~0#1.base, 8 + main_~user~0#1.offset, 4); {13935#true} is VALID [2022-02-21 03:13:48,511 INFO L290 TraceCheckUtils]: 41: Hoare triple {13935#true} assume !(main_#t~mem32#1.base == 0 && main_#t~mem32#1.offset == 0);havoc main_#t~mem32#1.base, main_#t~mem32#1.offset;call main_#t~mem33#1.base, main_#t~mem33#1.offset := read~$Pointer$(main_~user~0#1.base, 8 + main_~user~0#1.offset, 4); {13935#true} is VALID [2022-02-21 03:13:48,511 INFO L272 TraceCheckUtils]: 42: Hoare triple {13935#true} call main_#t~memset~res34#1.base, main_#t~memset~res34#1.offset := #Ultimate.C_memset(main_#t~mem33#1.base, main_#t~mem33#1.offset, 0, 44); {13935#true} is VALID [2022-02-21 03:13:48,511 INFO L290 TraceCheckUtils]: 43: Hoare triple {13935#true} #t~loopctr143 := 0; {14070#(= |#Ultimate.C_memset_#t~loopctr143| 0)} is VALID [2022-02-21 03:13:48,512 INFO L290 TraceCheckUtils]: 44: Hoare triple {14070#(= |#Ultimate.C_memset_#t~loopctr143| 0)} assume #t~loopctr143 % 4294967296 < #amount % 4294967296;#memory_$Pointer$.base, #memory_$Pointer$.offset := #memory_$Pointer$.base[#ptr.base,#ptr.offset + #t~loopctr143 := 0], #memory_$Pointer$.offset[#ptr.base,#ptr.offset + #t~loopctr143 := #value % 256];#memory_int := #memory_int[#ptr.base,#ptr.offset + #t~loopctr143 := #value];#t~loopctr143 := 1 + #t~loopctr143; {14074#(= (+ (- 1) |#Ultimate.C_memset_#t~loopctr143|) 0)} is VALID [2022-02-21 03:13:48,519 INFO L290 TraceCheckUtils]: 45: Hoare triple {14074#(= (+ (- 1) |#Ultimate.C_memset_#t~loopctr143|) 0)} assume #t~loopctr143 % 4294967296 < #amount % 4294967296;#memory_$Pointer$.base, #memory_$Pointer$.offset := #memory_$Pointer$.base[#ptr.base,#ptr.offset + #t~loopctr143 := 0], #memory_$Pointer$.offset[#ptr.base,#ptr.offset + #t~loopctr143 := #value % 256];#memory_int := #memory_int[#ptr.base,#ptr.offset + #t~loopctr143 := #value];#t~loopctr143 := 1 + #t~loopctr143; {14078#(= (+ (- 2) |#Ultimate.C_memset_#t~loopctr143|) 0)} is VALID [2022-02-21 03:13:48,520 INFO L290 TraceCheckUtils]: 46: Hoare triple {14078#(= (+ (- 2) |#Ultimate.C_memset_#t~loopctr143|) 0)} assume #t~loopctr143 % 4294967296 < #amount % 4294967296;#memory_$Pointer$.base, #memory_$Pointer$.offset := #memory_$Pointer$.base[#ptr.base,#ptr.offset + #t~loopctr143 := 0], #memory_$Pointer$.offset[#ptr.base,#ptr.offset + #t~loopctr143 := #value % 256];#memory_int := #memory_int[#ptr.base,#ptr.offset + #t~loopctr143 := #value];#t~loopctr143 := 1 + #t~loopctr143; {14082#(= 0 (+ |#Ultimate.C_memset_#t~loopctr143| (- 3)))} is VALID [2022-02-21 03:13:48,521 INFO L290 TraceCheckUtils]: 47: Hoare triple {14082#(= 0 (+ |#Ultimate.C_memset_#t~loopctr143| (- 3)))} assume #t~loopctr143 % 4294967296 < #amount % 4294967296;#memory_$Pointer$.base, #memory_$Pointer$.offset := #memory_$Pointer$.base[#ptr.base,#ptr.offset + #t~loopctr143 := 0], #memory_$Pointer$.offset[#ptr.base,#ptr.offset + #t~loopctr143 := #value % 256];#memory_int := #memory_int[#ptr.base,#ptr.offset + #t~loopctr143 := #value];#t~loopctr143 := 1 + #t~loopctr143; {14086#(= (+ |#Ultimate.C_memset_#t~loopctr143| (- 4)) 0)} is VALID [2022-02-21 03:13:48,521 INFO L290 TraceCheckUtils]: 48: Hoare triple {14086#(= (+ |#Ultimate.C_memset_#t~loopctr143| (- 4)) 0)} assume !(#t~loopctr143 % 4294967296 < #amount % 4294967296); {14090#(not (< 4 (mod |#Ultimate.C_memset_#amount| 4294967296)))} is VALID [2022-02-21 03:13:48,521 INFO L290 TraceCheckUtils]: 49: Hoare triple {14090#(not (< 4 (mod |#Ultimate.C_memset_#amount| 4294967296)))} assume #res.base == #ptr.base && #res.offset == #ptr.offset; {14090#(not (< 4 (mod |#Ultimate.C_memset_#amount| 4294967296)))} is VALID [2022-02-21 03:13:48,522 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {14090#(not (< 4 (mod |#Ultimate.C_memset_#amount| 4294967296)))} {13935#true} #484#return; {13936#false} is VALID [2022-02-21 03:13:48,522 INFO L290 TraceCheckUtils]: 51: Hoare triple {13936#false} havoc main_#t~mem33#1.base, main_#t~mem33#1.offset;havoc main_#t~memset~res34#1.base, main_#t~memset~res34#1.offset;call main_#t~mem35#1.base, main_#t~mem35#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~mem35#1.base, 16 + main_#t~mem35#1.offset, 4);havoc main_#t~mem35#1.base, main_#t~mem35#1.offset;call main_#t~mem36#1.base, main_#t~mem36#1.offset := read~$Pointer$(main_~user~0#1.base, 8 + main_~user~0#1.offset, 4);call write~int(32, main_#t~mem36#1.base, 4 + main_#t~mem36#1.offset, 4);havoc main_#t~mem36#1.base, main_#t~mem36#1.offset;call main_#t~mem37#1.base, main_#t~mem37#1.offset := read~$Pointer$(main_~user~0#1.base, 8 + main_~user~0#1.offset, 4);call write~int(5, main_#t~mem37#1.base, 8 + main_#t~mem37#1.offset, 4);havoc main_#t~mem37#1.base, main_#t~mem37#1.offset;call main_#t~mem38#1.base, main_#t~mem38#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~mem38#1.base, 20 + main_#t~mem38#1.offset, 4);havoc main_#t~mem38#1.base, main_#t~mem38#1.offset;call main_#t~mem39#1.base, main_#t~mem39#1.offset := read~$Pointer$(main_~user~0#1.base, 8 + main_~user~0#1.offset, 4);call main_#t~malloc40#1.base, main_#t~malloc40#1.offset := #Ultimate.allocOnHeap(384);call write~$Pointer$(main_#t~malloc40#1.base, main_#t~malloc40#1.offset, main_#t~mem39#1.base, main_#t~mem39#1.offset, 4);havoc main_#t~mem39#1.base, main_#t~mem39#1.offset;havoc main_#t~malloc40#1.base, main_#t~malloc40#1.offset;call main_#t~mem41#1.base, main_#t~mem41#1.offset := read~$Pointer$(main_~user~0#1.base, 8 + main_~user~0#1.offset, 4);call write~int(2685476833, main_#t~mem41#1.base, 40 + main_#t~mem41#1.offset, 4);havoc main_#t~mem41#1.base, main_#t~mem41#1.offset;call main_#t~mem42#1.base, main_#t~mem42#1.offset := read~$Pointer$(main_~user~0#1.base, 8 + main_~user~0#1.offset, 4);call main_#t~mem43#1.base, main_#t~mem43#1.offset := read~$Pointer$(main_#t~mem42#1.base, main_#t~mem42#1.offset, 4); {13936#false} is VALID [2022-02-21 03:13:48,523 INFO L290 TraceCheckUtils]: 52: Hoare triple {13936#false} assume !(main_#t~mem43#1.base == 0 && main_#t~mem43#1.offset == 0);havoc main_#t~mem42#1.base, main_#t~mem42#1.offset;havoc main_#t~mem43#1.base, main_#t~mem43#1.offset;call main_#t~mem45#1.base, main_#t~mem45#1.offset := read~$Pointer$(main_~user~0#1.base, 8 + main_~user~0#1.offset, 4);call main_#t~mem46#1.base, main_#t~mem46#1.offset := read~$Pointer$(main_#t~mem45#1.base, main_#t~mem45#1.offset, 4); {13936#false} is VALID [2022-02-21 03:13:48,523 INFO L272 TraceCheckUtils]: 53: Hoare triple {13936#false} call main_#t~memset~res47#1.base, main_#t~memset~res47#1.offset := #Ultimate.C_memset(main_#t~mem46#1.base, main_#t~mem46#1.offset, 0, 384); {13936#false} is VALID [2022-02-21 03:13:48,523 INFO L290 TraceCheckUtils]: 54: Hoare triple {13936#false} #t~loopctr143 := 0; {13936#false} is VALID [2022-02-21 03:13:48,523 INFO L290 TraceCheckUtils]: 55: Hoare triple {13936#false} assume #t~loopctr143 % 4294967296 < #amount % 4294967296;#memory_$Pointer$.base, #memory_$Pointer$.offset := #memory_$Pointer$.base[#ptr.base,#ptr.offset + #t~loopctr143 := 0], #memory_$Pointer$.offset[#ptr.base,#ptr.offset + #t~loopctr143 := #value % 256];#memory_int := #memory_int[#ptr.base,#ptr.offset + #t~loopctr143 := #value];#t~loopctr143 := 1 + #t~loopctr143; {13936#false} is VALID [2022-02-21 03:13:48,523 INFO L290 TraceCheckUtils]: 56: Hoare triple {13936#false} assume #t~loopctr143 % 4294967296 < #amount % 4294967296;#memory_$Pointer$.base, #memory_$Pointer$.offset := #memory_$Pointer$.base[#ptr.base,#ptr.offset + #t~loopctr143 := 0], #memory_$Pointer$.offset[#ptr.base,#ptr.offset + #t~loopctr143 := #value % 256];#memory_int := #memory_int[#ptr.base,#ptr.offset + #t~loopctr143 := #value];#t~loopctr143 := 1 + #t~loopctr143; {13936#false} is VALID [2022-02-21 03:13:48,523 INFO L290 TraceCheckUtils]: 57: Hoare triple {13936#false} assume !(#t~loopctr143 % 4294967296 < #amount % 4294967296); {13936#false} is VALID [2022-02-21 03:13:48,523 INFO L290 TraceCheckUtils]: 58: Hoare triple {13936#false} assume #res.base == #ptr.base && #res.offset == #ptr.offset; {13936#false} is VALID [2022-02-21 03:13:48,523 INFO L284 TraceCheckUtils]: 59: Hoare quadruple {13936#false} {13936#false} #486#return; {13936#false} is VALID [2022-02-21 03:13:48,524 INFO L290 TraceCheckUtils]: 60: Hoare triple {13936#false} havoc main_#t~mem45#1.base, main_#t~mem45#1.offset;havoc main_#t~mem46#1.base, main_#t~mem46#1.offset;havoc main_#t~memset~res47#1.base, main_#t~memset~res47#1.offset; {13936#false} is VALID [2022-02-21 03:13:48,524 INFO L290 TraceCheckUtils]: 61: Hoare triple {13936#false} goto; {13936#false} is VALID [2022-02-21 03:13:48,524 INFO L290 TraceCheckUtils]: 62: Hoare triple {13936#false} main_~users~0#1.base, main_~users~0#1.offset := main_~user~0#1.base, main_~user~0#1.offset; {13936#false} is VALID [2022-02-21 03:13:48,524 INFO L290 TraceCheckUtils]: 63: Hoare triple {13936#false} havoc main_~_ha_bkt~0#1;call main_#t~mem56#1.base, main_#t~mem56#1.offset := read~$Pointer$(main_~users~0#1.base, 8 + main_~users~0#1.offset, 4);call main_#t~mem57#1 := read~int(main_#t~mem56#1.base, 12 + main_#t~mem56#1.offset, 4);main_#t~post58#1 := main_#t~mem57#1;call write~int(1 + main_#t~post58#1, main_#t~mem56#1.base, 12 + main_#t~mem56#1.offset, 4);havoc main_#t~mem56#1.base, main_#t~mem56#1.offset;havoc main_#t~mem57#1;havoc main_#t~post58#1; {13936#false} is VALID [2022-02-21 03:13:48,524 INFO L290 TraceCheckUtils]: 64: Hoare triple {13936#false} call main_#t~mem59#1.base, main_#t~mem59#1.offset := read~$Pointer$(main_~users~0#1.base, 8 + main_~users~0#1.offset, 4);call main_#t~mem60#1 := read~int(main_#t~mem59#1.base, 4 + main_#t~mem59#1.offset, 4);main_~_ha_bkt~0#1 := (if 0 == main_~_ha_hashv~0#1 || 0 == main_#t~mem60#1 - 1 then 0 else (if 1 == main_#t~mem60#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~mem60#1 - 1))) else (if 1 == main_~_ha_hashv~0#1 then (if 1 == main_#t~mem60#1 - 1 || 0 == main_#t~mem60#1 - 1 then main_#t~mem60#1 - 1 else (if main_#t~mem60#1 - 1 >= 0 then (main_#t~mem60#1 - 1) % 2 else ~bitwiseAnd(main_~_ha_hashv~0#1, main_#t~mem60#1 - 1))) else ~bitwiseAnd(main_~_ha_hashv~0#1, main_#t~mem60#1 - 1))));havoc main_#t~mem59#1.base, main_#t~mem59#1.offset;havoc main_#t~mem60#1; {13936#false} is VALID [2022-02-21 03:13:48,524 INFO L290 TraceCheckUtils]: 65: Hoare triple {13936#false} goto; {13936#false} is VALID [2022-02-21 03:13:48,524 INFO L290 TraceCheckUtils]: 66: Hoare triple {13936#false} call main_#t~mem61#1.base, main_#t~mem61#1.offset := read~$Pointer$(main_~users~0#1.base, 8 + main_~users~0#1.offset, 4);call main_#t~mem62#1.base, main_#t~mem62#1.offset := read~$Pointer$(main_#t~mem61#1.base, main_#t~mem61#1.offset, 4);main_~_ha_head~0#1.base, main_~_ha_head~0#1.offset := main_#t~mem62#1.base, main_#t~mem62#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~mem61#1.base, main_#t~mem61#1.offset;havoc main_#t~mem62#1.base, main_#t~mem62#1.offset;call main_#t~mem63#1 := read~int(main_~_ha_head~0#1.base, 4 + main_~_ha_head~0#1.offset, 4);main_#t~post64#1 := main_#t~mem63#1;call write~int(1 + main_#t~post64#1, main_~_ha_head~0#1.base, 4 + main_~_ha_head~0#1.offset, 4);havoc main_#t~mem63#1;havoc main_#t~post64#1;call main_#t~mem65#1.base, main_#t~mem65#1.offset := read~$Pointer$(main_~_ha_head~0#1.base, main_~_ha_head~0#1.offset, 4);call write~$Pointer$(main_#t~mem65#1.base, main_#t~mem65#1.offset, main_~user~0#1.base, 24 + main_~user~0#1.offset, 4);havoc main_#t~mem65#1.base, main_#t~mem65#1.offset;call write~$Pointer$(0, 0, main_~user~0#1.base, 20 + main_~user~0#1.offset, 4);call main_#t~mem66#1.base, main_#t~mem66#1.offset := read~$Pointer$(main_~_ha_head~0#1.base, main_~_ha_head~0#1.offset, 4); {13936#false} is VALID [2022-02-21 03:13:48,524 INFO L290 TraceCheckUtils]: 67: Hoare triple {13936#false} assume main_#t~mem66#1.base != 0 || main_#t~mem66#1.offset != 0;havoc main_#t~mem66#1.base, main_#t~mem66#1.offset;call main_#t~mem67#1.base, main_#t~mem67#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~mem67#1.base, 12 + main_#t~mem67#1.offset, 4);havoc main_#t~mem67#1.base, main_#t~mem67#1.offset; {13936#false} is VALID [2022-02-21 03:13:48,524 INFO L290 TraceCheckUtils]: 68: Hoare triple {13936#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~mem69#1 := read~int(main_~_ha_head~0#1.base, 4 + main_~_ha_head~0#1.offset, 4);call main_#t~mem68#1 := read~int(main_~_ha_head~0#1.base, 8 + main_~_ha_head~0#1.offset, 4);main_#t~short72#1 := main_#t~mem69#1 % 4294967296 >= 10 * (1 + main_#t~mem68#1) % 4294967296; {13936#false} is VALID [2022-02-21 03:13:48,525 INFO L290 TraceCheckUtils]: 69: Hoare triple {13936#false} assume main_#t~short72#1;call main_#t~mem70#1.base, main_#t~mem70#1.offset := read~$Pointer$(main_~user~0#1.base, 8 + main_~user~0#1.offset, 4);call main_#t~mem71#1 := read~int(main_#t~mem70#1.base, 36 + main_#t~mem70#1.offset, 4);main_#t~short72#1 := 0 == main_#t~mem71#1 % 4294967296; {13936#false} is VALID [2022-02-21 03:13:48,525 INFO L290 TraceCheckUtils]: 70: Hoare triple {13936#false} assume !main_#t~short72#1;havoc main_#t~mem69#1;havoc main_#t~mem68#1;havoc main_#t~mem70#1.base, main_#t~mem70#1.offset;havoc main_#t~mem71#1;havoc main_#t~short72#1; {13936#false} is VALID [2022-02-21 03:13:48,525 INFO L290 TraceCheckUtils]: 71: Hoare triple {13936#false} goto; {13936#false} is VALID [2022-02-21 03:13:48,525 INFO L290 TraceCheckUtils]: 72: Hoare triple {13936#false} goto; {13936#false} is VALID [2022-02-21 03:13:48,525 INFO L290 TraceCheckUtils]: 73: Hoare triple {13936#false} goto; {13936#false} is VALID [2022-02-21 03:13:48,525 INFO L290 TraceCheckUtils]: 74: Hoare triple {13936#false} goto; {13936#false} is VALID [2022-02-21 03:13:48,525 INFO L290 TraceCheckUtils]: 75: Hoare triple {13936#false} main_#t~post5#1 := main_~i~0#1; {13936#false} is VALID [2022-02-21 03:13:48,525 INFO L290 TraceCheckUtils]: 76: Hoare triple {13936#false} assume 1 + main_#t~post5#1 <= 2147483647; {13936#false} is VALID [2022-02-21 03:13:48,525 INFO L290 TraceCheckUtils]: 77: Hoare triple {13936#false} assume 1 + main_#t~post5#1 >= -2147483648;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; {13936#false} is VALID [2022-02-21 03:13:48,526 INFO L290 TraceCheckUtils]: 78: Hoare triple {13936#false} assume !!(main_~i~0#1 < 10);call main_#t~malloc6#1.base, main_#t~malloc6#1.offset := #Ultimate.allocOnHeap(40);main_~user~0#1.base, main_~user~0#1.offset := main_#t~malloc6#1.base, main_#t~malloc6#1.offset;havoc main_#t~malloc6#1.base, main_#t~malloc6#1.offset; {13936#false} is VALID [2022-02-21 03:13:48,526 INFO L290 TraceCheckUtils]: 79: Hoare triple {13936#false} assume !(main_~user~0#1.base == 0 && main_~user~0#1.offset == 0); {13936#false} is VALID [2022-02-21 03:13:48,526 INFO L290 TraceCheckUtils]: 80: Hoare triple {13936#false} call write~int(main_~i~0#1, main_~user~0#1.base, main_~user~0#1.offset, 4); {13936#false} is VALID [2022-02-21 03:13:48,526 INFO L290 TraceCheckUtils]: 81: Hoare triple {13936#false} assume !(main_~i~0#1 * main_~i~0#1 <= 2147483647); {13936#false} is VALID [2022-02-21 03:13:48,526 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 22 proven. 10 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-02-21 03:13:48,526 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-21 03:13:48,825 INFO L290 TraceCheckUtils]: 81: Hoare triple {13936#false} assume !(main_~i~0#1 * main_~i~0#1 <= 2147483647); {13936#false} is VALID [2022-02-21 03:13:48,826 INFO L290 TraceCheckUtils]: 80: Hoare triple {13936#false} call write~int(main_~i~0#1, main_~user~0#1.base, main_~user~0#1.offset, 4); {13936#false} is VALID [2022-02-21 03:13:48,826 INFO L290 TraceCheckUtils]: 79: Hoare triple {13936#false} assume !(main_~user~0#1.base == 0 && main_~user~0#1.offset == 0); {13936#false} is VALID [2022-02-21 03:13:48,826 INFO L290 TraceCheckUtils]: 78: Hoare triple {13936#false} assume !!(main_~i~0#1 < 10);call main_#t~malloc6#1.base, main_#t~malloc6#1.offset := #Ultimate.allocOnHeap(40);main_~user~0#1.base, main_~user~0#1.offset := main_#t~malloc6#1.base, main_#t~malloc6#1.offset;havoc main_#t~malloc6#1.base, main_#t~malloc6#1.offset; {13936#false} is VALID [2022-02-21 03:13:48,826 INFO L290 TraceCheckUtils]: 77: Hoare triple {13936#false} assume 1 + main_#t~post5#1 >= -2147483648;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; {13936#false} is VALID [2022-02-21 03:13:48,826 INFO L290 TraceCheckUtils]: 76: Hoare triple {13936#false} assume 1 + main_#t~post5#1 <= 2147483647; {13936#false} is VALID [2022-02-21 03:13:48,826 INFO L290 TraceCheckUtils]: 75: Hoare triple {13936#false} main_#t~post5#1 := main_~i~0#1; {13936#false} is VALID [2022-02-21 03:13:48,826 INFO L290 TraceCheckUtils]: 74: Hoare triple {13936#false} goto; {13936#false} is VALID [2022-02-21 03:13:48,826 INFO L290 TraceCheckUtils]: 73: Hoare triple {13936#false} goto; {13936#false} is VALID [2022-02-21 03:13:48,826 INFO L290 TraceCheckUtils]: 72: Hoare triple {13936#false} goto; {13936#false} is VALID [2022-02-21 03:13:48,826 INFO L290 TraceCheckUtils]: 71: Hoare triple {13936#false} goto; {13936#false} is VALID [2022-02-21 03:13:48,826 INFO L290 TraceCheckUtils]: 70: Hoare triple {13936#false} assume !main_#t~short72#1;havoc main_#t~mem69#1;havoc main_#t~mem68#1;havoc main_#t~mem70#1.base, main_#t~mem70#1.offset;havoc main_#t~mem71#1;havoc main_#t~short72#1; {13936#false} is VALID [2022-02-21 03:13:48,826 INFO L290 TraceCheckUtils]: 69: Hoare triple {13936#false} assume main_#t~short72#1;call main_#t~mem70#1.base, main_#t~mem70#1.offset := read~$Pointer$(main_~user~0#1.base, 8 + main_~user~0#1.offset, 4);call main_#t~mem71#1 := read~int(main_#t~mem70#1.base, 36 + main_#t~mem70#1.offset, 4);main_#t~short72#1 := 0 == main_#t~mem71#1 % 4294967296; {13936#false} is VALID [2022-02-21 03:13:48,826 INFO L290 TraceCheckUtils]: 68: Hoare triple {13936#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~mem69#1 := read~int(main_~_ha_head~0#1.base, 4 + main_~_ha_head~0#1.offset, 4);call main_#t~mem68#1 := read~int(main_~_ha_head~0#1.base, 8 + main_~_ha_head~0#1.offset, 4);main_#t~short72#1 := main_#t~mem69#1 % 4294967296 >= 10 * (1 + main_#t~mem68#1) % 4294967296; {13936#false} is VALID [2022-02-21 03:13:48,826 INFO L290 TraceCheckUtils]: 67: Hoare triple {13936#false} assume main_#t~mem66#1.base != 0 || main_#t~mem66#1.offset != 0;havoc main_#t~mem66#1.base, main_#t~mem66#1.offset;call main_#t~mem67#1.base, main_#t~mem67#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~mem67#1.base, 12 + main_#t~mem67#1.offset, 4);havoc main_#t~mem67#1.base, main_#t~mem67#1.offset; {13936#false} is VALID [2022-02-21 03:13:48,826 INFO L290 TraceCheckUtils]: 66: Hoare triple {13936#false} call main_#t~mem61#1.base, main_#t~mem61#1.offset := read~$Pointer$(main_~users~0#1.base, 8 + main_~users~0#1.offset, 4);call main_#t~mem62#1.base, main_#t~mem62#1.offset := read~$Pointer$(main_#t~mem61#1.base, main_#t~mem61#1.offset, 4);main_~_ha_head~0#1.base, main_~_ha_head~0#1.offset := main_#t~mem62#1.base, main_#t~mem62#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~mem61#1.base, main_#t~mem61#1.offset;havoc main_#t~mem62#1.base, main_#t~mem62#1.offset;call main_#t~mem63#1 := read~int(main_~_ha_head~0#1.base, 4 + main_~_ha_head~0#1.offset, 4);main_#t~post64#1 := main_#t~mem63#1;call write~int(1 + main_#t~post64#1, main_~_ha_head~0#1.base, 4 + main_~_ha_head~0#1.offset, 4);havoc main_#t~mem63#1;havoc main_#t~post64#1;call main_#t~mem65#1.base, main_#t~mem65#1.offset := read~$Pointer$(main_~_ha_head~0#1.base, main_~_ha_head~0#1.offset, 4);call write~$Pointer$(main_#t~mem65#1.base, main_#t~mem65#1.offset, main_~user~0#1.base, 24 + main_~user~0#1.offset, 4);havoc main_#t~mem65#1.base, main_#t~mem65#1.offset;call write~$Pointer$(0, 0, main_~user~0#1.base, 20 + main_~user~0#1.offset, 4);call main_#t~mem66#1.base, main_#t~mem66#1.offset := read~$Pointer$(main_~_ha_head~0#1.base, main_~_ha_head~0#1.offset, 4); {13936#false} is VALID [2022-02-21 03:13:48,826 INFO L290 TraceCheckUtils]: 65: Hoare triple {13936#false} goto; {13936#false} is VALID [2022-02-21 03:13:48,826 INFO L290 TraceCheckUtils]: 64: Hoare triple {13936#false} call main_#t~mem59#1.base, main_#t~mem59#1.offset := read~$Pointer$(main_~users~0#1.base, 8 + main_~users~0#1.offset, 4);call main_#t~mem60#1 := read~int(main_#t~mem59#1.base, 4 + main_#t~mem59#1.offset, 4);main_~_ha_bkt~0#1 := (if 0 == main_~_ha_hashv~0#1 || 0 == main_#t~mem60#1 - 1 then 0 else (if 1 == main_#t~mem60#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~mem60#1 - 1))) else (if 1 == main_~_ha_hashv~0#1 then (if 1 == main_#t~mem60#1 - 1 || 0 == main_#t~mem60#1 - 1 then main_#t~mem60#1 - 1 else (if main_#t~mem60#1 - 1 >= 0 then (main_#t~mem60#1 - 1) % 2 else ~bitwiseAnd(main_~_ha_hashv~0#1, main_#t~mem60#1 - 1))) else ~bitwiseAnd(main_~_ha_hashv~0#1, main_#t~mem60#1 - 1))));havoc main_#t~mem59#1.base, main_#t~mem59#1.offset;havoc main_#t~mem60#1; {13936#false} is VALID [2022-02-21 03:13:48,826 INFO L290 TraceCheckUtils]: 63: Hoare triple {13936#false} havoc main_~_ha_bkt~0#1;call main_#t~mem56#1.base, main_#t~mem56#1.offset := read~$Pointer$(main_~users~0#1.base, 8 + main_~users~0#1.offset, 4);call main_#t~mem57#1 := read~int(main_#t~mem56#1.base, 12 + main_#t~mem56#1.offset, 4);main_#t~post58#1 := main_#t~mem57#1;call write~int(1 + main_#t~post58#1, main_#t~mem56#1.base, 12 + main_#t~mem56#1.offset, 4);havoc main_#t~mem56#1.base, main_#t~mem56#1.offset;havoc main_#t~mem57#1;havoc main_#t~post58#1; {13936#false} is VALID [2022-02-21 03:13:48,826 INFO L290 TraceCheckUtils]: 62: Hoare triple {13936#false} main_~users~0#1.base, main_~users~0#1.offset := main_~user~0#1.base, main_~user~0#1.offset; {13936#false} is VALID [2022-02-21 03:13:48,827 INFO L290 TraceCheckUtils]: 61: Hoare triple {13936#false} goto; {13936#false} is VALID [2022-02-21 03:13:48,827 INFO L290 TraceCheckUtils]: 60: Hoare triple {13936#false} havoc main_#t~mem45#1.base, main_#t~mem45#1.offset;havoc main_#t~mem46#1.base, main_#t~mem46#1.offset;havoc main_#t~memset~res47#1.base, main_#t~memset~res47#1.offset; {13936#false} is VALID [2022-02-21 03:13:48,827 INFO L284 TraceCheckUtils]: 59: Hoare quadruple {13935#true} {13936#false} #486#return; {13936#false} is VALID [2022-02-21 03:13:48,827 INFO L290 TraceCheckUtils]: 58: Hoare triple {13935#true} assume #res.base == #ptr.base && #res.offset == #ptr.offset; {13935#true} is VALID [2022-02-21 03:13:48,827 INFO L290 TraceCheckUtils]: 57: Hoare triple {13935#true} assume !(#t~loopctr143 % 4294967296 < #amount % 4294967296); {13935#true} is VALID [2022-02-21 03:13:48,827 INFO L290 TraceCheckUtils]: 56: Hoare triple {13935#true} assume #t~loopctr143 % 4294967296 < #amount % 4294967296;#memory_$Pointer$.base, #memory_$Pointer$.offset := #memory_$Pointer$.base[#ptr.base,#ptr.offset + #t~loopctr143 := 0], #memory_$Pointer$.offset[#ptr.base,#ptr.offset + #t~loopctr143 := #value % 256];#memory_int := #memory_int[#ptr.base,#ptr.offset + #t~loopctr143 := #value];#t~loopctr143 := 1 + #t~loopctr143; {13935#true} is VALID [2022-02-21 03:13:48,827 INFO L290 TraceCheckUtils]: 55: Hoare triple {13935#true} assume #t~loopctr143 % 4294967296 < #amount % 4294967296;#memory_$Pointer$.base, #memory_$Pointer$.offset := #memory_$Pointer$.base[#ptr.base,#ptr.offset + #t~loopctr143 := 0], #memory_$Pointer$.offset[#ptr.base,#ptr.offset + #t~loopctr143 := #value % 256];#memory_int := #memory_int[#ptr.base,#ptr.offset + #t~loopctr143 := #value];#t~loopctr143 := 1 + #t~loopctr143; {13935#true} is VALID [2022-02-21 03:13:48,827 INFO L290 TraceCheckUtils]: 54: Hoare triple {13935#true} #t~loopctr143 := 0; {13935#true} is VALID [2022-02-21 03:13:48,827 INFO L272 TraceCheckUtils]: 53: Hoare triple {13936#false} call main_#t~memset~res47#1.base, main_#t~memset~res47#1.offset := #Ultimate.C_memset(main_#t~mem46#1.base, main_#t~mem46#1.offset, 0, 384); {13935#true} is VALID [2022-02-21 03:13:48,827 INFO L290 TraceCheckUtils]: 52: Hoare triple {13936#false} assume !(main_#t~mem43#1.base == 0 && main_#t~mem43#1.offset == 0);havoc main_#t~mem42#1.base, main_#t~mem42#1.offset;havoc main_#t~mem43#1.base, main_#t~mem43#1.offset;call main_#t~mem45#1.base, main_#t~mem45#1.offset := read~$Pointer$(main_~user~0#1.base, 8 + main_~user~0#1.offset, 4);call main_#t~mem46#1.base, main_#t~mem46#1.offset := read~$Pointer$(main_#t~mem45#1.base, main_#t~mem45#1.offset, 4); {13936#false} is VALID [2022-02-21 03:13:48,827 INFO L290 TraceCheckUtils]: 51: Hoare triple {13936#false} havoc main_#t~mem33#1.base, main_#t~mem33#1.offset;havoc main_#t~memset~res34#1.base, main_#t~memset~res34#1.offset;call main_#t~mem35#1.base, main_#t~mem35#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~mem35#1.base, 16 + main_#t~mem35#1.offset, 4);havoc main_#t~mem35#1.base, main_#t~mem35#1.offset;call main_#t~mem36#1.base, main_#t~mem36#1.offset := read~$Pointer$(main_~user~0#1.base, 8 + main_~user~0#1.offset, 4);call write~int(32, main_#t~mem36#1.base, 4 + main_#t~mem36#1.offset, 4);havoc main_#t~mem36#1.base, main_#t~mem36#1.offset;call main_#t~mem37#1.base, main_#t~mem37#1.offset := read~$Pointer$(main_~user~0#1.base, 8 + main_~user~0#1.offset, 4);call write~int(5, main_#t~mem37#1.base, 8 + main_#t~mem37#1.offset, 4);havoc main_#t~mem37#1.base, main_#t~mem37#1.offset;call main_#t~mem38#1.base, main_#t~mem38#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~mem38#1.base, 20 + main_#t~mem38#1.offset, 4);havoc main_#t~mem38#1.base, main_#t~mem38#1.offset;call main_#t~mem39#1.base, main_#t~mem39#1.offset := read~$Pointer$(main_~user~0#1.base, 8 + main_~user~0#1.offset, 4);call main_#t~malloc40#1.base, main_#t~malloc40#1.offset := #Ultimate.allocOnHeap(384);call write~$Pointer$(main_#t~malloc40#1.base, main_#t~malloc40#1.offset, main_#t~mem39#1.base, main_#t~mem39#1.offset, 4);havoc main_#t~mem39#1.base, main_#t~mem39#1.offset;havoc main_#t~malloc40#1.base, main_#t~malloc40#1.offset;call main_#t~mem41#1.base, main_#t~mem41#1.offset := read~$Pointer$(main_~user~0#1.base, 8 + main_~user~0#1.offset, 4);call write~int(2685476833, main_#t~mem41#1.base, 40 + main_#t~mem41#1.offset, 4);havoc main_#t~mem41#1.base, main_#t~mem41#1.offset;call main_#t~mem42#1.base, main_#t~mem42#1.offset := read~$Pointer$(main_~user~0#1.base, 8 + main_~user~0#1.offset, 4);call main_#t~mem43#1.base, main_#t~mem43#1.offset := read~$Pointer$(main_#t~mem42#1.base, main_#t~mem42#1.offset, 4); {13936#false} is VALID [2022-02-21 03:13:48,828 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {14286#(not (= 44 |#Ultimate.C_memset_#amount|))} {13935#true} #484#return; {13936#false} is VALID [2022-02-21 03:13:48,828 INFO L290 TraceCheckUtils]: 49: Hoare triple {14286#(not (= 44 |#Ultimate.C_memset_#amount|))} assume #res.base == #ptr.base && #res.offset == #ptr.offset; {14286#(not (= 44 |#Ultimate.C_memset_#amount|))} is VALID [2022-02-21 03:13:48,829 INFO L290 TraceCheckUtils]: 48: Hoare triple {14293#(or (< (mod |#Ultimate.C_memset_#t~loopctr143| 4294967296) (mod |#Ultimate.C_memset_#amount| 4294967296)) (not (= 44 |#Ultimate.C_memset_#amount|)))} assume !(#t~loopctr143 % 4294967296 < #amount % 4294967296); {14286#(not (= 44 |#Ultimate.C_memset_#amount|))} is VALID [2022-02-21 03:13:48,830 INFO L290 TraceCheckUtils]: 47: Hoare triple {14297#(or (not (= 44 |#Ultimate.C_memset_#amount|)) (< (mod (+ |#Ultimate.C_memset_#t~loopctr143| 1) 4294967296) (mod |#Ultimate.C_memset_#amount| 4294967296)))} assume #t~loopctr143 % 4294967296 < #amount % 4294967296;#memory_$Pointer$.base, #memory_$Pointer$.offset := #memory_$Pointer$.base[#ptr.base,#ptr.offset + #t~loopctr143 := 0], #memory_$Pointer$.offset[#ptr.base,#ptr.offset + #t~loopctr143 := #value % 256];#memory_int := #memory_int[#ptr.base,#ptr.offset + #t~loopctr143 := #value];#t~loopctr143 := 1 + #t~loopctr143; {14293#(or (< (mod |#Ultimate.C_memset_#t~loopctr143| 4294967296) (mod |#Ultimate.C_memset_#amount| 4294967296)) (not (= 44 |#Ultimate.C_memset_#amount|)))} is VALID [2022-02-21 03:13:48,831 INFO L290 TraceCheckUtils]: 46: Hoare triple {14301#(or (< (mod (+ |#Ultimate.C_memset_#t~loopctr143| 2) 4294967296) (mod |#Ultimate.C_memset_#amount| 4294967296)) (not (= 44 |#Ultimate.C_memset_#amount|)))} assume #t~loopctr143 % 4294967296 < #amount % 4294967296;#memory_$Pointer$.base, #memory_$Pointer$.offset := #memory_$Pointer$.base[#ptr.base,#ptr.offset + #t~loopctr143 := 0], #memory_$Pointer$.offset[#ptr.base,#ptr.offset + #t~loopctr143 := #value % 256];#memory_int := #memory_int[#ptr.base,#ptr.offset + #t~loopctr143 := #value];#t~loopctr143 := 1 + #t~loopctr143; {14297#(or (not (= 44 |#Ultimate.C_memset_#amount|)) (< (mod (+ |#Ultimate.C_memset_#t~loopctr143| 1) 4294967296) (mod |#Ultimate.C_memset_#amount| 4294967296)))} is VALID [2022-02-21 03:13:48,832 INFO L290 TraceCheckUtils]: 45: Hoare triple {14305#(or (not (= 44 |#Ultimate.C_memset_#amount|)) (< (mod (+ |#Ultimate.C_memset_#t~loopctr143| 3) 4294967296) (mod |#Ultimate.C_memset_#amount| 4294967296)))} assume #t~loopctr143 % 4294967296 < #amount % 4294967296;#memory_$Pointer$.base, #memory_$Pointer$.offset := #memory_$Pointer$.base[#ptr.base,#ptr.offset + #t~loopctr143 := 0], #memory_$Pointer$.offset[#ptr.base,#ptr.offset + #t~loopctr143 := #value % 256];#memory_int := #memory_int[#ptr.base,#ptr.offset + #t~loopctr143 := #value];#t~loopctr143 := 1 + #t~loopctr143; {14301#(or (< (mod (+ |#Ultimate.C_memset_#t~loopctr143| 2) 4294967296) (mod |#Ultimate.C_memset_#amount| 4294967296)) (not (= 44 |#Ultimate.C_memset_#amount|)))} is VALID [2022-02-21 03:13:48,833 INFO L290 TraceCheckUtils]: 44: Hoare triple {14309#(or (< (mod (+ |#Ultimate.C_memset_#t~loopctr143| 4) 4294967296) (mod |#Ultimate.C_memset_#amount| 4294967296)) (not (= 44 |#Ultimate.C_memset_#amount|)))} assume #t~loopctr143 % 4294967296 < #amount % 4294967296;#memory_$Pointer$.base, #memory_$Pointer$.offset := #memory_$Pointer$.base[#ptr.base,#ptr.offset + #t~loopctr143 := 0], #memory_$Pointer$.offset[#ptr.base,#ptr.offset + #t~loopctr143 := #value % 256];#memory_int := #memory_int[#ptr.base,#ptr.offset + #t~loopctr143 := #value];#t~loopctr143 := 1 + #t~loopctr143; {14305#(or (not (= 44 |#Ultimate.C_memset_#amount|)) (< (mod (+ |#Ultimate.C_memset_#t~loopctr143| 3) 4294967296) (mod |#Ultimate.C_memset_#amount| 4294967296)))} is VALID [2022-02-21 03:13:48,833 INFO L290 TraceCheckUtils]: 43: Hoare triple {13935#true} #t~loopctr143 := 0; {14309#(or (< (mod (+ |#Ultimate.C_memset_#t~loopctr143| 4) 4294967296) (mod |#Ultimate.C_memset_#amount| 4294967296)) (not (= 44 |#Ultimate.C_memset_#amount|)))} is VALID [2022-02-21 03:13:48,833 INFO L272 TraceCheckUtils]: 42: Hoare triple {13935#true} call main_#t~memset~res34#1.base, main_#t~memset~res34#1.offset := #Ultimate.C_memset(main_#t~mem33#1.base, main_#t~mem33#1.offset, 0, 44); {13935#true} is VALID [2022-02-21 03:13:48,833 INFO L290 TraceCheckUtils]: 41: Hoare triple {13935#true} assume !(main_#t~mem32#1.base == 0 && main_#t~mem32#1.offset == 0);havoc main_#t~mem32#1.base, main_#t~mem32#1.offset;call main_#t~mem33#1.base, main_#t~mem33#1.offset := read~$Pointer$(main_~user~0#1.base, 8 + main_~user~0#1.offset, 4); {13935#true} is VALID [2022-02-21 03:13:48,833 INFO L290 TraceCheckUtils]: 40: Hoare triple {13935#true} call main_#t~malloc31#1.base, main_#t~malloc31#1.offset := #Ultimate.allocOnHeap(44);call write~$Pointer$(main_#t~malloc31#1.base, main_#t~malloc31#1.offset, main_~user~0#1.base, 8 + main_~user~0#1.offset, 4);havoc main_#t~malloc31#1.base, main_#t~malloc31#1.offset;call main_#t~mem32#1.base, main_#t~mem32#1.offset := read~$Pointer$(main_~user~0#1.base, 8 + main_~user~0#1.offset, 4); {13935#true} is VALID [2022-02-21 03:13:48,833 INFO L290 TraceCheckUtils]: 39: Hoare triple {13935#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); {13935#true} is VALID [2022-02-21 03:13:48,833 INFO L290 TraceCheckUtils]: 38: Hoare triple {13935#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); {13935#true} is VALID [2022-02-21 03:13:48,833 INFO L290 TraceCheckUtils]: 37: Hoare triple {13935#true} goto; {13935#true} is VALID [2022-02-21 03:13:48,834 INFO L290 TraceCheckUtils]: 36: Hoare triple {13935#true} goto; {13935#true} is VALID [2022-02-21 03:13:48,834 INFO L290 TraceCheckUtils]: 35: Hoare triple {13935#true} goto; {13935#true} is VALID [2022-02-21 03:13:48,834 INFO L290 TraceCheckUtils]: 34: Hoare triple {13935#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)))); {13935#true} is VALID [2022-02-21 03:13:48,834 INFO L290 TraceCheckUtils]: 33: Hoare triple {13935#true} havoc main_#t~switch19#1; {13935#true} is VALID [2022-02-21 03:13:48,834 INFO L290 TraceCheckUtils]: 32: Hoare triple {13935#true} assume main_#t~switch19#1;call main_#t~mem30#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~mem30#1 % 256;havoc main_#t~mem30#1; {13935#true} is VALID [2022-02-21 03:13:48,834 INFO L290 TraceCheckUtils]: 31: Hoare triple {13935#true} main_#t~switch19#1 := main_#t~switch19#1 || 1 == main_~_hj_k~0#1; {13935#true} is VALID [2022-02-21 03:13:48,834 INFO L290 TraceCheckUtils]: 30: Hoare triple {13935#true} assume main_#t~switch19#1;call main_#t~mem29#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~mem29#1 % 256);havoc main_#t~mem29#1; {13935#true} is VALID [2022-02-21 03:13:48,834 INFO L290 TraceCheckUtils]: 29: Hoare triple {13935#true} main_#t~switch19#1 := main_#t~switch19#1 || 2 == main_~_hj_k~0#1; {13935#true} is VALID [2022-02-21 03:13:48,834 INFO L290 TraceCheckUtils]: 28: Hoare triple {13935#true} assume main_#t~switch19#1;call main_#t~mem28#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~mem28#1 % 256);havoc main_#t~mem28#1; {13935#true} is VALID [2022-02-21 03:13:48,834 INFO L290 TraceCheckUtils]: 27: Hoare triple {13935#true} main_#t~switch19#1 := main_#t~switch19#1 || 3 == main_~_hj_k~0#1; {13935#true} is VALID [2022-02-21 03:13:48,835 INFO L290 TraceCheckUtils]: 26: Hoare triple {13935#true} assume main_#t~switch19#1;call main_#t~mem27#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~mem27#1 % 256);havoc main_#t~mem27#1; {13935#true} is VALID [2022-02-21 03:13:48,835 INFO L290 TraceCheckUtils]: 25: Hoare triple {13935#true} main_#t~switch19#1 := main_#t~switch19#1 || 4 == main_~_hj_k~0#1; {13935#true} is VALID [2022-02-21 03:13:48,835 INFO L290 TraceCheckUtils]: 24: Hoare triple {13935#true} assume !main_#t~switch19#1; {13935#true} is VALID [2022-02-21 03:13:48,835 INFO L290 TraceCheckUtils]: 23: Hoare triple {13935#true} main_#t~switch19#1 := main_#t~switch19#1 || 5 == main_~_hj_k~0#1; {13935#true} is VALID [2022-02-21 03:13:48,835 INFO L290 TraceCheckUtils]: 22: Hoare triple {13935#true} assume !main_#t~switch19#1; {13935#true} is VALID [2022-02-21 03:13:48,835 INFO L290 TraceCheckUtils]: 21: Hoare triple {13935#true} main_#t~switch19#1 := main_#t~switch19#1 || 6 == main_~_hj_k~0#1; {13935#true} is VALID [2022-02-21 03:13:48,835 INFO L290 TraceCheckUtils]: 20: Hoare triple {13935#true} assume !main_#t~switch19#1; {13935#true} is VALID [2022-02-21 03:13:48,835 INFO L290 TraceCheckUtils]: 19: Hoare triple {13935#true} main_#t~switch19#1 := main_#t~switch19#1 || 7 == main_~_hj_k~0#1; {13935#true} is VALID [2022-02-21 03:13:48,835 INFO L290 TraceCheckUtils]: 18: Hoare triple {13935#true} assume !main_#t~switch19#1; {13935#true} is VALID [2022-02-21 03:13:48,836 INFO L290 TraceCheckUtils]: 17: Hoare triple {13935#true} main_#t~switch19#1 := main_#t~switch19#1 || 8 == main_~_hj_k~0#1; {13935#true} is VALID [2022-02-21 03:13:48,836 INFO L290 TraceCheckUtils]: 16: Hoare triple {13935#true} assume !main_#t~switch19#1; {13935#true} is VALID [2022-02-21 03:13:48,836 INFO L290 TraceCheckUtils]: 15: Hoare triple {13935#true} main_#t~switch19#1 := main_#t~switch19#1 || 9 == main_~_hj_k~0#1; {13935#true} is VALID [2022-02-21 03:13:48,836 INFO L290 TraceCheckUtils]: 14: Hoare triple {13935#true} assume !main_#t~switch19#1; {13935#true} is VALID [2022-02-21 03:13:48,836 INFO L290 TraceCheckUtils]: 13: Hoare triple {13935#true} main_#t~switch19#1 := main_#t~switch19#1 || 10 == main_~_hj_k~0#1; {13935#true} is VALID [2022-02-21 03:13:48,836 INFO L290 TraceCheckUtils]: 12: Hoare triple {13935#true} assume !main_#t~switch19#1; {13935#true} is VALID [2022-02-21 03:13:48,836 INFO L290 TraceCheckUtils]: 11: Hoare triple {13935#true} main_~_ha_hashv~0#1 := 4 + main_~_ha_hashv~0#1;main_#t~switch19#1 := 11 == main_~_hj_k~0#1; {13935#true} is VALID [2022-02-21 03:13:48,836 INFO L290 TraceCheckUtils]: 10: Hoare triple {13935#true} assume !(main_~_hj_k~0#1 % 4294967296 >= 12); {13935#true} is VALID [2022-02-21 03:13:48,836 INFO L290 TraceCheckUtils]: 9: Hoare triple {13935#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; {13935#true} is VALID [2022-02-21 03:13:48,836 INFO L290 TraceCheckUtils]: 8: Hoare triple {13935#true} goto; {13935#true} is VALID [2022-02-21 03:13:48,837 INFO L290 TraceCheckUtils]: 7: Hoare triple {13935#true} havoc main_~_ha_hashv~0#1; {13935#true} is VALID [2022-02-21 03:13:48,837 INFO L290 TraceCheckUtils]: 6: Hoare triple {13935#true} assume main_~i~0#1 * main_~i~0#1 >= -2147483648;call write~int(main_~i~0#1 * main_~i~0#1, main_~user~0#1.base, 4 + main_~user~0#1.offset, 4); {13935#true} is VALID [2022-02-21 03:13:48,837 INFO L290 TraceCheckUtils]: 5: Hoare triple {13935#true} assume main_~i~0#1 * main_~i~0#1 <= 2147483647; {13935#true} is VALID [2022-02-21 03:13:48,837 INFO L290 TraceCheckUtils]: 4: Hoare triple {13935#true} call write~int(main_~i~0#1, main_~user~0#1.base, main_~user~0#1.offset, 4); {13935#true} is VALID [2022-02-21 03:13:48,837 INFO L290 TraceCheckUtils]: 3: Hoare triple {13935#true} assume !(main_~user~0#1.base == 0 && main_~user~0#1.offset == 0); {13935#true} is VALID [2022-02-21 03:13:48,837 INFO L290 TraceCheckUtils]: 2: Hoare triple {13935#true} assume !!(main_~i~0#1 < 10);call main_#t~malloc6#1.base, main_#t~malloc6#1.offset := #Ultimate.allocOnHeap(40);main_~user~0#1.base, main_~user~0#1.offset := main_#t~malloc6#1.base, main_#t~malloc6#1.offset;havoc main_#t~malloc6#1.base, main_#t~malloc6#1.offset; {13935#true} is VALID [2022-02-21 03:13:48,837 INFO L290 TraceCheckUtils]: 1: Hoare triple {13935#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc6#1.base, main_#t~malloc6#1.offset, main_#t~mem8#1, main_#t~mem7#1, main_#t~mem9#1, main_#t~mem10#1, main_#t~mem12#1, main_#t~mem11#1, main_#t~mem13#1, main_#t~mem14#1, main_#t~mem16#1, main_#t~mem15#1, main_#t~mem17#1, main_#t~mem18#1, main_#t~switch19#1, main_#t~mem20#1, main_#t~mem21#1, main_#t~mem22#1, main_#t~mem23#1, main_#t~mem24#1, main_#t~mem25#1, main_#t~mem26#1, main_#t~mem27#1, main_#t~mem28#1, main_#t~mem29#1, main_#t~mem30#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~malloc31#1.base, main_#t~malloc31#1.offset, main_#t~mem32#1.base, main_#t~mem32#1.offset, main_#t~mem33#1.base, main_#t~mem33#1.offset, main_#t~memset~res34#1.base, main_#t~memset~res34#1.offset, main_#t~mem35#1.base, main_#t~mem35#1.offset, main_#t~mem36#1.base, main_#t~mem36#1.offset, main_#t~mem37#1.base, main_#t~mem37#1.offset, main_#t~mem38#1.base, main_#t~mem38#1.offset, main_#t~mem39#1.base, main_#t~mem39#1.offset, main_#t~malloc40#1.base, main_#t~malloc40#1.offset, main_#t~mem41#1.base, main_#t~mem41#1.offset, main_#t~mem42#1.base, main_#t~mem42#1.offset, main_#t~mem43#1.base, main_#t~mem43#1.offset, main_#t~mem44#1.base, main_#t~mem44#1.offset, main_#t~mem45#1.base, main_#t~mem45#1.offset, main_#t~mem46#1.base, main_#t~mem46#1.offset, main_#t~memset~res47#1.base, main_#t~memset~res47#1.offset, main_#t~mem48#1.base, main_#t~mem48#1.offset, main_#t~mem49#1.base, main_#t~mem49#1.offset, main_#t~mem50#1.base, main_#t~mem50#1.offset, main_#t~mem51#1.base, main_#t~mem51#1.offset, main_#t~mem52#1, main_#t~mem53#1.base, main_#t~mem53#1.offset, main_#t~mem54#1.base, main_#t~mem54#1.offset, main_#t~mem55#1.base, main_#t~mem55#1.offset, main_#t~mem56#1.base, main_#t~mem56#1.offset, main_#t~mem57#1, main_#t~post58#1, main_#t~mem59#1.base, main_#t~mem59#1.offset, main_#t~mem60#1, main_#t~mem61#1.base, main_#t~mem61#1.offset, main_#t~mem62#1.base, main_#t~mem62#1.offset, main_#t~mem63#1, main_#t~post64#1, main_#t~mem65#1.base, main_#t~mem65#1.offset, main_#t~mem66#1.base, main_#t~mem66#1.offset, main_#t~mem67#1.base, main_#t~mem67#1.offset, main_#t~mem69#1, main_#t~mem68#1, main_#t~mem70#1.base, main_#t~mem70#1.offset, main_#t~mem71#1, main_#t~short72#1, main_#t~mem73#1.base, main_#t~mem73#1.offset, main_#t~mem74#1, main_#t~malloc75#1.base, main_#t~malloc75#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~mem79#1, main_#t~memset~res80#1.base, main_#t~memset~res80#1.offset, main_#t~mem81#1.base, main_#t~mem81#1.offset, main_#t~mem82#1.base, main_#t~mem82#1.offset, main_#t~mem85#1, main_#t~mem83#1.base, main_#t~mem83#1.offset, main_#t~mem84#1, main_#t~mem86#1.base, main_#t~mem86#1.offset, main_#t~mem89#1, main_#t~mem87#1.base, main_#t~mem87#1.offset, main_#t~mem88#1, main_#t~ite90#1, main_#t~mem91#1.base, main_#t~mem91#1.offset, main_#t~mem95#1.base, main_#t~mem95#1.offset, main_#t~mem96#1.base, main_#t~mem96#1.offset, main_#t~mem97#1.base, main_#t~mem97#1.offset, main_#t~mem98#1.base, main_#t~mem98#1.offset, main_#t~mem101#1, main_#t~mem99#1.base, main_#t~mem99#1.offset, main_#t~mem100#1, main_#t~mem102#1.base, main_#t~mem102#1.offset, main_#t~mem103#1, main_#t~pre104#1, main_#t~mem105#1.base, main_#t~mem105#1.offset, main_#t~mem106#1, main_#t~mem107#1.base, main_#t~mem107#1.offset, main_#t~mem108#1, main_#t~post109#1, main_#t~mem113#1, main_#t~mem111#1, main_#t~mem110#1.base, main_#t~mem110#1.offset, main_#t~mem112#1, main_#t~mem114#1, main_#t~post115#1, main_#t~mem116#1.base, main_#t~mem116#1.offset, main_#t~mem117#1.base, main_#t~mem117#1.offset, main_#t~mem118#1.base, main_#t~mem118#1.offset, main_#t~post92#1, main_#t~mem93#1.base, main_#t~mem93#1.offset, main_#t~mem94#1, main_#t~mem119#1.base, main_#t~mem119#1.offset, main_#t~mem120#1.base, main_#t~mem120#1.offset, main_#t~mem121#1.base, main_#t~mem121#1.offset, main_#t~mem122#1, main_#t~mem123#1.base, main_#t~mem123#1.offset, main_#t~mem124#1, main_#t~post125#1, main_#t~mem126#1.base, main_#t~mem126#1.offset, main_#t~mem127#1.base, main_#t~mem127#1.offset, main_#t~mem128#1.base, main_#t~mem128#1.offset, main_#t~mem129#1.base, main_#t~mem129#1.offset, main_#t~mem132#1, main_#t~mem130#1.base, main_#t~mem130#1.offset, main_#t~mem131#1, main_#t~ite135#1, main_#t~mem133#1.base, main_#t~mem133#1.offset, main_#t~mem134#1, main_#t~mem136#1.base, main_#t~mem136#1.offset, main_#t~mem137#1, main_#t~mem138#1.base, main_#t~mem138#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~post5#1, main_#t~mem140#1, main_#t~mem141#1, main_#t~mem139#1.base, main_#t~mem139#1.offset, main_~i~0#1, main_~user~0#1.base, main_~user~0#1.offset, main_~users~0#1.base, main_~users~0#1.offset;havoc main_~i~0#1;havoc main_~user~0#1.base, main_~user~0#1.offset;main_~users~0#1.base, main_~users~0#1.offset := 0, 0;main_~i~0#1 := 0; {13935#true} is VALID [2022-02-21 03:13:48,837 INFO L290 TraceCheckUtils]: 0: Hoare triple {13935#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);~count_int_int~0 := 0; {13935#true} is VALID [2022-02-21 03:13:48,838 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 4 proven. 27 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-02-21 03:13:48,838 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 03:13:48,838 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1465793128] [2022-02-21 03:13:48,838 WARN L317 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-02-21 03:13:48,838 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [634798197] [2022-02-21 03:13:48,838 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [634798197] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-21 03:13:48,838 INFO L191 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-02-21 03:13:48,838 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8] total 15 [2022-02-21 03:13:48,839 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1192756375] [2022-02-21 03:13:48,839 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-02-21 03:13:48,839 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 6.0) internal successors, (90), 15 states have internal predecessors, (90), 2 states have call successors, (3), 2 states have call predecessors, (3), 4 states have return successors, (4), 1 states have call predecessors, (4), 2 states have call successors, (4) Word has length 82 [2022-02-21 03:13:48,840 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-21 03:13:48,840 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 15 states, 15 states have (on average 6.0) internal successors, (90), 15 states have internal predecessors, (90), 2 states have call successors, (3), 2 states have call predecessors, (3), 4 states have return successors, (4), 1 states have call predecessors, (4), 2 states have call successors, (4) [2022-02-21 03:13:48,913 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 97 edges. 97 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:13:48,913 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-02-21 03:13:48,913 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 03:13:48,914 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-02-21 03:13:48,914 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=147, Unknown=0, NotChecked=0, Total=210 [2022-02-21 03:13:48,914 INFO L87 Difference]: Start difference. First operand 343 states and 431 transitions. Second operand has 15 states, 15 states have (on average 6.0) internal successors, (90), 15 states have internal predecessors, (90), 2 states have call successors, (3), 2 states have call predecessors, (3), 4 states have return successors, (4), 1 states have call predecessors, (4), 2 states have call successors, (4) [2022-02-21 03:13:51,044 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:13:51,045 INFO L93 Difference]: Finished difference Result 688 states and 894 transitions. [2022-02-21 03:13:51,045 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2022-02-21 03:13:51,045 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 6.0) internal successors, (90), 15 states have internal predecessors, (90), 2 states have call successors, (3), 2 states have call predecessors, (3), 4 states have return successors, (4), 1 states have call predecessors, (4), 2 states have call successors, (4) Word has length 82 [2022-02-21 03:13:51,045 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-21 03:13:51,045 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 15 states have (on average 6.0) internal successors, (90), 15 states have internal predecessors, (90), 2 states have call successors, (3), 2 states have call predecessors, (3), 4 states have return successors, (4), 1 states have call predecessors, (4), 2 states have call successors, (4) [2022-02-21 03:13:51,048 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 396 transitions. [2022-02-21 03:13:51,048 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 15 states have (on average 6.0) internal successors, (90), 15 states have internal predecessors, (90), 2 states have call successors, (3), 2 states have call predecessors, (3), 4 states have return successors, (4), 1 states have call predecessors, (4), 2 states have call successors, (4) [2022-02-21 03:13:51,050 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 396 transitions. [2022-02-21 03:13:51,050 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 24 states and 396 transitions. [2022-02-21 03:13:51,381 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 396 edges. 396 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:13:51,387 INFO L225 Difference]: With dead ends: 688 [2022-02-21 03:13:51,387 INFO L226 Difference]: Without dead ends: 351 [2022-02-21 03:13:51,388 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 176 GetRequests, 149 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 89 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=259, Invalid=553, Unknown=0, NotChecked=0, Total=812 [2022-02-21 03:13:51,388 INFO L933 BasicCegarLoop]: 165 mSDtfsCounter, 198 mSDsluCounter, 844 mSDsCounter, 0 mSdLazyCounter, 268 mSolverCounterSat, 40 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 216 SdHoareTripleChecker+Valid, 1009 SdHoareTripleChecker+Invalid, 308 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 40 IncrementalHoareTripleChecker+Valid, 268 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-02-21 03:13:51,389 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [216 Valid, 1009 Invalid, 308 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [40 Valid, 268 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-02-21 03:13:51,390 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 351 states. [2022-02-21 03:13:51,477 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 351 to 343. [2022-02-21 03:13:51,477 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 03:13:51,477 INFO L82 GeneralOperation]: Start isEquivalent. First operand 351 states. Second operand has 343 states, 316 states have (on average 1.2341772151898733) internal successors, (390), 330 states have internal predecessors, (390), 19 states have call successors, (19), 3 states have call predecessors, (19), 4 states have return successors, (22), 10 states have call predecessors, (22), 19 states have call successors, (22) [2022-02-21 03:13:51,478 INFO L74 IsIncluded]: Start isIncluded. First operand 351 states. Second operand has 343 states, 316 states have (on average 1.2341772151898733) internal successors, (390), 330 states have internal predecessors, (390), 19 states have call successors, (19), 3 states have call predecessors, (19), 4 states have return successors, (22), 10 states have call predecessors, (22), 19 states have call successors, (22) [2022-02-21 03:13:51,478 INFO L87 Difference]: Start difference. First operand 351 states. Second operand has 343 states, 316 states have (on average 1.2341772151898733) internal successors, (390), 330 states have internal predecessors, (390), 19 states have call successors, (19), 3 states have call predecessors, (19), 4 states have return successors, (22), 10 states have call predecessors, (22), 19 states have call successors, (22) [2022-02-21 03:13:51,484 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:13:51,484 INFO L93 Difference]: Finished difference Result 351 states and 447 transitions. [2022-02-21 03:13:51,485 INFO L276 IsEmpty]: Start isEmpty. Operand 351 states and 447 transitions. [2022-02-21 03:13:51,485 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:13:51,485 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:13:51,486 INFO L74 IsIncluded]: Start isIncluded. First operand has 343 states, 316 states have (on average 1.2341772151898733) internal successors, (390), 330 states have internal predecessors, (390), 19 states have call successors, (19), 3 states have call predecessors, (19), 4 states have return successors, (22), 10 states have call predecessors, (22), 19 states have call successors, (22) Second operand 351 states. [2022-02-21 03:13:51,486 INFO L87 Difference]: Start difference. First operand has 343 states, 316 states have (on average 1.2341772151898733) internal successors, (390), 330 states have internal predecessors, (390), 19 states have call successors, (19), 3 states have call predecessors, (19), 4 states have return successors, (22), 10 states have call predecessors, (22), 19 states have call successors, (22) Second operand 351 states. [2022-02-21 03:13:51,492 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:13:51,492 INFO L93 Difference]: Finished difference Result 351 states and 447 transitions. [2022-02-21 03:13:51,492 INFO L276 IsEmpty]: Start isEmpty. Operand 351 states and 447 transitions. [2022-02-21 03:13:51,493 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:13:51,493 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:13:51,493 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 03:13:51,493 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 03:13:51,493 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 343 states, 316 states have (on average 1.2341772151898733) internal successors, (390), 330 states have internal predecessors, (390), 19 states have call successors, (19), 3 states have call predecessors, (19), 4 states have return successors, (22), 10 states have call predecessors, (22), 19 states have call successors, (22) [2022-02-21 03:13:51,499 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 343 states to 343 states and 431 transitions. [2022-02-21 03:13:51,499 INFO L78 Accepts]: Start accepts. Automaton has 343 states and 431 transitions. Word has length 82 [2022-02-21 03:13:51,499 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-21 03:13:51,499 INFO L470 AbstractCegarLoop]: Abstraction has 343 states and 431 transitions. [2022-02-21 03:13:51,499 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 6.0) internal successors, (90), 15 states have internal predecessors, (90), 2 states have call successors, (3), 2 states have call predecessors, (3), 4 states have return successors, (4), 1 states have call predecessors, (4), 2 states have call successors, (4) [2022-02-21 03:13:51,500 INFO L276 IsEmpty]: Start isEmpty. Operand 343 states and 431 transitions. [2022-02-21 03:13:51,500 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2022-02-21 03:13:51,500 INFO L506 BasicCegarLoop]: Found error trace [2022-02-21 03:13:51,500 INFO L514 BasicCegarLoop]: trace histogram [15, 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] [2022-02-21 03:13:51,525 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:13:51,715 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2022-02-21 03:13:51,715 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2022-02-21 03:13:51,716 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:13:51,716 INFO L85 PathProgramCache]: Analyzing trace with hash -1367817495, now seen corresponding path program 3 times [2022-02-21 03:13:51,716 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:13:51,716 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1568520343] [2022-02-21 03:13:51,716 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:13:51,716 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:13:51,777 ERROR L252 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-02-21 03:13:51,778 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [457383769] [2022-02-21 03:13:51,778 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-02-21 03:13:51,778 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-21 03:13:51,778 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:13:51,779 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:13:51,811 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:13:54,139 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2022-02-21 03:13:54,140 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-02-21 03:13:54,146 INFO L263 TraceCheckSpWp]: Trace formula consists of 375 conjuncts, 5 conjunts are in the unsatisfiable core [2022-02-21 03:13:54,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:13:54,178 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 03:13:54,455 INFO L290 TraceCheckUtils]: 0: Hoare triple {16429#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);~count_int_int~0 := 0; {16429#true} is VALID [2022-02-21 03:13:54,456 INFO L290 TraceCheckUtils]: 1: Hoare triple {16429#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc6#1.base, main_#t~malloc6#1.offset, main_#t~mem8#1, main_#t~mem7#1, main_#t~mem9#1, main_#t~mem10#1, main_#t~mem12#1, main_#t~mem11#1, main_#t~mem13#1, main_#t~mem14#1, main_#t~mem16#1, main_#t~mem15#1, main_#t~mem17#1, main_#t~mem18#1, main_#t~switch19#1, main_#t~mem20#1, main_#t~mem21#1, main_#t~mem22#1, main_#t~mem23#1, main_#t~mem24#1, main_#t~mem25#1, main_#t~mem26#1, main_#t~mem27#1, main_#t~mem28#1, main_#t~mem29#1, main_#t~mem30#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~malloc31#1.base, main_#t~malloc31#1.offset, main_#t~mem32#1.base, main_#t~mem32#1.offset, main_#t~mem33#1.base, main_#t~mem33#1.offset, main_#t~memset~res34#1.base, main_#t~memset~res34#1.offset, main_#t~mem35#1.base, main_#t~mem35#1.offset, main_#t~mem36#1.base, main_#t~mem36#1.offset, main_#t~mem37#1.base, main_#t~mem37#1.offset, main_#t~mem38#1.base, main_#t~mem38#1.offset, main_#t~mem39#1.base, main_#t~mem39#1.offset, main_#t~malloc40#1.base, main_#t~malloc40#1.offset, main_#t~mem41#1.base, main_#t~mem41#1.offset, main_#t~mem42#1.base, main_#t~mem42#1.offset, main_#t~mem43#1.base, main_#t~mem43#1.offset, main_#t~mem44#1.base, main_#t~mem44#1.offset, main_#t~mem45#1.base, main_#t~mem45#1.offset, main_#t~mem46#1.base, main_#t~mem46#1.offset, main_#t~memset~res47#1.base, main_#t~memset~res47#1.offset, main_#t~mem48#1.base, main_#t~mem48#1.offset, main_#t~mem49#1.base, main_#t~mem49#1.offset, main_#t~mem50#1.base, main_#t~mem50#1.offset, main_#t~mem51#1.base, main_#t~mem51#1.offset, main_#t~mem52#1, main_#t~mem53#1.base, main_#t~mem53#1.offset, main_#t~mem54#1.base, main_#t~mem54#1.offset, main_#t~mem55#1.base, main_#t~mem55#1.offset, main_#t~mem56#1.base, main_#t~mem56#1.offset, main_#t~mem57#1, main_#t~post58#1, main_#t~mem59#1.base, main_#t~mem59#1.offset, main_#t~mem60#1, main_#t~mem61#1.base, main_#t~mem61#1.offset, main_#t~mem62#1.base, main_#t~mem62#1.offset, main_#t~mem63#1, main_#t~post64#1, main_#t~mem65#1.base, main_#t~mem65#1.offset, main_#t~mem66#1.base, main_#t~mem66#1.offset, main_#t~mem67#1.base, main_#t~mem67#1.offset, main_#t~mem69#1, main_#t~mem68#1, main_#t~mem70#1.base, main_#t~mem70#1.offset, main_#t~mem71#1, main_#t~short72#1, main_#t~mem73#1.base, main_#t~mem73#1.offset, main_#t~mem74#1, main_#t~malloc75#1.base, main_#t~malloc75#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~mem79#1, main_#t~memset~res80#1.base, main_#t~memset~res80#1.offset, main_#t~mem81#1.base, main_#t~mem81#1.offset, main_#t~mem82#1.base, main_#t~mem82#1.offset, main_#t~mem85#1, main_#t~mem83#1.base, main_#t~mem83#1.offset, main_#t~mem84#1, main_#t~mem86#1.base, main_#t~mem86#1.offset, main_#t~mem89#1, main_#t~mem87#1.base, main_#t~mem87#1.offset, main_#t~mem88#1, main_#t~ite90#1, main_#t~mem91#1.base, main_#t~mem91#1.offset, main_#t~mem95#1.base, main_#t~mem95#1.offset, main_#t~mem96#1.base, main_#t~mem96#1.offset, main_#t~mem97#1.base, main_#t~mem97#1.offset, main_#t~mem98#1.base, main_#t~mem98#1.offset, main_#t~mem101#1, main_#t~mem99#1.base, main_#t~mem99#1.offset, main_#t~mem100#1, main_#t~mem102#1.base, main_#t~mem102#1.offset, main_#t~mem103#1, main_#t~pre104#1, main_#t~mem105#1.base, main_#t~mem105#1.offset, main_#t~mem106#1, main_#t~mem107#1.base, main_#t~mem107#1.offset, main_#t~mem108#1, main_#t~post109#1, main_#t~mem113#1, main_#t~mem111#1, main_#t~mem110#1.base, main_#t~mem110#1.offset, main_#t~mem112#1, main_#t~mem114#1, main_#t~post115#1, main_#t~mem116#1.base, main_#t~mem116#1.offset, main_#t~mem117#1.base, main_#t~mem117#1.offset, main_#t~mem118#1.base, main_#t~mem118#1.offset, main_#t~post92#1, main_#t~mem93#1.base, main_#t~mem93#1.offset, main_#t~mem94#1, main_#t~mem119#1.base, main_#t~mem119#1.offset, main_#t~mem120#1.base, main_#t~mem120#1.offset, main_#t~mem121#1.base, main_#t~mem121#1.offset, main_#t~mem122#1, main_#t~mem123#1.base, main_#t~mem123#1.offset, main_#t~mem124#1, main_#t~post125#1, main_#t~mem126#1.base, main_#t~mem126#1.offset, main_#t~mem127#1.base, main_#t~mem127#1.offset, main_#t~mem128#1.base, main_#t~mem128#1.offset, main_#t~mem129#1.base, main_#t~mem129#1.offset, main_#t~mem132#1, main_#t~mem130#1.base, main_#t~mem130#1.offset, main_#t~mem131#1, main_#t~ite135#1, main_#t~mem133#1.base, main_#t~mem133#1.offset, main_#t~mem134#1, main_#t~mem136#1.base, main_#t~mem136#1.offset, main_#t~mem137#1, main_#t~mem138#1.base, main_#t~mem138#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~post5#1, main_#t~mem140#1, main_#t~mem141#1, main_#t~mem139#1.base, main_#t~mem139#1.offset, main_~i~0#1, main_~user~0#1.base, main_~user~0#1.offset, main_~users~0#1.base, main_~users~0#1.offset;havoc main_~i~0#1;havoc main_~user~0#1.base, main_~user~0#1.offset;main_~users~0#1.base, main_~users~0#1.offset := 0, 0;main_~i~0#1 := 0; {16437#(<= 0 |ULTIMATE.start_main_~i~0#1|)} is VALID [2022-02-21 03:13:54,456 INFO L290 TraceCheckUtils]: 2: Hoare triple {16437#(<= 0 |ULTIMATE.start_main_~i~0#1|)} assume !!(main_~i~0#1 < 10);call main_#t~malloc6#1.base, main_#t~malloc6#1.offset := #Ultimate.allocOnHeap(40);main_~user~0#1.base, main_~user~0#1.offset := main_#t~malloc6#1.base, main_#t~malloc6#1.offset;havoc main_#t~malloc6#1.base, main_#t~malloc6#1.offset; {16437#(<= 0 |ULTIMATE.start_main_~i~0#1|)} is VALID [2022-02-21 03:13:54,457 INFO L290 TraceCheckUtils]: 3: Hoare triple {16437#(<= 0 |ULTIMATE.start_main_~i~0#1|)} assume !(main_~user~0#1.base == 0 && main_~user~0#1.offset == 0); {16437#(<= 0 |ULTIMATE.start_main_~i~0#1|)} is VALID [2022-02-21 03:13:54,457 INFO L290 TraceCheckUtils]: 4: Hoare triple {16437#(<= 0 |ULTIMATE.start_main_~i~0#1|)} call write~int(main_~i~0#1, main_~user~0#1.base, main_~user~0#1.offset, 4); {16437#(<= 0 |ULTIMATE.start_main_~i~0#1|)} is VALID [2022-02-21 03:13:54,457 INFO L290 TraceCheckUtils]: 5: Hoare triple {16437#(<= 0 |ULTIMATE.start_main_~i~0#1|)} assume main_~i~0#1 * main_~i~0#1 <= 2147483647; {16437#(<= 0 |ULTIMATE.start_main_~i~0#1|)} is VALID [2022-02-21 03:13:54,457 INFO L290 TraceCheckUtils]: 6: Hoare triple {16437#(<= 0 |ULTIMATE.start_main_~i~0#1|)} assume main_~i~0#1 * main_~i~0#1 >= -2147483648;call write~int(main_~i~0#1 * main_~i~0#1, main_~user~0#1.base, 4 + main_~user~0#1.offset, 4); {16437#(<= 0 |ULTIMATE.start_main_~i~0#1|)} is VALID [2022-02-21 03:13:54,458 INFO L290 TraceCheckUtils]: 7: Hoare triple {16437#(<= 0 |ULTIMATE.start_main_~i~0#1|)} havoc main_~_ha_hashv~0#1; {16437#(<= 0 |ULTIMATE.start_main_~i~0#1|)} is VALID [2022-02-21 03:13:54,458 INFO L290 TraceCheckUtils]: 8: Hoare triple {16437#(<= 0 |ULTIMATE.start_main_~i~0#1|)} goto; {16437#(<= 0 |ULTIMATE.start_main_~i~0#1|)} is VALID [2022-02-21 03:13:54,458 INFO L290 TraceCheckUtils]: 9: Hoare triple {16437#(<= 0 |ULTIMATE.start_main_~i~0#1|)} 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; {16437#(<= 0 |ULTIMATE.start_main_~i~0#1|)} is VALID [2022-02-21 03:13:54,458 INFO L290 TraceCheckUtils]: 10: Hoare triple {16437#(<= 0 |ULTIMATE.start_main_~i~0#1|)} assume !(main_~_hj_k~0#1 % 4294967296 >= 12); {16437#(<= 0 |ULTIMATE.start_main_~i~0#1|)} is VALID [2022-02-21 03:13:54,459 INFO L290 TraceCheckUtils]: 11: Hoare triple {16437#(<= 0 |ULTIMATE.start_main_~i~0#1|)} main_~_ha_hashv~0#1 := 4 + main_~_ha_hashv~0#1;main_#t~switch19#1 := 11 == main_~_hj_k~0#1; {16437#(<= 0 |ULTIMATE.start_main_~i~0#1|)} is VALID [2022-02-21 03:13:54,459 INFO L290 TraceCheckUtils]: 12: Hoare triple {16437#(<= 0 |ULTIMATE.start_main_~i~0#1|)} assume !main_#t~switch19#1; {16437#(<= 0 |ULTIMATE.start_main_~i~0#1|)} is VALID [2022-02-21 03:13:54,459 INFO L290 TraceCheckUtils]: 13: Hoare triple {16437#(<= 0 |ULTIMATE.start_main_~i~0#1|)} main_#t~switch19#1 := main_#t~switch19#1 || 10 == main_~_hj_k~0#1; {16437#(<= 0 |ULTIMATE.start_main_~i~0#1|)} is VALID [2022-02-21 03:13:54,459 INFO L290 TraceCheckUtils]: 14: Hoare triple {16437#(<= 0 |ULTIMATE.start_main_~i~0#1|)} assume !main_#t~switch19#1; {16437#(<= 0 |ULTIMATE.start_main_~i~0#1|)} is VALID [2022-02-21 03:13:54,460 INFO L290 TraceCheckUtils]: 15: Hoare triple {16437#(<= 0 |ULTIMATE.start_main_~i~0#1|)} main_#t~switch19#1 := main_#t~switch19#1 || 9 == main_~_hj_k~0#1; {16437#(<= 0 |ULTIMATE.start_main_~i~0#1|)} is VALID [2022-02-21 03:13:54,460 INFO L290 TraceCheckUtils]: 16: Hoare triple {16437#(<= 0 |ULTIMATE.start_main_~i~0#1|)} assume !main_#t~switch19#1; {16437#(<= 0 |ULTIMATE.start_main_~i~0#1|)} is VALID [2022-02-21 03:13:54,460 INFO L290 TraceCheckUtils]: 17: Hoare triple {16437#(<= 0 |ULTIMATE.start_main_~i~0#1|)} main_#t~switch19#1 := main_#t~switch19#1 || 8 == main_~_hj_k~0#1; {16437#(<= 0 |ULTIMATE.start_main_~i~0#1|)} is VALID [2022-02-21 03:13:54,460 INFO L290 TraceCheckUtils]: 18: Hoare triple {16437#(<= 0 |ULTIMATE.start_main_~i~0#1|)} assume !main_#t~switch19#1; {16437#(<= 0 |ULTIMATE.start_main_~i~0#1|)} is VALID [2022-02-21 03:13:54,461 INFO L290 TraceCheckUtils]: 19: Hoare triple {16437#(<= 0 |ULTIMATE.start_main_~i~0#1|)} main_#t~switch19#1 := main_#t~switch19#1 || 7 == main_~_hj_k~0#1; {16437#(<= 0 |ULTIMATE.start_main_~i~0#1|)} is VALID [2022-02-21 03:13:54,461 INFO L290 TraceCheckUtils]: 20: Hoare triple {16437#(<= 0 |ULTIMATE.start_main_~i~0#1|)} assume !main_#t~switch19#1; {16437#(<= 0 |ULTIMATE.start_main_~i~0#1|)} is VALID [2022-02-21 03:13:54,461 INFO L290 TraceCheckUtils]: 21: Hoare triple {16437#(<= 0 |ULTIMATE.start_main_~i~0#1|)} main_#t~switch19#1 := main_#t~switch19#1 || 6 == main_~_hj_k~0#1; {16437#(<= 0 |ULTIMATE.start_main_~i~0#1|)} is VALID [2022-02-21 03:13:54,461 INFO L290 TraceCheckUtils]: 22: Hoare triple {16437#(<= 0 |ULTIMATE.start_main_~i~0#1|)} assume !main_#t~switch19#1; {16437#(<= 0 |ULTIMATE.start_main_~i~0#1|)} is VALID [2022-02-21 03:13:54,461 INFO L290 TraceCheckUtils]: 23: Hoare triple {16437#(<= 0 |ULTIMATE.start_main_~i~0#1|)} main_#t~switch19#1 := main_#t~switch19#1 || 5 == main_~_hj_k~0#1; {16437#(<= 0 |ULTIMATE.start_main_~i~0#1|)} is VALID [2022-02-21 03:13:54,462 INFO L290 TraceCheckUtils]: 24: Hoare triple {16437#(<= 0 |ULTIMATE.start_main_~i~0#1|)} assume !main_#t~switch19#1; {16437#(<= 0 |ULTIMATE.start_main_~i~0#1|)} is VALID [2022-02-21 03:13:54,462 INFO L290 TraceCheckUtils]: 25: Hoare triple {16437#(<= 0 |ULTIMATE.start_main_~i~0#1|)} main_#t~switch19#1 := main_#t~switch19#1 || 4 == main_~_hj_k~0#1; {16437#(<= 0 |ULTIMATE.start_main_~i~0#1|)} is VALID [2022-02-21 03:13:54,462 INFO L290 TraceCheckUtils]: 26: Hoare triple {16437#(<= 0 |ULTIMATE.start_main_~i~0#1|)} assume main_#t~switch19#1;call main_#t~mem27#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~mem27#1 % 256);havoc main_#t~mem27#1; {16437#(<= 0 |ULTIMATE.start_main_~i~0#1|)} is VALID [2022-02-21 03:13:54,463 INFO L290 TraceCheckUtils]: 27: Hoare triple {16437#(<= 0 |ULTIMATE.start_main_~i~0#1|)} main_#t~switch19#1 := main_#t~switch19#1 || 3 == main_~_hj_k~0#1; {16437#(<= 0 |ULTIMATE.start_main_~i~0#1|)} is VALID [2022-02-21 03:13:54,463 INFO L290 TraceCheckUtils]: 28: Hoare triple {16437#(<= 0 |ULTIMATE.start_main_~i~0#1|)} assume main_#t~switch19#1;call main_#t~mem28#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~mem28#1 % 256);havoc main_#t~mem28#1; {16437#(<= 0 |ULTIMATE.start_main_~i~0#1|)} is VALID [2022-02-21 03:13:54,463 INFO L290 TraceCheckUtils]: 29: Hoare triple {16437#(<= 0 |ULTIMATE.start_main_~i~0#1|)} main_#t~switch19#1 := main_#t~switch19#1 || 2 == main_~_hj_k~0#1; {16437#(<= 0 |ULTIMATE.start_main_~i~0#1|)} is VALID [2022-02-21 03:13:54,464 INFO L290 TraceCheckUtils]: 30: Hoare triple {16437#(<= 0 |ULTIMATE.start_main_~i~0#1|)} assume main_#t~switch19#1;call main_#t~mem29#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~mem29#1 % 256);havoc main_#t~mem29#1; {16437#(<= 0 |ULTIMATE.start_main_~i~0#1|)} is VALID [2022-02-21 03:13:54,464 INFO L290 TraceCheckUtils]: 31: Hoare triple {16437#(<= 0 |ULTIMATE.start_main_~i~0#1|)} main_#t~switch19#1 := main_#t~switch19#1 || 1 == main_~_hj_k~0#1; {16437#(<= 0 |ULTIMATE.start_main_~i~0#1|)} is VALID [2022-02-21 03:13:54,464 INFO L290 TraceCheckUtils]: 32: Hoare triple {16437#(<= 0 |ULTIMATE.start_main_~i~0#1|)} assume main_#t~switch19#1;call main_#t~mem30#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~mem30#1 % 256;havoc main_#t~mem30#1; {16437#(<= 0 |ULTIMATE.start_main_~i~0#1|)} is VALID [2022-02-21 03:13:54,465 INFO L290 TraceCheckUtils]: 33: Hoare triple {16437#(<= 0 |ULTIMATE.start_main_~i~0#1|)} havoc main_#t~switch19#1; {16437#(<= 0 |ULTIMATE.start_main_~i~0#1|)} is VALID [2022-02-21 03:13:54,465 INFO L290 TraceCheckUtils]: 34: Hoare triple {16437#(<= 0 |ULTIMATE.start_main_~i~0#1|)} 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)))); {16437#(<= 0 |ULTIMATE.start_main_~i~0#1|)} is VALID [2022-02-21 03:13:54,465 INFO L290 TraceCheckUtils]: 35: Hoare triple {16437#(<= 0 |ULTIMATE.start_main_~i~0#1|)} goto; {16437#(<= 0 |ULTIMATE.start_main_~i~0#1|)} is VALID [2022-02-21 03:13:54,466 INFO L290 TraceCheckUtils]: 36: Hoare triple {16437#(<= 0 |ULTIMATE.start_main_~i~0#1|)} goto; {16437#(<= 0 |ULTIMATE.start_main_~i~0#1|)} is VALID [2022-02-21 03:13:54,466 INFO L290 TraceCheckUtils]: 37: Hoare triple {16437#(<= 0 |ULTIMATE.start_main_~i~0#1|)} goto; {16437#(<= 0 |ULTIMATE.start_main_~i~0#1|)} is VALID [2022-02-21 03:13:54,466 INFO L290 TraceCheckUtils]: 38: Hoare triple {16437#(<= 0 |ULTIMATE.start_main_~i~0#1|)} 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); {16437#(<= 0 |ULTIMATE.start_main_~i~0#1|)} is VALID [2022-02-21 03:13:54,467 INFO L290 TraceCheckUtils]: 39: Hoare triple {16437#(<= 0 |ULTIMATE.start_main_~i~0#1|)} 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); {16437#(<= 0 |ULTIMATE.start_main_~i~0#1|)} is VALID [2022-02-21 03:13:54,467 INFO L290 TraceCheckUtils]: 40: Hoare triple {16437#(<= 0 |ULTIMATE.start_main_~i~0#1|)} call main_#t~malloc31#1.base, main_#t~malloc31#1.offset := #Ultimate.allocOnHeap(44);call write~$Pointer$(main_#t~malloc31#1.base, main_#t~malloc31#1.offset, main_~user~0#1.base, 8 + main_~user~0#1.offset, 4);havoc main_#t~malloc31#1.base, main_#t~malloc31#1.offset;call main_#t~mem32#1.base, main_#t~mem32#1.offset := read~$Pointer$(main_~user~0#1.base, 8 + main_~user~0#1.offset, 4); {16437#(<= 0 |ULTIMATE.start_main_~i~0#1|)} is VALID [2022-02-21 03:13:54,467 INFO L290 TraceCheckUtils]: 41: Hoare triple {16437#(<= 0 |ULTIMATE.start_main_~i~0#1|)} assume !(main_#t~mem32#1.base == 0 && main_#t~mem32#1.offset == 0);havoc main_#t~mem32#1.base, main_#t~mem32#1.offset;call main_#t~mem33#1.base, main_#t~mem33#1.offset := read~$Pointer$(main_~user~0#1.base, 8 + main_~user~0#1.offset, 4); {16437#(<= 0 |ULTIMATE.start_main_~i~0#1|)} is VALID [2022-02-21 03:13:54,468 INFO L272 TraceCheckUtils]: 42: Hoare triple {16437#(<= 0 |ULTIMATE.start_main_~i~0#1|)} call main_#t~memset~res34#1.base, main_#t~memset~res34#1.offset := #Ultimate.C_memset(main_#t~mem33#1.base, main_#t~mem33#1.offset, 0, 44); {16429#true} is VALID [2022-02-21 03:13:54,468 INFO L290 TraceCheckUtils]: 43: Hoare triple {16429#true} #t~loopctr143 := 0; {16429#true} is VALID [2022-02-21 03:13:54,468 INFO L290 TraceCheckUtils]: 44: Hoare triple {16429#true} assume #t~loopctr143 % 4294967296 < #amount % 4294967296;#memory_$Pointer$.base, #memory_$Pointer$.offset := #memory_$Pointer$.base[#ptr.base,#ptr.offset + #t~loopctr143 := 0], #memory_$Pointer$.offset[#ptr.base,#ptr.offset + #t~loopctr143 := #value % 256];#memory_int := #memory_int[#ptr.base,#ptr.offset + #t~loopctr143 := #value];#t~loopctr143 := 1 + #t~loopctr143; {16429#true} is VALID [2022-02-21 03:13:54,468 INFO L290 TraceCheckUtils]: 45: Hoare triple {16429#true} assume #t~loopctr143 % 4294967296 < #amount % 4294967296;#memory_$Pointer$.base, #memory_$Pointer$.offset := #memory_$Pointer$.base[#ptr.base,#ptr.offset + #t~loopctr143 := 0], #memory_$Pointer$.offset[#ptr.base,#ptr.offset + #t~loopctr143 := #value % 256];#memory_int := #memory_int[#ptr.base,#ptr.offset + #t~loopctr143 := #value];#t~loopctr143 := 1 + #t~loopctr143; {16429#true} is VALID [2022-02-21 03:13:54,468 INFO L290 TraceCheckUtils]: 46: Hoare triple {16429#true} assume #t~loopctr143 % 4294967296 < #amount % 4294967296;#memory_$Pointer$.base, #memory_$Pointer$.offset := #memory_$Pointer$.base[#ptr.base,#ptr.offset + #t~loopctr143 := 0], #memory_$Pointer$.offset[#ptr.base,#ptr.offset + #t~loopctr143 := #value % 256];#memory_int := #memory_int[#ptr.base,#ptr.offset + #t~loopctr143 := #value];#t~loopctr143 := 1 + #t~loopctr143; {16429#true} is VALID [2022-02-21 03:13:54,468 INFO L290 TraceCheckUtils]: 47: Hoare triple {16429#true} assume #t~loopctr143 % 4294967296 < #amount % 4294967296;#memory_$Pointer$.base, #memory_$Pointer$.offset := #memory_$Pointer$.base[#ptr.base,#ptr.offset + #t~loopctr143 := 0], #memory_$Pointer$.offset[#ptr.base,#ptr.offset + #t~loopctr143 := #value % 256];#memory_int := #memory_int[#ptr.base,#ptr.offset + #t~loopctr143 := #value];#t~loopctr143 := 1 + #t~loopctr143; {16429#true} is VALID [2022-02-21 03:13:54,468 INFO L290 TraceCheckUtils]: 48: Hoare triple {16429#true} assume #t~loopctr143 % 4294967296 < #amount % 4294967296;#memory_$Pointer$.base, #memory_$Pointer$.offset := #memory_$Pointer$.base[#ptr.base,#ptr.offset + #t~loopctr143 := 0], #memory_$Pointer$.offset[#ptr.base,#ptr.offset + #t~loopctr143 := #value % 256];#memory_int := #memory_int[#ptr.base,#ptr.offset + #t~loopctr143 := #value];#t~loopctr143 := 1 + #t~loopctr143; {16429#true} is VALID [2022-02-21 03:13:54,468 INFO L290 TraceCheckUtils]: 49: Hoare triple {16429#true} assume #t~loopctr143 % 4294967296 < #amount % 4294967296;#memory_$Pointer$.base, #memory_$Pointer$.offset := #memory_$Pointer$.base[#ptr.base,#ptr.offset + #t~loopctr143 := 0], #memory_$Pointer$.offset[#ptr.base,#ptr.offset + #t~loopctr143 := #value % 256];#memory_int := #memory_int[#ptr.base,#ptr.offset + #t~loopctr143 := #value];#t~loopctr143 := 1 + #t~loopctr143; {16429#true} is VALID [2022-02-21 03:13:54,468 INFO L290 TraceCheckUtils]: 50: Hoare triple {16429#true} assume #t~loopctr143 % 4294967296 < #amount % 4294967296;#memory_$Pointer$.base, #memory_$Pointer$.offset := #memory_$Pointer$.base[#ptr.base,#ptr.offset + #t~loopctr143 := 0], #memory_$Pointer$.offset[#ptr.base,#ptr.offset + #t~loopctr143 := #value % 256];#memory_int := #memory_int[#ptr.base,#ptr.offset + #t~loopctr143 := #value];#t~loopctr143 := 1 + #t~loopctr143; {16429#true} is VALID [2022-02-21 03:13:54,468 INFO L290 TraceCheckUtils]: 51: Hoare triple {16429#true} assume #t~loopctr143 % 4294967296 < #amount % 4294967296;#memory_$Pointer$.base, #memory_$Pointer$.offset := #memory_$Pointer$.base[#ptr.base,#ptr.offset + #t~loopctr143 := 0], #memory_$Pointer$.offset[#ptr.base,#ptr.offset + #t~loopctr143 := #value % 256];#memory_int := #memory_int[#ptr.base,#ptr.offset + #t~loopctr143 := #value];#t~loopctr143 := 1 + #t~loopctr143; {16429#true} is VALID [2022-02-21 03:13:54,469 INFO L290 TraceCheckUtils]: 52: Hoare triple {16429#true} assume #t~loopctr143 % 4294967296 < #amount % 4294967296;#memory_$Pointer$.base, #memory_$Pointer$.offset := #memory_$Pointer$.base[#ptr.base,#ptr.offset + #t~loopctr143 := 0], #memory_$Pointer$.offset[#ptr.base,#ptr.offset + #t~loopctr143 := #value % 256];#memory_int := #memory_int[#ptr.base,#ptr.offset + #t~loopctr143 := #value];#t~loopctr143 := 1 + #t~loopctr143; {16429#true} is VALID [2022-02-21 03:13:54,469 INFO L290 TraceCheckUtils]: 53: Hoare triple {16429#true} assume #t~loopctr143 % 4294967296 < #amount % 4294967296;#memory_$Pointer$.base, #memory_$Pointer$.offset := #memory_$Pointer$.base[#ptr.base,#ptr.offset + #t~loopctr143 := 0], #memory_$Pointer$.offset[#ptr.base,#ptr.offset + #t~loopctr143 := #value % 256];#memory_int := #memory_int[#ptr.base,#ptr.offset + #t~loopctr143 := #value];#t~loopctr143 := 1 + #t~loopctr143; {16429#true} is VALID [2022-02-21 03:13:54,469 INFO L290 TraceCheckUtils]: 54: Hoare triple {16429#true} assume !(#t~loopctr143 % 4294967296 < #amount % 4294967296); {16429#true} is VALID [2022-02-21 03:13:54,469 INFO L290 TraceCheckUtils]: 55: Hoare triple {16429#true} assume #res.base == #ptr.base && #res.offset == #ptr.offset; {16429#true} is VALID [2022-02-21 03:13:54,470 INFO L284 TraceCheckUtils]: 56: Hoare quadruple {16429#true} {16437#(<= 0 |ULTIMATE.start_main_~i~0#1|)} #484#return; {16437#(<= 0 |ULTIMATE.start_main_~i~0#1|)} is VALID [2022-02-21 03:13:54,470 INFO L290 TraceCheckUtils]: 57: Hoare triple {16437#(<= 0 |ULTIMATE.start_main_~i~0#1|)} havoc main_#t~mem33#1.base, main_#t~mem33#1.offset;havoc main_#t~memset~res34#1.base, main_#t~memset~res34#1.offset;call main_#t~mem35#1.base, main_#t~mem35#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~mem35#1.base, 16 + main_#t~mem35#1.offset, 4);havoc main_#t~mem35#1.base, main_#t~mem35#1.offset;call main_#t~mem36#1.base, main_#t~mem36#1.offset := read~$Pointer$(main_~user~0#1.base, 8 + main_~user~0#1.offset, 4);call write~int(32, main_#t~mem36#1.base, 4 + main_#t~mem36#1.offset, 4);havoc main_#t~mem36#1.base, main_#t~mem36#1.offset;call main_#t~mem37#1.base, main_#t~mem37#1.offset := read~$Pointer$(main_~user~0#1.base, 8 + main_~user~0#1.offset, 4);call write~int(5, main_#t~mem37#1.base, 8 + main_#t~mem37#1.offset, 4);havoc main_#t~mem37#1.base, main_#t~mem37#1.offset;call main_#t~mem38#1.base, main_#t~mem38#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~mem38#1.base, 20 + main_#t~mem38#1.offset, 4);havoc main_#t~mem38#1.base, main_#t~mem38#1.offset;call main_#t~mem39#1.base, main_#t~mem39#1.offset := read~$Pointer$(main_~user~0#1.base, 8 + main_~user~0#1.offset, 4);call main_#t~malloc40#1.base, main_#t~malloc40#1.offset := #Ultimate.allocOnHeap(384);call write~$Pointer$(main_#t~malloc40#1.base, main_#t~malloc40#1.offset, main_#t~mem39#1.base, main_#t~mem39#1.offset, 4);havoc main_#t~mem39#1.base, main_#t~mem39#1.offset;havoc main_#t~malloc40#1.base, main_#t~malloc40#1.offset;call main_#t~mem41#1.base, main_#t~mem41#1.offset := read~$Pointer$(main_~user~0#1.base, 8 + main_~user~0#1.offset, 4);call write~int(2685476833, main_#t~mem41#1.base, 40 + main_#t~mem41#1.offset, 4);havoc main_#t~mem41#1.base, main_#t~mem41#1.offset;call main_#t~mem42#1.base, main_#t~mem42#1.offset := read~$Pointer$(main_~user~0#1.base, 8 + main_~user~0#1.offset, 4);call main_#t~mem43#1.base, main_#t~mem43#1.offset := read~$Pointer$(main_#t~mem42#1.base, main_#t~mem42#1.offset, 4); {16437#(<= 0 |ULTIMATE.start_main_~i~0#1|)} is VALID [2022-02-21 03:13:54,471 INFO L290 TraceCheckUtils]: 58: Hoare triple {16437#(<= 0 |ULTIMATE.start_main_~i~0#1|)} assume !(main_#t~mem43#1.base == 0 && main_#t~mem43#1.offset == 0);havoc main_#t~mem42#1.base, main_#t~mem42#1.offset;havoc main_#t~mem43#1.base, main_#t~mem43#1.offset;call main_#t~mem45#1.base, main_#t~mem45#1.offset := read~$Pointer$(main_~user~0#1.base, 8 + main_~user~0#1.offset, 4);call main_#t~mem46#1.base, main_#t~mem46#1.offset := read~$Pointer$(main_#t~mem45#1.base, main_#t~mem45#1.offset, 4); {16437#(<= 0 |ULTIMATE.start_main_~i~0#1|)} is VALID [2022-02-21 03:13:54,471 INFO L272 TraceCheckUtils]: 59: Hoare triple {16437#(<= 0 |ULTIMATE.start_main_~i~0#1|)} call main_#t~memset~res47#1.base, main_#t~memset~res47#1.offset := #Ultimate.C_memset(main_#t~mem46#1.base, main_#t~mem46#1.offset, 0, 384); {16429#true} is VALID [2022-02-21 03:13:54,471 INFO L290 TraceCheckUtils]: 60: Hoare triple {16429#true} #t~loopctr143 := 0; {16429#true} is VALID [2022-02-21 03:13:54,471 INFO L290 TraceCheckUtils]: 61: Hoare triple {16429#true} assume #t~loopctr143 % 4294967296 < #amount % 4294967296;#memory_$Pointer$.base, #memory_$Pointer$.offset := #memory_$Pointer$.base[#ptr.base,#ptr.offset + #t~loopctr143 := 0], #memory_$Pointer$.offset[#ptr.base,#ptr.offset + #t~loopctr143 := #value % 256];#memory_int := #memory_int[#ptr.base,#ptr.offset + #t~loopctr143 := #value];#t~loopctr143 := 1 + #t~loopctr143; {16429#true} is VALID [2022-02-21 03:13:54,471 INFO L290 TraceCheckUtils]: 62: Hoare triple {16429#true} assume #t~loopctr143 % 4294967296 < #amount % 4294967296;#memory_$Pointer$.base, #memory_$Pointer$.offset := #memory_$Pointer$.base[#ptr.base,#ptr.offset + #t~loopctr143 := 0], #memory_$Pointer$.offset[#ptr.base,#ptr.offset + #t~loopctr143 := #value % 256];#memory_int := #memory_int[#ptr.base,#ptr.offset + #t~loopctr143 := #value];#t~loopctr143 := 1 + #t~loopctr143; {16429#true} is VALID [2022-02-21 03:13:54,471 INFO L290 TraceCheckUtils]: 63: Hoare triple {16429#true} assume #t~loopctr143 % 4294967296 < #amount % 4294967296;#memory_$Pointer$.base, #memory_$Pointer$.offset := #memory_$Pointer$.base[#ptr.base,#ptr.offset + #t~loopctr143 := 0], #memory_$Pointer$.offset[#ptr.base,#ptr.offset + #t~loopctr143 := #value % 256];#memory_int := #memory_int[#ptr.base,#ptr.offset + #t~loopctr143 := #value];#t~loopctr143 := 1 + #t~loopctr143; {16429#true} is VALID [2022-02-21 03:13:54,471 INFO L290 TraceCheckUtils]: 64: Hoare triple {16429#true} assume #t~loopctr143 % 4294967296 < #amount % 4294967296;#memory_$Pointer$.base, #memory_$Pointer$.offset := #memory_$Pointer$.base[#ptr.base,#ptr.offset + #t~loopctr143 := 0], #memory_$Pointer$.offset[#ptr.base,#ptr.offset + #t~loopctr143 := #value % 256];#memory_int := #memory_int[#ptr.base,#ptr.offset + #t~loopctr143 := #value];#t~loopctr143 := 1 + #t~loopctr143; {16429#true} is VALID [2022-02-21 03:13:54,471 INFO L290 TraceCheckUtils]: 65: Hoare triple {16429#true} assume #t~loopctr143 % 4294967296 < #amount % 4294967296;#memory_$Pointer$.base, #memory_$Pointer$.offset := #memory_$Pointer$.base[#ptr.base,#ptr.offset + #t~loopctr143 := 0], #memory_$Pointer$.offset[#ptr.base,#ptr.offset + #t~loopctr143 := #value % 256];#memory_int := #memory_int[#ptr.base,#ptr.offset + #t~loopctr143 := #value];#t~loopctr143 := 1 + #t~loopctr143; {16429#true} is VALID [2022-02-21 03:13:54,471 INFO L290 TraceCheckUtils]: 66: Hoare triple {16429#true} assume !(#t~loopctr143 % 4294967296 < #amount % 4294967296); {16429#true} is VALID [2022-02-21 03:13:54,472 INFO L290 TraceCheckUtils]: 67: Hoare triple {16429#true} assume #res.base == #ptr.base && #res.offset == #ptr.offset; {16429#true} is VALID [2022-02-21 03:13:54,472 INFO L284 TraceCheckUtils]: 68: Hoare quadruple {16429#true} {16437#(<= 0 |ULTIMATE.start_main_~i~0#1|)} #486#return; {16437#(<= 0 |ULTIMATE.start_main_~i~0#1|)} is VALID [2022-02-21 03:13:54,473 INFO L290 TraceCheckUtils]: 69: Hoare triple {16437#(<= 0 |ULTIMATE.start_main_~i~0#1|)} havoc main_#t~mem45#1.base, main_#t~mem45#1.offset;havoc main_#t~mem46#1.base, main_#t~mem46#1.offset;havoc main_#t~memset~res47#1.base, main_#t~memset~res47#1.offset; {16437#(<= 0 |ULTIMATE.start_main_~i~0#1|)} is VALID [2022-02-21 03:13:54,473 INFO L290 TraceCheckUtils]: 70: Hoare triple {16437#(<= 0 |ULTIMATE.start_main_~i~0#1|)} goto; {16437#(<= 0 |ULTIMATE.start_main_~i~0#1|)} is VALID [2022-02-21 03:13:54,473 INFO L290 TraceCheckUtils]: 71: Hoare triple {16437#(<= 0 |ULTIMATE.start_main_~i~0#1|)} main_~users~0#1.base, main_~users~0#1.offset := main_~user~0#1.base, main_~user~0#1.offset; {16437#(<= 0 |ULTIMATE.start_main_~i~0#1|)} is VALID [2022-02-21 03:13:54,474 INFO L290 TraceCheckUtils]: 72: Hoare triple {16437#(<= 0 |ULTIMATE.start_main_~i~0#1|)} havoc main_~_ha_bkt~0#1;call main_#t~mem56#1.base, main_#t~mem56#1.offset := read~$Pointer$(main_~users~0#1.base, 8 + main_~users~0#1.offset, 4);call main_#t~mem57#1 := read~int(main_#t~mem56#1.base, 12 + main_#t~mem56#1.offset, 4);main_#t~post58#1 := main_#t~mem57#1;call write~int(1 + main_#t~post58#1, main_#t~mem56#1.base, 12 + main_#t~mem56#1.offset, 4);havoc main_#t~mem56#1.base, main_#t~mem56#1.offset;havoc main_#t~mem57#1;havoc main_#t~post58#1; {16437#(<= 0 |ULTIMATE.start_main_~i~0#1|)} is VALID [2022-02-21 03:13:54,474 INFO L290 TraceCheckUtils]: 73: Hoare triple {16437#(<= 0 |ULTIMATE.start_main_~i~0#1|)} call main_#t~mem59#1.base, main_#t~mem59#1.offset := read~$Pointer$(main_~users~0#1.base, 8 + main_~users~0#1.offset, 4);call main_#t~mem60#1 := read~int(main_#t~mem59#1.base, 4 + main_#t~mem59#1.offset, 4);main_~_ha_bkt~0#1 := (if 0 == main_~_ha_hashv~0#1 || 0 == main_#t~mem60#1 - 1 then 0 else (if 1 == main_#t~mem60#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~mem60#1 - 1))) else (if 1 == main_~_ha_hashv~0#1 then (if 1 == main_#t~mem60#1 - 1 || 0 == main_#t~mem60#1 - 1 then main_#t~mem60#1 - 1 else (if main_#t~mem60#1 - 1 >= 0 then (main_#t~mem60#1 - 1) % 2 else ~bitwiseAnd(main_~_ha_hashv~0#1, main_#t~mem60#1 - 1))) else ~bitwiseAnd(main_~_ha_hashv~0#1, main_#t~mem60#1 - 1))));havoc main_#t~mem59#1.base, main_#t~mem59#1.offset;havoc main_#t~mem60#1; {16437#(<= 0 |ULTIMATE.start_main_~i~0#1|)} is VALID [2022-02-21 03:13:54,474 INFO L290 TraceCheckUtils]: 74: Hoare triple {16437#(<= 0 |ULTIMATE.start_main_~i~0#1|)} goto; {16437#(<= 0 |ULTIMATE.start_main_~i~0#1|)} is VALID [2022-02-21 03:13:54,475 INFO L290 TraceCheckUtils]: 75: Hoare triple {16437#(<= 0 |ULTIMATE.start_main_~i~0#1|)} call main_#t~mem61#1.base, main_#t~mem61#1.offset := read~$Pointer$(main_~users~0#1.base, 8 + main_~users~0#1.offset, 4);call main_#t~mem62#1.base, main_#t~mem62#1.offset := read~$Pointer$(main_#t~mem61#1.base, main_#t~mem61#1.offset, 4);main_~_ha_head~0#1.base, main_~_ha_head~0#1.offset := main_#t~mem62#1.base, main_#t~mem62#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~mem61#1.base, main_#t~mem61#1.offset;havoc main_#t~mem62#1.base, main_#t~mem62#1.offset;call main_#t~mem63#1 := read~int(main_~_ha_head~0#1.base, 4 + main_~_ha_head~0#1.offset, 4);main_#t~post64#1 := main_#t~mem63#1;call write~int(1 + main_#t~post64#1, main_~_ha_head~0#1.base, 4 + main_~_ha_head~0#1.offset, 4);havoc main_#t~mem63#1;havoc main_#t~post64#1;call main_#t~mem65#1.base, main_#t~mem65#1.offset := read~$Pointer$(main_~_ha_head~0#1.base, main_~_ha_head~0#1.offset, 4);call write~$Pointer$(main_#t~mem65#1.base, main_#t~mem65#1.offset, main_~user~0#1.base, 24 + main_~user~0#1.offset, 4);havoc main_#t~mem65#1.base, main_#t~mem65#1.offset;call write~$Pointer$(0, 0, main_~user~0#1.base, 20 + main_~user~0#1.offset, 4);call main_#t~mem66#1.base, main_#t~mem66#1.offset := read~$Pointer$(main_~_ha_head~0#1.base, main_~_ha_head~0#1.offset, 4); {16437#(<= 0 |ULTIMATE.start_main_~i~0#1|)} is VALID [2022-02-21 03:13:54,475 INFO L290 TraceCheckUtils]: 76: Hoare triple {16437#(<= 0 |ULTIMATE.start_main_~i~0#1|)} assume main_#t~mem66#1.base != 0 || main_#t~mem66#1.offset != 0;havoc main_#t~mem66#1.base, main_#t~mem66#1.offset;call main_#t~mem67#1.base, main_#t~mem67#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~mem67#1.base, 12 + main_#t~mem67#1.offset, 4);havoc main_#t~mem67#1.base, main_#t~mem67#1.offset; {16437#(<= 0 |ULTIMATE.start_main_~i~0#1|)} is VALID [2022-02-21 03:13:54,475 INFO L290 TraceCheckUtils]: 77: Hoare triple {16437#(<= 0 |ULTIMATE.start_main_~i~0#1|)} 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~mem69#1 := read~int(main_~_ha_head~0#1.base, 4 + main_~_ha_head~0#1.offset, 4);call main_#t~mem68#1 := read~int(main_~_ha_head~0#1.base, 8 + main_~_ha_head~0#1.offset, 4);main_#t~short72#1 := main_#t~mem69#1 % 4294967296 >= 10 * (1 + main_#t~mem68#1) % 4294967296; {16437#(<= 0 |ULTIMATE.start_main_~i~0#1|)} is VALID [2022-02-21 03:13:54,476 INFO L290 TraceCheckUtils]: 78: Hoare triple {16437#(<= 0 |ULTIMATE.start_main_~i~0#1|)} assume main_#t~short72#1;call main_#t~mem70#1.base, main_#t~mem70#1.offset := read~$Pointer$(main_~user~0#1.base, 8 + main_~user~0#1.offset, 4);call main_#t~mem71#1 := read~int(main_#t~mem70#1.base, 36 + main_#t~mem70#1.offset, 4);main_#t~short72#1 := 0 == main_#t~mem71#1 % 4294967296; {16437#(<= 0 |ULTIMATE.start_main_~i~0#1|)} is VALID [2022-02-21 03:13:54,476 INFO L290 TraceCheckUtils]: 79: Hoare triple {16437#(<= 0 |ULTIMATE.start_main_~i~0#1|)} assume !main_#t~short72#1;havoc main_#t~mem69#1;havoc main_#t~mem68#1;havoc main_#t~mem70#1.base, main_#t~mem70#1.offset;havoc main_#t~mem71#1;havoc main_#t~short72#1; {16437#(<= 0 |ULTIMATE.start_main_~i~0#1|)} is VALID [2022-02-21 03:13:54,476 INFO L290 TraceCheckUtils]: 80: Hoare triple {16437#(<= 0 |ULTIMATE.start_main_~i~0#1|)} goto; {16437#(<= 0 |ULTIMATE.start_main_~i~0#1|)} is VALID [2022-02-21 03:13:54,476 INFO L290 TraceCheckUtils]: 81: Hoare triple {16437#(<= 0 |ULTIMATE.start_main_~i~0#1|)} goto; {16437#(<= 0 |ULTIMATE.start_main_~i~0#1|)} is VALID [2022-02-21 03:13:54,477 INFO L290 TraceCheckUtils]: 82: Hoare triple {16437#(<= 0 |ULTIMATE.start_main_~i~0#1|)} goto; {16437#(<= 0 |ULTIMATE.start_main_~i~0#1|)} is VALID [2022-02-21 03:13:54,477 INFO L290 TraceCheckUtils]: 83: Hoare triple {16437#(<= 0 |ULTIMATE.start_main_~i~0#1|)} goto; {16437#(<= 0 |ULTIMATE.start_main_~i~0#1|)} is VALID [2022-02-21 03:13:54,477 INFO L290 TraceCheckUtils]: 84: Hoare triple {16437#(<= 0 |ULTIMATE.start_main_~i~0#1|)} main_#t~post5#1 := main_~i~0#1; {16687#(<= 0 |ULTIMATE.start_main_#t~post5#1|)} is VALID [2022-02-21 03:13:54,478 INFO L290 TraceCheckUtils]: 85: Hoare triple {16687#(<= 0 |ULTIMATE.start_main_#t~post5#1|)} assume 1 + main_#t~post5#1 <= 2147483647; {16687#(<= 0 |ULTIMATE.start_main_#t~post5#1|)} is VALID [2022-02-21 03:13:54,478 INFO L290 TraceCheckUtils]: 86: Hoare triple {16687#(<= 0 |ULTIMATE.start_main_#t~post5#1|)} assume 1 + main_#t~post5#1 >= -2147483648;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; {16694#(<= 1 |ULTIMATE.start_main_~i~0#1|)} is VALID [2022-02-21 03:13:54,479 INFO L290 TraceCheckUtils]: 87: Hoare triple {16694#(<= 1 |ULTIMATE.start_main_~i~0#1|)} assume !!(main_~i~0#1 < 10);call main_#t~malloc6#1.base, main_#t~malloc6#1.offset := #Ultimate.allocOnHeap(40);main_~user~0#1.base, main_~user~0#1.offset := main_#t~malloc6#1.base, main_#t~malloc6#1.offset;havoc main_#t~malloc6#1.base, main_#t~malloc6#1.offset; {16698#(and (<= 1 |ULTIMATE.start_main_~i~0#1|) (< |ULTIMATE.start_main_~i~0#1| 10))} is VALID [2022-02-21 03:13:54,479 INFO L290 TraceCheckUtils]: 88: Hoare triple {16698#(and (<= 1 |ULTIMATE.start_main_~i~0#1|) (< |ULTIMATE.start_main_~i~0#1| 10))} assume !(main_~user~0#1.base == 0 && main_~user~0#1.offset == 0); {16698#(and (<= 1 |ULTIMATE.start_main_~i~0#1|) (< |ULTIMATE.start_main_~i~0#1| 10))} is VALID [2022-02-21 03:13:54,480 INFO L290 TraceCheckUtils]: 89: Hoare triple {16698#(and (<= 1 |ULTIMATE.start_main_~i~0#1|) (< |ULTIMATE.start_main_~i~0#1| 10))} call write~int(main_~i~0#1, main_~user~0#1.base, main_~user~0#1.offset, 4); {16698#(and (<= 1 |ULTIMATE.start_main_~i~0#1|) (< |ULTIMATE.start_main_~i~0#1| 10))} is VALID [2022-02-21 03:13:54,480 INFO L290 TraceCheckUtils]: 90: Hoare triple {16698#(and (<= 1 |ULTIMATE.start_main_~i~0#1|) (< |ULTIMATE.start_main_~i~0#1| 10))} assume !(main_~i~0#1 * main_~i~0#1 <= 2147483647); {16430#false} is VALID [2022-02-21 03:13:54,481 INFO L134 CoverageAnalysis]: Checked inductivity of 143 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 139 trivial. 0 not checked. [2022-02-21 03:13:54,481 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-21 03:13:54,481 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 03:13:54,481 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1568520343] [2022-02-21 03:13:54,481 WARN L317 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-02-21 03:13:54,481 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [457383769] [2022-02-21 03:13:54,481 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [457383769] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-21 03:13:54,481 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-21 03:13:54,482 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-02-21 03:13:54,482 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [466249482] [2022-02-21 03:13:54,482 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-21 03:13:54,482 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 14.0) internal successors, (70), 6 states have internal predecessors, (70), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 91 [2022-02-21 03:13:54,482 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-21 03:13:54,483 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 6 states, 5 states have (on average 14.0) internal successors, (70), 6 states have internal predecessors, (70), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-02-21 03:13:54,545 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 74 edges. 74 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:13:54,546 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-02-21 03:13:54,546 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 03:13:54,546 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-02-21 03:13:54,546 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-02-21 03:13:54,546 INFO L87 Difference]: Start difference. First operand 343 states and 431 transitions. Second operand has 6 states, 5 states have (on average 14.0) internal successors, (70), 6 states have internal predecessors, (70), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-02-21 03:13:55,600 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:13:55,600 INFO L93 Difference]: Finished difference Result 343 states and 431 transitions. [2022-02-21 03:13:55,601 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-02-21 03:13:55,601 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 14.0) internal successors, (70), 6 states have internal predecessors, (70), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 91 [2022-02-21 03:13:55,601 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-21 03:13:55,601 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 5 states have (on average 14.0) internal successors, (70), 6 states have internal predecessors, (70), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-02-21 03:13:55,603 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 272 transitions. [2022-02-21 03:13:55,603 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 5 states have (on average 14.0) internal successors, (70), 6 states have internal predecessors, (70), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-02-21 03:13:55,604 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 272 transitions. [2022-02-21 03:13:55,604 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states and 272 transitions. [2022-02-21 03:13:55,829 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 272 edges. 272 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:13:55,834 INFO L225 Difference]: With dead ends: 343 [2022-02-21 03:13:55,834 INFO L226 Difference]: Without dead ends: 342 [2022-02-21 03:13:55,835 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 86 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2022-02-21 03:13:55,835 INFO L933 BasicCegarLoop]: 255 mSDtfsCounter, 172 mSDsluCounter, 537 mSDsCounter, 0 mSdLazyCounter, 61 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 186 SdHoareTripleChecker+Valid, 792 SdHoareTripleChecker+Invalid, 62 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 61 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-21 03:13:55,835 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [186 Valid, 792 Invalid, 62 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 61 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-21 03:13:55,836 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 342 states. [2022-02-21 03:13:55,942 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 342 to 342. [2022-02-21 03:13:55,943 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 03:13:55,943 INFO L82 GeneralOperation]: Start isEquivalent. First operand 342 states. Second operand has 342 states, 316 states have (on average 1.2278481012658229) internal successors, (388), 329 states have internal predecessors, (388), 19 states have call successors, (19), 3 states have call predecessors, (19), 4 states have return successors, (22), 10 states have call predecessors, (22), 19 states have call successors, (22) [2022-02-21 03:13:55,944 INFO L74 IsIncluded]: Start isIncluded. First operand 342 states. Second operand has 342 states, 316 states have (on average 1.2278481012658229) internal successors, (388), 329 states have internal predecessors, (388), 19 states have call successors, (19), 3 states have call predecessors, (19), 4 states have return successors, (22), 10 states have call predecessors, (22), 19 states have call successors, (22) [2022-02-21 03:13:55,945 INFO L87 Difference]: Start difference. First operand 342 states. Second operand has 342 states, 316 states have (on average 1.2278481012658229) internal successors, (388), 329 states have internal predecessors, (388), 19 states have call successors, (19), 3 states have call predecessors, (19), 4 states have return successors, (22), 10 states have call predecessors, (22), 19 states have call successors, (22) [2022-02-21 03:13:55,950 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:13:55,950 INFO L93 Difference]: Finished difference Result 342 states and 429 transitions. [2022-02-21 03:13:55,950 INFO L276 IsEmpty]: Start isEmpty. Operand 342 states and 429 transitions. [2022-02-21 03:13:55,951 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:13:55,951 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:13:55,951 INFO L74 IsIncluded]: Start isIncluded. First operand has 342 states, 316 states have (on average 1.2278481012658229) internal successors, (388), 329 states have internal predecessors, (388), 19 states have call successors, (19), 3 states have call predecessors, (19), 4 states have return successors, (22), 10 states have call predecessors, (22), 19 states have call successors, (22) Second operand 342 states. [2022-02-21 03:13:55,952 INFO L87 Difference]: Start difference. First operand has 342 states, 316 states have (on average 1.2278481012658229) internal successors, (388), 329 states have internal predecessors, (388), 19 states have call successors, (19), 3 states have call predecessors, (19), 4 states have return successors, (22), 10 states have call predecessors, (22), 19 states have call successors, (22) Second operand 342 states. [2022-02-21 03:13:55,957 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:13:55,957 INFO L93 Difference]: Finished difference Result 342 states and 429 transitions. [2022-02-21 03:13:55,957 INFO L276 IsEmpty]: Start isEmpty. Operand 342 states and 429 transitions. [2022-02-21 03:13:55,957 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:13:55,957 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:13:55,958 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 03:13:55,958 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 03:13:55,958 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 342 states, 316 states have (on average 1.2278481012658229) internal successors, (388), 329 states have internal predecessors, (388), 19 states have call successors, (19), 3 states have call predecessors, (19), 4 states have return successors, (22), 10 states have call predecessors, (22), 19 states have call successors, (22) [2022-02-21 03:13:55,963 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 342 states to 342 states and 429 transitions. [2022-02-21 03:13:55,964 INFO L78 Accepts]: Start accepts. Automaton has 342 states and 429 transitions. Word has length 91 [2022-02-21 03:13:55,964 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-21 03:13:55,964 INFO L470 AbstractCegarLoop]: Abstraction has 342 states and 429 transitions. [2022-02-21 03:13:55,964 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 14.0) internal successors, (70), 6 states have internal predecessors, (70), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-02-21 03:13:55,964 INFO L276 IsEmpty]: Start isEmpty. Operand 342 states and 429 transitions. [2022-02-21 03:13:55,966 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 197 [2022-02-21 03:13:55,966 INFO L506 BasicCegarLoop]: Found error trace [2022-02-21 03:13:55,966 INFO L514 BasicCegarLoop]: trace histogram [15, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-21 03:13:55,987 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:13:56,178 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,SelfDestructingSolverStorable10 [2022-02-21 03:13:56,179 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2022-02-21 03:13:56,179 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:13:56,179 INFO L85 PathProgramCache]: Analyzing trace with hash -1165389731, now seen corresponding path program 1 times [2022-02-21 03:13:56,179 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:13:56,179 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1713916889] [2022-02-21 03:13:56,179 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:13:56,179 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:13:56,334 ERROR L252 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-02-21 03:13:56,334 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1815117459] [2022-02-21 03:13:56,334 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:13:56,334 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-21 03:13:56,334 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:13:56,335 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:13:56,354 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:13:57,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:13:57,673 INFO L263 TraceCheckSpWp]: Trace formula consists of 3825 conjuncts, 7 conjunts are in the unsatisfiable core [2022-02-21 03:13:57,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:13:57,724 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 03:13:58,363 INFO L290 TraceCheckUtils]: 0: Hoare triple {18240#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);~count_int_int~0 := 0; {18240#true} is VALID [2022-02-21 03:13:58,364 INFO L290 TraceCheckUtils]: 1: Hoare triple {18240#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc6#1.base, main_#t~malloc6#1.offset, main_#t~mem8#1, main_#t~mem7#1, main_#t~mem9#1, main_#t~mem10#1, main_#t~mem12#1, main_#t~mem11#1, main_#t~mem13#1, main_#t~mem14#1, main_#t~mem16#1, main_#t~mem15#1, main_#t~mem17#1, main_#t~mem18#1, main_#t~switch19#1, main_#t~mem20#1, main_#t~mem21#1, main_#t~mem22#1, main_#t~mem23#1, main_#t~mem24#1, main_#t~mem25#1, main_#t~mem26#1, main_#t~mem27#1, main_#t~mem28#1, main_#t~mem29#1, main_#t~mem30#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~malloc31#1.base, main_#t~malloc31#1.offset, main_#t~mem32#1.base, main_#t~mem32#1.offset, main_#t~mem33#1.base, main_#t~mem33#1.offset, main_#t~memset~res34#1.base, main_#t~memset~res34#1.offset, main_#t~mem35#1.base, main_#t~mem35#1.offset, main_#t~mem36#1.base, main_#t~mem36#1.offset, main_#t~mem37#1.base, main_#t~mem37#1.offset, main_#t~mem38#1.base, main_#t~mem38#1.offset, main_#t~mem39#1.base, main_#t~mem39#1.offset, main_#t~malloc40#1.base, main_#t~malloc40#1.offset, main_#t~mem41#1.base, main_#t~mem41#1.offset, main_#t~mem42#1.base, main_#t~mem42#1.offset, main_#t~mem43#1.base, main_#t~mem43#1.offset, main_#t~mem44#1.base, main_#t~mem44#1.offset, main_#t~mem45#1.base, main_#t~mem45#1.offset, main_#t~mem46#1.base, main_#t~mem46#1.offset, main_#t~memset~res47#1.base, main_#t~memset~res47#1.offset, main_#t~mem48#1.base, main_#t~mem48#1.offset, main_#t~mem49#1.base, main_#t~mem49#1.offset, main_#t~mem50#1.base, main_#t~mem50#1.offset, main_#t~mem51#1.base, main_#t~mem51#1.offset, main_#t~mem52#1, main_#t~mem53#1.base, main_#t~mem53#1.offset, main_#t~mem54#1.base, main_#t~mem54#1.offset, main_#t~mem55#1.base, main_#t~mem55#1.offset, main_#t~mem56#1.base, main_#t~mem56#1.offset, main_#t~mem57#1, main_#t~post58#1, main_#t~mem59#1.base, main_#t~mem59#1.offset, main_#t~mem60#1, main_#t~mem61#1.base, main_#t~mem61#1.offset, main_#t~mem62#1.base, main_#t~mem62#1.offset, main_#t~mem63#1, main_#t~post64#1, main_#t~mem65#1.base, main_#t~mem65#1.offset, main_#t~mem66#1.base, main_#t~mem66#1.offset, main_#t~mem67#1.base, main_#t~mem67#1.offset, main_#t~mem69#1, main_#t~mem68#1, main_#t~mem70#1.base, main_#t~mem70#1.offset, main_#t~mem71#1, main_#t~short72#1, main_#t~mem73#1.base, main_#t~mem73#1.offset, main_#t~mem74#1, main_#t~malloc75#1.base, main_#t~malloc75#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~mem79#1, main_#t~memset~res80#1.base, main_#t~memset~res80#1.offset, main_#t~mem81#1.base, main_#t~mem81#1.offset, main_#t~mem82#1.base, main_#t~mem82#1.offset, main_#t~mem85#1, main_#t~mem83#1.base, main_#t~mem83#1.offset, main_#t~mem84#1, main_#t~mem86#1.base, main_#t~mem86#1.offset, main_#t~mem89#1, main_#t~mem87#1.base, main_#t~mem87#1.offset, main_#t~mem88#1, main_#t~ite90#1, main_#t~mem91#1.base, main_#t~mem91#1.offset, main_#t~mem95#1.base, main_#t~mem95#1.offset, main_#t~mem96#1.base, main_#t~mem96#1.offset, main_#t~mem97#1.base, main_#t~mem97#1.offset, main_#t~mem98#1.base, main_#t~mem98#1.offset, main_#t~mem101#1, main_#t~mem99#1.base, main_#t~mem99#1.offset, main_#t~mem100#1, main_#t~mem102#1.base, main_#t~mem102#1.offset, main_#t~mem103#1, main_#t~pre104#1, main_#t~mem105#1.base, main_#t~mem105#1.offset, main_#t~mem106#1, main_#t~mem107#1.base, main_#t~mem107#1.offset, main_#t~mem108#1, main_#t~post109#1, main_#t~mem113#1, main_#t~mem111#1, main_#t~mem110#1.base, main_#t~mem110#1.offset, main_#t~mem112#1, main_#t~mem114#1, main_#t~post115#1, main_#t~mem116#1.base, main_#t~mem116#1.offset, main_#t~mem117#1.base, main_#t~mem117#1.offset, main_#t~mem118#1.base, main_#t~mem118#1.offset, main_#t~post92#1, main_#t~mem93#1.base, main_#t~mem93#1.offset, main_#t~mem94#1, main_#t~mem119#1.base, main_#t~mem119#1.offset, main_#t~mem120#1.base, main_#t~mem120#1.offset, main_#t~mem121#1.base, main_#t~mem121#1.offset, main_#t~mem122#1, main_#t~mem123#1.base, main_#t~mem123#1.offset, main_#t~mem124#1, main_#t~post125#1, main_#t~mem126#1.base, main_#t~mem126#1.offset, main_#t~mem127#1.base, main_#t~mem127#1.offset, main_#t~mem128#1.base, main_#t~mem128#1.offset, main_#t~mem129#1.base, main_#t~mem129#1.offset, main_#t~mem132#1, main_#t~mem130#1.base, main_#t~mem130#1.offset, main_#t~mem131#1, main_#t~ite135#1, main_#t~mem133#1.base, main_#t~mem133#1.offset, main_#t~mem134#1, main_#t~mem136#1.base, main_#t~mem136#1.offset, main_#t~mem137#1, main_#t~mem138#1.base, main_#t~mem138#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~post5#1, main_#t~mem140#1, main_#t~mem141#1, main_#t~mem139#1.base, main_#t~mem139#1.offset, main_~i~0#1, main_~user~0#1.base, main_~user~0#1.offset, main_~users~0#1.base, main_~users~0#1.offset;havoc main_~i~0#1;havoc main_~user~0#1.base, main_~user~0#1.offset;main_~users~0#1.base, main_~users~0#1.offset := 0, 0;main_~i~0#1 := 0; {18248#(<= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-21 03:13:58,364 INFO L290 TraceCheckUtils]: 2: Hoare triple {18248#(<= |ULTIMATE.start_main_~i~0#1| 0)} assume !!(main_~i~0#1 < 10);call main_#t~malloc6#1.base, main_#t~malloc6#1.offset := #Ultimate.allocOnHeap(40);main_~user~0#1.base, main_~user~0#1.offset := main_#t~malloc6#1.base, main_#t~malloc6#1.offset;havoc main_#t~malloc6#1.base, main_#t~malloc6#1.offset; {18248#(<= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-21 03:13:58,364 INFO L290 TraceCheckUtils]: 3: Hoare triple {18248#(<= |ULTIMATE.start_main_~i~0#1| 0)} assume !(main_~user~0#1.base == 0 && main_~user~0#1.offset == 0); {18248#(<= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-21 03:13:58,365 INFO L290 TraceCheckUtils]: 4: Hoare triple {18248#(<= |ULTIMATE.start_main_~i~0#1| 0)} call write~int(main_~i~0#1, main_~user~0#1.base, main_~user~0#1.offset, 4); {18248#(<= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-21 03:13:58,365 INFO L290 TraceCheckUtils]: 5: Hoare triple {18248#(<= |ULTIMATE.start_main_~i~0#1| 0)} assume main_~i~0#1 * main_~i~0#1 <= 2147483647; {18248#(<= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-21 03:13:58,365 INFO L290 TraceCheckUtils]: 6: Hoare triple {18248#(<= |ULTIMATE.start_main_~i~0#1| 0)} assume main_~i~0#1 * main_~i~0#1 >= -2147483648;call write~int(main_~i~0#1 * main_~i~0#1, main_~user~0#1.base, 4 + main_~user~0#1.offset, 4); {18248#(<= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-21 03:13:58,366 INFO L290 TraceCheckUtils]: 7: Hoare triple {18248#(<= |ULTIMATE.start_main_~i~0#1| 0)} havoc main_~_ha_hashv~0#1; {18248#(<= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-21 03:13:58,366 INFO L290 TraceCheckUtils]: 8: Hoare triple {18248#(<= |ULTIMATE.start_main_~i~0#1| 0)} goto; {18248#(<= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-21 03:13:58,366 INFO L290 TraceCheckUtils]: 9: Hoare triple {18248#(<= |ULTIMATE.start_main_~i~0#1| 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; {18248#(<= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-21 03:13:58,366 INFO L290 TraceCheckUtils]: 10: Hoare triple {18248#(<= |ULTIMATE.start_main_~i~0#1| 0)} assume !(main_~_hj_k~0#1 % 4294967296 >= 12); {18248#(<= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-21 03:13:58,367 INFO L290 TraceCheckUtils]: 11: Hoare triple {18248#(<= |ULTIMATE.start_main_~i~0#1| 0)} main_~_ha_hashv~0#1 := 4 + main_~_ha_hashv~0#1;main_#t~switch19#1 := 11 == main_~_hj_k~0#1; {18248#(<= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-21 03:13:58,367 INFO L290 TraceCheckUtils]: 12: Hoare triple {18248#(<= |ULTIMATE.start_main_~i~0#1| 0)} assume !main_#t~switch19#1; {18248#(<= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-21 03:13:58,367 INFO L290 TraceCheckUtils]: 13: Hoare triple {18248#(<= |ULTIMATE.start_main_~i~0#1| 0)} main_#t~switch19#1 := main_#t~switch19#1 || 10 == main_~_hj_k~0#1; {18248#(<= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-21 03:13:58,368 INFO L290 TraceCheckUtils]: 14: Hoare triple {18248#(<= |ULTIMATE.start_main_~i~0#1| 0)} assume !main_#t~switch19#1; {18248#(<= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-21 03:13:58,368 INFO L290 TraceCheckUtils]: 15: Hoare triple {18248#(<= |ULTIMATE.start_main_~i~0#1| 0)} main_#t~switch19#1 := main_#t~switch19#1 || 9 == main_~_hj_k~0#1; {18248#(<= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-21 03:13:58,368 INFO L290 TraceCheckUtils]: 16: Hoare triple {18248#(<= |ULTIMATE.start_main_~i~0#1| 0)} assume !main_#t~switch19#1; {18248#(<= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-21 03:13:58,368 INFO L290 TraceCheckUtils]: 17: Hoare triple {18248#(<= |ULTIMATE.start_main_~i~0#1| 0)} main_#t~switch19#1 := main_#t~switch19#1 || 8 == main_~_hj_k~0#1; {18248#(<= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-21 03:13:58,369 INFO L290 TraceCheckUtils]: 18: Hoare triple {18248#(<= |ULTIMATE.start_main_~i~0#1| 0)} assume !main_#t~switch19#1; {18248#(<= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-21 03:13:58,369 INFO L290 TraceCheckUtils]: 19: Hoare triple {18248#(<= |ULTIMATE.start_main_~i~0#1| 0)} main_#t~switch19#1 := main_#t~switch19#1 || 7 == main_~_hj_k~0#1; {18248#(<= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-21 03:13:58,369 INFO L290 TraceCheckUtils]: 20: Hoare triple {18248#(<= |ULTIMATE.start_main_~i~0#1| 0)} assume !main_#t~switch19#1; {18248#(<= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-21 03:13:58,370 INFO L290 TraceCheckUtils]: 21: Hoare triple {18248#(<= |ULTIMATE.start_main_~i~0#1| 0)} main_#t~switch19#1 := main_#t~switch19#1 || 6 == main_~_hj_k~0#1; {18248#(<= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-21 03:13:58,370 INFO L290 TraceCheckUtils]: 22: Hoare triple {18248#(<= |ULTIMATE.start_main_~i~0#1| 0)} assume !main_#t~switch19#1; {18248#(<= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-21 03:13:58,370 INFO L290 TraceCheckUtils]: 23: Hoare triple {18248#(<= |ULTIMATE.start_main_~i~0#1| 0)} main_#t~switch19#1 := main_#t~switch19#1 || 5 == main_~_hj_k~0#1; {18248#(<= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-21 03:13:58,371 INFO L290 TraceCheckUtils]: 24: Hoare triple {18248#(<= |ULTIMATE.start_main_~i~0#1| 0)} assume !main_#t~switch19#1; {18248#(<= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-21 03:13:58,371 INFO L290 TraceCheckUtils]: 25: Hoare triple {18248#(<= |ULTIMATE.start_main_~i~0#1| 0)} main_#t~switch19#1 := main_#t~switch19#1 || 4 == main_~_hj_k~0#1; {18248#(<= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-21 03:13:58,373 INFO L290 TraceCheckUtils]: 26: Hoare triple {18248#(<= |ULTIMATE.start_main_~i~0#1| 0)} assume main_#t~switch19#1;call main_#t~mem27#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~mem27#1 % 256);havoc main_#t~mem27#1; {18248#(<= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-21 03:13:58,373 INFO L290 TraceCheckUtils]: 27: Hoare triple {18248#(<= |ULTIMATE.start_main_~i~0#1| 0)} main_#t~switch19#1 := main_#t~switch19#1 || 3 == main_~_hj_k~0#1; {18248#(<= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-21 03:13:58,374 INFO L290 TraceCheckUtils]: 28: Hoare triple {18248#(<= |ULTIMATE.start_main_~i~0#1| 0)} assume main_#t~switch19#1;call main_#t~mem28#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~mem28#1 % 256);havoc main_#t~mem28#1; {18248#(<= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-21 03:13:58,374 INFO L290 TraceCheckUtils]: 29: Hoare triple {18248#(<= |ULTIMATE.start_main_~i~0#1| 0)} main_#t~switch19#1 := main_#t~switch19#1 || 2 == main_~_hj_k~0#1; {18248#(<= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-21 03:13:58,374 INFO L290 TraceCheckUtils]: 30: Hoare triple {18248#(<= |ULTIMATE.start_main_~i~0#1| 0)} assume main_#t~switch19#1;call main_#t~mem29#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~mem29#1 % 256);havoc main_#t~mem29#1; {18248#(<= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-21 03:13:58,374 INFO L290 TraceCheckUtils]: 31: Hoare triple {18248#(<= |ULTIMATE.start_main_~i~0#1| 0)} main_#t~switch19#1 := main_#t~switch19#1 || 1 == main_~_hj_k~0#1; {18248#(<= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-21 03:13:58,375 INFO L290 TraceCheckUtils]: 32: Hoare triple {18248#(<= |ULTIMATE.start_main_~i~0#1| 0)} assume main_#t~switch19#1;call main_#t~mem30#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~mem30#1 % 256;havoc main_#t~mem30#1; {18248#(<= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-21 03:13:58,375 INFO L290 TraceCheckUtils]: 33: Hoare triple {18248#(<= |ULTIMATE.start_main_~i~0#1| 0)} havoc main_#t~switch19#1; {18248#(<= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-21 03:13:58,375 INFO L290 TraceCheckUtils]: 34: Hoare triple {18248#(<= |ULTIMATE.start_main_~i~0#1| 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)))); {18248#(<= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-21 03:13:58,375 INFO L290 TraceCheckUtils]: 35: Hoare triple {18248#(<= |ULTIMATE.start_main_~i~0#1| 0)} goto; {18248#(<= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-21 03:13:58,376 INFO L290 TraceCheckUtils]: 36: Hoare triple {18248#(<= |ULTIMATE.start_main_~i~0#1| 0)} goto; {18248#(<= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-21 03:13:58,376 INFO L290 TraceCheckUtils]: 37: Hoare triple {18248#(<= |ULTIMATE.start_main_~i~0#1| 0)} goto; {18248#(<= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-21 03:13:58,376 INFO L290 TraceCheckUtils]: 38: Hoare triple {18248#(<= |ULTIMATE.start_main_~i~0#1| 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); {18248#(<= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-21 03:13:58,376 INFO L290 TraceCheckUtils]: 39: Hoare triple {18248#(<= |ULTIMATE.start_main_~i~0#1| 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); {18248#(<= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-21 03:13:58,376 INFO L290 TraceCheckUtils]: 40: Hoare triple {18248#(<= |ULTIMATE.start_main_~i~0#1| 0)} call main_#t~malloc31#1.base, main_#t~malloc31#1.offset := #Ultimate.allocOnHeap(44);call write~$Pointer$(main_#t~malloc31#1.base, main_#t~malloc31#1.offset, main_~user~0#1.base, 8 + main_~user~0#1.offset, 4);havoc main_#t~malloc31#1.base, main_#t~malloc31#1.offset;call main_#t~mem32#1.base, main_#t~mem32#1.offset := read~$Pointer$(main_~user~0#1.base, 8 + main_~user~0#1.offset, 4); {18248#(<= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-21 03:13:58,377 INFO L290 TraceCheckUtils]: 41: Hoare triple {18248#(<= |ULTIMATE.start_main_~i~0#1| 0)} assume !(main_#t~mem32#1.base == 0 && main_#t~mem32#1.offset == 0);havoc main_#t~mem32#1.base, main_#t~mem32#1.offset;call main_#t~mem33#1.base, main_#t~mem33#1.offset := read~$Pointer$(main_~user~0#1.base, 8 + main_~user~0#1.offset, 4); {18248#(<= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-21 03:13:58,377 INFO L272 TraceCheckUtils]: 42: Hoare triple {18248#(<= |ULTIMATE.start_main_~i~0#1| 0)} call main_#t~memset~res34#1.base, main_#t~memset~res34#1.offset := #Ultimate.C_memset(main_#t~mem33#1.base, main_#t~mem33#1.offset, 0, 44); {18240#true} is VALID [2022-02-21 03:13:58,377 INFO L290 TraceCheckUtils]: 43: Hoare triple {18240#true} #t~loopctr143 := 0; {18240#true} is VALID [2022-02-21 03:13:58,377 INFO L290 TraceCheckUtils]: 44: Hoare triple {18240#true} assume #t~loopctr143 % 4294967296 < #amount % 4294967296;#memory_$Pointer$.base, #memory_$Pointer$.offset := #memory_$Pointer$.base[#ptr.base,#ptr.offset + #t~loopctr143 := 0], #memory_$Pointer$.offset[#ptr.base,#ptr.offset + #t~loopctr143 := #value % 256];#memory_int := #memory_int[#ptr.base,#ptr.offset + #t~loopctr143 := #value];#t~loopctr143 := 1 + #t~loopctr143; {18240#true} is VALID [2022-02-21 03:13:58,377 INFO L290 TraceCheckUtils]: 45: Hoare triple {18240#true} assume #t~loopctr143 % 4294967296 < #amount % 4294967296;#memory_$Pointer$.base, #memory_$Pointer$.offset := #memory_$Pointer$.base[#ptr.base,#ptr.offset + #t~loopctr143 := 0], #memory_$Pointer$.offset[#ptr.base,#ptr.offset + #t~loopctr143 := #value % 256];#memory_int := #memory_int[#ptr.base,#ptr.offset + #t~loopctr143 := #value];#t~loopctr143 := 1 + #t~loopctr143; {18240#true} is VALID [2022-02-21 03:13:58,377 INFO L290 TraceCheckUtils]: 46: Hoare triple {18240#true} assume #t~loopctr143 % 4294967296 < #amount % 4294967296;#memory_$Pointer$.base, #memory_$Pointer$.offset := #memory_$Pointer$.base[#ptr.base,#ptr.offset + #t~loopctr143 := 0], #memory_$Pointer$.offset[#ptr.base,#ptr.offset + #t~loopctr143 := #value % 256];#memory_int := #memory_int[#ptr.base,#ptr.offset + #t~loopctr143 := #value];#t~loopctr143 := 1 + #t~loopctr143; {18240#true} is VALID [2022-02-21 03:13:58,377 INFO L290 TraceCheckUtils]: 47: Hoare triple {18240#true} assume #t~loopctr143 % 4294967296 < #amount % 4294967296;#memory_$Pointer$.base, #memory_$Pointer$.offset := #memory_$Pointer$.base[#ptr.base,#ptr.offset + #t~loopctr143 := 0], #memory_$Pointer$.offset[#ptr.base,#ptr.offset + #t~loopctr143 := #value % 256];#memory_int := #memory_int[#ptr.base,#ptr.offset + #t~loopctr143 := #value];#t~loopctr143 := 1 + #t~loopctr143; {18240#true} is VALID [2022-02-21 03:13:58,377 INFO L290 TraceCheckUtils]: 48: Hoare triple {18240#true} assume #t~loopctr143 % 4294967296 < #amount % 4294967296;#memory_$Pointer$.base, #memory_$Pointer$.offset := #memory_$Pointer$.base[#ptr.base,#ptr.offset + #t~loopctr143 := 0], #memory_$Pointer$.offset[#ptr.base,#ptr.offset + #t~loopctr143 := #value % 256];#memory_int := #memory_int[#ptr.base,#ptr.offset + #t~loopctr143 := #value];#t~loopctr143 := 1 + #t~loopctr143; {18240#true} is VALID [2022-02-21 03:13:58,377 INFO L290 TraceCheckUtils]: 49: Hoare triple {18240#true} assume #t~loopctr143 % 4294967296 < #amount % 4294967296;#memory_$Pointer$.base, #memory_$Pointer$.offset := #memory_$Pointer$.base[#ptr.base,#ptr.offset + #t~loopctr143 := 0], #memory_$Pointer$.offset[#ptr.base,#ptr.offset + #t~loopctr143 := #value % 256];#memory_int := #memory_int[#ptr.base,#ptr.offset + #t~loopctr143 := #value];#t~loopctr143 := 1 + #t~loopctr143; {18240#true} is VALID [2022-02-21 03:13:58,377 INFO L290 TraceCheckUtils]: 50: Hoare triple {18240#true} assume #t~loopctr143 % 4294967296 < #amount % 4294967296;#memory_$Pointer$.base, #memory_$Pointer$.offset := #memory_$Pointer$.base[#ptr.base,#ptr.offset + #t~loopctr143 := 0], #memory_$Pointer$.offset[#ptr.base,#ptr.offset + #t~loopctr143 := #value % 256];#memory_int := #memory_int[#ptr.base,#ptr.offset + #t~loopctr143 := #value];#t~loopctr143 := 1 + #t~loopctr143; {18240#true} is VALID [2022-02-21 03:13:58,377 INFO L290 TraceCheckUtils]: 51: Hoare triple {18240#true} assume #t~loopctr143 % 4294967296 < #amount % 4294967296;#memory_$Pointer$.base, #memory_$Pointer$.offset := #memory_$Pointer$.base[#ptr.base,#ptr.offset + #t~loopctr143 := 0], #memory_$Pointer$.offset[#ptr.base,#ptr.offset + #t~loopctr143 := #value % 256];#memory_int := #memory_int[#ptr.base,#ptr.offset + #t~loopctr143 := #value];#t~loopctr143 := 1 + #t~loopctr143; {18240#true} is VALID [2022-02-21 03:13:58,377 INFO L290 TraceCheckUtils]: 52: Hoare triple {18240#true} assume #t~loopctr143 % 4294967296 < #amount % 4294967296;#memory_$Pointer$.base, #memory_$Pointer$.offset := #memory_$Pointer$.base[#ptr.base,#ptr.offset + #t~loopctr143 := 0], #memory_$Pointer$.offset[#ptr.base,#ptr.offset + #t~loopctr143 := #value % 256];#memory_int := #memory_int[#ptr.base,#ptr.offset + #t~loopctr143 := #value];#t~loopctr143 := 1 + #t~loopctr143; {18240#true} is VALID [2022-02-21 03:13:58,377 INFO L290 TraceCheckUtils]: 53: Hoare triple {18240#true} assume #t~loopctr143 % 4294967296 < #amount % 4294967296;#memory_$Pointer$.base, #memory_$Pointer$.offset := #memory_$Pointer$.base[#ptr.base,#ptr.offset + #t~loopctr143 := 0], #memory_$Pointer$.offset[#ptr.base,#ptr.offset + #t~loopctr143 := #value % 256];#memory_int := #memory_int[#ptr.base,#ptr.offset + #t~loopctr143 := #value];#t~loopctr143 := 1 + #t~loopctr143; {18240#true} is VALID [2022-02-21 03:13:58,377 INFO L290 TraceCheckUtils]: 54: Hoare triple {18240#true} assume !(#t~loopctr143 % 4294967296 < #amount % 4294967296); {18240#true} is VALID [2022-02-21 03:13:58,377 INFO L290 TraceCheckUtils]: 55: Hoare triple {18240#true} assume #res.base == #ptr.base && #res.offset == #ptr.offset; {18240#true} is VALID [2022-02-21 03:13:58,378 INFO L284 TraceCheckUtils]: 56: Hoare quadruple {18240#true} {18248#(<= |ULTIMATE.start_main_~i~0#1| 0)} #484#return; {18248#(<= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-21 03:13:58,378 INFO L290 TraceCheckUtils]: 57: Hoare triple {18248#(<= |ULTIMATE.start_main_~i~0#1| 0)} havoc main_#t~mem33#1.base, main_#t~mem33#1.offset;havoc main_#t~memset~res34#1.base, main_#t~memset~res34#1.offset;call main_#t~mem35#1.base, main_#t~mem35#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~mem35#1.base, 16 + main_#t~mem35#1.offset, 4);havoc main_#t~mem35#1.base, main_#t~mem35#1.offset;call main_#t~mem36#1.base, main_#t~mem36#1.offset := read~$Pointer$(main_~user~0#1.base, 8 + main_~user~0#1.offset, 4);call write~int(32, main_#t~mem36#1.base, 4 + main_#t~mem36#1.offset, 4);havoc main_#t~mem36#1.base, main_#t~mem36#1.offset;call main_#t~mem37#1.base, main_#t~mem37#1.offset := read~$Pointer$(main_~user~0#1.base, 8 + main_~user~0#1.offset, 4);call write~int(5, main_#t~mem37#1.base, 8 + main_#t~mem37#1.offset, 4);havoc main_#t~mem37#1.base, main_#t~mem37#1.offset;call main_#t~mem38#1.base, main_#t~mem38#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~mem38#1.base, 20 + main_#t~mem38#1.offset, 4);havoc main_#t~mem38#1.base, main_#t~mem38#1.offset;call main_#t~mem39#1.base, main_#t~mem39#1.offset := read~$Pointer$(main_~user~0#1.base, 8 + main_~user~0#1.offset, 4);call main_#t~malloc40#1.base, main_#t~malloc40#1.offset := #Ultimate.allocOnHeap(384);call write~$Pointer$(main_#t~malloc40#1.base, main_#t~malloc40#1.offset, main_#t~mem39#1.base, main_#t~mem39#1.offset, 4);havoc main_#t~mem39#1.base, main_#t~mem39#1.offset;havoc main_#t~malloc40#1.base, main_#t~malloc40#1.offset;call main_#t~mem41#1.base, main_#t~mem41#1.offset := read~$Pointer$(main_~user~0#1.base, 8 + main_~user~0#1.offset, 4);call write~int(2685476833, main_#t~mem41#1.base, 40 + main_#t~mem41#1.offset, 4);havoc main_#t~mem41#1.base, main_#t~mem41#1.offset;call main_#t~mem42#1.base, main_#t~mem42#1.offset := read~$Pointer$(main_~user~0#1.base, 8 + main_~user~0#1.offset, 4);call main_#t~mem43#1.base, main_#t~mem43#1.offset := read~$Pointer$(main_#t~mem42#1.base, main_#t~mem42#1.offset, 4); {18248#(<= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-21 03:13:58,379 INFO L290 TraceCheckUtils]: 58: Hoare triple {18248#(<= |ULTIMATE.start_main_~i~0#1| 0)} assume !(main_#t~mem43#1.base == 0 && main_#t~mem43#1.offset == 0);havoc main_#t~mem42#1.base, main_#t~mem42#1.offset;havoc main_#t~mem43#1.base, main_#t~mem43#1.offset;call main_#t~mem45#1.base, main_#t~mem45#1.offset := read~$Pointer$(main_~user~0#1.base, 8 + main_~user~0#1.offset, 4);call main_#t~mem46#1.base, main_#t~mem46#1.offset := read~$Pointer$(main_#t~mem45#1.base, main_#t~mem45#1.offset, 4); {18248#(<= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-21 03:13:58,379 INFO L272 TraceCheckUtils]: 59: Hoare triple {18248#(<= |ULTIMATE.start_main_~i~0#1| 0)} call main_#t~memset~res47#1.base, main_#t~memset~res47#1.offset := #Ultimate.C_memset(main_#t~mem46#1.base, main_#t~mem46#1.offset, 0, 384); {18240#true} is VALID [2022-02-21 03:13:58,379 INFO L290 TraceCheckUtils]: 60: Hoare triple {18240#true} #t~loopctr143 := 0; {18240#true} is VALID [2022-02-21 03:13:58,379 INFO L290 TraceCheckUtils]: 61: Hoare triple {18240#true} assume #t~loopctr143 % 4294967296 < #amount % 4294967296;#memory_$Pointer$.base, #memory_$Pointer$.offset := #memory_$Pointer$.base[#ptr.base,#ptr.offset + #t~loopctr143 := 0], #memory_$Pointer$.offset[#ptr.base,#ptr.offset + #t~loopctr143 := #value % 256];#memory_int := #memory_int[#ptr.base,#ptr.offset + #t~loopctr143 := #value];#t~loopctr143 := 1 + #t~loopctr143; {18240#true} is VALID [2022-02-21 03:13:58,379 INFO L290 TraceCheckUtils]: 62: Hoare triple {18240#true} assume #t~loopctr143 % 4294967296 < #amount % 4294967296;#memory_$Pointer$.base, #memory_$Pointer$.offset := #memory_$Pointer$.base[#ptr.base,#ptr.offset + #t~loopctr143 := 0], #memory_$Pointer$.offset[#ptr.base,#ptr.offset + #t~loopctr143 := #value % 256];#memory_int := #memory_int[#ptr.base,#ptr.offset + #t~loopctr143 := #value];#t~loopctr143 := 1 + #t~loopctr143; {18240#true} is VALID [2022-02-21 03:13:58,379 INFO L290 TraceCheckUtils]: 63: Hoare triple {18240#true} assume #t~loopctr143 % 4294967296 < #amount % 4294967296;#memory_$Pointer$.base, #memory_$Pointer$.offset := #memory_$Pointer$.base[#ptr.base,#ptr.offset + #t~loopctr143 := 0], #memory_$Pointer$.offset[#ptr.base,#ptr.offset + #t~loopctr143 := #value % 256];#memory_int := #memory_int[#ptr.base,#ptr.offset + #t~loopctr143 := #value];#t~loopctr143 := 1 + #t~loopctr143; {18240#true} is VALID [2022-02-21 03:13:58,379 INFO L290 TraceCheckUtils]: 64: Hoare triple {18240#true} assume #t~loopctr143 % 4294967296 < #amount % 4294967296;#memory_$Pointer$.base, #memory_$Pointer$.offset := #memory_$Pointer$.base[#ptr.base,#ptr.offset + #t~loopctr143 := 0], #memory_$Pointer$.offset[#ptr.base,#ptr.offset + #t~loopctr143 := #value % 256];#memory_int := #memory_int[#ptr.base,#ptr.offset + #t~loopctr143 := #value];#t~loopctr143 := 1 + #t~loopctr143; {18240#true} is VALID [2022-02-21 03:13:58,379 INFO L290 TraceCheckUtils]: 65: Hoare triple {18240#true} assume #t~loopctr143 % 4294967296 < #amount % 4294967296;#memory_$Pointer$.base, #memory_$Pointer$.offset := #memory_$Pointer$.base[#ptr.base,#ptr.offset + #t~loopctr143 := 0], #memory_$Pointer$.offset[#ptr.base,#ptr.offset + #t~loopctr143 := #value % 256];#memory_int := #memory_int[#ptr.base,#ptr.offset + #t~loopctr143 := #value];#t~loopctr143 := 1 + #t~loopctr143; {18240#true} is VALID [2022-02-21 03:13:58,379 INFO L290 TraceCheckUtils]: 66: Hoare triple {18240#true} assume !(#t~loopctr143 % 4294967296 < #amount % 4294967296); {18240#true} is VALID [2022-02-21 03:13:58,379 INFO L290 TraceCheckUtils]: 67: Hoare triple {18240#true} assume #res.base == #ptr.base && #res.offset == #ptr.offset; {18240#true} is VALID [2022-02-21 03:13:58,380 INFO L284 TraceCheckUtils]: 68: Hoare quadruple {18240#true} {18248#(<= |ULTIMATE.start_main_~i~0#1| 0)} #486#return; {18248#(<= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-21 03:13:58,380 INFO L290 TraceCheckUtils]: 69: Hoare triple {18248#(<= |ULTIMATE.start_main_~i~0#1| 0)} havoc main_#t~mem45#1.base, main_#t~mem45#1.offset;havoc main_#t~mem46#1.base, main_#t~mem46#1.offset;havoc main_#t~memset~res47#1.base, main_#t~memset~res47#1.offset; {18248#(<= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-21 03:13:58,380 INFO L290 TraceCheckUtils]: 70: Hoare triple {18248#(<= |ULTIMATE.start_main_~i~0#1| 0)} goto; {18248#(<= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-21 03:13:58,380 INFO L290 TraceCheckUtils]: 71: Hoare triple {18248#(<= |ULTIMATE.start_main_~i~0#1| 0)} main_~users~0#1.base, main_~users~0#1.offset := main_~user~0#1.base, main_~user~0#1.offset; {18248#(<= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-21 03:13:58,381 INFO L290 TraceCheckUtils]: 72: Hoare triple {18248#(<= |ULTIMATE.start_main_~i~0#1| 0)} havoc main_~_ha_bkt~0#1;call main_#t~mem56#1.base, main_#t~mem56#1.offset := read~$Pointer$(main_~users~0#1.base, 8 + main_~users~0#1.offset, 4);call main_#t~mem57#1 := read~int(main_#t~mem56#1.base, 12 + main_#t~mem56#1.offset, 4);main_#t~post58#1 := main_#t~mem57#1;call write~int(1 + main_#t~post58#1, main_#t~mem56#1.base, 12 + main_#t~mem56#1.offset, 4);havoc main_#t~mem56#1.base, main_#t~mem56#1.offset;havoc main_#t~mem57#1;havoc main_#t~post58#1; {18248#(<= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-21 03:13:58,381 INFO L290 TraceCheckUtils]: 73: Hoare triple {18248#(<= |ULTIMATE.start_main_~i~0#1| 0)} call main_#t~mem59#1.base, main_#t~mem59#1.offset := read~$Pointer$(main_~users~0#1.base, 8 + main_~users~0#1.offset, 4);call main_#t~mem60#1 := read~int(main_#t~mem59#1.base, 4 + main_#t~mem59#1.offset, 4);main_~_ha_bkt~0#1 := (if 0 == main_~_ha_hashv~0#1 || 0 == main_#t~mem60#1 - 1 then 0 else (if 1 == main_#t~mem60#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~mem60#1 - 1))) else (if 1 == main_~_ha_hashv~0#1 then (if 1 == main_#t~mem60#1 - 1 || 0 == main_#t~mem60#1 - 1 then main_#t~mem60#1 - 1 else (if main_#t~mem60#1 - 1 >= 0 then (main_#t~mem60#1 - 1) % 2 else ~bitwiseAnd(main_~_ha_hashv~0#1, main_#t~mem60#1 - 1))) else ~bitwiseAnd(main_~_ha_hashv~0#1, main_#t~mem60#1 - 1))));havoc main_#t~mem59#1.base, main_#t~mem59#1.offset;havoc main_#t~mem60#1; {18248#(<= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-21 03:13:58,381 INFO L290 TraceCheckUtils]: 74: Hoare triple {18248#(<= |ULTIMATE.start_main_~i~0#1| 0)} goto; {18248#(<= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-21 03:13:58,381 INFO L290 TraceCheckUtils]: 75: Hoare triple {18248#(<= |ULTIMATE.start_main_~i~0#1| 0)} call main_#t~mem61#1.base, main_#t~mem61#1.offset := read~$Pointer$(main_~users~0#1.base, 8 + main_~users~0#1.offset, 4);call main_#t~mem62#1.base, main_#t~mem62#1.offset := read~$Pointer$(main_#t~mem61#1.base, main_#t~mem61#1.offset, 4);main_~_ha_head~0#1.base, main_~_ha_head~0#1.offset := main_#t~mem62#1.base, main_#t~mem62#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~mem61#1.base, main_#t~mem61#1.offset;havoc main_#t~mem62#1.base, main_#t~mem62#1.offset;call main_#t~mem63#1 := read~int(main_~_ha_head~0#1.base, 4 + main_~_ha_head~0#1.offset, 4);main_#t~post64#1 := main_#t~mem63#1;call write~int(1 + main_#t~post64#1, main_~_ha_head~0#1.base, 4 + main_~_ha_head~0#1.offset, 4);havoc main_#t~mem63#1;havoc main_#t~post64#1;call main_#t~mem65#1.base, main_#t~mem65#1.offset := read~$Pointer$(main_~_ha_head~0#1.base, main_~_ha_head~0#1.offset, 4);call write~$Pointer$(main_#t~mem65#1.base, main_#t~mem65#1.offset, main_~user~0#1.base, 24 + main_~user~0#1.offset, 4);havoc main_#t~mem65#1.base, main_#t~mem65#1.offset;call write~$Pointer$(0, 0, main_~user~0#1.base, 20 + main_~user~0#1.offset, 4);call main_#t~mem66#1.base, main_#t~mem66#1.offset := read~$Pointer$(main_~_ha_head~0#1.base, main_~_ha_head~0#1.offset, 4); {18248#(<= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-21 03:13:58,382 INFO L290 TraceCheckUtils]: 76: Hoare triple {18248#(<= |ULTIMATE.start_main_~i~0#1| 0)} assume main_#t~mem66#1.base != 0 || main_#t~mem66#1.offset != 0;havoc main_#t~mem66#1.base, main_#t~mem66#1.offset;call main_#t~mem67#1.base, main_#t~mem67#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~mem67#1.base, 12 + main_#t~mem67#1.offset, 4);havoc main_#t~mem67#1.base, main_#t~mem67#1.offset; {18248#(<= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-21 03:13:58,382 INFO L290 TraceCheckUtils]: 77: Hoare triple {18248#(<= |ULTIMATE.start_main_~i~0#1| 0)} 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~mem69#1 := read~int(main_~_ha_head~0#1.base, 4 + main_~_ha_head~0#1.offset, 4);call main_#t~mem68#1 := read~int(main_~_ha_head~0#1.base, 8 + main_~_ha_head~0#1.offset, 4);main_#t~short72#1 := main_#t~mem69#1 % 4294967296 >= 10 * (1 + main_#t~mem68#1) % 4294967296; {18248#(<= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-21 03:13:58,382 INFO L290 TraceCheckUtils]: 78: Hoare triple {18248#(<= |ULTIMATE.start_main_~i~0#1| 0)} assume main_#t~short72#1;call main_#t~mem70#1.base, main_#t~mem70#1.offset := read~$Pointer$(main_~user~0#1.base, 8 + main_~user~0#1.offset, 4);call main_#t~mem71#1 := read~int(main_#t~mem70#1.base, 36 + main_#t~mem70#1.offset, 4);main_#t~short72#1 := 0 == main_#t~mem71#1 % 4294967296; {18248#(<= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-21 03:13:58,382 INFO L290 TraceCheckUtils]: 79: Hoare triple {18248#(<= |ULTIMATE.start_main_~i~0#1| 0)} assume !main_#t~short72#1;havoc main_#t~mem69#1;havoc main_#t~mem68#1;havoc main_#t~mem70#1.base, main_#t~mem70#1.offset;havoc main_#t~mem71#1;havoc main_#t~short72#1; {18248#(<= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-21 03:13:58,383 INFO L290 TraceCheckUtils]: 80: Hoare triple {18248#(<= |ULTIMATE.start_main_~i~0#1| 0)} goto; {18248#(<= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-21 03:13:58,383 INFO L290 TraceCheckUtils]: 81: Hoare triple {18248#(<= |ULTIMATE.start_main_~i~0#1| 0)} goto; {18248#(<= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-21 03:13:58,383 INFO L290 TraceCheckUtils]: 82: Hoare triple {18248#(<= |ULTIMATE.start_main_~i~0#1| 0)} goto; {18248#(<= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-21 03:13:58,383 INFO L290 TraceCheckUtils]: 83: Hoare triple {18248#(<= |ULTIMATE.start_main_~i~0#1| 0)} goto; {18248#(<= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-21 03:13:58,384 INFO L290 TraceCheckUtils]: 84: Hoare triple {18248#(<= |ULTIMATE.start_main_~i~0#1| 0)} main_#t~post5#1 := main_~i~0#1; {18498#(<= |ULTIMATE.start_main_#t~post5#1| 0)} is VALID [2022-02-21 03:13:58,384 INFO L290 TraceCheckUtils]: 85: Hoare triple {18498#(<= |ULTIMATE.start_main_#t~post5#1| 0)} assume 1 + main_#t~post5#1 <= 2147483647; {18498#(<= |ULTIMATE.start_main_#t~post5#1| 0)} is VALID [2022-02-21 03:13:58,384 INFO L290 TraceCheckUtils]: 86: Hoare triple {18498#(<= |ULTIMATE.start_main_#t~post5#1| 0)} assume 1 + main_#t~post5#1 >= -2147483648;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; {18505#(<= |ULTIMATE.start_main_~i~0#1| 1)} is VALID [2022-02-21 03:13:58,385 INFO L290 TraceCheckUtils]: 87: Hoare triple {18505#(<= |ULTIMATE.start_main_~i~0#1| 1)} assume !!(main_~i~0#1 < 10);call main_#t~malloc6#1.base, main_#t~malloc6#1.offset := #Ultimate.allocOnHeap(40);main_~user~0#1.base, main_~user~0#1.offset := main_#t~malloc6#1.base, main_#t~malloc6#1.offset;havoc main_#t~malloc6#1.base, main_#t~malloc6#1.offset; {18505#(<= |ULTIMATE.start_main_~i~0#1| 1)} is VALID [2022-02-21 03:13:58,385 INFO L290 TraceCheckUtils]: 88: Hoare triple {18505#(<= |ULTIMATE.start_main_~i~0#1| 1)} assume !(main_~user~0#1.base == 0 && main_~user~0#1.offset == 0); {18505#(<= |ULTIMATE.start_main_~i~0#1| 1)} is VALID [2022-02-21 03:13:58,385 INFO L290 TraceCheckUtils]: 89: Hoare triple {18505#(<= |ULTIMATE.start_main_~i~0#1| 1)} call write~int(main_~i~0#1, main_~user~0#1.base, main_~user~0#1.offset, 4); {18505#(<= |ULTIMATE.start_main_~i~0#1| 1)} is VALID [2022-02-21 03:13:58,385 INFO L290 TraceCheckUtils]: 90: Hoare triple {18505#(<= |ULTIMATE.start_main_~i~0#1| 1)} assume main_~i~0#1 * main_~i~0#1 <= 2147483647; {18505#(<= |ULTIMATE.start_main_~i~0#1| 1)} is VALID [2022-02-21 03:13:58,386 INFO L290 TraceCheckUtils]: 91: Hoare triple {18505#(<= |ULTIMATE.start_main_~i~0#1| 1)} assume main_~i~0#1 * main_~i~0#1 >= -2147483648;call write~int(main_~i~0#1 * main_~i~0#1, main_~user~0#1.base, 4 + main_~user~0#1.offset, 4); {18505#(<= |ULTIMATE.start_main_~i~0#1| 1)} is VALID [2022-02-21 03:13:58,386 INFO L290 TraceCheckUtils]: 92: Hoare triple {18505#(<= |ULTIMATE.start_main_~i~0#1| 1)} havoc main_~_ha_hashv~0#1; {18505#(<= |ULTIMATE.start_main_~i~0#1| 1)} is VALID [2022-02-21 03:13:58,386 INFO L290 TraceCheckUtils]: 93: Hoare triple {18505#(<= |ULTIMATE.start_main_~i~0#1| 1)} goto; {18505#(<= |ULTIMATE.start_main_~i~0#1| 1)} is VALID [2022-02-21 03:13:58,386 INFO L290 TraceCheckUtils]: 94: Hoare triple {18505#(<= |ULTIMATE.start_main_~i~0#1| 1)} 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; {18505#(<= |ULTIMATE.start_main_~i~0#1| 1)} is VALID [2022-02-21 03:13:58,387 INFO L290 TraceCheckUtils]: 95: Hoare triple {18505#(<= |ULTIMATE.start_main_~i~0#1| 1)} assume !(main_~_hj_k~0#1 % 4294967296 >= 12); {18505#(<= |ULTIMATE.start_main_~i~0#1| 1)} is VALID [2022-02-21 03:13:58,387 INFO L290 TraceCheckUtils]: 96: Hoare triple {18505#(<= |ULTIMATE.start_main_~i~0#1| 1)} main_~_ha_hashv~0#1 := 4 + main_~_ha_hashv~0#1;main_#t~switch19#1 := 11 == main_~_hj_k~0#1; {18505#(<= |ULTIMATE.start_main_~i~0#1| 1)} is VALID [2022-02-21 03:13:58,387 INFO L290 TraceCheckUtils]: 97: Hoare triple {18505#(<= |ULTIMATE.start_main_~i~0#1| 1)} assume !main_#t~switch19#1; {18505#(<= |ULTIMATE.start_main_~i~0#1| 1)} is VALID [2022-02-21 03:13:58,387 INFO L290 TraceCheckUtils]: 98: Hoare triple {18505#(<= |ULTIMATE.start_main_~i~0#1| 1)} main_#t~switch19#1 := main_#t~switch19#1 || 10 == main_~_hj_k~0#1; {18505#(<= |ULTIMATE.start_main_~i~0#1| 1)} is VALID [2022-02-21 03:13:58,388 INFO L290 TraceCheckUtils]: 99: Hoare triple {18505#(<= |ULTIMATE.start_main_~i~0#1| 1)} assume !main_#t~switch19#1; {18505#(<= |ULTIMATE.start_main_~i~0#1| 1)} is VALID [2022-02-21 03:13:58,388 INFO L290 TraceCheckUtils]: 100: Hoare triple {18505#(<= |ULTIMATE.start_main_~i~0#1| 1)} main_#t~switch19#1 := main_#t~switch19#1 || 9 == main_~_hj_k~0#1; {18505#(<= |ULTIMATE.start_main_~i~0#1| 1)} is VALID [2022-02-21 03:13:58,388 INFO L290 TraceCheckUtils]: 101: Hoare triple {18505#(<= |ULTIMATE.start_main_~i~0#1| 1)} assume !main_#t~switch19#1; {18505#(<= |ULTIMATE.start_main_~i~0#1| 1)} is VALID [2022-02-21 03:13:58,388 INFO L290 TraceCheckUtils]: 102: Hoare triple {18505#(<= |ULTIMATE.start_main_~i~0#1| 1)} main_#t~switch19#1 := main_#t~switch19#1 || 8 == main_~_hj_k~0#1; {18505#(<= |ULTIMATE.start_main_~i~0#1| 1)} is VALID [2022-02-21 03:13:58,388 INFO L290 TraceCheckUtils]: 103: Hoare triple {18505#(<= |ULTIMATE.start_main_~i~0#1| 1)} assume !main_#t~switch19#1; {18505#(<= |ULTIMATE.start_main_~i~0#1| 1)} is VALID [2022-02-21 03:13:58,389 INFO L290 TraceCheckUtils]: 104: Hoare triple {18505#(<= |ULTIMATE.start_main_~i~0#1| 1)} main_#t~switch19#1 := main_#t~switch19#1 || 7 == main_~_hj_k~0#1; {18505#(<= |ULTIMATE.start_main_~i~0#1| 1)} is VALID [2022-02-21 03:13:58,389 INFO L290 TraceCheckUtils]: 105: Hoare triple {18505#(<= |ULTIMATE.start_main_~i~0#1| 1)} assume !main_#t~switch19#1; {18505#(<= |ULTIMATE.start_main_~i~0#1| 1)} is VALID [2022-02-21 03:13:58,389 INFO L290 TraceCheckUtils]: 106: Hoare triple {18505#(<= |ULTIMATE.start_main_~i~0#1| 1)} main_#t~switch19#1 := main_#t~switch19#1 || 6 == main_~_hj_k~0#1; {18505#(<= |ULTIMATE.start_main_~i~0#1| 1)} is VALID [2022-02-21 03:13:58,389 INFO L290 TraceCheckUtils]: 107: Hoare triple {18505#(<= |ULTIMATE.start_main_~i~0#1| 1)} assume !main_#t~switch19#1; {18505#(<= |ULTIMATE.start_main_~i~0#1| 1)} is VALID [2022-02-21 03:13:58,390 INFO L290 TraceCheckUtils]: 108: Hoare triple {18505#(<= |ULTIMATE.start_main_~i~0#1| 1)} main_#t~switch19#1 := main_#t~switch19#1 || 5 == main_~_hj_k~0#1; {18505#(<= |ULTIMATE.start_main_~i~0#1| 1)} is VALID [2022-02-21 03:13:58,390 INFO L290 TraceCheckUtils]: 109: Hoare triple {18505#(<= |ULTIMATE.start_main_~i~0#1| 1)} assume !main_#t~switch19#1; {18505#(<= |ULTIMATE.start_main_~i~0#1| 1)} is VALID [2022-02-21 03:13:58,390 INFO L290 TraceCheckUtils]: 110: Hoare triple {18505#(<= |ULTIMATE.start_main_~i~0#1| 1)} main_#t~switch19#1 := main_#t~switch19#1 || 4 == main_~_hj_k~0#1; {18505#(<= |ULTIMATE.start_main_~i~0#1| 1)} is VALID [2022-02-21 03:13:58,390 INFO L290 TraceCheckUtils]: 111: Hoare triple {18505#(<= |ULTIMATE.start_main_~i~0#1| 1)} assume main_#t~switch19#1;call main_#t~mem27#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~mem27#1 % 256);havoc main_#t~mem27#1; {18505#(<= |ULTIMATE.start_main_~i~0#1| 1)} is VALID [2022-02-21 03:13:58,391 INFO L290 TraceCheckUtils]: 112: Hoare triple {18505#(<= |ULTIMATE.start_main_~i~0#1| 1)} main_#t~switch19#1 := main_#t~switch19#1 || 3 == main_~_hj_k~0#1; {18505#(<= |ULTIMATE.start_main_~i~0#1| 1)} is VALID [2022-02-21 03:13:58,391 INFO L290 TraceCheckUtils]: 113: Hoare triple {18505#(<= |ULTIMATE.start_main_~i~0#1| 1)} assume main_#t~switch19#1;call main_#t~mem28#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~mem28#1 % 256);havoc main_#t~mem28#1; {18505#(<= |ULTIMATE.start_main_~i~0#1| 1)} is VALID [2022-02-21 03:13:58,391 INFO L290 TraceCheckUtils]: 114: Hoare triple {18505#(<= |ULTIMATE.start_main_~i~0#1| 1)} main_#t~switch19#1 := main_#t~switch19#1 || 2 == main_~_hj_k~0#1; {18505#(<= |ULTIMATE.start_main_~i~0#1| 1)} is VALID [2022-02-21 03:13:58,391 INFO L290 TraceCheckUtils]: 115: Hoare triple {18505#(<= |ULTIMATE.start_main_~i~0#1| 1)} assume main_#t~switch19#1;call main_#t~mem29#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~mem29#1 % 256);havoc main_#t~mem29#1; {18505#(<= |ULTIMATE.start_main_~i~0#1| 1)} is VALID [2022-02-21 03:13:58,392 INFO L290 TraceCheckUtils]: 116: Hoare triple {18505#(<= |ULTIMATE.start_main_~i~0#1| 1)} main_#t~switch19#1 := main_#t~switch19#1 || 1 == main_~_hj_k~0#1; {18505#(<= |ULTIMATE.start_main_~i~0#1| 1)} is VALID [2022-02-21 03:13:58,392 INFO L290 TraceCheckUtils]: 117: Hoare triple {18505#(<= |ULTIMATE.start_main_~i~0#1| 1)} assume main_#t~switch19#1;call main_#t~mem30#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~mem30#1 % 256;havoc main_#t~mem30#1; {18505#(<= |ULTIMATE.start_main_~i~0#1| 1)} is VALID [2022-02-21 03:13:58,392 INFO L290 TraceCheckUtils]: 118: Hoare triple {18505#(<= |ULTIMATE.start_main_~i~0#1| 1)} havoc main_#t~switch19#1; {18505#(<= |ULTIMATE.start_main_~i~0#1| 1)} is VALID [2022-02-21 03:13:58,392 INFO L290 TraceCheckUtils]: 119: Hoare triple {18505#(<= |ULTIMATE.start_main_~i~0#1| 1)} 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)))); {18505#(<= |ULTIMATE.start_main_~i~0#1| 1)} is VALID [2022-02-21 03:13:58,393 INFO L290 TraceCheckUtils]: 120: Hoare triple {18505#(<= |ULTIMATE.start_main_~i~0#1| 1)} goto; {18505#(<= |ULTIMATE.start_main_~i~0#1| 1)} is VALID [2022-02-21 03:13:58,393 INFO L290 TraceCheckUtils]: 121: Hoare triple {18505#(<= |ULTIMATE.start_main_~i~0#1| 1)} goto; {18505#(<= |ULTIMATE.start_main_~i~0#1| 1)} is VALID [2022-02-21 03:13:58,393 INFO L290 TraceCheckUtils]: 122: Hoare triple {18505#(<= |ULTIMATE.start_main_~i~0#1| 1)} goto; {18505#(<= |ULTIMATE.start_main_~i~0#1| 1)} is VALID [2022-02-21 03:13:58,393 INFO L290 TraceCheckUtils]: 123: Hoare triple {18505#(<= |ULTIMATE.start_main_~i~0#1| 1)} 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); {18505#(<= |ULTIMATE.start_main_~i~0#1| 1)} is VALID [2022-02-21 03:13:58,394 INFO L290 TraceCheckUtils]: 124: Hoare triple {18505#(<= |ULTIMATE.start_main_~i~0#1| 1)} assume !(main_~users~0#1.base == 0 && main_~users~0#1.offset == 0);call main_#t~mem48#1.base, main_#t~mem48#1.offset := read~$Pointer$(main_~users~0#1.base, 8 + main_~users~0#1.offset, 4);call write~$Pointer$(main_#t~mem48#1.base, main_#t~mem48#1.offset, main_~user~0#1.base, 8 + main_~user~0#1.offset, 4);havoc main_#t~mem48#1.base, main_#t~mem48#1.offset; {18505#(<= |ULTIMATE.start_main_~i~0#1| 1)} is VALID [2022-02-21 03:13:58,394 INFO L290 TraceCheckUtils]: 125: Hoare triple {18505#(<= |ULTIMATE.start_main_~i~0#1| 1)} call write~$Pointer$(0, 0, main_~user~0#1.base, 16 + main_~user~0#1.offset, 4);call main_#t~mem49#1.base, main_#t~mem49#1.offset := read~$Pointer$(main_~users~0#1.base, 8 + main_~users~0#1.offset, 4);call main_#t~mem50#1.base, main_#t~mem50#1.offset := read~$Pointer$(main_#t~mem49#1.base, 16 + main_#t~mem49#1.offset, 4);call main_#t~mem51#1.base, main_#t~mem51#1.offset := read~$Pointer$(main_~users~0#1.base, 8 + main_~users~0#1.offset, 4);call main_#t~mem52#1 := read~int(main_#t~mem51#1.base, 20 + main_#t~mem51#1.offset, 4);call write~$Pointer$(main_#t~mem50#1.base, main_#t~mem50#1.offset - main_#t~mem52#1, main_~user~0#1.base, 12 + main_~user~0#1.offset, 4);havoc main_#t~mem49#1.base, main_#t~mem49#1.offset;havoc main_#t~mem50#1.base, main_#t~mem50#1.offset;havoc main_#t~mem51#1.base, main_#t~mem51#1.offset;havoc main_#t~mem52#1;call main_#t~mem53#1.base, main_#t~mem53#1.offset := read~$Pointer$(main_~users~0#1.base, 8 + main_~users~0#1.offset, 4);call main_#t~mem54#1.base, main_#t~mem54#1.offset := read~$Pointer$(main_#t~mem53#1.base, 16 + main_#t~mem53#1.offset, 4);call write~$Pointer$(main_~user~0#1.base, main_~user~0#1.offset, main_#t~mem54#1.base, 8 + main_#t~mem54#1.offset, 4);havoc main_#t~mem53#1.base, main_#t~mem53#1.offset;havoc main_#t~mem54#1.base, main_#t~mem54#1.offset;call main_#t~mem55#1.base, main_#t~mem55#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~mem55#1.base, 16 + main_#t~mem55#1.offset, 4);havoc main_#t~mem55#1.base, main_#t~mem55#1.offset; {18505#(<= |ULTIMATE.start_main_~i~0#1| 1)} is VALID [2022-02-21 03:13:58,394 INFO L290 TraceCheckUtils]: 126: Hoare triple {18505#(<= |ULTIMATE.start_main_~i~0#1| 1)} goto; {18505#(<= |ULTIMATE.start_main_~i~0#1| 1)} is VALID [2022-02-21 03:13:58,394 INFO L290 TraceCheckUtils]: 127: Hoare triple {18505#(<= |ULTIMATE.start_main_~i~0#1| 1)} havoc main_~_ha_bkt~0#1;call main_#t~mem56#1.base, main_#t~mem56#1.offset := read~$Pointer$(main_~users~0#1.base, 8 + main_~users~0#1.offset, 4);call main_#t~mem57#1 := read~int(main_#t~mem56#1.base, 12 + main_#t~mem56#1.offset, 4);main_#t~post58#1 := main_#t~mem57#1;call write~int(1 + main_#t~post58#1, main_#t~mem56#1.base, 12 + main_#t~mem56#1.offset, 4);havoc main_#t~mem56#1.base, main_#t~mem56#1.offset;havoc main_#t~mem57#1;havoc main_#t~post58#1; {18505#(<= |ULTIMATE.start_main_~i~0#1| 1)} is VALID [2022-02-21 03:13:58,395 INFO L290 TraceCheckUtils]: 128: Hoare triple {18505#(<= |ULTIMATE.start_main_~i~0#1| 1)} call main_#t~mem59#1.base, main_#t~mem59#1.offset := read~$Pointer$(main_~users~0#1.base, 8 + main_~users~0#1.offset, 4);call main_#t~mem60#1 := read~int(main_#t~mem59#1.base, 4 + main_#t~mem59#1.offset, 4);main_~_ha_bkt~0#1 := (if 0 == main_~_ha_hashv~0#1 || 0 == main_#t~mem60#1 - 1 then 0 else (if 1 == main_#t~mem60#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~mem60#1 - 1))) else (if 1 == main_~_ha_hashv~0#1 then (if 1 == main_#t~mem60#1 - 1 || 0 == main_#t~mem60#1 - 1 then main_#t~mem60#1 - 1 else (if main_#t~mem60#1 - 1 >= 0 then (main_#t~mem60#1 - 1) % 2 else ~bitwiseAnd(main_~_ha_hashv~0#1, main_#t~mem60#1 - 1))) else ~bitwiseAnd(main_~_ha_hashv~0#1, main_#t~mem60#1 - 1))));havoc main_#t~mem59#1.base, main_#t~mem59#1.offset;havoc main_#t~mem60#1; {18505#(<= |ULTIMATE.start_main_~i~0#1| 1)} is VALID [2022-02-21 03:13:58,395 INFO L290 TraceCheckUtils]: 129: Hoare triple {18505#(<= |ULTIMATE.start_main_~i~0#1| 1)} goto; {18505#(<= |ULTIMATE.start_main_~i~0#1| 1)} is VALID [2022-02-21 03:13:58,395 INFO L290 TraceCheckUtils]: 130: Hoare triple {18505#(<= |ULTIMATE.start_main_~i~0#1| 1)} call main_#t~mem61#1.base, main_#t~mem61#1.offset := read~$Pointer$(main_~users~0#1.base, 8 + main_~users~0#1.offset, 4);call main_#t~mem62#1.base, main_#t~mem62#1.offset := read~$Pointer$(main_#t~mem61#1.base, main_#t~mem61#1.offset, 4);main_~_ha_head~0#1.base, main_~_ha_head~0#1.offset := main_#t~mem62#1.base, main_#t~mem62#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~mem61#1.base, main_#t~mem61#1.offset;havoc main_#t~mem62#1.base, main_#t~mem62#1.offset;call main_#t~mem63#1 := read~int(main_~_ha_head~0#1.base, 4 + main_~_ha_head~0#1.offset, 4);main_#t~post64#1 := main_#t~mem63#1;call write~int(1 + main_#t~post64#1, main_~_ha_head~0#1.base, 4 + main_~_ha_head~0#1.offset, 4);havoc main_#t~mem63#1;havoc main_#t~post64#1;call main_#t~mem65#1.base, main_#t~mem65#1.offset := read~$Pointer$(main_~_ha_head~0#1.base, main_~_ha_head~0#1.offset, 4);call write~$Pointer$(main_#t~mem65#1.base, main_#t~mem65#1.offset, main_~user~0#1.base, 24 + main_~user~0#1.offset, 4);havoc main_#t~mem65#1.base, main_#t~mem65#1.offset;call write~$Pointer$(0, 0, main_~user~0#1.base, 20 + main_~user~0#1.offset, 4);call main_#t~mem66#1.base, main_#t~mem66#1.offset := read~$Pointer$(main_~_ha_head~0#1.base, main_~_ha_head~0#1.offset, 4); {18505#(<= |ULTIMATE.start_main_~i~0#1| 1)} is VALID [2022-02-21 03:13:58,395 INFO L290 TraceCheckUtils]: 131: Hoare triple {18505#(<= |ULTIMATE.start_main_~i~0#1| 1)} assume main_#t~mem66#1.base != 0 || main_#t~mem66#1.offset != 0;havoc main_#t~mem66#1.base, main_#t~mem66#1.offset;call main_#t~mem67#1.base, main_#t~mem67#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~mem67#1.base, 12 + main_#t~mem67#1.offset, 4);havoc main_#t~mem67#1.base, main_#t~mem67#1.offset; {18505#(<= |ULTIMATE.start_main_~i~0#1| 1)} is VALID [2022-02-21 03:13:58,395 INFO L290 TraceCheckUtils]: 132: Hoare triple {18505#(<= |ULTIMATE.start_main_~i~0#1| 1)} 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~mem69#1 := read~int(main_~_ha_head~0#1.base, 4 + main_~_ha_head~0#1.offset, 4);call main_#t~mem68#1 := read~int(main_~_ha_head~0#1.base, 8 + main_~_ha_head~0#1.offset, 4);main_#t~short72#1 := main_#t~mem69#1 % 4294967296 >= 10 * (1 + main_#t~mem68#1) % 4294967296; {18505#(<= |ULTIMATE.start_main_~i~0#1| 1)} is VALID [2022-02-21 03:13:58,396 INFO L290 TraceCheckUtils]: 133: Hoare triple {18505#(<= |ULTIMATE.start_main_~i~0#1| 1)} assume main_#t~short72#1;call main_#t~mem70#1.base, main_#t~mem70#1.offset := read~$Pointer$(main_~user~0#1.base, 8 + main_~user~0#1.offset, 4);call main_#t~mem71#1 := read~int(main_#t~mem70#1.base, 36 + main_#t~mem70#1.offset, 4);main_#t~short72#1 := 0 == main_#t~mem71#1 % 4294967296; {18505#(<= |ULTIMATE.start_main_~i~0#1| 1)} is VALID [2022-02-21 03:13:58,396 INFO L290 TraceCheckUtils]: 134: Hoare triple {18505#(<= |ULTIMATE.start_main_~i~0#1| 1)} assume !main_#t~short72#1;havoc main_#t~mem69#1;havoc main_#t~mem68#1;havoc main_#t~mem70#1.base, main_#t~mem70#1.offset;havoc main_#t~mem71#1;havoc main_#t~short72#1; {18505#(<= |ULTIMATE.start_main_~i~0#1| 1)} is VALID [2022-02-21 03:13:58,396 INFO L290 TraceCheckUtils]: 135: Hoare triple {18505#(<= |ULTIMATE.start_main_~i~0#1| 1)} goto; {18505#(<= |ULTIMATE.start_main_~i~0#1| 1)} is VALID [2022-02-21 03:13:58,396 INFO L290 TraceCheckUtils]: 136: Hoare triple {18505#(<= |ULTIMATE.start_main_~i~0#1| 1)} goto; {18505#(<= |ULTIMATE.start_main_~i~0#1| 1)} is VALID [2022-02-21 03:13:58,397 INFO L290 TraceCheckUtils]: 137: Hoare triple {18505#(<= |ULTIMATE.start_main_~i~0#1| 1)} goto; {18505#(<= |ULTIMATE.start_main_~i~0#1| 1)} is VALID [2022-02-21 03:13:58,397 INFO L290 TraceCheckUtils]: 138: Hoare triple {18505#(<= |ULTIMATE.start_main_~i~0#1| 1)} goto; {18505#(<= |ULTIMATE.start_main_~i~0#1| 1)} is VALID [2022-02-21 03:13:58,397 INFO L290 TraceCheckUtils]: 139: Hoare triple {18505#(<= |ULTIMATE.start_main_~i~0#1| 1)} main_#t~post5#1 := main_~i~0#1; {18665#(<= |ULTIMATE.start_main_#t~post5#1| 1)} is VALID [2022-02-21 03:13:58,397 INFO L290 TraceCheckUtils]: 140: Hoare triple {18665#(<= |ULTIMATE.start_main_#t~post5#1| 1)} assume 1 + main_#t~post5#1 <= 2147483647; {18665#(<= |ULTIMATE.start_main_#t~post5#1| 1)} is VALID [2022-02-21 03:13:58,398 INFO L290 TraceCheckUtils]: 141: Hoare triple {18665#(<= |ULTIMATE.start_main_#t~post5#1| 1)} assume 1 + main_#t~post5#1 >= -2147483648;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; {18672#(<= |ULTIMATE.start_main_~i~0#1| 2)} is VALID [2022-02-21 03:13:58,398 INFO L290 TraceCheckUtils]: 142: Hoare triple {18672#(<= |ULTIMATE.start_main_~i~0#1| 2)} assume !!(main_~i~0#1 < 10);call main_#t~malloc6#1.base, main_#t~malloc6#1.offset := #Ultimate.allocOnHeap(40);main_~user~0#1.base, main_~user~0#1.offset := main_#t~malloc6#1.base, main_#t~malloc6#1.offset;havoc main_#t~malloc6#1.base, main_#t~malloc6#1.offset; {18672#(<= |ULTIMATE.start_main_~i~0#1| 2)} is VALID [2022-02-21 03:13:58,398 INFO L290 TraceCheckUtils]: 143: Hoare triple {18672#(<= |ULTIMATE.start_main_~i~0#1| 2)} assume !(main_~user~0#1.base == 0 && main_~user~0#1.offset == 0); {18672#(<= |ULTIMATE.start_main_~i~0#1| 2)} is VALID [2022-02-21 03:13:58,399 INFO L290 TraceCheckUtils]: 144: Hoare triple {18672#(<= |ULTIMATE.start_main_~i~0#1| 2)} call write~int(main_~i~0#1, main_~user~0#1.base, main_~user~0#1.offset, 4); {18672#(<= |ULTIMATE.start_main_~i~0#1| 2)} is VALID [2022-02-21 03:13:58,399 INFO L290 TraceCheckUtils]: 145: Hoare triple {18672#(<= |ULTIMATE.start_main_~i~0#1| 2)} assume main_~i~0#1 * main_~i~0#1 <= 2147483647; {18672#(<= |ULTIMATE.start_main_~i~0#1| 2)} is VALID [2022-02-21 03:13:58,399 INFO L290 TraceCheckUtils]: 146: Hoare triple {18672#(<= |ULTIMATE.start_main_~i~0#1| 2)} assume main_~i~0#1 * main_~i~0#1 >= -2147483648;call write~int(main_~i~0#1 * main_~i~0#1, main_~user~0#1.base, 4 + main_~user~0#1.offset, 4); {18672#(<= |ULTIMATE.start_main_~i~0#1| 2)} is VALID [2022-02-21 03:13:58,399 INFO L290 TraceCheckUtils]: 147: Hoare triple {18672#(<= |ULTIMATE.start_main_~i~0#1| 2)} havoc main_~_ha_hashv~0#1; {18672#(<= |ULTIMATE.start_main_~i~0#1| 2)} is VALID [2022-02-21 03:13:58,399 INFO L290 TraceCheckUtils]: 148: Hoare triple {18672#(<= |ULTIMATE.start_main_~i~0#1| 2)} goto; {18672#(<= |ULTIMATE.start_main_~i~0#1| 2)} is VALID [2022-02-21 03:13:58,400 INFO L290 TraceCheckUtils]: 149: Hoare triple {18672#(<= |ULTIMATE.start_main_~i~0#1| 2)} 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; {18672#(<= |ULTIMATE.start_main_~i~0#1| 2)} is VALID [2022-02-21 03:13:58,400 INFO L290 TraceCheckUtils]: 150: Hoare triple {18672#(<= |ULTIMATE.start_main_~i~0#1| 2)} assume !(main_~_hj_k~0#1 % 4294967296 >= 12); {18672#(<= |ULTIMATE.start_main_~i~0#1| 2)} is VALID [2022-02-21 03:13:58,400 INFO L290 TraceCheckUtils]: 151: Hoare triple {18672#(<= |ULTIMATE.start_main_~i~0#1| 2)} main_~_ha_hashv~0#1 := 4 + main_~_ha_hashv~0#1;main_#t~switch19#1 := 11 == main_~_hj_k~0#1; {18672#(<= |ULTIMATE.start_main_~i~0#1| 2)} is VALID [2022-02-21 03:13:58,400 INFO L290 TraceCheckUtils]: 152: Hoare triple {18672#(<= |ULTIMATE.start_main_~i~0#1| 2)} assume !main_#t~switch19#1; {18672#(<= |ULTIMATE.start_main_~i~0#1| 2)} is VALID [2022-02-21 03:13:58,401 INFO L290 TraceCheckUtils]: 153: Hoare triple {18672#(<= |ULTIMATE.start_main_~i~0#1| 2)} main_#t~switch19#1 := main_#t~switch19#1 || 10 == main_~_hj_k~0#1; {18672#(<= |ULTIMATE.start_main_~i~0#1| 2)} is VALID [2022-02-21 03:13:58,401 INFO L290 TraceCheckUtils]: 154: Hoare triple {18672#(<= |ULTIMATE.start_main_~i~0#1| 2)} assume !main_#t~switch19#1; {18672#(<= |ULTIMATE.start_main_~i~0#1| 2)} is VALID [2022-02-21 03:13:58,401 INFO L290 TraceCheckUtils]: 155: Hoare triple {18672#(<= |ULTIMATE.start_main_~i~0#1| 2)} main_#t~switch19#1 := main_#t~switch19#1 || 9 == main_~_hj_k~0#1; {18672#(<= |ULTIMATE.start_main_~i~0#1| 2)} is VALID [2022-02-21 03:13:58,401 INFO L290 TraceCheckUtils]: 156: Hoare triple {18672#(<= |ULTIMATE.start_main_~i~0#1| 2)} assume !main_#t~switch19#1; {18672#(<= |ULTIMATE.start_main_~i~0#1| 2)} is VALID [2022-02-21 03:13:58,402 INFO L290 TraceCheckUtils]: 157: Hoare triple {18672#(<= |ULTIMATE.start_main_~i~0#1| 2)} main_#t~switch19#1 := main_#t~switch19#1 || 8 == main_~_hj_k~0#1; {18672#(<= |ULTIMATE.start_main_~i~0#1| 2)} is VALID [2022-02-21 03:13:58,402 INFO L290 TraceCheckUtils]: 158: Hoare triple {18672#(<= |ULTIMATE.start_main_~i~0#1| 2)} assume !main_#t~switch19#1; {18672#(<= |ULTIMATE.start_main_~i~0#1| 2)} is VALID [2022-02-21 03:13:58,402 INFO L290 TraceCheckUtils]: 159: Hoare triple {18672#(<= |ULTIMATE.start_main_~i~0#1| 2)} main_#t~switch19#1 := main_#t~switch19#1 || 7 == main_~_hj_k~0#1; {18672#(<= |ULTIMATE.start_main_~i~0#1| 2)} is VALID [2022-02-21 03:13:58,402 INFO L290 TraceCheckUtils]: 160: Hoare triple {18672#(<= |ULTIMATE.start_main_~i~0#1| 2)} assume !main_#t~switch19#1; {18672#(<= |ULTIMATE.start_main_~i~0#1| 2)} is VALID [2022-02-21 03:13:58,403 INFO L290 TraceCheckUtils]: 161: Hoare triple {18672#(<= |ULTIMATE.start_main_~i~0#1| 2)} main_#t~switch19#1 := main_#t~switch19#1 || 6 == main_~_hj_k~0#1; {18672#(<= |ULTIMATE.start_main_~i~0#1| 2)} is VALID [2022-02-21 03:13:58,403 INFO L290 TraceCheckUtils]: 162: Hoare triple {18672#(<= |ULTIMATE.start_main_~i~0#1| 2)} assume !main_#t~switch19#1; {18672#(<= |ULTIMATE.start_main_~i~0#1| 2)} is VALID [2022-02-21 03:13:58,403 INFO L290 TraceCheckUtils]: 163: Hoare triple {18672#(<= |ULTIMATE.start_main_~i~0#1| 2)} main_#t~switch19#1 := main_#t~switch19#1 || 5 == main_~_hj_k~0#1; {18672#(<= |ULTIMATE.start_main_~i~0#1| 2)} is VALID [2022-02-21 03:13:58,403 INFO L290 TraceCheckUtils]: 164: Hoare triple {18672#(<= |ULTIMATE.start_main_~i~0#1| 2)} assume !main_#t~switch19#1; {18672#(<= |ULTIMATE.start_main_~i~0#1| 2)} is VALID [2022-02-21 03:13:58,404 INFO L290 TraceCheckUtils]: 165: Hoare triple {18672#(<= |ULTIMATE.start_main_~i~0#1| 2)} main_#t~switch19#1 := main_#t~switch19#1 || 4 == main_~_hj_k~0#1; {18672#(<= |ULTIMATE.start_main_~i~0#1| 2)} is VALID [2022-02-21 03:13:58,404 INFO L290 TraceCheckUtils]: 166: Hoare triple {18672#(<= |ULTIMATE.start_main_~i~0#1| 2)} assume main_#t~switch19#1;call main_#t~mem27#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~mem27#1 % 256);havoc main_#t~mem27#1; {18672#(<= |ULTIMATE.start_main_~i~0#1| 2)} is VALID [2022-02-21 03:13:58,404 INFO L290 TraceCheckUtils]: 167: Hoare triple {18672#(<= |ULTIMATE.start_main_~i~0#1| 2)} main_#t~switch19#1 := main_#t~switch19#1 || 3 == main_~_hj_k~0#1; {18672#(<= |ULTIMATE.start_main_~i~0#1| 2)} is VALID [2022-02-21 03:13:58,404 INFO L290 TraceCheckUtils]: 168: Hoare triple {18672#(<= |ULTIMATE.start_main_~i~0#1| 2)} assume main_#t~switch19#1;call main_#t~mem28#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~mem28#1 % 256);havoc main_#t~mem28#1; {18672#(<= |ULTIMATE.start_main_~i~0#1| 2)} is VALID [2022-02-21 03:13:58,405 INFO L290 TraceCheckUtils]: 169: Hoare triple {18672#(<= |ULTIMATE.start_main_~i~0#1| 2)} main_#t~switch19#1 := main_#t~switch19#1 || 2 == main_~_hj_k~0#1; {18672#(<= |ULTIMATE.start_main_~i~0#1| 2)} is VALID [2022-02-21 03:13:58,405 INFO L290 TraceCheckUtils]: 170: Hoare triple {18672#(<= |ULTIMATE.start_main_~i~0#1| 2)} assume main_#t~switch19#1;call main_#t~mem29#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~mem29#1 % 256);havoc main_#t~mem29#1; {18672#(<= |ULTIMATE.start_main_~i~0#1| 2)} is VALID [2022-02-21 03:13:58,405 INFO L290 TraceCheckUtils]: 171: Hoare triple {18672#(<= |ULTIMATE.start_main_~i~0#1| 2)} main_#t~switch19#1 := main_#t~switch19#1 || 1 == main_~_hj_k~0#1; {18672#(<= |ULTIMATE.start_main_~i~0#1| 2)} is VALID [2022-02-21 03:13:58,405 INFO L290 TraceCheckUtils]: 172: Hoare triple {18672#(<= |ULTIMATE.start_main_~i~0#1| 2)} assume main_#t~switch19#1;call main_#t~mem30#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~mem30#1 % 256;havoc main_#t~mem30#1; {18672#(<= |ULTIMATE.start_main_~i~0#1| 2)} is VALID [2022-02-21 03:13:58,405 INFO L290 TraceCheckUtils]: 173: Hoare triple {18672#(<= |ULTIMATE.start_main_~i~0#1| 2)} havoc main_#t~switch19#1; {18672#(<= |ULTIMATE.start_main_~i~0#1| 2)} is VALID [2022-02-21 03:13:58,406 INFO L290 TraceCheckUtils]: 174: Hoare triple {18672#(<= |ULTIMATE.start_main_~i~0#1| 2)} 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)))); {18672#(<= |ULTIMATE.start_main_~i~0#1| 2)} is VALID [2022-02-21 03:13:58,406 INFO L290 TraceCheckUtils]: 175: Hoare triple {18672#(<= |ULTIMATE.start_main_~i~0#1| 2)} goto; {18672#(<= |ULTIMATE.start_main_~i~0#1| 2)} is VALID [2022-02-21 03:13:58,406 INFO L290 TraceCheckUtils]: 176: Hoare triple {18672#(<= |ULTIMATE.start_main_~i~0#1| 2)} goto; {18672#(<= |ULTIMATE.start_main_~i~0#1| 2)} is VALID [2022-02-21 03:13:58,406 INFO L290 TraceCheckUtils]: 177: Hoare triple {18672#(<= |ULTIMATE.start_main_~i~0#1| 2)} goto; {18672#(<= |ULTIMATE.start_main_~i~0#1| 2)} is VALID [2022-02-21 03:13:58,407 INFO L290 TraceCheckUtils]: 178: Hoare triple {18672#(<= |ULTIMATE.start_main_~i~0#1| 2)} 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); {18672#(<= |ULTIMATE.start_main_~i~0#1| 2)} is VALID [2022-02-21 03:13:58,407 INFO L290 TraceCheckUtils]: 179: Hoare triple {18672#(<= |ULTIMATE.start_main_~i~0#1| 2)} assume !(main_~users~0#1.base == 0 && main_~users~0#1.offset == 0);call main_#t~mem48#1.base, main_#t~mem48#1.offset := read~$Pointer$(main_~users~0#1.base, 8 + main_~users~0#1.offset, 4);call write~$Pointer$(main_#t~mem48#1.base, main_#t~mem48#1.offset, main_~user~0#1.base, 8 + main_~user~0#1.offset, 4);havoc main_#t~mem48#1.base, main_#t~mem48#1.offset; {18672#(<= |ULTIMATE.start_main_~i~0#1| 2)} is VALID [2022-02-21 03:13:58,407 INFO L290 TraceCheckUtils]: 180: Hoare triple {18672#(<= |ULTIMATE.start_main_~i~0#1| 2)} call write~$Pointer$(0, 0, main_~user~0#1.base, 16 + main_~user~0#1.offset, 4);call main_#t~mem49#1.base, main_#t~mem49#1.offset := read~$Pointer$(main_~users~0#1.base, 8 + main_~users~0#1.offset, 4);call main_#t~mem50#1.base, main_#t~mem50#1.offset := read~$Pointer$(main_#t~mem49#1.base, 16 + main_#t~mem49#1.offset, 4);call main_#t~mem51#1.base, main_#t~mem51#1.offset := read~$Pointer$(main_~users~0#1.base, 8 + main_~users~0#1.offset, 4);call main_#t~mem52#1 := read~int(main_#t~mem51#1.base, 20 + main_#t~mem51#1.offset, 4);call write~$Pointer$(main_#t~mem50#1.base, main_#t~mem50#1.offset - main_#t~mem52#1, main_~user~0#1.base, 12 + main_~user~0#1.offset, 4);havoc main_#t~mem49#1.base, main_#t~mem49#1.offset;havoc main_#t~mem50#1.base, main_#t~mem50#1.offset;havoc main_#t~mem51#1.base, main_#t~mem51#1.offset;havoc main_#t~mem52#1;call main_#t~mem53#1.base, main_#t~mem53#1.offset := read~$Pointer$(main_~users~0#1.base, 8 + main_~users~0#1.offset, 4);call main_#t~mem54#1.base, main_#t~mem54#1.offset := read~$Pointer$(main_#t~mem53#1.base, 16 + main_#t~mem53#1.offset, 4);call write~$Pointer$(main_~user~0#1.base, main_~user~0#1.offset, main_#t~mem54#1.base, 8 + main_#t~mem54#1.offset, 4);havoc main_#t~mem53#1.base, main_#t~mem53#1.offset;havoc main_#t~mem54#1.base, main_#t~mem54#1.offset;call main_#t~mem55#1.base, main_#t~mem55#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~mem55#1.base, 16 + main_#t~mem55#1.offset, 4);havoc main_#t~mem55#1.base, main_#t~mem55#1.offset; {18672#(<= |ULTIMATE.start_main_~i~0#1| 2)} is VALID [2022-02-21 03:13:58,407 INFO L290 TraceCheckUtils]: 181: Hoare triple {18672#(<= |ULTIMATE.start_main_~i~0#1| 2)} goto; {18672#(<= |ULTIMATE.start_main_~i~0#1| 2)} is VALID [2022-02-21 03:13:58,408 INFO L290 TraceCheckUtils]: 182: Hoare triple {18672#(<= |ULTIMATE.start_main_~i~0#1| 2)} havoc main_~_ha_bkt~0#1;call main_#t~mem56#1.base, main_#t~mem56#1.offset := read~$Pointer$(main_~users~0#1.base, 8 + main_~users~0#1.offset, 4);call main_#t~mem57#1 := read~int(main_#t~mem56#1.base, 12 + main_#t~mem56#1.offset, 4);main_#t~post58#1 := main_#t~mem57#1;call write~int(1 + main_#t~post58#1, main_#t~mem56#1.base, 12 + main_#t~mem56#1.offset, 4);havoc main_#t~mem56#1.base, main_#t~mem56#1.offset;havoc main_#t~mem57#1;havoc main_#t~post58#1; {18672#(<= |ULTIMATE.start_main_~i~0#1| 2)} is VALID [2022-02-21 03:13:58,408 INFO L290 TraceCheckUtils]: 183: Hoare triple {18672#(<= |ULTIMATE.start_main_~i~0#1| 2)} call main_#t~mem59#1.base, main_#t~mem59#1.offset := read~$Pointer$(main_~users~0#1.base, 8 + main_~users~0#1.offset, 4);call main_#t~mem60#1 := read~int(main_#t~mem59#1.base, 4 + main_#t~mem59#1.offset, 4);main_~_ha_bkt~0#1 := (if 0 == main_~_ha_hashv~0#1 || 0 == main_#t~mem60#1 - 1 then 0 else (if 1 == main_#t~mem60#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~mem60#1 - 1))) else (if 1 == main_~_ha_hashv~0#1 then (if 1 == main_#t~mem60#1 - 1 || 0 == main_#t~mem60#1 - 1 then main_#t~mem60#1 - 1 else (if main_#t~mem60#1 - 1 >= 0 then (main_#t~mem60#1 - 1) % 2 else ~bitwiseAnd(main_~_ha_hashv~0#1, main_#t~mem60#1 - 1))) else ~bitwiseAnd(main_~_ha_hashv~0#1, main_#t~mem60#1 - 1))));havoc main_#t~mem59#1.base, main_#t~mem59#1.offset;havoc main_#t~mem60#1; {18672#(<= |ULTIMATE.start_main_~i~0#1| 2)} is VALID [2022-02-21 03:13:58,408 INFO L290 TraceCheckUtils]: 184: Hoare triple {18672#(<= |ULTIMATE.start_main_~i~0#1| 2)} goto; {18672#(<= |ULTIMATE.start_main_~i~0#1| 2)} is VALID [2022-02-21 03:13:58,408 INFO L290 TraceCheckUtils]: 185: Hoare triple {18672#(<= |ULTIMATE.start_main_~i~0#1| 2)} call main_#t~mem61#1.base, main_#t~mem61#1.offset := read~$Pointer$(main_~users~0#1.base, 8 + main_~users~0#1.offset, 4);call main_#t~mem62#1.base, main_#t~mem62#1.offset := read~$Pointer$(main_#t~mem61#1.base, main_#t~mem61#1.offset, 4);main_~_ha_head~0#1.base, main_~_ha_head~0#1.offset := main_#t~mem62#1.base, main_#t~mem62#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~mem61#1.base, main_#t~mem61#1.offset;havoc main_#t~mem62#1.base, main_#t~mem62#1.offset;call main_#t~mem63#1 := read~int(main_~_ha_head~0#1.base, 4 + main_~_ha_head~0#1.offset, 4);main_#t~post64#1 := main_#t~mem63#1;call write~int(1 + main_#t~post64#1, main_~_ha_head~0#1.base, 4 + main_~_ha_head~0#1.offset, 4);havoc main_#t~mem63#1;havoc main_#t~post64#1;call main_#t~mem65#1.base, main_#t~mem65#1.offset := read~$Pointer$(main_~_ha_head~0#1.base, main_~_ha_head~0#1.offset, 4);call write~$Pointer$(main_#t~mem65#1.base, main_#t~mem65#1.offset, main_~user~0#1.base, 24 + main_~user~0#1.offset, 4);havoc main_#t~mem65#1.base, main_#t~mem65#1.offset;call write~$Pointer$(0, 0, main_~user~0#1.base, 20 + main_~user~0#1.offset, 4);call main_#t~mem66#1.base, main_#t~mem66#1.offset := read~$Pointer$(main_~_ha_head~0#1.base, main_~_ha_head~0#1.offset, 4); {18672#(<= |ULTIMATE.start_main_~i~0#1| 2)} is VALID [2022-02-21 03:13:58,409 INFO L290 TraceCheckUtils]: 186: Hoare triple {18672#(<= |ULTIMATE.start_main_~i~0#1| 2)} assume main_#t~mem66#1.base != 0 || main_#t~mem66#1.offset != 0;havoc main_#t~mem66#1.base, main_#t~mem66#1.offset;call main_#t~mem67#1.base, main_#t~mem67#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~mem67#1.base, 12 + main_#t~mem67#1.offset, 4);havoc main_#t~mem67#1.base, main_#t~mem67#1.offset; {18672#(<= |ULTIMATE.start_main_~i~0#1| 2)} is VALID [2022-02-21 03:13:58,409 INFO L290 TraceCheckUtils]: 187: Hoare triple {18672#(<= |ULTIMATE.start_main_~i~0#1| 2)} 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~mem69#1 := read~int(main_~_ha_head~0#1.base, 4 + main_~_ha_head~0#1.offset, 4);call main_#t~mem68#1 := read~int(main_~_ha_head~0#1.base, 8 + main_~_ha_head~0#1.offset, 4);main_#t~short72#1 := main_#t~mem69#1 % 4294967296 >= 10 * (1 + main_#t~mem68#1) % 4294967296; {18672#(<= |ULTIMATE.start_main_~i~0#1| 2)} is VALID [2022-02-21 03:13:58,409 INFO L290 TraceCheckUtils]: 188: Hoare triple {18672#(<= |ULTIMATE.start_main_~i~0#1| 2)} assume main_#t~short72#1;call main_#t~mem70#1.base, main_#t~mem70#1.offset := read~$Pointer$(main_~user~0#1.base, 8 + main_~user~0#1.offset, 4);call main_#t~mem71#1 := read~int(main_#t~mem70#1.base, 36 + main_#t~mem70#1.offset, 4);main_#t~short72#1 := 0 == main_#t~mem71#1 % 4294967296; {18672#(<= |ULTIMATE.start_main_~i~0#1| 2)} is VALID [2022-02-21 03:13:58,409 INFO L290 TraceCheckUtils]: 189: Hoare triple {18672#(<= |ULTIMATE.start_main_~i~0#1| 2)} assume !main_#t~short72#1;havoc main_#t~mem69#1;havoc main_#t~mem68#1;havoc main_#t~mem70#1.base, main_#t~mem70#1.offset;havoc main_#t~mem71#1;havoc main_#t~short72#1; {18672#(<= |ULTIMATE.start_main_~i~0#1| 2)} is VALID [2022-02-21 03:13:58,410 INFO L290 TraceCheckUtils]: 190: Hoare triple {18672#(<= |ULTIMATE.start_main_~i~0#1| 2)} goto; {18672#(<= |ULTIMATE.start_main_~i~0#1| 2)} is VALID [2022-02-21 03:13:58,410 INFO L290 TraceCheckUtils]: 191: Hoare triple {18672#(<= |ULTIMATE.start_main_~i~0#1| 2)} goto; {18672#(<= |ULTIMATE.start_main_~i~0#1| 2)} is VALID [2022-02-21 03:13:58,410 INFO L290 TraceCheckUtils]: 192: Hoare triple {18672#(<= |ULTIMATE.start_main_~i~0#1| 2)} goto; {18672#(<= |ULTIMATE.start_main_~i~0#1| 2)} is VALID [2022-02-21 03:13:58,410 INFO L290 TraceCheckUtils]: 193: Hoare triple {18672#(<= |ULTIMATE.start_main_~i~0#1| 2)} goto; {18672#(<= |ULTIMATE.start_main_~i~0#1| 2)} is VALID [2022-02-21 03:13:58,411 INFO L290 TraceCheckUtils]: 194: Hoare triple {18672#(<= |ULTIMATE.start_main_~i~0#1| 2)} main_#t~post5#1 := main_~i~0#1; {18832#(<= |ULTIMATE.start_main_#t~post5#1| 2)} is VALID [2022-02-21 03:13:58,411 INFO L290 TraceCheckUtils]: 195: Hoare triple {18832#(<= |ULTIMATE.start_main_#t~post5#1| 2)} assume !(1 + main_#t~post5#1 <= 2147483647); {18241#false} is VALID [2022-02-21 03:13:58,411 INFO L134 CoverageAnalysis]: Checked inductivity of 298 backedges. 0 proven. 159 refuted. 0 times theorem prover too weak. 139 trivial. 0 not checked. [2022-02-21 03:13:58,411 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-21 03:13:59,048 INFO L290 TraceCheckUtils]: 195: Hoare triple {18836#(<= |ULTIMATE.start_main_#t~post5#1| 2147483646)} assume !(1 + main_#t~post5#1 <= 2147483647); {18241#false} is VALID [2022-02-21 03:13:59,049 INFO L290 TraceCheckUtils]: 194: Hoare triple {18840#(<= |ULTIMATE.start_main_~i~0#1| 2147483646)} main_#t~post5#1 := main_~i~0#1; {18836#(<= |ULTIMATE.start_main_#t~post5#1| 2147483646)} is VALID [2022-02-21 03:13:59,049 INFO L290 TraceCheckUtils]: 193: Hoare triple {18840#(<= |ULTIMATE.start_main_~i~0#1| 2147483646)} goto; {18840#(<= |ULTIMATE.start_main_~i~0#1| 2147483646)} is VALID [2022-02-21 03:13:59,050 INFO L290 TraceCheckUtils]: 192: Hoare triple {18840#(<= |ULTIMATE.start_main_~i~0#1| 2147483646)} goto; {18840#(<= |ULTIMATE.start_main_~i~0#1| 2147483646)} is VALID [2022-02-21 03:13:59,050 INFO L290 TraceCheckUtils]: 191: Hoare triple {18840#(<= |ULTIMATE.start_main_~i~0#1| 2147483646)} goto; {18840#(<= |ULTIMATE.start_main_~i~0#1| 2147483646)} is VALID [2022-02-21 03:13:59,050 INFO L290 TraceCheckUtils]: 190: Hoare triple {18840#(<= |ULTIMATE.start_main_~i~0#1| 2147483646)} goto; {18840#(<= |ULTIMATE.start_main_~i~0#1| 2147483646)} is VALID [2022-02-21 03:13:59,050 INFO L290 TraceCheckUtils]: 189: Hoare triple {18840#(<= |ULTIMATE.start_main_~i~0#1| 2147483646)} assume !main_#t~short72#1;havoc main_#t~mem69#1;havoc main_#t~mem68#1;havoc main_#t~mem70#1.base, main_#t~mem70#1.offset;havoc main_#t~mem71#1;havoc main_#t~short72#1; {18840#(<= |ULTIMATE.start_main_~i~0#1| 2147483646)} is VALID [2022-02-21 03:13:59,051 INFO L290 TraceCheckUtils]: 188: Hoare triple {18840#(<= |ULTIMATE.start_main_~i~0#1| 2147483646)} assume main_#t~short72#1;call main_#t~mem70#1.base, main_#t~mem70#1.offset := read~$Pointer$(main_~user~0#1.base, 8 + main_~user~0#1.offset, 4);call main_#t~mem71#1 := read~int(main_#t~mem70#1.base, 36 + main_#t~mem70#1.offset, 4);main_#t~short72#1 := 0 == main_#t~mem71#1 % 4294967296; {18840#(<= |ULTIMATE.start_main_~i~0#1| 2147483646)} is VALID [2022-02-21 03:13:59,051 INFO L290 TraceCheckUtils]: 187: Hoare triple {18840#(<= |ULTIMATE.start_main_~i~0#1| 2147483646)} 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~mem69#1 := read~int(main_~_ha_head~0#1.base, 4 + main_~_ha_head~0#1.offset, 4);call main_#t~mem68#1 := read~int(main_~_ha_head~0#1.base, 8 + main_~_ha_head~0#1.offset, 4);main_#t~short72#1 := main_#t~mem69#1 % 4294967296 >= 10 * (1 + main_#t~mem68#1) % 4294967296; {18840#(<= |ULTIMATE.start_main_~i~0#1| 2147483646)} is VALID [2022-02-21 03:13:59,051 INFO L290 TraceCheckUtils]: 186: Hoare triple {18840#(<= |ULTIMATE.start_main_~i~0#1| 2147483646)} assume main_#t~mem66#1.base != 0 || main_#t~mem66#1.offset != 0;havoc main_#t~mem66#1.base, main_#t~mem66#1.offset;call main_#t~mem67#1.base, main_#t~mem67#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~mem67#1.base, 12 + main_#t~mem67#1.offset, 4);havoc main_#t~mem67#1.base, main_#t~mem67#1.offset; {18840#(<= |ULTIMATE.start_main_~i~0#1| 2147483646)} is VALID [2022-02-21 03:13:59,051 INFO L290 TraceCheckUtils]: 185: Hoare triple {18840#(<= |ULTIMATE.start_main_~i~0#1| 2147483646)} call main_#t~mem61#1.base, main_#t~mem61#1.offset := read~$Pointer$(main_~users~0#1.base, 8 + main_~users~0#1.offset, 4);call main_#t~mem62#1.base, main_#t~mem62#1.offset := read~$Pointer$(main_#t~mem61#1.base, main_#t~mem61#1.offset, 4);main_~_ha_head~0#1.base, main_~_ha_head~0#1.offset := main_#t~mem62#1.base, main_#t~mem62#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~mem61#1.base, main_#t~mem61#1.offset;havoc main_#t~mem62#1.base, main_#t~mem62#1.offset;call main_#t~mem63#1 := read~int(main_~_ha_head~0#1.base, 4 + main_~_ha_head~0#1.offset, 4);main_#t~post64#1 := main_#t~mem63#1;call write~int(1 + main_#t~post64#1, main_~_ha_head~0#1.base, 4 + main_~_ha_head~0#1.offset, 4);havoc main_#t~mem63#1;havoc main_#t~post64#1;call main_#t~mem65#1.base, main_#t~mem65#1.offset := read~$Pointer$(main_~_ha_head~0#1.base, main_~_ha_head~0#1.offset, 4);call write~$Pointer$(main_#t~mem65#1.base, main_#t~mem65#1.offset, main_~user~0#1.base, 24 + main_~user~0#1.offset, 4);havoc main_#t~mem65#1.base, main_#t~mem65#1.offset;call write~$Pointer$(0, 0, main_~user~0#1.base, 20 + main_~user~0#1.offset, 4);call main_#t~mem66#1.base, main_#t~mem66#1.offset := read~$Pointer$(main_~_ha_head~0#1.base, main_~_ha_head~0#1.offset, 4); {18840#(<= |ULTIMATE.start_main_~i~0#1| 2147483646)} is VALID [2022-02-21 03:13:59,051 INFO L290 TraceCheckUtils]: 184: Hoare triple {18840#(<= |ULTIMATE.start_main_~i~0#1| 2147483646)} goto; {18840#(<= |ULTIMATE.start_main_~i~0#1| 2147483646)} is VALID [2022-02-21 03:13:59,052 INFO L290 TraceCheckUtils]: 183: Hoare triple {18840#(<= |ULTIMATE.start_main_~i~0#1| 2147483646)} call main_#t~mem59#1.base, main_#t~mem59#1.offset := read~$Pointer$(main_~users~0#1.base, 8 + main_~users~0#1.offset, 4);call main_#t~mem60#1 := read~int(main_#t~mem59#1.base, 4 + main_#t~mem59#1.offset, 4);main_~_ha_bkt~0#1 := (if 0 == main_~_ha_hashv~0#1 || 0 == main_#t~mem60#1 - 1 then 0 else (if 1 == main_#t~mem60#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~mem60#1 - 1))) else (if 1 == main_~_ha_hashv~0#1 then (if 1 == main_#t~mem60#1 - 1 || 0 == main_#t~mem60#1 - 1 then main_#t~mem60#1 - 1 else (if main_#t~mem60#1 - 1 >= 0 then (main_#t~mem60#1 - 1) % 2 else ~bitwiseAnd(main_~_ha_hashv~0#1, main_#t~mem60#1 - 1))) else ~bitwiseAnd(main_~_ha_hashv~0#1, main_#t~mem60#1 - 1))));havoc main_#t~mem59#1.base, main_#t~mem59#1.offset;havoc main_#t~mem60#1; {18840#(<= |ULTIMATE.start_main_~i~0#1| 2147483646)} is VALID [2022-02-21 03:13:59,052 INFO L290 TraceCheckUtils]: 182: Hoare triple {18840#(<= |ULTIMATE.start_main_~i~0#1| 2147483646)} havoc main_~_ha_bkt~0#1;call main_#t~mem56#1.base, main_#t~mem56#1.offset := read~$Pointer$(main_~users~0#1.base, 8 + main_~users~0#1.offset, 4);call main_#t~mem57#1 := read~int(main_#t~mem56#1.base, 12 + main_#t~mem56#1.offset, 4);main_#t~post58#1 := main_#t~mem57#1;call write~int(1 + main_#t~post58#1, main_#t~mem56#1.base, 12 + main_#t~mem56#1.offset, 4);havoc main_#t~mem56#1.base, main_#t~mem56#1.offset;havoc main_#t~mem57#1;havoc main_#t~post58#1; {18840#(<= |ULTIMATE.start_main_~i~0#1| 2147483646)} is VALID [2022-02-21 03:13:59,052 INFO L290 TraceCheckUtils]: 181: Hoare triple {18840#(<= |ULTIMATE.start_main_~i~0#1| 2147483646)} goto; {18840#(<= |ULTIMATE.start_main_~i~0#1| 2147483646)} is VALID [2022-02-21 03:13:59,052 INFO L290 TraceCheckUtils]: 180: Hoare triple {18840#(<= |ULTIMATE.start_main_~i~0#1| 2147483646)} call write~$Pointer$(0, 0, main_~user~0#1.base, 16 + main_~user~0#1.offset, 4);call main_#t~mem49#1.base, main_#t~mem49#1.offset := read~$Pointer$(main_~users~0#1.base, 8 + main_~users~0#1.offset, 4);call main_#t~mem50#1.base, main_#t~mem50#1.offset := read~$Pointer$(main_#t~mem49#1.base, 16 + main_#t~mem49#1.offset, 4);call main_#t~mem51#1.base, main_#t~mem51#1.offset := read~$Pointer$(main_~users~0#1.base, 8 + main_~users~0#1.offset, 4);call main_#t~mem52#1 := read~int(main_#t~mem51#1.base, 20 + main_#t~mem51#1.offset, 4);call write~$Pointer$(main_#t~mem50#1.base, main_#t~mem50#1.offset - main_#t~mem52#1, main_~user~0#1.base, 12 + main_~user~0#1.offset, 4);havoc main_#t~mem49#1.base, main_#t~mem49#1.offset;havoc main_#t~mem50#1.base, main_#t~mem50#1.offset;havoc main_#t~mem51#1.base, main_#t~mem51#1.offset;havoc main_#t~mem52#1;call main_#t~mem53#1.base, main_#t~mem53#1.offset := read~$Pointer$(main_~users~0#1.base, 8 + main_~users~0#1.offset, 4);call main_#t~mem54#1.base, main_#t~mem54#1.offset := read~$Pointer$(main_#t~mem53#1.base, 16 + main_#t~mem53#1.offset, 4);call write~$Pointer$(main_~user~0#1.base, main_~user~0#1.offset, main_#t~mem54#1.base, 8 + main_#t~mem54#1.offset, 4);havoc main_#t~mem53#1.base, main_#t~mem53#1.offset;havoc main_#t~mem54#1.base, main_#t~mem54#1.offset;call main_#t~mem55#1.base, main_#t~mem55#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~mem55#1.base, 16 + main_#t~mem55#1.offset, 4);havoc main_#t~mem55#1.base, main_#t~mem55#1.offset; {18840#(<= |ULTIMATE.start_main_~i~0#1| 2147483646)} is VALID [2022-02-21 03:13:59,053 INFO L290 TraceCheckUtils]: 179: Hoare triple {18840#(<= |ULTIMATE.start_main_~i~0#1| 2147483646)} assume !(main_~users~0#1.base == 0 && main_~users~0#1.offset == 0);call main_#t~mem48#1.base, main_#t~mem48#1.offset := read~$Pointer$(main_~users~0#1.base, 8 + main_~users~0#1.offset, 4);call write~$Pointer$(main_#t~mem48#1.base, main_#t~mem48#1.offset, main_~user~0#1.base, 8 + main_~user~0#1.offset, 4);havoc main_#t~mem48#1.base, main_#t~mem48#1.offset; {18840#(<= |ULTIMATE.start_main_~i~0#1| 2147483646)} is VALID [2022-02-21 03:13:59,053 INFO L290 TraceCheckUtils]: 178: Hoare triple {18840#(<= |ULTIMATE.start_main_~i~0#1| 2147483646)} 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); {18840#(<= |ULTIMATE.start_main_~i~0#1| 2147483646)} is VALID [2022-02-21 03:13:59,053 INFO L290 TraceCheckUtils]: 177: Hoare triple {18840#(<= |ULTIMATE.start_main_~i~0#1| 2147483646)} goto; {18840#(<= |ULTIMATE.start_main_~i~0#1| 2147483646)} is VALID [2022-02-21 03:13:59,053 INFO L290 TraceCheckUtils]: 176: Hoare triple {18840#(<= |ULTIMATE.start_main_~i~0#1| 2147483646)} goto; {18840#(<= |ULTIMATE.start_main_~i~0#1| 2147483646)} is VALID [2022-02-21 03:13:59,054 INFO L290 TraceCheckUtils]: 175: Hoare triple {18840#(<= |ULTIMATE.start_main_~i~0#1| 2147483646)} goto; {18840#(<= |ULTIMATE.start_main_~i~0#1| 2147483646)} is VALID [2022-02-21 03:13:59,054 INFO L290 TraceCheckUtils]: 174: Hoare triple {18840#(<= |ULTIMATE.start_main_~i~0#1| 2147483646)} 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)))); {18840#(<= |ULTIMATE.start_main_~i~0#1| 2147483646)} is VALID [2022-02-21 03:13:59,054 INFO L290 TraceCheckUtils]: 173: Hoare triple {18840#(<= |ULTIMATE.start_main_~i~0#1| 2147483646)} havoc main_#t~switch19#1; {18840#(<= |ULTIMATE.start_main_~i~0#1| 2147483646)} is VALID [2022-02-21 03:13:59,054 INFO L290 TraceCheckUtils]: 172: Hoare triple {18840#(<= |ULTIMATE.start_main_~i~0#1| 2147483646)} assume main_#t~switch19#1;call main_#t~mem30#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~mem30#1 % 256;havoc main_#t~mem30#1; {18840#(<= |ULTIMATE.start_main_~i~0#1| 2147483646)} is VALID [2022-02-21 03:13:59,055 INFO L290 TraceCheckUtils]: 171: Hoare triple {18840#(<= |ULTIMATE.start_main_~i~0#1| 2147483646)} main_#t~switch19#1 := main_#t~switch19#1 || 1 == main_~_hj_k~0#1; {18840#(<= |ULTIMATE.start_main_~i~0#1| 2147483646)} is VALID [2022-02-21 03:13:59,055 INFO L290 TraceCheckUtils]: 170: Hoare triple {18840#(<= |ULTIMATE.start_main_~i~0#1| 2147483646)} assume main_#t~switch19#1;call main_#t~mem29#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~mem29#1 % 256);havoc main_#t~mem29#1; {18840#(<= |ULTIMATE.start_main_~i~0#1| 2147483646)} is VALID [2022-02-21 03:13:59,055 INFO L290 TraceCheckUtils]: 169: Hoare triple {18840#(<= |ULTIMATE.start_main_~i~0#1| 2147483646)} main_#t~switch19#1 := main_#t~switch19#1 || 2 == main_~_hj_k~0#1; {18840#(<= |ULTIMATE.start_main_~i~0#1| 2147483646)} is VALID [2022-02-21 03:13:59,055 INFO L290 TraceCheckUtils]: 168: Hoare triple {18840#(<= |ULTIMATE.start_main_~i~0#1| 2147483646)} assume main_#t~switch19#1;call main_#t~mem28#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~mem28#1 % 256);havoc main_#t~mem28#1; {18840#(<= |ULTIMATE.start_main_~i~0#1| 2147483646)} is VALID [2022-02-21 03:13:59,056 INFO L290 TraceCheckUtils]: 167: Hoare triple {18840#(<= |ULTIMATE.start_main_~i~0#1| 2147483646)} main_#t~switch19#1 := main_#t~switch19#1 || 3 == main_~_hj_k~0#1; {18840#(<= |ULTIMATE.start_main_~i~0#1| 2147483646)} is VALID [2022-02-21 03:13:59,056 INFO L290 TraceCheckUtils]: 166: Hoare triple {18840#(<= |ULTIMATE.start_main_~i~0#1| 2147483646)} assume main_#t~switch19#1;call main_#t~mem27#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~mem27#1 % 256);havoc main_#t~mem27#1; {18840#(<= |ULTIMATE.start_main_~i~0#1| 2147483646)} is VALID [2022-02-21 03:13:59,056 INFO L290 TraceCheckUtils]: 165: Hoare triple {18840#(<= |ULTIMATE.start_main_~i~0#1| 2147483646)} main_#t~switch19#1 := main_#t~switch19#1 || 4 == main_~_hj_k~0#1; {18840#(<= |ULTIMATE.start_main_~i~0#1| 2147483646)} is VALID [2022-02-21 03:13:59,056 INFO L290 TraceCheckUtils]: 164: Hoare triple {18840#(<= |ULTIMATE.start_main_~i~0#1| 2147483646)} assume !main_#t~switch19#1; {18840#(<= |ULTIMATE.start_main_~i~0#1| 2147483646)} is VALID [2022-02-21 03:13:59,057 INFO L290 TraceCheckUtils]: 163: Hoare triple {18840#(<= |ULTIMATE.start_main_~i~0#1| 2147483646)} main_#t~switch19#1 := main_#t~switch19#1 || 5 == main_~_hj_k~0#1; {18840#(<= |ULTIMATE.start_main_~i~0#1| 2147483646)} is VALID [2022-02-21 03:13:59,057 INFO L290 TraceCheckUtils]: 162: Hoare triple {18840#(<= |ULTIMATE.start_main_~i~0#1| 2147483646)} assume !main_#t~switch19#1; {18840#(<= |ULTIMATE.start_main_~i~0#1| 2147483646)} is VALID [2022-02-21 03:13:59,057 INFO L290 TraceCheckUtils]: 161: Hoare triple {18840#(<= |ULTIMATE.start_main_~i~0#1| 2147483646)} main_#t~switch19#1 := main_#t~switch19#1 || 6 == main_~_hj_k~0#1; {18840#(<= |ULTIMATE.start_main_~i~0#1| 2147483646)} is VALID [2022-02-21 03:13:59,057 INFO L290 TraceCheckUtils]: 160: Hoare triple {18840#(<= |ULTIMATE.start_main_~i~0#1| 2147483646)} assume !main_#t~switch19#1; {18840#(<= |ULTIMATE.start_main_~i~0#1| 2147483646)} is VALID [2022-02-21 03:13:59,058 INFO L290 TraceCheckUtils]: 159: Hoare triple {18840#(<= |ULTIMATE.start_main_~i~0#1| 2147483646)} main_#t~switch19#1 := main_#t~switch19#1 || 7 == main_~_hj_k~0#1; {18840#(<= |ULTIMATE.start_main_~i~0#1| 2147483646)} is VALID [2022-02-21 03:13:59,058 INFO L290 TraceCheckUtils]: 158: Hoare triple {18840#(<= |ULTIMATE.start_main_~i~0#1| 2147483646)} assume !main_#t~switch19#1; {18840#(<= |ULTIMATE.start_main_~i~0#1| 2147483646)} is VALID [2022-02-21 03:13:59,058 INFO L290 TraceCheckUtils]: 157: Hoare triple {18840#(<= |ULTIMATE.start_main_~i~0#1| 2147483646)} main_#t~switch19#1 := main_#t~switch19#1 || 8 == main_~_hj_k~0#1; {18840#(<= |ULTIMATE.start_main_~i~0#1| 2147483646)} is VALID [2022-02-21 03:13:59,058 INFO L290 TraceCheckUtils]: 156: Hoare triple {18840#(<= |ULTIMATE.start_main_~i~0#1| 2147483646)} assume !main_#t~switch19#1; {18840#(<= |ULTIMATE.start_main_~i~0#1| 2147483646)} is VALID [2022-02-21 03:13:59,059 INFO L290 TraceCheckUtils]: 155: Hoare triple {18840#(<= |ULTIMATE.start_main_~i~0#1| 2147483646)} main_#t~switch19#1 := main_#t~switch19#1 || 9 == main_~_hj_k~0#1; {18840#(<= |ULTIMATE.start_main_~i~0#1| 2147483646)} is VALID [2022-02-21 03:13:59,059 INFO L290 TraceCheckUtils]: 154: Hoare triple {18840#(<= |ULTIMATE.start_main_~i~0#1| 2147483646)} assume !main_#t~switch19#1; {18840#(<= |ULTIMATE.start_main_~i~0#1| 2147483646)} is VALID [2022-02-21 03:13:59,059 INFO L290 TraceCheckUtils]: 153: Hoare triple {18840#(<= |ULTIMATE.start_main_~i~0#1| 2147483646)} main_#t~switch19#1 := main_#t~switch19#1 || 10 == main_~_hj_k~0#1; {18840#(<= |ULTIMATE.start_main_~i~0#1| 2147483646)} is VALID [2022-02-21 03:13:59,059 INFO L290 TraceCheckUtils]: 152: Hoare triple {18840#(<= |ULTIMATE.start_main_~i~0#1| 2147483646)} assume !main_#t~switch19#1; {18840#(<= |ULTIMATE.start_main_~i~0#1| 2147483646)} is VALID [2022-02-21 03:13:59,060 INFO L290 TraceCheckUtils]: 151: Hoare triple {18840#(<= |ULTIMATE.start_main_~i~0#1| 2147483646)} main_~_ha_hashv~0#1 := 4 + main_~_ha_hashv~0#1;main_#t~switch19#1 := 11 == main_~_hj_k~0#1; {18840#(<= |ULTIMATE.start_main_~i~0#1| 2147483646)} is VALID [2022-02-21 03:13:59,060 INFO L290 TraceCheckUtils]: 150: Hoare triple {18840#(<= |ULTIMATE.start_main_~i~0#1| 2147483646)} assume !(main_~_hj_k~0#1 % 4294967296 >= 12); {18840#(<= |ULTIMATE.start_main_~i~0#1| 2147483646)} is VALID [2022-02-21 03:13:59,060 INFO L290 TraceCheckUtils]: 149: Hoare triple {18840#(<= |ULTIMATE.start_main_~i~0#1| 2147483646)} 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; {18840#(<= |ULTIMATE.start_main_~i~0#1| 2147483646)} is VALID [2022-02-21 03:13:59,060 INFO L290 TraceCheckUtils]: 148: Hoare triple {18840#(<= |ULTIMATE.start_main_~i~0#1| 2147483646)} goto; {18840#(<= |ULTIMATE.start_main_~i~0#1| 2147483646)} is VALID [2022-02-21 03:13:59,061 INFO L290 TraceCheckUtils]: 147: Hoare triple {18840#(<= |ULTIMATE.start_main_~i~0#1| 2147483646)} havoc main_~_ha_hashv~0#1; {18840#(<= |ULTIMATE.start_main_~i~0#1| 2147483646)} is VALID [2022-02-21 03:13:59,061 INFO L290 TraceCheckUtils]: 146: Hoare triple {18840#(<= |ULTIMATE.start_main_~i~0#1| 2147483646)} assume main_~i~0#1 * main_~i~0#1 >= -2147483648;call write~int(main_~i~0#1 * main_~i~0#1, main_~user~0#1.base, 4 + main_~user~0#1.offset, 4); {18840#(<= |ULTIMATE.start_main_~i~0#1| 2147483646)} is VALID [2022-02-21 03:13:59,061 INFO L290 TraceCheckUtils]: 145: Hoare triple {18840#(<= |ULTIMATE.start_main_~i~0#1| 2147483646)} assume main_~i~0#1 * main_~i~0#1 <= 2147483647; {18840#(<= |ULTIMATE.start_main_~i~0#1| 2147483646)} is VALID [2022-02-21 03:13:59,061 INFO L290 TraceCheckUtils]: 144: Hoare triple {18840#(<= |ULTIMATE.start_main_~i~0#1| 2147483646)} call write~int(main_~i~0#1, main_~user~0#1.base, main_~user~0#1.offset, 4); {18840#(<= |ULTIMATE.start_main_~i~0#1| 2147483646)} is VALID [2022-02-21 03:13:59,062 INFO L290 TraceCheckUtils]: 143: Hoare triple {18840#(<= |ULTIMATE.start_main_~i~0#1| 2147483646)} assume !(main_~user~0#1.base == 0 && main_~user~0#1.offset == 0); {18840#(<= |ULTIMATE.start_main_~i~0#1| 2147483646)} is VALID [2022-02-21 03:13:59,062 INFO L290 TraceCheckUtils]: 142: Hoare triple {18840#(<= |ULTIMATE.start_main_~i~0#1| 2147483646)} assume !!(main_~i~0#1 < 10);call main_#t~malloc6#1.base, main_#t~malloc6#1.offset := #Ultimate.allocOnHeap(40);main_~user~0#1.base, main_~user~0#1.offset := main_#t~malloc6#1.base, main_#t~malloc6#1.offset;havoc main_#t~malloc6#1.base, main_#t~malloc6#1.offset; {18840#(<= |ULTIMATE.start_main_~i~0#1| 2147483646)} is VALID [2022-02-21 03:13:59,062 INFO L290 TraceCheckUtils]: 141: Hoare triple {19000#(<= |ULTIMATE.start_main_#t~post5#1| 2147483645)} assume 1 + main_#t~post5#1 >= -2147483648;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; {18840#(<= |ULTIMATE.start_main_~i~0#1| 2147483646)} is VALID [2022-02-21 03:13:59,063 INFO L290 TraceCheckUtils]: 140: Hoare triple {19000#(<= |ULTIMATE.start_main_#t~post5#1| 2147483645)} assume 1 + main_#t~post5#1 <= 2147483647; {19000#(<= |ULTIMATE.start_main_#t~post5#1| 2147483645)} is VALID [2022-02-21 03:13:59,063 INFO L290 TraceCheckUtils]: 139: Hoare triple {19007#(<= |ULTIMATE.start_main_~i~0#1| 2147483645)} main_#t~post5#1 := main_~i~0#1; {19000#(<= |ULTIMATE.start_main_#t~post5#1| 2147483645)} is VALID [2022-02-21 03:13:59,063 INFO L290 TraceCheckUtils]: 138: Hoare triple {19007#(<= |ULTIMATE.start_main_~i~0#1| 2147483645)} goto; {19007#(<= |ULTIMATE.start_main_~i~0#1| 2147483645)} is VALID [2022-02-21 03:13:59,063 INFO L290 TraceCheckUtils]: 137: Hoare triple {19007#(<= |ULTIMATE.start_main_~i~0#1| 2147483645)} goto; {19007#(<= |ULTIMATE.start_main_~i~0#1| 2147483645)} is VALID [2022-02-21 03:13:59,064 INFO L290 TraceCheckUtils]: 136: Hoare triple {19007#(<= |ULTIMATE.start_main_~i~0#1| 2147483645)} goto; {19007#(<= |ULTIMATE.start_main_~i~0#1| 2147483645)} is VALID [2022-02-21 03:13:59,064 INFO L290 TraceCheckUtils]: 135: Hoare triple {19007#(<= |ULTIMATE.start_main_~i~0#1| 2147483645)} goto; {19007#(<= |ULTIMATE.start_main_~i~0#1| 2147483645)} is VALID [2022-02-21 03:13:59,067 INFO L290 TraceCheckUtils]: 134: Hoare triple {19007#(<= |ULTIMATE.start_main_~i~0#1| 2147483645)} assume !main_#t~short72#1;havoc main_#t~mem69#1;havoc main_#t~mem68#1;havoc main_#t~mem70#1.base, main_#t~mem70#1.offset;havoc main_#t~mem71#1;havoc main_#t~short72#1; {19007#(<= |ULTIMATE.start_main_~i~0#1| 2147483645)} is VALID [2022-02-21 03:13:59,067 INFO L290 TraceCheckUtils]: 133: Hoare triple {19007#(<= |ULTIMATE.start_main_~i~0#1| 2147483645)} assume main_#t~short72#1;call main_#t~mem70#1.base, main_#t~mem70#1.offset := read~$Pointer$(main_~user~0#1.base, 8 + main_~user~0#1.offset, 4);call main_#t~mem71#1 := read~int(main_#t~mem70#1.base, 36 + main_#t~mem70#1.offset, 4);main_#t~short72#1 := 0 == main_#t~mem71#1 % 4294967296; {19007#(<= |ULTIMATE.start_main_~i~0#1| 2147483645)} is VALID [2022-02-21 03:13:59,068 INFO L290 TraceCheckUtils]: 132: Hoare triple {19007#(<= |ULTIMATE.start_main_~i~0#1| 2147483645)} 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~mem69#1 := read~int(main_~_ha_head~0#1.base, 4 + main_~_ha_head~0#1.offset, 4);call main_#t~mem68#1 := read~int(main_~_ha_head~0#1.base, 8 + main_~_ha_head~0#1.offset, 4);main_#t~short72#1 := main_#t~mem69#1 % 4294967296 >= 10 * (1 + main_#t~mem68#1) % 4294967296; {19007#(<= |ULTIMATE.start_main_~i~0#1| 2147483645)} is VALID [2022-02-21 03:13:59,068 INFO L290 TraceCheckUtils]: 131: Hoare triple {19007#(<= |ULTIMATE.start_main_~i~0#1| 2147483645)} assume main_#t~mem66#1.base != 0 || main_#t~mem66#1.offset != 0;havoc main_#t~mem66#1.base, main_#t~mem66#1.offset;call main_#t~mem67#1.base, main_#t~mem67#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~mem67#1.base, 12 + main_#t~mem67#1.offset, 4);havoc main_#t~mem67#1.base, main_#t~mem67#1.offset; {19007#(<= |ULTIMATE.start_main_~i~0#1| 2147483645)} is VALID [2022-02-21 03:13:59,068 INFO L290 TraceCheckUtils]: 130: Hoare triple {19007#(<= |ULTIMATE.start_main_~i~0#1| 2147483645)} call main_#t~mem61#1.base, main_#t~mem61#1.offset := read~$Pointer$(main_~users~0#1.base, 8 + main_~users~0#1.offset, 4);call main_#t~mem62#1.base, main_#t~mem62#1.offset := read~$Pointer$(main_#t~mem61#1.base, main_#t~mem61#1.offset, 4);main_~_ha_head~0#1.base, main_~_ha_head~0#1.offset := main_#t~mem62#1.base, main_#t~mem62#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~mem61#1.base, main_#t~mem61#1.offset;havoc main_#t~mem62#1.base, main_#t~mem62#1.offset;call main_#t~mem63#1 := read~int(main_~_ha_head~0#1.base, 4 + main_~_ha_head~0#1.offset, 4);main_#t~post64#1 := main_#t~mem63#1;call write~int(1 + main_#t~post64#1, main_~_ha_head~0#1.base, 4 + main_~_ha_head~0#1.offset, 4);havoc main_#t~mem63#1;havoc main_#t~post64#1;call main_#t~mem65#1.base, main_#t~mem65#1.offset := read~$Pointer$(main_~_ha_head~0#1.base, main_~_ha_head~0#1.offset, 4);call write~$Pointer$(main_#t~mem65#1.base, main_#t~mem65#1.offset, main_~user~0#1.base, 24 + main_~user~0#1.offset, 4);havoc main_#t~mem65#1.base, main_#t~mem65#1.offset;call write~$Pointer$(0, 0, main_~user~0#1.base, 20 + main_~user~0#1.offset, 4);call main_#t~mem66#1.base, main_#t~mem66#1.offset := read~$Pointer$(main_~_ha_head~0#1.base, main_~_ha_head~0#1.offset, 4); {19007#(<= |ULTIMATE.start_main_~i~0#1| 2147483645)} is VALID [2022-02-21 03:13:59,068 INFO L290 TraceCheckUtils]: 129: Hoare triple {19007#(<= |ULTIMATE.start_main_~i~0#1| 2147483645)} goto; {19007#(<= |ULTIMATE.start_main_~i~0#1| 2147483645)} is VALID [2022-02-21 03:13:59,069 INFO L290 TraceCheckUtils]: 128: Hoare triple {19007#(<= |ULTIMATE.start_main_~i~0#1| 2147483645)} call main_#t~mem59#1.base, main_#t~mem59#1.offset := read~$Pointer$(main_~users~0#1.base, 8 + main_~users~0#1.offset, 4);call main_#t~mem60#1 := read~int(main_#t~mem59#1.base, 4 + main_#t~mem59#1.offset, 4);main_~_ha_bkt~0#1 := (if 0 == main_~_ha_hashv~0#1 || 0 == main_#t~mem60#1 - 1 then 0 else (if 1 == main_#t~mem60#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~mem60#1 - 1))) else (if 1 == main_~_ha_hashv~0#1 then (if 1 == main_#t~mem60#1 - 1 || 0 == main_#t~mem60#1 - 1 then main_#t~mem60#1 - 1 else (if main_#t~mem60#1 - 1 >= 0 then (main_#t~mem60#1 - 1) % 2 else ~bitwiseAnd(main_~_ha_hashv~0#1, main_#t~mem60#1 - 1))) else ~bitwiseAnd(main_~_ha_hashv~0#1, main_#t~mem60#1 - 1))));havoc main_#t~mem59#1.base, main_#t~mem59#1.offset;havoc main_#t~mem60#1; {19007#(<= |ULTIMATE.start_main_~i~0#1| 2147483645)} is VALID [2022-02-21 03:13:59,069 INFO L290 TraceCheckUtils]: 127: Hoare triple {19007#(<= |ULTIMATE.start_main_~i~0#1| 2147483645)} havoc main_~_ha_bkt~0#1;call main_#t~mem56#1.base, main_#t~mem56#1.offset := read~$Pointer$(main_~users~0#1.base, 8 + main_~users~0#1.offset, 4);call main_#t~mem57#1 := read~int(main_#t~mem56#1.base, 12 + main_#t~mem56#1.offset, 4);main_#t~post58#1 := main_#t~mem57#1;call write~int(1 + main_#t~post58#1, main_#t~mem56#1.base, 12 + main_#t~mem56#1.offset, 4);havoc main_#t~mem56#1.base, main_#t~mem56#1.offset;havoc main_#t~mem57#1;havoc main_#t~post58#1; {19007#(<= |ULTIMATE.start_main_~i~0#1| 2147483645)} is VALID [2022-02-21 03:13:59,069 INFO L290 TraceCheckUtils]: 126: Hoare triple {19007#(<= |ULTIMATE.start_main_~i~0#1| 2147483645)} goto; {19007#(<= |ULTIMATE.start_main_~i~0#1| 2147483645)} is VALID [2022-02-21 03:13:59,069 INFO L290 TraceCheckUtils]: 125: Hoare triple {19007#(<= |ULTIMATE.start_main_~i~0#1| 2147483645)} call write~$Pointer$(0, 0, main_~user~0#1.base, 16 + main_~user~0#1.offset, 4);call main_#t~mem49#1.base, main_#t~mem49#1.offset := read~$Pointer$(main_~users~0#1.base, 8 + main_~users~0#1.offset, 4);call main_#t~mem50#1.base, main_#t~mem50#1.offset := read~$Pointer$(main_#t~mem49#1.base, 16 + main_#t~mem49#1.offset, 4);call main_#t~mem51#1.base, main_#t~mem51#1.offset := read~$Pointer$(main_~users~0#1.base, 8 + main_~users~0#1.offset, 4);call main_#t~mem52#1 := read~int(main_#t~mem51#1.base, 20 + main_#t~mem51#1.offset, 4);call write~$Pointer$(main_#t~mem50#1.base, main_#t~mem50#1.offset - main_#t~mem52#1, main_~user~0#1.base, 12 + main_~user~0#1.offset, 4);havoc main_#t~mem49#1.base, main_#t~mem49#1.offset;havoc main_#t~mem50#1.base, main_#t~mem50#1.offset;havoc main_#t~mem51#1.base, main_#t~mem51#1.offset;havoc main_#t~mem52#1;call main_#t~mem53#1.base, main_#t~mem53#1.offset := read~$Pointer$(main_~users~0#1.base, 8 + main_~users~0#1.offset, 4);call main_#t~mem54#1.base, main_#t~mem54#1.offset := read~$Pointer$(main_#t~mem53#1.base, 16 + main_#t~mem53#1.offset, 4);call write~$Pointer$(main_~user~0#1.base, main_~user~0#1.offset, main_#t~mem54#1.base, 8 + main_#t~mem54#1.offset, 4);havoc main_#t~mem53#1.base, main_#t~mem53#1.offset;havoc main_#t~mem54#1.base, main_#t~mem54#1.offset;call main_#t~mem55#1.base, main_#t~mem55#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~mem55#1.base, 16 + main_#t~mem55#1.offset, 4);havoc main_#t~mem55#1.base, main_#t~mem55#1.offset; {19007#(<= |ULTIMATE.start_main_~i~0#1| 2147483645)} is VALID [2022-02-21 03:13:59,070 INFO L290 TraceCheckUtils]: 124: Hoare triple {19007#(<= |ULTIMATE.start_main_~i~0#1| 2147483645)} assume !(main_~users~0#1.base == 0 && main_~users~0#1.offset == 0);call main_#t~mem48#1.base, main_#t~mem48#1.offset := read~$Pointer$(main_~users~0#1.base, 8 + main_~users~0#1.offset, 4);call write~$Pointer$(main_#t~mem48#1.base, main_#t~mem48#1.offset, main_~user~0#1.base, 8 + main_~user~0#1.offset, 4);havoc main_#t~mem48#1.base, main_#t~mem48#1.offset; {19007#(<= |ULTIMATE.start_main_~i~0#1| 2147483645)} is VALID [2022-02-21 03:13:59,070 INFO L290 TraceCheckUtils]: 123: Hoare triple {19007#(<= |ULTIMATE.start_main_~i~0#1| 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); {19007#(<= |ULTIMATE.start_main_~i~0#1| 2147483645)} is VALID [2022-02-21 03:13:59,070 INFO L290 TraceCheckUtils]: 122: Hoare triple {19007#(<= |ULTIMATE.start_main_~i~0#1| 2147483645)} goto; {19007#(<= |ULTIMATE.start_main_~i~0#1| 2147483645)} is VALID [2022-02-21 03:13:59,070 INFO L290 TraceCheckUtils]: 121: Hoare triple {19007#(<= |ULTIMATE.start_main_~i~0#1| 2147483645)} goto; {19007#(<= |ULTIMATE.start_main_~i~0#1| 2147483645)} is VALID [2022-02-21 03:13:59,071 INFO L290 TraceCheckUtils]: 120: Hoare triple {19007#(<= |ULTIMATE.start_main_~i~0#1| 2147483645)} goto; {19007#(<= |ULTIMATE.start_main_~i~0#1| 2147483645)} is VALID [2022-02-21 03:13:59,071 INFO L290 TraceCheckUtils]: 119: Hoare triple {19007#(<= |ULTIMATE.start_main_~i~0#1| 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)))); {19007#(<= |ULTIMATE.start_main_~i~0#1| 2147483645)} is VALID [2022-02-21 03:13:59,071 INFO L290 TraceCheckUtils]: 118: Hoare triple {19007#(<= |ULTIMATE.start_main_~i~0#1| 2147483645)} havoc main_#t~switch19#1; {19007#(<= |ULTIMATE.start_main_~i~0#1| 2147483645)} is VALID [2022-02-21 03:13:59,071 INFO L290 TraceCheckUtils]: 117: Hoare triple {19007#(<= |ULTIMATE.start_main_~i~0#1| 2147483645)} assume main_#t~switch19#1;call main_#t~mem30#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~mem30#1 % 256;havoc main_#t~mem30#1; {19007#(<= |ULTIMATE.start_main_~i~0#1| 2147483645)} is VALID [2022-02-21 03:13:59,072 INFO L290 TraceCheckUtils]: 116: Hoare triple {19007#(<= |ULTIMATE.start_main_~i~0#1| 2147483645)} main_#t~switch19#1 := main_#t~switch19#1 || 1 == main_~_hj_k~0#1; {19007#(<= |ULTIMATE.start_main_~i~0#1| 2147483645)} is VALID [2022-02-21 03:13:59,072 INFO L290 TraceCheckUtils]: 115: Hoare triple {19007#(<= |ULTIMATE.start_main_~i~0#1| 2147483645)} assume main_#t~switch19#1;call main_#t~mem29#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~mem29#1 % 256);havoc main_#t~mem29#1; {19007#(<= |ULTIMATE.start_main_~i~0#1| 2147483645)} is VALID [2022-02-21 03:13:59,072 INFO L290 TraceCheckUtils]: 114: Hoare triple {19007#(<= |ULTIMATE.start_main_~i~0#1| 2147483645)} main_#t~switch19#1 := main_#t~switch19#1 || 2 == main_~_hj_k~0#1; {19007#(<= |ULTIMATE.start_main_~i~0#1| 2147483645)} is VALID [2022-02-21 03:13:59,072 INFO L290 TraceCheckUtils]: 113: Hoare triple {19007#(<= |ULTIMATE.start_main_~i~0#1| 2147483645)} assume main_#t~switch19#1;call main_#t~mem28#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~mem28#1 % 256);havoc main_#t~mem28#1; {19007#(<= |ULTIMATE.start_main_~i~0#1| 2147483645)} is VALID [2022-02-21 03:13:59,073 INFO L290 TraceCheckUtils]: 112: Hoare triple {19007#(<= |ULTIMATE.start_main_~i~0#1| 2147483645)} main_#t~switch19#1 := main_#t~switch19#1 || 3 == main_~_hj_k~0#1; {19007#(<= |ULTIMATE.start_main_~i~0#1| 2147483645)} is VALID [2022-02-21 03:13:59,073 INFO L290 TraceCheckUtils]: 111: Hoare triple {19007#(<= |ULTIMATE.start_main_~i~0#1| 2147483645)} assume main_#t~switch19#1;call main_#t~mem27#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~mem27#1 % 256);havoc main_#t~mem27#1; {19007#(<= |ULTIMATE.start_main_~i~0#1| 2147483645)} is VALID [2022-02-21 03:13:59,073 INFO L290 TraceCheckUtils]: 110: Hoare triple {19007#(<= |ULTIMATE.start_main_~i~0#1| 2147483645)} main_#t~switch19#1 := main_#t~switch19#1 || 4 == main_~_hj_k~0#1; {19007#(<= |ULTIMATE.start_main_~i~0#1| 2147483645)} is VALID [2022-02-21 03:13:59,073 INFO L290 TraceCheckUtils]: 109: Hoare triple {19007#(<= |ULTIMATE.start_main_~i~0#1| 2147483645)} assume !main_#t~switch19#1; {19007#(<= |ULTIMATE.start_main_~i~0#1| 2147483645)} is VALID [2022-02-21 03:13:59,074 INFO L290 TraceCheckUtils]: 108: Hoare triple {19007#(<= |ULTIMATE.start_main_~i~0#1| 2147483645)} main_#t~switch19#1 := main_#t~switch19#1 || 5 == main_~_hj_k~0#1; {19007#(<= |ULTIMATE.start_main_~i~0#1| 2147483645)} is VALID [2022-02-21 03:13:59,074 INFO L290 TraceCheckUtils]: 107: Hoare triple {19007#(<= |ULTIMATE.start_main_~i~0#1| 2147483645)} assume !main_#t~switch19#1; {19007#(<= |ULTIMATE.start_main_~i~0#1| 2147483645)} is VALID [2022-02-21 03:13:59,074 INFO L290 TraceCheckUtils]: 106: Hoare triple {19007#(<= |ULTIMATE.start_main_~i~0#1| 2147483645)} main_#t~switch19#1 := main_#t~switch19#1 || 6 == main_~_hj_k~0#1; {19007#(<= |ULTIMATE.start_main_~i~0#1| 2147483645)} is VALID [2022-02-21 03:13:59,074 INFO L290 TraceCheckUtils]: 105: Hoare triple {19007#(<= |ULTIMATE.start_main_~i~0#1| 2147483645)} assume !main_#t~switch19#1; {19007#(<= |ULTIMATE.start_main_~i~0#1| 2147483645)} is VALID [2022-02-21 03:13:59,075 INFO L290 TraceCheckUtils]: 104: Hoare triple {19007#(<= |ULTIMATE.start_main_~i~0#1| 2147483645)} main_#t~switch19#1 := main_#t~switch19#1 || 7 == main_~_hj_k~0#1; {19007#(<= |ULTIMATE.start_main_~i~0#1| 2147483645)} is VALID [2022-02-21 03:13:59,075 INFO L290 TraceCheckUtils]: 103: Hoare triple {19007#(<= |ULTIMATE.start_main_~i~0#1| 2147483645)} assume !main_#t~switch19#1; {19007#(<= |ULTIMATE.start_main_~i~0#1| 2147483645)} is VALID [2022-02-21 03:13:59,075 INFO L290 TraceCheckUtils]: 102: Hoare triple {19007#(<= |ULTIMATE.start_main_~i~0#1| 2147483645)} main_#t~switch19#1 := main_#t~switch19#1 || 8 == main_~_hj_k~0#1; {19007#(<= |ULTIMATE.start_main_~i~0#1| 2147483645)} is VALID [2022-02-21 03:13:59,075 INFO L290 TraceCheckUtils]: 101: Hoare triple {19007#(<= |ULTIMATE.start_main_~i~0#1| 2147483645)} assume !main_#t~switch19#1; {19007#(<= |ULTIMATE.start_main_~i~0#1| 2147483645)} is VALID [2022-02-21 03:13:59,076 INFO L290 TraceCheckUtils]: 100: Hoare triple {19007#(<= |ULTIMATE.start_main_~i~0#1| 2147483645)} main_#t~switch19#1 := main_#t~switch19#1 || 9 == main_~_hj_k~0#1; {19007#(<= |ULTIMATE.start_main_~i~0#1| 2147483645)} is VALID [2022-02-21 03:13:59,076 INFO L290 TraceCheckUtils]: 99: Hoare triple {19007#(<= |ULTIMATE.start_main_~i~0#1| 2147483645)} assume !main_#t~switch19#1; {19007#(<= |ULTIMATE.start_main_~i~0#1| 2147483645)} is VALID [2022-02-21 03:13:59,076 INFO L290 TraceCheckUtils]: 98: Hoare triple {19007#(<= |ULTIMATE.start_main_~i~0#1| 2147483645)} main_#t~switch19#1 := main_#t~switch19#1 || 10 == main_~_hj_k~0#1; {19007#(<= |ULTIMATE.start_main_~i~0#1| 2147483645)} is VALID [2022-02-21 03:13:59,076 INFO L290 TraceCheckUtils]: 97: Hoare triple {19007#(<= |ULTIMATE.start_main_~i~0#1| 2147483645)} assume !main_#t~switch19#1; {19007#(<= |ULTIMATE.start_main_~i~0#1| 2147483645)} is VALID [2022-02-21 03:13:59,077 INFO L290 TraceCheckUtils]: 96: Hoare triple {19007#(<= |ULTIMATE.start_main_~i~0#1| 2147483645)} main_~_ha_hashv~0#1 := 4 + main_~_ha_hashv~0#1;main_#t~switch19#1 := 11 == main_~_hj_k~0#1; {19007#(<= |ULTIMATE.start_main_~i~0#1| 2147483645)} is VALID [2022-02-21 03:13:59,077 INFO L290 TraceCheckUtils]: 95: Hoare triple {19007#(<= |ULTIMATE.start_main_~i~0#1| 2147483645)} assume !(main_~_hj_k~0#1 % 4294967296 >= 12); {19007#(<= |ULTIMATE.start_main_~i~0#1| 2147483645)} is VALID [2022-02-21 03:13:59,077 INFO L290 TraceCheckUtils]: 94: Hoare triple {19007#(<= |ULTIMATE.start_main_~i~0#1| 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; {19007#(<= |ULTIMATE.start_main_~i~0#1| 2147483645)} is VALID [2022-02-21 03:13:59,078 INFO L290 TraceCheckUtils]: 93: Hoare triple {19007#(<= |ULTIMATE.start_main_~i~0#1| 2147483645)} goto; {19007#(<= |ULTIMATE.start_main_~i~0#1| 2147483645)} is VALID [2022-02-21 03:13:59,078 INFO L290 TraceCheckUtils]: 92: Hoare triple {19007#(<= |ULTIMATE.start_main_~i~0#1| 2147483645)} havoc main_~_ha_hashv~0#1; {19007#(<= |ULTIMATE.start_main_~i~0#1| 2147483645)} is VALID [2022-02-21 03:13:59,078 INFO L290 TraceCheckUtils]: 91: Hoare triple {19007#(<= |ULTIMATE.start_main_~i~0#1| 2147483645)} assume main_~i~0#1 * main_~i~0#1 >= -2147483648;call write~int(main_~i~0#1 * main_~i~0#1, main_~user~0#1.base, 4 + main_~user~0#1.offset, 4); {19007#(<= |ULTIMATE.start_main_~i~0#1| 2147483645)} is VALID [2022-02-21 03:13:59,078 INFO L290 TraceCheckUtils]: 90: Hoare triple {19007#(<= |ULTIMATE.start_main_~i~0#1| 2147483645)} assume main_~i~0#1 * main_~i~0#1 <= 2147483647; {19007#(<= |ULTIMATE.start_main_~i~0#1| 2147483645)} is VALID [2022-02-21 03:13:59,079 INFO L290 TraceCheckUtils]: 89: Hoare triple {19007#(<= |ULTIMATE.start_main_~i~0#1| 2147483645)} call write~int(main_~i~0#1, main_~user~0#1.base, main_~user~0#1.offset, 4); {19007#(<= |ULTIMATE.start_main_~i~0#1| 2147483645)} is VALID [2022-02-21 03:13:59,079 INFO L290 TraceCheckUtils]: 88: Hoare triple {19007#(<= |ULTIMATE.start_main_~i~0#1| 2147483645)} assume !(main_~user~0#1.base == 0 && main_~user~0#1.offset == 0); {19007#(<= |ULTIMATE.start_main_~i~0#1| 2147483645)} is VALID [2022-02-21 03:13:59,079 INFO L290 TraceCheckUtils]: 87: Hoare triple {19007#(<= |ULTIMATE.start_main_~i~0#1| 2147483645)} assume !!(main_~i~0#1 < 10);call main_#t~malloc6#1.base, main_#t~malloc6#1.offset := #Ultimate.allocOnHeap(40);main_~user~0#1.base, main_~user~0#1.offset := main_#t~malloc6#1.base, main_#t~malloc6#1.offset;havoc main_#t~malloc6#1.base, main_#t~malloc6#1.offset; {19007#(<= |ULTIMATE.start_main_~i~0#1| 2147483645)} is VALID [2022-02-21 03:13:59,080 INFO L290 TraceCheckUtils]: 86: Hoare triple {19167#(<= |ULTIMATE.start_main_#t~post5#1| 2147483644)} assume 1 + main_#t~post5#1 >= -2147483648;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; {19007#(<= |ULTIMATE.start_main_~i~0#1| 2147483645)} is VALID [2022-02-21 03:13:59,080 INFO L290 TraceCheckUtils]: 85: Hoare triple {19167#(<= |ULTIMATE.start_main_#t~post5#1| 2147483644)} assume 1 + main_#t~post5#1 <= 2147483647; {19167#(<= |ULTIMATE.start_main_#t~post5#1| 2147483644)} is VALID [2022-02-21 03:13:59,080 INFO L290 TraceCheckUtils]: 84: Hoare triple {19174#(<= |ULTIMATE.start_main_~i~0#1| 2147483644)} main_#t~post5#1 := main_~i~0#1; {19167#(<= |ULTIMATE.start_main_#t~post5#1| 2147483644)} is VALID [2022-02-21 03:13:59,080 INFO L290 TraceCheckUtils]: 83: Hoare triple {19174#(<= |ULTIMATE.start_main_~i~0#1| 2147483644)} goto; {19174#(<= |ULTIMATE.start_main_~i~0#1| 2147483644)} is VALID [2022-02-21 03:13:59,081 INFO L290 TraceCheckUtils]: 82: Hoare triple {19174#(<= |ULTIMATE.start_main_~i~0#1| 2147483644)} goto; {19174#(<= |ULTIMATE.start_main_~i~0#1| 2147483644)} is VALID [2022-02-21 03:13:59,081 INFO L290 TraceCheckUtils]: 81: Hoare triple {19174#(<= |ULTIMATE.start_main_~i~0#1| 2147483644)} goto; {19174#(<= |ULTIMATE.start_main_~i~0#1| 2147483644)} is VALID [2022-02-21 03:13:59,081 INFO L290 TraceCheckUtils]: 80: Hoare triple {19174#(<= |ULTIMATE.start_main_~i~0#1| 2147483644)} goto; {19174#(<= |ULTIMATE.start_main_~i~0#1| 2147483644)} is VALID [2022-02-21 03:13:59,081 INFO L290 TraceCheckUtils]: 79: Hoare triple {19174#(<= |ULTIMATE.start_main_~i~0#1| 2147483644)} assume !main_#t~short72#1;havoc main_#t~mem69#1;havoc main_#t~mem68#1;havoc main_#t~mem70#1.base, main_#t~mem70#1.offset;havoc main_#t~mem71#1;havoc main_#t~short72#1; {19174#(<= |ULTIMATE.start_main_~i~0#1| 2147483644)} is VALID [2022-02-21 03:13:59,082 INFO L290 TraceCheckUtils]: 78: Hoare triple {19174#(<= |ULTIMATE.start_main_~i~0#1| 2147483644)} assume main_#t~short72#1;call main_#t~mem70#1.base, main_#t~mem70#1.offset := read~$Pointer$(main_~user~0#1.base, 8 + main_~user~0#1.offset, 4);call main_#t~mem71#1 := read~int(main_#t~mem70#1.base, 36 + main_#t~mem70#1.offset, 4);main_#t~short72#1 := 0 == main_#t~mem71#1 % 4294967296; {19174#(<= |ULTIMATE.start_main_~i~0#1| 2147483644)} is VALID [2022-02-21 03:13:59,082 INFO L290 TraceCheckUtils]: 77: Hoare triple {19174#(<= |ULTIMATE.start_main_~i~0#1| 2147483644)} 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~mem69#1 := read~int(main_~_ha_head~0#1.base, 4 + main_~_ha_head~0#1.offset, 4);call main_#t~mem68#1 := read~int(main_~_ha_head~0#1.base, 8 + main_~_ha_head~0#1.offset, 4);main_#t~short72#1 := main_#t~mem69#1 % 4294967296 >= 10 * (1 + main_#t~mem68#1) % 4294967296; {19174#(<= |ULTIMATE.start_main_~i~0#1| 2147483644)} is VALID [2022-02-21 03:13:59,082 INFO L290 TraceCheckUtils]: 76: Hoare triple {19174#(<= |ULTIMATE.start_main_~i~0#1| 2147483644)} assume main_#t~mem66#1.base != 0 || main_#t~mem66#1.offset != 0;havoc main_#t~mem66#1.base, main_#t~mem66#1.offset;call main_#t~mem67#1.base, main_#t~mem67#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~mem67#1.base, 12 + main_#t~mem67#1.offset, 4);havoc main_#t~mem67#1.base, main_#t~mem67#1.offset; {19174#(<= |ULTIMATE.start_main_~i~0#1| 2147483644)} is VALID [2022-02-21 03:13:59,082 INFO L290 TraceCheckUtils]: 75: Hoare triple {19174#(<= |ULTIMATE.start_main_~i~0#1| 2147483644)} call main_#t~mem61#1.base, main_#t~mem61#1.offset := read~$Pointer$(main_~users~0#1.base, 8 + main_~users~0#1.offset, 4);call main_#t~mem62#1.base, main_#t~mem62#1.offset := read~$Pointer$(main_#t~mem61#1.base, main_#t~mem61#1.offset, 4);main_~_ha_head~0#1.base, main_~_ha_head~0#1.offset := main_#t~mem62#1.base, main_#t~mem62#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~mem61#1.base, main_#t~mem61#1.offset;havoc main_#t~mem62#1.base, main_#t~mem62#1.offset;call main_#t~mem63#1 := read~int(main_~_ha_head~0#1.base, 4 + main_~_ha_head~0#1.offset, 4);main_#t~post64#1 := main_#t~mem63#1;call write~int(1 + main_#t~post64#1, main_~_ha_head~0#1.base, 4 + main_~_ha_head~0#1.offset, 4);havoc main_#t~mem63#1;havoc main_#t~post64#1;call main_#t~mem65#1.base, main_#t~mem65#1.offset := read~$Pointer$(main_~_ha_head~0#1.base, main_~_ha_head~0#1.offset, 4);call write~$Pointer$(main_#t~mem65#1.base, main_#t~mem65#1.offset, main_~user~0#1.base, 24 + main_~user~0#1.offset, 4);havoc main_#t~mem65#1.base, main_#t~mem65#1.offset;call write~$Pointer$(0, 0, main_~user~0#1.base, 20 + main_~user~0#1.offset, 4);call main_#t~mem66#1.base, main_#t~mem66#1.offset := read~$Pointer$(main_~_ha_head~0#1.base, main_~_ha_head~0#1.offset, 4); {19174#(<= |ULTIMATE.start_main_~i~0#1| 2147483644)} is VALID [2022-02-21 03:13:59,083 INFO L290 TraceCheckUtils]: 74: Hoare triple {19174#(<= |ULTIMATE.start_main_~i~0#1| 2147483644)} goto; {19174#(<= |ULTIMATE.start_main_~i~0#1| 2147483644)} is VALID [2022-02-21 03:13:59,083 INFO L290 TraceCheckUtils]: 73: Hoare triple {19174#(<= |ULTIMATE.start_main_~i~0#1| 2147483644)} call main_#t~mem59#1.base, main_#t~mem59#1.offset := read~$Pointer$(main_~users~0#1.base, 8 + main_~users~0#1.offset, 4);call main_#t~mem60#1 := read~int(main_#t~mem59#1.base, 4 + main_#t~mem59#1.offset, 4);main_~_ha_bkt~0#1 := (if 0 == main_~_ha_hashv~0#1 || 0 == main_#t~mem60#1 - 1 then 0 else (if 1 == main_#t~mem60#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~mem60#1 - 1))) else (if 1 == main_~_ha_hashv~0#1 then (if 1 == main_#t~mem60#1 - 1 || 0 == main_#t~mem60#1 - 1 then main_#t~mem60#1 - 1 else (if main_#t~mem60#1 - 1 >= 0 then (main_#t~mem60#1 - 1) % 2 else ~bitwiseAnd(main_~_ha_hashv~0#1, main_#t~mem60#1 - 1))) else ~bitwiseAnd(main_~_ha_hashv~0#1, main_#t~mem60#1 - 1))));havoc main_#t~mem59#1.base, main_#t~mem59#1.offset;havoc main_#t~mem60#1; {19174#(<= |ULTIMATE.start_main_~i~0#1| 2147483644)} is VALID [2022-02-21 03:13:59,083 INFO L290 TraceCheckUtils]: 72: Hoare triple {19174#(<= |ULTIMATE.start_main_~i~0#1| 2147483644)} havoc main_~_ha_bkt~0#1;call main_#t~mem56#1.base, main_#t~mem56#1.offset := read~$Pointer$(main_~users~0#1.base, 8 + main_~users~0#1.offset, 4);call main_#t~mem57#1 := read~int(main_#t~mem56#1.base, 12 + main_#t~mem56#1.offset, 4);main_#t~post58#1 := main_#t~mem57#1;call write~int(1 + main_#t~post58#1, main_#t~mem56#1.base, 12 + main_#t~mem56#1.offset, 4);havoc main_#t~mem56#1.base, main_#t~mem56#1.offset;havoc main_#t~mem57#1;havoc main_#t~post58#1; {19174#(<= |ULTIMATE.start_main_~i~0#1| 2147483644)} is VALID [2022-02-21 03:13:59,083 INFO L290 TraceCheckUtils]: 71: Hoare triple {19174#(<= |ULTIMATE.start_main_~i~0#1| 2147483644)} main_~users~0#1.base, main_~users~0#1.offset := main_~user~0#1.base, main_~user~0#1.offset; {19174#(<= |ULTIMATE.start_main_~i~0#1| 2147483644)} is VALID [2022-02-21 03:13:59,084 INFO L290 TraceCheckUtils]: 70: Hoare triple {19174#(<= |ULTIMATE.start_main_~i~0#1| 2147483644)} goto; {19174#(<= |ULTIMATE.start_main_~i~0#1| 2147483644)} is VALID [2022-02-21 03:13:59,084 INFO L290 TraceCheckUtils]: 69: Hoare triple {19174#(<= |ULTIMATE.start_main_~i~0#1| 2147483644)} havoc main_#t~mem45#1.base, main_#t~mem45#1.offset;havoc main_#t~mem46#1.base, main_#t~mem46#1.offset;havoc main_#t~memset~res47#1.base, main_#t~memset~res47#1.offset; {19174#(<= |ULTIMATE.start_main_~i~0#1| 2147483644)} is VALID [2022-02-21 03:13:59,085 INFO L284 TraceCheckUtils]: 68: Hoare quadruple {18240#true} {19174#(<= |ULTIMATE.start_main_~i~0#1| 2147483644)} #486#return; {19174#(<= |ULTIMATE.start_main_~i~0#1| 2147483644)} is VALID [2022-02-21 03:13:59,085 INFO L290 TraceCheckUtils]: 67: Hoare triple {18240#true} assume #res.base == #ptr.base && #res.offset == #ptr.offset; {18240#true} is VALID [2022-02-21 03:13:59,085 INFO L290 TraceCheckUtils]: 66: Hoare triple {18240#true} assume !(#t~loopctr143 % 4294967296 < #amount % 4294967296); {18240#true} is VALID [2022-02-21 03:13:59,085 INFO L290 TraceCheckUtils]: 65: Hoare triple {18240#true} assume #t~loopctr143 % 4294967296 < #amount % 4294967296;#memory_$Pointer$.base, #memory_$Pointer$.offset := #memory_$Pointer$.base[#ptr.base,#ptr.offset + #t~loopctr143 := 0], #memory_$Pointer$.offset[#ptr.base,#ptr.offset + #t~loopctr143 := #value % 256];#memory_int := #memory_int[#ptr.base,#ptr.offset + #t~loopctr143 := #value];#t~loopctr143 := 1 + #t~loopctr143; {18240#true} is VALID [2022-02-21 03:13:59,085 INFO L290 TraceCheckUtils]: 64: Hoare triple {18240#true} assume #t~loopctr143 % 4294967296 < #amount % 4294967296;#memory_$Pointer$.base, #memory_$Pointer$.offset := #memory_$Pointer$.base[#ptr.base,#ptr.offset + #t~loopctr143 := 0], #memory_$Pointer$.offset[#ptr.base,#ptr.offset + #t~loopctr143 := #value % 256];#memory_int := #memory_int[#ptr.base,#ptr.offset + #t~loopctr143 := #value];#t~loopctr143 := 1 + #t~loopctr143; {18240#true} is VALID [2022-02-21 03:13:59,085 INFO L290 TraceCheckUtils]: 63: Hoare triple {18240#true} assume #t~loopctr143 % 4294967296 < #amount % 4294967296;#memory_$Pointer$.base, #memory_$Pointer$.offset := #memory_$Pointer$.base[#ptr.base,#ptr.offset + #t~loopctr143 := 0], #memory_$Pointer$.offset[#ptr.base,#ptr.offset + #t~loopctr143 := #value % 256];#memory_int := #memory_int[#ptr.base,#ptr.offset + #t~loopctr143 := #value];#t~loopctr143 := 1 + #t~loopctr143; {18240#true} is VALID [2022-02-21 03:13:59,085 INFO L290 TraceCheckUtils]: 62: Hoare triple {18240#true} assume #t~loopctr143 % 4294967296 < #amount % 4294967296;#memory_$Pointer$.base, #memory_$Pointer$.offset := #memory_$Pointer$.base[#ptr.base,#ptr.offset + #t~loopctr143 := 0], #memory_$Pointer$.offset[#ptr.base,#ptr.offset + #t~loopctr143 := #value % 256];#memory_int := #memory_int[#ptr.base,#ptr.offset + #t~loopctr143 := #value];#t~loopctr143 := 1 + #t~loopctr143; {18240#true} is VALID [2022-02-21 03:13:59,085 INFO L290 TraceCheckUtils]: 61: Hoare triple {18240#true} assume #t~loopctr143 % 4294967296 < #amount % 4294967296;#memory_$Pointer$.base, #memory_$Pointer$.offset := #memory_$Pointer$.base[#ptr.base,#ptr.offset + #t~loopctr143 := 0], #memory_$Pointer$.offset[#ptr.base,#ptr.offset + #t~loopctr143 := #value % 256];#memory_int := #memory_int[#ptr.base,#ptr.offset + #t~loopctr143 := #value];#t~loopctr143 := 1 + #t~loopctr143; {18240#true} is VALID [2022-02-21 03:13:59,085 INFO L290 TraceCheckUtils]: 60: Hoare triple {18240#true} #t~loopctr143 := 0; {18240#true} is VALID [2022-02-21 03:13:59,085 INFO L272 TraceCheckUtils]: 59: Hoare triple {19174#(<= |ULTIMATE.start_main_~i~0#1| 2147483644)} call main_#t~memset~res47#1.base, main_#t~memset~res47#1.offset := #Ultimate.C_memset(main_#t~mem46#1.base, main_#t~mem46#1.offset, 0, 384); {18240#true} is VALID [2022-02-21 03:13:59,085 INFO L290 TraceCheckUtils]: 58: Hoare triple {19174#(<= |ULTIMATE.start_main_~i~0#1| 2147483644)} assume !(main_#t~mem43#1.base == 0 && main_#t~mem43#1.offset == 0);havoc main_#t~mem42#1.base, main_#t~mem42#1.offset;havoc main_#t~mem43#1.base, main_#t~mem43#1.offset;call main_#t~mem45#1.base, main_#t~mem45#1.offset := read~$Pointer$(main_~user~0#1.base, 8 + main_~user~0#1.offset, 4);call main_#t~mem46#1.base, main_#t~mem46#1.offset := read~$Pointer$(main_#t~mem45#1.base, main_#t~mem45#1.offset, 4); {19174#(<= |ULTIMATE.start_main_~i~0#1| 2147483644)} is VALID [2022-02-21 03:13:59,086 INFO L290 TraceCheckUtils]: 57: Hoare triple {19174#(<= |ULTIMATE.start_main_~i~0#1| 2147483644)} havoc main_#t~mem33#1.base, main_#t~mem33#1.offset;havoc main_#t~memset~res34#1.base, main_#t~memset~res34#1.offset;call main_#t~mem35#1.base, main_#t~mem35#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~mem35#1.base, 16 + main_#t~mem35#1.offset, 4);havoc main_#t~mem35#1.base, main_#t~mem35#1.offset;call main_#t~mem36#1.base, main_#t~mem36#1.offset := read~$Pointer$(main_~user~0#1.base, 8 + main_~user~0#1.offset, 4);call write~int(32, main_#t~mem36#1.base, 4 + main_#t~mem36#1.offset, 4);havoc main_#t~mem36#1.base, main_#t~mem36#1.offset;call main_#t~mem37#1.base, main_#t~mem37#1.offset := read~$Pointer$(main_~user~0#1.base, 8 + main_~user~0#1.offset, 4);call write~int(5, main_#t~mem37#1.base, 8 + main_#t~mem37#1.offset, 4);havoc main_#t~mem37#1.base, main_#t~mem37#1.offset;call main_#t~mem38#1.base, main_#t~mem38#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~mem38#1.base, 20 + main_#t~mem38#1.offset, 4);havoc main_#t~mem38#1.base, main_#t~mem38#1.offset;call main_#t~mem39#1.base, main_#t~mem39#1.offset := read~$Pointer$(main_~user~0#1.base, 8 + main_~user~0#1.offset, 4);call main_#t~malloc40#1.base, main_#t~malloc40#1.offset := #Ultimate.allocOnHeap(384);call write~$Pointer$(main_#t~malloc40#1.base, main_#t~malloc40#1.offset, main_#t~mem39#1.base, main_#t~mem39#1.offset, 4);havoc main_#t~mem39#1.base, main_#t~mem39#1.offset;havoc main_#t~malloc40#1.base, main_#t~malloc40#1.offset;call main_#t~mem41#1.base, main_#t~mem41#1.offset := read~$Pointer$(main_~user~0#1.base, 8 + main_~user~0#1.offset, 4);call write~int(2685476833, main_#t~mem41#1.base, 40 + main_#t~mem41#1.offset, 4);havoc main_#t~mem41#1.base, main_#t~mem41#1.offset;call main_#t~mem42#1.base, main_#t~mem42#1.offset := read~$Pointer$(main_~user~0#1.base, 8 + main_~user~0#1.offset, 4);call main_#t~mem43#1.base, main_#t~mem43#1.offset := read~$Pointer$(main_#t~mem42#1.base, main_#t~mem42#1.offset, 4); {19174#(<= |ULTIMATE.start_main_~i~0#1| 2147483644)} is VALID [2022-02-21 03:13:59,086 INFO L284 TraceCheckUtils]: 56: Hoare quadruple {18240#true} {19174#(<= |ULTIMATE.start_main_~i~0#1| 2147483644)} #484#return; {19174#(<= |ULTIMATE.start_main_~i~0#1| 2147483644)} is VALID [2022-02-21 03:13:59,086 INFO L290 TraceCheckUtils]: 55: Hoare triple {18240#true} assume #res.base == #ptr.base && #res.offset == #ptr.offset; {18240#true} is VALID [2022-02-21 03:13:59,086 INFO L290 TraceCheckUtils]: 54: Hoare triple {18240#true} assume !(#t~loopctr143 % 4294967296 < #amount % 4294967296); {18240#true} is VALID [2022-02-21 03:13:59,086 INFO L290 TraceCheckUtils]: 53: Hoare triple {18240#true} assume #t~loopctr143 % 4294967296 < #amount % 4294967296;#memory_$Pointer$.base, #memory_$Pointer$.offset := #memory_$Pointer$.base[#ptr.base,#ptr.offset + #t~loopctr143 := 0], #memory_$Pointer$.offset[#ptr.base,#ptr.offset + #t~loopctr143 := #value % 256];#memory_int := #memory_int[#ptr.base,#ptr.offset + #t~loopctr143 := #value];#t~loopctr143 := 1 + #t~loopctr143; {18240#true} is VALID [2022-02-21 03:13:59,086 INFO L290 TraceCheckUtils]: 52: Hoare triple {18240#true} assume #t~loopctr143 % 4294967296 < #amount % 4294967296;#memory_$Pointer$.base, #memory_$Pointer$.offset := #memory_$Pointer$.base[#ptr.base,#ptr.offset + #t~loopctr143 := 0], #memory_$Pointer$.offset[#ptr.base,#ptr.offset + #t~loopctr143 := #value % 256];#memory_int := #memory_int[#ptr.base,#ptr.offset + #t~loopctr143 := #value];#t~loopctr143 := 1 + #t~loopctr143; {18240#true} is VALID [2022-02-21 03:13:59,086 INFO L290 TraceCheckUtils]: 51: Hoare triple {18240#true} assume #t~loopctr143 % 4294967296 < #amount % 4294967296;#memory_$Pointer$.base, #memory_$Pointer$.offset := #memory_$Pointer$.base[#ptr.base,#ptr.offset + #t~loopctr143 := 0], #memory_$Pointer$.offset[#ptr.base,#ptr.offset + #t~loopctr143 := #value % 256];#memory_int := #memory_int[#ptr.base,#ptr.offset + #t~loopctr143 := #value];#t~loopctr143 := 1 + #t~loopctr143; {18240#true} is VALID [2022-02-21 03:13:59,086 INFO L290 TraceCheckUtils]: 50: Hoare triple {18240#true} assume #t~loopctr143 % 4294967296 < #amount % 4294967296;#memory_$Pointer$.base, #memory_$Pointer$.offset := #memory_$Pointer$.base[#ptr.base,#ptr.offset + #t~loopctr143 := 0], #memory_$Pointer$.offset[#ptr.base,#ptr.offset + #t~loopctr143 := #value % 256];#memory_int := #memory_int[#ptr.base,#ptr.offset + #t~loopctr143 := #value];#t~loopctr143 := 1 + #t~loopctr143; {18240#true} is VALID [2022-02-21 03:13:59,087 INFO L290 TraceCheckUtils]: 49: Hoare triple {18240#true} assume #t~loopctr143 % 4294967296 < #amount % 4294967296;#memory_$Pointer$.base, #memory_$Pointer$.offset := #memory_$Pointer$.base[#ptr.base,#ptr.offset + #t~loopctr143 := 0], #memory_$Pointer$.offset[#ptr.base,#ptr.offset + #t~loopctr143 := #value % 256];#memory_int := #memory_int[#ptr.base,#ptr.offset + #t~loopctr143 := #value];#t~loopctr143 := 1 + #t~loopctr143; {18240#true} is VALID [2022-02-21 03:13:59,087 INFO L290 TraceCheckUtils]: 48: Hoare triple {18240#true} assume #t~loopctr143 % 4294967296 < #amount % 4294967296;#memory_$Pointer$.base, #memory_$Pointer$.offset := #memory_$Pointer$.base[#ptr.base,#ptr.offset + #t~loopctr143 := 0], #memory_$Pointer$.offset[#ptr.base,#ptr.offset + #t~loopctr143 := #value % 256];#memory_int := #memory_int[#ptr.base,#ptr.offset + #t~loopctr143 := #value];#t~loopctr143 := 1 + #t~loopctr143; {18240#true} is VALID [2022-02-21 03:13:59,087 INFO L290 TraceCheckUtils]: 47: Hoare triple {18240#true} assume #t~loopctr143 % 4294967296 < #amount % 4294967296;#memory_$Pointer$.base, #memory_$Pointer$.offset := #memory_$Pointer$.base[#ptr.base,#ptr.offset + #t~loopctr143 := 0], #memory_$Pointer$.offset[#ptr.base,#ptr.offset + #t~loopctr143 := #value % 256];#memory_int := #memory_int[#ptr.base,#ptr.offset + #t~loopctr143 := #value];#t~loopctr143 := 1 + #t~loopctr143; {18240#true} is VALID [2022-02-21 03:13:59,087 INFO L290 TraceCheckUtils]: 46: Hoare triple {18240#true} assume #t~loopctr143 % 4294967296 < #amount % 4294967296;#memory_$Pointer$.base, #memory_$Pointer$.offset := #memory_$Pointer$.base[#ptr.base,#ptr.offset + #t~loopctr143 := 0], #memory_$Pointer$.offset[#ptr.base,#ptr.offset + #t~loopctr143 := #value % 256];#memory_int := #memory_int[#ptr.base,#ptr.offset + #t~loopctr143 := #value];#t~loopctr143 := 1 + #t~loopctr143; {18240#true} is VALID [2022-02-21 03:13:59,087 INFO L290 TraceCheckUtils]: 45: Hoare triple {18240#true} assume #t~loopctr143 % 4294967296 < #amount % 4294967296;#memory_$Pointer$.base, #memory_$Pointer$.offset := #memory_$Pointer$.base[#ptr.base,#ptr.offset + #t~loopctr143 := 0], #memory_$Pointer$.offset[#ptr.base,#ptr.offset + #t~loopctr143 := #value % 256];#memory_int := #memory_int[#ptr.base,#ptr.offset + #t~loopctr143 := #value];#t~loopctr143 := 1 + #t~loopctr143; {18240#true} is VALID [2022-02-21 03:13:59,087 INFO L290 TraceCheckUtils]: 44: Hoare triple {18240#true} assume #t~loopctr143 % 4294967296 < #amount % 4294967296;#memory_$Pointer$.base, #memory_$Pointer$.offset := #memory_$Pointer$.base[#ptr.base,#ptr.offset + #t~loopctr143 := 0], #memory_$Pointer$.offset[#ptr.base,#ptr.offset + #t~loopctr143 := #value % 256];#memory_int := #memory_int[#ptr.base,#ptr.offset + #t~loopctr143 := #value];#t~loopctr143 := 1 + #t~loopctr143; {18240#true} is VALID [2022-02-21 03:13:59,087 INFO L290 TraceCheckUtils]: 43: Hoare triple {18240#true} #t~loopctr143 := 0; {18240#true} is VALID [2022-02-21 03:13:59,087 INFO L272 TraceCheckUtils]: 42: Hoare triple {19174#(<= |ULTIMATE.start_main_~i~0#1| 2147483644)} call main_#t~memset~res34#1.base, main_#t~memset~res34#1.offset := #Ultimate.C_memset(main_#t~mem33#1.base, main_#t~mem33#1.offset, 0, 44); {18240#true} is VALID [2022-02-21 03:13:59,087 INFO L290 TraceCheckUtils]: 41: Hoare triple {19174#(<= |ULTIMATE.start_main_~i~0#1| 2147483644)} assume !(main_#t~mem32#1.base == 0 && main_#t~mem32#1.offset == 0);havoc main_#t~mem32#1.base, main_#t~mem32#1.offset;call main_#t~mem33#1.base, main_#t~mem33#1.offset := read~$Pointer$(main_~user~0#1.base, 8 + main_~user~0#1.offset, 4); {19174#(<= |ULTIMATE.start_main_~i~0#1| 2147483644)} is VALID [2022-02-21 03:13:59,087 INFO L290 TraceCheckUtils]: 40: Hoare triple {19174#(<= |ULTIMATE.start_main_~i~0#1| 2147483644)} call main_#t~malloc31#1.base, main_#t~malloc31#1.offset := #Ultimate.allocOnHeap(44);call write~$Pointer$(main_#t~malloc31#1.base, main_#t~malloc31#1.offset, main_~user~0#1.base, 8 + main_~user~0#1.offset, 4);havoc main_#t~malloc31#1.base, main_#t~malloc31#1.offset;call main_#t~mem32#1.base, main_#t~mem32#1.offset := read~$Pointer$(main_~user~0#1.base, 8 + main_~user~0#1.offset, 4); {19174#(<= |ULTIMATE.start_main_~i~0#1| 2147483644)} is VALID [2022-02-21 03:13:59,088 INFO L290 TraceCheckUtils]: 39: Hoare triple {19174#(<= |ULTIMATE.start_main_~i~0#1| 2147483644)} 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); {19174#(<= |ULTIMATE.start_main_~i~0#1| 2147483644)} is VALID [2022-02-21 03:13:59,088 INFO L290 TraceCheckUtils]: 38: Hoare triple {19174#(<= |ULTIMATE.start_main_~i~0#1| 2147483644)} 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); {19174#(<= |ULTIMATE.start_main_~i~0#1| 2147483644)} is VALID [2022-02-21 03:13:59,088 INFO L290 TraceCheckUtils]: 37: Hoare triple {19174#(<= |ULTIMATE.start_main_~i~0#1| 2147483644)} goto; {19174#(<= |ULTIMATE.start_main_~i~0#1| 2147483644)} is VALID [2022-02-21 03:13:59,088 INFO L290 TraceCheckUtils]: 36: Hoare triple {19174#(<= |ULTIMATE.start_main_~i~0#1| 2147483644)} goto; {19174#(<= |ULTIMATE.start_main_~i~0#1| 2147483644)} is VALID [2022-02-21 03:13:59,089 INFO L290 TraceCheckUtils]: 35: Hoare triple {19174#(<= |ULTIMATE.start_main_~i~0#1| 2147483644)} goto; {19174#(<= |ULTIMATE.start_main_~i~0#1| 2147483644)} is VALID [2022-02-21 03:13:59,089 INFO L290 TraceCheckUtils]: 34: Hoare triple {19174#(<= |ULTIMATE.start_main_~i~0#1| 2147483644)} 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)))); {19174#(<= |ULTIMATE.start_main_~i~0#1| 2147483644)} is VALID [2022-02-21 03:13:59,089 INFO L290 TraceCheckUtils]: 33: Hoare triple {19174#(<= |ULTIMATE.start_main_~i~0#1| 2147483644)} havoc main_#t~switch19#1; {19174#(<= |ULTIMATE.start_main_~i~0#1| 2147483644)} is VALID [2022-02-21 03:13:59,089 INFO L290 TraceCheckUtils]: 32: Hoare triple {19174#(<= |ULTIMATE.start_main_~i~0#1| 2147483644)} assume main_#t~switch19#1;call main_#t~mem30#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~mem30#1 % 256;havoc main_#t~mem30#1; {19174#(<= |ULTIMATE.start_main_~i~0#1| 2147483644)} is VALID [2022-02-21 03:13:59,090 INFO L290 TraceCheckUtils]: 31: Hoare triple {19174#(<= |ULTIMATE.start_main_~i~0#1| 2147483644)} main_#t~switch19#1 := main_#t~switch19#1 || 1 == main_~_hj_k~0#1; {19174#(<= |ULTIMATE.start_main_~i~0#1| 2147483644)} is VALID [2022-02-21 03:13:59,090 INFO L290 TraceCheckUtils]: 30: Hoare triple {19174#(<= |ULTIMATE.start_main_~i~0#1| 2147483644)} assume main_#t~switch19#1;call main_#t~mem29#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~mem29#1 % 256);havoc main_#t~mem29#1; {19174#(<= |ULTIMATE.start_main_~i~0#1| 2147483644)} is VALID [2022-02-21 03:13:59,090 INFO L290 TraceCheckUtils]: 29: Hoare triple {19174#(<= |ULTIMATE.start_main_~i~0#1| 2147483644)} main_#t~switch19#1 := main_#t~switch19#1 || 2 == main_~_hj_k~0#1; {19174#(<= |ULTIMATE.start_main_~i~0#1| 2147483644)} is VALID [2022-02-21 03:13:59,090 INFO L290 TraceCheckUtils]: 28: Hoare triple {19174#(<= |ULTIMATE.start_main_~i~0#1| 2147483644)} assume main_#t~switch19#1;call main_#t~mem28#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~mem28#1 % 256);havoc main_#t~mem28#1; {19174#(<= |ULTIMATE.start_main_~i~0#1| 2147483644)} is VALID [2022-02-21 03:13:59,091 INFO L290 TraceCheckUtils]: 27: Hoare triple {19174#(<= |ULTIMATE.start_main_~i~0#1| 2147483644)} main_#t~switch19#1 := main_#t~switch19#1 || 3 == main_~_hj_k~0#1; {19174#(<= |ULTIMATE.start_main_~i~0#1| 2147483644)} is VALID [2022-02-21 03:13:59,091 INFO L290 TraceCheckUtils]: 26: Hoare triple {19174#(<= |ULTIMATE.start_main_~i~0#1| 2147483644)} assume main_#t~switch19#1;call main_#t~mem27#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~mem27#1 % 256);havoc main_#t~mem27#1; {19174#(<= |ULTIMATE.start_main_~i~0#1| 2147483644)} is VALID [2022-02-21 03:13:59,091 INFO L290 TraceCheckUtils]: 25: Hoare triple {19174#(<= |ULTIMATE.start_main_~i~0#1| 2147483644)} main_#t~switch19#1 := main_#t~switch19#1 || 4 == main_~_hj_k~0#1; {19174#(<= |ULTIMATE.start_main_~i~0#1| 2147483644)} is VALID [2022-02-21 03:13:59,091 INFO L290 TraceCheckUtils]: 24: Hoare triple {19174#(<= |ULTIMATE.start_main_~i~0#1| 2147483644)} assume !main_#t~switch19#1; {19174#(<= |ULTIMATE.start_main_~i~0#1| 2147483644)} is VALID [2022-02-21 03:13:59,092 INFO L290 TraceCheckUtils]: 23: Hoare triple {19174#(<= |ULTIMATE.start_main_~i~0#1| 2147483644)} main_#t~switch19#1 := main_#t~switch19#1 || 5 == main_~_hj_k~0#1; {19174#(<= |ULTIMATE.start_main_~i~0#1| 2147483644)} is VALID [2022-02-21 03:13:59,092 INFO L290 TraceCheckUtils]: 22: Hoare triple {19174#(<= |ULTIMATE.start_main_~i~0#1| 2147483644)} assume !main_#t~switch19#1; {19174#(<= |ULTIMATE.start_main_~i~0#1| 2147483644)} is VALID [2022-02-21 03:13:59,092 INFO L290 TraceCheckUtils]: 21: Hoare triple {19174#(<= |ULTIMATE.start_main_~i~0#1| 2147483644)} main_#t~switch19#1 := main_#t~switch19#1 || 6 == main_~_hj_k~0#1; {19174#(<= |ULTIMATE.start_main_~i~0#1| 2147483644)} is VALID [2022-02-21 03:13:59,092 INFO L290 TraceCheckUtils]: 20: Hoare triple {19174#(<= |ULTIMATE.start_main_~i~0#1| 2147483644)} assume !main_#t~switch19#1; {19174#(<= |ULTIMATE.start_main_~i~0#1| 2147483644)} is VALID [2022-02-21 03:13:59,093 INFO L290 TraceCheckUtils]: 19: Hoare triple {19174#(<= |ULTIMATE.start_main_~i~0#1| 2147483644)} main_#t~switch19#1 := main_#t~switch19#1 || 7 == main_~_hj_k~0#1; {19174#(<= |ULTIMATE.start_main_~i~0#1| 2147483644)} is VALID [2022-02-21 03:13:59,093 INFO L290 TraceCheckUtils]: 18: Hoare triple {19174#(<= |ULTIMATE.start_main_~i~0#1| 2147483644)} assume !main_#t~switch19#1; {19174#(<= |ULTIMATE.start_main_~i~0#1| 2147483644)} is VALID [2022-02-21 03:13:59,093 INFO L290 TraceCheckUtils]: 17: Hoare triple {19174#(<= |ULTIMATE.start_main_~i~0#1| 2147483644)} main_#t~switch19#1 := main_#t~switch19#1 || 8 == main_~_hj_k~0#1; {19174#(<= |ULTIMATE.start_main_~i~0#1| 2147483644)} is VALID [2022-02-21 03:13:59,095 INFO L290 TraceCheckUtils]: 16: Hoare triple {19174#(<= |ULTIMATE.start_main_~i~0#1| 2147483644)} assume !main_#t~switch19#1; {19174#(<= |ULTIMATE.start_main_~i~0#1| 2147483644)} is VALID [2022-02-21 03:13:59,098 INFO L290 TraceCheckUtils]: 15: Hoare triple {19174#(<= |ULTIMATE.start_main_~i~0#1| 2147483644)} main_#t~switch19#1 := main_#t~switch19#1 || 9 == main_~_hj_k~0#1; {19174#(<= |ULTIMATE.start_main_~i~0#1| 2147483644)} is VALID [2022-02-21 03:13:59,098 INFO L290 TraceCheckUtils]: 14: Hoare triple {19174#(<= |ULTIMATE.start_main_~i~0#1| 2147483644)} assume !main_#t~switch19#1; {19174#(<= |ULTIMATE.start_main_~i~0#1| 2147483644)} is VALID [2022-02-21 03:13:59,098 INFO L290 TraceCheckUtils]: 13: Hoare triple {19174#(<= |ULTIMATE.start_main_~i~0#1| 2147483644)} main_#t~switch19#1 := main_#t~switch19#1 || 10 == main_~_hj_k~0#1; {19174#(<= |ULTIMATE.start_main_~i~0#1| 2147483644)} is VALID [2022-02-21 03:13:59,099 INFO L290 TraceCheckUtils]: 12: Hoare triple {19174#(<= |ULTIMATE.start_main_~i~0#1| 2147483644)} assume !main_#t~switch19#1; {19174#(<= |ULTIMATE.start_main_~i~0#1| 2147483644)} is VALID [2022-02-21 03:13:59,099 INFO L290 TraceCheckUtils]: 11: Hoare triple {19174#(<= |ULTIMATE.start_main_~i~0#1| 2147483644)} main_~_ha_hashv~0#1 := 4 + main_~_ha_hashv~0#1;main_#t~switch19#1 := 11 == main_~_hj_k~0#1; {19174#(<= |ULTIMATE.start_main_~i~0#1| 2147483644)} is VALID [2022-02-21 03:13:59,099 INFO L290 TraceCheckUtils]: 10: Hoare triple {19174#(<= |ULTIMATE.start_main_~i~0#1| 2147483644)} assume !(main_~_hj_k~0#1 % 4294967296 >= 12); {19174#(<= |ULTIMATE.start_main_~i~0#1| 2147483644)} is VALID [2022-02-21 03:13:59,099 INFO L290 TraceCheckUtils]: 9: Hoare triple {19174#(<= |ULTIMATE.start_main_~i~0#1| 2147483644)} 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; {19174#(<= |ULTIMATE.start_main_~i~0#1| 2147483644)} is VALID [2022-02-21 03:13:59,100 INFO L290 TraceCheckUtils]: 8: Hoare triple {19174#(<= |ULTIMATE.start_main_~i~0#1| 2147483644)} goto; {19174#(<= |ULTIMATE.start_main_~i~0#1| 2147483644)} is VALID [2022-02-21 03:13:59,100 INFO L290 TraceCheckUtils]: 7: Hoare triple {19174#(<= |ULTIMATE.start_main_~i~0#1| 2147483644)} havoc main_~_ha_hashv~0#1; {19174#(<= |ULTIMATE.start_main_~i~0#1| 2147483644)} is VALID [2022-02-21 03:13:59,100 INFO L290 TraceCheckUtils]: 6: Hoare triple {19174#(<= |ULTIMATE.start_main_~i~0#1| 2147483644)} assume main_~i~0#1 * main_~i~0#1 >= -2147483648;call write~int(main_~i~0#1 * main_~i~0#1, main_~user~0#1.base, 4 + main_~user~0#1.offset, 4); {19174#(<= |ULTIMATE.start_main_~i~0#1| 2147483644)} is VALID [2022-02-21 03:13:59,100 INFO L290 TraceCheckUtils]: 5: Hoare triple {19174#(<= |ULTIMATE.start_main_~i~0#1| 2147483644)} assume main_~i~0#1 * main_~i~0#1 <= 2147483647; {19174#(<= |ULTIMATE.start_main_~i~0#1| 2147483644)} is VALID [2022-02-21 03:13:59,101 INFO L290 TraceCheckUtils]: 4: Hoare triple {19174#(<= |ULTIMATE.start_main_~i~0#1| 2147483644)} call write~int(main_~i~0#1, main_~user~0#1.base, main_~user~0#1.offset, 4); {19174#(<= |ULTIMATE.start_main_~i~0#1| 2147483644)} is VALID [2022-02-21 03:13:59,101 INFO L290 TraceCheckUtils]: 3: Hoare triple {19174#(<= |ULTIMATE.start_main_~i~0#1| 2147483644)} assume !(main_~user~0#1.base == 0 && main_~user~0#1.offset == 0); {19174#(<= |ULTIMATE.start_main_~i~0#1| 2147483644)} is VALID [2022-02-21 03:13:59,101 INFO L290 TraceCheckUtils]: 2: Hoare triple {19174#(<= |ULTIMATE.start_main_~i~0#1| 2147483644)} assume !!(main_~i~0#1 < 10);call main_#t~malloc6#1.base, main_#t~malloc6#1.offset := #Ultimate.allocOnHeap(40);main_~user~0#1.base, main_~user~0#1.offset := main_#t~malloc6#1.base, main_#t~malloc6#1.offset;havoc main_#t~malloc6#1.base, main_#t~malloc6#1.offset; {19174#(<= |ULTIMATE.start_main_~i~0#1| 2147483644)} is VALID [2022-02-21 03:13:59,101 INFO L290 TraceCheckUtils]: 1: Hoare triple {18240#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc6#1.base, main_#t~malloc6#1.offset, main_#t~mem8#1, main_#t~mem7#1, main_#t~mem9#1, main_#t~mem10#1, main_#t~mem12#1, main_#t~mem11#1, main_#t~mem13#1, main_#t~mem14#1, main_#t~mem16#1, main_#t~mem15#1, main_#t~mem17#1, main_#t~mem18#1, main_#t~switch19#1, main_#t~mem20#1, main_#t~mem21#1, main_#t~mem22#1, main_#t~mem23#1, main_#t~mem24#1, main_#t~mem25#1, main_#t~mem26#1, main_#t~mem27#1, main_#t~mem28#1, main_#t~mem29#1, main_#t~mem30#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~malloc31#1.base, main_#t~malloc31#1.offset, main_#t~mem32#1.base, main_#t~mem32#1.offset, main_#t~mem33#1.base, main_#t~mem33#1.offset, main_#t~memset~res34#1.base, main_#t~memset~res34#1.offset, main_#t~mem35#1.base, main_#t~mem35#1.offset, main_#t~mem36#1.base, main_#t~mem36#1.offset, main_#t~mem37#1.base, main_#t~mem37#1.offset, main_#t~mem38#1.base, main_#t~mem38#1.offset, main_#t~mem39#1.base, main_#t~mem39#1.offset, main_#t~malloc40#1.base, main_#t~malloc40#1.offset, main_#t~mem41#1.base, main_#t~mem41#1.offset, main_#t~mem42#1.base, main_#t~mem42#1.offset, main_#t~mem43#1.base, main_#t~mem43#1.offset, main_#t~mem44#1.base, main_#t~mem44#1.offset, main_#t~mem45#1.base, main_#t~mem45#1.offset, main_#t~mem46#1.base, main_#t~mem46#1.offset, main_#t~memset~res47#1.base, main_#t~memset~res47#1.offset, main_#t~mem48#1.base, main_#t~mem48#1.offset, main_#t~mem49#1.base, main_#t~mem49#1.offset, main_#t~mem50#1.base, main_#t~mem50#1.offset, main_#t~mem51#1.base, main_#t~mem51#1.offset, main_#t~mem52#1, main_#t~mem53#1.base, main_#t~mem53#1.offset, main_#t~mem54#1.base, main_#t~mem54#1.offset, main_#t~mem55#1.base, main_#t~mem55#1.offset, main_#t~mem56#1.base, main_#t~mem56#1.offset, main_#t~mem57#1, main_#t~post58#1, main_#t~mem59#1.base, main_#t~mem59#1.offset, main_#t~mem60#1, main_#t~mem61#1.base, main_#t~mem61#1.offset, main_#t~mem62#1.base, main_#t~mem62#1.offset, main_#t~mem63#1, main_#t~post64#1, main_#t~mem65#1.base, main_#t~mem65#1.offset, main_#t~mem66#1.base, main_#t~mem66#1.offset, main_#t~mem67#1.base, main_#t~mem67#1.offset, main_#t~mem69#1, main_#t~mem68#1, main_#t~mem70#1.base, main_#t~mem70#1.offset, main_#t~mem71#1, main_#t~short72#1, main_#t~mem73#1.base, main_#t~mem73#1.offset, main_#t~mem74#1, main_#t~malloc75#1.base, main_#t~malloc75#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~mem79#1, main_#t~memset~res80#1.base, main_#t~memset~res80#1.offset, main_#t~mem81#1.base, main_#t~mem81#1.offset, main_#t~mem82#1.base, main_#t~mem82#1.offset, main_#t~mem85#1, main_#t~mem83#1.base, main_#t~mem83#1.offset, main_#t~mem84#1, main_#t~mem86#1.base, main_#t~mem86#1.offset, main_#t~mem89#1, main_#t~mem87#1.base, main_#t~mem87#1.offset, main_#t~mem88#1, main_#t~ite90#1, main_#t~mem91#1.base, main_#t~mem91#1.offset, main_#t~mem95#1.base, main_#t~mem95#1.offset, main_#t~mem96#1.base, main_#t~mem96#1.offset, main_#t~mem97#1.base, main_#t~mem97#1.offset, main_#t~mem98#1.base, main_#t~mem98#1.offset, main_#t~mem101#1, main_#t~mem99#1.base, main_#t~mem99#1.offset, main_#t~mem100#1, main_#t~mem102#1.base, main_#t~mem102#1.offset, main_#t~mem103#1, main_#t~pre104#1, main_#t~mem105#1.base, main_#t~mem105#1.offset, main_#t~mem106#1, main_#t~mem107#1.base, main_#t~mem107#1.offset, main_#t~mem108#1, main_#t~post109#1, main_#t~mem113#1, main_#t~mem111#1, main_#t~mem110#1.base, main_#t~mem110#1.offset, main_#t~mem112#1, main_#t~mem114#1, main_#t~post115#1, main_#t~mem116#1.base, main_#t~mem116#1.offset, main_#t~mem117#1.base, main_#t~mem117#1.offset, main_#t~mem118#1.base, main_#t~mem118#1.offset, main_#t~post92#1, main_#t~mem93#1.base, main_#t~mem93#1.offset, main_#t~mem94#1, main_#t~mem119#1.base, main_#t~mem119#1.offset, main_#t~mem120#1.base, main_#t~mem120#1.offset, main_#t~mem121#1.base, main_#t~mem121#1.offset, main_#t~mem122#1, main_#t~mem123#1.base, main_#t~mem123#1.offset, main_#t~mem124#1, main_#t~post125#1, main_#t~mem126#1.base, main_#t~mem126#1.offset, main_#t~mem127#1.base, main_#t~mem127#1.offset, main_#t~mem128#1.base, main_#t~mem128#1.offset, main_#t~mem129#1.base, main_#t~mem129#1.offset, main_#t~mem132#1, main_#t~mem130#1.base, main_#t~mem130#1.offset, main_#t~mem131#1, main_#t~ite135#1, main_#t~mem133#1.base, main_#t~mem133#1.offset, main_#t~mem134#1, main_#t~mem136#1.base, main_#t~mem136#1.offset, main_#t~mem137#1, main_#t~mem138#1.base, main_#t~mem138#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~post5#1, main_#t~mem140#1, main_#t~mem141#1, main_#t~mem139#1.base, main_#t~mem139#1.offset, main_~i~0#1, main_~user~0#1.base, main_~user~0#1.offset, main_~users~0#1.base, main_~users~0#1.offset;havoc main_~i~0#1;havoc main_~user~0#1.base, main_~user~0#1.offset;main_~users~0#1.base, main_~users~0#1.offset := 0, 0;main_~i~0#1 := 0; {19174#(<= |ULTIMATE.start_main_~i~0#1| 2147483644)} is VALID [2022-02-21 03:13:59,102 INFO L290 TraceCheckUtils]: 0: Hoare triple {18240#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);~count_int_int~0 := 0; {18240#true} is VALID [2022-02-21 03:13:59,102 INFO L134 CoverageAnalysis]: Checked inductivity of 298 backedges. 0 proven. 159 refuted. 0 times theorem prover too weak. 139 trivial. 0 not checked. [2022-02-21 03:13:59,102 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 03:13:59,102 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1713916889] [2022-02-21 03:13:59,102 WARN L317 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-02-21 03:13:59,102 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1815117459] [2022-02-21 03:13:59,102 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1815117459] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-21 03:13:59,102 INFO L191 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-02-21 03:13:59,102 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 13 [2022-02-21 03:13:59,102 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [138057707] [2022-02-21 03:13:59,103 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-02-21 03:13:59,103 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 26.53846153846154) internal successors, (345), 14 states have internal predecessors, (345), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 196 [2022-02-21 03:13:59,104 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-21 03:13:59,104 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 14 states, 13 states have (on average 26.53846153846154) internal successors, (345), 14 states have internal predecessors, (345), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-02-21 03:13:59,399 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 353 edges. 353 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:13:59,399 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-02-21 03:13:59,399 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 03:13:59,399 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-02-21 03:13:59,399 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=127, Unknown=0, NotChecked=0, Total=182 [2022-02-21 03:13:59,400 INFO L87 Difference]: Start difference. First operand 342 states and 429 transitions. Second operand has 14 states, 13 states have (on average 26.53846153846154) internal successors, (345), 14 states have internal predecessors, (345), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-02-21 03:14:01,649 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:14:01,649 INFO L93 Difference]: Finished difference Result 465 states and 594 transitions. [2022-02-21 03:14:01,649 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-02-21 03:14:01,649 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 26.53846153846154) internal successors, (345), 14 states have internal predecessors, (345), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 196 [2022-02-21 03:14:01,650 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-21 03:14:01,650 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 13 states have (on average 26.53846153846154) internal successors, (345), 14 states have internal predecessors, (345), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-02-21 03:14:01,654 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 537 transitions. [2022-02-21 03:14:01,654 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 13 states have (on average 26.53846153846154) internal successors, (345), 14 states have internal predecessors, (345), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-02-21 03:14:01,657 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 537 transitions. [2022-02-21 03:14:01,657 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 11 states and 537 transitions. [2022-02-21 03:14:02,106 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 537 edges. 537 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:14:02,114 INFO L225 Difference]: With dead ends: 465 [2022-02-21 03:14:02,114 INFO L226 Difference]: Without dead ends: 464 [2022-02-21 03:14:02,114 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 394 GetRequests, 378 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=105, Invalid=201, Unknown=0, NotChecked=0, Total=306 [2022-02-21 03:14:02,115 INFO L933 BasicCegarLoop]: 235 mSDtfsCounter, 293 mSDsluCounter, 1441 mSDsCounter, 0 mSdLazyCounter, 132 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 321 SdHoareTripleChecker+Valid, 1676 SdHoareTripleChecker+Invalid, 147 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 132 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-21 03:14:02,115 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [321 Valid, 1676 Invalid, 147 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 132 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-21 03:14:02,116 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 464 states. [2022-02-21 03:14:02,246 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 464 to 341. [2022-02-21 03:14:02,246 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 03:14:02,247 INFO L82 GeneralOperation]: Start isEquivalent. First operand 464 states. Second operand has 341 states, 316 states have (on average 1.2246835443037976) internal successors, (387), 328 states have internal predecessors, (387), 19 states have call successors, (19), 3 states have call predecessors, (19), 4 states have return successors, (22), 10 states have call predecessors, (22), 19 states have call successors, (22) [2022-02-21 03:14:02,247 INFO L74 IsIncluded]: Start isIncluded. First operand 464 states. Second operand has 341 states, 316 states have (on average 1.2246835443037976) internal successors, (387), 328 states have internal predecessors, (387), 19 states have call successors, (19), 3 states have call predecessors, (19), 4 states have return successors, (22), 10 states have call predecessors, (22), 19 states have call successors, (22) [2022-02-21 03:14:02,247 INFO L87 Difference]: Start difference. First operand 464 states. Second operand has 341 states, 316 states have (on average 1.2246835443037976) internal successors, (387), 328 states have internal predecessors, (387), 19 states have call successors, (19), 3 states have call predecessors, (19), 4 states have return successors, (22), 10 states have call predecessors, (22), 19 states have call successors, (22) [2022-02-21 03:14:02,257 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:14:02,258 INFO L93 Difference]: Finished difference Result 464 states and 592 transitions. [2022-02-21 03:14:02,258 INFO L276 IsEmpty]: Start isEmpty. Operand 464 states and 592 transitions. [2022-02-21 03:14:02,259 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:14:02,259 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:14:02,259 INFO L74 IsIncluded]: Start isIncluded. First operand has 341 states, 316 states have (on average 1.2246835443037976) internal successors, (387), 328 states have internal predecessors, (387), 19 states have call successors, (19), 3 states have call predecessors, (19), 4 states have return successors, (22), 10 states have call predecessors, (22), 19 states have call successors, (22) Second operand 464 states. [2022-02-21 03:14:02,259 INFO L87 Difference]: Start difference. First operand has 341 states, 316 states have (on average 1.2246835443037976) internal successors, (387), 328 states have internal predecessors, (387), 19 states have call successors, (19), 3 states have call predecessors, (19), 4 states have return successors, (22), 10 states have call predecessors, (22), 19 states have call successors, (22) Second operand 464 states. [2022-02-21 03:14:02,269 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:14:02,269 INFO L93 Difference]: Finished difference Result 464 states and 592 transitions. [2022-02-21 03:14:02,269 INFO L276 IsEmpty]: Start isEmpty. Operand 464 states and 592 transitions. [2022-02-21 03:14:02,270 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:14:02,270 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:14:02,270 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 03:14:02,270 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 03:14:02,270 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 341 states, 316 states have (on average 1.2246835443037976) internal successors, (387), 328 states have internal predecessors, (387), 19 states have call successors, (19), 3 states have call predecessors, (19), 4 states have return successors, (22), 10 states have call predecessors, (22), 19 states have call successors, (22) [2022-02-21 03:14:02,276 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 341 states to 341 states and 428 transitions. [2022-02-21 03:14:02,276 INFO L78 Accepts]: Start accepts. Automaton has 341 states and 428 transitions. Word has length 196 [2022-02-21 03:14:02,276 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-21 03:14:02,276 INFO L470 AbstractCegarLoop]: Abstraction has 341 states and 428 transitions. [2022-02-21 03:14:02,276 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 26.53846153846154) internal successors, (345), 14 states have internal predecessors, (345), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-02-21 03:14:02,277 INFO L276 IsEmpty]: Start isEmpty. Operand 341 states and 428 transitions. [2022-02-21 03:14:02,278 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 202 [2022-02-21 03:14:02,278 INFO L506 BasicCegarLoop]: Found error trace [2022-02-21 03:14:02,278 INFO L514 BasicCegarLoop]: trace histogram [15, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-21 03:14:02,307 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:14:02,498 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,SelfDestructingSolverStorable11 [2022-02-21 03:14:02,499 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2022-02-21 03:14:02,499 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:14:02,499 INFO L85 PathProgramCache]: Analyzing trace with hash -493453511, now seen corresponding path program 1 times [2022-02-21 03:14:02,499 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:14:02,499 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1280819251] [2022-02-21 03:14:02,499 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:14:02,499 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:14:02,673 ERROR L252 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-02-21 03:14:02,675 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1521528739] [2022-02-21 03:14:02,675 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:14:02,675 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-21 03:14:02,675 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:14:02,676 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:14:02,677 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:14:04,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:14:04,130 INFO L263 TraceCheckSpWp]: Trace formula consists of 3849 conjuncts, 8 conjunts are in the unsatisfiable core [2022-02-21 03:14:04,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:14:04,186 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 03:14:04,798 INFO L290 TraceCheckUtils]: 0: Hoare triple {21356#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);~count_int_int~0 := 0; {21356#true} is VALID [2022-02-21 03:14:04,798 INFO L290 TraceCheckUtils]: 1: Hoare triple {21356#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc6#1.base, main_#t~malloc6#1.offset, main_#t~mem8#1, main_#t~mem7#1, main_#t~mem9#1, main_#t~mem10#1, main_#t~mem12#1, main_#t~mem11#1, main_#t~mem13#1, main_#t~mem14#1, main_#t~mem16#1, main_#t~mem15#1, main_#t~mem17#1, main_#t~mem18#1, main_#t~switch19#1, main_#t~mem20#1, main_#t~mem21#1, main_#t~mem22#1, main_#t~mem23#1, main_#t~mem24#1, main_#t~mem25#1, main_#t~mem26#1, main_#t~mem27#1, main_#t~mem28#1, main_#t~mem29#1, main_#t~mem30#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~malloc31#1.base, main_#t~malloc31#1.offset, main_#t~mem32#1.base, main_#t~mem32#1.offset, main_#t~mem33#1.base, main_#t~mem33#1.offset, main_#t~memset~res34#1.base, main_#t~memset~res34#1.offset, main_#t~mem35#1.base, main_#t~mem35#1.offset, main_#t~mem36#1.base, main_#t~mem36#1.offset, main_#t~mem37#1.base, main_#t~mem37#1.offset, main_#t~mem38#1.base, main_#t~mem38#1.offset, main_#t~mem39#1.base, main_#t~mem39#1.offset, main_#t~malloc40#1.base, main_#t~malloc40#1.offset, main_#t~mem41#1.base, main_#t~mem41#1.offset, main_#t~mem42#1.base, main_#t~mem42#1.offset, main_#t~mem43#1.base, main_#t~mem43#1.offset, main_#t~mem44#1.base, main_#t~mem44#1.offset, main_#t~mem45#1.base, main_#t~mem45#1.offset, main_#t~mem46#1.base, main_#t~mem46#1.offset, main_#t~memset~res47#1.base, main_#t~memset~res47#1.offset, main_#t~mem48#1.base, main_#t~mem48#1.offset, main_#t~mem49#1.base, main_#t~mem49#1.offset, main_#t~mem50#1.base, main_#t~mem50#1.offset, main_#t~mem51#1.base, main_#t~mem51#1.offset, main_#t~mem52#1, main_#t~mem53#1.base, main_#t~mem53#1.offset, main_#t~mem54#1.base, main_#t~mem54#1.offset, main_#t~mem55#1.base, main_#t~mem55#1.offset, main_#t~mem56#1.base, main_#t~mem56#1.offset, main_#t~mem57#1, main_#t~post58#1, main_#t~mem59#1.base, main_#t~mem59#1.offset, main_#t~mem60#1, main_#t~mem61#1.base, main_#t~mem61#1.offset, main_#t~mem62#1.base, main_#t~mem62#1.offset, main_#t~mem63#1, main_#t~post64#1, main_#t~mem65#1.base, main_#t~mem65#1.offset, main_#t~mem66#1.base, main_#t~mem66#1.offset, main_#t~mem67#1.base, main_#t~mem67#1.offset, main_#t~mem69#1, main_#t~mem68#1, main_#t~mem70#1.base, main_#t~mem70#1.offset, main_#t~mem71#1, main_#t~short72#1, main_#t~mem73#1.base, main_#t~mem73#1.offset, main_#t~mem74#1, main_#t~malloc75#1.base, main_#t~malloc75#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~mem79#1, main_#t~memset~res80#1.base, main_#t~memset~res80#1.offset, main_#t~mem81#1.base, main_#t~mem81#1.offset, main_#t~mem82#1.base, main_#t~mem82#1.offset, main_#t~mem85#1, main_#t~mem83#1.base, main_#t~mem83#1.offset, main_#t~mem84#1, main_#t~mem86#1.base, main_#t~mem86#1.offset, main_#t~mem89#1, main_#t~mem87#1.base, main_#t~mem87#1.offset, main_#t~mem88#1, main_#t~ite90#1, main_#t~mem91#1.base, main_#t~mem91#1.offset, main_#t~mem95#1.base, main_#t~mem95#1.offset, main_#t~mem96#1.base, main_#t~mem96#1.offset, main_#t~mem97#1.base, main_#t~mem97#1.offset, main_#t~mem98#1.base, main_#t~mem98#1.offset, main_#t~mem101#1, main_#t~mem99#1.base, main_#t~mem99#1.offset, main_#t~mem100#1, main_#t~mem102#1.base, main_#t~mem102#1.offset, main_#t~mem103#1, main_#t~pre104#1, main_#t~mem105#1.base, main_#t~mem105#1.offset, main_#t~mem106#1, main_#t~mem107#1.base, main_#t~mem107#1.offset, main_#t~mem108#1, main_#t~post109#1, main_#t~mem113#1, main_#t~mem111#1, main_#t~mem110#1.base, main_#t~mem110#1.offset, main_#t~mem112#1, main_#t~mem114#1, main_#t~post115#1, main_#t~mem116#1.base, main_#t~mem116#1.offset, main_#t~mem117#1.base, main_#t~mem117#1.offset, main_#t~mem118#1.base, main_#t~mem118#1.offset, main_#t~post92#1, main_#t~mem93#1.base, main_#t~mem93#1.offset, main_#t~mem94#1, main_#t~mem119#1.base, main_#t~mem119#1.offset, main_#t~mem120#1.base, main_#t~mem120#1.offset, main_#t~mem121#1.base, main_#t~mem121#1.offset, main_#t~mem122#1, main_#t~mem123#1.base, main_#t~mem123#1.offset, main_#t~mem124#1, main_#t~post125#1, main_#t~mem126#1.base, main_#t~mem126#1.offset, main_#t~mem127#1.base, main_#t~mem127#1.offset, main_#t~mem128#1.base, main_#t~mem128#1.offset, main_#t~mem129#1.base, main_#t~mem129#1.offset, main_#t~mem132#1, main_#t~mem130#1.base, main_#t~mem130#1.offset, main_#t~mem131#1, main_#t~ite135#1, main_#t~mem133#1.base, main_#t~mem133#1.offset, main_#t~mem134#1, main_#t~mem136#1.base, main_#t~mem136#1.offset, main_#t~mem137#1, main_#t~mem138#1.base, main_#t~mem138#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~post5#1, main_#t~mem140#1, main_#t~mem141#1, main_#t~mem139#1.base, main_#t~mem139#1.offset, main_~i~0#1, main_~user~0#1.base, main_~user~0#1.offset, main_~users~0#1.base, main_~users~0#1.offset;havoc main_~i~0#1;havoc main_~user~0#1.base, main_~user~0#1.offset;main_~users~0#1.base, main_~users~0#1.offset := 0, 0;main_~i~0#1 := 0; {21364#(<= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-21 03:14:04,798 INFO L290 TraceCheckUtils]: 2: Hoare triple {21364#(<= |ULTIMATE.start_main_~i~0#1| 0)} assume !!(main_~i~0#1 < 10);call main_#t~malloc6#1.base, main_#t~malloc6#1.offset := #Ultimate.allocOnHeap(40);main_~user~0#1.base, main_~user~0#1.offset := main_#t~malloc6#1.base, main_#t~malloc6#1.offset;havoc main_#t~malloc6#1.base, main_#t~malloc6#1.offset; {21364#(<= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-21 03:14:04,799 INFO L290 TraceCheckUtils]: 3: Hoare triple {21364#(<= |ULTIMATE.start_main_~i~0#1| 0)} assume !(main_~user~0#1.base == 0 && main_~user~0#1.offset == 0); {21364#(<= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-21 03:14:04,799 INFO L290 TraceCheckUtils]: 4: Hoare triple {21364#(<= |ULTIMATE.start_main_~i~0#1| 0)} call write~int(main_~i~0#1, main_~user~0#1.base, main_~user~0#1.offset, 4); {21364#(<= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-21 03:14:04,799 INFO L290 TraceCheckUtils]: 5: Hoare triple {21364#(<= |ULTIMATE.start_main_~i~0#1| 0)} assume main_~i~0#1 * main_~i~0#1 <= 2147483647; {21364#(<= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-21 03:14:04,799 INFO L290 TraceCheckUtils]: 6: Hoare triple {21364#(<= |ULTIMATE.start_main_~i~0#1| 0)} assume main_~i~0#1 * main_~i~0#1 >= -2147483648;call write~int(main_~i~0#1 * main_~i~0#1, main_~user~0#1.base, 4 + main_~user~0#1.offset, 4); {21364#(<= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-21 03:14:04,800 INFO L290 TraceCheckUtils]: 7: Hoare triple {21364#(<= |ULTIMATE.start_main_~i~0#1| 0)} havoc main_~_ha_hashv~0#1; {21364#(<= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-21 03:14:04,800 INFO L290 TraceCheckUtils]: 8: Hoare triple {21364#(<= |ULTIMATE.start_main_~i~0#1| 0)} goto; {21364#(<= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-21 03:14:04,800 INFO L290 TraceCheckUtils]: 9: Hoare triple {21364#(<= |ULTIMATE.start_main_~i~0#1| 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; {21364#(<= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-21 03:14:04,800 INFO L290 TraceCheckUtils]: 10: Hoare triple {21364#(<= |ULTIMATE.start_main_~i~0#1| 0)} assume !(main_~_hj_k~0#1 % 4294967296 >= 12); {21364#(<= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-21 03:14:04,801 INFO L290 TraceCheckUtils]: 11: Hoare triple {21364#(<= |ULTIMATE.start_main_~i~0#1| 0)} main_~_ha_hashv~0#1 := 4 + main_~_ha_hashv~0#1;main_#t~switch19#1 := 11 == main_~_hj_k~0#1; {21364#(<= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-21 03:14:04,801 INFO L290 TraceCheckUtils]: 12: Hoare triple {21364#(<= |ULTIMATE.start_main_~i~0#1| 0)} assume !main_#t~switch19#1; {21364#(<= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-21 03:14:04,801 INFO L290 TraceCheckUtils]: 13: Hoare triple {21364#(<= |ULTIMATE.start_main_~i~0#1| 0)} main_#t~switch19#1 := main_#t~switch19#1 || 10 == main_~_hj_k~0#1; {21364#(<= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-21 03:14:04,801 INFO L290 TraceCheckUtils]: 14: Hoare triple {21364#(<= |ULTIMATE.start_main_~i~0#1| 0)} assume !main_#t~switch19#1; {21364#(<= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-21 03:14:04,802 INFO L290 TraceCheckUtils]: 15: Hoare triple {21364#(<= |ULTIMATE.start_main_~i~0#1| 0)} main_#t~switch19#1 := main_#t~switch19#1 || 9 == main_~_hj_k~0#1; {21364#(<= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-21 03:14:04,802 INFO L290 TraceCheckUtils]: 16: Hoare triple {21364#(<= |ULTIMATE.start_main_~i~0#1| 0)} assume !main_#t~switch19#1; {21364#(<= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-21 03:14:04,802 INFO L290 TraceCheckUtils]: 17: Hoare triple {21364#(<= |ULTIMATE.start_main_~i~0#1| 0)} main_#t~switch19#1 := main_#t~switch19#1 || 8 == main_~_hj_k~0#1; {21364#(<= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-21 03:14:04,802 INFO L290 TraceCheckUtils]: 18: Hoare triple {21364#(<= |ULTIMATE.start_main_~i~0#1| 0)} assume !main_#t~switch19#1; {21364#(<= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-21 03:14:04,802 INFO L290 TraceCheckUtils]: 19: Hoare triple {21364#(<= |ULTIMATE.start_main_~i~0#1| 0)} main_#t~switch19#1 := main_#t~switch19#1 || 7 == main_~_hj_k~0#1; {21364#(<= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-21 03:14:04,803 INFO L290 TraceCheckUtils]: 20: Hoare triple {21364#(<= |ULTIMATE.start_main_~i~0#1| 0)} assume !main_#t~switch19#1; {21364#(<= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-21 03:14:04,803 INFO L290 TraceCheckUtils]: 21: Hoare triple {21364#(<= |ULTIMATE.start_main_~i~0#1| 0)} main_#t~switch19#1 := main_#t~switch19#1 || 6 == main_~_hj_k~0#1; {21364#(<= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-21 03:14:04,803 INFO L290 TraceCheckUtils]: 22: Hoare triple {21364#(<= |ULTIMATE.start_main_~i~0#1| 0)} assume !main_#t~switch19#1; {21364#(<= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-21 03:14:04,803 INFO L290 TraceCheckUtils]: 23: Hoare triple {21364#(<= |ULTIMATE.start_main_~i~0#1| 0)} main_#t~switch19#1 := main_#t~switch19#1 || 5 == main_~_hj_k~0#1; {21364#(<= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-21 03:14:04,804 INFO L290 TraceCheckUtils]: 24: Hoare triple {21364#(<= |ULTIMATE.start_main_~i~0#1| 0)} assume !main_#t~switch19#1; {21364#(<= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-21 03:14:04,804 INFO L290 TraceCheckUtils]: 25: Hoare triple {21364#(<= |ULTIMATE.start_main_~i~0#1| 0)} main_#t~switch19#1 := main_#t~switch19#1 || 4 == main_~_hj_k~0#1; {21364#(<= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-21 03:14:04,804 INFO L290 TraceCheckUtils]: 26: Hoare triple {21364#(<= |ULTIMATE.start_main_~i~0#1| 0)} assume main_#t~switch19#1;call main_#t~mem27#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~mem27#1 % 256);havoc main_#t~mem27#1; {21364#(<= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-21 03:14:04,804 INFO L290 TraceCheckUtils]: 27: Hoare triple {21364#(<= |ULTIMATE.start_main_~i~0#1| 0)} main_#t~switch19#1 := main_#t~switch19#1 || 3 == main_~_hj_k~0#1; {21364#(<= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-21 03:14:04,805 INFO L290 TraceCheckUtils]: 28: Hoare triple {21364#(<= |ULTIMATE.start_main_~i~0#1| 0)} assume main_#t~switch19#1;call main_#t~mem28#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~mem28#1 % 256);havoc main_#t~mem28#1; {21364#(<= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-21 03:14:04,805 INFO L290 TraceCheckUtils]: 29: Hoare triple {21364#(<= |ULTIMATE.start_main_~i~0#1| 0)} main_#t~switch19#1 := main_#t~switch19#1 || 2 == main_~_hj_k~0#1; {21364#(<= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-21 03:14:04,805 INFO L290 TraceCheckUtils]: 30: Hoare triple {21364#(<= |ULTIMATE.start_main_~i~0#1| 0)} assume main_#t~switch19#1;call main_#t~mem29#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~mem29#1 % 256);havoc main_#t~mem29#1; {21364#(<= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-21 03:14:04,805 INFO L290 TraceCheckUtils]: 31: Hoare triple {21364#(<= |ULTIMATE.start_main_~i~0#1| 0)} main_#t~switch19#1 := main_#t~switch19#1 || 1 == main_~_hj_k~0#1; {21364#(<= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-21 03:14:04,807 INFO L290 TraceCheckUtils]: 32: Hoare triple {21364#(<= |ULTIMATE.start_main_~i~0#1| 0)} assume main_#t~switch19#1;call main_#t~mem30#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~mem30#1 % 256;havoc main_#t~mem30#1; {21364#(<= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-21 03:14:04,807 INFO L290 TraceCheckUtils]: 33: Hoare triple {21364#(<= |ULTIMATE.start_main_~i~0#1| 0)} havoc main_#t~switch19#1; {21364#(<= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-21 03:14:04,807 INFO L290 TraceCheckUtils]: 34: Hoare triple {21364#(<= |ULTIMATE.start_main_~i~0#1| 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)))); {21364#(<= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-21 03:14:04,808 INFO L290 TraceCheckUtils]: 35: Hoare triple {21364#(<= |ULTIMATE.start_main_~i~0#1| 0)} goto; {21364#(<= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-21 03:14:04,808 INFO L290 TraceCheckUtils]: 36: Hoare triple {21364#(<= |ULTIMATE.start_main_~i~0#1| 0)} goto; {21364#(<= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-21 03:14:04,808 INFO L290 TraceCheckUtils]: 37: Hoare triple {21364#(<= |ULTIMATE.start_main_~i~0#1| 0)} goto; {21364#(<= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-21 03:14:04,808 INFO L290 TraceCheckUtils]: 38: Hoare triple {21364#(<= |ULTIMATE.start_main_~i~0#1| 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); {21364#(<= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-21 03:14:04,809 INFO L290 TraceCheckUtils]: 39: Hoare triple {21364#(<= |ULTIMATE.start_main_~i~0#1| 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); {21364#(<= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-21 03:14:04,809 INFO L290 TraceCheckUtils]: 40: Hoare triple {21364#(<= |ULTIMATE.start_main_~i~0#1| 0)} call main_#t~malloc31#1.base, main_#t~malloc31#1.offset := #Ultimate.allocOnHeap(44);call write~$Pointer$(main_#t~malloc31#1.base, main_#t~malloc31#1.offset, main_~user~0#1.base, 8 + main_~user~0#1.offset, 4);havoc main_#t~malloc31#1.base, main_#t~malloc31#1.offset;call main_#t~mem32#1.base, main_#t~mem32#1.offset := read~$Pointer$(main_~user~0#1.base, 8 + main_~user~0#1.offset, 4); {21364#(<= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-21 03:14:04,809 INFO L290 TraceCheckUtils]: 41: Hoare triple {21364#(<= |ULTIMATE.start_main_~i~0#1| 0)} assume !(main_#t~mem32#1.base == 0 && main_#t~mem32#1.offset == 0);havoc main_#t~mem32#1.base, main_#t~mem32#1.offset;call main_#t~mem33#1.base, main_#t~mem33#1.offset := read~$Pointer$(main_~user~0#1.base, 8 + main_~user~0#1.offset, 4); {21364#(<= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-21 03:14:04,809 INFO L272 TraceCheckUtils]: 42: Hoare triple {21364#(<= |ULTIMATE.start_main_~i~0#1| 0)} call main_#t~memset~res34#1.base, main_#t~memset~res34#1.offset := #Ultimate.C_memset(main_#t~mem33#1.base, main_#t~mem33#1.offset, 0, 44); {21356#true} is VALID [2022-02-21 03:14:04,809 INFO L290 TraceCheckUtils]: 43: Hoare triple {21356#true} #t~loopctr143 := 0; {21356#true} is VALID [2022-02-21 03:14:04,809 INFO L290 TraceCheckUtils]: 44: Hoare triple {21356#true} assume #t~loopctr143 % 4294967296 < #amount % 4294967296;#memory_$Pointer$.base, #memory_$Pointer$.offset := #memory_$Pointer$.base[#ptr.base,#ptr.offset + #t~loopctr143 := 0], #memory_$Pointer$.offset[#ptr.base,#ptr.offset + #t~loopctr143 := #value % 256];#memory_int := #memory_int[#ptr.base,#ptr.offset + #t~loopctr143 := #value];#t~loopctr143 := 1 + #t~loopctr143; {21356#true} is VALID [2022-02-21 03:14:04,809 INFO L290 TraceCheckUtils]: 45: Hoare triple {21356#true} assume #t~loopctr143 % 4294967296 < #amount % 4294967296;#memory_$Pointer$.base, #memory_$Pointer$.offset := #memory_$Pointer$.base[#ptr.base,#ptr.offset + #t~loopctr143 := 0], #memory_$Pointer$.offset[#ptr.base,#ptr.offset + #t~loopctr143 := #value % 256];#memory_int := #memory_int[#ptr.base,#ptr.offset + #t~loopctr143 := #value];#t~loopctr143 := 1 + #t~loopctr143; {21356#true} is VALID [2022-02-21 03:14:04,809 INFO L290 TraceCheckUtils]: 46: Hoare triple {21356#true} assume #t~loopctr143 % 4294967296 < #amount % 4294967296;#memory_$Pointer$.base, #memory_$Pointer$.offset := #memory_$Pointer$.base[#ptr.base,#ptr.offset + #t~loopctr143 := 0], #memory_$Pointer$.offset[#ptr.base,#ptr.offset + #t~loopctr143 := #value % 256];#memory_int := #memory_int[#ptr.base,#ptr.offset + #t~loopctr143 := #value];#t~loopctr143 := 1 + #t~loopctr143; {21356#true} is VALID [2022-02-21 03:14:04,809 INFO L290 TraceCheckUtils]: 47: Hoare triple {21356#true} assume #t~loopctr143 % 4294967296 < #amount % 4294967296;#memory_$Pointer$.base, #memory_$Pointer$.offset := #memory_$Pointer$.base[#ptr.base,#ptr.offset + #t~loopctr143 := 0], #memory_$Pointer$.offset[#ptr.base,#ptr.offset + #t~loopctr143 := #value % 256];#memory_int := #memory_int[#ptr.base,#ptr.offset + #t~loopctr143 := #value];#t~loopctr143 := 1 + #t~loopctr143; {21356#true} is VALID [2022-02-21 03:14:04,809 INFO L290 TraceCheckUtils]: 48: Hoare triple {21356#true} assume #t~loopctr143 % 4294967296 < #amount % 4294967296;#memory_$Pointer$.base, #memory_$Pointer$.offset := #memory_$Pointer$.base[#ptr.base,#ptr.offset + #t~loopctr143 := 0], #memory_$Pointer$.offset[#ptr.base,#ptr.offset + #t~loopctr143 := #value % 256];#memory_int := #memory_int[#ptr.base,#ptr.offset + #t~loopctr143 := #value];#t~loopctr143 := 1 + #t~loopctr143; {21356#true} is VALID [2022-02-21 03:14:04,810 INFO L290 TraceCheckUtils]: 49: Hoare triple {21356#true} assume #t~loopctr143 % 4294967296 < #amount % 4294967296;#memory_$Pointer$.base, #memory_$Pointer$.offset := #memory_$Pointer$.base[#ptr.base,#ptr.offset + #t~loopctr143 := 0], #memory_$Pointer$.offset[#ptr.base,#ptr.offset + #t~loopctr143 := #value % 256];#memory_int := #memory_int[#ptr.base,#ptr.offset + #t~loopctr143 := #value];#t~loopctr143 := 1 + #t~loopctr143; {21356#true} is VALID [2022-02-21 03:14:04,810 INFO L290 TraceCheckUtils]: 50: Hoare triple {21356#true} assume #t~loopctr143 % 4294967296 < #amount % 4294967296;#memory_$Pointer$.base, #memory_$Pointer$.offset := #memory_$Pointer$.base[#ptr.base,#ptr.offset + #t~loopctr143 := 0], #memory_$Pointer$.offset[#ptr.base,#ptr.offset + #t~loopctr143 := #value % 256];#memory_int := #memory_int[#ptr.base,#ptr.offset + #t~loopctr143 := #value];#t~loopctr143 := 1 + #t~loopctr143; {21356#true} is VALID [2022-02-21 03:14:04,810 INFO L290 TraceCheckUtils]: 51: Hoare triple {21356#true} assume #t~loopctr143 % 4294967296 < #amount % 4294967296;#memory_$Pointer$.base, #memory_$Pointer$.offset := #memory_$Pointer$.base[#ptr.base,#ptr.offset + #t~loopctr143 := 0], #memory_$Pointer$.offset[#ptr.base,#ptr.offset + #t~loopctr143 := #value % 256];#memory_int := #memory_int[#ptr.base,#ptr.offset + #t~loopctr143 := #value];#t~loopctr143 := 1 + #t~loopctr143; {21356#true} is VALID [2022-02-21 03:14:04,810 INFO L290 TraceCheckUtils]: 52: Hoare triple {21356#true} assume #t~loopctr143 % 4294967296 < #amount % 4294967296;#memory_$Pointer$.base, #memory_$Pointer$.offset := #memory_$Pointer$.base[#ptr.base,#ptr.offset + #t~loopctr143 := 0], #memory_$Pointer$.offset[#ptr.base,#ptr.offset + #t~loopctr143 := #value % 256];#memory_int := #memory_int[#ptr.base,#ptr.offset + #t~loopctr143 := #value];#t~loopctr143 := 1 + #t~loopctr143; {21356#true} is VALID [2022-02-21 03:14:04,810 INFO L290 TraceCheckUtils]: 53: Hoare triple {21356#true} assume #t~loopctr143 % 4294967296 < #amount % 4294967296;#memory_$Pointer$.base, #memory_$Pointer$.offset := #memory_$Pointer$.base[#ptr.base,#ptr.offset + #t~loopctr143 := 0], #memory_$Pointer$.offset[#ptr.base,#ptr.offset + #t~loopctr143 := #value % 256];#memory_int := #memory_int[#ptr.base,#ptr.offset + #t~loopctr143 := #value];#t~loopctr143 := 1 + #t~loopctr143; {21356#true} is VALID [2022-02-21 03:14:04,810 INFO L290 TraceCheckUtils]: 54: Hoare triple {21356#true} assume !(#t~loopctr143 % 4294967296 < #amount % 4294967296); {21356#true} is VALID [2022-02-21 03:14:04,810 INFO L290 TraceCheckUtils]: 55: Hoare triple {21356#true} assume #res.base == #ptr.base && #res.offset == #ptr.offset; {21356#true} is VALID [2022-02-21 03:14:04,810 INFO L284 TraceCheckUtils]: 56: Hoare quadruple {21356#true} {21364#(<= |ULTIMATE.start_main_~i~0#1| 0)} #484#return; {21364#(<= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-21 03:14:04,811 INFO L290 TraceCheckUtils]: 57: Hoare triple {21364#(<= |ULTIMATE.start_main_~i~0#1| 0)} havoc main_#t~mem33#1.base, main_#t~mem33#1.offset;havoc main_#t~memset~res34#1.base, main_#t~memset~res34#1.offset;call main_#t~mem35#1.base, main_#t~mem35#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~mem35#1.base, 16 + main_#t~mem35#1.offset, 4);havoc main_#t~mem35#1.base, main_#t~mem35#1.offset;call main_#t~mem36#1.base, main_#t~mem36#1.offset := read~$Pointer$(main_~user~0#1.base, 8 + main_~user~0#1.offset, 4);call write~int(32, main_#t~mem36#1.base, 4 + main_#t~mem36#1.offset, 4);havoc main_#t~mem36#1.base, main_#t~mem36#1.offset;call main_#t~mem37#1.base, main_#t~mem37#1.offset := read~$Pointer$(main_~user~0#1.base, 8 + main_~user~0#1.offset, 4);call write~int(5, main_#t~mem37#1.base, 8 + main_#t~mem37#1.offset, 4);havoc main_#t~mem37#1.base, main_#t~mem37#1.offset;call main_#t~mem38#1.base, main_#t~mem38#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~mem38#1.base, 20 + main_#t~mem38#1.offset, 4);havoc main_#t~mem38#1.base, main_#t~mem38#1.offset;call main_#t~mem39#1.base, main_#t~mem39#1.offset := read~$Pointer$(main_~user~0#1.base, 8 + main_~user~0#1.offset, 4);call main_#t~malloc40#1.base, main_#t~malloc40#1.offset := #Ultimate.allocOnHeap(384);call write~$Pointer$(main_#t~malloc40#1.base, main_#t~malloc40#1.offset, main_#t~mem39#1.base, main_#t~mem39#1.offset, 4);havoc main_#t~mem39#1.base, main_#t~mem39#1.offset;havoc main_#t~malloc40#1.base, main_#t~malloc40#1.offset;call main_#t~mem41#1.base, main_#t~mem41#1.offset := read~$Pointer$(main_~user~0#1.base, 8 + main_~user~0#1.offset, 4);call write~int(2685476833, main_#t~mem41#1.base, 40 + main_#t~mem41#1.offset, 4);havoc main_#t~mem41#1.base, main_#t~mem41#1.offset;call main_#t~mem42#1.base, main_#t~mem42#1.offset := read~$Pointer$(main_~user~0#1.base, 8 + main_~user~0#1.offset, 4);call main_#t~mem43#1.base, main_#t~mem43#1.offset := read~$Pointer$(main_#t~mem42#1.base, main_#t~mem42#1.offset, 4); {21364#(<= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-21 03:14:04,811 INFO L290 TraceCheckUtils]: 58: Hoare triple {21364#(<= |ULTIMATE.start_main_~i~0#1| 0)} assume !(main_#t~mem43#1.base == 0 && main_#t~mem43#1.offset == 0);havoc main_#t~mem42#1.base, main_#t~mem42#1.offset;havoc main_#t~mem43#1.base, main_#t~mem43#1.offset;call main_#t~mem45#1.base, main_#t~mem45#1.offset := read~$Pointer$(main_~user~0#1.base, 8 + main_~user~0#1.offset, 4);call main_#t~mem46#1.base, main_#t~mem46#1.offset := read~$Pointer$(main_#t~mem45#1.base, main_#t~mem45#1.offset, 4); {21364#(<= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-21 03:14:04,811 INFO L272 TraceCheckUtils]: 59: Hoare triple {21364#(<= |ULTIMATE.start_main_~i~0#1| 0)} call main_#t~memset~res47#1.base, main_#t~memset~res47#1.offset := #Ultimate.C_memset(main_#t~mem46#1.base, main_#t~mem46#1.offset, 0, 384); {21356#true} is VALID [2022-02-21 03:14:04,811 INFO L290 TraceCheckUtils]: 60: Hoare triple {21356#true} #t~loopctr143 := 0; {21356#true} is VALID [2022-02-21 03:14:04,811 INFO L290 TraceCheckUtils]: 61: Hoare triple {21356#true} assume #t~loopctr143 % 4294967296 < #amount % 4294967296;#memory_$Pointer$.base, #memory_$Pointer$.offset := #memory_$Pointer$.base[#ptr.base,#ptr.offset + #t~loopctr143 := 0], #memory_$Pointer$.offset[#ptr.base,#ptr.offset + #t~loopctr143 := #value % 256];#memory_int := #memory_int[#ptr.base,#ptr.offset + #t~loopctr143 := #value];#t~loopctr143 := 1 + #t~loopctr143; {21356#true} is VALID [2022-02-21 03:14:04,811 INFO L290 TraceCheckUtils]: 62: Hoare triple {21356#true} assume #t~loopctr143 % 4294967296 < #amount % 4294967296;#memory_$Pointer$.base, #memory_$Pointer$.offset := #memory_$Pointer$.base[#ptr.base,#ptr.offset + #t~loopctr143 := 0], #memory_$Pointer$.offset[#ptr.base,#ptr.offset + #t~loopctr143 := #value % 256];#memory_int := #memory_int[#ptr.base,#ptr.offset + #t~loopctr143 := #value];#t~loopctr143 := 1 + #t~loopctr143; {21356#true} is VALID [2022-02-21 03:14:04,811 INFO L290 TraceCheckUtils]: 63: Hoare triple {21356#true} assume #t~loopctr143 % 4294967296 < #amount % 4294967296;#memory_$Pointer$.base, #memory_$Pointer$.offset := #memory_$Pointer$.base[#ptr.base,#ptr.offset + #t~loopctr143 := 0], #memory_$Pointer$.offset[#ptr.base,#ptr.offset + #t~loopctr143 := #value % 256];#memory_int := #memory_int[#ptr.base,#ptr.offset + #t~loopctr143 := #value];#t~loopctr143 := 1 + #t~loopctr143; {21356#true} is VALID [2022-02-21 03:14:04,811 INFO L290 TraceCheckUtils]: 64: Hoare triple {21356#true} assume #t~loopctr143 % 4294967296 < #amount % 4294967296;#memory_$Pointer$.base, #memory_$Pointer$.offset := #memory_$Pointer$.base[#ptr.base,#ptr.offset + #t~loopctr143 := 0], #memory_$Pointer$.offset[#ptr.base,#ptr.offset + #t~loopctr143 := #value % 256];#memory_int := #memory_int[#ptr.base,#ptr.offset + #t~loopctr143 := #value];#t~loopctr143 := 1 + #t~loopctr143; {21356#true} is VALID [2022-02-21 03:14:04,811 INFO L290 TraceCheckUtils]: 65: Hoare triple {21356#true} assume #t~loopctr143 % 4294967296 < #amount % 4294967296;#memory_$Pointer$.base, #memory_$Pointer$.offset := #memory_$Pointer$.base[#ptr.base,#ptr.offset + #t~loopctr143 := 0], #memory_$Pointer$.offset[#ptr.base,#ptr.offset + #t~loopctr143 := #value % 256];#memory_int := #memory_int[#ptr.base,#ptr.offset + #t~loopctr143 := #value];#t~loopctr143 := 1 + #t~loopctr143; {21356#true} is VALID [2022-02-21 03:14:04,811 INFO L290 TraceCheckUtils]: 66: Hoare triple {21356#true} assume !(#t~loopctr143 % 4294967296 < #amount % 4294967296); {21356#true} is VALID [2022-02-21 03:14:04,811 INFO L290 TraceCheckUtils]: 67: Hoare triple {21356#true} assume #res.base == #ptr.base && #res.offset == #ptr.offset; {21356#true} is VALID [2022-02-21 03:14:04,812 INFO L284 TraceCheckUtils]: 68: Hoare quadruple {21356#true} {21364#(<= |ULTIMATE.start_main_~i~0#1| 0)} #486#return; {21364#(<= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-21 03:14:04,812 INFO L290 TraceCheckUtils]: 69: Hoare triple {21364#(<= |ULTIMATE.start_main_~i~0#1| 0)} havoc main_#t~mem45#1.base, main_#t~mem45#1.offset;havoc main_#t~mem46#1.base, main_#t~mem46#1.offset;havoc main_#t~memset~res47#1.base, main_#t~memset~res47#1.offset; {21364#(<= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-21 03:14:04,812 INFO L290 TraceCheckUtils]: 70: Hoare triple {21364#(<= |ULTIMATE.start_main_~i~0#1| 0)} goto; {21364#(<= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-21 03:14:04,813 INFO L290 TraceCheckUtils]: 71: Hoare triple {21364#(<= |ULTIMATE.start_main_~i~0#1| 0)} main_~users~0#1.base, main_~users~0#1.offset := main_~user~0#1.base, main_~user~0#1.offset; {21364#(<= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-21 03:14:04,813 INFO L290 TraceCheckUtils]: 72: Hoare triple {21364#(<= |ULTIMATE.start_main_~i~0#1| 0)} havoc main_~_ha_bkt~0#1;call main_#t~mem56#1.base, main_#t~mem56#1.offset := read~$Pointer$(main_~users~0#1.base, 8 + main_~users~0#1.offset, 4);call main_#t~mem57#1 := read~int(main_#t~mem56#1.base, 12 + main_#t~mem56#1.offset, 4);main_#t~post58#1 := main_#t~mem57#1;call write~int(1 + main_#t~post58#1, main_#t~mem56#1.base, 12 + main_#t~mem56#1.offset, 4);havoc main_#t~mem56#1.base, main_#t~mem56#1.offset;havoc main_#t~mem57#1;havoc main_#t~post58#1; {21364#(<= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-21 03:14:04,813 INFO L290 TraceCheckUtils]: 73: Hoare triple {21364#(<= |ULTIMATE.start_main_~i~0#1| 0)} call main_#t~mem59#1.base, main_#t~mem59#1.offset := read~$Pointer$(main_~users~0#1.base, 8 + main_~users~0#1.offset, 4);call main_#t~mem60#1 := read~int(main_#t~mem59#1.base, 4 + main_#t~mem59#1.offset, 4);main_~_ha_bkt~0#1 := (if 0 == main_~_ha_hashv~0#1 || 0 == main_#t~mem60#1 - 1 then 0 else (if 1 == main_#t~mem60#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~mem60#1 - 1))) else (if 1 == main_~_ha_hashv~0#1 then (if 1 == main_#t~mem60#1 - 1 || 0 == main_#t~mem60#1 - 1 then main_#t~mem60#1 - 1 else (if main_#t~mem60#1 - 1 >= 0 then (main_#t~mem60#1 - 1) % 2 else ~bitwiseAnd(main_~_ha_hashv~0#1, main_#t~mem60#1 - 1))) else ~bitwiseAnd(main_~_ha_hashv~0#1, main_#t~mem60#1 - 1))));havoc main_#t~mem59#1.base, main_#t~mem59#1.offset;havoc main_#t~mem60#1; {21364#(<= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-21 03:14:04,813 INFO L290 TraceCheckUtils]: 74: Hoare triple {21364#(<= |ULTIMATE.start_main_~i~0#1| 0)} goto; {21364#(<= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-21 03:14:04,814 INFO L290 TraceCheckUtils]: 75: Hoare triple {21364#(<= |ULTIMATE.start_main_~i~0#1| 0)} call main_#t~mem61#1.base, main_#t~mem61#1.offset := read~$Pointer$(main_~users~0#1.base, 8 + main_~users~0#1.offset, 4);call main_#t~mem62#1.base, main_#t~mem62#1.offset := read~$Pointer$(main_#t~mem61#1.base, main_#t~mem61#1.offset, 4);main_~_ha_head~0#1.base, main_~_ha_head~0#1.offset := main_#t~mem62#1.base, main_#t~mem62#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~mem61#1.base, main_#t~mem61#1.offset;havoc main_#t~mem62#1.base, main_#t~mem62#1.offset;call main_#t~mem63#1 := read~int(main_~_ha_head~0#1.base, 4 + main_~_ha_head~0#1.offset, 4);main_#t~post64#1 := main_#t~mem63#1;call write~int(1 + main_#t~post64#1, main_~_ha_head~0#1.base, 4 + main_~_ha_head~0#1.offset, 4);havoc main_#t~mem63#1;havoc main_#t~post64#1;call main_#t~mem65#1.base, main_#t~mem65#1.offset := read~$Pointer$(main_~_ha_head~0#1.base, main_~_ha_head~0#1.offset, 4);call write~$Pointer$(main_#t~mem65#1.base, main_#t~mem65#1.offset, main_~user~0#1.base, 24 + main_~user~0#1.offset, 4);havoc main_#t~mem65#1.base, main_#t~mem65#1.offset;call write~$Pointer$(0, 0, main_~user~0#1.base, 20 + main_~user~0#1.offset, 4);call main_#t~mem66#1.base, main_#t~mem66#1.offset := read~$Pointer$(main_~_ha_head~0#1.base, main_~_ha_head~0#1.offset, 4); {21364#(<= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-21 03:14:04,814 INFO L290 TraceCheckUtils]: 76: Hoare triple {21364#(<= |ULTIMATE.start_main_~i~0#1| 0)} assume main_#t~mem66#1.base != 0 || main_#t~mem66#1.offset != 0;havoc main_#t~mem66#1.base, main_#t~mem66#1.offset;call main_#t~mem67#1.base, main_#t~mem67#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~mem67#1.base, 12 + main_#t~mem67#1.offset, 4);havoc main_#t~mem67#1.base, main_#t~mem67#1.offset; {21364#(<= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-21 03:14:04,814 INFO L290 TraceCheckUtils]: 77: Hoare triple {21364#(<= |ULTIMATE.start_main_~i~0#1| 0)} 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~mem69#1 := read~int(main_~_ha_head~0#1.base, 4 + main_~_ha_head~0#1.offset, 4);call main_#t~mem68#1 := read~int(main_~_ha_head~0#1.base, 8 + main_~_ha_head~0#1.offset, 4);main_#t~short72#1 := main_#t~mem69#1 % 4294967296 >= 10 * (1 + main_#t~mem68#1) % 4294967296; {21364#(<= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-21 03:14:04,814 INFO L290 TraceCheckUtils]: 78: Hoare triple {21364#(<= |ULTIMATE.start_main_~i~0#1| 0)} assume main_#t~short72#1;call main_#t~mem70#1.base, main_#t~mem70#1.offset := read~$Pointer$(main_~user~0#1.base, 8 + main_~user~0#1.offset, 4);call main_#t~mem71#1 := read~int(main_#t~mem70#1.base, 36 + main_#t~mem70#1.offset, 4);main_#t~short72#1 := 0 == main_#t~mem71#1 % 4294967296; {21364#(<= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-21 03:14:04,815 INFO L290 TraceCheckUtils]: 79: Hoare triple {21364#(<= |ULTIMATE.start_main_~i~0#1| 0)} assume !main_#t~short72#1;havoc main_#t~mem69#1;havoc main_#t~mem68#1;havoc main_#t~mem70#1.base, main_#t~mem70#1.offset;havoc main_#t~mem71#1;havoc main_#t~short72#1; {21364#(<= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-21 03:14:04,822 INFO L290 TraceCheckUtils]: 80: Hoare triple {21364#(<= |ULTIMATE.start_main_~i~0#1| 0)} goto; {21364#(<= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-21 03:14:04,823 INFO L290 TraceCheckUtils]: 81: Hoare triple {21364#(<= |ULTIMATE.start_main_~i~0#1| 0)} goto; {21364#(<= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-21 03:14:04,823 INFO L290 TraceCheckUtils]: 82: Hoare triple {21364#(<= |ULTIMATE.start_main_~i~0#1| 0)} goto; {21364#(<= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-21 03:14:04,823 INFO L290 TraceCheckUtils]: 83: Hoare triple {21364#(<= |ULTIMATE.start_main_~i~0#1| 0)} goto; {21364#(<= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-21 03:14:04,824 INFO L290 TraceCheckUtils]: 84: Hoare triple {21364#(<= |ULTIMATE.start_main_~i~0#1| 0)} main_#t~post5#1 := main_~i~0#1; {21614#(<= |ULTIMATE.start_main_#t~post5#1| 0)} is VALID [2022-02-21 03:14:04,824 INFO L290 TraceCheckUtils]: 85: Hoare triple {21614#(<= |ULTIMATE.start_main_#t~post5#1| 0)} assume 1 + main_#t~post5#1 <= 2147483647; {21614#(<= |ULTIMATE.start_main_#t~post5#1| 0)} is VALID [2022-02-21 03:14:04,824 INFO L290 TraceCheckUtils]: 86: Hoare triple {21614#(<= |ULTIMATE.start_main_#t~post5#1| 0)} assume 1 + main_#t~post5#1 >= -2147483648;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; {21621#(<= |ULTIMATE.start_main_~i~0#1| 1)} is VALID [2022-02-21 03:14:04,825 INFO L290 TraceCheckUtils]: 87: Hoare triple {21621#(<= |ULTIMATE.start_main_~i~0#1| 1)} assume !!(main_~i~0#1 < 10);call main_#t~malloc6#1.base, main_#t~malloc6#1.offset := #Ultimate.allocOnHeap(40);main_~user~0#1.base, main_~user~0#1.offset := main_#t~malloc6#1.base, main_#t~malloc6#1.offset;havoc main_#t~malloc6#1.base, main_#t~malloc6#1.offset; {21621#(<= |ULTIMATE.start_main_~i~0#1| 1)} is VALID [2022-02-21 03:14:04,825 INFO L290 TraceCheckUtils]: 88: Hoare triple {21621#(<= |ULTIMATE.start_main_~i~0#1| 1)} assume !(main_~user~0#1.base == 0 && main_~user~0#1.offset == 0); {21621#(<= |ULTIMATE.start_main_~i~0#1| 1)} is VALID [2022-02-21 03:14:04,825 INFO L290 TraceCheckUtils]: 89: Hoare triple {21621#(<= |ULTIMATE.start_main_~i~0#1| 1)} call write~int(main_~i~0#1, main_~user~0#1.base, main_~user~0#1.offset, 4); {21621#(<= |ULTIMATE.start_main_~i~0#1| 1)} is VALID [2022-02-21 03:14:04,826 INFO L290 TraceCheckUtils]: 90: Hoare triple {21621#(<= |ULTIMATE.start_main_~i~0#1| 1)} assume main_~i~0#1 * main_~i~0#1 <= 2147483647; {21621#(<= |ULTIMATE.start_main_~i~0#1| 1)} is VALID [2022-02-21 03:14:04,826 INFO L290 TraceCheckUtils]: 91: Hoare triple {21621#(<= |ULTIMATE.start_main_~i~0#1| 1)} assume main_~i~0#1 * main_~i~0#1 >= -2147483648;call write~int(main_~i~0#1 * main_~i~0#1, main_~user~0#1.base, 4 + main_~user~0#1.offset, 4); {21621#(<= |ULTIMATE.start_main_~i~0#1| 1)} is VALID [2022-02-21 03:14:04,826 INFO L290 TraceCheckUtils]: 92: Hoare triple {21621#(<= |ULTIMATE.start_main_~i~0#1| 1)} havoc main_~_ha_hashv~0#1; {21621#(<= |ULTIMATE.start_main_~i~0#1| 1)} is VALID [2022-02-21 03:14:04,826 INFO L290 TraceCheckUtils]: 93: Hoare triple {21621#(<= |ULTIMATE.start_main_~i~0#1| 1)} goto; {21621#(<= |ULTIMATE.start_main_~i~0#1| 1)} is VALID [2022-02-21 03:14:04,827 INFO L290 TraceCheckUtils]: 94: Hoare triple {21621#(<= |ULTIMATE.start_main_~i~0#1| 1)} 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; {21621#(<= |ULTIMATE.start_main_~i~0#1| 1)} is VALID [2022-02-21 03:14:04,827 INFO L290 TraceCheckUtils]: 95: Hoare triple {21621#(<= |ULTIMATE.start_main_~i~0#1| 1)} assume !(main_~_hj_k~0#1 % 4294967296 >= 12); {21621#(<= |ULTIMATE.start_main_~i~0#1| 1)} is VALID [2022-02-21 03:14:04,827 INFO L290 TraceCheckUtils]: 96: Hoare triple {21621#(<= |ULTIMATE.start_main_~i~0#1| 1)} main_~_ha_hashv~0#1 := 4 + main_~_ha_hashv~0#1;main_#t~switch19#1 := 11 == main_~_hj_k~0#1; {21621#(<= |ULTIMATE.start_main_~i~0#1| 1)} is VALID [2022-02-21 03:14:04,828 INFO L290 TraceCheckUtils]: 97: Hoare triple {21621#(<= |ULTIMATE.start_main_~i~0#1| 1)} assume !main_#t~switch19#1; {21621#(<= |ULTIMATE.start_main_~i~0#1| 1)} is VALID [2022-02-21 03:14:04,828 INFO L290 TraceCheckUtils]: 98: Hoare triple {21621#(<= |ULTIMATE.start_main_~i~0#1| 1)} main_#t~switch19#1 := main_#t~switch19#1 || 10 == main_~_hj_k~0#1; {21621#(<= |ULTIMATE.start_main_~i~0#1| 1)} is VALID [2022-02-21 03:14:04,828 INFO L290 TraceCheckUtils]: 99: Hoare triple {21621#(<= |ULTIMATE.start_main_~i~0#1| 1)} assume !main_#t~switch19#1; {21621#(<= |ULTIMATE.start_main_~i~0#1| 1)} is VALID [2022-02-21 03:14:04,828 INFO L290 TraceCheckUtils]: 100: Hoare triple {21621#(<= |ULTIMATE.start_main_~i~0#1| 1)} main_#t~switch19#1 := main_#t~switch19#1 || 9 == main_~_hj_k~0#1; {21621#(<= |ULTIMATE.start_main_~i~0#1| 1)} is VALID [2022-02-21 03:14:04,829 INFO L290 TraceCheckUtils]: 101: Hoare triple {21621#(<= |ULTIMATE.start_main_~i~0#1| 1)} assume !main_#t~switch19#1; {21621#(<= |ULTIMATE.start_main_~i~0#1| 1)} is VALID [2022-02-21 03:14:04,829 INFO L290 TraceCheckUtils]: 102: Hoare triple {21621#(<= |ULTIMATE.start_main_~i~0#1| 1)} main_#t~switch19#1 := main_#t~switch19#1 || 8 == main_~_hj_k~0#1; {21621#(<= |ULTIMATE.start_main_~i~0#1| 1)} is VALID [2022-02-21 03:14:04,829 INFO L290 TraceCheckUtils]: 103: Hoare triple {21621#(<= |ULTIMATE.start_main_~i~0#1| 1)} assume !main_#t~switch19#1; {21621#(<= |ULTIMATE.start_main_~i~0#1| 1)} is VALID [2022-02-21 03:14:04,829 INFO L290 TraceCheckUtils]: 104: Hoare triple {21621#(<= |ULTIMATE.start_main_~i~0#1| 1)} main_#t~switch19#1 := main_#t~switch19#1 || 7 == main_~_hj_k~0#1; {21621#(<= |ULTIMATE.start_main_~i~0#1| 1)} is VALID [2022-02-21 03:14:04,830 INFO L290 TraceCheckUtils]: 105: Hoare triple {21621#(<= |ULTIMATE.start_main_~i~0#1| 1)} assume !main_#t~switch19#1; {21621#(<= |ULTIMATE.start_main_~i~0#1| 1)} is VALID [2022-02-21 03:14:04,830 INFO L290 TraceCheckUtils]: 106: Hoare triple {21621#(<= |ULTIMATE.start_main_~i~0#1| 1)} main_#t~switch19#1 := main_#t~switch19#1 || 6 == main_~_hj_k~0#1; {21621#(<= |ULTIMATE.start_main_~i~0#1| 1)} is VALID [2022-02-21 03:14:04,830 INFO L290 TraceCheckUtils]: 107: Hoare triple {21621#(<= |ULTIMATE.start_main_~i~0#1| 1)} assume !main_#t~switch19#1; {21621#(<= |ULTIMATE.start_main_~i~0#1| 1)} is VALID [2022-02-21 03:14:04,830 INFO L290 TraceCheckUtils]: 108: Hoare triple {21621#(<= |ULTIMATE.start_main_~i~0#1| 1)} main_#t~switch19#1 := main_#t~switch19#1 || 5 == main_~_hj_k~0#1; {21621#(<= |ULTIMATE.start_main_~i~0#1| 1)} is VALID [2022-02-21 03:14:04,831 INFO L290 TraceCheckUtils]: 109: Hoare triple {21621#(<= |ULTIMATE.start_main_~i~0#1| 1)} assume !main_#t~switch19#1; {21621#(<= |ULTIMATE.start_main_~i~0#1| 1)} is VALID [2022-02-21 03:14:04,831 INFO L290 TraceCheckUtils]: 110: Hoare triple {21621#(<= |ULTIMATE.start_main_~i~0#1| 1)} main_#t~switch19#1 := main_#t~switch19#1 || 4 == main_~_hj_k~0#1; {21621#(<= |ULTIMATE.start_main_~i~0#1| 1)} is VALID [2022-02-21 03:14:04,831 INFO L290 TraceCheckUtils]: 111: Hoare triple {21621#(<= |ULTIMATE.start_main_~i~0#1| 1)} assume main_#t~switch19#1;call main_#t~mem27#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~mem27#1 % 256);havoc main_#t~mem27#1; {21621#(<= |ULTIMATE.start_main_~i~0#1| 1)} is VALID [2022-02-21 03:14:04,831 INFO L290 TraceCheckUtils]: 112: Hoare triple {21621#(<= |ULTIMATE.start_main_~i~0#1| 1)} main_#t~switch19#1 := main_#t~switch19#1 || 3 == main_~_hj_k~0#1; {21621#(<= |ULTIMATE.start_main_~i~0#1| 1)} is VALID [2022-02-21 03:14:04,832 INFO L290 TraceCheckUtils]: 113: Hoare triple {21621#(<= |ULTIMATE.start_main_~i~0#1| 1)} assume main_#t~switch19#1;call main_#t~mem28#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~mem28#1 % 256);havoc main_#t~mem28#1; {21621#(<= |ULTIMATE.start_main_~i~0#1| 1)} is VALID [2022-02-21 03:14:04,832 INFO L290 TraceCheckUtils]: 114: Hoare triple {21621#(<= |ULTIMATE.start_main_~i~0#1| 1)} main_#t~switch19#1 := main_#t~switch19#1 || 2 == main_~_hj_k~0#1; {21621#(<= |ULTIMATE.start_main_~i~0#1| 1)} is VALID [2022-02-21 03:14:04,832 INFO L290 TraceCheckUtils]: 115: Hoare triple {21621#(<= |ULTIMATE.start_main_~i~0#1| 1)} assume main_#t~switch19#1;call main_#t~mem29#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~mem29#1 % 256);havoc main_#t~mem29#1; {21621#(<= |ULTIMATE.start_main_~i~0#1| 1)} is VALID [2022-02-21 03:14:04,832 INFO L290 TraceCheckUtils]: 116: Hoare triple {21621#(<= |ULTIMATE.start_main_~i~0#1| 1)} main_#t~switch19#1 := main_#t~switch19#1 || 1 == main_~_hj_k~0#1; {21621#(<= |ULTIMATE.start_main_~i~0#1| 1)} is VALID [2022-02-21 03:14:04,832 INFO L290 TraceCheckUtils]: 117: Hoare triple {21621#(<= |ULTIMATE.start_main_~i~0#1| 1)} assume main_#t~switch19#1;call main_#t~mem30#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~mem30#1 % 256;havoc main_#t~mem30#1; {21621#(<= |ULTIMATE.start_main_~i~0#1| 1)} is VALID [2022-02-21 03:14:04,833 INFO L290 TraceCheckUtils]: 118: Hoare triple {21621#(<= |ULTIMATE.start_main_~i~0#1| 1)} havoc main_#t~switch19#1; {21621#(<= |ULTIMATE.start_main_~i~0#1| 1)} is VALID [2022-02-21 03:14:04,833 INFO L290 TraceCheckUtils]: 119: Hoare triple {21621#(<= |ULTIMATE.start_main_~i~0#1| 1)} 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)))); {21621#(<= |ULTIMATE.start_main_~i~0#1| 1)} is VALID [2022-02-21 03:14:04,833 INFO L290 TraceCheckUtils]: 120: Hoare triple {21621#(<= |ULTIMATE.start_main_~i~0#1| 1)} goto; {21621#(<= |ULTIMATE.start_main_~i~0#1| 1)} is VALID [2022-02-21 03:14:04,833 INFO L290 TraceCheckUtils]: 121: Hoare triple {21621#(<= |ULTIMATE.start_main_~i~0#1| 1)} goto; {21621#(<= |ULTIMATE.start_main_~i~0#1| 1)} is VALID [2022-02-21 03:14:04,834 INFO L290 TraceCheckUtils]: 122: Hoare triple {21621#(<= |ULTIMATE.start_main_~i~0#1| 1)} goto; {21621#(<= |ULTIMATE.start_main_~i~0#1| 1)} is VALID [2022-02-21 03:14:04,834 INFO L290 TraceCheckUtils]: 123: Hoare triple {21621#(<= |ULTIMATE.start_main_~i~0#1| 1)} 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); {21621#(<= |ULTIMATE.start_main_~i~0#1| 1)} is VALID [2022-02-21 03:14:04,834 INFO L290 TraceCheckUtils]: 124: Hoare triple {21621#(<= |ULTIMATE.start_main_~i~0#1| 1)} assume !(main_~users~0#1.base == 0 && main_~users~0#1.offset == 0);call main_#t~mem48#1.base, main_#t~mem48#1.offset := read~$Pointer$(main_~users~0#1.base, 8 + main_~users~0#1.offset, 4);call write~$Pointer$(main_#t~mem48#1.base, main_#t~mem48#1.offset, main_~user~0#1.base, 8 + main_~user~0#1.offset, 4);havoc main_#t~mem48#1.base, main_#t~mem48#1.offset; {21621#(<= |ULTIMATE.start_main_~i~0#1| 1)} is VALID [2022-02-21 03:14:04,834 INFO L290 TraceCheckUtils]: 125: Hoare triple {21621#(<= |ULTIMATE.start_main_~i~0#1| 1)} call write~$Pointer$(0, 0, main_~user~0#1.base, 16 + main_~user~0#1.offset, 4);call main_#t~mem49#1.base, main_#t~mem49#1.offset := read~$Pointer$(main_~users~0#1.base, 8 + main_~users~0#1.offset, 4);call main_#t~mem50#1.base, main_#t~mem50#1.offset := read~$Pointer$(main_#t~mem49#1.base, 16 + main_#t~mem49#1.offset, 4);call main_#t~mem51#1.base, main_#t~mem51#1.offset := read~$Pointer$(main_~users~0#1.base, 8 + main_~users~0#1.offset, 4);call main_#t~mem52#1 := read~int(main_#t~mem51#1.base, 20 + main_#t~mem51#1.offset, 4);call write~$Pointer$(main_#t~mem50#1.base, main_#t~mem50#1.offset - main_#t~mem52#1, main_~user~0#1.base, 12 + main_~user~0#1.offset, 4);havoc main_#t~mem49#1.base, main_#t~mem49#1.offset;havoc main_#t~mem50#1.base, main_#t~mem50#1.offset;havoc main_#t~mem51#1.base, main_#t~mem51#1.offset;havoc main_#t~mem52#1;call main_#t~mem53#1.base, main_#t~mem53#1.offset := read~$Pointer$(main_~users~0#1.base, 8 + main_~users~0#1.offset, 4);call main_#t~mem54#1.base, main_#t~mem54#1.offset := read~$Pointer$(main_#t~mem53#1.base, 16 + main_#t~mem53#1.offset, 4);call write~$Pointer$(main_~user~0#1.base, main_~user~0#1.offset, main_#t~mem54#1.base, 8 + main_#t~mem54#1.offset, 4);havoc main_#t~mem53#1.base, main_#t~mem53#1.offset;havoc main_#t~mem54#1.base, main_#t~mem54#1.offset;call main_#t~mem55#1.base, main_#t~mem55#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~mem55#1.base, 16 + main_#t~mem55#1.offset, 4);havoc main_#t~mem55#1.base, main_#t~mem55#1.offset; {21621#(<= |ULTIMATE.start_main_~i~0#1| 1)} is VALID [2022-02-21 03:14:04,835 INFO L290 TraceCheckUtils]: 126: Hoare triple {21621#(<= |ULTIMATE.start_main_~i~0#1| 1)} goto; {21621#(<= |ULTIMATE.start_main_~i~0#1| 1)} is VALID [2022-02-21 03:14:04,835 INFO L290 TraceCheckUtils]: 127: Hoare triple {21621#(<= |ULTIMATE.start_main_~i~0#1| 1)} havoc main_~_ha_bkt~0#1;call main_#t~mem56#1.base, main_#t~mem56#1.offset := read~$Pointer$(main_~users~0#1.base, 8 + main_~users~0#1.offset, 4);call main_#t~mem57#1 := read~int(main_#t~mem56#1.base, 12 + main_#t~mem56#1.offset, 4);main_#t~post58#1 := main_#t~mem57#1;call write~int(1 + main_#t~post58#1, main_#t~mem56#1.base, 12 + main_#t~mem56#1.offset, 4);havoc main_#t~mem56#1.base, main_#t~mem56#1.offset;havoc main_#t~mem57#1;havoc main_#t~post58#1; {21621#(<= |ULTIMATE.start_main_~i~0#1| 1)} is VALID [2022-02-21 03:14:04,835 INFO L290 TraceCheckUtils]: 128: Hoare triple {21621#(<= |ULTIMATE.start_main_~i~0#1| 1)} call main_#t~mem59#1.base, main_#t~mem59#1.offset := read~$Pointer$(main_~users~0#1.base, 8 + main_~users~0#1.offset, 4);call main_#t~mem60#1 := read~int(main_#t~mem59#1.base, 4 + main_#t~mem59#1.offset, 4);main_~_ha_bkt~0#1 := (if 0 == main_~_ha_hashv~0#1 || 0 == main_#t~mem60#1 - 1 then 0 else (if 1 == main_#t~mem60#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~mem60#1 - 1))) else (if 1 == main_~_ha_hashv~0#1 then (if 1 == main_#t~mem60#1 - 1 || 0 == main_#t~mem60#1 - 1 then main_#t~mem60#1 - 1 else (if main_#t~mem60#1 - 1 >= 0 then (main_#t~mem60#1 - 1) % 2 else ~bitwiseAnd(main_~_ha_hashv~0#1, main_#t~mem60#1 - 1))) else ~bitwiseAnd(main_~_ha_hashv~0#1, main_#t~mem60#1 - 1))));havoc main_#t~mem59#1.base, main_#t~mem59#1.offset;havoc main_#t~mem60#1; {21621#(<= |ULTIMATE.start_main_~i~0#1| 1)} is VALID [2022-02-21 03:14:04,835 INFO L290 TraceCheckUtils]: 129: Hoare triple {21621#(<= |ULTIMATE.start_main_~i~0#1| 1)} goto; {21621#(<= |ULTIMATE.start_main_~i~0#1| 1)} is VALID [2022-02-21 03:14:04,836 INFO L290 TraceCheckUtils]: 130: Hoare triple {21621#(<= |ULTIMATE.start_main_~i~0#1| 1)} call main_#t~mem61#1.base, main_#t~mem61#1.offset := read~$Pointer$(main_~users~0#1.base, 8 + main_~users~0#1.offset, 4);call main_#t~mem62#1.base, main_#t~mem62#1.offset := read~$Pointer$(main_#t~mem61#1.base, main_#t~mem61#1.offset, 4);main_~_ha_head~0#1.base, main_~_ha_head~0#1.offset := main_#t~mem62#1.base, main_#t~mem62#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~mem61#1.base, main_#t~mem61#1.offset;havoc main_#t~mem62#1.base, main_#t~mem62#1.offset;call main_#t~mem63#1 := read~int(main_~_ha_head~0#1.base, 4 + main_~_ha_head~0#1.offset, 4);main_#t~post64#1 := main_#t~mem63#1;call write~int(1 + main_#t~post64#1, main_~_ha_head~0#1.base, 4 + main_~_ha_head~0#1.offset, 4);havoc main_#t~mem63#1;havoc main_#t~post64#1;call main_#t~mem65#1.base, main_#t~mem65#1.offset := read~$Pointer$(main_~_ha_head~0#1.base, main_~_ha_head~0#1.offset, 4);call write~$Pointer$(main_#t~mem65#1.base, main_#t~mem65#1.offset, main_~user~0#1.base, 24 + main_~user~0#1.offset, 4);havoc main_#t~mem65#1.base, main_#t~mem65#1.offset;call write~$Pointer$(0, 0, main_~user~0#1.base, 20 + main_~user~0#1.offset, 4);call main_#t~mem66#1.base, main_#t~mem66#1.offset := read~$Pointer$(main_~_ha_head~0#1.base, main_~_ha_head~0#1.offset, 4); {21621#(<= |ULTIMATE.start_main_~i~0#1| 1)} is VALID [2022-02-21 03:14:04,836 INFO L290 TraceCheckUtils]: 131: Hoare triple {21621#(<= |ULTIMATE.start_main_~i~0#1| 1)} assume main_#t~mem66#1.base != 0 || main_#t~mem66#1.offset != 0;havoc main_#t~mem66#1.base, main_#t~mem66#1.offset;call main_#t~mem67#1.base, main_#t~mem67#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~mem67#1.base, 12 + main_#t~mem67#1.offset, 4);havoc main_#t~mem67#1.base, main_#t~mem67#1.offset; {21621#(<= |ULTIMATE.start_main_~i~0#1| 1)} is VALID [2022-02-21 03:14:04,836 INFO L290 TraceCheckUtils]: 132: Hoare triple {21621#(<= |ULTIMATE.start_main_~i~0#1| 1)} 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~mem69#1 := read~int(main_~_ha_head~0#1.base, 4 + main_~_ha_head~0#1.offset, 4);call main_#t~mem68#1 := read~int(main_~_ha_head~0#1.base, 8 + main_~_ha_head~0#1.offset, 4);main_#t~short72#1 := main_#t~mem69#1 % 4294967296 >= 10 * (1 + main_#t~mem68#1) % 4294967296; {21621#(<= |ULTIMATE.start_main_~i~0#1| 1)} is VALID [2022-02-21 03:14:04,836 INFO L290 TraceCheckUtils]: 133: Hoare triple {21621#(<= |ULTIMATE.start_main_~i~0#1| 1)} assume main_#t~short72#1;call main_#t~mem70#1.base, main_#t~mem70#1.offset := read~$Pointer$(main_~user~0#1.base, 8 + main_~user~0#1.offset, 4);call main_#t~mem71#1 := read~int(main_#t~mem70#1.base, 36 + main_#t~mem70#1.offset, 4);main_#t~short72#1 := 0 == main_#t~mem71#1 % 4294967296; {21621#(<= |ULTIMATE.start_main_~i~0#1| 1)} is VALID [2022-02-21 03:14:04,837 INFO L290 TraceCheckUtils]: 134: Hoare triple {21621#(<= |ULTIMATE.start_main_~i~0#1| 1)} assume !main_#t~short72#1;havoc main_#t~mem69#1;havoc main_#t~mem68#1;havoc main_#t~mem70#1.base, main_#t~mem70#1.offset;havoc main_#t~mem71#1;havoc main_#t~short72#1; {21621#(<= |ULTIMATE.start_main_~i~0#1| 1)} is VALID [2022-02-21 03:14:04,837 INFO L290 TraceCheckUtils]: 135: Hoare triple {21621#(<= |ULTIMATE.start_main_~i~0#1| 1)} goto; {21621#(<= |ULTIMATE.start_main_~i~0#1| 1)} is VALID [2022-02-21 03:14:04,837 INFO L290 TraceCheckUtils]: 136: Hoare triple {21621#(<= |ULTIMATE.start_main_~i~0#1| 1)} goto; {21621#(<= |ULTIMATE.start_main_~i~0#1| 1)} is VALID [2022-02-21 03:14:04,837 INFO L290 TraceCheckUtils]: 137: Hoare triple {21621#(<= |ULTIMATE.start_main_~i~0#1| 1)} goto; {21621#(<= |ULTIMATE.start_main_~i~0#1| 1)} is VALID [2022-02-21 03:14:04,837 INFO L290 TraceCheckUtils]: 138: Hoare triple {21621#(<= |ULTIMATE.start_main_~i~0#1| 1)} goto; {21621#(<= |ULTIMATE.start_main_~i~0#1| 1)} is VALID [2022-02-21 03:14:04,838 INFO L290 TraceCheckUtils]: 139: Hoare triple {21621#(<= |ULTIMATE.start_main_~i~0#1| 1)} main_#t~post5#1 := main_~i~0#1; {21781#(<= |ULTIMATE.start_main_#t~post5#1| 1)} is VALID [2022-02-21 03:14:04,838 INFO L290 TraceCheckUtils]: 140: Hoare triple {21781#(<= |ULTIMATE.start_main_#t~post5#1| 1)} assume 1 + main_#t~post5#1 <= 2147483647; {21781#(<= |ULTIMATE.start_main_#t~post5#1| 1)} is VALID [2022-02-21 03:14:04,838 INFO L290 TraceCheckUtils]: 141: Hoare triple {21781#(<= |ULTIMATE.start_main_#t~post5#1| 1)} assume 1 + main_#t~post5#1 >= -2147483648;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; {21788#(<= |ULTIMATE.start_main_~i~0#1| 2)} is VALID [2022-02-21 03:14:04,839 INFO L290 TraceCheckUtils]: 142: Hoare triple {21788#(<= |ULTIMATE.start_main_~i~0#1| 2)} assume !!(main_~i~0#1 < 10);call main_#t~malloc6#1.base, main_#t~malloc6#1.offset := #Ultimate.allocOnHeap(40);main_~user~0#1.base, main_~user~0#1.offset := main_#t~malloc6#1.base, main_#t~malloc6#1.offset;havoc main_#t~malloc6#1.base, main_#t~malloc6#1.offset; {21788#(<= |ULTIMATE.start_main_~i~0#1| 2)} is VALID [2022-02-21 03:14:04,839 INFO L290 TraceCheckUtils]: 143: Hoare triple {21788#(<= |ULTIMATE.start_main_~i~0#1| 2)} assume !(main_~user~0#1.base == 0 && main_~user~0#1.offset == 0); {21788#(<= |ULTIMATE.start_main_~i~0#1| 2)} is VALID [2022-02-21 03:14:04,839 INFO L290 TraceCheckUtils]: 144: Hoare triple {21788#(<= |ULTIMATE.start_main_~i~0#1| 2)} call write~int(main_~i~0#1, main_~user~0#1.base, main_~user~0#1.offset, 4); {21788#(<= |ULTIMATE.start_main_~i~0#1| 2)} is VALID [2022-02-21 03:14:04,839 INFO L290 TraceCheckUtils]: 145: Hoare triple {21788#(<= |ULTIMATE.start_main_~i~0#1| 2)} assume main_~i~0#1 * main_~i~0#1 <= 2147483647; {21788#(<= |ULTIMATE.start_main_~i~0#1| 2)} is VALID [2022-02-21 03:14:04,840 INFO L290 TraceCheckUtils]: 146: Hoare triple {21788#(<= |ULTIMATE.start_main_~i~0#1| 2)} assume main_~i~0#1 * main_~i~0#1 >= -2147483648;call write~int(main_~i~0#1 * main_~i~0#1, main_~user~0#1.base, 4 + main_~user~0#1.offset, 4); {21788#(<= |ULTIMATE.start_main_~i~0#1| 2)} is VALID [2022-02-21 03:14:04,840 INFO L290 TraceCheckUtils]: 147: Hoare triple {21788#(<= |ULTIMATE.start_main_~i~0#1| 2)} havoc main_~_ha_hashv~0#1; {21788#(<= |ULTIMATE.start_main_~i~0#1| 2)} is VALID [2022-02-21 03:14:04,840 INFO L290 TraceCheckUtils]: 148: Hoare triple {21788#(<= |ULTIMATE.start_main_~i~0#1| 2)} goto; {21788#(<= |ULTIMATE.start_main_~i~0#1| 2)} is VALID [2022-02-21 03:14:04,840 INFO L290 TraceCheckUtils]: 149: Hoare triple {21788#(<= |ULTIMATE.start_main_~i~0#1| 2)} 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; {21788#(<= |ULTIMATE.start_main_~i~0#1| 2)} is VALID [2022-02-21 03:14:04,841 INFO L290 TraceCheckUtils]: 150: Hoare triple {21788#(<= |ULTIMATE.start_main_~i~0#1| 2)} assume !(main_~_hj_k~0#1 % 4294967296 >= 12); {21788#(<= |ULTIMATE.start_main_~i~0#1| 2)} is VALID [2022-02-21 03:14:04,841 INFO L290 TraceCheckUtils]: 151: Hoare triple {21788#(<= |ULTIMATE.start_main_~i~0#1| 2)} main_~_ha_hashv~0#1 := 4 + main_~_ha_hashv~0#1;main_#t~switch19#1 := 11 == main_~_hj_k~0#1; {21788#(<= |ULTIMATE.start_main_~i~0#1| 2)} is VALID [2022-02-21 03:14:04,841 INFO L290 TraceCheckUtils]: 152: Hoare triple {21788#(<= |ULTIMATE.start_main_~i~0#1| 2)} assume !main_#t~switch19#1; {21788#(<= |ULTIMATE.start_main_~i~0#1| 2)} is VALID [2022-02-21 03:14:04,841 INFO L290 TraceCheckUtils]: 153: Hoare triple {21788#(<= |ULTIMATE.start_main_~i~0#1| 2)} main_#t~switch19#1 := main_#t~switch19#1 || 10 == main_~_hj_k~0#1; {21788#(<= |ULTIMATE.start_main_~i~0#1| 2)} is VALID [2022-02-21 03:14:04,841 INFO L290 TraceCheckUtils]: 154: Hoare triple {21788#(<= |ULTIMATE.start_main_~i~0#1| 2)} assume !main_#t~switch19#1; {21788#(<= |ULTIMATE.start_main_~i~0#1| 2)} is VALID [2022-02-21 03:14:04,842 INFO L290 TraceCheckUtils]: 155: Hoare triple {21788#(<= |ULTIMATE.start_main_~i~0#1| 2)} main_#t~switch19#1 := main_#t~switch19#1 || 9 == main_~_hj_k~0#1; {21788#(<= |ULTIMATE.start_main_~i~0#1| 2)} is VALID [2022-02-21 03:14:04,842 INFO L290 TraceCheckUtils]: 156: Hoare triple {21788#(<= |ULTIMATE.start_main_~i~0#1| 2)} assume !main_#t~switch19#1; {21788#(<= |ULTIMATE.start_main_~i~0#1| 2)} is VALID [2022-02-21 03:14:04,842 INFO L290 TraceCheckUtils]: 157: Hoare triple {21788#(<= |ULTIMATE.start_main_~i~0#1| 2)} main_#t~switch19#1 := main_#t~switch19#1 || 8 == main_~_hj_k~0#1; {21788#(<= |ULTIMATE.start_main_~i~0#1| 2)} is VALID [2022-02-21 03:14:04,842 INFO L290 TraceCheckUtils]: 158: Hoare triple {21788#(<= |ULTIMATE.start_main_~i~0#1| 2)} assume !main_#t~switch19#1; {21788#(<= |ULTIMATE.start_main_~i~0#1| 2)} is VALID [2022-02-21 03:14:04,843 INFO L290 TraceCheckUtils]: 159: Hoare triple {21788#(<= |ULTIMATE.start_main_~i~0#1| 2)} main_#t~switch19#1 := main_#t~switch19#1 || 7 == main_~_hj_k~0#1; {21788#(<= |ULTIMATE.start_main_~i~0#1| 2)} is VALID [2022-02-21 03:14:04,843 INFO L290 TraceCheckUtils]: 160: Hoare triple {21788#(<= |ULTIMATE.start_main_~i~0#1| 2)} assume !main_#t~switch19#1; {21788#(<= |ULTIMATE.start_main_~i~0#1| 2)} is VALID [2022-02-21 03:14:04,843 INFO L290 TraceCheckUtils]: 161: Hoare triple {21788#(<= |ULTIMATE.start_main_~i~0#1| 2)} main_#t~switch19#1 := main_#t~switch19#1 || 6 == main_~_hj_k~0#1; {21788#(<= |ULTIMATE.start_main_~i~0#1| 2)} is VALID [2022-02-21 03:14:04,843 INFO L290 TraceCheckUtils]: 162: Hoare triple {21788#(<= |ULTIMATE.start_main_~i~0#1| 2)} assume !main_#t~switch19#1; {21788#(<= |ULTIMATE.start_main_~i~0#1| 2)} is VALID [2022-02-21 03:14:04,844 INFO L290 TraceCheckUtils]: 163: Hoare triple {21788#(<= |ULTIMATE.start_main_~i~0#1| 2)} main_#t~switch19#1 := main_#t~switch19#1 || 5 == main_~_hj_k~0#1; {21788#(<= |ULTIMATE.start_main_~i~0#1| 2)} is VALID [2022-02-21 03:14:04,844 INFO L290 TraceCheckUtils]: 164: Hoare triple {21788#(<= |ULTIMATE.start_main_~i~0#1| 2)} assume !main_#t~switch19#1; {21788#(<= |ULTIMATE.start_main_~i~0#1| 2)} is VALID [2022-02-21 03:14:04,844 INFO L290 TraceCheckUtils]: 165: Hoare triple {21788#(<= |ULTIMATE.start_main_~i~0#1| 2)} main_#t~switch19#1 := main_#t~switch19#1 || 4 == main_~_hj_k~0#1; {21788#(<= |ULTIMATE.start_main_~i~0#1| 2)} is VALID [2022-02-21 03:14:04,844 INFO L290 TraceCheckUtils]: 166: Hoare triple {21788#(<= |ULTIMATE.start_main_~i~0#1| 2)} assume main_#t~switch19#1;call main_#t~mem27#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~mem27#1 % 256);havoc main_#t~mem27#1; {21788#(<= |ULTIMATE.start_main_~i~0#1| 2)} is VALID [2022-02-21 03:14:04,844 INFO L290 TraceCheckUtils]: 167: Hoare triple {21788#(<= |ULTIMATE.start_main_~i~0#1| 2)} main_#t~switch19#1 := main_#t~switch19#1 || 3 == main_~_hj_k~0#1; {21788#(<= |ULTIMATE.start_main_~i~0#1| 2)} is VALID [2022-02-21 03:14:04,845 INFO L290 TraceCheckUtils]: 168: Hoare triple {21788#(<= |ULTIMATE.start_main_~i~0#1| 2)} assume main_#t~switch19#1;call main_#t~mem28#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~mem28#1 % 256);havoc main_#t~mem28#1; {21788#(<= |ULTIMATE.start_main_~i~0#1| 2)} is VALID [2022-02-21 03:14:04,845 INFO L290 TraceCheckUtils]: 169: Hoare triple {21788#(<= |ULTIMATE.start_main_~i~0#1| 2)} main_#t~switch19#1 := main_#t~switch19#1 || 2 == main_~_hj_k~0#1; {21788#(<= |ULTIMATE.start_main_~i~0#1| 2)} is VALID [2022-02-21 03:14:04,845 INFO L290 TraceCheckUtils]: 170: Hoare triple {21788#(<= |ULTIMATE.start_main_~i~0#1| 2)} assume main_#t~switch19#1;call main_#t~mem29#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~mem29#1 % 256);havoc main_#t~mem29#1; {21788#(<= |ULTIMATE.start_main_~i~0#1| 2)} is VALID [2022-02-21 03:14:04,845 INFO L290 TraceCheckUtils]: 171: Hoare triple {21788#(<= |ULTIMATE.start_main_~i~0#1| 2)} main_#t~switch19#1 := main_#t~switch19#1 || 1 == main_~_hj_k~0#1; {21788#(<= |ULTIMATE.start_main_~i~0#1| 2)} is VALID [2022-02-21 03:14:04,847 INFO L290 TraceCheckUtils]: 172: Hoare triple {21788#(<= |ULTIMATE.start_main_~i~0#1| 2)} assume main_#t~switch19#1;call main_#t~mem30#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~mem30#1 % 256;havoc main_#t~mem30#1; {21788#(<= |ULTIMATE.start_main_~i~0#1| 2)} is VALID [2022-02-21 03:14:04,847 INFO L290 TraceCheckUtils]: 173: Hoare triple {21788#(<= |ULTIMATE.start_main_~i~0#1| 2)} havoc main_#t~switch19#1; {21788#(<= |ULTIMATE.start_main_~i~0#1| 2)} is VALID [2022-02-21 03:14:04,847 INFO L290 TraceCheckUtils]: 174: Hoare triple {21788#(<= |ULTIMATE.start_main_~i~0#1| 2)} 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)))); {21788#(<= |ULTIMATE.start_main_~i~0#1| 2)} is VALID [2022-02-21 03:14:04,847 INFO L290 TraceCheckUtils]: 175: Hoare triple {21788#(<= |ULTIMATE.start_main_~i~0#1| 2)} goto; {21788#(<= |ULTIMATE.start_main_~i~0#1| 2)} is VALID [2022-02-21 03:14:04,848 INFO L290 TraceCheckUtils]: 176: Hoare triple {21788#(<= |ULTIMATE.start_main_~i~0#1| 2)} goto; {21788#(<= |ULTIMATE.start_main_~i~0#1| 2)} is VALID [2022-02-21 03:14:04,848 INFO L290 TraceCheckUtils]: 177: Hoare triple {21788#(<= |ULTIMATE.start_main_~i~0#1| 2)} goto; {21788#(<= |ULTIMATE.start_main_~i~0#1| 2)} is VALID [2022-02-21 03:14:04,848 INFO L290 TraceCheckUtils]: 178: Hoare triple {21788#(<= |ULTIMATE.start_main_~i~0#1| 2)} 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); {21788#(<= |ULTIMATE.start_main_~i~0#1| 2)} is VALID [2022-02-21 03:14:04,848 INFO L290 TraceCheckUtils]: 179: Hoare triple {21788#(<= |ULTIMATE.start_main_~i~0#1| 2)} assume !(main_~users~0#1.base == 0 && main_~users~0#1.offset == 0);call main_#t~mem48#1.base, main_#t~mem48#1.offset := read~$Pointer$(main_~users~0#1.base, 8 + main_~users~0#1.offset, 4);call write~$Pointer$(main_#t~mem48#1.base, main_#t~mem48#1.offset, main_~user~0#1.base, 8 + main_~user~0#1.offset, 4);havoc main_#t~mem48#1.base, main_#t~mem48#1.offset; {21788#(<= |ULTIMATE.start_main_~i~0#1| 2)} is VALID [2022-02-21 03:14:04,848 INFO L290 TraceCheckUtils]: 180: Hoare triple {21788#(<= |ULTIMATE.start_main_~i~0#1| 2)} call write~$Pointer$(0, 0, main_~user~0#1.base, 16 + main_~user~0#1.offset, 4);call main_#t~mem49#1.base, main_#t~mem49#1.offset := read~$Pointer$(main_~users~0#1.base, 8 + main_~users~0#1.offset, 4);call main_#t~mem50#1.base, main_#t~mem50#1.offset := read~$Pointer$(main_#t~mem49#1.base, 16 + main_#t~mem49#1.offset, 4);call main_#t~mem51#1.base, main_#t~mem51#1.offset := read~$Pointer$(main_~users~0#1.base, 8 + main_~users~0#1.offset, 4);call main_#t~mem52#1 := read~int(main_#t~mem51#1.base, 20 + main_#t~mem51#1.offset, 4);call write~$Pointer$(main_#t~mem50#1.base, main_#t~mem50#1.offset - main_#t~mem52#1, main_~user~0#1.base, 12 + main_~user~0#1.offset, 4);havoc main_#t~mem49#1.base, main_#t~mem49#1.offset;havoc main_#t~mem50#1.base, main_#t~mem50#1.offset;havoc main_#t~mem51#1.base, main_#t~mem51#1.offset;havoc main_#t~mem52#1;call main_#t~mem53#1.base, main_#t~mem53#1.offset := read~$Pointer$(main_~users~0#1.base, 8 + main_~users~0#1.offset, 4);call main_#t~mem54#1.base, main_#t~mem54#1.offset := read~$Pointer$(main_#t~mem53#1.base, 16 + main_#t~mem53#1.offset, 4);call write~$Pointer$(main_~user~0#1.base, main_~user~0#1.offset, main_#t~mem54#1.base, 8 + main_#t~mem54#1.offset, 4);havoc main_#t~mem53#1.base, main_#t~mem53#1.offset;havoc main_#t~mem54#1.base, main_#t~mem54#1.offset;call main_#t~mem55#1.base, main_#t~mem55#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~mem55#1.base, 16 + main_#t~mem55#1.offset, 4);havoc main_#t~mem55#1.base, main_#t~mem55#1.offset; {21788#(<= |ULTIMATE.start_main_~i~0#1| 2)} is VALID [2022-02-21 03:14:04,849 INFO L290 TraceCheckUtils]: 181: Hoare triple {21788#(<= |ULTIMATE.start_main_~i~0#1| 2)} goto; {21788#(<= |ULTIMATE.start_main_~i~0#1| 2)} is VALID [2022-02-21 03:14:04,849 INFO L290 TraceCheckUtils]: 182: Hoare triple {21788#(<= |ULTIMATE.start_main_~i~0#1| 2)} havoc main_~_ha_bkt~0#1;call main_#t~mem56#1.base, main_#t~mem56#1.offset := read~$Pointer$(main_~users~0#1.base, 8 + main_~users~0#1.offset, 4);call main_#t~mem57#1 := read~int(main_#t~mem56#1.base, 12 + main_#t~mem56#1.offset, 4);main_#t~post58#1 := main_#t~mem57#1;call write~int(1 + main_#t~post58#1, main_#t~mem56#1.base, 12 + main_#t~mem56#1.offset, 4);havoc main_#t~mem56#1.base, main_#t~mem56#1.offset;havoc main_#t~mem57#1;havoc main_#t~post58#1; {21788#(<= |ULTIMATE.start_main_~i~0#1| 2)} is VALID [2022-02-21 03:14:04,849 INFO L290 TraceCheckUtils]: 183: Hoare triple {21788#(<= |ULTIMATE.start_main_~i~0#1| 2)} call main_#t~mem59#1.base, main_#t~mem59#1.offset := read~$Pointer$(main_~users~0#1.base, 8 + main_~users~0#1.offset, 4);call main_#t~mem60#1 := read~int(main_#t~mem59#1.base, 4 + main_#t~mem59#1.offset, 4);main_~_ha_bkt~0#1 := (if 0 == main_~_ha_hashv~0#1 || 0 == main_#t~mem60#1 - 1 then 0 else (if 1 == main_#t~mem60#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~mem60#1 - 1))) else (if 1 == main_~_ha_hashv~0#1 then (if 1 == main_#t~mem60#1 - 1 || 0 == main_#t~mem60#1 - 1 then main_#t~mem60#1 - 1 else (if main_#t~mem60#1 - 1 >= 0 then (main_#t~mem60#1 - 1) % 2 else ~bitwiseAnd(main_~_ha_hashv~0#1, main_#t~mem60#1 - 1))) else ~bitwiseAnd(main_~_ha_hashv~0#1, main_#t~mem60#1 - 1))));havoc main_#t~mem59#1.base, main_#t~mem59#1.offset;havoc main_#t~mem60#1; {21788#(<= |ULTIMATE.start_main_~i~0#1| 2)} is VALID [2022-02-21 03:14:04,849 INFO L290 TraceCheckUtils]: 184: Hoare triple {21788#(<= |ULTIMATE.start_main_~i~0#1| 2)} goto; {21788#(<= |ULTIMATE.start_main_~i~0#1| 2)} is VALID [2022-02-21 03:14:04,850 INFO L290 TraceCheckUtils]: 185: Hoare triple {21788#(<= |ULTIMATE.start_main_~i~0#1| 2)} call main_#t~mem61#1.base, main_#t~mem61#1.offset := read~$Pointer$(main_~users~0#1.base, 8 + main_~users~0#1.offset, 4);call main_#t~mem62#1.base, main_#t~mem62#1.offset := read~$Pointer$(main_#t~mem61#1.base, main_#t~mem61#1.offset, 4);main_~_ha_head~0#1.base, main_~_ha_head~0#1.offset := main_#t~mem62#1.base, main_#t~mem62#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~mem61#1.base, main_#t~mem61#1.offset;havoc main_#t~mem62#1.base, main_#t~mem62#1.offset;call main_#t~mem63#1 := read~int(main_~_ha_head~0#1.base, 4 + main_~_ha_head~0#1.offset, 4);main_#t~post64#1 := main_#t~mem63#1;call write~int(1 + main_#t~post64#1, main_~_ha_head~0#1.base, 4 + main_~_ha_head~0#1.offset, 4);havoc main_#t~mem63#1;havoc main_#t~post64#1;call main_#t~mem65#1.base, main_#t~mem65#1.offset := read~$Pointer$(main_~_ha_head~0#1.base, main_~_ha_head~0#1.offset, 4);call write~$Pointer$(main_#t~mem65#1.base, main_#t~mem65#1.offset, main_~user~0#1.base, 24 + main_~user~0#1.offset, 4);havoc main_#t~mem65#1.base, main_#t~mem65#1.offset;call write~$Pointer$(0, 0, main_~user~0#1.base, 20 + main_~user~0#1.offset, 4);call main_#t~mem66#1.base, main_#t~mem66#1.offset := read~$Pointer$(main_~_ha_head~0#1.base, main_~_ha_head~0#1.offset, 4); {21788#(<= |ULTIMATE.start_main_~i~0#1| 2)} is VALID [2022-02-21 03:14:04,850 INFO L290 TraceCheckUtils]: 186: Hoare triple {21788#(<= |ULTIMATE.start_main_~i~0#1| 2)} assume main_#t~mem66#1.base != 0 || main_#t~mem66#1.offset != 0;havoc main_#t~mem66#1.base, main_#t~mem66#1.offset;call main_#t~mem67#1.base, main_#t~mem67#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~mem67#1.base, 12 + main_#t~mem67#1.offset, 4);havoc main_#t~mem67#1.base, main_#t~mem67#1.offset; {21788#(<= |ULTIMATE.start_main_~i~0#1| 2)} is VALID [2022-02-21 03:14:04,850 INFO L290 TraceCheckUtils]: 187: Hoare triple {21788#(<= |ULTIMATE.start_main_~i~0#1| 2)} 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~mem69#1 := read~int(main_~_ha_head~0#1.base, 4 + main_~_ha_head~0#1.offset, 4);call main_#t~mem68#1 := read~int(main_~_ha_head~0#1.base, 8 + main_~_ha_head~0#1.offset, 4);main_#t~short72#1 := main_#t~mem69#1 % 4294967296 >= 10 * (1 + main_#t~mem68#1) % 4294967296; {21788#(<= |ULTIMATE.start_main_~i~0#1| 2)} is VALID [2022-02-21 03:14:04,850 INFO L290 TraceCheckUtils]: 188: Hoare triple {21788#(<= |ULTIMATE.start_main_~i~0#1| 2)} assume main_#t~short72#1;call main_#t~mem70#1.base, main_#t~mem70#1.offset := read~$Pointer$(main_~user~0#1.base, 8 + main_~user~0#1.offset, 4);call main_#t~mem71#1 := read~int(main_#t~mem70#1.base, 36 + main_#t~mem70#1.offset, 4);main_#t~short72#1 := 0 == main_#t~mem71#1 % 4294967296; {21788#(<= |ULTIMATE.start_main_~i~0#1| 2)} is VALID [2022-02-21 03:14:04,851 INFO L290 TraceCheckUtils]: 189: Hoare triple {21788#(<= |ULTIMATE.start_main_~i~0#1| 2)} assume !main_#t~short72#1;havoc main_#t~mem69#1;havoc main_#t~mem68#1;havoc main_#t~mem70#1.base, main_#t~mem70#1.offset;havoc main_#t~mem71#1;havoc main_#t~short72#1; {21788#(<= |ULTIMATE.start_main_~i~0#1| 2)} is VALID [2022-02-21 03:14:04,851 INFO L290 TraceCheckUtils]: 190: Hoare triple {21788#(<= |ULTIMATE.start_main_~i~0#1| 2)} goto; {21788#(<= |ULTIMATE.start_main_~i~0#1| 2)} is VALID [2022-02-21 03:14:04,851 INFO L290 TraceCheckUtils]: 191: Hoare triple {21788#(<= |ULTIMATE.start_main_~i~0#1| 2)} goto; {21788#(<= |ULTIMATE.start_main_~i~0#1| 2)} is VALID [2022-02-21 03:14:04,851 INFO L290 TraceCheckUtils]: 192: Hoare triple {21788#(<= |ULTIMATE.start_main_~i~0#1| 2)} goto; {21788#(<= |ULTIMATE.start_main_~i~0#1| 2)} is VALID [2022-02-21 03:14:04,852 INFO L290 TraceCheckUtils]: 193: Hoare triple {21788#(<= |ULTIMATE.start_main_~i~0#1| 2)} goto; {21788#(<= |ULTIMATE.start_main_~i~0#1| 2)} is VALID [2022-02-21 03:14:04,852 INFO L290 TraceCheckUtils]: 194: Hoare triple {21788#(<= |ULTIMATE.start_main_~i~0#1| 2)} main_#t~post5#1 := main_~i~0#1; {21948#(<= |ULTIMATE.start_main_#t~post5#1| 2)} is VALID [2022-02-21 03:14:04,852 INFO L290 TraceCheckUtils]: 195: Hoare triple {21948#(<= |ULTIMATE.start_main_#t~post5#1| 2)} assume 1 + main_#t~post5#1 <= 2147483647; {21948#(<= |ULTIMATE.start_main_#t~post5#1| 2)} is VALID [2022-02-21 03:14:04,852 INFO L290 TraceCheckUtils]: 196: Hoare triple {21948#(<= |ULTIMATE.start_main_#t~post5#1| 2)} assume 1 + main_#t~post5#1 >= -2147483648;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; {21955#(<= |ULTIMATE.start_main_~i~0#1| 3)} is VALID [2022-02-21 03:14:04,853 INFO L290 TraceCheckUtils]: 197: Hoare triple {21955#(<= |ULTIMATE.start_main_~i~0#1| 3)} assume !(main_~i~0#1 < 10); {21357#false} is VALID [2022-02-21 03:14:04,853 INFO L290 TraceCheckUtils]: 198: Hoare triple {21357#false} main_~user~0#1.base, main_~user~0#1.offset := main_~users~0#1.base, main_~users~0#1.offset; {21357#false} is VALID [2022-02-21 03:14:04,853 INFO L290 TraceCheckUtils]: 199: Hoare triple {21357#false} assume !!(main_~user~0#1.base != 0 || main_~user~0#1.offset != 0);call main_#t~mem140#1 := read~int(main_~user~0#1.base, main_~user~0#1.offset, 4);call main_#t~mem141#1 := read~int(main_~user~0#1.base, 4 + main_~user~0#1.offset, 4);assume { :begin_inline_test_int_int } true;test_int_int_#in~a#1, test_int_int_#in~b#1 := main_#t~mem140#1, main_#t~mem141#1;havoc test_int_int_#t~post3#1, test_int_int_#t~switch4#1, test_int_int_~a#1, test_int_int_~b#1;test_int_int_~a#1 := test_int_int_#in~a#1;test_int_int_~b#1 := test_int_int_#in~b#1;test_int_int_#t~post3#1 := ~count_int_int~0; {21357#false} is VALID [2022-02-21 03:14:04,853 INFO L290 TraceCheckUtils]: 200: Hoare triple {21357#false} assume !(1 + test_int_int_#t~post3#1 <= 2147483647); {21357#false} is VALID [2022-02-21 03:14:04,853 INFO L134 CoverageAnalysis]: Checked inductivity of 303 backedges. 0 proven. 164 refuted. 0 times theorem prover too weak. 139 trivial. 0 not checked. [2022-02-21 03:14:04,853 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-21 03:14:05,595 INFO L290 TraceCheckUtils]: 200: Hoare triple {21357#false} assume !(1 + test_int_int_#t~post3#1 <= 2147483647); {21357#false} is VALID [2022-02-21 03:14:05,595 INFO L290 TraceCheckUtils]: 199: Hoare triple {21357#false} assume !!(main_~user~0#1.base != 0 || main_~user~0#1.offset != 0);call main_#t~mem140#1 := read~int(main_~user~0#1.base, main_~user~0#1.offset, 4);call main_#t~mem141#1 := read~int(main_~user~0#1.base, 4 + main_~user~0#1.offset, 4);assume { :begin_inline_test_int_int } true;test_int_int_#in~a#1, test_int_int_#in~b#1 := main_#t~mem140#1, main_#t~mem141#1;havoc test_int_int_#t~post3#1, test_int_int_#t~switch4#1, test_int_int_~a#1, test_int_int_~b#1;test_int_int_~a#1 := test_int_int_#in~a#1;test_int_int_~b#1 := test_int_int_#in~b#1;test_int_int_#t~post3#1 := ~count_int_int~0; {21357#false} is VALID [2022-02-21 03:14:05,595 INFO L290 TraceCheckUtils]: 198: Hoare triple {21357#false} main_~user~0#1.base, main_~user~0#1.offset := main_~users~0#1.base, main_~users~0#1.offset; {21357#false} is VALID [2022-02-21 03:14:05,596 INFO L290 TraceCheckUtils]: 197: Hoare triple {21977#(< |ULTIMATE.start_main_~i~0#1| 10)} assume !(main_~i~0#1 < 10); {21357#false} is VALID [2022-02-21 03:14:05,597 INFO L290 TraceCheckUtils]: 196: Hoare triple {21981#(< |ULTIMATE.start_main_#t~post5#1| 9)} assume 1 + main_#t~post5#1 >= -2147483648;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; {21977#(< |ULTIMATE.start_main_~i~0#1| 10)} is VALID [2022-02-21 03:14:05,597 INFO L290 TraceCheckUtils]: 195: Hoare triple {21981#(< |ULTIMATE.start_main_#t~post5#1| 9)} assume 1 + main_#t~post5#1 <= 2147483647; {21981#(< |ULTIMATE.start_main_#t~post5#1| 9)} is VALID [2022-02-21 03:14:05,597 INFO L290 TraceCheckUtils]: 194: Hoare triple {21988#(< |ULTIMATE.start_main_~i~0#1| 9)} main_#t~post5#1 := main_~i~0#1; {21981#(< |ULTIMATE.start_main_#t~post5#1| 9)} is VALID [2022-02-21 03:14:05,598 INFO L290 TraceCheckUtils]: 193: Hoare triple {21988#(< |ULTIMATE.start_main_~i~0#1| 9)} goto; {21988#(< |ULTIMATE.start_main_~i~0#1| 9)} is VALID [2022-02-21 03:14:05,598 INFO L290 TraceCheckUtils]: 192: Hoare triple {21988#(< |ULTIMATE.start_main_~i~0#1| 9)} goto; {21988#(< |ULTIMATE.start_main_~i~0#1| 9)} is VALID [2022-02-21 03:14:05,599 INFO L290 TraceCheckUtils]: 191: Hoare triple {21988#(< |ULTIMATE.start_main_~i~0#1| 9)} goto; {21988#(< |ULTIMATE.start_main_~i~0#1| 9)} is VALID [2022-02-21 03:14:05,599 INFO L290 TraceCheckUtils]: 190: Hoare triple {21988#(< |ULTIMATE.start_main_~i~0#1| 9)} goto; {21988#(< |ULTIMATE.start_main_~i~0#1| 9)} is VALID [2022-02-21 03:14:05,599 INFO L290 TraceCheckUtils]: 189: Hoare triple {21988#(< |ULTIMATE.start_main_~i~0#1| 9)} assume !main_#t~short72#1;havoc main_#t~mem69#1;havoc main_#t~mem68#1;havoc main_#t~mem70#1.base, main_#t~mem70#1.offset;havoc main_#t~mem71#1;havoc main_#t~short72#1; {21988#(< |ULTIMATE.start_main_~i~0#1| 9)} is VALID [2022-02-21 03:14:05,600 INFO L290 TraceCheckUtils]: 188: Hoare triple {21988#(< |ULTIMATE.start_main_~i~0#1| 9)} assume main_#t~short72#1;call main_#t~mem70#1.base, main_#t~mem70#1.offset := read~$Pointer$(main_~user~0#1.base, 8 + main_~user~0#1.offset, 4);call main_#t~mem71#1 := read~int(main_#t~mem70#1.base, 36 + main_#t~mem70#1.offset, 4);main_#t~short72#1 := 0 == main_#t~mem71#1 % 4294967296; {21988#(< |ULTIMATE.start_main_~i~0#1| 9)} is VALID [2022-02-21 03:14:05,600 INFO L290 TraceCheckUtils]: 187: Hoare triple {21988#(< |ULTIMATE.start_main_~i~0#1| 9)} 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~mem69#1 := read~int(main_~_ha_head~0#1.base, 4 + main_~_ha_head~0#1.offset, 4);call main_#t~mem68#1 := read~int(main_~_ha_head~0#1.base, 8 + main_~_ha_head~0#1.offset, 4);main_#t~short72#1 := main_#t~mem69#1 % 4294967296 >= 10 * (1 + main_#t~mem68#1) % 4294967296; {21988#(< |ULTIMATE.start_main_~i~0#1| 9)} is VALID [2022-02-21 03:14:05,601 INFO L290 TraceCheckUtils]: 186: Hoare triple {21988#(< |ULTIMATE.start_main_~i~0#1| 9)} assume main_#t~mem66#1.base != 0 || main_#t~mem66#1.offset != 0;havoc main_#t~mem66#1.base, main_#t~mem66#1.offset;call main_#t~mem67#1.base, main_#t~mem67#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~mem67#1.base, 12 + main_#t~mem67#1.offset, 4);havoc main_#t~mem67#1.base, main_#t~mem67#1.offset; {21988#(< |ULTIMATE.start_main_~i~0#1| 9)} is VALID [2022-02-21 03:14:05,601 INFO L290 TraceCheckUtils]: 185: Hoare triple {21988#(< |ULTIMATE.start_main_~i~0#1| 9)} call main_#t~mem61#1.base, main_#t~mem61#1.offset := read~$Pointer$(main_~users~0#1.base, 8 + main_~users~0#1.offset, 4);call main_#t~mem62#1.base, main_#t~mem62#1.offset := read~$Pointer$(main_#t~mem61#1.base, main_#t~mem61#1.offset, 4);main_~_ha_head~0#1.base, main_~_ha_head~0#1.offset := main_#t~mem62#1.base, main_#t~mem62#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~mem61#1.base, main_#t~mem61#1.offset;havoc main_#t~mem62#1.base, main_#t~mem62#1.offset;call main_#t~mem63#1 := read~int(main_~_ha_head~0#1.base, 4 + main_~_ha_head~0#1.offset, 4);main_#t~post64#1 := main_#t~mem63#1;call write~int(1 + main_#t~post64#1, main_~_ha_head~0#1.base, 4 + main_~_ha_head~0#1.offset, 4);havoc main_#t~mem63#1;havoc main_#t~post64#1;call main_#t~mem65#1.base, main_#t~mem65#1.offset := read~$Pointer$(main_~_ha_head~0#1.base, main_~_ha_head~0#1.offset, 4);call write~$Pointer$(main_#t~mem65#1.base, main_#t~mem65#1.offset, main_~user~0#1.base, 24 + main_~user~0#1.offset, 4);havoc main_#t~mem65#1.base, main_#t~mem65#1.offset;call write~$Pointer$(0, 0, main_~user~0#1.base, 20 + main_~user~0#1.offset, 4);call main_#t~mem66#1.base, main_#t~mem66#1.offset := read~$Pointer$(main_~_ha_head~0#1.base, main_~_ha_head~0#1.offset, 4); {21988#(< |ULTIMATE.start_main_~i~0#1| 9)} is VALID [2022-02-21 03:14:05,602 INFO L290 TraceCheckUtils]: 184: Hoare triple {21988#(< |ULTIMATE.start_main_~i~0#1| 9)} goto; {21988#(< |ULTIMATE.start_main_~i~0#1| 9)} is VALID [2022-02-21 03:14:05,602 INFO L290 TraceCheckUtils]: 183: Hoare triple {21988#(< |ULTIMATE.start_main_~i~0#1| 9)} call main_#t~mem59#1.base, main_#t~mem59#1.offset := read~$Pointer$(main_~users~0#1.base, 8 + main_~users~0#1.offset, 4);call main_#t~mem60#1 := read~int(main_#t~mem59#1.base, 4 + main_#t~mem59#1.offset, 4);main_~_ha_bkt~0#1 := (if 0 == main_~_ha_hashv~0#1 || 0 == main_#t~mem60#1 - 1 then 0 else (if 1 == main_#t~mem60#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~mem60#1 - 1))) else (if 1 == main_~_ha_hashv~0#1 then (if 1 == main_#t~mem60#1 - 1 || 0 == main_#t~mem60#1 - 1 then main_#t~mem60#1 - 1 else (if main_#t~mem60#1 - 1 >= 0 then (main_#t~mem60#1 - 1) % 2 else ~bitwiseAnd(main_~_ha_hashv~0#1, main_#t~mem60#1 - 1))) else ~bitwiseAnd(main_~_ha_hashv~0#1, main_#t~mem60#1 - 1))));havoc main_#t~mem59#1.base, main_#t~mem59#1.offset;havoc main_#t~mem60#1; {21988#(< |ULTIMATE.start_main_~i~0#1| 9)} is VALID [2022-02-21 03:14:05,602 INFO L290 TraceCheckUtils]: 182: Hoare triple {21988#(< |ULTIMATE.start_main_~i~0#1| 9)} havoc main_~_ha_bkt~0#1;call main_#t~mem56#1.base, main_#t~mem56#1.offset := read~$Pointer$(main_~users~0#1.base, 8 + main_~users~0#1.offset, 4);call main_#t~mem57#1 := read~int(main_#t~mem56#1.base, 12 + main_#t~mem56#1.offset, 4);main_#t~post58#1 := main_#t~mem57#1;call write~int(1 + main_#t~post58#1, main_#t~mem56#1.base, 12 + main_#t~mem56#1.offset, 4);havoc main_#t~mem56#1.base, main_#t~mem56#1.offset;havoc main_#t~mem57#1;havoc main_#t~post58#1; {21988#(< |ULTIMATE.start_main_~i~0#1| 9)} is VALID [2022-02-21 03:14:05,603 INFO L290 TraceCheckUtils]: 181: Hoare triple {21988#(< |ULTIMATE.start_main_~i~0#1| 9)} goto; {21988#(< |ULTIMATE.start_main_~i~0#1| 9)} is VALID [2022-02-21 03:14:05,603 INFO L290 TraceCheckUtils]: 180: Hoare triple {21988#(< |ULTIMATE.start_main_~i~0#1| 9)} call write~$Pointer$(0, 0, main_~user~0#1.base, 16 + main_~user~0#1.offset, 4);call main_#t~mem49#1.base, main_#t~mem49#1.offset := read~$Pointer$(main_~users~0#1.base, 8 + main_~users~0#1.offset, 4);call main_#t~mem50#1.base, main_#t~mem50#1.offset := read~$Pointer$(main_#t~mem49#1.base, 16 + main_#t~mem49#1.offset, 4);call main_#t~mem51#1.base, main_#t~mem51#1.offset := read~$Pointer$(main_~users~0#1.base, 8 + main_~users~0#1.offset, 4);call main_#t~mem52#1 := read~int(main_#t~mem51#1.base, 20 + main_#t~mem51#1.offset, 4);call write~$Pointer$(main_#t~mem50#1.base, main_#t~mem50#1.offset - main_#t~mem52#1, main_~user~0#1.base, 12 + main_~user~0#1.offset, 4);havoc main_#t~mem49#1.base, main_#t~mem49#1.offset;havoc main_#t~mem50#1.base, main_#t~mem50#1.offset;havoc main_#t~mem51#1.base, main_#t~mem51#1.offset;havoc main_#t~mem52#1;call main_#t~mem53#1.base, main_#t~mem53#1.offset := read~$Pointer$(main_~users~0#1.base, 8 + main_~users~0#1.offset, 4);call main_#t~mem54#1.base, main_#t~mem54#1.offset := read~$Pointer$(main_#t~mem53#1.base, 16 + main_#t~mem53#1.offset, 4);call write~$Pointer$(main_~user~0#1.base, main_~user~0#1.offset, main_#t~mem54#1.base, 8 + main_#t~mem54#1.offset, 4);havoc main_#t~mem53#1.base, main_#t~mem53#1.offset;havoc main_#t~mem54#1.base, main_#t~mem54#1.offset;call main_#t~mem55#1.base, main_#t~mem55#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~mem55#1.base, 16 + main_#t~mem55#1.offset, 4);havoc main_#t~mem55#1.base, main_#t~mem55#1.offset; {21988#(< |ULTIMATE.start_main_~i~0#1| 9)} is VALID [2022-02-21 03:14:05,604 INFO L290 TraceCheckUtils]: 179: Hoare triple {21988#(< |ULTIMATE.start_main_~i~0#1| 9)} assume !(main_~users~0#1.base == 0 && main_~users~0#1.offset == 0);call main_#t~mem48#1.base, main_#t~mem48#1.offset := read~$Pointer$(main_~users~0#1.base, 8 + main_~users~0#1.offset, 4);call write~$Pointer$(main_#t~mem48#1.base, main_#t~mem48#1.offset, main_~user~0#1.base, 8 + main_~user~0#1.offset, 4);havoc main_#t~mem48#1.base, main_#t~mem48#1.offset; {21988#(< |ULTIMATE.start_main_~i~0#1| 9)} is VALID [2022-02-21 03:14:05,604 INFO L290 TraceCheckUtils]: 178: Hoare triple {21988#(< |ULTIMATE.start_main_~i~0#1| 9)} 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); {21988#(< |ULTIMATE.start_main_~i~0#1| 9)} is VALID [2022-02-21 03:14:05,604 INFO L290 TraceCheckUtils]: 177: Hoare triple {21988#(< |ULTIMATE.start_main_~i~0#1| 9)} goto; {21988#(< |ULTIMATE.start_main_~i~0#1| 9)} is VALID [2022-02-21 03:14:05,605 INFO L290 TraceCheckUtils]: 176: Hoare triple {21988#(< |ULTIMATE.start_main_~i~0#1| 9)} goto; {21988#(< |ULTIMATE.start_main_~i~0#1| 9)} is VALID [2022-02-21 03:14:05,605 INFO L290 TraceCheckUtils]: 175: Hoare triple {21988#(< |ULTIMATE.start_main_~i~0#1| 9)} goto; {21988#(< |ULTIMATE.start_main_~i~0#1| 9)} is VALID [2022-02-21 03:14:05,606 INFO L290 TraceCheckUtils]: 174: Hoare triple {21988#(< |ULTIMATE.start_main_~i~0#1| 9)} 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)))); {21988#(< |ULTIMATE.start_main_~i~0#1| 9)} is VALID [2022-02-21 03:14:05,606 INFO L290 TraceCheckUtils]: 173: Hoare triple {21988#(< |ULTIMATE.start_main_~i~0#1| 9)} havoc main_#t~switch19#1; {21988#(< |ULTIMATE.start_main_~i~0#1| 9)} is VALID [2022-02-21 03:14:05,606 INFO L290 TraceCheckUtils]: 172: Hoare triple {21988#(< |ULTIMATE.start_main_~i~0#1| 9)} assume main_#t~switch19#1;call main_#t~mem30#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~mem30#1 % 256;havoc main_#t~mem30#1; {21988#(< |ULTIMATE.start_main_~i~0#1| 9)} is VALID [2022-02-21 03:14:05,607 INFO L290 TraceCheckUtils]: 171: Hoare triple {21988#(< |ULTIMATE.start_main_~i~0#1| 9)} main_#t~switch19#1 := main_#t~switch19#1 || 1 == main_~_hj_k~0#1; {21988#(< |ULTIMATE.start_main_~i~0#1| 9)} is VALID [2022-02-21 03:14:05,607 INFO L290 TraceCheckUtils]: 170: Hoare triple {21988#(< |ULTIMATE.start_main_~i~0#1| 9)} assume main_#t~switch19#1;call main_#t~mem29#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~mem29#1 % 256);havoc main_#t~mem29#1; {21988#(< |ULTIMATE.start_main_~i~0#1| 9)} is VALID [2022-02-21 03:14:05,608 INFO L290 TraceCheckUtils]: 169: Hoare triple {21988#(< |ULTIMATE.start_main_~i~0#1| 9)} main_#t~switch19#1 := main_#t~switch19#1 || 2 == main_~_hj_k~0#1; {21988#(< |ULTIMATE.start_main_~i~0#1| 9)} is VALID [2022-02-21 03:14:05,608 INFO L290 TraceCheckUtils]: 168: Hoare triple {21988#(< |ULTIMATE.start_main_~i~0#1| 9)} assume main_#t~switch19#1;call main_#t~mem28#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~mem28#1 % 256);havoc main_#t~mem28#1; {21988#(< |ULTIMATE.start_main_~i~0#1| 9)} is VALID [2022-02-21 03:14:05,608 INFO L290 TraceCheckUtils]: 167: Hoare triple {21988#(< |ULTIMATE.start_main_~i~0#1| 9)} main_#t~switch19#1 := main_#t~switch19#1 || 3 == main_~_hj_k~0#1; {21988#(< |ULTIMATE.start_main_~i~0#1| 9)} is VALID [2022-02-21 03:14:05,609 INFO L290 TraceCheckUtils]: 166: Hoare triple {21988#(< |ULTIMATE.start_main_~i~0#1| 9)} assume main_#t~switch19#1;call main_#t~mem27#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~mem27#1 % 256);havoc main_#t~mem27#1; {21988#(< |ULTIMATE.start_main_~i~0#1| 9)} is VALID [2022-02-21 03:14:05,609 INFO L290 TraceCheckUtils]: 165: Hoare triple {21988#(< |ULTIMATE.start_main_~i~0#1| 9)} main_#t~switch19#1 := main_#t~switch19#1 || 4 == main_~_hj_k~0#1; {21988#(< |ULTIMATE.start_main_~i~0#1| 9)} is VALID [2022-02-21 03:14:05,609 INFO L290 TraceCheckUtils]: 164: Hoare triple {21988#(< |ULTIMATE.start_main_~i~0#1| 9)} assume !main_#t~switch19#1; {21988#(< |ULTIMATE.start_main_~i~0#1| 9)} is VALID [2022-02-21 03:14:05,610 INFO L290 TraceCheckUtils]: 163: Hoare triple {21988#(< |ULTIMATE.start_main_~i~0#1| 9)} main_#t~switch19#1 := main_#t~switch19#1 || 5 == main_~_hj_k~0#1; {21988#(< |ULTIMATE.start_main_~i~0#1| 9)} is VALID [2022-02-21 03:14:05,610 INFO L290 TraceCheckUtils]: 162: Hoare triple {21988#(< |ULTIMATE.start_main_~i~0#1| 9)} assume !main_#t~switch19#1; {21988#(< |ULTIMATE.start_main_~i~0#1| 9)} is VALID [2022-02-21 03:14:05,611 INFO L290 TraceCheckUtils]: 161: Hoare triple {21988#(< |ULTIMATE.start_main_~i~0#1| 9)} main_#t~switch19#1 := main_#t~switch19#1 || 6 == main_~_hj_k~0#1; {21988#(< |ULTIMATE.start_main_~i~0#1| 9)} is VALID [2022-02-21 03:14:05,611 INFO L290 TraceCheckUtils]: 160: Hoare triple {21988#(< |ULTIMATE.start_main_~i~0#1| 9)} assume !main_#t~switch19#1; {21988#(< |ULTIMATE.start_main_~i~0#1| 9)} is VALID [2022-02-21 03:14:05,611 INFO L290 TraceCheckUtils]: 159: Hoare triple {21988#(< |ULTIMATE.start_main_~i~0#1| 9)} main_#t~switch19#1 := main_#t~switch19#1 || 7 == main_~_hj_k~0#1; {21988#(< |ULTIMATE.start_main_~i~0#1| 9)} is VALID [2022-02-21 03:14:05,612 INFO L290 TraceCheckUtils]: 158: Hoare triple {21988#(< |ULTIMATE.start_main_~i~0#1| 9)} assume !main_#t~switch19#1; {21988#(< |ULTIMATE.start_main_~i~0#1| 9)} is VALID [2022-02-21 03:14:05,612 INFO L290 TraceCheckUtils]: 157: Hoare triple {21988#(< |ULTIMATE.start_main_~i~0#1| 9)} main_#t~switch19#1 := main_#t~switch19#1 || 8 == main_~_hj_k~0#1; {21988#(< |ULTIMATE.start_main_~i~0#1| 9)} is VALID [2022-02-21 03:14:05,613 INFO L290 TraceCheckUtils]: 156: Hoare triple {21988#(< |ULTIMATE.start_main_~i~0#1| 9)} assume !main_#t~switch19#1; {21988#(< |ULTIMATE.start_main_~i~0#1| 9)} is VALID [2022-02-21 03:14:05,613 INFO L290 TraceCheckUtils]: 155: Hoare triple {21988#(< |ULTIMATE.start_main_~i~0#1| 9)} main_#t~switch19#1 := main_#t~switch19#1 || 9 == main_~_hj_k~0#1; {21988#(< |ULTIMATE.start_main_~i~0#1| 9)} is VALID [2022-02-21 03:14:05,613 INFO L290 TraceCheckUtils]: 154: Hoare triple {21988#(< |ULTIMATE.start_main_~i~0#1| 9)} assume !main_#t~switch19#1; {21988#(< |ULTIMATE.start_main_~i~0#1| 9)} is VALID [2022-02-21 03:14:05,614 INFO L290 TraceCheckUtils]: 153: Hoare triple {21988#(< |ULTIMATE.start_main_~i~0#1| 9)} main_#t~switch19#1 := main_#t~switch19#1 || 10 == main_~_hj_k~0#1; {21988#(< |ULTIMATE.start_main_~i~0#1| 9)} is VALID [2022-02-21 03:14:05,614 INFO L290 TraceCheckUtils]: 152: Hoare triple {21988#(< |ULTIMATE.start_main_~i~0#1| 9)} assume !main_#t~switch19#1; {21988#(< |ULTIMATE.start_main_~i~0#1| 9)} is VALID [2022-02-21 03:14:05,615 INFO L290 TraceCheckUtils]: 151: Hoare triple {21988#(< |ULTIMATE.start_main_~i~0#1| 9)} main_~_ha_hashv~0#1 := 4 + main_~_ha_hashv~0#1;main_#t~switch19#1 := 11 == main_~_hj_k~0#1; {21988#(< |ULTIMATE.start_main_~i~0#1| 9)} is VALID [2022-02-21 03:14:05,615 INFO L290 TraceCheckUtils]: 150: Hoare triple {21988#(< |ULTIMATE.start_main_~i~0#1| 9)} assume !(main_~_hj_k~0#1 % 4294967296 >= 12); {21988#(< |ULTIMATE.start_main_~i~0#1| 9)} is VALID [2022-02-21 03:14:05,615 INFO L290 TraceCheckUtils]: 149: Hoare triple {21988#(< |ULTIMATE.start_main_~i~0#1| 9)} 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; {21988#(< |ULTIMATE.start_main_~i~0#1| 9)} is VALID [2022-02-21 03:14:05,616 INFO L290 TraceCheckUtils]: 148: Hoare triple {21988#(< |ULTIMATE.start_main_~i~0#1| 9)} goto; {21988#(< |ULTIMATE.start_main_~i~0#1| 9)} is VALID [2022-02-21 03:14:05,616 INFO L290 TraceCheckUtils]: 147: Hoare triple {21988#(< |ULTIMATE.start_main_~i~0#1| 9)} havoc main_~_ha_hashv~0#1; {21988#(< |ULTIMATE.start_main_~i~0#1| 9)} is VALID [2022-02-21 03:14:05,617 INFO L290 TraceCheckUtils]: 146: Hoare triple {21988#(< |ULTIMATE.start_main_~i~0#1| 9)} assume main_~i~0#1 * main_~i~0#1 >= -2147483648;call write~int(main_~i~0#1 * main_~i~0#1, main_~user~0#1.base, 4 + main_~user~0#1.offset, 4); {21988#(< |ULTIMATE.start_main_~i~0#1| 9)} is VALID [2022-02-21 03:14:05,617 INFO L290 TraceCheckUtils]: 145: Hoare triple {21988#(< |ULTIMATE.start_main_~i~0#1| 9)} assume main_~i~0#1 * main_~i~0#1 <= 2147483647; {21988#(< |ULTIMATE.start_main_~i~0#1| 9)} is VALID [2022-02-21 03:14:05,617 INFO L290 TraceCheckUtils]: 144: Hoare triple {21988#(< |ULTIMATE.start_main_~i~0#1| 9)} call write~int(main_~i~0#1, main_~user~0#1.base, main_~user~0#1.offset, 4); {21988#(< |ULTIMATE.start_main_~i~0#1| 9)} is VALID [2022-02-21 03:14:05,618 INFO L290 TraceCheckUtils]: 143: Hoare triple {21988#(< |ULTIMATE.start_main_~i~0#1| 9)} assume !(main_~user~0#1.base == 0 && main_~user~0#1.offset == 0); {21988#(< |ULTIMATE.start_main_~i~0#1| 9)} is VALID [2022-02-21 03:14:05,618 INFO L290 TraceCheckUtils]: 142: Hoare triple {21988#(< |ULTIMATE.start_main_~i~0#1| 9)} assume !!(main_~i~0#1 < 10);call main_#t~malloc6#1.base, main_#t~malloc6#1.offset := #Ultimate.allocOnHeap(40);main_~user~0#1.base, main_~user~0#1.offset := main_#t~malloc6#1.base, main_#t~malloc6#1.offset;havoc main_#t~malloc6#1.base, main_#t~malloc6#1.offset; {21988#(< |ULTIMATE.start_main_~i~0#1| 9)} is VALID [2022-02-21 03:14:05,619 INFO L290 TraceCheckUtils]: 141: Hoare triple {22148#(< |ULTIMATE.start_main_#t~post5#1| 8)} assume 1 + main_#t~post5#1 >= -2147483648;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; {21988#(< |ULTIMATE.start_main_~i~0#1| 9)} is VALID [2022-02-21 03:14:05,619 INFO L290 TraceCheckUtils]: 140: Hoare triple {22148#(< |ULTIMATE.start_main_#t~post5#1| 8)} assume 1 + main_#t~post5#1 <= 2147483647; {22148#(< |ULTIMATE.start_main_#t~post5#1| 8)} is VALID [2022-02-21 03:14:05,619 INFO L290 TraceCheckUtils]: 139: Hoare triple {22155#(< |ULTIMATE.start_main_~i~0#1| 8)} main_#t~post5#1 := main_~i~0#1; {22148#(< |ULTIMATE.start_main_#t~post5#1| 8)} is VALID [2022-02-21 03:14:05,620 INFO L290 TraceCheckUtils]: 138: Hoare triple {22155#(< |ULTIMATE.start_main_~i~0#1| 8)} goto; {22155#(< |ULTIMATE.start_main_~i~0#1| 8)} is VALID [2022-02-21 03:14:05,620 INFO L290 TraceCheckUtils]: 137: Hoare triple {22155#(< |ULTIMATE.start_main_~i~0#1| 8)} goto; {22155#(< |ULTIMATE.start_main_~i~0#1| 8)} is VALID [2022-02-21 03:14:05,620 INFO L290 TraceCheckUtils]: 136: Hoare triple {22155#(< |ULTIMATE.start_main_~i~0#1| 8)} goto; {22155#(< |ULTIMATE.start_main_~i~0#1| 8)} is VALID [2022-02-21 03:14:05,620 INFO L290 TraceCheckUtils]: 135: Hoare triple {22155#(< |ULTIMATE.start_main_~i~0#1| 8)} goto; {22155#(< |ULTIMATE.start_main_~i~0#1| 8)} is VALID [2022-02-21 03:14:05,621 INFO L290 TraceCheckUtils]: 134: Hoare triple {22155#(< |ULTIMATE.start_main_~i~0#1| 8)} assume !main_#t~short72#1;havoc main_#t~mem69#1;havoc main_#t~mem68#1;havoc main_#t~mem70#1.base, main_#t~mem70#1.offset;havoc main_#t~mem71#1;havoc main_#t~short72#1; {22155#(< |ULTIMATE.start_main_~i~0#1| 8)} is VALID [2022-02-21 03:14:05,621 INFO L290 TraceCheckUtils]: 133: Hoare triple {22155#(< |ULTIMATE.start_main_~i~0#1| 8)} assume main_#t~short72#1;call main_#t~mem70#1.base, main_#t~mem70#1.offset := read~$Pointer$(main_~user~0#1.base, 8 + main_~user~0#1.offset, 4);call main_#t~mem71#1 := read~int(main_#t~mem70#1.base, 36 + main_#t~mem70#1.offset, 4);main_#t~short72#1 := 0 == main_#t~mem71#1 % 4294967296; {22155#(< |ULTIMATE.start_main_~i~0#1| 8)} is VALID [2022-02-21 03:14:05,621 INFO L290 TraceCheckUtils]: 132: Hoare triple {22155#(< |ULTIMATE.start_main_~i~0#1| 8)} 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~mem69#1 := read~int(main_~_ha_head~0#1.base, 4 + main_~_ha_head~0#1.offset, 4);call main_#t~mem68#1 := read~int(main_~_ha_head~0#1.base, 8 + main_~_ha_head~0#1.offset, 4);main_#t~short72#1 := main_#t~mem69#1 % 4294967296 >= 10 * (1 + main_#t~mem68#1) % 4294967296; {22155#(< |ULTIMATE.start_main_~i~0#1| 8)} is VALID [2022-02-21 03:14:05,622 INFO L290 TraceCheckUtils]: 131: Hoare triple {22155#(< |ULTIMATE.start_main_~i~0#1| 8)} assume main_#t~mem66#1.base != 0 || main_#t~mem66#1.offset != 0;havoc main_#t~mem66#1.base, main_#t~mem66#1.offset;call main_#t~mem67#1.base, main_#t~mem67#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~mem67#1.base, 12 + main_#t~mem67#1.offset, 4);havoc main_#t~mem67#1.base, main_#t~mem67#1.offset; {22155#(< |ULTIMATE.start_main_~i~0#1| 8)} is VALID [2022-02-21 03:14:05,622 INFO L290 TraceCheckUtils]: 130: Hoare triple {22155#(< |ULTIMATE.start_main_~i~0#1| 8)} call main_#t~mem61#1.base, main_#t~mem61#1.offset := read~$Pointer$(main_~users~0#1.base, 8 + main_~users~0#1.offset, 4);call main_#t~mem62#1.base, main_#t~mem62#1.offset := read~$Pointer$(main_#t~mem61#1.base, main_#t~mem61#1.offset, 4);main_~_ha_head~0#1.base, main_~_ha_head~0#1.offset := main_#t~mem62#1.base, main_#t~mem62#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~mem61#1.base, main_#t~mem61#1.offset;havoc main_#t~mem62#1.base, main_#t~mem62#1.offset;call main_#t~mem63#1 := read~int(main_~_ha_head~0#1.base, 4 + main_~_ha_head~0#1.offset, 4);main_#t~post64#1 := main_#t~mem63#1;call write~int(1 + main_#t~post64#1, main_~_ha_head~0#1.base, 4 + main_~_ha_head~0#1.offset, 4);havoc main_#t~mem63#1;havoc main_#t~post64#1;call main_#t~mem65#1.base, main_#t~mem65#1.offset := read~$Pointer$(main_~_ha_head~0#1.base, main_~_ha_head~0#1.offset, 4);call write~$Pointer$(main_#t~mem65#1.base, main_#t~mem65#1.offset, main_~user~0#1.base, 24 + main_~user~0#1.offset, 4);havoc main_#t~mem65#1.base, main_#t~mem65#1.offset;call write~$Pointer$(0, 0, main_~user~0#1.base, 20 + main_~user~0#1.offset, 4);call main_#t~mem66#1.base, main_#t~mem66#1.offset := read~$Pointer$(main_~_ha_head~0#1.base, main_~_ha_head~0#1.offset, 4); {22155#(< |ULTIMATE.start_main_~i~0#1| 8)} is VALID [2022-02-21 03:14:05,622 INFO L290 TraceCheckUtils]: 129: Hoare triple {22155#(< |ULTIMATE.start_main_~i~0#1| 8)} goto; {22155#(< |ULTIMATE.start_main_~i~0#1| 8)} is VALID [2022-02-21 03:14:05,622 INFO L290 TraceCheckUtils]: 128: Hoare triple {22155#(< |ULTIMATE.start_main_~i~0#1| 8)} call main_#t~mem59#1.base, main_#t~mem59#1.offset := read~$Pointer$(main_~users~0#1.base, 8 + main_~users~0#1.offset, 4);call main_#t~mem60#1 := read~int(main_#t~mem59#1.base, 4 + main_#t~mem59#1.offset, 4);main_~_ha_bkt~0#1 := (if 0 == main_~_ha_hashv~0#1 || 0 == main_#t~mem60#1 - 1 then 0 else (if 1 == main_#t~mem60#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~mem60#1 - 1))) else (if 1 == main_~_ha_hashv~0#1 then (if 1 == main_#t~mem60#1 - 1 || 0 == main_#t~mem60#1 - 1 then main_#t~mem60#1 - 1 else (if main_#t~mem60#1 - 1 >= 0 then (main_#t~mem60#1 - 1) % 2 else ~bitwiseAnd(main_~_ha_hashv~0#1, main_#t~mem60#1 - 1))) else ~bitwiseAnd(main_~_ha_hashv~0#1, main_#t~mem60#1 - 1))));havoc main_#t~mem59#1.base, main_#t~mem59#1.offset;havoc main_#t~mem60#1; {22155#(< |ULTIMATE.start_main_~i~0#1| 8)} is VALID [2022-02-21 03:14:05,623 INFO L290 TraceCheckUtils]: 127: Hoare triple {22155#(< |ULTIMATE.start_main_~i~0#1| 8)} havoc main_~_ha_bkt~0#1;call main_#t~mem56#1.base, main_#t~mem56#1.offset := read~$Pointer$(main_~users~0#1.base, 8 + main_~users~0#1.offset, 4);call main_#t~mem57#1 := read~int(main_#t~mem56#1.base, 12 + main_#t~mem56#1.offset, 4);main_#t~post58#1 := main_#t~mem57#1;call write~int(1 + main_#t~post58#1, main_#t~mem56#1.base, 12 + main_#t~mem56#1.offset, 4);havoc main_#t~mem56#1.base, main_#t~mem56#1.offset;havoc main_#t~mem57#1;havoc main_#t~post58#1; {22155#(< |ULTIMATE.start_main_~i~0#1| 8)} is VALID [2022-02-21 03:14:05,623 INFO L290 TraceCheckUtils]: 126: Hoare triple {22155#(< |ULTIMATE.start_main_~i~0#1| 8)} goto; {22155#(< |ULTIMATE.start_main_~i~0#1| 8)} is VALID [2022-02-21 03:14:05,623 INFO L290 TraceCheckUtils]: 125: Hoare triple {22155#(< |ULTIMATE.start_main_~i~0#1| 8)} call write~$Pointer$(0, 0, main_~user~0#1.base, 16 + main_~user~0#1.offset, 4);call main_#t~mem49#1.base, main_#t~mem49#1.offset := read~$Pointer$(main_~users~0#1.base, 8 + main_~users~0#1.offset, 4);call main_#t~mem50#1.base, main_#t~mem50#1.offset := read~$Pointer$(main_#t~mem49#1.base, 16 + main_#t~mem49#1.offset, 4);call main_#t~mem51#1.base, main_#t~mem51#1.offset := read~$Pointer$(main_~users~0#1.base, 8 + main_~users~0#1.offset, 4);call main_#t~mem52#1 := read~int(main_#t~mem51#1.base, 20 + main_#t~mem51#1.offset, 4);call write~$Pointer$(main_#t~mem50#1.base, main_#t~mem50#1.offset - main_#t~mem52#1, main_~user~0#1.base, 12 + main_~user~0#1.offset, 4);havoc main_#t~mem49#1.base, main_#t~mem49#1.offset;havoc main_#t~mem50#1.base, main_#t~mem50#1.offset;havoc main_#t~mem51#1.base, main_#t~mem51#1.offset;havoc main_#t~mem52#1;call main_#t~mem53#1.base, main_#t~mem53#1.offset := read~$Pointer$(main_~users~0#1.base, 8 + main_~users~0#1.offset, 4);call main_#t~mem54#1.base, main_#t~mem54#1.offset := read~$Pointer$(main_#t~mem53#1.base, 16 + main_#t~mem53#1.offset, 4);call write~$Pointer$(main_~user~0#1.base, main_~user~0#1.offset, main_#t~mem54#1.base, 8 + main_#t~mem54#1.offset, 4);havoc main_#t~mem53#1.base, main_#t~mem53#1.offset;havoc main_#t~mem54#1.base, main_#t~mem54#1.offset;call main_#t~mem55#1.base, main_#t~mem55#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~mem55#1.base, 16 + main_#t~mem55#1.offset, 4);havoc main_#t~mem55#1.base, main_#t~mem55#1.offset; {22155#(< |ULTIMATE.start_main_~i~0#1| 8)} is VALID [2022-02-21 03:14:05,624 INFO L290 TraceCheckUtils]: 124: Hoare triple {22155#(< |ULTIMATE.start_main_~i~0#1| 8)} assume !(main_~users~0#1.base == 0 && main_~users~0#1.offset == 0);call main_#t~mem48#1.base, main_#t~mem48#1.offset := read~$Pointer$(main_~users~0#1.base, 8 + main_~users~0#1.offset, 4);call write~$Pointer$(main_#t~mem48#1.base, main_#t~mem48#1.offset, main_~user~0#1.base, 8 + main_~user~0#1.offset, 4);havoc main_#t~mem48#1.base, main_#t~mem48#1.offset; {22155#(< |ULTIMATE.start_main_~i~0#1| 8)} is VALID [2022-02-21 03:14:05,624 INFO L290 TraceCheckUtils]: 123: Hoare triple {22155#(< |ULTIMATE.start_main_~i~0#1| 8)} 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); {22155#(< |ULTIMATE.start_main_~i~0#1| 8)} is VALID [2022-02-21 03:14:05,624 INFO L290 TraceCheckUtils]: 122: Hoare triple {22155#(< |ULTIMATE.start_main_~i~0#1| 8)} goto; {22155#(< |ULTIMATE.start_main_~i~0#1| 8)} is VALID [2022-02-21 03:14:05,624 INFO L290 TraceCheckUtils]: 121: Hoare triple {22155#(< |ULTIMATE.start_main_~i~0#1| 8)} goto; {22155#(< |ULTIMATE.start_main_~i~0#1| 8)} is VALID [2022-02-21 03:14:05,625 INFO L290 TraceCheckUtils]: 120: Hoare triple {22155#(< |ULTIMATE.start_main_~i~0#1| 8)} goto; {22155#(< |ULTIMATE.start_main_~i~0#1| 8)} is VALID [2022-02-21 03:14:05,625 INFO L290 TraceCheckUtils]: 119: Hoare triple {22155#(< |ULTIMATE.start_main_~i~0#1| 8)} 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)))); {22155#(< |ULTIMATE.start_main_~i~0#1| 8)} is VALID [2022-02-21 03:14:05,625 INFO L290 TraceCheckUtils]: 118: Hoare triple {22155#(< |ULTIMATE.start_main_~i~0#1| 8)} havoc main_#t~switch19#1; {22155#(< |ULTIMATE.start_main_~i~0#1| 8)} is VALID [2022-02-21 03:14:05,626 INFO L290 TraceCheckUtils]: 117: Hoare triple {22155#(< |ULTIMATE.start_main_~i~0#1| 8)} assume main_#t~switch19#1;call main_#t~mem30#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~mem30#1 % 256;havoc main_#t~mem30#1; {22155#(< |ULTIMATE.start_main_~i~0#1| 8)} is VALID [2022-02-21 03:14:05,626 INFO L290 TraceCheckUtils]: 116: Hoare triple {22155#(< |ULTIMATE.start_main_~i~0#1| 8)} main_#t~switch19#1 := main_#t~switch19#1 || 1 == main_~_hj_k~0#1; {22155#(< |ULTIMATE.start_main_~i~0#1| 8)} is VALID [2022-02-21 03:14:05,626 INFO L290 TraceCheckUtils]: 115: Hoare triple {22155#(< |ULTIMATE.start_main_~i~0#1| 8)} assume main_#t~switch19#1;call main_#t~mem29#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~mem29#1 % 256);havoc main_#t~mem29#1; {22155#(< |ULTIMATE.start_main_~i~0#1| 8)} is VALID [2022-02-21 03:14:05,626 INFO L290 TraceCheckUtils]: 114: Hoare triple {22155#(< |ULTIMATE.start_main_~i~0#1| 8)} main_#t~switch19#1 := main_#t~switch19#1 || 2 == main_~_hj_k~0#1; {22155#(< |ULTIMATE.start_main_~i~0#1| 8)} is VALID [2022-02-21 03:14:05,627 INFO L290 TraceCheckUtils]: 113: Hoare triple {22155#(< |ULTIMATE.start_main_~i~0#1| 8)} assume main_#t~switch19#1;call main_#t~mem28#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~mem28#1 % 256);havoc main_#t~mem28#1; {22155#(< |ULTIMATE.start_main_~i~0#1| 8)} is VALID [2022-02-21 03:14:05,627 INFO L290 TraceCheckUtils]: 112: Hoare triple {22155#(< |ULTIMATE.start_main_~i~0#1| 8)} main_#t~switch19#1 := main_#t~switch19#1 || 3 == main_~_hj_k~0#1; {22155#(< |ULTIMATE.start_main_~i~0#1| 8)} is VALID [2022-02-21 03:14:05,627 INFO L290 TraceCheckUtils]: 111: Hoare triple {22155#(< |ULTIMATE.start_main_~i~0#1| 8)} assume main_#t~switch19#1;call main_#t~mem27#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~mem27#1 % 256);havoc main_#t~mem27#1; {22155#(< |ULTIMATE.start_main_~i~0#1| 8)} is VALID [2022-02-21 03:14:05,628 INFO L290 TraceCheckUtils]: 110: Hoare triple {22155#(< |ULTIMATE.start_main_~i~0#1| 8)} main_#t~switch19#1 := main_#t~switch19#1 || 4 == main_~_hj_k~0#1; {22155#(< |ULTIMATE.start_main_~i~0#1| 8)} is VALID [2022-02-21 03:14:05,628 INFO L290 TraceCheckUtils]: 109: Hoare triple {22155#(< |ULTIMATE.start_main_~i~0#1| 8)} assume !main_#t~switch19#1; {22155#(< |ULTIMATE.start_main_~i~0#1| 8)} is VALID [2022-02-21 03:14:05,628 INFO L290 TraceCheckUtils]: 108: Hoare triple {22155#(< |ULTIMATE.start_main_~i~0#1| 8)} main_#t~switch19#1 := main_#t~switch19#1 || 5 == main_~_hj_k~0#1; {22155#(< |ULTIMATE.start_main_~i~0#1| 8)} is VALID [2022-02-21 03:14:05,628 INFO L290 TraceCheckUtils]: 107: Hoare triple {22155#(< |ULTIMATE.start_main_~i~0#1| 8)} assume !main_#t~switch19#1; {22155#(< |ULTIMATE.start_main_~i~0#1| 8)} is VALID [2022-02-21 03:14:05,629 INFO L290 TraceCheckUtils]: 106: Hoare triple {22155#(< |ULTIMATE.start_main_~i~0#1| 8)} main_#t~switch19#1 := main_#t~switch19#1 || 6 == main_~_hj_k~0#1; {22155#(< |ULTIMATE.start_main_~i~0#1| 8)} is VALID [2022-02-21 03:14:05,629 INFO L290 TraceCheckUtils]: 105: Hoare triple {22155#(< |ULTIMATE.start_main_~i~0#1| 8)} assume !main_#t~switch19#1; {22155#(< |ULTIMATE.start_main_~i~0#1| 8)} is VALID [2022-02-21 03:14:05,629 INFO L290 TraceCheckUtils]: 104: Hoare triple {22155#(< |ULTIMATE.start_main_~i~0#1| 8)} main_#t~switch19#1 := main_#t~switch19#1 || 7 == main_~_hj_k~0#1; {22155#(< |ULTIMATE.start_main_~i~0#1| 8)} is VALID [2022-02-21 03:14:05,630 INFO L290 TraceCheckUtils]: 103: Hoare triple {22155#(< |ULTIMATE.start_main_~i~0#1| 8)} assume !main_#t~switch19#1; {22155#(< |ULTIMATE.start_main_~i~0#1| 8)} is VALID [2022-02-21 03:14:05,630 INFO L290 TraceCheckUtils]: 102: Hoare triple {22155#(< |ULTIMATE.start_main_~i~0#1| 8)} main_#t~switch19#1 := main_#t~switch19#1 || 8 == main_~_hj_k~0#1; {22155#(< |ULTIMATE.start_main_~i~0#1| 8)} is VALID [2022-02-21 03:14:05,630 INFO L290 TraceCheckUtils]: 101: Hoare triple {22155#(< |ULTIMATE.start_main_~i~0#1| 8)} assume !main_#t~switch19#1; {22155#(< |ULTIMATE.start_main_~i~0#1| 8)} is VALID [2022-02-21 03:14:05,630 INFO L290 TraceCheckUtils]: 100: Hoare triple {22155#(< |ULTIMATE.start_main_~i~0#1| 8)} main_#t~switch19#1 := main_#t~switch19#1 || 9 == main_~_hj_k~0#1; {22155#(< |ULTIMATE.start_main_~i~0#1| 8)} is VALID [2022-02-21 03:14:05,631 INFO L290 TraceCheckUtils]: 99: Hoare triple {22155#(< |ULTIMATE.start_main_~i~0#1| 8)} assume !main_#t~switch19#1; {22155#(< |ULTIMATE.start_main_~i~0#1| 8)} is VALID [2022-02-21 03:14:05,635 INFO L290 TraceCheckUtils]: 98: Hoare triple {22155#(< |ULTIMATE.start_main_~i~0#1| 8)} main_#t~switch19#1 := main_#t~switch19#1 || 10 == main_~_hj_k~0#1; {22155#(< |ULTIMATE.start_main_~i~0#1| 8)} is VALID [2022-02-21 03:14:05,635 INFO L290 TraceCheckUtils]: 97: Hoare triple {22155#(< |ULTIMATE.start_main_~i~0#1| 8)} assume !main_#t~switch19#1; {22155#(< |ULTIMATE.start_main_~i~0#1| 8)} is VALID [2022-02-21 03:14:05,636 INFO L290 TraceCheckUtils]: 96: Hoare triple {22155#(< |ULTIMATE.start_main_~i~0#1| 8)} main_~_ha_hashv~0#1 := 4 + main_~_ha_hashv~0#1;main_#t~switch19#1 := 11 == main_~_hj_k~0#1; {22155#(< |ULTIMATE.start_main_~i~0#1| 8)} is VALID [2022-02-21 03:14:05,636 INFO L290 TraceCheckUtils]: 95: Hoare triple {22155#(< |ULTIMATE.start_main_~i~0#1| 8)} assume !(main_~_hj_k~0#1 % 4294967296 >= 12); {22155#(< |ULTIMATE.start_main_~i~0#1| 8)} is VALID [2022-02-21 03:14:05,636 INFO L290 TraceCheckUtils]: 94: Hoare triple {22155#(< |ULTIMATE.start_main_~i~0#1| 8)} 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; {22155#(< |ULTIMATE.start_main_~i~0#1| 8)} is VALID [2022-02-21 03:14:05,637 INFO L290 TraceCheckUtils]: 93: Hoare triple {22155#(< |ULTIMATE.start_main_~i~0#1| 8)} goto; {22155#(< |ULTIMATE.start_main_~i~0#1| 8)} is VALID [2022-02-21 03:14:05,637 INFO L290 TraceCheckUtils]: 92: Hoare triple {22155#(< |ULTIMATE.start_main_~i~0#1| 8)} havoc main_~_ha_hashv~0#1; {22155#(< |ULTIMATE.start_main_~i~0#1| 8)} is VALID [2022-02-21 03:14:05,637 INFO L290 TraceCheckUtils]: 91: Hoare triple {22155#(< |ULTIMATE.start_main_~i~0#1| 8)} assume main_~i~0#1 * main_~i~0#1 >= -2147483648;call write~int(main_~i~0#1 * main_~i~0#1, main_~user~0#1.base, 4 + main_~user~0#1.offset, 4); {22155#(< |ULTIMATE.start_main_~i~0#1| 8)} is VALID [2022-02-21 03:14:05,637 INFO L290 TraceCheckUtils]: 90: Hoare triple {22155#(< |ULTIMATE.start_main_~i~0#1| 8)} assume main_~i~0#1 * main_~i~0#1 <= 2147483647; {22155#(< |ULTIMATE.start_main_~i~0#1| 8)} is VALID [2022-02-21 03:14:05,638 INFO L290 TraceCheckUtils]: 89: Hoare triple {22155#(< |ULTIMATE.start_main_~i~0#1| 8)} call write~int(main_~i~0#1, main_~user~0#1.base, main_~user~0#1.offset, 4); {22155#(< |ULTIMATE.start_main_~i~0#1| 8)} is VALID [2022-02-21 03:14:05,638 INFO L290 TraceCheckUtils]: 88: Hoare triple {22155#(< |ULTIMATE.start_main_~i~0#1| 8)} assume !(main_~user~0#1.base == 0 && main_~user~0#1.offset == 0); {22155#(< |ULTIMATE.start_main_~i~0#1| 8)} is VALID [2022-02-21 03:14:05,638 INFO L290 TraceCheckUtils]: 87: Hoare triple {22155#(< |ULTIMATE.start_main_~i~0#1| 8)} assume !!(main_~i~0#1 < 10);call main_#t~malloc6#1.base, main_#t~malloc6#1.offset := #Ultimate.allocOnHeap(40);main_~user~0#1.base, main_~user~0#1.offset := main_#t~malloc6#1.base, main_#t~malloc6#1.offset;havoc main_#t~malloc6#1.base, main_#t~malloc6#1.offset; {22155#(< |ULTIMATE.start_main_~i~0#1| 8)} is VALID [2022-02-21 03:14:05,639 INFO L290 TraceCheckUtils]: 86: Hoare triple {22315#(< |ULTIMATE.start_main_#t~post5#1| 7)} assume 1 + main_#t~post5#1 >= -2147483648;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; {22155#(< |ULTIMATE.start_main_~i~0#1| 8)} is VALID [2022-02-21 03:14:05,639 INFO L290 TraceCheckUtils]: 85: Hoare triple {22315#(< |ULTIMATE.start_main_#t~post5#1| 7)} assume 1 + main_#t~post5#1 <= 2147483647; {22315#(< |ULTIMATE.start_main_#t~post5#1| 7)} is VALID [2022-02-21 03:14:05,640 INFO L290 TraceCheckUtils]: 84: Hoare triple {22322#(< |ULTIMATE.start_main_~i~0#1| 7)} main_#t~post5#1 := main_~i~0#1; {22315#(< |ULTIMATE.start_main_#t~post5#1| 7)} is VALID [2022-02-21 03:14:05,640 INFO L290 TraceCheckUtils]: 83: Hoare triple {22322#(< |ULTIMATE.start_main_~i~0#1| 7)} goto; {22322#(< |ULTIMATE.start_main_~i~0#1| 7)} is VALID [2022-02-21 03:14:05,640 INFO L290 TraceCheckUtils]: 82: Hoare triple {22322#(< |ULTIMATE.start_main_~i~0#1| 7)} goto; {22322#(< |ULTIMATE.start_main_~i~0#1| 7)} is VALID [2022-02-21 03:14:05,641 INFO L290 TraceCheckUtils]: 81: Hoare triple {22322#(< |ULTIMATE.start_main_~i~0#1| 7)} goto; {22322#(< |ULTIMATE.start_main_~i~0#1| 7)} is VALID [2022-02-21 03:14:05,641 INFO L290 TraceCheckUtils]: 80: Hoare triple {22322#(< |ULTIMATE.start_main_~i~0#1| 7)} goto; {22322#(< |ULTIMATE.start_main_~i~0#1| 7)} is VALID [2022-02-21 03:14:05,641 INFO L290 TraceCheckUtils]: 79: Hoare triple {22322#(< |ULTIMATE.start_main_~i~0#1| 7)} assume !main_#t~short72#1;havoc main_#t~mem69#1;havoc main_#t~mem68#1;havoc main_#t~mem70#1.base, main_#t~mem70#1.offset;havoc main_#t~mem71#1;havoc main_#t~short72#1; {22322#(< |ULTIMATE.start_main_~i~0#1| 7)} is VALID [2022-02-21 03:14:05,641 INFO L290 TraceCheckUtils]: 78: Hoare triple {22322#(< |ULTIMATE.start_main_~i~0#1| 7)} assume main_#t~short72#1;call main_#t~mem70#1.base, main_#t~mem70#1.offset := read~$Pointer$(main_~user~0#1.base, 8 + main_~user~0#1.offset, 4);call main_#t~mem71#1 := read~int(main_#t~mem70#1.base, 36 + main_#t~mem70#1.offset, 4);main_#t~short72#1 := 0 == main_#t~mem71#1 % 4294967296; {22322#(< |ULTIMATE.start_main_~i~0#1| 7)} is VALID [2022-02-21 03:14:05,642 INFO L290 TraceCheckUtils]: 77: Hoare triple {22322#(< |ULTIMATE.start_main_~i~0#1| 7)} 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~mem69#1 := read~int(main_~_ha_head~0#1.base, 4 + main_~_ha_head~0#1.offset, 4);call main_#t~mem68#1 := read~int(main_~_ha_head~0#1.base, 8 + main_~_ha_head~0#1.offset, 4);main_#t~short72#1 := main_#t~mem69#1 % 4294967296 >= 10 * (1 + main_#t~mem68#1) % 4294967296; {22322#(< |ULTIMATE.start_main_~i~0#1| 7)} is VALID [2022-02-21 03:14:05,642 INFO L290 TraceCheckUtils]: 76: Hoare triple {22322#(< |ULTIMATE.start_main_~i~0#1| 7)} assume main_#t~mem66#1.base != 0 || main_#t~mem66#1.offset != 0;havoc main_#t~mem66#1.base, main_#t~mem66#1.offset;call main_#t~mem67#1.base, main_#t~mem67#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~mem67#1.base, 12 + main_#t~mem67#1.offset, 4);havoc main_#t~mem67#1.base, main_#t~mem67#1.offset; {22322#(< |ULTIMATE.start_main_~i~0#1| 7)} is VALID [2022-02-21 03:14:05,642 INFO L290 TraceCheckUtils]: 75: Hoare triple {22322#(< |ULTIMATE.start_main_~i~0#1| 7)} call main_#t~mem61#1.base, main_#t~mem61#1.offset := read~$Pointer$(main_~users~0#1.base, 8 + main_~users~0#1.offset, 4);call main_#t~mem62#1.base, main_#t~mem62#1.offset := read~$Pointer$(main_#t~mem61#1.base, main_#t~mem61#1.offset, 4);main_~_ha_head~0#1.base, main_~_ha_head~0#1.offset := main_#t~mem62#1.base, main_#t~mem62#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~mem61#1.base, main_#t~mem61#1.offset;havoc main_#t~mem62#1.base, main_#t~mem62#1.offset;call main_#t~mem63#1 := read~int(main_~_ha_head~0#1.base, 4 + main_~_ha_head~0#1.offset, 4);main_#t~post64#1 := main_#t~mem63#1;call write~int(1 + main_#t~post64#1, main_~_ha_head~0#1.base, 4 + main_~_ha_head~0#1.offset, 4);havoc main_#t~mem63#1;havoc main_#t~post64#1;call main_#t~mem65#1.base, main_#t~mem65#1.offset := read~$Pointer$(main_~_ha_head~0#1.base, main_~_ha_head~0#1.offset, 4);call write~$Pointer$(main_#t~mem65#1.base, main_#t~mem65#1.offset, main_~user~0#1.base, 24 + main_~user~0#1.offset, 4);havoc main_#t~mem65#1.base, main_#t~mem65#1.offset;call write~$Pointer$(0, 0, main_~user~0#1.base, 20 + main_~user~0#1.offset, 4);call main_#t~mem66#1.base, main_#t~mem66#1.offset := read~$Pointer$(main_~_ha_head~0#1.base, main_~_ha_head~0#1.offset, 4); {22322#(< |ULTIMATE.start_main_~i~0#1| 7)} is VALID [2022-02-21 03:14:05,643 INFO L290 TraceCheckUtils]: 74: Hoare triple {22322#(< |ULTIMATE.start_main_~i~0#1| 7)} goto; {22322#(< |ULTIMATE.start_main_~i~0#1| 7)} is VALID [2022-02-21 03:14:05,643 INFO L290 TraceCheckUtils]: 73: Hoare triple {22322#(< |ULTIMATE.start_main_~i~0#1| 7)} call main_#t~mem59#1.base, main_#t~mem59#1.offset := read~$Pointer$(main_~users~0#1.base, 8 + main_~users~0#1.offset, 4);call main_#t~mem60#1 := read~int(main_#t~mem59#1.base, 4 + main_#t~mem59#1.offset, 4);main_~_ha_bkt~0#1 := (if 0 == main_~_ha_hashv~0#1 || 0 == main_#t~mem60#1 - 1 then 0 else (if 1 == main_#t~mem60#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~mem60#1 - 1))) else (if 1 == main_~_ha_hashv~0#1 then (if 1 == main_#t~mem60#1 - 1 || 0 == main_#t~mem60#1 - 1 then main_#t~mem60#1 - 1 else (if main_#t~mem60#1 - 1 >= 0 then (main_#t~mem60#1 - 1) % 2 else ~bitwiseAnd(main_~_ha_hashv~0#1, main_#t~mem60#1 - 1))) else ~bitwiseAnd(main_~_ha_hashv~0#1, main_#t~mem60#1 - 1))));havoc main_#t~mem59#1.base, main_#t~mem59#1.offset;havoc main_#t~mem60#1; {22322#(< |ULTIMATE.start_main_~i~0#1| 7)} is VALID [2022-02-21 03:14:05,643 INFO L290 TraceCheckUtils]: 72: Hoare triple {22322#(< |ULTIMATE.start_main_~i~0#1| 7)} havoc main_~_ha_bkt~0#1;call main_#t~mem56#1.base, main_#t~mem56#1.offset := read~$Pointer$(main_~users~0#1.base, 8 + main_~users~0#1.offset, 4);call main_#t~mem57#1 := read~int(main_#t~mem56#1.base, 12 + main_#t~mem56#1.offset, 4);main_#t~post58#1 := main_#t~mem57#1;call write~int(1 + main_#t~post58#1, main_#t~mem56#1.base, 12 + main_#t~mem56#1.offset, 4);havoc main_#t~mem56#1.base, main_#t~mem56#1.offset;havoc main_#t~mem57#1;havoc main_#t~post58#1; {22322#(< |ULTIMATE.start_main_~i~0#1| 7)} is VALID [2022-02-21 03:14:05,644 INFO L290 TraceCheckUtils]: 71: Hoare triple {22322#(< |ULTIMATE.start_main_~i~0#1| 7)} main_~users~0#1.base, main_~users~0#1.offset := main_~user~0#1.base, main_~user~0#1.offset; {22322#(< |ULTIMATE.start_main_~i~0#1| 7)} is VALID [2022-02-21 03:14:05,644 INFO L290 TraceCheckUtils]: 70: Hoare triple {22322#(< |ULTIMATE.start_main_~i~0#1| 7)} goto; {22322#(< |ULTIMATE.start_main_~i~0#1| 7)} is VALID [2022-02-21 03:14:05,644 INFO L290 TraceCheckUtils]: 69: Hoare triple {22322#(< |ULTIMATE.start_main_~i~0#1| 7)} havoc main_#t~mem45#1.base, main_#t~mem45#1.offset;havoc main_#t~mem46#1.base, main_#t~mem46#1.offset;havoc main_#t~memset~res47#1.base, main_#t~memset~res47#1.offset; {22322#(< |ULTIMATE.start_main_~i~0#1| 7)} is VALID [2022-02-21 03:14:05,645 INFO L284 TraceCheckUtils]: 68: Hoare quadruple {21356#true} {22322#(< |ULTIMATE.start_main_~i~0#1| 7)} #486#return; {22322#(< |ULTIMATE.start_main_~i~0#1| 7)} is VALID [2022-02-21 03:14:05,645 INFO L290 TraceCheckUtils]: 67: Hoare triple {21356#true} assume #res.base == #ptr.base && #res.offset == #ptr.offset; {21356#true} is VALID [2022-02-21 03:14:05,645 INFO L290 TraceCheckUtils]: 66: Hoare triple {21356#true} assume !(#t~loopctr143 % 4294967296 < #amount % 4294967296); {21356#true} is VALID [2022-02-21 03:14:05,645 INFO L290 TraceCheckUtils]: 65: Hoare triple {21356#true} assume #t~loopctr143 % 4294967296 < #amount % 4294967296;#memory_$Pointer$.base, #memory_$Pointer$.offset := #memory_$Pointer$.base[#ptr.base,#ptr.offset + #t~loopctr143 := 0], #memory_$Pointer$.offset[#ptr.base,#ptr.offset + #t~loopctr143 := #value % 256];#memory_int := #memory_int[#ptr.base,#ptr.offset + #t~loopctr143 := #value];#t~loopctr143 := 1 + #t~loopctr143; {21356#true} is VALID [2022-02-21 03:14:05,645 INFO L290 TraceCheckUtils]: 64: Hoare triple {21356#true} assume #t~loopctr143 % 4294967296 < #amount % 4294967296;#memory_$Pointer$.base, #memory_$Pointer$.offset := #memory_$Pointer$.base[#ptr.base,#ptr.offset + #t~loopctr143 := 0], #memory_$Pointer$.offset[#ptr.base,#ptr.offset + #t~loopctr143 := #value % 256];#memory_int := #memory_int[#ptr.base,#ptr.offset + #t~loopctr143 := #value];#t~loopctr143 := 1 + #t~loopctr143; {21356#true} is VALID [2022-02-21 03:14:05,646 INFO L290 TraceCheckUtils]: 63: Hoare triple {21356#true} assume #t~loopctr143 % 4294967296 < #amount % 4294967296;#memory_$Pointer$.base, #memory_$Pointer$.offset := #memory_$Pointer$.base[#ptr.base,#ptr.offset + #t~loopctr143 := 0], #memory_$Pointer$.offset[#ptr.base,#ptr.offset + #t~loopctr143 := #value % 256];#memory_int := #memory_int[#ptr.base,#ptr.offset + #t~loopctr143 := #value];#t~loopctr143 := 1 + #t~loopctr143; {21356#true} is VALID [2022-02-21 03:14:05,646 INFO L290 TraceCheckUtils]: 62: Hoare triple {21356#true} assume #t~loopctr143 % 4294967296 < #amount % 4294967296;#memory_$Pointer$.base, #memory_$Pointer$.offset := #memory_$Pointer$.base[#ptr.base,#ptr.offset + #t~loopctr143 := 0], #memory_$Pointer$.offset[#ptr.base,#ptr.offset + #t~loopctr143 := #value % 256];#memory_int := #memory_int[#ptr.base,#ptr.offset + #t~loopctr143 := #value];#t~loopctr143 := 1 + #t~loopctr143; {21356#true} is VALID [2022-02-21 03:14:05,646 INFO L290 TraceCheckUtils]: 61: Hoare triple {21356#true} assume #t~loopctr143 % 4294967296 < #amount % 4294967296;#memory_$Pointer$.base, #memory_$Pointer$.offset := #memory_$Pointer$.base[#ptr.base,#ptr.offset + #t~loopctr143 := 0], #memory_$Pointer$.offset[#ptr.base,#ptr.offset + #t~loopctr143 := #value % 256];#memory_int := #memory_int[#ptr.base,#ptr.offset + #t~loopctr143 := #value];#t~loopctr143 := 1 + #t~loopctr143; {21356#true} is VALID [2022-02-21 03:14:05,646 INFO L290 TraceCheckUtils]: 60: Hoare triple {21356#true} #t~loopctr143 := 0; {21356#true} is VALID [2022-02-21 03:14:05,646 INFO L272 TraceCheckUtils]: 59: Hoare triple {22322#(< |ULTIMATE.start_main_~i~0#1| 7)} call main_#t~memset~res47#1.base, main_#t~memset~res47#1.offset := #Ultimate.C_memset(main_#t~mem46#1.base, main_#t~mem46#1.offset, 0, 384); {21356#true} is VALID [2022-02-21 03:14:05,646 INFO L290 TraceCheckUtils]: 58: Hoare triple {22322#(< |ULTIMATE.start_main_~i~0#1| 7)} assume !(main_#t~mem43#1.base == 0 && main_#t~mem43#1.offset == 0);havoc main_#t~mem42#1.base, main_#t~mem42#1.offset;havoc main_#t~mem43#1.base, main_#t~mem43#1.offset;call main_#t~mem45#1.base, main_#t~mem45#1.offset := read~$Pointer$(main_~user~0#1.base, 8 + main_~user~0#1.offset, 4);call main_#t~mem46#1.base, main_#t~mem46#1.offset := read~$Pointer$(main_#t~mem45#1.base, main_#t~mem45#1.offset, 4); {22322#(< |ULTIMATE.start_main_~i~0#1| 7)} is VALID [2022-02-21 03:14:05,647 INFO L290 TraceCheckUtils]: 57: Hoare triple {22322#(< |ULTIMATE.start_main_~i~0#1| 7)} havoc main_#t~mem33#1.base, main_#t~mem33#1.offset;havoc main_#t~memset~res34#1.base, main_#t~memset~res34#1.offset;call main_#t~mem35#1.base, main_#t~mem35#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~mem35#1.base, 16 + main_#t~mem35#1.offset, 4);havoc main_#t~mem35#1.base, main_#t~mem35#1.offset;call main_#t~mem36#1.base, main_#t~mem36#1.offset := read~$Pointer$(main_~user~0#1.base, 8 + main_~user~0#1.offset, 4);call write~int(32, main_#t~mem36#1.base, 4 + main_#t~mem36#1.offset, 4);havoc main_#t~mem36#1.base, main_#t~mem36#1.offset;call main_#t~mem37#1.base, main_#t~mem37#1.offset := read~$Pointer$(main_~user~0#1.base, 8 + main_~user~0#1.offset, 4);call write~int(5, main_#t~mem37#1.base, 8 + main_#t~mem37#1.offset, 4);havoc main_#t~mem37#1.base, main_#t~mem37#1.offset;call main_#t~mem38#1.base, main_#t~mem38#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~mem38#1.base, 20 + main_#t~mem38#1.offset, 4);havoc main_#t~mem38#1.base, main_#t~mem38#1.offset;call main_#t~mem39#1.base, main_#t~mem39#1.offset := read~$Pointer$(main_~user~0#1.base, 8 + main_~user~0#1.offset, 4);call main_#t~malloc40#1.base, main_#t~malloc40#1.offset := #Ultimate.allocOnHeap(384);call write~$Pointer$(main_#t~malloc40#1.base, main_#t~malloc40#1.offset, main_#t~mem39#1.base, main_#t~mem39#1.offset, 4);havoc main_#t~mem39#1.base, main_#t~mem39#1.offset;havoc main_#t~malloc40#1.base, main_#t~malloc40#1.offset;call main_#t~mem41#1.base, main_#t~mem41#1.offset := read~$Pointer$(main_~user~0#1.base, 8 + main_~user~0#1.offset, 4);call write~int(2685476833, main_#t~mem41#1.base, 40 + main_#t~mem41#1.offset, 4);havoc main_#t~mem41#1.base, main_#t~mem41#1.offset;call main_#t~mem42#1.base, main_#t~mem42#1.offset := read~$Pointer$(main_~user~0#1.base, 8 + main_~user~0#1.offset, 4);call main_#t~mem43#1.base, main_#t~mem43#1.offset := read~$Pointer$(main_#t~mem42#1.base, main_#t~mem42#1.offset, 4); {22322#(< |ULTIMATE.start_main_~i~0#1| 7)} is VALID [2022-02-21 03:14:05,647 INFO L284 TraceCheckUtils]: 56: Hoare quadruple {21356#true} {22322#(< |ULTIMATE.start_main_~i~0#1| 7)} #484#return; {22322#(< |ULTIMATE.start_main_~i~0#1| 7)} is VALID [2022-02-21 03:14:05,647 INFO L290 TraceCheckUtils]: 55: Hoare triple {21356#true} assume #res.base == #ptr.base && #res.offset == #ptr.offset; {21356#true} is VALID [2022-02-21 03:14:05,648 INFO L290 TraceCheckUtils]: 54: Hoare triple {21356#true} assume !(#t~loopctr143 % 4294967296 < #amount % 4294967296); {21356#true} is VALID [2022-02-21 03:14:05,648 INFO L290 TraceCheckUtils]: 53: Hoare triple {21356#true} assume #t~loopctr143 % 4294967296 < #amount % 4294967296;#memory_$Pointer$.base, #memory_$Pointer$.offset := #memory_$Pointer$.base[#ptr.base,#ptr.offset + #t~loopctr143 := 0], #memory_$Pointer$.offset[#ptr.base,#ptr.offset + #t~loopctr143 := #value % 256];#memory_int := #memory_int[#ptr.base,#ptr.offset + #t~loopctr143 := #value];#t~loopctr143 := 1 + #t~loopctr143; {21356#true} is VALID [2022-02-21 03:14:05,648 INFO L290 TraceCheckUtils]: 52: Hoare triple {21356#true} assume #t~loopctr143 % 4294967296 < #amount % 4294967296;#memory_$Pointer$.base, #memory_$Pointer$.offset := #memory_$Pointer$.base[#ptr.base,#ptr.offset + #t~loopctr143 := 0], #memory_$Pointer$.offset[#ptr.base,#ptr.offset + #t~loopctr143 := #value % 256];#memory_int := #memory_int[#ptr.base,#ptr.offset + #t~loopctr143 := #value];#t~loopctr143 := 1 + #t~loopctr143; {21356#true} is VALID [2022-02-21 03:14:05,648 INFO L290 TraceCheckUtils]: 51: Hoare triple {21356#true} assume #t~loopctr143 % 4294967296 < #amount % 4294967296;#memory_$Pointer$.base, #memory_$Pointer$.offset := #memory_$Pointer$.base[#ptr.base,#ptr.offset + #t~loopctr143 := 0], #memory_$Pointer$.offset[#ptr.base,#ptr.offset + #t~loopctr143 := #value % 256];#memory_int := #memory_int[#ptr.base,#ptr.offset + #t~loopctr143 := #value];#t~loopctr143 := 1 + #t~loopctr143; {21356#true} is VALID [2022-02-21 03:14:05,648 INFO L290 TraceCheckUtils]: 50: Hoare triple {21356#true} assume #t~loopctr143 % 4294967296 < #amount % 4294967296;#memory_$Pointer$.base, #memory_$Pointer$.offset := #memory_$Pointer$.base[#ptr.base,#ptr.offset + #t~loopctr143 := 0], #memory_$Pointer$.offset[#ptr.base,#ptr.offset + #t~loopctr143 := #value % 256];#memory_int := #memory_int[#ptr.base,#ptr.offset + #t~loopctr143 := #value];#t~loopctr143 := 1 + #t~loopctr143; {21356#true} is VALID [2022-02-21 03:14:05,648 INFO L290 TraceCheckUtils]: 49: Hoare triple {21356#true} assume #t~loopctr143 % 4294967296 < #amount % 4294967296;#memory_$Pointer$.base, #memory_$Pointer$.offset := #memory_$Pointer$.base[#ptr.base,#ptr.offset + #t~loopctr143 := 0], #memory_$Pointer$.offset[#ptr.base,#ptr.offset + #t~loopctr143 := #value % 256];#memory_int := #memory_int[#ptr.base,#ptr.offset + #t~loopctr143 := #value];#t~loopctr143 := 1 + #t~loopctr143; {21356#true} is VALID [2022-02-21 03:14:05,648 INFO L290 TraceCheckUtils]: 48: Hoare triple {21356#true} assume #t~loopctr143 % 4294967296 < #amount % 4294967296;#memory_$Pointer$.base, #memory_$Pointer$.offset := #memory_$Pointer$.base[#ptr.base,#ptr.offset + #t~loopctr143 := 0], #memory_$Pointer$.offset[#ptr.base,#ptr.offset + #t~loopctr143 := #value % 256];#memory_int := #memory_int[#ptr.base,#ptr.offset + #t~loopctr143 := #value];#t~loopctr143 := 1 + #t~loopctr143; {21356#true} is VALID [2022-02-21 03:14:05,648 INFO L290 TraceCheckUtils]: 47: Hoare triple {21356#true} assume #t~loopctr143 % 4294967296 < #amount % 4294967296;#memory_$Pointer$.base, #memory_$Pointer$.offset := #memory_$Pointer$.base[#ptr.base,#ptr.offset + #t~loopctr143 := 0], #memory_$Pointer$.offset[#ptr.base,#ptr.offset + #t~loopctr143 := #value % 256];#memory_int := #memory_int[#ptr.base,#ptr.offset + #t~loopctr143 := #value];#t~loopctr143 := 1 + #t~loopctr143; {21356#true} is VALID [2022-02-21 03:14:05,648 INFO L290 TraceCheckUtils]: 46: Hoare triple {21356#true} assume #t~loopctr143 % 4294967296 < #amount % 4294967296;#memory_$Pointer$.base, #memory_$Pointer$.offset := #memory_$Pointer$.base[#ptr.base,#ptr.offset + #t~loopctr143 := 0], #memory_$Pointer$.offset[#ptr.base,#ptr.offset + #t~loopctr143 := #value % 256];#memory_int := #memory_int[#ptr.base,#ptr.offset + #t~loopctr143 := #value];#t~loopctr143 := 1 + #t~loopctr143; {21356#true} is VALID [2022-02-21 03:14:05,648 INFO L290 TraceCheckUtils]: 45: Hoare triple {21356#true} assume #t~loopctr143 % 4294967296 < #amount % 4294967296;#memory_$Pointer$.base, #memory_$Pointer$.offset := #memory_$Pointer$.base[#ptr.base,#ptr.offset + #t~loopctr143 := 0], #memory_$Pointer$.offset[#ptr.base,#ptr.offset + #t~loopctr143 := #value % 256];#memory_int := #memory_int[#ptr.base,#ptr.offset + #t~loopctr143 := #value];#t~loopctr143 := 1 + #t~loopctr143; {21356#true} is VALID [2022-02-21 03:14:05,649 INFO L290 TraceCheckUtils]: 44: Hoare triple {21356#true} assume #t~loopctr143 % 4294967296 < #amount % 4294967296;#memory_$Pointer$.base, #memory_$Pointer$.offset := #memory_$Pointer$.base[#ptr.base,#ptr.offset + #t~loopctr143 := 0], #memory_$Pointer$.offset[#ptr.base,#ptr.offset + #t~loopctr143 := #value % 256];#memory_int := #memory_int[#ptr.base,#ptr.offset + #t~loopctr143 := #value];#t~loopctr143 := 1 + #t~loopctr143; {21356#true} is VALID [2022-02-21 03:14:05,649 INFO L290 TraceCheckUtils]: 43: Hoare triple {21356#true} #t~loopctr143 := 0; {21356#true} is VALID [2022-02-21 03:14:05,649 INFO L272 TraceCheckUtils]: 42: Hoare triple {22322#(< |ULTIMATE.start_main_~i~0#1| 7)} call main_#t~memset~res34#1.base, main_#t~memset~res34#1.offset := #Ultimate.C_memset(main_#t~mem33#1.base, main_#t~mem33#1.offset, 0, 44); {21356#true} is VALID [2022-02-21 03:14:05,649 INFO L290 TraceCheckUtils]: 41: Hoare triple {22322#(< |ULTIMATE.start_main_~i~0#1| 7)} assume !(main_#t~mem32#1.base == 0 && main_#t~mem32#1.offset == 0);havoc main_#t~mem32#1.base, main_#t~mem32#1.offset;call main_#t~mem33#1.base, main_#t~mem33#1.offset := read~$Pointer$(main_~user~0#1.base, 8 + main_~user~0#1.offset, 4); {22322#(< |ULTIMATE.start_main_~i~0#1| 7)} is VALID [2022-02-21 03:14:05,649 INFO L290 TraceCheckUtils]: 40: Hoare triple {22322#(< |ULTIMATE.start_main_~i~0#1| 7)} call main_#t~malloc31#1.base, main_#t~malloc31#1.offset := #Ultimate.allocOnHeap(44);call write~$Pointer$(main_#t~malloc31#1.base, main_#t~malloc31#1.offset, main_~user~0#1.base, 8 + main_~user~0#1.offset, 4);havoc main_#t~malloc31#1.base, main_#t~malloc31#1.offset;call main_#t~mem32#1.base, main_#t~mem32#1.offset := read~$Pointer$(main_~user~0#1.base, 8 + main_~user~0#1.offset, 4); {22322#(< |ULTIMATE.start_main_~i~0#1| 7)} is VALID [2022-02-21 03:14:05,650 INFO L290 TraceCheckUtils]: 39: Hoare triple {22322#(< |ULTIMATE.start_main_~i~0#1| 7)} 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); {22322#(< |ULTIMATE.start_main_~i~0#1| 7)} is VALID [2022-02-21 03:14:05,650 INFO L290 TraceCheckUtils]: 38: Hoare triple {22322#(< |ULTIMATE.start_main_~i~0#1| 7)} 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); {22322#(< |ULTIMATE.start_main_~i~0#1| 7)} is VALID [2022-02-21 03:14:05,650 INFO L290 TraceCheckUtils]: 37: Hoare triple {22322#(< |ULTIMATE.start_main_~i~0#1| 7)} goto; {22322#(< |ULTIMATE.start_main_~i~0#1| 7)} is VALID [2022-02-21 03:14:05,651 INFO L290 TraceCheckUtils]: 36: Hoare triple {22322#(< |ULTIMATE.start_main_~i~0#1| 7)} goto; {22322#(< |ULTIMATE.start_main_~i~0#1| 7)} is VALID [2022-02-21 03:14:05,651 INFO L290 TraceCheckUtils]: 35: Hoare triple {22322#(< |ULTIMATE.start_main_~i~0#1| 7)} goto; {22322#(< |ULTIMATE.start_main_~i~0#1| 7)} is VALID [2022-02-21 03:14:05,651 INFO L290 TraceCheckUtils]: 34: Hoare triple {22322#(< |ULTIMATE.start_main_~i~0#1| 7)} 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)))); {22322#(< |ULTIMATE.start_main_~i~0#1| 7)} is VALID [2022-02-21 03:14:05,651 INFO L290 TraceCheckUtils]: 33: Hoare triple {22322#(< |ULTIMATE.start_main_~i~0#1| 7)} havoc main_#t~switch19#1; {22322#(< |ULTIMATE.start_main_~i~0#1| 7)} is VALID [2022-02-21 03:14:05,652 INFO L290 TraceCheckUtils]: 32: Hoare triple {22322#(< |ULTIMATE.start_main_~i~0#1| 7)} assume main_#t~switch19#1;call main_#t~mem30#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~mem30#1 % 256;havoc main_#t~mem30#1; {22322#(< |ULTIMATE.start_main_~i~0#1| 7)} is VALID [2022-02-21 03:14:05,652 INFO L290 TraceCheckUtils]: 31: Hoare triple {22322#(< |ULTIMATE.start_main_~i~0#1| 7)} main_#t~switch19#1 := main_#t~switch19#1 || 1 == main_~_hj_k~0#1; {22322#(< |ULTIMATE.start_main_~i~0#1| 7)} is VALID [2022-02-21 03:14:05,652 INFO L290 TraceCheckUtils]: 30: Hoare triple {22322#(< |ULTIMATE.start_main_~i~0#1| 7)} assume main_#t~switch19#1;call main_#t~mem29#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~mem29#1 % 256);havoc main_#t~mem29#1; {22322#(< |ULTIMATE.start_main_~i~0#1| 7)} is VALID [2022-02-21 03:14:05,653 INFO L290 TraceCheckUtils]: 29: Hoare triple {22322#(< |ULTIMATE.start_main_~i~0#1| 7)} main_#t~switch19#1 := main_#t~switch19#1 || 2 == main_~_hj_k~0#1; {22322#(< |ULTIMATE.start_main_~i~0#1| 7)} is VALID [2022-02-21 03:14:05,653 INFO L290 TraceCheckUtils]: 28: Hoare triple {22322#(< |ULTIMATE.start_main_~i~0#1| 7)} assume main_#t~switch19#1;call main_#t~mem28#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~mem28#1 % 256);havoc main_#t~mem28#1; {22322#(< |ULTIMATE.start_main_~i~0#1| 7)} is VALID [2022-02-21 03:14:05,653 INFO L290 TraceCheckUtils]: 27: Hoare triple {22322#(< |ULTIMATE.start_main_~i~0#1| 7)} main_#t~switch19#1 := main_#t~switch19#1 || 3 == main_~_hj_k~0#1; {22322#(< |ULTIMATE.start_main_~i~0#1| 7)} is VALID [2022-02-21 03:14:05,654 INFO L290 TraceCheckUtils]: 26: Hoare triple {22322#(< |ULTIMATE.start_main_~i~0#1| 7)} assume main_#t~switch19#1;call main_#t~mem27#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~mem27#1 % 256);havoc main_#t~mem27#1; {22322#(< |ULTIMATE.start_main_~i~0#1| 7)} is VALID [2022-02-21 03:14:05,654 INFO L290 TraceCheckUtils]: 25: Hoare triple {22322#(< |ULTIMATE.start_main_~i~0#1| 7)} main_#t~switch19#1 := main_#t~switch19#1 || 4 == main_~_hj_k~0#1; {22322#(< |ULTIMATE.start_main_~i~0#1| 7)} is VALID [2022-02-21 03:14:05,654 INFO L290 TraceCheckUtils]: 24: Hoare triple {22322#(< |ULTIMATE.start_main_~i~0#1| 7)} assume !main_#t~switch19#1; {22322#(< |ULTIMATE.start_main_~i~0#1| 7)} is VALID [2022-02-21 03:14:05,654 INFO L290 TraceCheckUtils]: 23: Hoare triple {22322#(< |ULTIMATE.start_main_~i~0#1| 7)} main_#t~switch19#1 := main_#t~switch19#1 || 5 == main_~_hj_k~0#1; {22322#(< |ULTIMATE.start_main_~i~0#1| 7)} is VALID [2022-02-21 03:14:05,655 INFO L290 TraceCheckUtils]: 22: Hoare triple {22322#(< |ULTIMATE.start_main_~i~0#1| 7)} assume !main_#t~switch19#1; {22322#(< |ULTIMATE.start_main_~i~0#1| 7)} is VALID [2022-02-21 03:14:05,655 INFO L290 TraceCheckUtils]: 21: Hoare triple {22322#(< |ULTIMATE.start_main_~i~0#1| 7)} main_#t~switch19#1 := main_#t~switch19#1 || 6 == main_~_hj_k~0#1; {22322#(< |ULTIMATE.start_main_~i~0#1| 7)} is VALID [2022-02-21 03:14:05,655 INFO L290 TraceCheckUtils]: 20: Hoare triple {22322#(< |ULTIMATE.start_main_~i~0#1| 7)} assume !main_#t~switch19#1; {22322#(< |ULTIMATE.start_main_~i~0#1| 7)} is VALID [2022-02-21 03:14:05,656 INFO L290 TraceCheckUtils]: 19: Hoare triple {22322#(< |ULTIMATE.start_main_~i~0#1| 7)} main_#t~switch19#1 := main_#t~switch19#1 || 7 == main_~_hj_k~0#1; {22322#(< |ULTIMATE.start_main_~i~0#1| 7)} is VALID [2022-02-21 03:14:05,656 INFO L290 TraceCheckUtils]: 18: Hoare triple {22322#(< |ULTIMATE.start_main_~i~0#1| 7)} assume !main_#t~switch19#1; {22322#(< |ULTIMATE.start_main_~i~0#1| 7)} is VALID [2022-02-21 03:14:05,656 INFO L290 TraceCheckUtils]: 17: Hoare triple {22322#(< |ULTIMATE.start_main_~i~0#1| 7)} main_#t~switch19#1 := main_#t~switch19#1 || 8 == main_~_hj_k~0#1; {22322#(< |ULTIMATE.start_main_~i~0#1| 7)} is VALID [2022-02-21 03:14:05,656 INFO L290 TraceCheckUtils]: 16: Hoare triple {22322#(< |ULTIMATE.start_main_~i~0#1| 7)} assume !main_#t~switch19#1; {22322#(< |ULTIMATE.start_main_~i~0#1| 7)} is VALID [2022-02-21 03:14:05,657 INFO L290 TraceCheckUtils]: 15: Hoare triple {22322#(< |ULTIMATE.start_main_~i~0#1| 7)} main_#t~switch19#1 := main_#t~switch19#1 || 9 == main_~_hj_k~0#1; {22322#(< |ULTIMATE.start_main_~i~0#1| 7)} is VALID [2022-02-21 03:14:05,657 INFO L290 TraceCheckUtils]: 14: Hoare triple {22322#(< |ULTIMATE.start_main_~i~0#1| 7)} assume !main_#t~switch19#1; {22322#(< |ULTIMATE.start_main_~i~0#1| 7)} is VALID [2022-02-21 03:14:05,657 INFO L290 TraceCheckUtils]: 13: Hoare triple {22322#(< |ULTIMATE.start_main_~i~0#1| 7)} main_#t~switch19#1 := main_#t~switch19#1 || 10 == main_~_hj_k~0#1; {22322#(< |ULTIMATE.start_main_~i~0#1| 7)} is VALID [2022-02-21 03:14:05,657 INFO L290 TraceCheckUtils]: 12: Hoare triple {22322#(< |ULTIMATE.start_main_~i~0#1| 7)} assume !main_#t~switch19#1; {22322#(< |ULTIMATE.start_main_~i~0#1| 7)} is VALID [2022-02-21 03:14:05,658 INFO L290 TraceCheckUtils]: 11: Hoare triple {22322#(< |ULTIMATE.start_main_~i~0#1| 7)} main_~_ha_hashv~0#1 := 4 + main_~_ha_hashv~0#1;main_#t~switch19#1 := 11 == main_~_hj_k~0#1; {22322#(< |ULTIMATE.start_main_~i~0#1| 7)} is VALID [2022-02-21 03:14:05,658 INFO L290 TraceCheckUtils]: 10: Hoare triple {22322#(< |ULTIMATE.start_main_~i~0#1| 7)} assume !(main_~_hj_k~0#1 % 4294967296 >= 12); {22322#(< |ULTIMATE.start_main_~i~0#1| 7)} is VALID [2022-02-21 03:14:05,658 INFO L290 TraceCheckUtils]: 9: Hoare triple {22322#(< |ULTIMATE.start_main_~i~0#1| 7)} 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; {22322#(< |ULTIMATE.start_main_~i~0#1| 7)} is VALID [2022-02-21 03:14:05,658 INFO L290 TraceCheckUtils]: 8: Hoare triple {22322#(< |ULTIMATE.start_main_~i~0#1| 7)} goto; {22322#(< |ULTIMATE.start_main_~i~0#1| 7)} is VALID [2022-02-21 03:14:05,659 INFO L290 TraceCheckUtils]: 7: Hoare triple {22322#(< |ULTIMATE.start_main_~i~0#1| 7)} havoc main_~_ha_hashv~0#1; {22322#(< |ULTIMATE.start_main_~i~0#1| 7)} is VALID [2022-02-21 03:14:05,659 INFO L290 TraceCheckUtils]: 6: Hoare triple {22322#(< |ULTIMATE.start_main_~i~0#1| 7)} assume main_~i~0#1 * main_~i~0#1 >= -2147483648;call write~int(main_~i~0#1 * main_~i~0#1, main_~user~0#1.base, 4 + main_~user~0#1.offset, 4); {22322#(< |ULTIMATE.start_main_~i~0#1| 7)} is VALID [2022-02-21 03:14:05,659 INFO L290 TraceCheckUtils]: 5: Hoare triple {22322#(< |ULTIMATE.start_main_~i~0#1| 7)} assume main_~i~0#1 * main_~i~0#1 <= 2147483647; {22322#(< |ULTIMATE.start_main_~i~0#1| 7)} is VALID [2022-02-21 03:14:05,660 INFO L290 TraceCheckUtils]: 4: Hoare triple {22322#(< |ULTIMATE.start_main_~i~0#1| 7)} call write~int(main_~i~0#1, main_~user~0#1.base, main_~user~0#1.offset, 4); {22322#(< |ULTIMATE.start_main_~i~0#1| 7)} is VALID [2022-02-21 03:14:05,660 INFO L290 TraceCheckUtils]: 3: Hoare triple {22322#(< |ULTIMATE.start_main_~i~0#1| 7)} assume !(main_~user~0#1.base == 0 && main_~user~0#1.offset == 0); {22322#(< |ULTIMATE.start_main_~i~0#1| 7)} is VALID [2022-02-21 03:14:05,660 INFO L290 TraceCheckUtils]: 2: Hoare triple {22322#(< |ULTIMATE.start_main_~i~0#1| 7)} assume !!(main_~i~0#1 < 10);call main_#t~malloc6#1.base, main_#t~malloc6#1.offset := #Ultimate.allocOnHeap(40);main_~user~0#1.base, main_~user~0#1.offset := main_#t~malloc6#1.base, main_#t~malloc6#1.offset;havoc main_#t~malloc6#1.base, main_#t~malloc6#1.offset; {22322#(< |ULTIMATE.start_main_~i~0#1| 7)} is VALID [2022-02-21 03:14:05,661 INFO L290 TraceCheckUtils]: 1: Hoare triple {21356#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc6#1.base, main_#t~malloc6#1.offset, main_#t~mem8#1, main_#t~mem7#1, main_#t~mem9#1, main_#t~mem10#1, main_#t~mem12#1, main_#t~mem11#1, main_#t~mem13#1, main_#t~mem14#1, main_#t~mem16#1, main_#t~mem15#1, main_#t~mem17#1, main_#t~mem18#1, main_#t~switch19#1, main_#t~mem20#1, main_#t~mem21#1, main_#t~mem22#1, main_#t~mem23#1, main_#t~mem24#1, main_#t~mem25#1, main_#t~mem26#1, main_#t~mem27#1, main_#t~mem28#1, main_#t~mem29#1, main_#t~mem30#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~malloc31#1.base, main_#t~malloc31#1.offset, main_#t~mem32#1.base, main_#t~mem32#1.offset, main_#t~mem33#1.base, main_#t~mem33#1.offset, main_#t~memset~res34#1.base, main_#t~memset~res34#1.offset, main_#t~mem35#1.base, main_#t~mem35#1.offset, main_#t~mem36#1.base, main_#t~mem36#1.offset, main_#t~mem37#1.base, main_#t~mem37#1.offset, main_#t~mem38#1.base, main_#t~mem38#1.offset, main_#t~mem39#1.base, main_#t~mem39#1.offset, main_#t~malloc40#1.base, main_#t~malloc40#1.offset, main_#t~mem41#1.base, main_#t~mem41#1.offset, main_#t~mem42#1.base, main_#t~mem42#1.offset, main_#t~mem43#1.base, main_#t~mem43#1.offset, main_#t~mem44#1.base, main_#t~mem44#1.offset, main_#t~mem45#1.base, main_#t~mem45#1.offset, main_#t~mem46#1.base, main_#t~mem46#1.offset, main_#t~memset~res47#1.base, main_#t~memset~res47#1.offset, main_#t~mem48#1.base, main_#t~mem48#1.offset, main_#t~mem49#1.base, main_#t~mem49#1.offset, main_#t~mem50#1.base, main_#t~mem50#1.offset, main_#t~mem51#1.base, main_#t~mem51#1.offset, main_#t~mem52#1, main_#t~mem53#1.base, main_#t~mem53#1.offset, main_#t~mem54#1.base, main_#t~mem54#1.offset, main_#t~mem55#1.base, main_#t~mem55#1.offset, main_#t~mem56#1.base, main_#t~mem56#1.offset, main_#t~mem57#1, main_#t~post58#1, main_#t~mem59#1.base, main_#t~mem59#1.offset, main_#t~mem60#1, main_#t~mem61#1.base, main_#t~mem61#1.offset, main_#t~mem62#1.base, main_#t~mem62#1.offset, main_#t~mem63#1, main_#t~post64#1, main_#t~mem65#1.base, main_#t~mem65#1.offset, main_#t~mem66#1.base, main_#t~mem66#1.offset, main_#t~mem67#1.base, main_#t~mem67#1.offset, main_#t~mem69#1, main_#t~mem68#1, main_#t~mem70#1.base, main_#t~mem70#1.offset, main_#t~mem71#1, main_#t~short72#1, main_#t~mem73#1.base, main_#t~mem73#1.offset, main_#t~mem74#1, main_#t~malloc75#1.base, main_#t~malloc75#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~mem79#1, main_#t~memset~res80#1.base, main_#t~memset~res80#1.offset, main_#t~mem81#1.base, main_#t~mem81#1.offset, main_#t~mem82#1.base, main_#t~mem82#1.offset, main_#t~mem85#1, main_#t~mem83#1.base, main_#t~mem83#1.offset, main_#t~mem84#1, main_#t~mem86#1.base, main_#t~mem86#1.offset, main_#t~mem89#1, main_#t~mem87#1.base, main_#t~mem87#1.offset, main_#t~mem88#1, main_#t~ite90#1, main_#t~mem91#1.base, main_#t~mem91#1.offset, main_#t~mem95#1.base, main_#t~mem95#1.offset, main_#t~mem96#1.base, main_#t~mem96#1.offset, main_#t~mem97#1.base, main_#t~mem97#1.offset, main_#t~mem98#1.base, main_#t~mem98#1.offset, main_#t~mem101#1, main_#t~mem99#1.base, main_#t~mem99#1.offset, main_#t~mem100#1, main_#t~mem102#1.base, main_#t~mem102#1.offset, main_#t~mem103#1, main_#t~pre104#1, main_#t~mem105#1.base, main_#t~mem105#1.offset, main_#t~mem106#1, main_#t~mem107#1.base, main_#t~mem107#1.offset, main_#t~mem108#1, main_#t~post109#1, main_#t~mem113#1, main_#t~mem111#1, main_#t~mem110#1.base, main_#t~mem110#1.offset, main_#t~mem112#1, main_#t~mem114#1, main_#t~post115#1, main_#t~mem116#1.base, main_#t~mem116#1.offset, main_#t~mem117#1.base, main_#t~mem117#1.offset, main_#t~mem118#1.base, main_#t~mem118#1.offset, main_#t~post92#1, main_#t~mem93#1.base, main_#t~mem93#1.offset, main_#t~mem94#1, main_#t~mem119#1.base, main_#t~mem119#1.offset, main_#t~mem120#1.base, main_#t~mem120#1.offset, main_#t~mem121#1.base, main_#t~mem121#1.offset, main_#t~mem122#1, main_#t~mem123#1.base, main_#t~mem123#1.offset, main_#t~mem124#1, main_#t~post125#1, main_#t~mem126#1.base, main_#t~mem126#1.offset, main_#t~mem127#1.base, main_#t~mem127#1.offset, main_#t~mem128#1.base, main_#t~mem128#1.offset, main_#t~mem129#1.base, main_#t~mem129#1.offset, main_#t~mem132#1, main_#t~mem130#1.base, main_#t~mem130#1.offset, main_#t~mem131#1, main_#t~ite135#1, main_#t~mem133#1.base, main_#t~mem133#1.offset, main_#t~mem134#1, main_#t~mem136#1.base, main_#t~mem136#1.offset, main_#t~mem137#1, main_#t~mem138#1.base, main_#t~mem138#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~post5#1, main_#t~mem140#1, main_#t~mem141#1, main_#t~mem139#1.base, main_#t~mem139#1.offset, main_~i~0#1, main_~user~0#1.base, main_~user~0#1.offset, main_~users~0#1.base, main_~users~0#1.offset;havoc main_~i~0#1;havoc main_~user~0#1.base, main_~user~0#1.offset;main_~users~0#1.base, main_~users~0#1.offset := 0, 0;main_~i~0#1 := 0; {22322#(< |ULTIMATE.start_main_~i~0#1| 7)} is VALID [2022-02-21 03:14:05,661 INFO L290 TraceCheckUtils]: 0: Hoare triple {21356#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);~count_int_int~0 := 0; {21356#true} is VALID [2022-02-21 03:14:05,661 INFO L134 CoverageAnalysis]: Checked inductivity of 303 backedges. 0 proven. 164 refuted. 0 times theorem prover too weak. 139 trivial. 0 not checked. [2022-02-21 03:14:05,661 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 03:14:05,661 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1280819251] [2022-02-21 03:14:05,662 WARN L317 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-02-21 03:14:05,662 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1521528739] [2022-02-21 03:14:05,662 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1521528739] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-21 03:14:05,662 INFO L191 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-02-21 03:14:05,662 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 16 [2022-02-21 03:14:05,662 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1106207328] [2022-02-21 03:14:05,662 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-02-21 03:14:05,663 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 22.0) internal successors, (352), 16 states have internal predecessors, (352), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 201 [2022-02-21 03:14:05,663 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-21 03:14:05,664 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 16 states, 16 states have (on average 22.0) internal successors, (352), 16 states have internal predecessors, (352), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-02-21 03:14:05,984 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 360 edges. 360 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:14:05,984 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-02-21 03:14:05,984 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 03:14:05,984 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-02-21 03:14:05,985 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=72, Invalid=168, Unknown=0, NotChecked=0, Total=240 [2022-02-21 03:14:05,985 INFO L87 Difference]: Start difference. First operand 341 states and 428 transitions. Second operand has 16 states, 16 states have (on average 22.0) internal successors, (352), 16 states have internal predecessors, (352), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-02-21 03:14:09,301 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:14:09,302 INFO L93 Difference]: Finished difference Result 750 states and 940 transitions. [2022-02-21 03:14:09,302 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-02-21 03:14:09,302 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 22.0) internal successors, (352), 16 states have internal predecessors, (352), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 201 [2022-02-21 03:14:09,302 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-21 03:14:09,303 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 16 states have (on average 22.0) internal successors, (352), 16 states have internal predecessors, (352), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-02-21 03:14:09,310 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 862 transitions. [2022-02-21 03:14:09,310 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 16 states have (on average 22.0) internal successors, (352), 16 states have internal predecessors, (352), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-02-21 03:14:09,314 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 862 transitions. [2022-02-21 03:14:09,314 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 15 states and 862 transitions. [2022-02-21 03:14:10,002 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 862 edges. 862 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:14:10,019 INFO L225 Difference]: With dead ends: 750 [2022-02-21 03:14:10,020 INFO L226 Difference]: Without dead ends: 717 [2022-02-21 03:14:10,020 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 406 GetRequests, 386 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=151, Invalid=311, Unknown=0, NotChecked=0, Total=462 [2022-02-21 03:14:10,021 INFO L933 BasicCegarLoop]: 235 mSDtfsCounter, 767 mSDsluCounter, 2001 mSDsCounter, 0 mSdLazyCounter, 145 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 786 SdHoareTripleChecker+Valid, 2236 SdHoareTripleChecker+Invalid, 161 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 145 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-21 03:14:10,021 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [786 Valid, 2236 Invalid, 161 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 145 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-21 03:14:10,022 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 717 states. [2022-02-21 03:14:10,311 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 717 to 717. [2022-02-21 03:14:10,311 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 03:14:10,312 INFO L82 GeneralOperation]: Start isEquivalent. First operand 717 states. Second operand has 717 states, 680 states have (on average 1.1985294117647058) internal successors, (815), 692 states have internal predecessors, (815), 31 states have call successors, (31), 3 states have call predecessors, (31), 4 states have return successors, (38), 22 states have call predecessors, (38), 31 states have call successors, (38) [2022-02-21 03:14:10,312 INFO L74 IsIncluded]: Start isIncluded. First operand 717 states. Second operand has 717 states, 680 states have (on average 1.1985294117647058) internal successors, (815), 692 states have internal predecessors, (815), 31 states have call successors, (31), 3 states have call predecessors, (31), 4 states have return successors, (38), 22 states have call predecessors, (38), 31 states have call successors, (38) [2022-02-21 03:14:10,313 INFO L87 Difference]: Start difference. First operand 717 states. Second operand has 717 states, 680 states have (on average 1.1985294117647058) internal successors, (815), 692 states have internal predecessors, (815), 31 states have call successors, (31), 3 states have call predecessors, (31), 4 states have return successors, (38), 22 states have call predecessors, (38), 31 states have call successors, (38) [2022-02-21 03:14:10,328 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:14:10,328 INFO L93 Difference]: Finished difference Result 717 states and 884 transitions. [2022-02-21 03:14:10,328 INFO L276 IsEmpty]: Start isEmpty. Operand 717 states and 884 transitions. [2022-02-21 03:14:10,330 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:14:10,330 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:14:10,331 INFO L74 IsIncluded]: Start isIncluded. First operand has 717 states, 680 states have (on average 1.1985294117647058) internal successors, (815), 692 states have internal predecessors, (815), 31 states have call successors, (31), 3 states have call predecessors, (31), 4 states have return successors, (38), 22 states have call predecessors, (38), 31 states have call successors, (38) Second operand 717 states. [2022-02-21 03:14:10,331 INFO L87 Difference]: Start difference. First operand has 717 states, 680 states have (on average 1.1985294117647058) internal successors, (815), 692 states have internal predecessors, (815), 31 states have call successors, (31), 3 states have call predecessors, (31), 4 states have return successors, (38), 22 states have call predecessors, (38), 31 states have call successors, (38) Second operand 717 states. [2022-02-21 03:14:10,346 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:14:10,347 INFO L93 Difference]: Finished difference Result 717 states and 884 transitions. [2022-02-21 03:14:10,347 INFO L276 IsEmpty]: Start isEmpty. Operand 717 states and 884 transitions. [2022-02-21 03:14:10,348 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:14:10,348 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:14:10,348 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 03:14:10,348 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 03:14:10,349 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 717 states, 680 states have (on average 1.1985294117647058) internal successors, (815), 692 states have internal predecessors, (815), 31 states have call successors, (31), 3 states have call predecessors, (31), 4 states have return successors, (38), 22 states have call predecessors, (38), 31 states have call successors, (38) [2022-02-21 03:14:10,366 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 717 states to 717 states and 884 transitions. [2022-02-21 03:14:10,366 INFO L78 Accepts]: Start accepts. Automaton has 717 states and 884 transitions. Word has length 201 [2022-02-21 03:14:10,367 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-21 03:14:10,367 INFO L470 AbstractCegarLoop]: Abstraction has 717 states and 884 transitions. [2022-02-21 03:14:10,367 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 22.0) internal successors, (352), 16 states have internal predecessors, (352), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-02-21 03:14:10,367 INFO L276 IsEmpty]: Start isEmpty. Operand 717 states and 884 transitions. [2022-02-21 03:14:10,371 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 422 [2022-02-21 03:14:10,371 INFO L506 BasicCegarLoop]: Found error trace [2022-02-21 03:14:10,372 INFO L514 BasicCegarLoop]: trace histogram [15, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-21 03:14:10,399 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:14:10,587 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,SelfDestructingSolverStorable12 [2022-02-21 03:14:10,588 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2022-02-21 03:14:10,588 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:14:10,588 INFO L85 PathProgramCache]: Analyzing trace with hash -339908487, now seen corresponding path program 2 times [2022-02-21 03:14:10,588 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:14:10,588 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1161168987] [2022-02-21 03:14:10,588 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:14:10,588 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:14:10,976 ERROR L252 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-02-21 03:14:10,976 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [482879618] [2022-02-21 03:14:10,976 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-02-21 03:14:10,976 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-21 03:14:10,976 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:14:10,977 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:14:10,978 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process