./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/uthash-2.0.2/uthash_SAX_test8-2.i --full-output -ea --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability 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_SAX_test8-2.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-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 ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 42d34b3801344b79b388ecea52b2e670196aa6b758fe24ea6ecf5c2b8bbf579b --- Real Ultimate output --- This is Ultimate 0.2.2-dev-03d7b7b [2022-02-20 23:32:54,084 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-02-20 23:32:54,086 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-02-20 23:32:54,117 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-02-20 23:32:54,118 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-02-20 23:32:54,120 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-02-20 23:32:54,123 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-02-20 23:32:54,125 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-02-20 23:32:54,126 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-02-20 23:32:54,129 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-02-20 23:32:54,130 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-02-20 23:32:54,131 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-02-20 23:32:54,131 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-02-20 23:32:54,133 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-02-20 23:32:54,134 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-02-20 23:32:54,136 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-02-20 23:32:54,137 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-02-20 23:32:54,138 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-02-20 23:32:54,139 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-02-20 23:32:54,143 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-02-20 23:32:54,144 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-02-20 23:32:54,145 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-02-20 23:32:54,146 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-02-20 23:32:54,147 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-02-20 23:32:54,151 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-02-20 23:32:54,151 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-02-20 23:32:54,151 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-02-20 23:32:54,153 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-02-20 23:32:54,153 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-02-20 23:32:54,153 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-02-20 23:32:54,154 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-02-20 23:32:54,154 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-02-20 23:32:54,155 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-02-20 23:32:54,156 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-02-20 23:32:54,158 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-02-20 23:32:54,158 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-02-20 23:32:54,159 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-02-20 23:32:54,159 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-02-20 23:32:54,159 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-02-20 23:32:54,160 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-02-20 23:32:54,160 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-02-20 23:32:54,161 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2022-02-20 23:32:54,182 INFO L113 SettingsManager]: Loading preferences was successful [2022-02-20 23:32:54,183 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-02-20 23:32:54,183 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-02-20 23:32:54,183 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-02-20 23:32:54,184 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-02-20 23:32:54,184 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-02-20 23:32:54,185 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-02-20 23:32:54,185 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-02-20 23:32:54,185 INFO L138 SettingsManager]: * Use SBE=true [2022-02-20 23:32:54,185 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-02-20 23:32:54,186 INFO L138 SettingsManager]: * sizeof long=4 [2022-02-20 23:32:54,186 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-02-20 23:32:54,186 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-02-20 23:32:54,186 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-02-20 23:32:54,186 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-02-20 23:32:54,187 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-02-20 23:32:54,187 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-02-20 23:32:54,187 INFO L138 SettingsManager]: * sizeof long double=12 [2022-02-20 23:32:54,187 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-02-20 23:32:54,187 INFO L138 SettingsManager]: * Use constant arrays=true [2022-02-20 23:32:54,187 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-02-20 23:32:54,187 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-02-20 23:32:54,188 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-02-20 23:32:54,188 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-02-20 23:32:54,188 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 23:32:54,188 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-02-20 23:32:54,188 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-02-20 23:32:54,189 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-02-20 23:32:54,189 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-02-20 23:32:54,189 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-02-20 23:32:54,190 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-02-20 23:32:54,190 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-02-20 23:32:54,190 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-02-20 23:32:54,190 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 ! call(reach_error())) ) 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 -> 42d34b3801344b79b388ecea52b2e670196aa6b758fe24ea6ecf5c2b8bbf579b [2022-02-20 23:32:54,388 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-02-20 23:32:54,408 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-02-20 23:32:54,411 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-02-20 23:32:54,412 INFO L271 PluginConnector]: Initializing CDTParser... [2022-02-20 23:32:54,412 INFO L275 PluginConnector]: CDTParser initialized [2022-02-20 23:32:54,413 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/uthash-2.0.2/uthash_SAX_test8-2.i [2022-02-20 23:32:54,454 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9588d42ae/da6c273cdbca4157b30e4124fcb258a6/FLAG87685b6a3 [2022-02-20 23:32:54,911 INFO L306 CDTParser]: Found 1 translation units. [2022-02-20 23:32:54,912 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_SAX_test8-2.i [2022-02-20 23:32:54,944 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9588d42ae/da6c273cdbca4157b30e4124fcb258a6/FLAG87685b6a3 [2022-02-20 23:32:55,443 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9588d42ae/da6c273cdbca4157b30e4124fcb258a6 [2022-02-20 23:32:55,445 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-02-20 23:32:55,446 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-02-20 23:32:55,450 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-02-20 23:32:55,450 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-02-20 23:32:55,452 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-02-20 23:32:55,453 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 11:32:55" (1/1) ... [2022-02-20 23:32:55,454 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@169877ca and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:32:55, skipping insertion in model container [2022-02-20 23:32:55,454 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 11:32:55" (1/1) ... [2022-02-20 23:32:55,458 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-02-20 23:32:55,526 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-20 23:32:55,835 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_SAX_test8-2.i[33021,33034] [2022-02-20 23:32:55,966 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_SAX_test8-2.i[45234,45247] [2022-02-20 23:32:55,978 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 23:32:55,984 INFO L203 MainTranslator]: Completed pre-run [2022-02-20 23:32:56,022 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_SAX_test8-2.i[33021,33034] [2022-02-20 23:32:56,096 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_SAX_test8-2.i[45234,45247] [2022-02-20 23:32:56,138 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 23:32:56,169 INFO L208 MainTranslator]: Completed translation [2022-02-20 23:32:56,169 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:32:56 WrapperNode [2022-02-20 23:32:56,170 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-02-20 23:32:56,170 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-02-20 23:32:56,171 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-02-20 23:32:56,171 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-02-20 23:32:56,176 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:32:56" (1/1) ... [2022-02-20 23:32:56,209 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:32:56" (1/1) ... [2022-02-20 23:32:56,287 INFO L137 Inliner]: procedures = 177, calls = 348, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 1151 [2022-02-20 23:32:56,289 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-02-20 23:32:56,289 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-02-20 23:32:56,290 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-02-20 23:32:56,290 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-02-20 23:32:56,296 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:32:56" (1/1) ... [2022-02-20 23:32:56,297 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:32:56" (1/1) ... [2022-02-20 23:32:56,314 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:32:56" (1/1) ... [2022-02-20 23:32:56,315 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:32:56" (1/1) ... [2022-02-20 23:32:56,376 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:32:56" (1/1) ... [2022-02-20 23:32:56,385 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:32:56" (1/1) ... [2022-02-20 23:32:56,389 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:32:56" (1/1) ... [2022-02-20 23:32:56,396 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-02-20 23:32:56,397 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-02-20 23:32:56,397 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-02-20 23:32:56,397 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-02-20 23:32:56,398 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:32:56" (1/1) ... [2022-02-20 23:32:56,420 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 23:32:56,427 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 23:32:56,442 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-20 23:32:56,460 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-20 23:32:56,470 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-02-20 23:32:56,471 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-02-20 23:32:56,471 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-02-20 23:32:56,471 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-02-20 23:32:56,471 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset [2022-02-20 23:32:56,471 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset [2022-02-20 23:32:56,471 INFO L130 BoogieDeclarations]: Found specification of procedure test_int [2022-02-20 23:32:56,472 INFO L138 BoogieDeclarations]: Found implementation of procedure test_int [2022-02-20 23:32:56,472 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-02-20 23:32:56,472 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-02-20 23:32:56,472 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-02-20 23:32:56,472 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-02-20 23:32:56,472 INFO L130 BoogieDeclarations]: Found specification of procedure memcmp [2022-02-20 23:32:56,472 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-02-20 23:32:56,473 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-02-20 23:32:56,473 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-02-20 23:32:56,473 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-02-20 23:32:56,473 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-02-20 23:32:56,623 INFO L234 CfgBuilder]: Building ICFG [2022-02-20 23:32:56,624 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-02-20 23:32:58,361 INFO L275 CfgBuilder]: Performing block encoding [2022-02-20 23:32:58,369 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-02-20 23:32:58,369 INFO L299 CfgBuilder]: Removed 71 assume(true) statements. [2022-02-20 23:32:58,371 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 11:32:58 BoogieIcfgContainer [2022-02-20 23:32:58,371 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-02-20 23:32:58,372 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-02-20 23:32:58,372 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-02-20 23:32:58,374 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-02-20 23:32:58,374 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.02 11:32:55" (1/3) ... [2022-02-20 23:32:58,375 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1a28ff3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 11:32:58, skipping insertion in model container [2022-02-20 23:32:58,375 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:32:56" (2/3) ... [2022-02-20 23:32:58,375 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1a28ff3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 11:32:58, skipping insertion in model container [2022-02-20 23:32:58,375 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 11:32:58" (3/3) ... [2022-02-20 23:32:58,376 INFO L111 eAbstractionObserver]: Analyzing ICFG uthash_SAX_test8-2.i [2022-02-20 23:32:58,379 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-02-20 23:32:58,380 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2022-02-20 23:32:58,410 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-02-20 23:32:58,414 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=PETRI_NET, 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-20 23:32:58,415 INFO L340 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2022-02-20 23:32:58,431 INFO L276 IsEmpty]: Start isEmpty. Operand has 255 states, 229 states have (on average 1.6943231441048034) internal successors, (388), 246 states have internal predecessors, (388), 20 states have call successors, (20), 3 states have call predecessors, (20), 3 states have return successors, (20), 6 states have call predecessors, (20), 20 states have call successors, (20) [2022-02-20 23:32:58,434 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2022-02-20 23:32:58,434 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:32:58,435 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 23:32:58,435 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 23:32:58,438 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:32:58,438 INFO L85 PathProgramCache]: Analyzing trace with hash 1334755327, now seen corresponding path program 1 times [2022-02-20 23:32:58,444 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 23:32:58,445 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1606739333] [2022-02-20 23:32:58,445 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:32:58,445 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 23:32:58,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:32:58,578 INFO L290 TraceCheckUtils]: 0: Hoare triple {258#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~0 := 0; {258#true} is VALID [2022-02-20 23:32:58,578 INFO L290 TraceCheckUtils]: 1: Hoare triple {258#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc8#1.base, main_#t~malloc8#1.offset, main_#t~mem9#1, main_#t~mem10#1, main_#t~mem11#1, main_#t~mem13#1, main_#t~mem12#1, main_#t~mem14#1, main_#t~mem15#1, main_#t~mem17#1, main_#t~mem16#1, main_#t~mem18#1, main_#t~mem19#1, main_#t~mem21#1, main_#t~mem20#1, main_#t~mem22#1, main_#t~mem23#1, main_#t~switch24#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_#t~mem31#1, main_#t~mem32#1, main_#t~mem33#1, main_#t~mem34#1, main_#t~mem35#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~malloc36#1.base, main_#t~malloc36#1.offset, main_#t~mem37#1.base, main_#t~mem37#1.offset, main_#t~mem38#1.base, main_#t~mem38#1.offset, main_#t~memset~res39#1.base, main_#t~memset~res39#1.offset, main_#t~mem40#1.base, main_#t~mem40#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~malloc45#1.base, main_#t~malloc45#1.offset, main_#t~mem46#1.base, main_#t~mem46#1.offset, main_#t~mem47#1.base, main_#t~mem47#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~memset~res52#1.base, main_#t~memset~res52#1.offset, 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~mem58#1.base, main_#t~mem58#1.offset, main_#t~mem59#1.base, main_#t~mem59#1.offset, main_#t~mem60#1.base, main_#t~mem60#1.offset, main_#t~mem61#1.base, main_#t~mem61#1.offset, main_#t~mem62#1, main_#t~post63#1, main_#t~mem64#1.base, main_#t~mem64#1.offset, main_#t~mem65#1, main_#t~mem66#1.base, main_#t~mem66#1.offset, main_#t~mem67#1.base, main_#t~mem67#1.offset, main_#t~mem68#1, main_#t~post69#1, main_#t~mem70#1.base, main_#t~mem70#1.offset, main_#t~mem71#1.base, main_#t~mem71#1.offset, main_#t~mem72#1.base, main_#t~mem72#1.offset, main_#t~mem74#1, main_#t~mem73#1, main_#t~mem75#1.base, main_#t~mem75#1.offset, main_#t~mem76#1, main_#t~short77#1, main_#t~mem78#1.base, main_#t~mem78#1.offset, main_#t~mem79#1, main_#t~malloc80#1.base, main_#t~malloc80#1.offset, main_#t~mem81#1.base, main_#t~mem81#1.offset, main_#t~mem82#1.base, main_#t~mem82#1.offset, main_#t~mem83#1.base, main_#t~mem83#1.offset, main_#t~mem84#1, main_#t~memset~res85#1.base, main_#t~memset~res85#1.offset, main_#t~mem86#1.base, main_#t~mem86#1.offset, main_#t~mem87#1.base, main_#t~mem87#1.offset, main_#t~mem90#1, main_#t~mem88#1.base, main_#t~mem88#1.offset, main_#t~mem89#1, main_#t~mem91#1.base, main_#t~mem91#1.offset, main_#t~mem94#1, main_#t~mem92#1.base, main_#t~mem92#1.offset, main_#t~mem93#1, main_#t~ite95#1, main_#t~mem96#1.base, main_#t~mem96#1.offset, main_#t~mem100#1.base, main_#t~mem100#1.offset, main_#t~mem101#1.base, main_#t~mem101#1.offset, main_#t~mem102#1.base, main_#t~mem102#1.offset, main_#t~mem103#1.base, main_#t~mem103#1.offset, main_#t~mem106#1, main_#t~mem104#1.base, main_#t~mem104#1.offset, main_#t~mem105#1, main_#t~mem107#1.base, main_#t~mem107#1.offset, main_#t~mem108#1, main_#t~pre109#1, main_#t~mem110#1.base, main_#t~mem110#1.offset, main_#t~mem111#1, main_#t~mem112#1.base, main_#t~mem112#1.offset, main_#t~mem113#1, main_#t~post114#1, main_#t~mem118#1, main_#t~mem116#1, main_#t~mem115#1.base, main_#t~mem115#1.offset, main_#t~mem117#1, main_#t~mem119#1, main_#t~post120#1, main_#t~mem121#1.base, main_#t~mem121#1.offset, main_#t~mem122#1.base, main_#t~mem122#1.offset, main_#t~mem123#1.base, main_#t~mem123#1.offset, main_#t~post97#1, main_#t~mem98#1.base, main_#t~mem98#1.offset, main_#t~mem99#1, main_#t~mem124#1.base, main_#t~mem124#1.offset, main_#t~mem125#1.base, main_#t~mem125#1.offset, main_#t~mem126#1.base, main_#t~mem126#1.offset, main_#t~mem127#1, main_#t~mem128#1.base, main_#t~mem128#1.offset, main_#t~mem129#1, main_#t~post130#1, main_#t~mem131#1.base, main_#t~mem131#1.offset, main_#t~mem132#1.base, main_#t~mem132#1.offset, main_#t~mem133#1.base, main_#t~mem133#1.offset, main_#t~mem134#1.base, main_#t~mem134#1.offset, main_#t~mem137#1, main_#t~mem135#1.base, main_#t~mem135#1.offset, main_#t~mem136#1, main_#t~ite140#1, main_#t~mem138#1.base, main_#t~mem138#1.offset, main_#t~mem139#1, main_#t~mem141#1.base, main_#t~mem141#1.offset, main_#t~mem142#1, main_#t~mem143#1.base, main_#t~mem143#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~mem144#1.base, main_#t~mem144#1.offset, main_#t~mem145#1, main_#t~mem5#1, main_#t~post6#1, main_#t~mem7#1, main_#t~mem149#1, main_#t~mem148#1, main_#t~mem150#1, main_#t~mem151#1, main_#t~mem153#1, main_#t~mem152#1, main_#t~mem154#1, main_#t~mem155#1, main_#t~mem157#1, main_#t~mem156#1, main_#t~mem158#1, main_#t~mem159#1, main_#t~switch160#1, main_#t~mem161#1, main_#t~mem162#1, main_#t~mem163#1, main_#t~mem164#1, main_#t~mem165#1, main_#t~mem166#1, main_#t~mem167#1, main_#t~mem168#1, main_#t~mem169#1, main_#t~mem170#1, main_#t~mem171#1, main_~_hj_i~1#1, main_~_hj_j~1#1, main_~_hj_k~1#1, main_~_hj_key~1#1.base, main_~_hj_key~1#1.offset, main_#t~mem172#1.base, main_#t~mem172#1.offset, main_#t~mem173#1, main_#t~mem174#1.base, main_#t~mem174#1.offset, main_#t~mem175#1.base, main_#t~mem175#1.offset, main_#t~mem176#1.base, main_#t~mem176#1.offset, main_#t~mem177#1.base, main_#t~mem177#1.offset, main_#t~mem178#1.base, main_#t~mem178#1.offset, main_#t~mem179#1.base, main_#t~mem179#1.offset, main_#t~mem180#1.base, main_#t~mem180#1.offset, main_#t~mem181#1, main_#t~mem182#1, main_#t~mem183#1, main_#t~short184#1, main_#t~mem185#1.base, main_#t~mem185#1.offset, main_#t~ret186#1, main_#t~mem187#1.base, main_#t~mem187#1.offset, main_#t~mem188#1.base, main_#t~mem188#1.offset, main_#t~mem189#1.base, main_#t~mem189#1.offset, main_#t~mem190#1, main_~_hf_bkt~0#1, main_~_hf_hashv~0#1, main_#t~mem191#1.base, main_#t~mem191#1.offset, main_#t~mem192#1.base, main_#t~mem192#1.offset, main_#t~short193#1, main_#t~mem194#1.base, main_#t~mem194#1.offset, main_#t~mem195#1.base, main_#t~mem195#1.offset, main_#t~mem196#1.base, main_#t~mem196#1.offset, main_#t~mem197#1.base, main_#t~mem197#1.offset, main_#t~mem198#1.base, main_#t~mem198#1.offset, main_#t~mem199#1.base, main_#t~mem199#1.offset, main_#t~mem200#1.base, main_#t~mem200#1.offset, main_#t~mem201#1.base, main_#t~mem201#1.offset, main_#t~mem202#1, main_#t~mem203#1.base, main_#t~mem203#1.offset, main_#t~mem204#1.base, main_#t~mem204#1.offset, main_#t~mem205#1.base, main_#t~mem205#1.offset, main_#t~mem206#1, main_#t~mem207#1.base, main_#t~mem207#1.offset, main_#t~mem208#1.base, main_#t~mem208#1.offset, main_#t~mem209#1.base, main_#t~mem209#1.offset, main_#t~mem210#1.base, main_#t~mem210#1.offset, main_#t~mem211#1.base, main_#t~mem211#1.offset, main_#t~mem212#1, main_#t~mem213#1.base, main_#t~mem213#1.offset, main_#t~mem216#1, main_#t~mem214#1.base, main_#t~mem214#1.offset, main_#t~mem215#1, main_#t~mem217#1.base, main_#t~mem217#1.offset, main_#t~mem218#1.base, main_#t~mem218#1.offset, main_#t~mem219#1, main_#t~post220#1, main_#t~mem221#1.base, main_#t~mem221#1.offset, main_#t~mem222#1.base, main_#t~mem222#1.offset, main_#t~mem223#1.base, main_#t~mem223#1.offset, main_#t~mem224#1.base, main_#t~mem224#1.offset, main_#t~mem225#1.base, main_#t~mem225#1.offset, main_#t~mem226#1.base, main_#t~mem226#1.offset, main_#t~mem227#1.base, main_#t~mem227#1.offset, main_#t~mem228#1.base, main_#t~mem228#1.offset, main_~_hd_head~0#1.base, main_~_hd_head~0#1.offset, main_#t~mem229#1.base, main_#t~mem229#1.offset, main_#t~mem230#1, main_#t~post231#1, main_~_hd_bkt~0#1, main_~_hd_hh_del~0#1.base, main_~_hd_hh_del~0#1.offset, main_#t~mem232#1.base, main_#t~mem232#1.offset, main_#t~mem233#1, main_#t~mem146#1, main_#t~mem147#1, main_#t~ite235#1.base, main_#t~ite235#1.offset, main_#t~mem234#1.base, main_#t~mem234#1.offset, main_#t~mem238#1.base, main_#t~mem238#1.offset, main_#t~mem239#1.base, main_#t~mem239#1.offset, main_#t~short240#1, main_#t~mem241#1.base, main_#t~mem241#1.offset, main_#t~mem242#1.base, main_#t~mem242#1.offset, main_#t~mem243#1.base, main_#t~mem243#1.offset, main_#t~mem244#1.base, main_#t~mem244#1.offset, main_#t~mem245#1.base, main_#t~mem245#1.offset, main_#t~mem246#1.base, main_#t~mem246#1.offset, main_#t~mem247#1.base, main_#t~mem247#1.offset, main_#t~mem248#1.base, main_#t~mem248#1.offset, main_#t~mem249#1, main_#t~mem250#1.base, main_#t~mem250#1.offset, main_#t~mem251#1.base, main_#t~mem251#1.offset, main_#t~mem252#1.base, main_#t~mem252#1.offset, main_#t~mem253#1, main_#t~mem254#1.base, main_#t~mem254#1.offset, main_#t~mem255#1.base, main_#t~mem255#1.offset, main_#t~mem256#1.base, main_#t~mem256#1.offset, main_#t~mem257#1.base, main_#t~mem257#1.offset, main_#t~mem258#1.base, main_#t~mem258#1.offset, main_#t~mem259#1, main_#t~mem260#1.base, main_#t~mem260#1.offset, main_#t~mem263#1, main_#t~mem261#1.base, main_#t~mem261#1.offset, main_#t~mem262#1, main_#t~mem264#1.base, main_#t~mem264#1.offset, main_#t~mem265#1.base, main_#t~mem265#1.offset, main_#t~mem266#1, main_#t~post267#1, main_#t~mem268#1.base, main_#t~mem268#1.offset, main_#t~mem269#1.base, main_#t~mem269#1.offset, main_#t~mem270#1.base, main_#t~mem270#1.offset, main_#t~mem271#1.base, main_#t~mem271#1.offset, main_#t~mem272#1.base, main_#t~mem272#1.offset, main_#t~mem273#1.base, main_#t~mem273#1.offset, main_#t~mem274#1.base, main_#t~mem274#1.offset, main_#t~mem275#1.base, main_#t~mem275#1.offset, main_~_hd_head~1#1.base, main_~_hd_head~1#1.offset, main_#t~mem276#1.base, main_#t~mem276#1.offset, main_#t~mem277#1, main_#t~post278#1, main_~_hd_bkt~1#1, main_~_hd_hh_del~1#1.base, main_~_hd_hh_del~1#1.offset, main_#t~ite237#1.base, main_#t~ite237#1.offset, main_#t~mem236#1.base, main_#t~mem236#1.offset, main_~#i~0#1.base, main_~#i~0#1.offset, main_~user~0#1.base, main_~user~0#1.offset, main_~tmp~0#1.base, main_~tmp~0#1.offset, main_~users~0#1.base, main_~users~0#1.offset, main_~temp~0#1.base, main_~temp~0#1.offset;call main_~#i~0#1.base, main_~#i~0#1.offset := #Ultimate.allocOnStack(4);havoc main_~user~0#1.base, main_~user~0#1.offset;havoc main_~tmp~0#1.base, main_~tmp~0#1.offset;main_~users~0#1.base, main_~users~0#1.offset := 0, 0;call write~int(0, main_~#i~0#1.base, main_~#i~0#1.offset, 4); {258#true} is VALID [2022-02-20 23:32:58,579 INFO L290 TraceCheckUtils]: 2: Hoare triple {258#true} assume !true; {259#false} is VALID [2022-02-20 23:32:58,579 INFO L290 TraceCheckUtils]: 3: Hoare triple {259#false} call write~int(0, main_~#i~0#1.base, main_~#i~0#1.offset, 4); {259#false} is VALID [2022-02-20 23:32:58,580 INFO L290 TraceCheckUtils]: 4: Hoare triple {259#false} call main_#t~mem147#1 := read~int(main_~#i~0#1.base, main_~#i~0#1.offset, 4); {259#false} is VALID [2022-02-20 23:32:58,580 INFO L290 TraceCheckUtils]: 5: Hoare triple {259#false} assume !!(main_#t~mem147#1 < 10);havoc main_#t~mem147#1; {259#false} is VALID [2022-02-20 23:32:58,580 INFO L290 TraceCheckUtils]: 6: Hoare triple {259#false} assume !true; {259#false} is VALID [2022-02-20 23:32:58,580 INFO L290 TraceCheckUtils]: 7: Hoare triple {259#false} assume !(main_~tmp~0#1.base != 0 || main_~tmp~0#1.offset != 0); {259#false} is VALID [2022-02-20 23:32:58,580 INFO L290 TraceCheckUtils]: 8: Hoare triple {259#false} assume !false; {259#false} is VALID [2022-02-20 23:32:58,581 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-20 23:32:58,582 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 23:32:58,582 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1606739333] [2022-02-20 23:32:58,582 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1606739333] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:32:58,582 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:32:58,583 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-02-20 23:32:58,584 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [925691865] [2022-02-20 23:32:58,584 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:32:58,587 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 4.5) internal successors, (9), 2 states have internal predecessors, (9), 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 9 [2022-02-20 23:32:58,588 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:32:58,590 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 2 states, 2 states have (on average 4.5) internal successors, (9), 2 states have internal predecessors, (9), 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-20 23:32:58,599 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 9 edges. 9 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:32:58,599 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-02-20 23:32:58,599 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 23:32:58,613 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-02-20 23:32:58,613 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-02-20 23:32:58,616 INFO L87 Difference]: Start difference. First operand has 255 states, 229 states have (on average 1.6943231441048034) internal successors, (388), 246 states have internal predecessors, (388), 20 states have call successors, (20), 3 states have call predecessors, (20), 3 states have return successors, (20), 6 states have call predecessors, (20), 20 states have call successors, (20) Second operand has 2 states, 2 states have (on average 4.5) internal successors, (9), 2 states have internal predecessors, (9), 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-20 23:32:59,105 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:32:59,105 INFO L93 Difference]: Finished difference Result 508 states and 871 transitions. [2022-02-20 23:32:59,106 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-02-20 23:32:59,106 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 4.5) internal successors, (9), 2 states have internal predecessors, (9), 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 9 [2022-02-20 23:32:59,106 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:32:59,107 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2 states, 2 states have (on average 4.5) internal successors, (9), 2 states have internal predecessors, (9), 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-20 23:32:59,121 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 871 transitions. [2022-02-20 23:32:59,121 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2 states, 2 states have (on average 4.5) internal successors, (9), 2 states have internal predecessors, (9), 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-20 23:32:59,131 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 871 transitions. [2022-02-20 23:32:59,131 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states and 871 transitions. [2022-02-20 23:32:59,696 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 871 edges. 871 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:32:59,713 INFO L225 Difference]: With dead ends: 508 [2022-02-20 23:32:59,713 INFO L226 Difference]: Without dead ends: 222 [2022-02-20 23:32:59,717 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-02-20 23:32:59,719 INFO L933 BasicCegarLoop]: 351 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 351 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 23:32:59,720 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 351 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 23:32:59,731 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 222 states. [2022-02-20 23:32:59,747 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 222 to 222. [2022-02-20 23:32:59,747 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:32:59,748 INFO L82 GeneralOperation]: Start isEquivalent. First operand 222 states. Second operand has 222 states, 197 states have (on average 1.3553299492385786) internal successors, (267), 213 states have internal predecessors, (267), 20 states have call successors, (20), 3 states have call predecessors, (20), 3 states have return successors, (20), 6 states have call predecessors, (20), 20 states have call successors, (20) [2022-02-20 23:32:59,749 INFO L74 IsIncluded]: Start isIncluded. First operand 222 states. Second operand has 222 states, 197 states have (on average 1.3553299492385786) internal successors, (267), 213 states have internal predecessors, (267), 20 states have call successors, (20), 3 states have call predecessors, (20), 3 states have return successors, (20), 6 states have call predecessors, (20), 20 states have call successors, (20) [2022-02-20 23:32:59,750 INFO L87 Difference]: Start difference. First operand 222 states. Second operand has 222 states, 197 states have (on average 1.3553299492385786) internal successors, (267), 213 states have internal predecessors, (267), 20 states have call successors, (20), 3 states have call predecessors, (20), 3 states have return successors, (20), 6 states have call predecessors, (20), 20 states have call successors, (20) [2022-02-20 23:32:59,799 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:32:59,799 INFO L93 Difference]: Finished difference Result 222 states and 307 transitions. [2022-02-20 23:32:59,799 INFO L276 IsEmpty]: Start isEmpty. Operand 222 states and 307 transitions. [2022-02-20 23:32:59,801 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:32:59,801 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:32:59,802 INFO L74 IsIncluded]: Start isIncluded. First operand has 222 states, 197 states have (on average 1.3553299492385786) internal successors, (267), 213 states have internal predecessors, (267), 20 states have call successors, (20), 3 states have call predecessors, (20), 3 states have return successors, (20), 6 states have call predecessors, (20), 20 states have call successors, (20) Second operand 222 states. [2022-02-20 23:32:59,803 INFO L87 Difference]: Start difference. First operand has 222 states, 197 states have (on average 1.3553299492385786) internal successors, (267), 213 states have internal predecessors, (267), 20 states have call successors, (20), 3 states have call predecessors, (20), 3 states have return successors, (20), 6 states have call predecessors, (20), 20 states have call successors, (20) Second operand 222 states. [2022-02-20 23:32:59,809 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:32:59,810 INFO L93 Difference]: Finished difference Result 222 states and 307 transitions. [2022-02-20 23:32:59,810 INFO L276 IsEmpty]: Start isEmpty. Operand 222 states and 307 transitions. [2022-02-20 23:32:59,811 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:32:59,811 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:32:59,811 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:32:59,812 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:32:59,812 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 222 states, 197 states have (on average 1.3553299492385786) internal successors, (267), 213 states have internal predecessors, (267), 20 states have call successors, (20), 3 states have call predecessors, (20), 3 states have return successors, (20), 6 states have call predecessors, (20), 20 states have call successors, (20) [2022-02-20 23:32:59,818 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 222 states to 222 states and 307 transitions. [2022-02-20 23:32:59,819 INFO L78 Accepts]: Start accepts. Automaton has 222 states and 307 transitions. Word has length 9 [2022-02-20 23:32:59,820 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:32:59,820 INFO L470 AbstractCegarLoop]: Abstraction has 222 states and 307 transitions. [2022-02-20 23:32:59,820 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 4.5) internal successors, (9), 2 states have internal predecessors, (9), 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-20 23:32:59,820 INFO L276 IsEmpty]: Start isEmpty. Operand 222 states and 307 transitions. [2022-02-20 23:32:59,821 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2022-02-20 23:32:59,821 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:32:59,821 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] [2022-02-20 23:32:59,822 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-02-20 23:32:59,822 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 23:32:59,823 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:32:59,823 INFO L85 PathProgramCache]: Analyzing trace with hash 1790395171, now seen corresponding path program 1 times [2022-02-20 23:32:59,823 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 23:32:59,823 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1595417219] [2022-02-20 23:32:59,823 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:32:59,823 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 23:32:59,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:32:59,884 INFO L290 TraceCheckUtils]: 0: Hoare triple {1600#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~0 := 0; {1600#true} is VALID [2022-02-20 23:32:59,885 INFO L290 TraceCheckUtils]: 1: Hoare triple {1600#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc8#1.base, main_#t~malloc8#1.offset, main_#t~mem9#1, main_#t~mem10#1, main_#t~mem11#1, main_#t~mem13#1, main_#t~mem12#1, main_#t~mem14#1, main_#t~mem15#1, main_#t~mem17#1, main_#t~mem16#1, main_#t~mem18#1, main_#t~mem19#1, main_#t~mem21#1, main_#t~mem20#1, main_#t~mem22#1, main_#t~mem23#1, main_#t~switch24#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_#t~mem31#1, main_#t~mem32#1, main_#t~mem33#1, main_#t~mem34#1, main_#t~mem35#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~malloc36#1.base, main_#t~malloc36#1.offset, main_#t~mem37#1.base, main_#t~mem37#1.offset, main_#t~mem38#1.base, main_#t~mem38#1.offset, main_#t~memset~res39#1.base, main_#t~memset~res39#1.offset, main_#t~mem40#1.base, main_#t~mem40#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~malloc45#1.base, main_#t~malloc45#1.offset, main_#t~mem46#1.base, main_#t~mem46#1.offset, main_#t~mem47#1.base, main_#t~mem47#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~memset~res52#1.base, main_#t~memset~res52#1.offset, 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~mem58#1.base, main_#t~mem58#1.offset, main_#t~mem59#1.base, main_#t~mem59#1.offset, main_#t~mem60#1.base, main_#t~mem60#1.offset, main_#t~mem61#1.base, main_#t~mem61#1.offset, main_#t~mem62#1, main_#t~post63#1, main_#t~mem64#1.base, main_#t~mem64#1.offset, main_#t~mem65#1, main_#t~mem66#1.base, main_#t~mem66#1.offset, main_#t~mem67#1.base, main_#t~mem67#1.offset, main_#t~mem68#1, main_#t~post69#1, main_#t~mem70#1.base, main_#t~mem70#1.offset, main_#t~mem71#1.base, main_#t~mem71#1.offset, main_#t~mem72#1.base, main_#t~mem72#1.offset, main_#t~mem74#1, main_#t~mem73#1, main_#t~mem75#1.base, main_#t~mem75#1.offset, main_#t~mem76#1, main_#t~short77#1, main_#t~mem78#1.base, main_#t~mem78#1.offset, main_#t~mem79#1, main_#t~malloc80#1.base, main_#t~malloc80#1.offset, main_#t~mem81#1.base, main_#t~mem81#1.offset, main_#t~mem82#1.base, main_#t~mem82#1.offset, main_#t~mem83#1.base, main_#t~mem83#1.offset, main_#t~mem84#1, main_#t~memset~res85#1.base, main_#t~memset~res85#1.offset, main_#t~mem86#1.base, main_#t~mem86#1.offset, main_#t~mem87#1.base, main_#t~mem87#1.offset, main_#t~mem90#1, main_#t~mem88#1.base, main_#t~mem88#1.offset, main_#t~mem89#1, main_#t~mem91#1.base, main_#t~mem91#1.offset, main_#t~mem94#1, main_#t~mem92#1.base, main_#t~mem92#1.offset, main_#t~mem93#1, main_#t~ite95#1, main_#t~mem96#1.base, main_#t~mem96#1.offset, main_#t~mem100#1.base, main_#t~mem100#1.offset, main_#t~mem101#1.base, main_#t~mem101#1.offset, main_#t~mem102#1.base, main_#t~mem102#1.offset, main_#t~mem103#1.base, main_#t~mem103#1.offset, main_#t~mem106#1, main_#t~mem104#1.base, main_#t~mem104#1.offset, main_#t~mem105#1, main_#t~mem107#1.base, main_#t~mem107#1.offset, main_#t~mem108#1, main_#t~pre109#1, main_#t~mem110#1.base, main_#t~mem110#1.offset, main_#t~mem111#1, main_#t~mem112#1.base, main_#t~mem112#1.offset, main_#t~mem113#1, main_#t~post114#1, main_#t~mem118#1, main_#t~mem116#1, main_#t~mem115#1.base, main_#t~mem115#1.offset, main_#t~mem117#1, main_#t~mem119#1, main_#t~post120#1, main_#t~mem121#1.base, main_#t~mem121#1.offset, main_#t~mem122#1.base, main_#t~mem122#1.offset, main_#t~mem123#1.base, main_#t~mem123#1.offset, main_#t~post97#1, main_#t~mem98#1.base, main_#t~mem98#1.offset, main_#t~mem99#1, main_#t~mem124#1.base, main_#t~mem124#1.offset, main_#t~mem125#1.base, main_#t~mem125#1.offset, main_#t~mem126#1.base, main_#t~mem126#1.offset, main_#t~mem127#1, main_#t~mem128#1.base, main_#t~mem128#1.offset, main_#t~mem129#1, main_#t~post130#1, main_#t~mem131#1.base, main_#t~mem131#1.offset, main_#t~mem132#1.base, main_#t~mem132#1.offset, main_#t~mem133#1.base, main_#t~mem133#1.offset, main_#t~mem134#1.base, main_#t~mem134#1.offset, main_#t~mem137#1, main_#t~mem135#1.base, main_#t~mem135#1.offset, main_#t~mem136#1, main_#t~ite140#1, main_#t~mem138#1.base, main_#t~mem138#1.offset, main_#t~mem139#1, main_#t~mem141#1.base, main_#t~mem141#1.offset, main_#t~mem142#1, main_#t~mem143#1.base, main_#t~mem143#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~mem144#1.base, main_#t~mem144#1.offset, main_#t~mem145#1, main_#t~mem5#1, main_#t~post6#1, main_#t~mem7#1, main_#t~mem149#1, main_#t~mem148#1, main_#t~mem150#1, main_#t~mem151#1, main_#t~mem153#1, main_#t~mem152#1, main_#t~mem154#1, main_#t~mem155#1, main_#t~mem157#1, main_#t~mem156#1, main_#t~mem158#1, main_#t~mem159#1, main_#t~switch160#1, main_#t~mem161#1, main_#t~mem162#1, main_#t~mem163#1, main_#t~mem164#1, main_#t~mem165#1, main_#t~mem166#1, main_#t~mem167#1, main_#t~mem168#1, main_#t~mem169#1, main_#t~mem170#1, main_#t~mem171#1, main_~_hj_i~1#1, main_~_hj_j~1#1, main_~_hj_k~1#1, main_~_hj_key~1#1.base, main_~_hj_key~1#1.offset, main_#t~mem172#1.base, main_#t~mem172#1.offset, main_#t~mem173#1, main_#t~mem174#1.base, main_#t~mem174#1.offset, main_#t~mem175#1.base, main_#t~mem175#1.offset, main_#t~mem176#1.base, main_#t~mem176#1.offset, main_#t~mem177#1.base, main_#t~mem177#1.offset, main_#t~mem178#1.base, main_#t~mem178#1.offset, main_#t~mem179#1.base, main_#t~mem179#1.offset, main_#t~mem180#1.base, main_#t~mem180#1.offset, main_#t~mem181#1, main_#t~mem182#1, main_#t~mem183#1, main_#t~short184#1, main_#t~mem185#1.base, main_#t~mem185#1.offset, main_#t~ret186#1, main_#t~mem187#1.base, main_#t~mem187#1.offset, main_#t~mem188#1.base, main_#t~mem188#1.offset, main_#t~mem189#1.base, main_#t~mem189#1.offset, main_#t~mem190#1, main_~_hf_bkt~0#1, main_~_hf_hashv~0#1, main_#t~mem191#1.base, main_#t~mem191#1.offset, main_#t~mem192#1.base, main_#t~mem192#1.offset, main_#t~short193#1, main_#t~mem194#1.base, main_#t~mem194#1.offset, main_#t~mem195#1.base, main_#t~mem195#1.offset, main_#t~mem196#1.base, main_#t~mem196#1.offset, main_#t~mem197#1.base, main_#t~mem197#1.offset, main_#t~mem198#1.base, main_#t~mem198#1.offset, main_#t~mem199#1.base, main_#t~mem199#1.offset, main_#t~mem200#1.base, main_#t~mem200#1.offset, main_#t~mem201#1.base, main_#t~mem201#1.offset, main_#t~mem202#1, main_#t~mem203#1.base, main_#t~mem203#1.offset, main_#t~mem204#1.base, main_#t~mem204#1.offset, main_#t~mem205#1.base, main_#t~mem205#1.offset, main_#t~mem206#1, main_#t~mem207#1.base, main_#t~mem207#1.offset, main_#t~mem208#1.base, main_#t~mem208#1.offset, main_#t~mem209#1.base, main_#t~mem209#1.offset, main_#t~mem210#1.base, main_#t~mem210#1.offset, main_#t~mem211#1.base, main_#t~mem211#1.offset, main_#t~mem212#1, main_#t~mem213#1.base, main_#t~mem213#1.offset, main_#t~mem216#1, main_#t~mem214#1.base, main_#t~mem214#1.offset, main_#t~mem215#1, main_#t~mem217#1.base, main_#t~mem217#1.offset, main_#t~mem218#1.base, main_#t~mem218#1.offset, main_#t~mem219#1, main_#t~post220#1, main_#t~mem221#1.base, main_#t~mem221#1.offset, main_#t~mem222#1.base, main_#t~mem222#1.offset, main_#t~mem223#1.base, main_#t~mem223#1.offset, main_#t~mem224#1.base, main_#t~mem224#1.offset, main_#t~mem225#1.base, main_#t~mem225#1.offset, main_#t~mem226#1.base, main_#t~mem226#1.offset, main_#t~mem227#1.base, main_#t~mem227#1.offset, main_#t~mem228#1.base, main_#t~mem228#1.offset, main_~_hd_head~0#1.base, main_~_hd_head~0#1.offset, main_#t~mem229#1.base, main_#t~mem229#1.offset, main_#t~mem230#1, main_#t~post231#1, main_~_hd_bkt~0#1, main_~_hd_hh_del~0#1.base, main_~_hd_hh_del~0#1.offset, main_#t~mem232#1.base, main_#t~mem232#1.offset, main_#t~mem233#1, main_#t~mem146#1, main_#t~mem147#1, main_#t~ite235#1.base, main_#t~ite235#1.offset, main_#t~mem234#1.base, main_#t~mem234#1.offset, main_#t~mem238#1.base, main_#t~mem238#1.offset, main_#t~mem239#1.base, main_#t~mem239#1.offset, main_#t~short240#1, main_#t~mem241#1.base, main_#t~mem241#1.offset, main_#t~mem242#1.base, main_#t~mem242#1.offset, main_#t~mem243#1.base, main_#t~mem243#1.offset, main_#t~mem244#1.base, main_#t~mem244#1.offset, main_#t~mem245#1.base, main_#t~mem245#1.offset, main_#t~mem246#1.base, main_#t~mem246#1.offset, main_#t~mem247#1.base, main_#t~mem247#1.offset, main_#t~mem248#1.base, main_#t~mem248#1.offset, main_#t~mem249#1, main_#t~mem250#1.base, main_#t~mem250#1.offset, main_#t~mem251#1.base, main_#t~mem251#1.offset, main_#t~mem252#1.base, main_#t~mem252#1.offset, main_#t~mem253#1, main_#t~mem254#1.base, main_#t~mem254#1.offset, main_#t~mem255#1.base, main_#t~mem255#1.offset, main_#t~mem256#1.base, main_#t~mem256#1.offset, main_#t~mem257#1.base, main_#t~mem257#1.offset, main_#t~mem258#1.base, main_#t~mem258#1.offset, main_#t~mem259#1, main_#t~mem260#1.base, main_#t~mem260#1.offset, main_#t~mem263#1, main_#t~mem261#1.base, main_#t~mem261#1.offset, main_#t~mem262#1, main_#t~mem264#1.base, main_#t~mem264#1.offset, main_#t~mem265#1.base, main_#t~mem265#1.offset, main_#t~mem266#1, main_#t~post267#1, main_#t~mem268#1.base, main_#t~mem268#1.offset, main_#t~mem269#1.base, main_#t~mem269#1.offset, main_#t~mem270#1.base, main_#t~mem270#1.offset, main_#t~mem271#1.base, main_#t~mem271#1.offset, main_#t~mem272#1.base, main_#t~mem272#1.offset, main_#t~mem273#1.base, main_#t~mem273#1.offset, main_#t~mem274#1.base, main_#t~mem274#1.offset, main_#t~mem275#1.base, main_#t~mem275#1.offset, main_~_hd_head~1#1.base, main_~_hd_head~1#1.offset, main_#t~mem276#1.base, main_#t~mem276#1.offset, main_#t~mem277#1, main_#t~post278#1, main_~_hd_bkt~1#1, main_~_hd_hh_del~1#1.base, main_~_hd_hh_del~1#1.offset, main_#t~ite237#1.base, main_#t~ite237#1.offset, main_#t~mem236#1.base, main_#t~mem236#1.offset, main_~#i~0#1.base, main_~#i~0#1.offset, main_~user~0#1.base, main_~user~0#1.offset, main_~tmp~0#1.base, main_~tmp~0#1.offset, main_~users~0#1.base, main_~users~0#1.offset, main_~temp~0#1.base, main_~temp~0#1.offset;call main_~#i~0#1.base, main_~#i~0#1.offset := #Ultimate.allocOnStack(4);havoc main_~user~0#1.base, main_~user~0#1.offset;havoc main_~tmp~0#1.base, main_~tmp~0#1.offset;main_~users~0#1.base, main_~users~0#1.offset := 0, 0;call write~int(0, main_~#i~0#1.base, main_~#i~0#1.offset, 4); {1602#(= (select (select |#memory_int| |ULTIMATE.start_main_~#i~0#1.base|) |ULTIMATE.start_main_~#i~0#1.offset|) 0)} is VALID [2022-02-20 23:32:59,886 INFO L290 TraceCheckUtils]: 2: Hoare triple {1602#(= (select (select |#memory_int| |ULTIMATE.start_main_~#i~0#1.base|) |ULTIMATE.start_main_~#i~0#1.offset|) 0)} call main_#t~mem7#1 := read~int(main_~#i~0#1.base, main_~#i~0#1.offset, 4); {1603#(= |ULTIMATE.start_main_#t~mem7#1| 0)} is VALID [2022-02-20 23:32:59,886 INFO L290 TraceCheckUtils]: 3: Hoare triple {1603#(= |ULTIMATE.start_main_#t~mem7#1| 0)} assume !(main_#t~mem7#1 < 10);havoc main_#t~mem7#1; {1601#false} is VALID [2022-02-20 23:32:59,886 INFO L290 TraceCheckUtils]: 4: Hoare triple {1601#false} call write~int(0, main_~#i~0#1.base, main_~#i~0#1.offset, 4); {1601#false} is VALID [2022-02-20 23:32:59,886 INFO L290 TraceCheckUtils]: 5: Hoare triple {1601#false} call main_#t~mem147#1 := read~int(main_~#i~0#1.base, main_~#i~0#1.offset, 4); {1601#false} is VALID [2022-02-20 23:32:59,887 INFO L290 TraceCheckUtils]: 6: Hoare triple {1601#false} assume !!(main_#t~mem147#1 < 10);havoc main_#t~mem147#1; {1601#false} is VALID [2022-02-20 23:32:59,887 INFO L290 TraceCheckUtils]: 7: Hoare triple {1601#false} havoc main_~_hf_hashv~0#1; {1601#false} is VALID [2022-02-20 23:32:59,887 INFO L290 TraceCheckUtils]: 8: Hoare triple {1601#false} goto; {1601#false} is VALID [2022-02-20 23:32:59,887 INFO L290 TraceCheckUtils]: 9: Hoare triple {1601#false} havoc main_~_hj_i~1#1;havoc main_~_hj_j~1#1;havoc main_~_hj_k~1#1;main_~_hj_key~1#1.base, main_~_hj_key~1#1.offset := main_~#i~0#1.base, main_~#i~0#1.offset;main_~_hf_hashv~0#1 := 4276993775;main_~_hj_j~1#1 := 2654435769;main_~_hj_i~1#1 := main_~_hj_j~1#1;main_~_hj_k~1#1 := 4; {1601#false} is VALID [2022-02-20 23:32:59,887 INFO L290 TraceCheckUtils]: 10: Hoare triple {1601#false} assume !(main_~_hj_k~1#1 % 4294967296 >= 12); {1601#false} is VALID [2022-02-20 23:32:59,888 INFO L290 TraceCheckUtils]: 11: Hoare triple {1601#false} main_~_hf_hashv~0#1 := 4 + main_~_hf_hashv~0#1;main_#t~switch160#1 := 11 == main_~_hj_k~1#1; {1601#false} is VALID [2022-02-20 23:32:59,888 INFO L290 TraceCheckUtils]: 12: Hoare triple {1601#false} assume main_#t~switch160#1;call main_#t~mem161#1 := read~int(main_~_hj_key~1#1.base, 10 + main_~_hj_key~1#1.offset, 1);main_~_hf_hashv~0#1 := main_~_hf_hashv~0#1 + 16777216 * (main_#t~mem161#1 % 256);havoc main_#t~mem161#1; {1601#false} is VALID [2022-02-20 23:32:59,888 INFO L290 TraceCheckUtils]: 13: Hoare triple {1601#false} main_#t~switch160#1 := main_#t~switch160#1 || 10 == main_~_hj_k~1#1; {1601#false} is VALID [2022-02-20 23:32:59,888 INFO L290 TraceCheckUtils]: 14: Hoare triple {1601#false} assume main_#t~switch160#1;call main_#t~mem162#1 := read~int(main_~_hj_key~1#1.base, 9 + main_~_hj_key~1#1.offset, 1);main_~_hf_hashv~0#1 := main_~_hf_hashv~0#1 + 65536 * (main_#t~mem162#1 % 256);havoc main_#t~mem162#1; {1601#false} is VALID [2022-02-20 23:32:59,888 INFO L290 TraceCheckUtils]: 15: Hoare triple {1601#false} main_#t~switch160#1 := main_#t~switch160#1 || 9 == main_~_hj_k~1#1; {1601#false} is VALID [2022-02-20 23:32:59,889 INFO L290 TraceCheckUtils]: 16: Hoare triple {1601#false} assume !main_#t~switch160#1; {1601#false} is VALID [2022-02-20 23:32:59,889 INFO L290 TraceCheckUtils]: 17: Hoare triple {1601#false} main_#t~switch160#1 := main_#t~switch160#1 || 8 == main_~_hj_k~1#1; {1601#false} is VALID [2022-02-20 23:32:59,889 INFO L290 TraceCheckUtils]: 18: Hoare triple {1601#false} assume main_#t~switch160#1;call main_#t~mem164#1 := read~int(main_~_hj_key~1#1.base, 7 + main_~_hj_key~1#1.offset, 1);main_~_hj_j~1#1 := main_~_hj_j~1#1 + 16777216 * (main_#t~mem164#1 % 256);havoc main_#t~mem164#1; {1601#false} is VALID [2022-02-20 23:32:59,889 INFO L290 TraceCheckUtils]: 19: Hoare triple {1601#false} main_#t~switch160#1 := main_#t~switch160#1 || 7 == main_~_hj_k~1#1; {1601#false} is VALID [2022-02-20 23:32:59,889 INFO L290 TraceCheckUtils]: 20: Hoare triple {1601#false} assume main_#t~switch160#1;call main_#t~mem165#1 := read~int(main_~_hj_key~1#1.base, 6 + main_~_hj_key~1#1.offset, 1);main_~_hj_j~1#1 := main_~_hj_j~1#1 + 65536 * (main_#t~mem165#1 % 256);havoc main_#t~mem165#1; {1601#false} is VALID [2022-02-20 23:32:59,889 INFO L290 TraceCheckUtils]: 21: Hoare triple {1601#false} main_#t~switch160#1 := main_#t~switch160#1 || 6 == main_~_hj_k~1#1; {1601#false} is VALID [2022-02-20 23:32:59,890 INFO L290 TraceCheckUtils]: 22: Hoare triple {1601#false} assume main_#t~switch160#1;call main_#t~mem166#1 := read~int(main_~_hj_key~1#1.base, 5 + main_~_hj_key~1#1.offset, 1);main_~_hj_j~1#1 := main_~_hj_j~1#1 + 256 * (main_#t~mem166#1 % 256);havoc main_#t~mem166#1; {1601#false} is VALID [2022-02-20 23:32:59,890 INFO L290 TraceCheckUtils]: 23: Hoare triple {1601#false} main_#t~switch160#1 := main_#t~switch160#1 || 5 == main_~_hj_k~1#1; {1601#false} is VALID [2022-02-20 23:32:59,890 INFO L290 TraceCheckUtils]: 24: Hoare triple {1601#false} assume main_#t~switch160#1;call main_#t~mem167#1 := read~int(main_~_hj_key~1#1.base, 4 + main_~_hj_key~1#1.offset, 1);main_~_hj_j~1#1 := main_~_hj_j~1#1 + main_#t~mem167#1 % 256;havoc main_#t~mem167#1; {1601#false} is VALID [2022-02-20 23:32:59,890 INFO L290 TraceCheckUtils]: 25: Hoare triple {1601#false} main_#t~switch160#1 := main_#t~switch160#1 || 4 == main_~_hj_k~1#1; {1601#false} is VALID [2022-02-20 23:32:59,890 INFO L290 TraceCheckUtils]: 26: Hoare triple {1601#false} assume main_#t~switch160#1;call main_#t~mem168#1 := read~int(main_~_hj_key~1#1.base, 3 + main_~_hj_key~1#1.offset, 1);main_~_hj_i~1#1 := main_~_hj_i~1#1 + 16777216 * (main_#t~mem168#1 % 256);havoc main_#t~mem168#1; {1601#false} is VALID [2022-02-20 23:32:59,891 INFO L290 TraceCheckUtils]: 27: Hoare triple {1601#false} main_#t~switch160#1 := main_#t~switch160#1 || 3 == main_~_hj_k~1#1; {1601#false} is VALID [2022-02-20 23:32:59,891 INFO L290 TraceCheckUtils]: 28: Hoare triple {1601#false} assume main_#t~switch160#1;call main_#t~mem169#1 := read~int(main_~_hj_key~1#1.base, 2 + main_~_hj_key~1#1.offset, 1);main_~_hj_i~1#1 := main_~_hj_i~1#1 + 65536 * (main_#t~mem169#1 % 256);havoc main_#t~mem169#1; {1601#false} is VALID [2022-02-20 23:32:59,891 INFO L290 TraceCheckUtils]: 29: Hoare triple {1601#false} main_#t~switch160#1 := main_#t~switch160#1 || 2 == main_~_hj_k~1#1; {1601#false} is VALID [2022-02-20 23:32:59,891 INFO L290 TraceCheckUtils]: 30: Hoare triple {1601#false} assume main_#t~switch160#1;call main_#t~mem170#1 := read~int(main_~_hj_key~1#1.base, 1 + main_~_hj_key~1#1.offset, 1);main_~_hj_i~1#1 := main_~_hj_i~1#1 + 256 * (main_#t~mem170#1 % 256);havoc main_#t~mem170#1; {1601#false} is VALID [2022-02-20 23:32:59,891 INFO L290 TraceCheckUtils]: 31: Hoare triple {1601#false} main_#t~switch160#1 := main_#t~switch160#1 || 1 == main_~_hj_k~1#1; {1601#false} is VALID [2022-02-20 23:32:59,892 INFO L290 TraceCheckUtils]: 32: Hoare triple {1601#false} assume main_#t~switch160#1;call main_#t~mem171#1 := read~int(main_~_hj_key~1#1.base, main_~_hj_key~1#1.offset, 1);main_~_hj_i~1#1 := main_~_hj_i~1#1 + main_#t~mem171#1 % 256;havoc main_#t~mem171#1; {1601#false} is VALID [2022-02-20 23:32:59,892 INFO L290 TraceCheckUtils]: 33: Hoare triple {1601#false} havoc main_#t~switch160#1; {1601#false} is VALID [2022-02-20 23:32:59,892 INFO L290 TraceCheckUtils]: 34: Hoare triple {1601#false} main_~_hj_i~1#1 := main_~_hj_i~1#1 - main_~_hj_j~1#1;main_~_hj_i~1#1 := main_~_hj_i~1#1 - main_~_hf_hashv~0#1;main_~_hj_i~1#1 := (if (1 == main_~_hj_i~1#1 || 0 == main_~_hj_i~1#1) && (1 == main_~_hf_hashv~0#1 / 8192 || 0 == main_~_hf_hashv~0#1 / 8192) then (if main_~_hj_i~1#1 == main_~_hf_hashv~0#1 / 8192 then 0 else 1) else (if 0 == main_~_hj_i~1#1 then main_~_hf_hashv~0#1 / 8192 else (if 0 == main_~_hf_hashv~0#1 / 8192 then main_~_hj_i~1#1 else ~bitwiseXOr(main_~_hj_i~1#1, main_~_hf_hashv~0#1 / 8192))));main_~_hj_j~1#1 := main_~_hj_j~1#1 - main_~_hf_hashv~0#1;main_~_hj_j~1#1 := main_~_hj_j~1#1 - main_~_hj_i~1#1;main_~_hj_j~1#1 := (if (1 == main_~_hj_j~1#1 || 0 == main_~_hj_j~1#1) && (1 == 256 * main_~_hj_i~1#1 || 0 == 256 * main_~_hj_i~1#1) then (if main_~_hj_j~1#1 == 256 * main_~_hj_i~1#1 then 0 else 1) else (if 0 == main_~_hj_j~1#1 then 256 * main_~_hj_i~1#1 else (if 0 == 256 * main_~_hj_i~1#1 then main_~_hj_j~1#1 else ~bitwiseXOr(main_~_hj_j~1#1, 256 * main_~_hj_i~1#1))));main_~_hf_hashv~0#1 := main_~_hf_hashv~0#1 - main_~_hj_i~1#1;main_~_hf_hashv~0#1 := main_~_hf_hashv~0#1 - main_~_hj_j~1#1;main_~_hf_hashv~0#1 := (if (1 == main_~_hf_hashv~0#1 || 0 == main_~_hf_hashv~0#1) && (1 == main_~_hj_j~1#1 / 8192 || 0 == main_~_hj_j~1#1 / 8192) then (if main_~_hf_hashv~0#1 == main_~_hj_j~1#1 / 8192 then 0 else 1) else (if 0 == main_~_hf_hashv~0#1 then main_~_hj_j~1#1 / 8192 else (if 0 == main_~_hj_j~1#1 / 8192 then main_~_hf_hashv~0#1 else ~bitwiseXOr(main_~_hf_hashv~0#1, main_~_hj_j~1#1 / 8192))));main_~_hj_i~1#1 := main_~_hj_i~1#1 - main_~_hj_j~1#1;main_~_hj_i~1#1 := main_~_hj_i~1#1 - main_~_hf_hashv~0#1;main_~_hj_i~1#1 := (if (1 == main_~_hj_i~1#1 || 0 == main_~_hj_i~1#1) && (1 == main_~_hf_hashv~0#1 / 4096 || 0 == main_~_hf_hashv~0#1 / 4096) then (if main_~_hj_i~1#1 == main_~_hf_hashv~0#1 / 4096 then 0 else 1) else (if 0 == main_~_hj_i~1#1 then main_~_hf_hashv~0#1 / 4096 else (if 0 == main_~_hf_hashv~0#1 / 4096 then main_~_hj_i~1#1 else ~bitwiseXOr(main_~_hj_i~1#1, main_~_hf_hashv~0#1 / 4096))));main_~_hj_j~1#1 := main_~_hj_j~1#1 - main_~_hf_hashv~0#1;main_~_hj_j~1#1 := main_~_hj_j~1#1 - main_~_hj_i~1#1;main_~_hj_j~1#1 := (if (1 == main_~_hj_j~1#1 || 0 == main_~_hj_j~1#1) && (1 == 65536 * main_~_hj_i~1#1 || 0 == 65536 * main_~_hj_i~1#1) then (if main_~_hj_j~1#1 == 65536 * main_~_hj_i~1#1 then 0 else 1) else (if 0 == main_~_hj_j~1#1 then 65536 * main_~_hj_i~1#1 else (if 0 == 65536 * main_~_hj_i~1#1 then main_~_hj_j~1#1 else ~bitwiseXOr(main_~_hj_j~1#1, 65536 * main_~_hj_i~1#1))));main_~_hf_hashv~0#1 := main_~_hf_hashv~0#1 - main_~_hj_i~1#1;main_~_hf_hashv~0#1 := main_~_hf_hashv~0#1 - main_~_hj_j~1#1;main_~_hf_hashv~0#1 := (if (1 == main_~_hf_hashv~0#1 || 0 == main_~_hf_hashv~0#1) && (1 == main_~_hj_j~1#1 / 32 || 0 == main_~_hj_j~1#1 / 32) then (if main_~_hf_hashv~0#1 == main_~_hj_j~1#1 / 32 then 0 else 1) else (if 0 == main_~_hf_hashv~0#1 then main_~_hj_j~1#1 / 32 else (if 0 == main_~_hj_j~1#1 / 32 then main_~_hf_hashv~0#1 else ~bitwiseXOr(main_~_hf_hashv~0#1, main_~_hj_j~1#1 / 32))));main_~_hj_i~1#1 := main_~_hj_i~1#1 - main_~_hj_j~1#1;main_~_hj_i~1#1 := main_~_hj_i~1#1 - main_~_hf_hashv~0#1;main_~_hj_i~1#1 := (if (1 == main_~_hj_i~1#1 || 0 == main_~_hj_i~1#1) && (1 == main_~_hf_hashv~0#1 / 8 || 0 == main_~_hf_hashv~0#1 / 8) then (if main_~_hj_i~1#1 == main_~_hf_hashv~0#1 / 8 then 0 else 1) else (if 0 == main_~_hj_i~1#1 then main_~_hf_hashv~0#1 / 8 else (if 0 == main_~_hf_hashv~0#1 / 8 then main_~_hj_i~1#1 else ~bitwiseXOr(main_~_hj_i~1#1, main_~_hf_hashv~0#1 / 8))));main_~_hj_j~1#1 := main_~_hj_j~1#1 - main_~_hf_hashv~0#1;main_~_hj_j~1#1 := main_~_hj_j~1#1 - main_~_hj_i~1#1;main_~_hj_j~1#1 := (if (1 == main_~_hj_j~1#1 || 0 == main_~_hj_j~1#1) && (1 == 1024 * main_~_hj_i~1#1 || 0 == 1024 * main_~_hj_i~1#1) then (if main_~_hj_j~1#1 == 1024 * main_~_hj_i~1#1 then 0 else 1) else (if 0 == main_~_hj_j~1#1 then 1024 * main_~_hj_i~1#1 else (if 0 == 1024 * main_~_hj_i~1#1 then main_~_hj_j~1#1 else ~bitwiseXOr(main_~_hj_j~1#1, 1024 * main_~_hj_i~1#1))));main_~_hf_hashv~0#1 := main_~_hf_hashv~0#1 - main_~_hj_i~1#1;main_~_hf_hashv~0#1 := main_~_hf_hashv~0#1 - main_~_hj_j~1#1;main_~_hf_hashv~0#1 := (if (1 == main_~_hf_hashv~0#1 || 0 == main_~_hf_hashv~0#1) && (1 == main_~_hj_j~1#1 / 32768 || 0 == main_~_hj_j~1#1 / 32768) then (if main_~_hf_hashv~0#1 == main_~_hj_j~1#1 / 32768 then 0 else 1) else (if 0 == main_~_hf_hashv~0#1 then main_~_hj_j~1#1 / 32768 else (if 0 == main_~_hj_j~1#1 / 32768 then main_~_hf_hashv~0#1 else ~bitwiseXOr(main_~_hf_hashv~0#1, main_~_hj_j~1#1 / 32768)))); {1601#false} is VALID [2022-02-20 23:32:59,892 INFO L290 TraceCheckUtils]: 35: Hoare triple {1601#false} goto; {1601#false} is VALID [2022-02-20 23:32:59,893 INFO L290 TraceCheckUtils]: 36: Hoare triple {1601#false} goto; {1601#false} is VALID [2022-02-20 23:32:59,893 INFO L290 TraceCheckUtils]: 37: Hoare triple {1601#false} goto; {1601#false} is VALID [2022-02-20 23:32:59,893 INFO L290 TraceCheckUtils]: 38: Hoare triple {1601#false} main_~tmp~0#1.base, main_~tmp~0#1.offset := 0, 0; {1601#false} is VALID [2022-02-20 23:32:59,893 INFO L290 TraceCheckUtils]: 39: Hoare triple {1601#false} assume !(main_~users~0#1.base != 0 || main_~users~0#1.offset != 0); {1601#false} is VALID [2022-02-20 23:32:59,893 INFO L290 TraceCheckUtils]: 40: Hoare triple {1601#false} goto; {1601#false} is VALID [2022-02-20 23:32:59,894 INFO L290 TraceCheckUtils]: 41: Hoare triple {1601#false} goto; {1601#false} is VALID [2022-02-20 23:32:59,894 INFO L290 TraceCheckUtils]: 42: Hoare triple {1601#false} assume !(main_~tmp~0#1.base != 0 || main_~tmp~0#1.offset != 0); {1601#false} is VALID [2022-02-20 23:32:59,894 INFO L290 TraceCheckUtils]: 43: Hoare triple {1601#false} assume !false; {1601#false} is VALID [2022-02-20 23:32:59,894 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-20 23:32:59,894 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 23:32:59,895 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1595417219] [2022-02-20 23:32:59,895 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1595417219] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:32:59,895 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:32:59,895 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-02-20 23:32:59,895 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1484885844] [2022-02-20 23:32:59,895 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:32:59,896 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.0) internal successors, (44), 4 states have internal predecessors, (44), 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 44 [2022-02-20 23:32:59,897 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:32:59,897 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 11.0) internal successors, (44), 4 states have internal predecessors, (44), 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-20 23:32:59,925 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 44 edges. 44 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:32:59,925 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-02-20 23:32:59,925 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 23:32:59,926 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-02-20 23:32:59,926 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-02-20 23:32:59,926 INFO L87 Difference]: Start difference. First operand 222 states and 307 transitions. Second operand has 4 states, 4 states have (on average 11.0) internal successors, (44), 4 states have internal predecessors, (44), 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-20 23:33:02,004 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:33:02,004 INFO L93 Difference]: Finished difference Result 463 states and 642 transitions. [2022-02-20 23:33:02,005 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-02-20 23:33:02,011 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.0) internal successors, (44), 4 states have internal predecessors, (44), 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 44 [2022-02-20 23:33:02,011 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:33:02,012 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 11.0) internal successors, (44), 4 states have internal predecessors, (44), 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-20 23:33:02,018 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 642 transitions. [2022-02-20 23:33:02,031 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 11.0) internal successors, (44), 4 states have internal predecessors, (44), 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-20 23:33:02,039 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 642 transitions. [2022-02-20 23:33:02,040 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 642 transitions. [2022-02-20 23:33:02,435 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 642 edges. 642 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:33:02,441 INFO L225 Difference]: With dead ends: 463 [2022-02-20 23:33:02,441 INFO L226 Difference]: Without dead ends: 338 [2022-02-20 23:33:02,442 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-02-20 23:33:02,443 INFO L933 BasicCegarLoop]: 274 mSDtfsCounter, 143 mSDsluCounter, 500 mSDsCounter, 0 mSdLazyCounter, 166 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 144 SdHoareTripleChecker+Valid, 774 SdHoareTripleChecker+Invalid, 169 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 166 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-02-20 23:33:02,444 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [144 Valid, 774 Invalid, 169 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 166 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-02-20 23:33:02,447 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 338 states. [2022-02-20 23:33:02,458 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 338 to 224. [2022-02-20 23:33:02,475 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:33:02,476 INFO L82 GeneralOperation]: Start isEquivalent. First operand 338 states. Second operand has 224 states, 199 states have (on average 1.3517587939698492) internal successors, (269), 215 states have internal predecessors, (269), 20 states have call successors, (20), 3 states have call predecessors, (20), 3 states have return successors, (20), 6 states have call predecessors, (20), 20 states have call successors, (20) [2022-02-20 23:33:02,476 INFO L74 IsIncluded]: Start isIncluded. First operand 338 states. Second operand has 224 states, 199 states have (on average 1.3517587939698492) internal successors, (269), 215 states have internal predecessors, (269), 20 states have call successors, (20), 3 states have call predecessors, (20), 3 states have return successors, (20), 6 states have call predecessors, (20), 20 states have call successors, (20) [2022-02-20 23:33:02,477 INFO L87 Difference]: Start difference. First operand 338 states. Second operand has 224 states, 199 states have (on average 1.3517587939698492) internal successors, (269), 215 states have internal predecessors, (269), 20 states have call successors, (20), 3 states have call predecessors, (20), 3 states have return successors, (20), 6 states have call predecessors, (20), 20 states have call successors, (20) [2022-02-20 23:33:02,486 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:33:02,499 INFO L93 Difference]: Finished difference Result 338 states and 460 transitions. [2022-02-20 23:33:02,499 INFO L276 IsEmpty]: Start isEmpty. Operand 338 states and 460 transitions. [2022-02-20 23:33:02,501 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:33:02,502 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:33:02,502 INFO L74 IsIncluded]: Start isIncluded. First operand has 224 states, 199 states have (on average 1.3517587939698492) internal successors, (269), 215 states have internal predecessors, (269), 20 states have call successors, (20), 3 states have call predecessors, (20), 3 states have return successors, (20), 6 states have call predecessors, (20), 20 states have call successors, (20) Second operand 338 states. [2022-02-20 23:33:02,504 INFO L87 Difference]: Start difference. First operand has 224 states, 199 states have (on average 1.3517587939698492) internal successors, (269), 215 states have internal predecessors, (269), 20 states have call successors, (20), 3 states have call predecessors, (20), 3 states have return successors, (20), 6 states have call predecessors, (20), 20 states have call successors, (20) Second operand 338 states. [2022-02-20 23:33:02,513 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:33:02,513 INFO L93 Difference]: Finished difference Result 338 states and 460 transitions. [2022-02-20 23:33:02,514 INFO L276 IsEmpty]: Start isEmpty. Operand 338 states and 460 transitions. [2022-02-20 23:33:02,514 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:33:02,527 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:33:02,527 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:33:02,527 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:33:02,528 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 224 states, 199 states have (on average 1.3517587939698492) internal successors, (269), 215 states have internal predecessors, (269), 20 states have call successors, (20), 3 states have call predecessors, (20), 3 states have return successors, (20), 6 states have call predecessors, (20), 20 states have call successors, (20) [2022-02-20 23:33:02,534 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 224 states to 224 states and 309 transitions. [2022-02-20 23:33:02,535 INFO L78 Accepts]: Start accepts. Automaton has 224 states and 309 transitions. Word has length 44 [2022-02-20 23:33:02,535 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:33:02,535 INFO L470 AbstractCegarLoop]: Abstraction has 224 states and 309 transitions. [2022-02-20 23:33:02,535 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.0) internal successors, (44), 4 states have internal predecessors, (44), 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-20 23:33:02,536 INFO L276 IsEmpty]: Start isEmpty. Operand 224 states and 309 transitions. [2022-02-20 23:33:02,537 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2022-02-20 23:33:02,537 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:33:02,538 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-20 23:33:02,538 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-02-20 23:33:02,538 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 23:33:02,539 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:33:02,539 INFO L85 PathProgramCache]: Analyzing trace with hash -342228401, now seen corresponding path program 1 times [2022-02-20 23:33:02,541 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 23:33:02,542 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1153117221] [2022-02-20 23:33:02,542 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:33:02,542 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 23:33:02,700 ERROR L252 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-02-20 23:33:02,701 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [379024758] [2022-02-20 23:33:02,701 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:33:02,701 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 23:33:02,701 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 23:33:02,719 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-20 23:33:02,738 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-20 23:33:03,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:33:03,138 INFO L263 TraceCheckSpWp]: Trace formula consists of 1557 conjuncts, 3 conjunts are in the unsatisfiable core [2022-02-20 23:33:03,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:33:03,183 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 23:33:03,371 INFO L290 TraceCheckUtils]: 0: Hoare triple {3129#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~0 := 0; {3129#true} is VALID [2022-02-20 23:33:03,372 INFO L290 TraceCheckUtils]: 1: Hoare triple {3129#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc8#1.base, main_#t~malloc8#1.offset, main_#t~mem9#1, main_#t~mem10#1, main_#t~mem11#1, main_#t~mem13#1, main_#t~mem12#1, main_#t~mem14#1, main_#t~mem15#1, main_#t~mem17#1, main_#t~mem16#1, main_#t~mem18#1, main_#t~mem19#1, main_#t~mem21#1, main_#t~mem20#1, main_#t~mem22#1, main_#t~mem23#1, main_#t~switch24#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_#t~mem31#1, main_#t~mem32#1, main_#t~mem33#1, main_#t~mem34#1, main_#t~mem35#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~malloc36#1.base, main_#t~malloc36#1.offset, main_#t~mem37#1.base, main_#t~mem37#1.offset, main_#t~mem38#1.base, main_#t~mem38#1.offset, main_#t~memset~res39#1.base, main_#t~memset~res39#1.offset, main_#t~mem40#1.base, main_#t~mem40#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~malloc45#1.base, main_#t~malloc45#1.offset, main_#t~mem46#1.base, main_#t~mem46#1.offset, main_#t~mem47#1.base, main_#t~mem47#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~memset~res52#1.base, main_#t~memset~res52#1.offset, 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~mem58#1.base, main_#t~mem58#1.offset, main_#t~mem59#1.base, main_#t~mem59#1.offset, main_#t~mem60#1.base, main_#t~mem60#1.offset, main_#t~mem61#1.base, main_#t~mem61#1.offset, main_#t~mem62#1, main_#t~post63#1, main_#t~mem64#1.base, main_#t~mem64#1.offset, main_#t~mem65#1, main_#t~mem66#1.base, main_#t~mem66#1.offset, main_#t~mem67#1.base, main_#t~mem67#1.offset, main_#t~mem68#1, main_#t~post69#1, main_#t~mem70#1.base, main_#t~mem70#1.offset, main_#t~mem71#1.base, main_#t~mem71#1.offset, main_#t~mem72#1.base, main_#t~mem72#1.offset, main_#t~mem74#1, main_#t~mem73#1, main_#t~mem75#1.base, main_#t~mem75#1.offset, main_#t~mem76#1, main_#t~short77#1, main_#t~mem78#1.base, main_#t~mem78#1.offset, main_#t~mem79#1, main_#t~malloc80#1.base, main_#t~malloc80#1.offset, main_#t~mem81#1.base, main_#t~mem81#1.offset, main_#t~mem82#1.base, main_#t~mem82#1.offset, main_#t~mem83#1.base, main_#t~mem83#1.offset, main_#t~mem84#1, main_#t~memset~res85#1.base, main_#t~memset~res85#1.offset, main_#t~mem86#1.base, main_#t~mem86#1.offset, main_#t~mem87#1.base, main_#t~mem87#1.offset, main_#t~mem90#1, main_#t~mem88#1.base, main_#t~mem88#1.offset, main_#t~mem89#1, main_#t~mem91#1.base, main_#t~mem91#1.offset, main_#t~mem94#1, main_#t~mem92#1.base, main_#t~mem92#1.offset, main_#t~mem93#1, main_#t~ite95#1, main_#t~mem96#1.base, main_#t~mem96#1.offset, main_#t~mem100#1.base, main_#t~mem100#1.offset, main_#t~mem101#1.base, main_#t~mem101#1.offset, main_#t~mem102#1.base, main_#t~mem102#1.offset, main_#t~mem103#1.base, main_#t~mem103#1.offset, main_#t~mem106#1, main_#t~mem104#1.base, main_#t~mem104#1.offset, main_#t~mem105#1, main_#t~mem107#1.base, main_#t~mem107#1.offset, main_#t~mem108#1, main_#t~pre109#1, main_#t~mem110#1.base, main_#t~mem110#1.offset, main_#t~mem111#1, main_#t~mem112#1.base, main_#t~mem112#1.offset, main_#t~mem113#1, main_#t~post114#1, main_#t~mem118#1, main_#t~mem116#1, main_#t~mem115#1.base, main_#t~mem115#1.offset, main_#t~mem117#1, main_#t~mem119#1, main_#t~post120#1, main_#t~mem121#1.base, main_#t~mem121#1.offset, main_#t~mem122#1.base, main_#t~mem122#1.offset, main_#t~mem123#1.base, main_#t~mem123#1.offset, main_#t~post97#1, main_#t~mem98#1.base, main_#t~mem98#1.offset, main_#t~mem99#1, main_#t~mem124#1.base, main_#t~mem124#1.offset, main_#t~mem125#1.base, main_#t~mem125#1.offset, main_#t~mem126#1.base, main_#t~mem126#1.offset, main_#t~mem127#1, main_#t~mem128#1.base, main_#t~mem128#1.offset, main_#t~mem129#1, main_#t~post130#1, main_#t~mem131#1.base, main_#t~mem131#1.offset, main_#t~mem132#1.base, main_#t~mem132#1.offset, main_#t~mem133#1.base, main_#t~mem133#1.offset, main_#t~mem134#1.base, main_#t~mem134#1.offset, main_#t~mem137#1, main_#t~mem135#1.base, main_#t~mem135#1.offset, main_#t~mem136#1, main_#t~ite140#1, main_#t~mem138#1.base, main_#t~mem138#1.offset, main_#t~mem139#1, main_#t~mem141#1.base, main_#t~mem141#1.offset, main_#t~mem142#1, main_#t~mem143#1.base, main_#t~mem143#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~mem144#1.base, main_#t~mem144#1.offset, main_#t~mem145#1, main_#t~mem5#1, main_#t~post6#1, main_#t~mem7#1, main_#t~mem149#1, main_#t~mem148#1, main_#t~mem150#1, main_#t~mem151#1, main_#t~mem153#1, main_#t~mem152#1, main_#t~mem154#1, main_#t~mem155#1, main_#t~mem157#1, main_#t~mem156#1, main_#t~mem158#1, main_#t~mem159#1, main_#t~switch160#1, main_#t~mem161#1, main_#t~mem162#1, main_#t~mem163#1, main_#t~mem164#1, main_#t~mem165#1, main_#t~mem166#1, main_#t~mem167#1, main_#t~mem168#1, main_#t~mem169#1, main_#t~mem170#1, main_#t~mem171#1, main_~_hj_i~1#1, main_~_hj_j~1#1, main_~_hj_k~1#1, main_~_hj_key~1#1.base, main_~_hj_key~1#1.offset, main_#t~mem172#1.base, main_#t~mem172#1.offset, main_#t~mem173#1, main_#t~mem174#1.base, main_#t~mem174#1.offset, main_#t~mem175#1.base, main_#t~mem175#1.offset, main_#t~mem176#1.base, main_#t~mem176#1.offset, main_#t~mem177#1.base, main_#t~mem177#1.offset, main_#t~mem178#1.base, main_#t~mem178#1.offset, main_#t~mem179#1.base, main_#t~mem179#1.offset, main_#t~mem180#1.base, main_#t~mem180#1.offset, main_#t~mem181#1, main_#t~mem182#1, main_#t~mem183#1, main_#t~short184#1, main_#t~mem185#1.base, main_#t~mem185#1.offset, main_#t~ret186#1, main_#t~mem187#1.base, main_#t~mem187#1.offset, main_#t~mem188#1.base, main_#t~mem188#1.offset, main_#t~mem189#1.base, main_#t~mem189#1.offset, main_#t~mem190#1, main_~_hf_bkt~0#1, main_~_hf_hashv~0#1, main_#t~mem191#1.base, main_#t~mem191#1.offset, main_#t~mem192#1.base, main_#t~mem192#1.offset, main_#t~short193#1, main_#t~mem194#1.base, main_#t~mem194#1.offset, main_#t~mem195#1.base, main_#t~mem195#1.offset, main_#t~mem196#1.base, main_#t~mem196#1.offset, main_#t~mem197#1.base, main_#t~mem197#1.offset, main_#t~mem198#1.base, main_#t~mem198#1.offset, main_#t~mem199#1.base, main_#t~mem199#1.offset, main_#t~mem200#1.base, main_#t~mem200#1.offset, main_#t~mem201#1.base, main_#t~mem201#1.offset, main_#t~mem202#1, main_#t~mem203#1.base, main_#t~mem203#1.offset, main_#t~mem204#1.base, main_#t~mem204#1.offset, main_#t~mem205#1.base, main_#t~mem205#1.offset, main_#t~mem206#1, main_#t~mem207#1.base, main_#t~mem207#1.offset, main_#t~mem208#1.base, main_#t~mem208#1.offset, main_#t~mem209#1.base, main_#t~mem209#1.offset, main_#t~mem210#1.base, main_#t~mem210#1.offset, main_#t~mem211#1.base, main_#t~mem211#1.offset, main_#t~mem212#1, main_#t~mem213#1.base, main_#t~mem213#1.offset, main_#t~mem216#1, main_#t~mem214#1.base, main_#t~mem214#1.offset, main_#t~mem215#1, main_#t~mem217#1.base, main_#t~mem217#1.offset, main_#t~mem218#1.base, main_#t~mem218#1.offset, main_#t~mem219#1, main_#t~post220#1, main_#t~mem221#1.base, main_#t~mem221#1.offset, main_#t~mem222#1.base, main_#t~mem222#1.offset, main_#t~mem223#1.base, main_#t~mem223#1.offset, main_#t~mem224#1.base, main_#t~mem224#1.offset, main_#t~mem225#1.base, main_#t~mem225#1.offset, main_#t~mem226#1.base, main_#t~mem226#1.offset, main_#t~mem227#1.base, main_#t~mem227#1.offset, main_#t~mem228#1.base, main_#t~mem228#1.offset, main_~_hd_head~0#1.base, main_~_hd_head~0#1.offset, main_#t~mem229#1.base, main_#t~mem229#1.offset, main_#t~mem230#1, main_#t~post231#1, main_~_hd_bkt~0#1, main_~_hd_hh_del~0#1.base, main_~_hd_hh_del~0#1.offset, main_#t~mem232#1.base, main_#t~mem232#1.offset, main_#t~mem233#1, main_#t~mem146#1, main_#t~mem147#1, main_#t~ite235#1.base, main_#t~ite235#1.offset, main_#t~mem234#1.base, main_#t~mem234#1.offset, main_#t~mem238#1.base, main_#t~mem238#1.offset, main_#t~mem239#1.base, main_#t~mem239#1.offset, main_#t~short240#1, main_#t~mem241#1.base, main_#t~mem241#1.offset, main_#t~mem242#1.base, main_#t~mem242#1.offset, main_#t~mem243#1.base, main_#t~mem243#1.offset, main_#t~mem244#1.base, main_#t~mem244#1.offset, main_#t~mem245#1.base, main_#t~mem245#1.offset, main_#t~mem246#1.base, main_#t~mem246#1.offset, main_#t~mem247#1.base, main_#t~mem247#1.offset, main_#t~mem248#1.base, main_#t~mem248#1.offset, main_#t~mem249#1, main_#t~mem250#1.base, main_#t~mem250#1.offset, main_#t~mem251#1.base, main_#t~mem251#1.offset, main_#t~mem252#1.base, main_#t~mem252#1.offset, main_#t~mem253#1, main_#t~mem254#1.base, main_#t~mem254#1.offset, main_#t~mem255#1.base, main_#t~mem255#1.offset, main_#t~mem256#1.base, main_#t~mem256#1.offset, main_#t~mem257#1.base, main_#t~mem257#1.offset, main_#t~mem258#1.base, main_#t~mem258#1.offset, main_#t~mem259#1, main_#t~mem260#1.base, main_#t~mem260#1.offset, main_#t~mem263#1, main_#t~mem261#1.base, main_#t~mem261#1.offset, main_#t~mem262#1, main_#t~mem264#1.base, main_#t~mem264#1.offset, main_#t~mem265#1.base, main_#t~mem265#1.offset, main_#t~mem266#1, main_#t~post267#1, main_#t~mem268#1.base, main_#t~mem268#1.offset, main_#t~mem269#1.base, main_#t~mem269#1.offset, main_#t~mem270#1.base, main_#t~mem270#1.offset, main_#t~mem271#1.base, main_#t~mem271#1.offset, main_#t~mem272#1.base, main_#t~mem272#1.offset, main_#t~mem273#1.base, main_#t~mem273#1.offset, main_#t~mem274#1.base, main_#t~mem274#1.offset, main_#t~mem275#1.base, main_#t~mem275#1.offset, main_~_hd_head~1#1.base, main_~_hd_head~1#1.offset, main_#t~mem276#1.base, main_#t~mem276#1.offset, main_#t~mem277#1, main_#t~post278#1, main_~_hd_bkt~1#1, main_~_hd_hh_del~1#1.base, main_~_hd_hh_del~1#1.offset, main_#t~ite237#1.base, main_#t~ite237#1.offset, main_#t~mem236#1.base, main_#t~mem236#1.offset, main_~#i~0#1.base, main_~#i~0#1.offset, main_~user~0#1.base, main_~user~0#1.offset, main_~tmp~0#1.base, main_~tmp~0#1.offset, main_~users~0#1.base, main_~users~0#1.offset, main_~temp~0#1.base, main_~temp~0#1.offset;call main_~#i~0#1.base, main_~#i~0#1.offset := #Ultimate.allocOnStack(4);havoc main_~user~0#1.base, main_~user~0#1.offset;havoc main_~tmp~0#1.base, main_~tmp~0#1.offset;main_~users~0#1.base, main_~users~0#1.offset := 0, 0;call write~int(0, main_~#i~0#1.base, main_~#i~0#1.offset, 4); {3129#true} is VALID [2022-02-20 23:33:03,372 INFO L290 TraceCheckUtils]: 2: Hoare triple {3129#true} call main_#t~mem7#1 := read~int(main_~#i~0#1.base, main_~#i~0#1.offset, 4); {3129#true} is VALID [2022-02-20 23:33:03,372 INFO L290 TraceCheckUtils]: 3: Hoare triple {3129#true} assume !!(main_#t~mem7#1 < 10);havoc main_#t~mem7#1;call main_#t~malloc8#1.base, main_#t~malloc8#1.offset := #Ultimate.allocOnHeap(40);main_~user~0#1.base, main_~user~0#1.offset := main_#t~malloc8#1.base, main_#t~malloc8#1.offset;havoc main_#t~malloc8#1.base, main_#t~malloc8#1.offset; {3129#true} is VALID [2022-02-20 23:33:03,373 INFO L290 TraceCheckUtils]: 4: Hoare triple {3129#true} assume !(main_~user~0#1.base == 0 && main_~user~0#1.offset == 0); {3129#true} is VALID [2022-02-20 23:33:03,373 INFO L290 TraceCheckUtils]: 5: Hoare triple {3129#true} call main_#t~mem9#1 := read~int(main_~#i~0#1.base, main_~#i~0#1.offset, 4);call write~int(main_#t~mem9#1, main_~user~0#1.base, main_~user~0#1.offset, 4);havoc main_#t~mem9#1;call main_#t~mem10#1 := read~int(main_~#i~0#1.base, main_~#i~0#1.offset, 4);call main_#t~mem11#1 := read~int(main_~#i~0#1.base, main_~#i~0#1.offset, 4);call write~int(main_#t~mem10#1 * main_#t~mem11#1, main_~user~0#1.base, 4 + main_~user~0#1.offset, 4);havoc main_#t~mem10#1;havoc main_#t~mem11#1; {3129#true} is VALID [2022-02-20 23:33:03,373 INFO L290 TraceCheckUtils]: 6: Hoare triple {3129#true} havoc main_~_ha_hashv~0#1; {3129#true} is VALID [2022-02-20 23:33:03,373 INFO L290 TraceCheckUtils]: 7: Hoare triple {3129#true} goto; {3129#true} is VALID [2022-02-20 23:33:03,373 INFO L290 TraceCheckUtils]: 8: Hoare triple {3129#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; {3129#true} is VALID [2022-02-20 23:33:03,374 INFO L290 TraceCheckUtils]: 9: Hoare triple {3129#true} assume !(main_~_hj_k~0#1 % 4294967296 >= 12); {3129#true} is VALID [2022-02-20 23:33:03,374 INFO L290 TraceCheckUtils]: 10: Hoare triple {3129#true} main_~_ha_hashv~0#1 := 4 + main_~_ha_hashv~0#1;main_#t~switch24#1 := 11 == main_~_hj_k~0#1; {3129#true} is VALID [2022-02-20 23:33:03,374 INFO L290 TraceCheckUtils]: 11: Hoare triple {3129#true} assume main_#t~switch24#1;call main_#t~mem25#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~mem25#1 % 256);havoc main_#t~mem25#1; {3129#true} is VALID [2022-02-20 23:33:03,374 INFO L290 TraceCheckUtils]: 12: Hoare triple {3129#true} main_#t~switch24#1 := main_#t~switch24#1 || 10 == main_~_hj_k~0#1; {3129#true} is VALID [2022-02-20 23:33:03,375 INFO L290 TraceCheckUtils]: 13: Hoare triple {3129#true} assume main_#t~switch24#1;call main_#t~mem26#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~mem26#1 % 256);havoc main_#t~mem26#1; {3173#|ULTIMATE.start_main_#t~switch24#1|} is VALID [2022-02-20 23:33:03,376 INFO L290 TraceCheckUtils]: 14: Hoare triple {3173#|ULTIMATE.start_main_#t~switch24#1|} main_#t~switch24#1 := main_#t~switch24#1 || 9 == main_~_hj_k~0#1; {3173#|ULTIMATE.start_main_#t~switch24#1|} is VALID [2022-02-20 23:33:03,376 INFO L290 TraceCheckUtils]: 15: Hoare triple {3173#|ULTIMATE.start_main_#t~switch24#1|} assume !main_#t~switch24#1; {3130#false} is VALID [2022-02-20 23:33:03,376 INFO L290 TraceCheckUtils]: 16: Hoare triple {3130#false} main_#t~switch24#1 := main_#t~switch24#1 || 8 == main_~_hj_k~0#1; {3130#false} is VALID [2022-02-20 23:33:03,376 INFO L290 TraceCheckUtils]: 17: Hoare triple {3130#false} assume main_#t~switch24#1;call main_#t~mem28#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~mem28#1 % 256);havoc main_#t~mem28#1; {3130#false} is VALID [2022-02-20 23:33:03,377 INFO L290 TraceCheckUtils]: 18: Hoare triple {3130#false} main_#t~switch24#1 := main_#t~switch24#1 || 7 == main_~_hj_k~0#1; {3130#false} is VALID [2022-02-20 23:33:03,377 INFO L290 TraceCheckUtils]: 19: Hoare triple {3130#false} assume main_#t~switch24#1;call main_#t~mem29#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~mem29#1 % 256);havoc main_#t~mem29#1; {3130#false} is VALID [2022-02-20 23:33:03,377 INFO L290 TraceCheckUtils]: 20: Hoare triple {3130#false} main_#t~switch24#1 := main_#t~switch24#1 || 6 == main_~_hj_k~0#1; {3130#false} is VALID [2022-02-20 23:33:03,377 INFO L290 TraceCheckUtils]: 21: Hoare triple {3130#false} assume main_#t~switch24#1;call main_#t~mem30#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~mem30#1 % 256);havoc main_#t~mem30#1; {3130#false} is VALID [2022-02-20 23:33:03,377 INFO L290 TraceCheckUtils]: 22: Hoare triple {3130#false} main_#t~switch24#1 := main_#t~switch24#1 || 5 == main_~_hj_k~0#1; {3130#false} is VALID [2022-02-20 23:33:03,378 INFO L290 TraceCheckUtils]: 23: Hoare triple {3130#false} assume main_#t~switch24#1;call main_#t~mem31#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~mem31#1 % 256;havoc main_#t~mem31#1; {3130#false} is VALID [2022-02-20 23:33:03,378 INFO L290 TraceCheckUtils]: 24: Hoare triple {3130#false} main_#t~switch24#1 := main_#t~switch24#1 || 4 == main_~_hj_k~0#1; {3130#false} is VALID [2022-02-20 23:33:03,378 INFO L290 TraceCheckUtils]: 25: Hoare triple {3130#false} assume main_#t~switch24#1;call main_#t~mem32#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~mem32#1 % 256);havoc main_#t~mem32#1; {3130#false} is VALID [2022-02-20 23:33:03,378 INFO L290 TraceCheckUtils]: 26: Hoare triple {3130#false} main_#t~switch24#1 := main_#t~switch24#1 || 3 == main_~_hj_k~0#1; {3130#false} is VALID [2022-02-20 23:33:03,378 INFO L290 TraceCheckUtils]: 27: Hoare triple {3130#false} assume main_#t~switch24#1;call main_#t~mem33#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~mem33#1 % 256);havoc main_#t~mem33#1; {3130#false} is VALID [2022-02-20 23:33:03,379 INFO L290 TraceCheckUtils]: 28: Hoare triple {3130#false} main_#t~switch24#1 := main_#t~switch24#1 || 2 == main_~_hj_k~0#1; {3130#false} is VALID [2022-02-20 23:33:03,379 INFO L290 TraceCheckUtils]: 29: Hoare triple {3130#false} assume !main_#t~switch24#1; {3130#false} is VALID [2022-02-20 23:33:03,379 INFO L290 TraceCheckUtils]: 30: Hoare triple {3130#false} main_#t~switch24#1 := main_#t~switch24#1 || 1 == main_~_hj_k~0#1; {3130#false} is VALID [2022-02-20 23:33:03,379 INFO L290 TraceCheckUtils]: 31: Hoare triple {3130#false} assume main_#t~switch24#1;call main_#t~mem35#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~mem35#1 % 256;havoc main_#t~mem35#1; {3130#false} is VALID [2022-02-20 23:33:03,380 INFO L290 TraceCheckUtils]: 32: Hoare triple {3130#false} havoc main_#t~switch24#1; {3130#false} is VALID [2022-02-20 23:33:03,380 INFO L290 TraceCheckUtils]: 33: Hoare triple {3130#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)))); {3130#false} is VALID [2022-02-20 23:33:03,380 INFO L290 TraceCheckUtils]: 34: Hoare triple {3130#false} goto; {3130#false} is VALID [2022-02-20 23:33:03,380 INFO L290 TraceCheckUtils]: 35: Hoare triple {3130#false} goto; {3130#false} is VALID [2022-02-20 23:33:03,381 INFO L290 TraceCheckUtils]: 36: Hoare triple {3130#false} goto; {3130#false} is VALID [2022-02-20 23:33:03,381 INFO L290 TraceCheckUtils]: 37: Hoare triple {3130#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); {3130#false} is VALID [2022-02-20 23:33:03,381 INFO L290 TraceCheckUtils]: 38: Hoare triple {3130#false} assume !(main_~users~0#1.base == 0 && main_~users~0#1.offset == 0);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 write~$Pointer$(main_#t~mem53#1.base, main_#t~mem53#1.offset, main_~user~0#1.base, 8 + main_~user~0#1.offset, 4);havoc main_#t~mem53#1.base, main_#t~mem53#1.offset; {3130#false} is VALID [2022-02-20 23:33:03,381 INFO L290 TraceCheckUtils]: 39: Hoare triple {3130#false} call write~$Pointer$(0, 0, main_~user~0#1.base, 16 + main_~user~0#1.offset, 4);call main_#t~mem54#1.base, main_#t~mem54#1.offset := read~$Pointer$(main_~users~0#1.base, 8 + main_~users~0#1.offset, 4);call main_#t~mem55#1.base, main_#t~mem55#1.offset := read~$Pointer$(main_#t~mem54#1.base, 16 + main_#t~mem54#1.offset, 4);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, 20 + main_#t~mem56#1.offset, 4);call write~$Pointer$(main_#t~mem55#1.base, main_#t~mem55#1.offset - main_#t~mem57#1, main_~user~0#1.base, 12 + main_~user~0#1.offset, 4);havoc main_#t~mem54#1.base, main_#t~mem54#1.offset;havoc main_#t~mem55#1.base, main_#t~mem55#1.offset;havoc main_#t~mem56#1.base, main_#t~mem56#1.offset;havoc main_#t~mem57#1;call main_#t~mem58#1.base, main_#t~mem58#1.offset := read~$Pointer$(main_~users~0#1.base, 8 + main_~users~0#1.offset, 4);call main_#t~mem59#1.base, main_#t~mem59#1.offset := read~$Pointer$(main_#t~mem58#1.base, 16 + main_#t~mem58#1.offset, 4);call write~$Pointer$(main_~user~0#1.base, main_~user~0#1.offset, main_#t~mem59#1.base, 8 + main_#t~mem59#1.offset, 4);havoc main_#t~mem58#1.base, main_#t~mem58#1.offset;havoc main_#t~mem59#1.base, main_#t~mem59#1.offset;call main_#t~mem60#1.base, main_#t~mem60#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~mem60#1.base, 16 + main_#t~mem60#1.offset, 4);havoc main_#t~mem60#1.base, main_#t~mem60#1.offset; {3130#false} is VALID [2022-02-20 23:33:03,382 INFO L290 TraceCheckUtils]: 40: Hoare triple {3130#false} goto; {3130#false} is VALID [2022-02-20 23:33:03,382 INFO L290 TraceCheckUtils]: 41: Hoare triple {3130#false} havoc main_~_ha_bkt~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 := read~int(main_#t~mem61#1.base, 12 + main_#t~mem61#1.offset, 4);main_#t~post63#1 := main_#t~mem62#1;call write~int(1 + main_#t~post63#1, main_#t~mem61#1.base, 12 + main_#t~mem61#1.offset, 4);havoc main_#t~mem61#1.base, main_#t~mem61#1.offset;havoc main_#t~mem62#1;havoc main_#t~post63#1; {3130#false} is VALID [2022-02-20 23:33:03,382 INFO L290 TraceCheckUtils]: 42: Hoare triple {3130#false} call main_#t~mem64#1.base, main_#t~mem64#1.offset := read~$Pointer$(main_~users~0#1.base, 8 + main_~users~0#1.offset, 4);call main_#t~mem65#1 := read~int(main_#t~mem64#1.base, 4 + main_#t~mem64#1.offset, 4);main_~_ha_bkt~0#1 := (if 0 == main_~_ha_hashv~0#1 || 0 == main_#t~mem65#1 - 1 then 0 else (if 1 == main_#t~mem65#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~mem65#1 - 1))) else (if 1 == main_~_ha_hashv~0#1 then (if 1 == main_#t~mem65#1 - 1 || 0 == main_#t~mem65#1 - 1 then main_#t~mem65#1 - 1 else (if main_#t~mem65#1 - 1 >= 0 then (main_#t~mem65#1 - 1) % 2 else ~bitwiseAnd(main_~_ha_hashv~0#1, main_#t~mem65#1 - 1))) else ~bitwiseAnd(main_~_ha_hashv~0#1, main_#t~mem65#1 - 1))));havoc main_#t~mem64#1.base, main_#t~mem64#1.offset;havoc main_#t~mem65#1; {3130#false} is VALID [2022-02-20 23:33:03,382 INFO L290 TraceCheckUtils]: 43: Hoare triple {3130#false} goto; {3130#false} is VALID [2022-02-20 23:33:03,383 INFO L290 TraceCheckUtils]: 44: Hoare triple {3130#false} call main_#t~mem66#1.base, main_#t~mem66#1.offset := read~$Pointer$(main_~users~0#1.base, 8 + main_~users~0#1.offset, 4);call main_#t~mem67#1.base, main_#t~mem67#1.offset := read~$Pointer$(main_#t~mem66#1.base, main_#t~mem66#1.offset, 4);main_~_ha_head~0#1.base, main_~_ha_head~0#1.offset := main_#t~mem67#1.base, main_#t~mem67#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~mem66#1.base, main_#t~mem66#1.offset;havoc main_#t~mem67#1.base, main_#t~mem67#1.offset;call main_#t~mem68#1 := read~int(main_~_ha_head~0#1.base, 4 + main_~_ha_head~0#1.offset, 4);main_#t~post69#1 := main_#t~mem68#1;call write~int(1 + main_#t~post69#1, main_~_ha_head~0#1.base, 4 + main_~_ha_head~0#1.offset, 4);havoc main_#t~mem68#1;havoc main_#t~post69#1;call main_#t~mem70#1.base, main_#t~mem70#1.offset := read~$Pointer$(main_~_ha_head~0#1.base, main_~_ha_head~0#1.offset, 4);call write~$Pointer$(main_#t~mem70#1.base, main_#t~mem70#1.offset, main_~user~0#1.base, 24 + main_~user~0#1.offset, 4);havoc main_#t~mem70#1.base, main_#t~mem70#1.offset;call write~$Pointer$(0, 0, main_~user~0#1.base, 20 + main_~user~0#1.offset, 4);call main_#t~mem71#1.base, main_#t~mem71#1.offset := read~$Pointer$(main_~_ha_head~0#1.base, main_~_ha_head~0#1.offset, 4); {3130#false} is VALID [2022-02-20 23:33:03,383 INFO L290 TraceCheckUtils]: 45: Hoare triple {3130#false} assume main_#t~mem71#1.base != 0 || main_#t~mem71#1.offset != 0;havoc main_#t~mem71#1.base, main_#t~mem71#1.offset;call main_#t~mem72#1.base, main_#t~mem72#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~mem72#1.base, 12 + main_#t~mem72#1.offset, 4);havoc main_#t~mem72#1.base, main_#t~mem72#1.offset; {3130#false} is VALID [2022-02-20 23:33:03,383 INFO L290 TraceCheckUtils]: 46: Hoare triple {3130#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~mem74#1 := read~int(main_~_ha_head~0#1.base, 4 + main_~_ha_head~0#1.offset, 4);call main_#t~mem73#1 := read~int(main_~_ha_head~0#1.base, 8 + main_~_ha_head~0#1.offset, 4);main_#t~short77#1 := main_#t~mem74#1 % 4294967296 >= 10 * (1 + main_#t~mem73#1) % 4294967296; {3130#false} is VALID [2022-02-20 23:33:03,383 INFO L290 TraceCheckUtils]: 47: Hoare triple {3130#false} assume !main_#t~short77#1; {3130#false} is VALID [2022-02-20 23:33:03,383 INFO L290 TraceCheckUtils]: 48: Hoare triple {3130#false} assume !main_#t~short77#1;havoc main_#t~mem74#1;havoc main_#t~mem73#1;havoc main_#t~mem75#1.base, main_#t~mem75#1.offset;havoc main_#t~mem76#1;havoc main_#t~short77#1; {3130#false} is VALID [2022-02-20 23:33:03,384 INFO L290 TraceCheckUtils]: 49: Hoare triple {3130#false} goto; {3130#false} is VALID [2022-02-20 23:33:03,384 INFO L290 TraceCheckUtils]: 50: Hoare triple {3130#false} goto; {3130#false} is VALID [2022-02-20 23:33:03,384 INFO L290 TraceCheckUtils]: 51: Hoare triple {3130#false} goto; {3130#false} is VALID [2022-02-20 23:33:03,384 INFO L290 TraceCheckUtils]: 52: Hoare triple {3130#false} goto; {3130#false} is VALID [2022-02-20 23:33:03,384 INFO L290 TraceCheckUtils]: 53: Hoare triple {3130#false} call main_#t~mem144#1.base, main_#t~mem144#1.offset := read~$Pointer$(main_~user~0#1.base, 8 + main_~user~0#1.offset, 4);call main_#t~mem145#1 := read~int(main_#t~mem144#1.base, 12 + main_#t~mem144#1.offset, 4); {3130#false} is VALID [2022-02-20 23:33:03,385 INFO L272 TraceCheckUtils]: 54: Hoare triple {3130#false} call test_int((if main_#t~mem145#1 % 4294967296 % 4294967296 <= 2147483647 then main_#t~mem145#1 % 4294967296 % 4294967296 else main_#t~mem145#1 % 4294967296 % 4294967296 - 4294967296)); {3130#false} is VALID [2022-02-20 23:33:03,385 INFO L290 TraceCheckUtils]: 55: Hoare triple {3130#false} ~a := #in~a;#t~post3 := ~count_int~0;~count_int~0 := 1 + #t~post3;#t~switch4 := 0 == #t~post3; {3130#false} is VALID [2022-02-20 23:33:03,385 INFO L290 TraceCheckUtils]: 56: Hoare triple {3130#false} assume #t~switch4; {3130#false} is VALID [2022-02-20 23:33:03,385 INFO L272 TraceCheckUtils]: 57: Hoare triple {3130#false} call __VERIFIER_assert((if 1 == ~a then 1 else 0)); {3130#false} is VALID [2022-02-20 23:33:03,386 INFO L290 TraceCheckUtils]: 58: Hoare triple {3130#false} ~cond := #in~cond; {3130#false} is VALID [2022-02-20 23:33:03,386 INFO L290 TraceCheckUtils]: 59: Hoare triple {3130#false} assume 0 == ~cond; {3130#false} is VALID [2022-02-20 23:33:03,386 INFO L290 TraceCheckUtils]: 60: Hoare triple {3130#false} assume !false; {3130#false} is VALID [2022-02-20 23:33:03,386 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-20 23:33:03,386 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 23:33:03,387 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 23:33:03,387 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1153117221] [2022-02-20 23:33:03,387 WARN L317 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-02-20 23:33:03,387 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [379024758] [2022-02-20 23:33:03,387 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [379024758] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:33:03,388 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:33:03,388 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 23:33:03,388 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1163472089] [2022-02-20 23:33:03,388 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:33:03,389 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 19.666666666666668) internal successors, (59), 3 states have internal predecessors, (59), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 61 [2022-02-20 23:33:03,389 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:33:03,389 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 19.666666666666668) internal successors, (59), 3 states have internal predecessors, (59), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:33:03,434 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-20 23:33:03,435 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 23:33:03,435 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 23:33:03,435 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 23:33:03,436 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 23:33:03,436 INFO L87 Difference]: Start difference. First operand 224 states and 309 transitions. Second operand has 3 states, 3 states have (on average 19.666666666666668) internal successors, (59), 3 states have internal predecessors, (59), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:33:04,788 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:33:04,788 INFO L93 Difference]: Finished difference Result 465 states and 645 transitions. [2022-02-20 23:33:04,789 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 23:33:04,789 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 19.666666666666668) internal successors, (59), 3 states have internal predecessors, (59), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 61 [2022-02-20 23:33:04,789 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:33:04,789 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 19.666666666666668) internal successors, (59), 3 states have internal predecessors, (59), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:33:04,795 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 643 transitions. [2022-02-20 23:33:04,795 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 19.666666666666668) internal successors, (59), 3 states have internal predecessors, (59), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:33:04,801 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 643 transitions. [2022-02-20 23:33:04,801 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 643 transitions. [2022-02-20 23:33:05,249 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 643 edges. 643 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:33:05,253 INFO L225 Difference]: With dead ends: 465 [2022-02-20 23:33:05,253 INFO L226 Difference]: Without dead ends: 245 [2022-02-20 23:33:05,254 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-20 23:33:05,255 INFO L933 BasicCegarLoop]: 287 mSDtfsCounter, 9 mSDsluCounter, 272 mSDsCounter, 0 mSdLazyCounter, 44 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 559 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-20 23:33:05,255 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [9 Valid, 559 Invalid, 72 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 44 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 23:33:05,256 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 245 states. [2022-02-20 23:33:05,261 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 245 to 244. [2022-02-20 23:33:05,261 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:33:05,262 INFO L82 GeneralOperation]: Start isEquivalent. First operand 245 states. Second operand has 244 states, 219 states have (on average 1.3196347031963471) internal successors, (289), 235 states have internal predecessors, (289), 20 states have call successors, (20), 3 states have call predecessors, (20), 3 states have return successors, (20), 6 states have call predecessors, (20), 20 states have call successors, (20) [2022-02-20 23:33:05,262 INFO L74 IsIncluded]: Start isIncluded. First operand 245 states. Second operand has 244 states, 219 states have (on average 1.3196347031963471) internal successors, (289), 235 states have internal predecessors, (289), 20 states have call successors, (20), 3 states have call predecessors, (20), 3 states have return successors, (20), 6 states have call predecessors, (20), 20 states have call successors, (20) [2022-02-20 23:33:05,263 INFO L87 Difference]: Start difference. First operand 245 states. Second operand has 244 states, 219 states have (on average 1.3196347031963471) internal successors, (289), 235 states have internal predecessors, (289), 20 states have call successors, (20), 3 states have call predecessors, (20), 3 states have return successors, (20), 6 states have call predecessors, (20), 20 states have call successors, (20) [2022-02-20 23:33:05,268 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:33:05,268 INFO L93 Difference]: Finished difference Result 245 states and 330 transitions. [2022-02-20 23:33:05,268 INFO L276 IsEmpty]: Start isEmpty. Operand 245 states and 330 transitions. [2022-02-20 23:33:05,268 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:33:05,268 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:33:05,269 INFO L74 IsIncluded]: Start isIncluded. First operand has 244 states, 219 states have (on average 1.3196347031963471) internal successors, (289), 235 states have internal predecessors, (289), 20 states have call successors, (20), 3 states have call predecessors, (20), 3 states have return successors, (20), 6 states have call predecessors, (20), 20 states have call successors, (20) Second operand 245 states. [2022-02-20 23:33:05,270 INFO L87 Difference]: Start difference. First operand has 244 states, 219 states have (on average 1.3196347031963471) internal successors, (289), 235 states have internal predecessors, (289), 20 states have call successors, (20), 3 states have call predecessors, (20), 3 states have return successors, (20), 6 states have call predecessors, (20), 20 states have call successors, (20) Second operand 245 states. [2022-02-20 23:33:05,274 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:33:05,274 INFO L93 Difference]: Finished difference Result 245 states and 330 transitions. [2022-02-20 23:33:05,274 INFO L276 IsEmpty]: Start isEmpty. Operand 245 states and 330 transitions. [2022-02-20 23:33:05,275 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:33:05,275 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:33:05,275 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:33:05,275 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:33:05,275 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 244 states, 219 states have (on average 1.3196347031963471) internal successors, (289), 235 states have internal predecessors, (289), 20 states have call successors, (20), 3 states have call predecessors, (20), 3 states have return successors, (20), 6 states have call predecessors, (20), 20 states have call successors, (20) [2022-02-20 23:33:05,280 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 244 states to 244 states and 329 transitions. [2022-02-20 23:33:05,280 INFO L78 Accepts]: Start accepts. Automaton has 244 states and 329 transitions. Word has length 61 [2022-02-20 23:33:05,280 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:33:05,280 INFO L470 AbstractCegarLoop]: Abstraction has 244 states and 329 transitions. [2022-02-20 23:33:05,280 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 19.666666666666668) internal successors, (59), 3 states have internal predecessors, (59), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:33:05,280 INFO L276 IsEmpty]: Start isEmpty. Operand 244 states and 329 transitions. [2022-02-20 23:33:05,281 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2022-02-20 23:33:05,281 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:33:05,281 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-20 23:33:05,303 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-20 23:33:05,497 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 23:33:05,497 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 23:33:05,498 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:33:05,498 INFO L85 PathProgramCache]: Analyzing trace with hash 1749706579, now seen corresponding path program 1 times [2022-02-20 23:33:05,498 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 23:33:05,498 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2134030216] [2022-02-20 23:33:05,498 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:33:05,498 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 23:33:05,570 ERROR L252 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-02-20 23:33:05,570 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1852024946] [2022-02-20 23:33:05,571 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:33:05,571 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 23:33:05,571 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 23:33:05,572 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-20 23:33:05,587 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-20 23:33:06,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:33:06,167 INFO L263 TraceCheckSpWp]: Trace formula consists of 1561 conjuncts, 3 conjunts are in the unsatisfiable core [2022-02-20 23:33:06,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:33:06,206 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 23:33:06,356 INFO L290 TraceCheckUtils]: 0: Hoare triple {4671#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~0 := 0; {4671#true} is VALID [2022-02-20 23:33:06,357 INFO L290 TraceCheckUtils]: 1: Hoare triple {4671#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc8#1.base, main_#t~malloc8#1.offset, main_#t~mem9#1, main_#t~mem10#1, main_#t~mem11#1, main_#t~mem13#1, main_#t~mem12#1, main_#t~mem14#1, main_#t~mem15#1, main_#t~mem17#1, main_#t~mem16#1, main_#t~mem18#1, main_#t~mem19#1, main_#t~mem21#1, main_#t~mem20#1, main_#t~mem22#1, main_#t~mem23#1, main_#t~switch24#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_#t~mem31#1, main_#t~mem32#1, main_#t~mem33#1, main_#t~mem34#1, main_#t~mem35#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~malloc36#1.base, main_#t~malloc36#1.offset, main_#t~mem37#1.base, main_#t~mem37#1.offset, main_#t~mem38#1.base, main_#t~mem38#1.offset, main_#t~memset~res39#1.base, main_#t~memset~res39#1.offset, main_#t~mem40#1.base, main_#t~mem40#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~malloc45#1.base, main_#t~malloc45#1.offset, main_#t~mem46#1.base, main_#t~mem46#1.offset, main_#t~mem47#1.base, main_#t~mem47#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~memset~res52#1.base, main_#t~memset~res52#1.offset, 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~mem58#1.base, main_#t~mem58#1.offset, main_#t~mem59#1.base, main_#t~mem59#1.offset, main_#t~mem60#1.base, main_#t~mem60#1.offset, main_#t~mem61#1.base, main_#t~mem61#1.offset, main_#t~mem62#1, main_#t~post63#1, main_#t~mem64#1.base, main_#t~mem64#1.offset, main_#t~mem65#1, main_#t~mem66#1.base, main_#t~mem66#1.offset, main_#t~mem67#1.base, main_#t~mem67#1.offset, main_#t~mem68#1, main_#t~post69#1, main_#t~mem70#1.base, main_#t~mem70#1.offset, main_#t~mem71#1.base, main_#t~mem71#1.offset, main_#t~mem72#1.base, main_#t~mem72#1.offset, main_#t~mem74#1, main_#t~mem73#1, main_#t~mem75#1.base, main_#t~mem75#1.offset, main_#t~mem76#1, main_#t~short77#1, main_#t~mem78#1.base, main_#t~mem78#1.offset, main_#t~mem79#1, main_#t~malloc80#1.base, main_#t~malloc80#1.offset, main_#t~mem81#1.base, main_#t~mem81#1.offset, main_#t~mem82#1.base, main_#t~mem82#1.offset, main_#t~mem83#1.base, main_#t~mem83#1.offset, main_#t~mem84#1, main_#t~memset~res85#1.base, main_#t~memset~res85#1.offset, main_#t~mem86#1.base, main_#t~mem86#1.offset, main_#t~mem87#1.base, main_#t~mem87#1.offset, main_#t~mem90#1, main_#t~mem88#1.base, main_#t~mem88#1.offset, main_#t~mem89#1, main_#t~mem91#1.base, main_#t~mem91#1.offset, main_#t~mem94#1, main_#t~mem92#1.base, main_#t~mem92#1.offset, main_#t~mem93#1, main_#t~ite95#1, main_#t~mem96#1.base, main_#t~mem96#1.offset, main_#t~mem100#1.base, main_#t~mem100#1.offset, main_#t~mem101#1.base, main_#t~mem101#1.offset, main_#t~mem102#1.base, main_#t~mem102#1.offset, main_#t~mem103#1.base, main_#t~mem103#1.offset, main_#t~mem106#1, main_#t~mem104#1.base, main_#t~mem104#1.offset, main_#t~mem105#1, main_#t~mem107#1.base, main_#t~mem107#1.offset, main_#t~mem108#1, main_#t~pre109#1, main_#t~mem110#1.base, main_#t~mem110#1.offset, main_#t~mem111#1, main_#t~mem112#1.base, main_#t~mem112#1.offset, main_#t~mem113#1, main_#t~post114#1, main_#t~mem118#1, main_#t~mem116#1, main_#t~mem115#1.base, main_#t~mem115#1.offset, main_#t~mem117#1, main_#t~mem119#1, main_#t~post120#1, main_#t~mem121#1.base, main_#t~mem121#1.offset, main_#t~mem122#1.base, main_#t~mem122#1.offset, main_#t~mem123#1.base, main_#t~mem123#1.offset, main_#t~post97#1, main_#t~mem98#1.base, main_#t~mem98#1.offset, main_#t~mem99#1, main_#t~mem124#1.base, main_#t~mem124#1.offset, main_#t~mem125#1.base, main_#t~mem125#1.offset, main_#t~mem126#1.base, main_#t~mem126#1.offset, main_#t~mem127#1, main_#t~mem128#1.base, main_#t~mem128#1.offset, main_#t~mem129#1, main_#t~post130#1, main_#t~mem131#1.base, main_#t~mem131#1.offset, main_#t~mem132#1.base, main_#t~mem132#1.offset, main_#t~mem133#1.base, main_#t~mem133#1.offset, main_#t~mem134#1.base, main_#t~mem134#1.offset, main_#t~mem137#1, main_#t~mem135#1.base, main_#t~mem135#1.offset, main_#t~mem136#1, main_#t~ite140#1, main_#t~mem138#1.base, main_#t~mem138#1.offset, main_#t~mem139#1, main_#t~mem141#1.base, main_#t~mem141#1.offset, main_#t~mem142#1, main_#t~mem143#1.base, main_#t~mem143#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~mem144#1.base, main_#t~mem144#1.offset, main_#t~mem145#1, main_#t~mem5#1, main_#t~post6#1, main_#t~mem7#1, main_#t~mem149#1, main_#t~mem148#1, main_#t~mem150#1, main_#t~mem151#1, main_#t~mem153#1, main_#t~mem152#1, main_#t~mem154#1, main_#t~mem155#1, main_#t~mem157#1, main_#t~mem156#1, main_#t~mem158#1, main_#t~mem159#1, main_#t~switch160#1, main_#t~mem161#1, main_#t~mem162#1, main_#t~mem163#1, main_#t~mem164#1, main_#t~mem165#1, main_#t~mem166#1, main_#t~mem167#1, main_#t~mem168#1, main_#t~mem169#1, main_#t~mem170#1, main_#t~mem171#1, main_~_hj_i~1#1, main_~_hj_j~1#1, main_~_hj_k~1#1, main_~_hj_key~1#1.base, main_~_hj_key~1#1.offset, main_#t~mem172#1.base, main_#t~mem172#1.offset, main_#t~mem173#1, main_#t~mem174#1.base, main_#t~mem174#1.offset, main_#t~mem175#1.base, main_#t~mem175#1.offset, main_#t~mem176#1.base, main_#t~mem176#1.offset, main_#t~mem177#1.base, main_#t~mem177#1.offset, main_#t~mem178#1.base, main_#t~mem178#1.offset, main_#t~mem179#1.base, main_#t~mem179#1.offset, main_#t~mem180#1.base, main_#t~mem180#1.offset, main_#t~mem181#1, main_#t~mem182#1, main_#t~mem183#1, main_#t~short184#1, main_#t~mem185#1.base, main_#t~mem185#1.offset, main_#t~ret186#1, main_#t~mem187#1.base, main_#t~mem187#1.offset, main_#t~mem188#1.base, main_#t~mem188#1.offset, main_#t~mem189#1.base, main_#t~mem189#1.offset, main_#t~mem190#1, main_~_hf_bkt~0#1, main_~_hf_hashv~0#1, main_#t~mem191#1.base, main_#t~mem191#1.offset, main_#t~mem192#1.base, main_#t~mem192#1.offset, main_#t~short193#1, main_#t~mem194#1.base, main_#t~mem194#1.offset, main_#t~mem195#1.base, main_#t~mem195#1.offset, main_#t~mem196#1.base, main_#t~mem196#1.offset, main_#t~mem197#1.base, main_#t~mem197#1.offset, main_#t~mem198#1.base, main_#t~mem198#1.offset, main_#t~mem199#1.base, main_#t~mem199#1.offset, main_#t~mem200#1.base, main_#t~mem200#1.offset, main_#t~mem201#1.base, main_#t~mem201#1.offset, main_#t~mem202#1, main_#t~mem203#1.base, main_#t~mem203#1.offset, main_#t~mem204#1.base, main_#t~mem204#1.offset, main_#t~mem205#1.base, main_#t~mem205#1.offset, main_#t~mem206#1, main_#t~mem207#1.base, main_#t~mem207#1.offset, main_#t~mem208#1.base, main_#t~mem208#1.offset, main_#t~mem209#1.base, main_#t~mem209#1.offset, main_#t~mem210#1.base, main_#t~mem210#1.offset, main_#t~mem211#1.base, main_#t~mem211#1.offset, main_#t~mem212#1, main_#t~mem213#1.base, main_#t~mem213#1.offset, main_#t~mem216#1, main_#t~mem214#1.base, main_#t~mem214#1.offset, main_#t~mem215#1, main_#t~mem217#1.base, main_#t~mem217#1.offset, main_#t~mem218#1.base, main_#t~mem218#1.offset, main_#t~mem219#1, main_#t~post220#1, main_#t~mem221#1.base, main_#t~mem221#1.offset, main_#t~mem222#1.base, main_#t~mem222#1.offset, main_#t~mem223#1.base, main_#t~mem223#1.offset, main_#t~mem224#1.base, main_#t~mem224#1.offset, main_#t~mem225#1.base, main_#t~mem225#1.offset, main_#t~mem226#1.base, main_#t~mem226#1.offset, main_#t~mem227#1.base, main_#t~mem227#1.offset, main_#t~mem228#1.base, main_#t~mem228#1.offset, main_~_hd_head~0#1.base, main_~_hd_head~0#1.offset, main_#t~mem229#1.base, main_#t~mem229#1.offset, main_#t~mem230#1, main_#t~post231#1, main_~_hd_bkt~0#1, main_~_hd_hh_del~0#1.base, main_~_hd_hh_del~0#1.offset, main_#t~mem232#1.base, main_#t~mem232#1.offset, main_#t~mem233#1, main_#t~mem146#1, main_#t~mem147#1, main_#t~ite235#1.base, main_#t~ite235#1.offset, main_#t~mem234#1.base, main_#t~mem234#1.offset, main_#t~mem238#1.base, main_#t~mem238#1.offset, main_#t~mem239#1.base, main_#t~mem239#1.offset, main_#t~short240#1, main_#t~mem241#1.base, main_#t~mem241#1.offset, main_#t~mem242#1.base, main_#t~mem242#1.offset, main_#t~mem243#1.base, main_#t~mem243#1.offset, main_#t~mem244#1.base, main_#t~mem244#1.offset, main_#t~mem245#1.base, main_#t~mem245#1.offset, main_#t~mem246#1.base, main_#t~mem246#1.offset, main_#t~mem247#1.base, main_#t~mem247#1.offset, main_#t~mem248#1.base, main_#t~mem248#1.offset, main_#t~mem249#1, main_#t~mem250#1.base, main_#t~mem250#1.offset, main_#t~mem251#1.base, main_#t~mem251#1.offset, main_#t~mem252#1.base, main_#t~mem252#1.offset, main_#t~mem253#1, main_#t~mem254#1.base, main_#t~mem254#1.offset, main_#t~mem255#1.base, main_#t~mem255#1.offset, main_#t~mem256#1.base, main_#t~mem256#1.offset, main_#t~mem257#1.base, main_#t~mem257#1.offset, main_#t~mem258#1.base, main_#t~mem258#1.offset, main_#t~mem259#1, main_#t~mem260#1.base, main_#t~mem260#1.offset, main_#t~mem263#1, main_#t~mem261#1.base, main_#t~mem261#1.offset, main_#t~mem262#1, main_#t~mem264#1.base, main_#t~mem264#1.offset, main_#t~mem265#1.base, main_#t~mem265#1.offset, main_#t~mem266#1, main_#t~post267#1, main_#t~mem268#1.base, main_#t~mem268#1.offset, main_#t~mem269#1.base, main_#t~mem269#1.offset, main_#t~mem270#1.base, main_#t~mem270#1.offset, main_#t~mem271#1.base, main_#t~mem271#1.offset, main_#t~mem272#1.base, main_#t~mem272#1.offset, main_#t~mem273#1.base, main_#t~mem273#1.offset, main_#t~mem274#1.base, main_#t~mem274#1.offset, main_#t~mem275#1.base, main_#t~mem275#1.offset, main_~_hd_head~1#1.base, main_~_hd_head~1#1.offset, main_#t~mem276#1.base, main_#t~mem276#1.offset, main_#t~mem277#1, main_#t~post278#1, main_~_hd_bkt~1#1, main_~_hd_hh_del~1#1.base, main_~_hd_hh_del~1#1.offset, main_#t~ite237#1.base, main_#t~ite237#1.offset, main_#t~mem236#1.base, main_#t~mem236#1.offset, main_~#i~0#1.base, main_~#i~0#1.offset, main_~user~0#1.base, main_~user~0#1.offset, main_~tmp~0#1.base, main_~tmp~0#1.offset, main_~users~0#1.base, main_~users~0#1.offset, main_~temp~0#1.base, main_~temp~0#1.offset;call main_~#i~0#1.base, main_~#i~0#1.offset := #Ultimate.allocOnStack(4);havoc main_~user~0#1.base, main_~user~0#1.offset;havoc main_~tmp~0#1.base, main_~tmp~0#1.offset;main_~users~0#1.base, main_~users~0#1.offset := 0, 0;call write~int(0, main_~#i~0#1.base, main_~#i~0#1.offset, 4); {4671#true} is VALID [2022-02-20 23:33:06,357 INFO L290 TraceCheckUtils]: 2: Hoare triple {4671#true} call main_#t~mem7#1 := read~int(main_~#i~0#1.base, main_~#i~0#1.offset, 4); {4671#true} is VALID [2022-02-20 23:33:06,357 INFO L290 TraceCheckUtils]: 3: Hoare triple {4671#true} assume !!(main_#t~mem7#1 < 10);havoc main_#t~mem7#1;call main_#t~malloc8#1.base, main_#t~malloc8#1.offset := #Ultimate.allocOnHeap(40);main_~user~0#1.base, main_~user~0#1.offset := main_#t~malloc8#1.base, main_#t~malloc8#1.offset;havoc main_#t~malloc8#1.base, main_#t~malloc8#1.offset; {4671#true} is VALID [2022-02-20 23:33:06,357 INFO L290 TraceCheckUtils]: 4: Hoare triple {4671#true} assume !(main_~user~0#1.base == 0 && main_~user~0#1.offset == 0); {4671#true} is VALID [2022-02-20 23:33:06,357 INFO L290 TraceCheckUtils]: 5: Hoare triple {4671#true} call main_#t~mem9#1 := read~int(main_~#i~0#1.base, main_~#i~0#1.offset, 4);call write~int(main_#t~mem9#1, main_~user~0#1.base, main_~user~0#1.offset, 4);havoc main_#t~mem9#1;call main_#t~mem10#1 := read~int(main_~#i~0#1.base, main_~#i~0#1.offset, 4);call main_#t~mem11#1 := read~int(main_~#i~0#1.base, main_~#i~0#1.offset, 4);call write~int(main_#t~mem10#1 * main_#t~mem11#1, main_~user~0#1.base, 4 + main_~user~0#1.offset, 4);havoc main_#t~mem10#1;havoc main_#t~mem11#1; {4671#true} is VALID [2022-02-20 23:33:06,357 INFO L290 TraceCheckUtils]: 6: Hoare triple {4671#true} havoc main_~_ha_hashv~0#1; {4671#true} is VALID [2022-02-20 23:33:06,358 INFO L290 TraceCheckUtils]: 7: Hoare triple {4671#true} goto; {4671#true} is VALID [2022-02-20 23:33:06,367 INFO L290 TraceCheckUtils]: 8: Hoare triple {4671#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; {4700#(<= |ULTIMATE.start_main_~_hj_k~0#1| 4)} is VALID [2022-02-20 23:33:06,368 INFO L290 TraceCheckUtils]: 9: Hoare triple {4700#(<= |ULTIMATE.start_main_~_hj_k~0#1| 4)} assume !(main_~_hj_k~0#1 % 4294967296 >= 12); {4700#(<= |ULTIMATE.start_main_~_hj_k~0#1| 4)} is VALID [2022-02-20 23:33:06,368 INFO L290 TraceCheckUtils]: 10: Hoare triple {4700#(<= |ULTIMATE.start_main_~_hj_k~0#1| 4)} main_~_ha_hashv~0#1 := 4 + main_~_ha_hashv~0#1;main_#t~switch24#1 := 11 == main_~_hj_k~0#1; {4707#(not |ULTIMATE.start_main_#t~switch24#1|)} is VALID [2022-02-20 23:33:06,368 INFO L290 TraceCheckUtils]: 11: Hoare triple {4707#(not |ULTIMATE.start_main_#t~switch24#1|)} assume main_#t~switch24#1;call main_#t~mem25#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~mem25#1 % 256);havoc main_#t~mem25#1; {4672#false} is VALID [2022-02-20 23:33:06,369 INFO L290 TraceCheckUtils]: 12: Hoare triple {4672#false} main_#t~switch24#1 := main_#t~switch24#1 || 10 == main_~_hj_k~0#1; {4672#false} is VALID [2022-02-20 23:33:06,369 INFO L290 TraceCheckUtils]: 13: Hoare triple {4672#false} assume main_#t~switch24#1;call main_#t~mem26#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~mem26#1 % 256);havoc main_#t~mem26#1; {4672#false} is VALID [2022-02-20 23:33:06,369 INFO L290 TraceCheckUtils]: 14: Hoare triple {4672#false} main_#t~switch24#1 := main_#t~switch24#1 || 9 == main_~_hj_k~0#1; {4672#false} is VALID [2022-02-20 23:33:06,369 INFO L290 TraceCheckUtils]: 15: Hoare triple {4672#false} assume main_#t~switch24#1;call main_#t~mem27#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~mem27#1 % 256);havoc main_#t~mem27#1; {4672#false} is VALID [2022-02-20 23:33:06,369 INFO L290 TraceCheckUtils]: 16: Hoare triple {4672#false} main_#t~switch24#1 := main_#t~switch24#1 || 8 == main_~_hj_k~0#1; {4672#false} is VALID [2022-02-20 23:33:06,369 INFO L290 TraceCheckUtils]: 17: Hoare triple {4672#false} assume main_#t~switch24#1;call main_#t~mem28#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~mem28#1 % 256);havoc main_#t~mem28#1; {4672#false} is VALID [2022-02-20 23:33:06,369 INFO L290 TraceCheckUtils]: 18: Hoare triple {4672#false} main_#t~switch24#1 := main_#t~switch24#1 || 7 == main_~_hj_k~0#1; {4672#false} is VALID [2022-02-20 23:33:06,369 INFO L290 TraceCheckUtils]: 19: Hoare triple {4672#false} assume main_#t~switch24#1;call main_#t~mem29#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~mem29#1 % 256);havoc main_#t~mem29#1; {4672#false} is VALID [2022-02-20 23:33:06,369 INFO L290 TraceCheckUtils]: 20: Hoare triple {4672#false} main_#t~switch24#1 := main_#t~switch24#1 || 6 == main_~_hj_k~0#1; {4672#false} is VALID [2022-02-20 23:33:06,370 INFO L290 TraceCheckUtils]: 21: Hoare triple {4672#false} assume main_#t~switch24#1;call main_#t~mem30#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~mem30#1 % 256);havoc main_#t~mem30#1; {4672#false} is VALID [2022-02-20 23:33:06,370 INFO L290 TraceCheckUtils]: 22: Hoare triple {4672#false} main_#t~switch24#1 := main_#t~switch24#1 || 5 == main_~_hj_k~0#1; {4672#false} is VALID [2022-02-20 23:33:06,370 INFO L290 TraceCheckUtils]: 23: Hoare triple {4672#false} assume main_#t~switch24#1;call main_#t~mem31#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~mem31#1 % 256;havoc main_#t~mem31#1; {4672#false} is VALID [2022-02-20 23:33:06,370 INFO L290 TraceCheckUtils]: 24: Hoare triple {4672#false} main_#t~switch24#1 := main_#t~switch24#1 || 4 == main_~_hj_k~0#1; {4672#false} is VALID [2022-02-20 23:33:06,370 INFO L290 TraceCheckUtils]: 25: Hoare triple {4672#false} assume main_#t~switch24#1;call main_#t~mem32#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~mem32#1 % 256);havoc main_#t~mem32#1; {4672#false} is VALID [2022-02-20 23:33:06,370 INFO L290 TraceCheckUtils]: 26: Hoare triple {4672#false} main_#t~switch24#1 := main_#t~switch24#1 || 3 == main_~_hj_k~0#1; {4672#false} is VALID [2022-02-20 23:33:06,370 INFO L290 TraceCheckUtils]: 27: Hoare triple {4672#false} assume main_#t~switch24#1;call main_#t~mem33#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~mem33#1 % 256);havoc main_#t~mem33#1; {4672#false} is VALID [2022-02-20 23:33:06,370 INFO L290 TraceCheckUtils]: 28: Hoare triple {4672#false} main_#t~switch24#1 := main_#t~switch24#1 || 2 == main_~_hj_k~0#1; {4672#false} is VALID [2022-02-20 23:33:06,370 INFO L290 TraceCheckUtils]: 29: Hoare triple {4672#false} assume main_#t~switch24#1;call main_#t~mem34#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~mem34#1 % 256);havoc main_#t~mem34#1; {4672#false} is VALID [2022-02-20 23:33:06,371 INFO L290 TraceCheckUtils]: 30: Hoare triple {4672#false} main_#t~switch24#1 := main_#t~switch24#1 || 1 == main_~_hj_k~0#1; {4672#false} is VALID [2022-02-20 23:33:06,371 INFO L290 TraceCheckUtils]: 31: Hoare triple {4672#false} assume main_#t~switch24#1;call main_#t~mem35#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~mem35#1 % 256;havoc main_#t~mem35#1; {4672#false} is VALID [2022-02-20 23:33:06,371 INFO L290 TraceCheckUtils]: 32: Hoare triple {4672#false} havoc main_#t~switch24#1; {4672#false} is VALID [2022-02-20 23:33:06,371 INFO L290 TraceCheckUtils]: 33: Hoare triple {4672#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)))); {4672#false} is VALID [2022-02-20 23:33:06,371 INFO L290 TraceCheckUtils]: 34: Hoare triple {4672#false} goto; {4672#false} is VALID [2022-02-20 23:33:06,371 INFO L290 TraceCheckUtils]: 35: Hoare triple {4672#false} goto; {4672#false} is VALID [2022-02-20 23:33:06,371 INFO L290 TraceCheckUtils]: 36: Hoare triple {4672#false} goto; {4672#false} is VALID [2022-02-20 23:33:06,372 INFO L290 TraceCheckUtils]: 37: Hoare triple {4672#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); {4672#false} is VALID [2022-02-20 23:33:06,372 INFO L290 TraceCheckUtils]: 38: Hoare triple {4672#false} assume !(main_~users~0#1.base == 0 && main_~users~0#1.offset == 0);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 write~$Pointer$(main_#t~mem53#1.base, main_#t~mem53#1.offset, main_~user~0#1.base, 8 + main_~user~0#1.offset, 4);havoc main_#t~mem53#1.base, main_#t~mem53#1.offset; {4672#false} is VALID [2022-02-20 23:33:06,372 INFO L290 TraceCheckUtils]: 39: Hoare triple {4672#false} call write~$Pointer$(0, 0, main_~user~0#1.base, 16 + main_~user~0#1.offset, 4);call main_#t~mem54#1.base, main_#t~mem54#1.offset := read~$Pointer$(main_~users~0#1.base, 8 + main_~users~0#1.offset, 4);call main_#t~mem55#1.base, main_#t~mem55#1.offset := read~$Pointer$(main_#t~mem54#1.base, 16 + main_#t~mem54#1.offset, 4);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, 20 + main_#t~mem56#1.offset, 4);call write~$Pointer$(main_#t~mem55#1.base, main_#t~mem55#1.offset - main_#t~mem57#1, main_~user~0#1.base, 12 + main_~user~0#1.offset, 4);havoc main_#t~mem54#1.base, main_#t~mem54#1.offset;havoc main_#t~mem55#1.base, main_#t~mem55#1.offset;havoc main_#t~mem56#1.base, main_#t~mem56#1.offset;havoc main_#t~mem57#1;call main_#t~mem58#1.base, main_#t~mem58#1.offset := read~$Pointer$(main_~users~0#1.base, 8 + main_~users~0#1.offset, 4);call main_#t~mem59#1.base, main_#t~mem59#1.offset := read~$Pointer$(main_#t~mem58#1.base, 16 + main_#t~mem58#1.offset, 4);call write~$Pointer$(main_~user~0#1.base, main_~user~0#1.offset, main_#t~mem59#1.base, 8 + main_#t~mem59#1.offset, 4);havoc main_#t~mem58#1.base, main_#t~mem58#1.offset;havoc main_#t~mem59#1.base, main_#t~mem59#1.offset;call main_#t~mem60#1.base, main_#t~mem60#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~mem60#1.base, 16 + main_#t~mem60#1.offset, 4);havoc main_#t~mem60#1.base, main_#t~mem60#1.offset; {4672#false} is VALID [2022-02-20 23:33:06,372 INFO L290 TraceCheckUtils]: 40: Hoare triple {4672#false} goto; {4672#false} is VALID [2022-02-20 23:33:06,372 INFO L290 TraceCheckUtils]: 41: Hoare triple {4672#false} havoc main_~_ha_bkt~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 := read~int(main_#t~mem61#1.base, 12 + main_#t~mem61#1.offset, 4);main_#t~post63#1 := main_#t~mem62#1;call write~int(1 + main_#t~post63#1, main_#t~mem61#1.base, 12 + main_#t~mem61#1.offset, 4);havoc main_#t~mem61#1.base, main_#t~mem61#1.offset;havoc main_#t~mem62#1;havoc main_#t~post63#1; {4672#false} is VALID [2022-02-20 23:33:06,372 INFO L290 TraceCheckUtils]: 42: Hoare triple {4672#false} call main_#t~mem64#1.base, main_#t~mem64#1.offset := read~$Pointer$(main_~users~0#1.base, 8 + main_~users~0#1.offset, 4);call main_#t~mem65#1 := read~int(main_#t~mem64#1.base, 4 + main_#t~mem64#1.offset, 4);main_~_ha_bkt~0#1 := (if 0 == main_~_ha_hashv~0#1 || 0 == main_#t~mem65#1 - 1 then 0 else (if 1 == main_#t~mem65#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~mem65#1 - 1))) else (if 1 == main_~_ha_hashv~0#1 then (if 1 == main_#t~mem65#1 - 1 || 0 == main_#t~mem65#1 - 1 then main_#t~mem65#1 - 1 else (if main_#t~mem65#1 - 1 >= 0 then (main_#t~mem65#1 - 1) % 2 else ~bitwiseAnd(main_~_ha_hashv~0#1, main_#t~mem65#1 - 1))) else ~bitwiseAnd(main_~_ha_hashv~0#1, main_#t~mem65#1 - 1))));havoc main_#t~mem64#1.base, main_#t~mem64#1.offset;havoc main_#t~mem65#1; {4672#false} is VALID [2022-02-20 23:33:06,372 INFO L290 TraceCheckUtils]: 43: Hoare triple {4672#false} goto; {4672#false} is VALID [2022-02-20 23:33:06,372 INFO L290 TraceCheckUtils]: 44: Hoare triple {4672#false} call main_#t~mem66#1.base, main_#t~mem66#1.offset := read~$Pointer$(main_~users~0#1.base, 8 + main_~users~0#1.offset, 4);call main_#t~mem67#1.base, main_#t~mem67#1.offset := read~$Pointer$(main_#t~mem66#1.base, main_#t~mem66#1.offset, 4);main_~_ha_head~0#1.base, main_~_ha_head~0#1.offset := main_#t~mem67#1.base, main_#t~mem67#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~mem66#1.base, main_#t~mem66#1.offset;havoc main_#t~mem67#1.base, main_#t~mem67#1.offset;call main_#t~mem68#1 := read~int(main_~_ha_head~0#1.base, 4 + main_~_ha_head~0#1.offset, 4);main_#t~post69#1 := main_#t~mem68#1;call write~int(1 + main_#t~post69#1, main_~_ha_head~0#1.base, 4 + main_~_ha_head~0#1.offset, 4);havoc main_#t~mem68#1;havoc main_#t~post69#1;call main_#t~mem70#1.base, main_#t~mem70#1.offset := read~$Pointer$(main_~_ha_head~0#1.base, main_~_ha_head~0#1.offset, 4);call write~$Pointer$(main_#t~mem70#1.base, main_#t~mem70#1.offset, main_~user~0#1.base, 24 + main_~user~0#1.offset, 4);havoc main_#t~mem70#1.base, main_#t~mem70#1.offset;call write~$Pointer$(0, 0, main_~user~0#1.base, 20 + main_~user~0#1.offset, 4);call main_#t~mem71#1.base, main_#t~mem71#1.offset := read~$Pointer$(main_~_ha_head~0#1.base, main_~_ha_head~0#1.offset, 4); {4672#false} is VALID [2022-02-20 23:33:06,372 INFO L290 TraceCheckUtils]: 45: Hoare triple {4672#false} assume main_#t~mem71#1.base != 0 || main_#t~mem71#1.offset != 0;havoc main_#t~mem71#1.base, main_#t~mem71#1.offset;call main_#t~mem72#1.base, main_#t~mem72#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~mem72#1.base, 12 + main_#t~mem72#1.offset, 4);havoc main_#t~mem72#1.base, main_#t~mem72#1.offset; {4672#false} is VALID [2022-02-20 23:33:06,372 INFO L290 TraceCheckUtils]: 46: Hoare triple {4672#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~mem74#1 := read~int(main_~_ha_head~0#1.base, 4 + main_~_ha_head~0#1.offset, 4);call main_#t~mem73#1 := read~int(main_~_ha_head~0#1.base, 8 + main_~_ha_head~0#1.offset, 4);main_#t~short77#1 := main_#t~mem74#1 % 4294967296 >= 10 * (1 + main_#t~mem73#1) % 4294967296; {4672#false} is VALID [2022-02-20 23:33:06,373 INFO L290 TraceCheckUtils]: 47: Hoare triple {4672#false} assume !main_#t~short77#1; {4672#false} is VALID [2022-02-20 23:33:06,373 INFO L290 TraceCheckUtils]: 48: Hoare triple {4672#false} assume !main_#t~short77#1;havoc main_#t~mem74#1;havoc main_#t~mem73#1;havoc main_#t~mem75#1.base, main_#t~mem75#1.offset;havoc main_#t~mem76#1;havoc main_#t~short77#1; {4672#false} is VALID [2022-02-20 23:33:06,373 INFO L290 TraceCheckUtils]: 49: Hoare triple {4672#false} goto; {4672#false} is VALID [2022-02-20 23:33:06,373 INFO L290 TraceCheckUtils]: 50: Hoare triple {4672#false} goto; {4672#false} is VALID [2022-02-20 23:33:06,373 INFO L290 TraceCheckUtils]: 51: Hoare triple {4672#false} goto; {4672#false} is VALID [2022-02-20 23:33:06,373 INFO L290 TraceCheckUtils]: 52: Hoare triple {4672#false} goto; {4672#false} is VALID [2022-02-20 23:33:06,373 INFO L290 TraceCheckUtils]: 53: Hoare triple {4672#false} call main_#t~mem144#1.base, main_#t~mem144#1.offset := read~$Pointer$(main_~user~0#1.base, 8 + main_~user~0#1.offset, 4);call main_#t~mem145#1 := read~int(main_#t~mem144#1.base, 12 + main_#t~mem144#1.offset, 4); {4672#false} is VALID [2022-02-20 23:33:06,373 INFO L272 TraceCheckUtils]: 54: Hoare triple {4672#false} call test_int((if main_#t~mem145#1 % 4294967296 % 4294967296 <= 2147483647 then main_#t~mem145#1 % 4294967296 % 4294967296 else main_#t~mem145#1 % 4294967296 % 4294967296 - 4294967296)); {4672#false} is VALID [2022-02-20 23:33:06,373 INFO L290 TraceCheckUtils]: 55: Hoare triple {4672#false} ~a := #in~a;#t~post3 := ~count_int~0;~count_int~0 := 1 + #t~post3;#t~switch4 := 0 == #t~post3; {4672#false} is VALID [2022-02-20 23:33:06,374 INFO L290 TraceCheckUtils]: 56: Hoare triple {4672#false} assume #t~switch4; {4672#false} is VALID [2022-02-20 23:33:06,374 INFO L272 TraceCheckUtils]: 57: Hoare triple {4672#false} call __VERIFIER_assert((if 1 == ~a then 1 else 0)); {4672#false} is VALID [2022-02-20 23:33:06,374 INFO L290 TraceCheckUtils]: 58: Hoare triple {4672#false} ~cond := #in~cond; {4672#false} is VALID [2022-02-20 23:33:06,374 INFO L290 TraceCheckUtils]: 59: Hoare triple {4672#false} assume 0 == ~cond; {4672#false} is VALID [2022-02-20 23:33:06,374 INFO L290 TraceCheckUtils]: 60: Hoare triple {4672#false} assume !false; {4672#false} is VALID [2022-02-20 23:33:06,374 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-20 23:33:06,374 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 23:33:06,374 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 23:33:06,374 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2134030216] [2022-02-20 23:33:06,374 WARN L317 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-02-20 23:33:06,375 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1852024946] [2022-02-20 23:33:06,375 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1852024946] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:33:06,375 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:33:06,375 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-02-20 23:33:06,375 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1682000271] [2022-02-20 23:33:06,375 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:33:06,375 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 14.75) internal successors, (59), 4 states have internal predecessors, (59), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 61 [2022-02-20 23:33:06,376 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:33:06,376 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 14.75) internal successors, (59), 4 states have internal predecessors, (59), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:33:06,419 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-20 23:33:06,420 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-02-20 23:33:06,420 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 23:33:06,420 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-02-20 23:33:06,420 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-02-20 23:33:06,420 INFO L87 Difference]: Start difference. First operand 244 states and 329 transitions. Second operand has 4 states, 4 states have (on average 14.75) internal successors, (59), 4 states have internal predecessors, (59), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:33:07,131 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:33:07,132 INFO L93 Difference]: Finished difference Result 476 states and 646 transitions. [2022-02-20 23:33:07,132 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-02-20 23:33:07,132 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 14.75) internal successors, (59), 4 states have internal predecessors, (59), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 61 [2022-02-20 23:33:07,132 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:33:07,132 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 14.75) internal successors, (59), 4 states have internal predecessors, (59), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:33:07,136 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 623 transitions. [2022-02-20 23:33:07,136 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 14.75) internal successors, (59), 4 states have internal predecessors, (59), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:33:07,140 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 623 transitions. [2022-02-20 23:33:07,140 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 623 transitions. [2022-02-20 23:33:07,582 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 623 edges. 623 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:33:07,586 INFO L225 Difference]: With dead ends: 476 [2022-02-20 23:33:07,586 INFO L226 Difference]: Without dead ends: 236 [2022-02-20 23:33:07,587 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 58 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-20 23:33:07,587 INFO L933 BasicCegarLoop]: 287 mSDtfsCounter, 213 mSDsluCounter, 360 mSDsCounter, 0 mSdLazyCounter, 42 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 218 SdHoareTripleChecker+Valid, 647 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-20 23:33:07,588 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [218 Valid, 647 Invalid, 66 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 42 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 23:33:07,588 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 236 states. [2022-02-20 23:33:07,606 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 236 to 230. [2022-02-20 23:33:07,606 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:33:07,607 INFO L82 GeneralOperation]: Start isEquivalent. First operand 236 states. Second operand has 230 states, 205 states have (on average 1.3073170731707318) internal successors, (268), 221 states have internal predecessors, (268), 20 states have call successors, (20), 3 states have call predecessors, (20), 3 states have return successors, (20), 6 states have call predecessors, (20), 20 states have call successors, (20) [2022-02-20 23:33:07,607 INFO L74 IsIncluded]: Start isIncluded. First operand 236 states. Second operand has 230 states, 205 states have (on average 1.3073170731707318) internal successors, (268), 221 states have internal predecessors, (268), 20 states have call successors, (20), 3 states have call predecessors, (20), 3 states have return successors, (20), 6 states have call predecessors, (20), 20 states have call successors, (20) [2022-02-20 23:33:07,608 INFO L87 Difference]: Start difference. First operand 236 states. Second operand has 230 states, 205 states have (on average 1.3073170731707318) internal successors, (268), 221 states have internal predecessors, (268), 20 states have call successors, (20), 3 states have call predecessors, (20), 3 states have return successors, (20), 6 states have call predecessors, (20), 20 states have call successors, (20) [2022-02-20 23:33:07,611 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:33:07,612 INFO L93 Difference]: Finished difference Result 236 states and 314 transitions. [2022-02-20 23:33:07,612 INFO L276 IsEmpty]: Start isEmpty. Operand 236 states and 314 transitions. [2022-02-20 23:33:07,612 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:33:07,612 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:33:07,613 INFO L74 IsIncluded]: Start isIncluded. First operand has 230 states, 205 states have (on average 1.3073170731707318) internal successors, (268), 221 states have internal predecessors, (268), 20 states have call successors, (20), 3 states have call predecessors, (20), 3 states have return successors, (20), 6 states have call predecessors, (20), 20 states have call successors, (20) Second operand 236 states. [2022-02-20 23:33:07,613 INFO L87 Difference]: Start difference. First operand has 230 states, 205 states have (on average 1.3073170731707318) internal successors, (268), 221 states have internal predecessors, (268), 20 states have call successors, (20), 3 states have call predecessors, (20), 3 states have return successors, (20), 6 states have call predecessors, (20), 20 states have call successors, (20) Second operand 236 states. [2022-02-20 23:33:07,618 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:33:07,618 INFO L93 Difference]: Finished difference Result 236 states and 314 transitions. [2022-02-20 23:33:07,618 INFO L276 IsEmpty]: Start isEmpty. Operand 236 states and 314 transitions. [2022-02-20 23:33:07,619 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:33:07,619 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:33:07,619 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:33:07,619 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:33:07,619 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 230 states, 205 states have (on average 1.3073170731707318) internal successors, (268), 221 states have internal predecessors, (268), 20 states have call successors, (20), 3 states have call predecessors, (20), 3 states have return successors, (20), 6 states have call predecessors, (20), 20 states have call successors, (20) [2022-02-20 23:33:07,623 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 230 states to 230 states and 308 transitions. [2022-02-20 23:33:07,623 INFO L78 Accepts]: Start accepts. Automaton has 230 states and 308 transitions. Word has length 61 [2022-02-20 23:33:07,623 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:33:07,623 INFO L470 AbstractCegarLoop]: Abstraction has 230 states and 308 transitions. [2022-02-20 23:33:07,624 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.75) internal successors, (59), 4 states have internal predecessors, (59), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:33:07,624 INFO L276 IsEmpty]: Start isEmpty. Operand 230 states and 308 transitions. [2022-02-20 23:33:07,624 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2022-02-20 23:33:07,624 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:33:07,625 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-20 23:33:07,644 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-20 23:33:07,836 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,SelfDestructingSolverStorable3 [2022-02-20 23:33:07,836 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 23:33:07,836 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:33:07,836 INFO L85 PathProgramCache]: Analyzing trace with hash 933653125, now seen corresponding path program 1 times [2022-02-20 23:33:07,837 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 23:33:07,837 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2032842192] [2022-02-20 23:33:07,837 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:33:07,837 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 23:33:07,947 ERROR L252 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-02-20 23:33:07,947 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1399087702] [2022-02-20 23:33:07,947 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:33:07,947 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 23:33:07,947 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 23:33:07,948 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-20 23:33:07,973 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-20 23:33:08,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:33:08,499 INFO L263 TraceCheckSpWp]: Trace formula consists of 1547 conjuncts, 5 conjunts are in the unsatisfiable core [2022-02-20 23:33:08,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:33:08,533 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 23:33:08,817 INFO L290 TraceCheckUtils]: 0: Hoare triple {6198#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~0 := 0; {6198#true} is VALID [2022-02-20 23:33:08,818 INFO L290 TraceCheckUtils]: 1: Hoare triple {6198#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc8#1.base, main_#t~malloc8#1.offset, main_#t~mem9#1, main_#t~mem10#1, main_#t~mem11#1, main_#t~mem13#1, main_#t~mem12#1, main_#t~mem14#1, main_#t~mem15#1, main_#t~mem17#1, main_#t~mem16#1, main_#t~mem18#1, main_#t~mem19#1, main_#t~mem21#1, main_#t~mem20#1, main_#t~mem22#1, main_#t~mem23#1, main_#t~switch24#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_#t~mem31#1, main_#t~mem32#1, main_#t~mem33#1, main_#t~mem34#1, main_#t~mem35#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~malloc36#1.base, main_#t~malloc36#1.offset, main_#t~mem37#1.base, main_#t~mem37#1.offset, main_#t~mem38#1.base, main_#t~mem38#1.offset, main_#t~memset~res39#1.base, main_#t~memset~res39#1.offset, main_#t~mem40#1.base, main_#t~mem40#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~malloc45#1.base, main_#t~malloc45#1.offset, main_#t~mem46#1.base, main_#t~mem46#1.offset, main_#t~mem47#1.base, main_#t~mem47#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~memset~res52#1.base, main_#t~memset~res52#1.offset, 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~mem58#1.base, main_#t~mem58#1.offset, main_#t~mem59#1.base, main_#t~mem59#1.offset, main_#t~mem60#1.base, main_#t~mem60#1.offset, main_#t~mem61#1.base, main_#t~mem61#1.offset, main_#t~mem62#1, main_#t~post63#1, main_#t~mem64#1.base, main_#t~mem64#1.offset, main_#t~mem65#1, main_#t~mem66#1.base, main_#t~mem66#1.offset, main_#t~mem67#1.base, main_#t~mem67#1.offset, main_#t~mem68#1, main_#t~post69#1, main_#t~mem70#1.base, main_#t~mem70#1.offset, main_#t~mem71#1.base, main_#t~mem71#1.offset, main_#t~mem72#1.base, main_#t~mem72#1.offset, main_#t~mem74#1, main_#t~mem73#1, main_#t~mem75#1.base, main_#t~mem75#1.offset, main_#t~mem76#1, main_#t~short77#1, main_#t~mem78#1.base, main_#t~mem78#1.offset, main_#t~mem79#1, main_#t~malloc80#1.base, main_#t~malloc80#1.offset, main_#t~mem81#1.base, main_#t~mem81#1.offset, main_#t~mem82#1.base, main_#t~mem82#1.offset, main_#t~mem83#1.base, main_#t~mem83#1.offset, main_#t~mem84#1, main_#t~memset~res85#1.base, main_#t~memset~res85#1.offset, main_#t~mem86#1.base, main_#t~mem86#1.offset, main_#t~mem87#1.base, main_#t~mem87#1.offset, main_#t~mem90#1, main_#t~mem88#1.base, main_#t~mem88#1.offset, main_#t~mem89#1, main_#t~mem91#1.base, main_#t~mem91#1.offset, main_#t~mem94#1, main_#t~mem92#1.base, main_#t~mem92#1.offset, main_#t~mem93#1, main_#t~ite95#1, main_#t~mem96#1.base, main_#t~mem96#1.offset, main_#t~mem100#1.base, main_#t~mem100#1.offset, main_#t~mem101#1.base, main_#t~mem101#1.offset, main_#t~mem102#1.base, main_#t~mem102#1.offset, main_#t~mem103#1.base, main_#t~mem103#1.offset, main_#t~mem106#1, main_#t~mem104#1.base, main_#t~mem104#1.offset, main_#t~mem105#1, main_#t~mem107#1.base, main_#t~mem107#1.offset, main_#t~mem108#1, main_#t~pre109#1, main_#t~mem110#1.base, main_#t~mem110#1.offset, main_#t~mem111#1, main_#t~mem112#1.base, main_#t~mem112#1.offset, main_#t~mem113#1, main_#t~post114#1, main_#t~mem118#1, main_#t~mem116#1, main_#t~mem115#1.base, main_#t~mem115#1.offset, main_#t~mem117#1, main_#t~mem119#1, main_#t~post120#1, main_#t~mem121#1.base, main_#t~mem121#1.offset, main_#t~mem122#1.base, main_#t~mem122#1.offset, main_#t~mem123#1.base, main_#t~mem123#1.offset, main_#t~post97#1, main_#t~mem98#1.base, main_#t~mem98#1.offset, main_#t~mem99#1, main_#t~mem124#1.base, main_#t~mem124#1.offset, main_#t~mem125#1.base, main_#t~mem125#1.offset, main_#t~mem126#1.base, main_#t~mem126#1.offset, main_#t~mem127#1, main_#t~mem128#1.base, main_#t~mem128#1.offset, main_#t~mem129#1, main_#t~post130#1, main_#t~mem131#1.base, main_#t~mem131#1.offset, main_#t~mem132#1.base, main_#t~mem132#1.offset, main_#t~mem133#1.base, main_#t~mem133#1.offset, main_#t~mem134#1.base, main_#t~mem134#1.offset, main_#t~mem137#1, main_#t~mem135#1.base, main_#t~mem135#1.offset, main_#t~mem136#1, main_#t~ite140#1, main_#t~mem138#1.base, main_#t~mem138#1.offset, main_#t~mem139#1, main_#t~mem141#1.base, main_#t~mem141#1.offset, main_#t~mem142#1, main_#t~mem143#1.base, main_#t~mem143#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~mem144#1.base, main_#t~mem144#1.offset, main_#t~mem145#1, main_#t~mem5#1, main_#t~post6#1, main_#t~mem7#1, main_#t~mem149#1, main_#t~mem148#1, main_#t~mem150#1, main_#t~mem151#1, main_#t~mem153#1, main_#t~mem152#1, main_#t~mem154#1, main_#t~mem155#1, main_#t~mem157#1, main_#t~mem156#1, main_#t~mem158#1, main_#t~mem159#1, main_#t~switch160#1, main_#t~mem161#1, main_#t~mem162#1, main_#t~mem163#1, main_#t~mem164#1, main_#t~mem165#1, main_#t~mem166#1, main_#t~mem167#1, main_#t~mem168#1, main_#t~mem169#1, main_#t~mem170#1, main_#t~mem171#1, main_~_hj_i~1#1, main_~_hj_j~1#1, main_~_hj_k~1#1, main_~_hj_key~1#1.base, main_~_hj_key~1#1.offset, main_#t~mem172#1.base, main_#t~mem172#1.offset, main_#t~mem173#1, main_#t~mem174#1.base, main_#t~mem174#1.offset, main_#t~mem175#1.base, main_#t~mem175#1.offset, main_#t~mem176#1.base, main_#t~mem176#1.offset, main_#t~mem177#1.base, main_#t~mem177#1.offset, main_#t~mem178#1.base, main_#t~mem178#1.offset, main_#t~mem179#1.base, main_#t~mem179#1.offset, main_#t~mem180#1.base, main_#t~mem180#1.offset, main_#t~mem181#1, main_#t~mem182#1, main_#t~mem183#1, main_#t~short184#1, main_#t~mem185#1.base, main_#t~mem185#1.offset, main_#t~ret186#1, main_#t~mem187#1.base, main_#t~mem187#1.offset, main_#t~mem188#1.base, main_#t~mem188#1.offset, main_#t~mem189#1.base, main_#t~mem189#1.offset, main_#t~mem190#1, main_~_hf_bkt~0#1, main_~_hf_hashv~0#1, main_#t~mem191#1.base, main_#t~mem191#1.offset, main_#t~mem192#1.base, main_#t~mem192#1.offset, main_#t~short193#1, main_#t~mem194#1.base, main_#t~mem194#1.offset, main_#t~mem195#1.base, main_#t~mem195#1.offset, main_#t~mem196#1.base, main_#t~mem196#1.offset, main_#t~mem197#1.base, main_#t~mem197#1.offset, main_#t~mem198#1.base, main_#t~mem198#1.offset, main_#t~mem199#1.base, main_#t~mem199#1.offset, main_#t~mem200#1.base, main_#t~mem200#1.offset, main_#t~mem201#1.base, main_#t~mem201#1.offset, main_#t~mem202#1, main_#t~mem203#1.base, main_#t~mem203#1.offset, main_#t~mem204#1.base, main_#t~mem204#1.offset, main_#t~mem205#1.base, main_#t~mem205#1.offset, main_#t~mem206#1, main_#t~mem207#1.base, main_#t~mem207#1.offset, main_#t~mem208#1.base, main_#t~mem208#1.offset, main_#t~mem209#1.base, main_#t~mem209#1.offset, main_#t~mem210#1.base, main_#t~mem210#1.offset, main_#t~mem211#1.base, main_#t~mem211#1.offset, main_#t~mem212#1, main_#t~mem213#1.base, main_#t~mem213#1.offset, main_#t~mem216#1, main_#t~mem214#1.base, main_#t~mem214#1.offset, main_#t~mem215#1, main_#t~mem217#1.base, main_#t~mem217#1.offset, main_#t~mem218#1.base, main_#t~mem218#1.offset, main_#t~mem219#1, main_#t~post220#1, main_#t~mem221#1.base, main_#t~mem221#1.offset, main_#t~mem222#1.base, main_#t~mem222#1.offset, main_#t~mem223#1.base, main_#t~mem223#1.offset, main_#t~mem224#1.base, main_#t~mem224#1.offset, main_#t~mem225#1.base, main_#t~mem225#1.offset, main_#t~mem226#1.base, main_#t~mem226#1.offset, main_#t~mem227#1.base, main_#t~mem227#1.offset, main_#t~mem228#1.base, main_#t~mem228#1.offset, main_~_hd_head~0#1.base, main_~_hd_head~0#1.offset, main_#t~mem229#1.base, main_#t~mem229#1.offset, main_#t~mem230#1, main_#t~post231#1, main_~_hd_bkt~0#1, main_~_hd_hh_del~0#1.base, main_~_hd_hh_del~0#1.offset, main_#t~mem232#1.base, main_#t~mem232#1.offset, main_#t~mem233#1, main_#t~mem146#1, main_#t~mem147#1, main_#t~ite235#1.base, main_#t~ite235#1.offset, main_#t~mem234#1.base, main_#t~mem234#1.offset, main_#t~mem238#1.base, main_#t~mem238#1.offset, main_#t~mem239#1.base, main_#t~mem239#1.offset, main_#t~short240#1, main_#t~mem241#1.base, main_#t~mem241#1.offset, main_#t~mem242#1.base, main_#t~mem242#1.offset, main_#t~mem243#1.base, main_#t~mem243#1.offset, main_#t~mem244#1.base, main_#t~mem244#1.offset, main_#t~mem245#1.base, main_#t~mem245#1.offset, main_#t~mem246#1.base, main_#t~mem246#1.offset, main_#t~mem247#1.base, main_#t~mem247#1.offset, main_#t~mem248#1.base, main_#t~mem248#1.offset, main_#t~mem249#1, main_#t~mem250#1.base, main_#t~mem250#1.offset, main_#t~mem251#1.base, main_#t~mem251#1.offset, main_#t~mem252#1.base, main_#t~mem252#1.offset, main_#t~mem253#1, main_#t~mem254#1.base, main_#t~mem254#1.offset, main_#t~mem255#1.base, main_#t~mem255#1.offset, main_#t~mem256#1.base, main_#t~mem256#1.offset, main_#t~mem257#1.base, main_#t~mem257#1.offset, main_#t~mem258#1.base, main_#t~mem258#1.offset, main_#t~mem259#1, main_#t~mem260#1.base, main_#t~mem260#1.offset, main_#t~mem263#1, main_#t~mem261#1.base, main_#t~mem261#1.offset, main_#t~mem262#1, main_#t~mem264#1.base, main_#t~mem264#1.offset, main_#t~mem265#1.base, main_#t~mem265#1.offset, main_#t~mem266#1, main_#t~post267#1, main_#t~mem268#1.base, main_#t~mem268#1.offset, main_#t~mem269#1.base, main_#t~mem269#1.offset, main_#t~mem270#1.base, main_#t~mem270#1.offset, main_#t~mem271#1.base, main_#t~mem271#1.offset, main_#t~mem272#1.base, main_#t~mem272#1.offset, main_#t~mem273#1.base, main_#t~mem273#1.offset, main_#t~mem274#1.base, main_#t~mem274#1.offset, main_#t~mem275#1.base, main_#t~mem275#1.offset, main_~_hd_head~1#1.base, main_~_hd_head~1#1.offset, main_#t~mem276#1.base, main_#t~mem276#1.offset, main_#t~mem277#1, main_#t~post278#1, main_~_hd_bkt~1#1, main_~_hd_hh_del~1#1.base, main_~_hd_hh_del~1#1.offset, main_#t~ite237#1.base, main_#t~ite237#1.offset, main_#t~mem236#1.base, main_#t~mem236#1.offset, main_~#i~0#1.base, main_~#i~0#1.offset, main_~user~0#1.base, main_~user~0#1.offset, main_~tmp~0#1.base, main_~tmp~0#1.offset, main_~users~0#1.base, main_~users~0#1.offset, main_~temp~0#1.base, main_~temp~0#1.offset;call main_~#i~0#1.base, main_~#i~0#1.offset := #Ultimate.allocOnStack(4);havoc main_~user~0#1.base, main_~user~0#1.offset;havoc main_~tmp~0#1.base, main_~tmp~0#1.offset;main_~users~0#1.base, main_~users~0#1.offset := 0, 0;call write~int(0, main_~#i~0#1.base, main_~#i~0#1.offset, 4); {6206#(and (= |ULTIMATE.start_main_~users~0#1.offset| 0) (= |ULTIMATE.start_main_~users~0#1.base| 0))} is VALID [2022-02-20 23:33:08,818 INFO L290 TraceCheckUtils]: 2: Hoare triple {6206#(and (= |ULTIMATE.start_main_~users~0#1.offset| 0) (= |ULTIMATE.start_main_~users~0#1.base| 0))} call main_#t~mem7#1 := read~int(main_~#i~0#1.base, main_~#i~0#1.offset, 4); {6206#(and (= |ULTIMATE.start_main_~users~0#1.offset| 0) (= |ULTIMATE.start_main_~users~0#1.base| 0))} is VALID [2022-02-20 23:33:08,819 INFO L290 TraceCheckUtils]: 3: Hoare triple {6206#(and (= |ULTIMATE.start_main_~users~0#1.offset| 0) (= |ULTIMATE.start_main_~users~0#1.base| 0))} assume !!(main_#t~mem7#1 < 10);havoc main_#t~mem7#1;call main_#t~malloc8#1.base, main_#t~malloc8#1.offset := #Ultimate.allocOnHeap(40);main_~user~0#1.base, main_~user~0#1.offset := main_#t~malloc8#1.base, main_#t~malloc8#1.offset;havoc main_#t~malloc8#1.base, main_#t~malloc8#1.offset; {6206#(and (= |ULTIMATE.start_main_~users~0#1.offset| 0) (= |ULTIMATE.start_main_~users~0#1.base| 0))} is VALID [2022-02-20 23:33:08,819 INFO L290 TraceCheckUtils]: 4: Hoare triple {6206#(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); {6206#(and (= |ULTIMATE.start_main_~users~0#1.offset| 0) (= |ULTIMATE.start_main_~users~0#1.base| 0))} is VALID [2022-02-20 23:33:08,820 INFO L290 TraceCheckUtils]: 5: Hoare triple {6206#(and (= |ULTIMATE.start_main_~users~0#1.offset| 0) (= |ULTIMATE.start_main_~users~0#1.base| 0))} call main_#t~mem9#1 := read~int(main_~#i~0#1.base, main_~#i~0#1.offset, 4);call write~int(main_#t~mem9#1, main_~user~0#1.base, main_~user~0#1.offset, 4);havoc main_#t~mem9#1;call main_#t~mem10#1 := read~int(main_~#i~0#1.base, main_~#i~0#1.offset, 4);call main_#t~mem11#1 := read~int(main_~#i~0#1.base, main_~#i~0#1.offset, 4);call write~int(main_#t~mem10#1 * main_#t~mem11#1, main_~user~0#1.base, 4 + main_~user~0#1.offset, 4);havoc main_#t~mem10#1;havoc main_#t~mem11#1; {6206#(and (= |ULTIMATE.start_main_~users~0#1.offset| 0) (= |ULTIMATE.start_main_~users~0#1.base| 0))} is VALID [2022-02-20 23:33:08,820 INFO L290 TraceCheckUtils]: 6: Hoare triple {6206#(and (= |ULTIMATE.start_main_~users~0#1.offset| 0) (= |ULTIMATE.start_main_~users~0#1.base| 0))} havoc main_~_ha_hashv~0#1; {6206#(and (= |ULTIMATE.start_main_~users~0#1.offset| 0) (= |ULTIMATE.start_main_~users~0#1.base| 0))} is VALID [2022-02-20 23:33:08,821 INFO L290 TraceCheckUtils]: 7: Hoare triple {6206#(and (= |ULTIMATE.start_main_~users~0#1.offset| 0) (= |ULTIMATE.start_main_~users~0#1.base| 0))} goto; {6206#(and (= |ULTIMATE.start_main_~users~0#1.offset| 0) (= |ULTIMATE.start_main_~users~0#1.base| 0))} is VALID [2022-02-20 23:33:08,821 INFO L290 TraceCheckUtils]: 8: Hoare triple {6206#(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; {6206#(and (= |ULTIMATE.start_main_~users~0#1.offset| 0) (= |ULTIMATE.start_main_~users~0#1.base| 0))} is VALID [2022-02-20 23:33:08,821 INFO L290 TraceCheckUtils]: 9: Hoare triple {6206#(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); {6206#(and (= |ULTIMATE.start_main_~users~0#1.offset| 0) (= |ULTIMATE.start_main_~users~0#1.base| 0))} is VALID [2022-02-20 23:33:08,822 INFO L290 TraceCheckUtils]: 10: Hoare triple {6206#(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~switch24#1 := 11 == main_~_hj_k~0#1; {6206#(and (= |ULTIMATE.start_main_~users~0#1.offset| 0) (= |ULTIMATE.start_main_~users~0#1.base| 0))} is VALID [2022-02-20 23:33:08,822 INFO L290 TraceCheckUtils]: 11: Hoare triple {6206#(and (= |ULTIMATE.start_main_~users~0#1.offset| 0) (= |ULTIMATE.start_main_~users~0#1.base| 0))} assume !main_#t~switch24#1; {6206#(and (= |ULTIMATE.start_main_~users~0#1.offset| 0) (= |ULTIMATE.start_main_~users~0#1.base| 0))} is VALID [2022-02-20 23:33:08,823 INFO L290 TraceCheckUtils]: 12: Hoare triple {6206#(and (= |ULTIMATE.start_main_~users~0#1.offset| 0) (= |ULTIMATE.start_main_~users~0#1.base| 0))} main_#t~switch24#1 := main_#t~switch24#1 || 10 == main_~_hj_k~0#1; {6206#(and (= |ULTIMATE.start_main_~users~0#1.offset| 0) (= |ULTIMATE.start_main_~users~0#1.base| 0))} is VALID [2022-02-20 23:33:08,823 INFO L290 TraceCheckUtils]: 13: Hoare triple {6206#(and (= |ULTIMATE.start_main_~users~0#1.offset| 0) (= |ULTIMATE.start_main_~users~0#1.base| 0))} assume !main_#t~switch24#1; {6206#(and (= |ULTIMATE.start_main_~users~0#1.offset| 0) (= |ULTIMATE.start_main_~users~0#1.base| 0))} is VALID [2022-02-20 23:33:08,824 INFO L290 TraceCheckUtils]: 14: Hoare triple {6206#(and (= |ULTIMATE.start_main_~users~0#1.offset| 0) (= |ULTIMATE.start_main_~users~0#1.base| 0))} main_#t~switch24#1 := main_#t~switch24#1 || 9 == main_~_hj_k~0#1; {6206#(and (= |ULTIMATE.start_main_~users~0#1.offset| 0) (= |ULTIMATE.start_main_~users~0#1.base| 0))} is VALID [2022-02-20 23:33:08,824 INFO L290 TraceCheckUtils]: 15: Hoare triple {6206#(and (= |ULTIMATE.start_main_~users~0#1.offset| 0) (= |ULTIMATE.start_main_~users~0#1.base| 0))} assume !main_#t~switch24#1; {6206#(and (= |ULTIMATE.start_main_~users~0#1.offset| 0) (= |ULTIMATE.start_main_~users~0#1.base| 0))} is VALID [2022-02-20 23:33:08,824 INFO L290 TraceCheckUtils]: 16: Hoare triple {6206#(and (= |ULTIMATE.start_main_~users~0#1.offset| 0) (= |ULTIMATE.start_main_~users~0#1.base| 0))} main_#t~switch24#1 := main_#t~switch24#1 || 8 == main_~_hj_k~0#1; {6206#(and (= |ULTIMATE.start_main_~users~0#1.offset| 0) (= |ULTIMATE.start_main_~users~0#1.base| 0))} is VALID [2022-02-20 23:33:08,825 INFO L290 TraceCheckUtils]: 17: Hoare triple {6206#(and (= |ULTIMATE.start_main_~users~0#1.offset| 0) (= |ULTIMATE.start_main_~users~0#1.base| 0))} assume !main_#t~switch24#1; {6206#(and (= |ULTIMATE.start_main_~users~0#1.offset| 0) (= |ULTIMATE.start_main_~users~0#1.base| 0))} is VALID [2022-02-20 23:33:08,825 INFO L290 TraceCheckUtils]: 18: Hoare triple {6206#(and (= |ULTIMATE.start_main_~users~0#1.offset| 0) (= |ULTIMATE.start_main_~users~0#1.base| 0))} main_#t~switch24#1 := main_#t~switch24#1 || 7 == main_~_hj_k~0#1; {6206#(and (= |ULTIMATE.start_main_~users~0#1.offset| 0) (= |ULTIMATE.start_main_~users~0#1.base| 0))} is VALID [2022-02-20 23:33:08,826 INFO L290 TraceCheckUtils]: 19: Hoare triple {6206#(and (= |ULTIMATE.start_main_~users~0#1.offset| 0) (= |ULTIMATE.start_main_~users~0#1.base| 0))} assume !main_#t~switch24#1; {6206#(and (= |ULTIMATE.start_main_~users~0#1.offset| 0) (= |ULTIMATE.start_main_~users~0#1.base| 0))} is VALID [2022-02-20 23:33:08,826 INFO L290 TraceCheckUtils]: 20: Hoare triple {6206#(and (= |ULTIMATE.start_main_~users~0#1.offset| 0) (= |ULTIMATE.start_main_~users~0#1.base| 0))} main_#t~switch24#1 := main_#t~switch24#1 || 6 == main_~_hj_k~0#1; {6206#(and (= |ULTIMATE.start_main_~users~0#1.offset| 0) (= |ULTIMATE.start_main_~users~0#1.base| 0))} is VALID [2022-02-20 23:33:08,827 INFO L290 TraceCheckUtils]: 21: Hoare triple {6206#(and (= |ULTIMATE.start_main_~users~0#1.offset| 0) (= |ULTIMATE.start_main_~users~0#1.base| 0))} assume !main_#t~switch24#1; {6206#(and (= |ULTIMATE.start_main_~users~0#1.offset| 0) (= |ULTIMATE.start_main_~users~0#1.base| 0))} is VALID [2022-02-20 23:33:08,827 INFO L290 TraceCheckUtils]: 22: Hoare triple {6206#(and (= |ULTIMATE.start_main_~users~0#1.offset| 0) (= |ULTIMATE.start_main_~users~0#1.base| 0))} main_#t~switch24#1 := main_#t~switch24#1 || 5 == main_~_hj_k~0#1; {6206#(and (= |ULTIMATE.start_main_~users~0#1.offset| 0) (= |ULTIMATE.start_main_~users~0#1.base| 0))} is VALID [2022-02-20 23:33:08,827 INFO L290 TraceCheckUtils]: 23: Hoare triple {6206#(and (= |ULTIMATE.start_main_~users~0#1.offset| 0) (= |ULTIMATE.start_main_~users~0#1.base| 0))} assume !main_#t~switch24#1; {6206#(and (= |ULTIMATE.start_main_~users~0#1.offset| 0) (= |ULTIMATE.start_main_~users~0#1.base| 0))} is VALID [2022-02-20 23:33:08,828 INFO L290 TraceCheckUtils]: 24: Hoare triple {6206#(and (= |ULTIMATE.start_main_~users~0#1.offset| 0) (= |ULTIMATE.start_main_~users~0#1.base| 0))} main_#t~switch24#1 := main_#t~switch24#1 || 4 == main_~_hj_k~0#1; {6206#(and (= |ULTIMATE.start_main_~users~0#1.offset| 0) (= |ULTIMATE.start_main_~users~0#1.base| 0))} is VALID [2022-02-20 23:33:08,828 INFO L290 TraceCheckUtils]: 25: Hoare triple {6206#(and (= |ULTIMATE.start_main_~users~0#1.offset| 0) (= |ULTIMATE.start_main_~users~0#1.base| 0))} assume main_#t~switch24#1;call main_#t~mem32#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~mem32#1 % 256);havoc main_#t~mem32#1; {6206#(and (= |ULTIMATE.start_main_~users~0#1.offset| 0) (= |ULTIMATE.start_main_~users~0#1.base| 0))} is VALID [2022-02-20 23:33:08,829 INFO L290 TraceCheckUtils]: 26: Hoare triple {6206#(and (= |ULTIMATE.start_main_~users~0#1.offset| 0) (= |ULTIMATE.start_main_~users~0#1.base| 0))} main_#t~switch24#1 := main_#t~switch24#1 || 3 == main_~_hj_k~0#1; {6206#(and (= |ULTIMATE.start_main_~users~0#1.offset| 0) (= |ULTIMATE.start_main_~users~0#1.base| 0))} is VALID [2022-02-20 23:33:08,829 INFO L290 TraceCheckUtils]: 27: Hoare triple {6206#(and (= |ULTIMATE.start_main_~users~0#1.offset| 0) (= |ULTIMATE.start_main_~users~0#1.base| 0))} assume main_#t~switch24#1;call main_#t~mem33#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~mem33#1 % 256);havoc main_#t~mem33#1; {6206#(and (= |ULTIMATE.start_main_~users~0#1.offset| 0) (= |ULTIMATE.start_main_~users~0#1.base| 0))} is VALID [2022-02-20 23:33:08,830 INFO L290 TraceCheckUtils]: 28: Hoare triple {6206#(and (= |ULTIMATE.start_main_~users~0#1.offset| 0) (= |ULTIMATE.start_main_~users~0#1.base| 0))} main_#t~switch24#1 := main_#t~switch24#1 || 2 == main_~_hj_k~0#1; {6206#(and (= |ULTIMATE.start_main_~users~0#1.offset| 0) (= |ULTIMATE.start_main_~users~0#1.base| 0))} is VALID [2022-02-20 23:33:08,830 INFO L290 TraceCheckUtils]: 29: Hoare triple {6206#(and (= |ULTIMATE.start_main_~users~0#1.offset| 0) (= |ULTIMATE.start_main_~users~0#1.base| 0))} assume main_#t~switch24#1;call main_#t~mem34#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~mem34#1 % 256);havoc main_#t~mem34#1; {6206#(and (= |ULTIMATE.start_main_~users~0#1.offset| 0) (= |ULTIMATE.start_main_~users~0#1.base| 0))} is VALID [2022-02-20 23:33:08,830 INFO L290 TraceCheckUtils]: 30: Hoare triple {6206#(and (= |ULTIMATE.start_main_~users~0#1.offset| 0) (= |ULTIMATE.start_main_~users~0#1.base| 0))} main_#t~switch24#1 := main_#t~switch24#1 || 1 == main_~_hj_k~0#1; {6206#(and (= |ULTIMATE.start_main_~users~0#1.offset| 0) (= |ULTIMATE.start_main_~users~0#1.base| 0))} is VALID [2022-02-20 23:33:08,831 INFO L290 TraceCheckUtils]: 31: Hoare triple {6206#(and (= |ULTIMATE.start_main_~users~0#1.offset| 0) (= |ULTIMATE.start_main_~users~0#1.base| 0))} assume main_#t~switch24#1;call main_#t~mem35#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~mem35#1 % 256;havoc main_#t~mem35#1; {6206#(and (= |ULTIMATE.start_main_~users~0#1.offset| 0) (= |ULTIMATE.start_main_~users~0#1.base| 0))} is VALID [2022-02-20 23:33:08,831 INFO L290 TraceCheckUtils]: 32: Hoare triple {6206#(and (= |ULTIMATE.start_main_~users~0#1.offset| 0) (= |ULTIMATE.start_main_~users~0#1.base| 0))} havoc main_#t~switch24#1; {6206#(and (= |ULTIMATE.start_main_~users~0#1.offset| 0) (= |ULTIMATE.start_main_~users~0#1.base| 0))} is VALID [2022-02-20 23:33:08,833 INFO L290 TraceCheckUtils]: 33: Hoare triple {6206#(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)))); {6206#(and (= |ULTIMATE.start_main_~users~0#1.offset| 0) (= |ULTIMATE.start_main_~users~0#1.base| 0))} is VALID [2022-02-20 23:33:08,833 INFO L290 TraceCheckUtils]: 34: Hoare triple {6206#(and (= |ULTIMATE.start_main_~users~0#1.offset| 0) (= |ULTIMATE.start_main_~users~0#1.base| 0))} goto; {6206#(and (= |ULTIMATE.start_main_~users~0#1.offset| 0) (= |ULTIMATE.start_main_~users~0#1.base| 0))} is VALID [2022-02-20 23:33:08,833 INFO L290 TraceCheckUtils]: 35: Hoare triple {6206#(and (= |ULTIMATE.start_main_~users~0#1.offset| 0) (= |ULTIMATE.start_main_~users~0#1.base| 0))} goto; {6206#(and (= |ULTIMATE.start_main_~users~0#1.offset| 0) (= |ULTIMATE.start_main_~users~0#1.base| 0))} is VALID [2022-02-20 23:33:08,834 INFO L290 TraceCheckUtils]: 36: Hoare triple {6206#(and (= |ULTIMATE.start_main_~users~0#1.offset| 0) (= |ULTIMATE.start_main_~users~0#1.base| 0))} goto; {6206#(and (= |ULTIMATE.start_main_~users~0#1.offset| 0) (= |ULTIMATE.start_main_~users~0#1.base| 0))} is VALID [2022-02-20 23:33:08,834 INFO L290 TraceCheckUtils]: 37: Hoare triple {6206#(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); {6206#(and (= |ULTIMATE.start_main_~users~0#1.offset| 0) (= |ULTIMATE.start_main_~users~0#1.base| 0))} is VALID [2022-02-20 23:33:08,835 INFO L290 TraceCheckUtils]: 38: Hoare triple {6206#(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~mem53#1.base, main_#t~mem53#1.offset := read~$Pointer$(main_~users~0#1.base, 8 + main_~users~0#1.offset, 4);call write~$Pointer$(main_#t~mem53#1.base, main_#t~mem53#1.offset, main_~user~0#1.base, 8 + main_~user~0#1.offset, 4);havoc main_#t~mem53#1.base, main_#t~mem53#1.offset; {6199#false} is VALID [2022-02-20 23:33:08,835 INFO L290 TraceCheckUtils]: 39: Hoare triple {6199#false} call write~$Pointer$(0, 0, main_~user~0#1.base, 16 + main_~user~0#1.offset, 4);call main_#t~mem54#1.base, main_#t~mem54#1.offset := read~$Pointer$(main_~users~0#1.base, 8 + main_~users~0#1.offset, 4);call main_#t~mem55#1.base, main_#t~mem55#1.offset := read~$Pointer$(main_#t~mem54#1.base, 16 + main_#t~mem54#1.offset, 4);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, 20 + main_#t~mem56#1.offset, 4);call write~$Pointer$(main_#t~mem55#1.base, main_#t~mem55#1.offset - main_#t~mem57#1, main_~user~0#1.base, 12 + main_~user~0#1.offset, 4);havoc main_#t~mem54#1.base, main_#t~mem54#1.offset;havoc main_#t~mem55#1.base, main_#t~mem55#1.offset;havoc main_#t~mem56#1.base, main_#t~mem56#1.offset;havoc main_#t~mem57#1;call main_#t~mem58#1.base, main_#t~mem58#1.offset := read~$Pointer$(main_~users~0#1.base, 8 + main_~users~0#1.offset, 4);call main_#t~mem59#1.base, main_#t~mem59#1.offset := read~$Pointer$(main_#t~mem58#1.base, 16 + main_#t~mem58#1.offset, 4);call write~$Pointer$(main_~user~0#1.base, main_~user~0#1.offset, main_#t~mem59#1.base, 8 + main_#t~mem59#1.offset, 4);havoc main_#t~mem58#1.base, main_#t~mem58#1.offset;havoc main_#t~mem59#1.base, main_#t~mem59#1.offset;call main_#t~mem60#1.base, main_#t~mem60#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~mem60#1.base, 16 + main_#t~mem60#1.offset, 4);havoc main_#t~mem60#1.base, main_#t~mem60#1.offset; {6199#false} is VALID [2022-02-20 23:33:08,835 INFO L290 TraceCheckUtils]: 40: Hoare triple {6199#false} goto; {6199#false} is VALID [2022-02-20 23:33:08,835 INFO L290 TraceCheckUtils]: 41: Hoare triple {6199#false} havoc main_~_ha_bkt~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 := read~int(main_#t~mem61#1.base, 12 + main_#t~mem61#1.offset, 4);main_#t~post63#1 := main_#t~mem62#1;call write~int(1 + main_#t~post63#1, main_#t~mem61#1.base, 12 + main_#t~mem61#1.offset, 4);havoc main_#t~mem61#1.base, main_#t~mem61#1.offset;havoc main_#t~mem62#1;havoc main_#t~post63#1; {6199#false} is VALID [2022-02-20 23:33:08,836 INFO L290 TraceCheckUtils]: 42: Hoare triple {6199#false} call main_#t~mem64#1.base, main_#t~mem64#1.offset := read~$Pointer$(main_~users~0#1.base, 8 + main_~users~0#1.offset, 4);call main_#t~mem65#1 := read~int(main_#t~mem64#1.base, 4 + main_#t~mem64#1.offset, 4);main_~_ha_bkt~0#1 := (if 0 == main_~_ha_hashv~0#1 || 0 == main_#t~mem65#1 - 1 then 0 else (if 1 == main_#t~mem65#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~mem65#1 - 1))) else (if 1 == main_~_ha_hashv~0#1 then (if 1 == main_#t~mem65#1 - 1 || 0 == main_#t~mem65#1 - 1 then main_#t~mem65#1 - 1 else (if main_#t~mem65#1 - 1 >= 0 then (main_#t~mem65#1 - 1) % 2 else ~bitwiseAnd(main_~_ha_hashv~0#1, main_#t~mem65#1 - 1))) else ~bitwiseAnd(main_~_ha_hashv~0#1, main_#t~mem65#1 - 1))));havoc main_#t~mem64#1.base, main_#t~mem64#1.offset;havoc main_#t~mem65#1; {6199#false} is VALID [2022-02-20 23:33:08,836 INFO L290 TraceCheckUtils]: 43: Hoare triple {6199#false} goto; {6199#false} is VALID [2022-02-20 23:33:08,836 INFO L290 TraceCheckUtils]: 44: Hoare triple {6199#false} call main_#t~mem66#1.base, main_#t~mem66#1.offset := read~$Pointer$(main_~users~0#1.base, 8 + main_~users~0#1.offset, 4);call main_#t~mem67#1.base, main_#t~mem67#1.offset := read~$Pointer$(main_#t~mem66#1.base, main_#t~mem66#1.offset, 4);main_~_ha_head~0#1.base, main_~_ha_head~0#1.offset := main_#t~mem67#1.base, main_#t~mem67#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~mem66#1.base, main_#t~mem66#1.offset;havoc main_#t~mem67#1.base, main_#t~mem67#1.offset;call main_#t~mem68#1 := read~int(main_~_ha_head~0#1.base, 4 + main_~_ha_head~0#1.offset, 4);main_#t~post69#1 := main_#t~mem68#1;call write~int(1 + main_#t~post69#1, main_~_ha_head~0#1.base, 4 + main_~_ha_head~0#1.offset, 4);havoc main_#t~mem68#1;havoc main_#t~post69#1;call main_#t~mem70#1.base, main_#t~mem70#1.offset := read~$Pointer$(main_~_ha_head~0#1.base, main_~_ha_head~0#1.offset, 4);call write~$Pointer$(main_#t~mem70#1.base, main_#t~mem70#1.offset, main_~user~0#1.base, 24 + main_~user~0#1.offset, 4);havoc main_#t~mem70#1.base, main_#t~mem70#1.offset;call write~$Pointer$(0, 0, main_~user~0#1.base, 20 + main_~user~0#1.offset, 4);call main_#t~mem71#1.base, main_#t~mem71#1.offset := read~$Pointer$(main_~_ha_head~0#1.base, main_~_ha_head~0#1.offset, 4); {6199#false} is VALID [2022-02-20 23:33:08,836 INFO L290 TraceCheckUtils]: 45: Hoare triple {6199#false} assume main_#t~mem71#1.base != 0 || main_#t~mem71#1.offset != 0;havoc main_#t~mem71#1.base, main_#t~mem71#1.offset;call main_#t~mem72#1.base, main_#t~mem72#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~mem72#1.base, 12 + main_#t~mem72#1.offset, 4);havoc main_#t~mem72#1.base, main_#t~mem72#1.offset; {6199#false} is VALID [2022-02-20 23:33:08,836 INFO L290 TraceCheckUtils]: 46: Hoare triple {6199#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~mem74#1 := read~int(main_~_ha_head~0#1.base, 4 + main_~_ha_head~0#1.offset, 4);call main_#t~mem73#1 := read~int(main_~_ha_head~0#1.base, 8 + main_~_ha_head~0#1.offset, 4);main_#t~short77#1 := main_#t~mem74#1 % 4294967296 >= 10 * (1 + main_#t~mem73#1) % 4294967296; {6199#false} is VALID [2022-02-20 23:33:08,836 INFO L290 TraceCheckUtils]: 47: Hoare triple {6199#false} assume !main_#t~short77#1; {6199#false} is VALID [2022-02-20 23:33:08,836 INFO L290 TraceCheckUtils]: 48: Hoare triple {6199#false} assume !main_#t~short77#1;havoc main_#t~mem74#1;havoc main_#t~mem73#1;havoc main_#t~mem75#1.base, main_#t~mem75#1.offset;havoc main_#t~mem76#1;havoc main_#t~short77#1; {6199#false} is VALID [2022-02-20 23:33:08,837 INFO L290 TraceCheckUtils]: 49: Hoare triple {6199#false} goto; {6199#false} is VALID [2022-02-20 23:33:08,837 INFO L290 TraceCheckUtils]: 50: Hoare triple {6199#false} goto; {6199#false} is VALID [2022-02-20 23:33:08,837 INFO L290 TraceCheckUtils]: 51: Hoare triple {6199#false} goto; {6199#false} is VALID [2022-02-20 23:33:08,837 INFO L290 TraceCheckUtils]: 52: Hoare triple {6199#false} goto; {6199#false} is VALID [2022-02-20 23:33:08,837 INFO L290 TraceCheckUtils]: 53: Hoare triple {6199#false} call main_#t~mem144#1.base, main_#t~mem144#1.offset := read~$Pointer$(main_~user~0#1.base, 8 + main_~user~0#1.offset, 4);call main_#t~mem145#1 := read~int(main_#t~mem144#1.base, 12 + main_#t~mem144#1.offset, 4); {6199#false} is VALID [2022-02-20 23:33:08,837 INFO L272 TraceCheckUtils]: 54: Hoare triple {6199#false} call test_int((if main_#t~mem145#1 % 4294967296 % 4294967296 <= 2147483647 then main_#t~mem145#1 % 4294967296 % 4294967296 else main_#t~mem145#1 % 4294967296 % 4294967296 - 4294967296)); {6199#false} is VALID [2022-02-20 23:33:08,837 INFO L290 TraceCheckUtils]: 55: Hoare triple {6199#false} ~a := #in~a;#t~post3 := ~count_int~0;~count_int~0 := 1 + #t~post3;#t~switch4 := 0 == #t~post3; {6199#false} is VALID [2022-02-20 23:33:08,838 INFO L290 TraceCheckUtils]: 56: Hoare triple {6199#false} assume #t~switch4; {6199#false} is VALID [2022-02-20 23:33:08,838 INFO L272 TraceCheckUtils]: 57: Hoare triple {6199#false} call __VERIFIER_assert((if 1 == ~a then 1 else 0)); {6199#false} is VALID [2022-02-20 23:33:08,838 INFO L290 TraceCheckUtils]: 58: Hoare triple {6199#false} ~cond := #in~cond; {6199#false} is VALID [2022-02-20 23:33:08,838 INFO L290 TraceCheckUtils]: 59: Hoare triple {6199#false} assume 0 == ~cond; {6199#false} is VALID [2022-02-20 23:33:08,838 INFO L290 TraceCheckUtils]: 60: Hoare triple {6199#false} assume !false; {6199#false} is VALID [2022-02-20 23:33:08,839 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-20 23:33:08,839 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 23:33:08,839 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 23:33:08,839 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2032842192] [2022-02-20 23:33:08,839 WARN L317 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-02-20 23:33:08,839 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1399087702] [2022-02-20 23:33:08,839 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1399087702] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:33:08,839 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:33:08,840 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 23:33:08,840 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1601440812] [2022-02-20 23:33:08,840 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:33:08,840 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 19.666666666666668) internal successors, (59), 3 states have internal predecessors, (59), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 61 [2022-02-20 23:33:08,841 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:33:08,841 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 19.666666666666668) internal successors, (59), 3 states have internal predecessors, (59), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:33:08,889 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-20 23:33:08,890 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 23:33:08,890 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 23:33:08,890 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 23:33:08,890 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 23:33:08,891 INFO L87 Difference]: Start difference. First operand 230 states and 308 transitions. Second operand has 3 states, 3 states have (on average 19.666666666666668) internal successors, (59), 3 states have internal predecessors, (59), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:33:10,484 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:33:10,484 INFO L93 Difference]: Finished difference Result 567 states and 751 transitions. [2022-02-20 23:33:10,485 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 23:33:10,485 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 19.666666666666668) internal successors, (59), 3 states have internal predecessors, (59), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 61 [2022-02-20 23:33:10,485 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:33:10,485 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 19.666666666666668) internal successors, (59), 3 states have internal predecessors, (59), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:33:10,491 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 733 transitions. [2022-02-20 23:33:10,491 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 19.666666666666668) internal successors, (59), 3 states have internal predecessors, (59), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:33:10,526 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 733 transitions. [2022-02-20 23:33:10,527 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 733 transitions. [2022-02-20 23:33:11,068 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 733 edges. 733 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:33:11,075 INFO L225 Difference]: With dead ends: 567 [2022-02-20 23:33:11,075 INFO L226 Difference]: Without dead ends: 341 [2022-02-20 23:33:11,075 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-20 23:33:11,077 INFO L933 BasicCegarLoop]: 343 mSDtfsCounter, 98 mSDsluCounter, 269 mSDsCounter, 0 mSdLazyCounter, 29 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 101 SdHoareTripleChecker+Valid, 612 SdHoareTripleChecker+Invalid, 34 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 29 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-20 23:33:11,078 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [101 Valid, 612 Invalid, 34 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 29 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-20 23:33:11,079 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 341 states. [2022-02-20 23:33:11,108 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 341 to 338. [2022-02-20 23:33:11,109 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:33:11,109 INFO L82 GeneralOperation]: Start isEquivalent. First operand 341 states. Second operand has 338 states, 312 states have (on average 1.2852564102564104) internal successors, (401), 328 states have internal predecessors, (401), 21 states have call successors, (21), 3 states have call predecessors, (21), 3 states have return successors, (21), 7 states have call predecessors, (21), 21 states have call successors, (21) [2022-02-20 23:33:11,112 INFO L74 IsIncluded]: Start isIncluded. First operand 341 states. Second operand has 338 states, 312 states have (on average 1.2852564102564104) internal successors, (401), 328 states have internal predecessors, (401), 21 states have call successors, (21), 3 states have call predecessors, (21), 3 states have return successors, (21), 7 states have call predecessors, (21), 21 states have call successors, (21) [2022-02-20 23:33:11,113 INFO L87 Difference]: Start difference. First operand 341 states. Second operand has 338 states, 312 states have (on average 1.2852564102564104) internal successors, (401), 328 states have internal predecessors, (401), 21 states have call successors, (21), 3 states have call predecessors, (21), 3 states have return successors, (21), 7 states have call predecessors, (21), 21 states have call successors, (21) [2022-02-20 23:33:11,120 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:33:11,120 INFO L93 Difference]: Finished difference Result 341 states and 445 transitions. [2022-02-20 23:33:11,120 INFO L276 IsEmpty]: Start isEmpty. Operand 341 states and 445 transitions. [2022-02-20 23:33:11,121 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:33:11,121 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:33:11,121 INFO L74 IsIncluded]: Start isIncluded. First operand has 338 states, 312 states have (on average 1.2852564102564104) internal successors, (401), 328 states have internal predecessors, (401), 21 states have call successors, (21), 3 states have call predecessors, (21), 3 states have return successors, (21), 7 states have call predecessors, (21), 21 states have call successors, (21) Second operand 341 states. [2022-02-20 23:33:11,122 INFO L87 Difference]: Start difference. First operand has 338 states, 312 states have (on average 1.2852564102564104) internal successors, (401), 328 states have internal predecessors, (401), 21 states have call successors, (21), 3 states have call predecessors, (21), 3 states have return successors, (21), 7 states have call predecessors, (21), 21 states have call successors, (21) Second operand 341 states. [2022-02-20 23:33:11,128 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:33:11,128 INFO L93 Difference]: Finished difference Result 341 states and 445 transitions. [2022-02-20 23:33:11,128 INFO L276 IsEmpty]: Start isEmpty. Operand 341 states and 445 transitions. [2022-02-20 23:33:11,129 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:33:11,129 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:33:11,129 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:33:11,129 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:33:11,130 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 338 states, 312 states have (on average 1.2852564102564104) internal successors, (401), 328 states have internal predecessors, (401), 21 states have call successors, (21), 3 states have call predecessors, (21), 3 states have return successors, (21), 7 states have call predecessors, (21), 21 states have call successors, (21) [2022-02-20 23:33:11,135 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 338 states to 338 states and 443 transitions. [2022-02-20 23:33:11,136 INFO L78 Accepts]: Start accepts. Automaton has 338 states and 443 transitions. Word has length 61 [2022-02-20 23:33:11,137 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:33:11,137 INFO L470 AbstractCegarLoop]: Abstraction has 338 states and 443 transitions. [2022-02-20 23:33:11,137 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 19.666666666666668) internal successors, (59), 3 states have internal predecessors, (59), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:33:11,137 INFO L276 IsEmpty]: Start isEmpty. Operand 338 states and 443 transitions. [2022-02-20 23:33:11,138 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2022-02-20 23:33:11,138 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:33:11,139 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 23:33:11,161 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-20 23:33:11,358 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 23:33:11,359 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 23:33:11,359 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:33:11,359 INFO L85 PathProgramCache]: Analyzing trace with hash -1452917895, now seen corresponding path program 1 times [2022-02-20 23:33:11,359 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 23:33:11,359 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1148305389] [2022-02-20 23:33:11,359 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:33:11,359 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 23:33:11,409 ERROR L252 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-02-20 23:33:11,409 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [967607588] [2022-02-20 23:33:11,410 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:33:11,410 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 23:33:11,410 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 23:33:11,424 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-20 23:33:11,425 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-20 23:33:13,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:33:13,121 INFO L263 TraceCheckSpWp]: Trace formula consists of 684 conjuncts, 7 conjunts are in the unsatisfiable core [2022-02-20 23:33:13,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:33:13,158 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 23:33:13,319 INFO L290 TraceCheckUtils]: 0: Hoare triple {8159#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~0 := 0; {8159#true} is VALID [2022-02-20 23:33:13,319 INFO L290 TraceCheckUtils]: 1: Hoare triple {8159#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc8#1.base, main_#t~malloc8#1.offset, main_#t~mem9#1, main_#t~mem10#1, main_#t~mem11#1, main_#t~mem13#1, main_#t~mem12#1, main_#t~mem14#1, main_#t~mem15#1, main_#t~mem17#1, main_#t~mem16#1, main_#t~mem18#1, main_#t~mem19#1, main_#t~mem21#1, main_#t~mem20#1, main_#t~mem22#1, main_#t~mem23#1, main_#t~switch24#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_#t~mem31#1, main_#t~mem32#1, main_#t~mem33#1, main_#t~mem34#1, main_#t~mem35#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~malloc36#1.base, main_#t~malloc36#1.offset, main_#t~mem37#1.base, main_#t~mem37#1.offset, main_#t~mem38#1.base, main_#t~mem38#1.offset, main_#t~memset~res39#1.base, main_#t~memset~res39#1.offset, main_#t~mem40#1.base, main_#t~mem40#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~malloc45#1.base, main_#t~malloc45#1.offset, main_#t~mem46#1.base, main_#t~mem46#1.offset, main_#t~mem47#1.base, main_#t~mem47#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~memset~res52#1.base, main_#t~memset~res52#1.offset, 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~mem58#1.base, main_#t~mem58#1.offset, main_#t~mem59#1.base, main_#t~mem59#1.offset, main_#t~mem60#1.base, main_#t~mem60#1.offset, main_#t~mem61#1.base, main_#t~mem61#1.offset, main_#t~mem62#1, main_#t~post63#1, main_#t~mem64#1.base, main_#t~mem64#1.offset, main_#t~mem65#1, main_#t~mem66#1.base, main_#t~mem66#1.offset, main_#t~mem67#1.base, main_#t~mem67#1.offset, main_#t~mem68#1, main_#t~post69#1, main_#t~mem70#1.base, main_#t~mem70#1.offset, main_#t~mem71#1.base, main_#t~mem71#1.offset, main_#t~mem72#1.base, main_#t~mem72#1.offset, main_#t~mem74#1, main_#t~mem73#1, main_#t~mem75#1.base, main_#t~mem75#1.offset, main_#t~mem76#1, main_#t~short77#1, main_#t~mem78#1.base, main_#t~mem78#1.offset, main_#t~mem79#1, main_#t~malloc80#1.base, main_#t~malloc80#1.offset, main_#t~mem81#1.base, main_#t~mem81#1.offset, main_#t~mem82#1.base, main_#t~mem82#1.offset, main_#t~mem83#1.base, main_#t~mem83#1.offset, main_#t~mem84#1, main_#t~memset~res85#1.base, main_#t~memset~res85#1.offset, main_#t~mem86#1.base, main_#t~mem86#1.offset, main_#t~mem87#1.base, main_#t~mem87#1.offset, main_#t~mem90#1, main_#t~mem88#1.base, main_#t~mem88#1.offset, main_#t~mem89#1, main_#t~mem91#1.base, main_#t~mem91#1.offset, main_#t~mem94#1, main_#t~mem92#1.base, main_#t~mem92#1.offset, main_#t~mem93#1, main_#t~ite95#1, main_#t~mem96#1.base, main_#t~mem96#1.offset, main_#t~mem100#1.base, main_#t~mem100#1.offset, main_#t~mem101#1.base, main_#t~mem101#1.offset, main_#t~mem102#1.base, main_#t~mem102#1.offset, main_#t~mem103#1.base, main_#t~mem103#1.offset, main_#t~mem106#1, main_#t~mem104#1.base, main_#t~mem104#1.offset, main_#t~mem105#1, main_#t~mem107#1.base, main_#t~mem107#1.offset, main_#t~mem108#1, main_#t~pre109#1, main_#t~mem110#1.base, main_#t~mem110#1.offset, main_#t~mem111#1, main_#t~mem112#1.base, main_#t~mem112#1.offset, main_#t~mem113#1, main_#t~post114#1, main_#t~mem118#1, main_#t~mem116#1, main_#t~mem115#1.base, main_#t~mem115#1.offset, main_#t~mem117#1, main_#t~mem119#1, main_#t~post120#1, main_#t~mem121#1.base, main_#t~mem121#1.offset, main_#t~mem122#1.base, main_#t~mem122#1.offset, main_#t~mem123#1.base, main_#t~mem123#1.offset, main_#t~post97#1, main_#t~mem98#1.base, main_#t~mem98#1.offset, main_#t~mem99#1, main_#t~mem124#1.base, main_#t~mem124#1.offset, main_#t~mem125#1.base, main_#t~mem125#1.offset, main_#t~mem126#1.base, main_#t~mem126#1.offset, main_#t~mem127#1, main_#t~mem128#1.base, main_#t~mem128#1.offset, main_#t~mem129#1, main_#t~post130#1, main_#t~mem131#1.base, main_#t~mem131#1.offset, main_#t~mem132#1.base, main_#t~mem132#1.offset, main_#t~mem133#1.base, main_#t~mem133#1.offset, main_#t~mem134#1.base, main_#t~mem134#1.offset, main_#t~mem137#1, main_#t~mem135#1.base, main_#t~mem135#1.offset, main_#t~mem136#1, main_#t~ite140#1, main_#t~mem138#1.base, main_#t~mem138#1.offset, main_#t~mem139#1, main_#t~mem141#1.base, main_#t~mem141#1.offset, main_#t~mem142#1, main_#t~mem143#1.base, main_#t~mem143#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~mem144#1.base, main_#t~mem144#1.offset, main_#t~mem145#1, main_#t~mem5#1, main_#t~post6#1, main_#t~mem7#1, main_#t~mem149#1, main_#t~mem148#1, main_#t~mem150#1, main_#t~mem151#1, main_#t~mem153#1, main_#t~mem152#1, main_#t~mem154#1, main_#t~mem155#1, main_#t~mem157#1, main_#t~mem156#1, main_#t~mem158#1, main_#t~mem159#1, main_#t~switch160#1, main_#t~mem161#1, main_#t~mem162#1, main_#t~mem163#1, main_#t~mem164#1, main_#t~mem165#1, main_#t~mem166#1, main_#t~mem167#1, main_#t~mem168#1, main_#t~mem169#1, main_#t~mem170#1, main_#t~mem171#1, main_~_hj_i~1#1, main_~_hj_j~1#1, main_~_hj_k~1#1, main_~_hj_key~1#1.base, main_~_hj_key~1#1.offset, main_#t~mem172#1.base, main_#t~mem172#1.offset, main_#t~mem173#1, main_#t~mem174#1.base, main_#t~mem174#1.offset, main_#t~mem175#1.base, main_#t~mem175#1.offset, main_#t~mem176#1.base, main_#t~mem176#1.offset, main_#t~mem177#1.base, main_#t~mem177#1.offset, main_#t~mem178#1.base, main_#t~mem178#1.offset, main_#t~mem179#1.base, main_#t~mem179#1.offset, main_#t~mem180#1.base, main_#t~mem180#1.offset, main_#t~mem181#1, main_#t~mem182#1, main_#t~mem183#1, main_#t~short184#1, main_#t~mem185#1.base, main_#t~mem185#1.offset, main_#t~ret186#1, main_#t~mem187#1.base, main_#t~mem187#1.offset, main_#t~mem188#1.base, main_#t~mem188#1.offset, main_#t~mem189#1.base, main_#t~mem189#1.offset, main_#t~mem190#1, main_~_hf_bkt~0#1, main_~_hf_hashv~0#1, main_#t~mem191#1.base, main_#t~mem191#1.offset, main_#t~mem192#1.base, main_#t~mem192#1.offset, main_#t~short193#1, main_#t~mem194#1.base, main_#t~mem194#1.offset, main_#t~mem195#1.base, main_#t~mem195#1.offset, main_#t~mem196#1.base, main_#t~mem196#1.offset, main_#t~mem197#1.base, main_#t~mem197#1.offset, main_#t~mem198#1.base, main_#t~mem198#1.offset, main_#t~mem199#1.base, main_#t~mem199#1.offset, main_#t~mem200#1.base, main_#t~mem200#1.offset, main_#t~mem201#1.base, main_#t~mem201#1.offset, main_#t~mem202#1, main_#t~mem203#1.base, main_#t~mem203#1.offset, main_#t~mem204#1.base, main_#t~mem204#1.offset, main_#t~mem205#1.base, main_#t~mem205#1.offset, main_#t~mem206#1, main_#t~mem207#1.base, main_#t~mem207#1.offset, main_#t~mem208#1.base, main_#t~mem208#1.offset, main_#t~mem209#1.base, main_#t~mem209#1.offset, main_#t~mem210#1.base, main_#t~mem210#1.offset, main_#t~mem211#1.base, main_#t~mem211#1.offset, main_#t~mem212#1, main_#t~mem213#1.base, main_#t~mem213#1.offset, main_#t~mem216#1, main_#t~mem214#1.base, main_#t~mem214#1.offset, main_#t~mem215#1, main_#t~mem217#1.base, main_#t~mem217#1.offset, main_#t~mem218#1.base, main_#t~mem218#1.offset, main_#t~mem219#1, main_#t~post220#1, main_#t~mem221#1.base, main_#t~mem221#1.offset, main_#t~mem222#1.base, main_#t~mem222#1.offset, main_#t~mem223#1.base, main_#t~mem223#1.offset, main_#t~mem224#1.base, main_#t~mem224#1.offset, main_#t~mem225#1.base, main_#t~mem225#1.offset, main_#t~mem226#1.base, main_#t~mem226#1.offset, main_#t~mem227#1.base, main_#t~mem227#1.offset, main_#t~mem228#1.base, main_#t~mem228#1.offset, main_~_hd_head~0#1.base, main_~_hd_head~0#1.offset, main_#t~mem229#1.base, main_#t~mem229#1.offset, main_#t~mem230#1, main_#t~post231#1, main_~_hd_bkt~0#1, main_~_hd_hh_del~0#1.base, main_~_hd_hh_del~0#1.offset, main_#t~mem232#1.base, main_#t~mem232#1.offset, main_#t~mem233#1, main_#t~mem146#1, main_#t~mem147#1, main_#t~ite235#1.base, main_#t~ite235#1.offset, main_#t~mem234#1.base, main_#t~mem234#1.offset, main_#t~mem238#1.base, main_#t~mem238#1.offset, main_#t~mem239#1.base, main_#t~mem239#1.offset, main_#t~short240#1, main_#t~mem241#1.base, main_#t~mem241#1.offset, main_#t~mem242#1.base, main_#t~mem242#1.offset, main_#t~mem243#1.base, main_#t~mem243#1.offset, main_#t~mem244#1.base, main_#t~mem244#1.offset, main_#t~mem245#1.base, main_#t~mem245#1.offset, main_#t~mem246#1.base, main_#t~mem246#1.offset, main_#t~mem247#1.base, main_#t~mem247#1.offset, main_#t~mem248#1.base, main_#t~mem248#1.offset, main_#t~mem249#1, main_#t~mem250#1.base, main_#t~mem250#1.offset, main_#t~mem251#1.base, main_#t~mem251#1.offset, main_#t~mem252#1.base, main_#t~mem252#1.offset, main_#t~mem253#1, main_#t~mem254#1.base, main_#t~mem254#1.offset, main_#t~mem255#1.base, main_#t~mem255#1.offset, main_#t~mem256#1.base, main_#t~mem256#1.offset, main_#t~mem257#1.base, main_#t~mem257#1.offset, main_#t~mem258#1.base, main_#t~mem258#1.offset, main_#t~mem259#1, main_#t~mem260#1.base, main_#t~mem260#1.offset, main_#t~mem263#1, main_#t~mem261#1.base, main_#t~mem261#1.offset, main_#t~mem262#1, main_#t~mem264#1.base, main_#t~mem264#1.offset, main_#t~mem265#1.base, main_#t~mem265#1.offset, main_#t~mem266#1, main_#t~post267#1, main_#t~mem268#1.base, main_#t~mem268#1.offset, main_#t~mem269#1.base, main_#t~mem269#1.offset, main_#t~mem270#1.base, main_#t~mem270#1.offset, main_#t~mem271#1.base, main_#t~mem271#1.offset, main_#t~mem272#1.base, main_#t~mem272#1.offset, main_#t~mem273#1.base, main_#t~mem273#1.offset, main_#t~mem274#1.base, main_#t~mem274#1.offset, main_#t~mem275#1.base, main_#t~mem275#1.offset, main_~_hd_head~1#1.base, main_~_hd_head~1#1.offset, main_#t~mem276#1.base, main_#t~mem276#1.offset, main_#t~mem277#1, main_#t~post278#1, main_~_hd_bkt~1#1, main_~_hd_hh_del~1#1.base, main_~_hd_hh_del~1#1.offset, main_#t~ite237#1.base, main_#t~ite237#1.offset, main_#t~mem236#1.base, main_#t~mem236#1.offset, main_~#i~0#1.base, main_~#i~0#1.offset, main_~user~0#1.base, main_~user~0#1.offset, main_~tmp~0#1.base, main_~tmp~0#1.offset, main_~users~0#1.base, main_~users~0#1.offset, main_~temp~0#1.base, main_~temp~0#1.offset;call main_~#i~0#1.base, main_~#i~0#1.offset := #Ultimate.allocOnStack(4);havoc main_~user~0#1.base, main_~user~0#1.offset;havoc main_~tmp~0#1.base, main_~tmp~0#1.offset;main_~users~0#1.base, main_~users~0#1.offset := 0, 0;call write~int(0, main_~#i~0#1.base, main_~#i~0#1.offset, 4); {8159#true} is VALID [2022-02-20 23:33:13,320 INFO L290 TraceCheckUtils]: 2: Hoare triple {8159#true} call main_#t~mem7#1 := read~int(main_~#i~0#1.base, main_~#i~0#1.offset, 4); {8159#true} is VALID [2022-02-20 23:33:13,320 INFO L290 TraceCheckUtils]: 3: Hoare triple {8159#true} assume !!(main_#t~mem7#1 < 10);havoc main_#t~mem7#1;call main_#t~malloc8#1.base, main_#t~malloc8#1.offset := #Ultimate.allocOnHeap(40);main_~user~0#1.base, main_~user~0#1.offset := main_#t~malloc8#1.base, main_#t~malloc8#1.offset;havoc main_#t~malloc8#1.base, main_#t~malloc8#1.offset; {8159#true} is VALID [2022-02-20 23:33:13,320 INFO L290 TraceCheckUtils]: 4: Hoare triple {8159#true} assume !(main_~user~0#1.base == 0 && main_~user~0#1.offset == 0); {8159#true} is VALID [2022-02-20 23:33:13,320 INFO L290 TraceCheckUtils]: 5: Hoare triple {8159#true} call main_#t~mem9#1 := read~int(main_~#i~0#1.base, main_~#i~0#1.offset, 4);call write~int(main_#t~mem9#1, main_~user~0#1.base, main_~user~0#1.offset, 4);havoc main_#t~mem9#1;call main_#t~mem10#1 := read~int(main_~#i~0#1.base, main_~#i~0#1.offset, 4);call main_#t~mem11#1 := read~int(main_~#i~0#1.base, main_~#i~0#1.offset, 4);call write~int(main_#t~mem10#1 * main_#t~mem11#1, main_~user~0#1.base, 4 + main_~user~0#1.offset, 4);havoc main_#t~mem10#1;havoc main_#t~mem11#1; {8159#true} is VALID [2022-02-20 23:33:13,320 INFO L290 TraceCheckUtils]: 6: Hoare triple {8159#true} havoc main_~_ha_hashv~0#1; {8159#true} is VALID [2022-02-20 23:33:13,325 INFO L290 TraceCheckUtils]: 7: Hoare triple {8159#true} goto; {8159#true} is VALID [2022-02-20 23:33:13,325 INFO L290 TraceCheckUtils]: 8: Hoare triple {8159#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; {8159#true} is VALID [2022-02-20 23:33:13,325 INFO L290 TraceCheckUtils]: 9: Hoare triple {8159#true} assume !(main_~_hj_k~0#1 % 4294967296 >= 12); {8159#true} is VALID [2022-02-20 23:33:13,325 INFO L290 TraceCheckUtils]: 10: Hoare triple {8159#true} main_~_ha_hashv~0#1 := 4 + main_~_ha_hashv~0#1;main_#t~switch24#1 := 11 == main_~_hj_k~0#1; {8159#true} is VALID [2022-02-20 23:33:13,325 INFO L290 TraceCheckUtils]: 11: Hoare triple {8159#true} assume !main_#t~switch24#1; {8159#true} is VALID [2022-02-20 23:33:13,325 INFO L290 TraceCheckUtils]: 12: Hoare triple {8159#true} main_#t~switch24#1 := main_#t~switch24#1 || 10 == main_~_hj_k~0#1; {8159#true} is VALID [2022-02-20 23:33:13,325 INFO L290 TraceCheckUtils]: 13: Hoare triple {8159#true} assume !main_#t~switch24#1; {8159#true} is VALID [2022-02-20 23:33:13,325 INFO L290 TraceCheckUtils]: 14: Hoare triple {8159#true} main_#t~switch24#1 := main_#t~switch24#1 || 9 == main_~_hj_k~0#1; {8159#true} is VALID [2022-02-20 23:33:13,326 INFO L290 TraceCheckUtils]: 15: Hoare triple {8159#true} assume !main_#t~switch24#1; {8159#true} is VALID [2022-02-20 23:33:13,326 INFO L290 TraceCheckUtils]: 16: Hoare triple {8159#true} main_#t~switch24#1 := main_#t~switch24#1 || 8 == main_~_hj_k~0#1; {8159#true} is VALID [2022-02-20 23:33:13,326 INFO L290 TraceCheckUtils]: 17: Hoare triple {8159#true} assume !main_#t~switch24#1; {8159#true} is VALID [2022-02-20 23:33:13,326 INFO L290 TraceCheckUtils]: 18: Hoare triple {8159#true} main_#t~switch24#1 := main_#t~switch24#1 || 7 == main_~_hj_k~0#1; {8159#true} is VALID [2022-02-20 23:33:13,326 INFO L290 TraceCheckUtils]: 19: Hoare triple {8159#true} assume !main_#t~switch24#1; {8159#true} is VALID [2022-02-20 23:33:13,326 INFO L290 TraceCheckUtils]: 20: Hoare triple {8159#true} main_#t~switch24#1 := main_#t~switch24#1 || 6 == main_~_hj_k~0#1; {8159#true} is VALID [2022-02-20 23:33:13,326 INFO L290 TraceCheckUtils]: 21: Hoare triple {8159#true} assume !main_#t~switch24#1; {8159#true} is VALID [2022-02-20 23:33:13,326 INFO L290 TraceCheckUtils]: 22: Hoare triple {8159#true} main_#t~switch24#1 := main_#t~switch24#1 || 5 == main_~_hj_k~0#1; {8159#true} is VALID [2022-02-20 23:33:13,326 INFO L290 TraceCheckUtils]: 23: Hoare triple {8159#true} assume !main_#t~switch24#1; {8159#true} is VALID [2022-02-20 23:33:13,326 INFO L290 TraceCheckUtils]: 24: Hoare triple {8159#true} main_#t~switch24#1 := main_#t~switch24#1 || 4 == main_~_hj_k~0#1; {8159#true} is VALID [2022-02-20 23:33:13,326 INFO L290 TraceCheckUtils]: 25: Hoare triple {8159#true} assume main_#t~switch24#1;call main_#t~mem32#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~mem32#1 % 256);havoc main_#t~mem32#1; {8159#true} is VALID [2022-02-20 23:33:13,326 INFO L290 TraceCheckUtils]: 26: Hoare triple {8159#true} main_#t~switch24#1 := main_#t~switch24#1 || 3 == main_~_hj_k~0#1; {8159#true} is VALID [2022-02-20 23:33:13,326 INFO L290 TraceCheckUtils]: 27: Hoare triple {8159#true} assume main_#t~switch24#1;call main_#t~mem33#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~mem33#1 % 256);havoc main_#t~mem33#1; {8159#true} is VALID [2022-02-20 23:33:13,326 INFO L290 TraceCheckUtils]: 28: Hoare triple {8159#true} main_#t~switch24#1 := main_#t~switch24#1 || 2 == main_~_hj_k~0#1; {8159#true} is VALID [2022-02-20 23:33:13,327 INFO L290 TraceCheckUtils]: 29: Hoare triple {8159#true} assume main_#t~switch24#1;call main_#t~mem34#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~mem34#1 % 256);havoc main_#t~mem34#1; {8159#true} is VALID [2022-02-20 23:33:13,327 INFO L290 TraceCheckUtils]: 30: Hoare triple {8159#true} main_#t~switch24#1 := main_#t~switch24#1 || 1 == main_~_hj_k~0#1; {8159#true} is VALID [2022-02-20 23:33:13,328 INFO L290 TraceCheckUtils]: 31: Hoare triple {8159#true} assume main_#t~switch24#1;call main_#t~mem35#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~mem35#1 % 256;havoc main_#t~mem35#1; {8159#true} is VALID [2022-02-20 23:33:13,328 INFO L290 TraceCheckUtils]: 32: Hoare triple {8159#true} havoc main_#t~switch24#1; {8159#true} is VALID [2022-02-20 23:33:13,328 INFO L290 TraceCheckUtils]: 33: Hoare triple {8159#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)))); {8159#true} is VALID [2022-02-20 23:33:13,328 INFO L290 TraceCheckUtils]: 34: Hoare triple {8159#true} goto; {8159#true} is VALID [2022-02-20 23:33:13,328 INFO L290 TraceCheckUtils]: 35: Hoare triple {8159#true} goto; {8159#true} is VALID [2022-02-20 23:33:13,328 INFO L290 TraceCheckUtils]: 36: Hoare triple {8159#true} goto; {8159#true} is VALID [2022-02-20 23:33:13,328 INFO L290 TraceCheckUtils]: 37: Hoare triple {8159#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); {8159#true} is VALID [2022-02-20 23:33:13,329 INFO L290 TraceCheckUtils]: 38: Hoare triple {8159#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); {8159#true} is VALID [2022-02-20 23:33:13,329 INFO L290 TraceCheckUtils]: 39: Hoare triple {8159#true} call main_#t~malloc36#1.base, main_#t~malloc36#1.offset := #Ultimate.allocOnHeap(44);call write~$Pointer$(main_#t~malloc36#1.base, main_#t~malloc36#1.offset, main_~user~0#1.base, 8 + main_~user~0#1.offset, 4);havoc main_#t~malloc36#1.base, main_#t~malloc36#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); {8159#true} is VALID [2022-02-20 23:33:13,329 INFO L290 TraceCheckUtils]: 40: Hoare triple {8159#true} assume !(main_#t~mem37#1.base == 0 && main_#t~mem37#1.offset == 0);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); {8159#true} is VALID [2022-02-20 23:33:13,329 INFO L272 TraceCheckUtils]: 41: Hoare triple {8159#true} call main_#t~memset~res39#1.base, main_#t~memset~res39#1.offset := #Ultimate.C_memset(main_#t~mem38#1.base, main_#t~mem38#1.offset, 0, 44); {8159#true} is VALID [2022-02-20 23:33:13,329 INFO L290 TraceCheckUtils]: 42: Hoare triple {8159#true} #t~loopctr280 := 0; {8159#true} is VALID [2022-02-20 23:33:13,329 INFO L290 TraceCheckUtils]: 43: Hoare triple {8159#true} assume !(#t~loopctr280 % 4294967296 < #amount % 4294967296); {8159#true} is VALID [2022-02-20 23:33:13,330 INFO L290 TraceCheckUtils]: 44: Hoare triple {8159#true} assume #res.base == #ptr.base && #res.offset == #ptr.offset; {8159#true} is VALID [2022-02-20 23:33:13,330 INFO L284 TraceCheckUtils]: 45: Hoare quadruple {8159#true} {8159#true} #1027#return; {8159#true} is VALID [2022-02-20 23:33:13,330 INFO L290 TraceCheckUtils]: 46: Hoare triple {8159#true} havoc main_#t~mem38#1.base, main_#t~mem38#1.offset;havoc main_#t~memset~res39#1.base, main_#t~memset~res39#1.offset;call main_#t~mem40#1.base, main_#t~mem40#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~mem40#1.base, 16 + main_#t~mem40#1.offset, 4);havoc main_#t~mem40#1.base, main_#t~mem40#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(32, main_#t~mem41#1.base, 4 + 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 write~int(5, main_#t~mem42#1.base, 8 + main_#t~mem42#1.offset, 4);havoc main_#t~mem42#1.base, main_#t~mem42#1.offset;call main_#t~mem43#1.base, main_#t~mem43#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~mem43#1.base, 20 + main_#t~mem43#1.offset, 4);havoc main_#t~mem43#1.base, main_#t~mem43#1.offset;call main_#t~mem44#1.base, main_#t~mem44#1.offset := read~$Pointer$(main_~user~0#1.base, 8 + main_~user~0#1.offset, 4);call main_#t~malloc45#1.base, main_#t~malloc45#1.offset := #Ultimate.allocOnHeap(384);call write~$Pointer$(main_#t~malloc45#1.base, main_#t~malloc45#1.offset, main_#t~mem44#1.base, main_#t~mem44#1.offset, 4);havoc main_#t~mem44#1.base, main_#t~mem44#1.offset;havoc main_#t~malloc45#1.base, main_#t~malloc45#1.offset;call main_#t~mem46#1.base, main_#t~mem46#1.offset := read~$Pointer$(main_~user~0#1.base, 8 + main_~user~0#1.offset, 4);call write~int(2685476833, main_#t~mem46#1.base, 40 + main_#t~mem46#1.offset, 4);havoc main_#t~mem46#1.base, main_#t~mem46#1.offset;call main_#t~mem47#1.base, main_#t~mem47#1.offset := read~$Pointer$(main_~user~0#1.base, 8 + main_~user~0#1.offset, 4);call main_#t~mem48#1.base, main_#t~mem48#1.offset := read~$Pointer$(main_#t~mem47#1.base, main_#t~mem47#1.offset, 4); {8159#true} is VALID [2022-02-20 23:33:13,330 INFO L290 TraceCheckUtils]: 47: Hoare triple {8159#true} assume !(main_#t~mem48#1.base == 0 && main_#t~mem48#1.offset == 0);havoc main_#t~mem47#1.base, main_#t~mem47#1.offset;havoc main_#t~mem48#1.base, main_#t~mem48#1.offset;call main_#t~mem50#1.base, main_#t~mem50#1.offset := read~$Pointer$(main_~user~0#1.base, 8 + main_~user~0#1.offset, 4);call main_#t~mem51#1.base, main_#t~mem51#1.offset := read~$Pointer$(main_#t~mem50#1.base, main_#t~mem50#1.offset, 4); {8159#true} is VALID [2022-02-20 23:33:13,330 INFO L272 TraceCheckUtils]: 48: Hoare triple {8159#true} call main_#t~memset~res52#1.base, main_#t~memset~res52#1.offset := #Ultimate.C_memset(main_#t~mem51#1.base, main_#t~mem51#1.offset, 0, 384); {8159#true} is VALID [2022-02-20 23:33:13,331 INFO L290 TraceCheckUtils]: 49: Hoare triple {8159#true} #t~loopctr280 := 0; {8311#(= |#Ultimate.C_memset_#t~loopctr280| 0)} is VALID [2022-02-20 23:33:13,331 INFO L290 TraceCheckUtils]: 50: Hoare triple {8311#(= |#Ultimate.C_memset_#t~loopctr280| 0)} assume !(#t~loopctr280 % 4294967296 < #amount % 4294967296); {8315#(not (< 0 (mod |#Ultimate.C_memset_#amount| 4294967296)))} is VALID [2022-02-20 23:33:13,332 INFO L290 TraceCheckUtils]: 51: Hoare triple {8315#(not (< 0 (mod |#Ultimate.C_memset_#amount| 4294967296)))} assume #res.base == #ptr.base && #res.offset == #ptr.offset; {8315#(not (< 0 (mod |#Ultimate.C_memset_#amount| 4294967296)))} is VALID [2022-02-20 23:33:13,332 INFO L284 TraceCheckUtils]: 52: Hoare quadruple {8315#(not (< 0 (mod |#Ultimate.C_memset_#amount| 4294967296)))} {8159#true} #1029#return; {8160#false} is VALID [2022-02-20 23:33:13,333 INFO L290 TraceCheckUtils]: 53: Hoare triple {8160#false} 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~memset~res52#1.base, main_#t~memset~res52#1.offset; {8160#false} is VALID [2022-02-20 23:33:13,333 INFO L290 TraceCheckUtils]: 54: Hoare triple {8160#false} goto; {8160#false} is VALID [2022-02-20 23:33:13,333 INFO L290 TraceCheckUtils]: 55: Hoare triple {8160#false} main_~users~0#1.base, main_~users~0#1.offset := main_~user~0#1.base, main_~user~0#1.offset; {8160#false} is VALID [2022-02-20 23:33:13,333 INFO L290 TraceCheckUtils]: 56: Hoare triple {8160#false} havoc main_~_ha_bkt~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 := read~int(main_#t~mem61#1.base, 12 + main_#t~mem61#1.offset, 4);main_#t~post63#1 := main_#t~mem62#1;call write~int(1 + main_#t~post63#1, main_#t~mem61#1.base, 12 + main_#t~mem61#1.offset, 4);havoc main_#t~mem61#1.base, main_#t~mem61#1.offset;havoc main_#t~mem62#1;havoc main_#t~post63#1; {8160#false} is VALID [2022-02-20 23:33:13,333 INFO L290 TraceCheckUtils]: 57: Hoare triple {8160#false} call main_#t~mem64#1.base, main_#t~mem64#1.offset := read~$Pointer$(main_~users~0#1.base, 8 + main_~users~0#1.offset, 4);call main_#t~mem65#1 := read~int(main_#t~mem64#1.base, 4 + main_#t~mem64#1.offset, 4);main_~_ha_bkt~0#1 := (if 0 == main_~_ha_hashv~0#1 || 0 == main_#t~mem65#1 - 1 then 0 else (if 1 == main_#t~mem65#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~mem65#1 - 1))) else (if 1 == main_~_ha_hashv~0#1 then (if 1 == main_#t~mem65#1 - 1 || 0 == main_#t~mem65#1 - 1 then main_#t~mem65#1 - 1 else (if main_#t~mem65#1 - 1 >= 0 then (main_#t~mem65#1 - 1) % 2 else ~bitwiseAnd(main_~_ha_hashv~0#1, main_#t~mem65#1 - 1))) else ~bitwiseAnd(main_~_ha_hashv~0#1, main_#t~mem65#1 - 1))));havoc main_#t~mem64#1.base, main_#t~mem64#1.offset;havoc main_#t~mem65#1; {8160#false} is VALID [2022-02-20 23:33:13,333 INFO L290 TraceCheckUtils]: 58: Hoare triple {8160#false} goto; {8160#false} is VALID [2022-02-20 23:33:13,333 INFO L290 TraceCheckUtils]: 59: Hoare triple {8160#false} call main_#t~mem66#1.base, main_#t~mem66#1.offset := read~$Pointer$(main_~users~0#1.base, 8 + main_~users~0#1.offset, 4);call main_#t~mem67#1.base, main_#t~mem67#1.offset := read~$Pointer$(main_#t~mem66#1.base, main_#t~mem66#1.offset, 4);main_~_ha_head~0#1.base, main_~_ha_head~0#1.offset := main_#t~mem67#1.base, main_#t~mem67#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~mem66#1.base, main_#t~mem66#1.offset;havoc main_#t~mem67#1.base, main_#t~mem67#1.offset;call main_#t~mem68#1 := read~int(main_~_ha_head~0#1.base, 4 + main_~_ha_head~0#1.offset, 4);main_#t~post69#1 := main_#t~mem68#1;call write~int(1 + main_#t~post69#1, main_~_ha_head~0#1.base, 4 + main_~_ha_head~0#1.offset, 4);havoc main_#t~mem68#1;havoc main_#t~post69#1;call main_#t~mem70#1.base, main_#t~mem70#1.offset := read~$Pointer$(main_~_ha_head~0#1.base, main_~_ha_head~0#1.offset, 4);call write~$Pointer$(main_#t~mem70#1.base, main_#t~mem70#1.offset, main_~user~0#1.base, 24 + main_~user~0#1.offset, 4);havoc main_#t~mem70#1.base, main_#t~mem70#1.offset;call write~$Pointer$(0, 0, main_~user~0#1.base, 20 + main_~user~0#1.offset, 4);call main_#t~mem71#1.base, main_#t~mem71#1.offset := read~$Pointer$(main_~_ha_head~0#1.base, main_~_ha_head~0#1.offset, 4); {8160#false} is VALID [2022-02-20 23:33:13,334 INFO L290 TraceCheckUtils]: 60: Hoare triple {8160#false} assume main_#t~mem71#1.base != 0 || main_#t~mem71#1.offset != 0;havoc main_#t~mem71#1.base, main_#t~mem71#1.offset;call main_#t~mem72#1.base, main_#t~mem72#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~mem72#1.base, 12 + main_#t~mem72#1.offset, 4);havoc main_#t~mem72#1.base, main_#t~mem72#1.offset; {8160#false} is VALID [2022-02-20 23:33:13,334 INFO L290 TraceCheckUtils]: 61: Hoare triple {8160#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~mem74#1 := read~int(main_~_ha_head~0#1.base, 4 + main_~_ha_head~0#1.offset, 4);call main_#t~mem73#1 := read~int(main_~_ha_head~0#1.base, 8 + main_~_ha_head~0#1.offset, 4);main_#t~short77#1 := main_#t~mem74#1 % 4294967296 >= 10 * (1 + main_#t~mem73#1) % 4294967296; {8160#false} is VALID [2022-02-20 23:33:13,334 INFO L290 TraceCheckUtils]: 62: Hoare triple {8160#false} assume !main_#t~short77#1; {8160#false} is VALID [2022-02-20 23:33:13,334 INFO L290 TraceCheckUtils]: 63: Hoare triple {8160#false} assume !main_#t~short77#1;havoc main_#t~mem74#1;havoc main_#t~mem73#1;havoc main_#t~mem75#1.base, main_#t~mem75#1.offset;havoc main_#t~mem76#1;havoc main_#t~short77#1; {8160#false} is VALID [2022-02-20 23:33:13,334 INFO L290 TraceCheckUtils]: 64: Hoare triple {8160#false} goto; {8160#false} is VALID [2022-02-20 23:33:13,334 INFO L290 TraceCheckUtils]: 65: Hoare triple {8160#false} goto; {8160#false} is VALID [2022-02-20 23:33:13,334 INFO L290 TraceCheckUtils]: 66: Hoare triple {8160#false} goto; {8160#false} is VALID [2022-02-20 23:33:13,335 INFO L290 TraceCheckUtils]: 67: Hoare triple {8160#false} goto; {8160#false} is VALID [2022-02-20 23:33:13,335 INFO L290 TraceCheckUtils]: 68: Hoare triple {8160#false} call main_#t~mem144#1.base, main_#t~mem144#1.offset := read~$Pointer$(main_~user~0#1.base, 8 + main_~user~0#1.offset, 4);call main_#t~mem145#1 := read~int(main_#t~mem144#1.base, 12 + main_#t~mem144#1.offset, 4); {8160#false} is VALID [2022-02-20 23:33:13,335 INFO L272 TraceCheckUtils]: 69: Hoare triple {8160#false} call test_int((if main_#t~mem145#1 % 4294967296 % 4294967296 <= 2147483647 then main_#t~mem145#1 % 4294967296 % 4294967296 else main_#t~mem145#1 % 4294967296 % 4294967296 - 4294967296)); {8160#false} is VALID [2022-02-20 23:33:13,335 INFO L290 TraceCheckUtils]: 70: Hoare triple {8160#false} ~a := #in~a;#t~post3 := ~count_int~0;~count_int~0 := 1 + #t~post3;#t~switch4 := 0 == #t~post3; {8160#false} is VALID [2022-02-20 23:33:13,335 INFO L290 TraceCheckUtils]: 71: Hoare triple {8160#false} assume #t~switch4; {8160#false} is VALID [2022-02-20 23:33:13,335 INFO L272 TraceCheckUtils]: 72: Hoare triple {8160#false} call __VERIFIER_assert((if 1 == ~a then 1 else 0)); {8160#false} is VALID [2022-02-20 23:33:13,335 INFO L290 TraceCheckUtils]: 73: Hoare triple {8160#false} ~cond := #in~cond; {8160#false} is VALID [2022-02-20 23:33:13,335 INFO L290 TraceCheckUtils]: 74: Hoare triple {8160#false} assume 0 == ~cond; {8160#false} is VALID [2022-02-20 23:33:13,336 INFO L290 TraceCheckUtils]: 75: Hoare triple {8160#false} assume !false; {8160#false} is VALID [2022-02-20 23:33:13,336 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-02-20 23:33:13,336 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 23:33:13,336 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 23:33:13,336 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1148305389] [2022-02-20 23:33:13,336 WARN L317 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-02-20 23:33:13,337 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [967607588] [2022-02-20 23:33:13,337 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [967607588] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:33:13,337 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:33:13,337 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-02-20 23:33:13,337 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [302378077] [2022-02-20 23:33:13,337 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:33:13,338 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 17.5) internal successors, (70), 4 states have internal predecessors, (70), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 76 [2022-02-20 23:33:13,338 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:33:13,338 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 17.5) internal successors, (70), 4 states have internal predecessors, (70), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-02-20 23:33:13,391 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-20 23:33:13,392 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-02-20 23:33:13,392 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 23:33:13,392 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-02-20 23:33:13,392 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-02-20 23:33:13,392 INFO L87 Difference]: Start difference. First operand 338 states and 443 transitions. Second operand has 4 states, 4 states have (on average 17.5) internal successors, (70), 4 states have internal predecessors, (70), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-02-20 23:33:14,113 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:33:14,114 INFO L93 Difference]: Finished difference Result 631 states and 839 transitions. [2022-02-20 23:33:14,114 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-02-20 23:33:14,114 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 17.5) internal successors, (70), 4 states have internal predecessors, (70), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 76 [2022-02-20 23:33:14,114 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:33:14,115 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 17.5) internal successors, (70), 4 states have internal predecessors, (70), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-02-20 23:33:14,119 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 604 transitions. [2022-02-20 23:33:14,119 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 17.5) internal successors, (70), 4 states have internal predecessors, (70), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-02-20 23:33:14,122 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 604 transitions. [2022-02-20 23:33:14,123 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 604 transitions. [2022-02-20 23:33:14,582 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 604 edges. 604 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:33:14,590 INFO L225 Difference]: With dead ends: 631 [2022-02-20 23:33:14,590 INFO L226 Difference]: Without dead ends: 341 [2022-02-20 23:33:14,591 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-20 23:33:14,592 INFO L933 BasicCegarLoop]: 297 mSDtfsCounter, 2 mSDsluCounter, 590 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 887 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-20 23:33:14,592 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2 Valid, 887 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 23:33:14,593 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 341 states. [2022-02-20 23:33:14,620 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 341 to 341. [2022-02-20 23:33:14,621 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:33:14,621 INFO L82 GeneralOperation]: Start isEquivalent. First operand 341 states. Second operand has 341 states, 314 states have (on average 1.286624203821656) internal successors, (404), 331 states have internal predecessors, (404), 21 states have call successors, (21), 3 states have call predecessors, (21), 4 states have return successors, (22), 7 states have call predecessors, (22), 21 states have call successors, (22) [2022-02-20 23:33:14,622 INFO L74 IsIncluded]: Start isIncluded. First operand 341 states. Second operand has 341 states, 314 states have (on average 1.286624203821656) internal successors, (404), 331 states have internal predecessors, (404), 21 states have call successors, (21), 3 states have call predecessors, (21), 4 states have return successors, (22), 7 states have call predecessors, (22), 21 states have call successors, (22) [2022-02-20 23:33:14,622 INFO L87 Difference]: Start difference. First operand 341 states. Second operand has 341 states, 314 states have (on average 1.286624203821656) internal successors, (404), 331 states have internal predecessors, (404), 21 states have call successors, (21), 3 states have call predecessors, (21), 4 states have return successors, (22), 7 states have call predecessors, (22), 21 states have call successors, (22) [2022-02-20 23:33:14,630 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:33:14,631 INFO L93 Difference]: Finished difference Result 341 states and 447 transitions. [2022-02-20 23:33:14,631 INFO L276 IsEmpty]: Start isEmpty. Operand 341 states and 447 transitions. [2022-02-20 23:33:14,631 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:33:14,631 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:33:14,632 INFO L74 IsIncluded]: Start isIncluded. First operand has 341 states, 314 states have (on average 1.286624203821656) internal successors, (404), 331 states have internal predecessors, (404), 21 states have call successors, (21), 3 states have call predecessors, (21), 4 states have return successors, (22), 7 states have call predecessors, (22), 21 states have call successors, (22) Second operand 341 states. [2022-02-20 23:33:14,633 INFO L87 Difference]: Start difference. First operand has 341 states, 314 states have (on average 1.286624203821656) internal successors, (404), 331 states have internal predecessors, (404), 21 states have call successors, (21), 3 states have call predecessors, (21), 4 states have return successors, (22), 7 states have call predecessors, (22), 21 states have call successors, (22) Second operand 341 states. [2022-02-20 23:33:14,640 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:33:14,640 INFO L93 Difference]: Finished difference Result 341 states and 447 transitions. [2022-02-20 23:33:14,640 INFO L276 IsEmpty]: Start isEmpty. Operand 341 states and 447 transitions. [2022-02-20 23:33:14,641 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:33:14,641 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:33:14,641 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:33:14,641 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:33:14,642 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 341 states, 314 states have (on average 1.286624203821656) internal successors, (404), 331 states have internal predecessors, (404), 21 states have call successors, (21), 3 states have call predecessors, (21), 4 states have return successors, (22), 7 states have call predecessors, (22), 21 states have call successors, (22) [2022-02-20 23:33:14,650 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 341 states to 341 states and 447 transitions. [2022-02-20 23:33:14,650 INFO L78 Accepts]: Start accepts. Automaton has 341 states and 447 transitions. Word has length 76 [2022-02-20 23:33:14,650 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:33:14,651 INFO L470 AbstractCegarLoop]: Abstraction has 341 states and 447 transitions. [2022-02-20 23:33:14,651 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 17.5) internal successors, (70), 4 states have internal predecessors, (70), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-02-20 23:33:14,651 INFO L276 IsEmpty]: Start isEmpty. Operand 341 states and 447 transitions. [2022-02-20 23:33:14,651 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2022-02-20 23:33:14,651 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:33:14,652 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 23:33:14,693 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-20 23:33:14,867 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 23:33:14,867 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 23:33:14,868 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:33:14,868 INFO L85 PathProgramCache]: Analyzing trace with hash -975375717, now seen corresponding path program 1 times [2022-02-20 23:33:14,868 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 23:33:14,868 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2063048634] [2022-02-20 23:33:14,868 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:33:14,868 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 23:33:14,915 ERROR L252 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-02-20 23:33:14,920 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [511274073] [2022-02-20 23:33:14,921 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:33:14,921 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 23:33:14,921 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 23:33:14,941 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-20 23:33:14,942 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-20 23:33:16,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:33:16,024 INFO L263 TraceCheckSpWp]: Trace formula consists of 714 conjuncts, 11 conjunts are in the unsatisfiable core [2022-02-20 23:33:16,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:33:16,066 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 23:33:16,251 INFO L290 TraceCheckUtils]: 0: Hoare triple {10245#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~0 := 0; {10245#true} is VALID [2022-02-20 23:33:16,251 INFO L290 TraceCheckUtils]: 1: Hoare triple {10245#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc8#1.base, main_#t~malloc8#1.offset, main_#t~mem9#1, main_#t~mem10#1, main_#t~mem11#1, main_#t~mem13#1, main_#t~mem12#1, main_#t~mem14#1, main_#t~mem15#1, main_#t~mem17#1, main_#t~mem16#1, main_#t~mem18#1, main_#t~mem19#1, main_#t~mem21#1, main_#t~mem20#1, main_#t~mem22#1, main_#t~mem23#1, main_#t~switch24#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_#t~mem31#1, main_#t~mem32#1, main_#t~mem33#1, main_#t~mem34#1, main_#t~mem35#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~malloc36#1.base, main_#t~malloc36#1.offset, main_#t~mem37#1.base, main_#t~mem37#1.offset, main_#t~mem38#1.base, main_#t~mem38#1.offset, main_#t~memset~res39#1.base, main_#t~memset~res39#1.offset, main_#t~mem40#1.base, main_#t~mem40#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~malloc45#1.base, main_#t~malloc45#1.offset, main_#t~mem46#1.base, main_#t~mem46#1.offset, main_#t~mem47#1.base, main_#t~mem47#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~memset~res52#1.base, main_#t~memset~res52#1.offset, 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~mem58#1.base, main_#t~mem58#1.offset, main_#t~mem59#1.base, main_#t~mem59#1.offset, main_#t~mem60#1.base, main_#t~mem60#1.offset, main_#t~mem61#1.base, main_#t~mem61#1.offset, main_#t~mem62#1, main_#t~post63#1, main_#t~mem64#1.base, main_#t~mem64#1.offset, main_#t~mem65#1, main_#t~mem66#1.base, main_#t~mem66#1.offset, main_#t~mem67#1.base, main_#t~mem67#1.offset, main_#t~mem68#1, main_#t~post69#1, main_#t~mem70#1.base, main_#t~mem70#1.offset, main_#t~mem71#1.base, main_#t~mem71#1.offset, main_#t~mem72#1.base, main_#t~mem72#1.offset, main_#t~mem74#1, main_#t~mem73#1, main_#t~mem75#1.base, main_#t~mem75#1.offset, main_#t~mem76#1, main_#t~short77#1, main_#t~mem78#1.base, main_#t~mem78#1.offset, main_#t~mem79#1, main_#t~malloc80#1.base, main_#t~malloc80#1.offset, main_#t~mem81#1.base, main_#t~mem81#1.offset, main_#t~mem82#1.base, main_#t~mem82#1.offset, main_#t~mem83#1.base, main_#t~mem83#1.offset, main_#t~mem84#1, main_#t~memset~res85#1.base, main_#t~memset~res85#1.offset, main_#t~mem86#1.base, main_#t~mem86#1.offset, main_#t~mem87#1.base, main_#t~mem87#1.offset, main_#t~mem90#1, main_#t~mem88#1.base, main_#t~mem88#1.offset, main_#t~mem89#1, main_#t~mem91#1.base, main_#t~mem91#1.offset, main_#t~mem94#1, main_#t~mem92#1.base, main_#t~mem92#1.offset, main_#t~mem93#1, main_#t~ite95#1, main_#t~mem96#1.base, main_#t~mem96#1.offset, main_#t~mem100#1.base, main_#t~mem100#1.offset, main_#t~mem101#1.base, main_#t~mem101#1.offset, main_#t~mem102#1.base, main_#t~mem102#1.offset, main_#t~mem103#1.base, main_#t~mem103#1.offset, main_#t~mem106#1, main_#t~mem104#1.base, main_#t~mem104#1.offset, main_#t~mem105#1, main_#t~mem107#1.base, main_#t~mem107#1.offset, main_#t~mem108#1, main_#t~pre109#1, main_#t~mem110#1.base, main_#t~mem110#1.offset, main_#t~mem111#1, main_#t~mem112#1.base, main_#t~mem112#1.offset, main_#t~mem113#1, main_#t~post114#1, main_#t~mem118#1, main_#t~mem116#1, main_#t~mem115#1.base, main_#t~mem115#1.offset, main_#t~mem117#1, main_#t~mem119#1, main_#t~post120#1, main_#t~mem121#1.base, main_#t~mem121#1.offset, main_#t~mem122#1.base, main_#t~mem122#1.offset, main_#t~mem123#1.base, main_#t~mem123#1.offset, main_#t~post97#1, main_#t~mem98#1.base, main_#t~mem98#1.offset, main_#t~mem99#1, main_#t~mem124#1.base, main_#t~mem124#1.offset, main_#t~mem125#1.base, main_#t~mem125#1.offset, main_#t~mem126#1.base, main_#t~mem126#1.offset, main_#t~mem127#1, main_#t~mem128#1.base, main_#t~mem128#1.offset, main_#t~mem129#1, main_#t~post130#1, main_#t~mem131#1.base, main_#t~mem131#1.offset, main_#t~mem132#1.base, main_#t~mem132#1.offset, main_#t~mem133#1.base, main_#t~mem133#1.offset, main_#t~mem134#1.base, main_#t~mem134#1.offset, main_#t~mem137#1, main_#t~mem135#1.base, main_#t~mem135#1.offset, main_#t~mem136#1, main_#t~ite140#1, main_#t~mem138#1.base, main_#t~mem138#1.offset, main_#t~mem139#1, main_#t~mem141#1.base, main_#t~mem141#1.offset, main_#t~mem142#1, main_#t~mem143#1.base, main_#t~mem143#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~mem144#1.base, main_#t~mem144#1.offset, main_#t~mem145#1, main_#t~mem5#1, main_#t~post6#1, main_#t~mem7#1, main_#t~mem149#1, main_#t~mem148#1, main_#t~mem150#1, main_#t~mem151#1, main_#t~mem153#1, main_#t~mem152#1, main_#t~mem154#1, main_#t~mem155#1, main_#t~mem157#1, main_#t~mem156#1, main_#t~mem158#1, main_#t~mem159#1, main_#t~switch160#1, main_#t~mem161#1, main_#t~mem162#1, main_#t~mem163#1, main_#t~mem164#1, main_#t~mem165#1, main_#t~mem166#1, main_#t~mem167#1, main_#t~mem168#1, main_#t~mem169#1, main_#t~mem170#1, main_#t~mem171#1, main_~_hj_i~1#1, main_~_hj_j~1#1, main_~_hj_k~1#1, main_~_hj_key~1#1.base, main_~_hj_key~1#1.offset, main_#t~mem172#1.base, main_#t~mem172#1.offset, main_#t~mem173#1, main_#t~mem174#1.base, main_#t~mem174#1.offset, main_#t~mem175#1.base, main_#t~mem175#1.offset, main_#t~mem176#1.base, main_#t~mem176#1.offset, main_#t~mem177#1.base, main_#t~mem177#1.offset, main_#t~mem178#1.base, main_#t~mem178#1.offset, main_#t~mem179#1.base, main_#t~mem179#1.offset, main_#t~mem180#1.base, main_#t~mem180#1.offset, main_#t~mem181#1, main_#t~mem182#1, main_#t~mem183#1, main_#t~short184#1, main_#t~mem185#1.base, main_#t~mem185#1.offset, main_#t~ret186#1, main_#t~mem187#1.base, main_#t~mem187#1.offset, main_#t~mem188#1.base, main_#t~mem188#1.offset, main_#t~mem189#1.base, main_#t~mem189#1.offset, main_#t~mem190#1, main_~_hf_bkt~0#1, main_~_hf_hashv~0#1, main_#t~mem191#1.base, main_#t~mem191#1.offset, main_#t~mem192#1.base, main_#t~mem192#1.offset, main_#t~short193#1, main_#t~mem194#1.base, main_#t~mem194#1.offset, main_#t~mem195#1.base, main_#t~mem195#1.offset, main_#t~mem196#1.base, main_#t~mem196#1.offset, main_#t~mem197#1.base, main_#t~mem197#1.offset, main_#t~mem198#1.base, main_#t~mem198#1.offset, main_#t~mem199#1.base, main_#t~mem199#1.offset, main_#t~mem200#1.base, main_#t~mem200#1.offset, main_#t~mem201#1.base, main_#t~mem201#1.offset, main_#t~mem202#1, main_#t~mem203#1.base, main_#t~mem203#1.offset, main_#t~mem204#1.base, main_#t~mem204#1.offset, main_#t~mem205#1.base, main_#t~mem205#1.offset, main_#t~mem206#1, main_#t~mem207#1.base, main_#t~mem207#1.offset, main_#t~mem208#1.base, main_#t~mem208#1.offset, main_#t~mem209#1.base, main_#t~mem209#1.offset, main_#t~mem210#1.base, main_#t~mem210#1.offset, main_#t~mem211#1.base, main_#t~mem211#1.offset, main_#t~mem212#1, main_#t~mem213#1.base, main_#t~mem213#1.offset, main_#t~mem216#1, main_#t~mem214#1.base, main_#t~mem214#1.offset, main_#t~mem215#1, main_#t~mem217#1.base, main_#t~mem217#1.offset, main_#t~mem218#1.base, main_#t~mem218#1.offset, main_#t~mem219#1, main_#t~post220#1, main_#t~mem221#1.base, main_#t~mem221#1.offset, main_#t~mem222#1.base, main_#t~mem222#1.offset, main_#t~mem223#1.base, main_#t~mem223#1.offset, main_#t~mem224#1.base, main_#t~mem224#1.offset, main_#t~mem225#1.base, main_#t~mem225#1.offset, main_#t~mem226#1.base, main_#t~mem226#1.offset, main_#t~mem227#1.base, main_#t~mem227#1.offset, main_#t~mem228#1.base, main_#t~mem228#1.offset, main_~_hd_head~0#1.base, main_~_hd_head~0#1.offset, main_#t~mem229#1.base, main_#t~mem229#1.offset, main_#t~mem230#1, main_#t~post231#1, main_~_hd_bkt~0#1, main_~_hd_hh_del~0#1.base, main_~_hd_hh_del~0#1.offset, main_#t~mem232#1.base, main_#t~mem232#1.offset, main_#t~mem233#1, main_#t~mem146#1, main_#t~mem147#1, main_#t~ite235#1.base, main_#t~ite235#1.offset, main_#t~mem234#1.base, main_#t~mem234#1.offset, main_#t~mem238#1.base, main_#t~mem238#1.offset, main_#t~mem239#1.base, main_#t~mem239#1.offset, main_#t~short240#1, main_#t~mem241#1.base, main_#t~mem241#1.offset, main_#t~mem242#1.base, main_#t~mem242#1.offset, main_#t~mem243#1.base, main_#t~mem243#1.offset, main_#t~mem244#1.base, main_#t~mem244#1.offset, main_#t~mem245#1.base, main_#t~mem245#1.offset, main_#t~mem246#1.base, main_#t~mem246#1.offset, main_#t~mem247#1.base, main_#t~mem247#1.offset, main_#t~mem248#1.base, main_#t~mem248#1.offset, main_#t~mem249#1, main_#t~mem250#1.base, main_#t~mem250#1.offset, main_#t~mem251#1.base, main_#t~mem251#1.offset, main_#t~mem252#1.base, main_#t~mem252#1.offset, main_#t~mem253#1, main_#t~mem254#1.base, main_#t~mem254#1.offset, main_#t~mem255#1.base, main_#t~mem255#1.offset, main_#t~mem256#1.base, main_#t~mem256#1.offset, main_#t~mem257#1.base, main_#t~mem257#1.offset, main_#t~mem258#1.base, main_#t~mem258#1.offset, main_#t~mem259#1, main_#t~mem260#1.base, main_#t~mem260#1.offset, main_#t~mem263#1, main_#t~mem261#1.base, main_#t~mem261#1.offset, main_#t~mem262#1, main_#t~mem264#1.base, main_#t~mem264#1.offset, main_#t~mem265#1.base, main_#t~mem265#1.offset, main_#t~mem266#1, main_#t~post267#1, main_#t~mem268#1.base, main_#t~mem268#1.offset, main_#t~mem269#1.base, main_#t~mem269#1.offset, main_#t~mem270#1.base, main_#t~mem270#1.offset, main_#t~mem271#1.base, main_#t~mem271#1.offset, main_#t~mem272#1.base, main_#t~mem272#1.offset, main_#t~mem273#1.base, main_#t~mem273#1.offset, main_#t~mem274#1.base, main_#t~mem274#1.offset, main_#t~mem275#1.base, main_#t~mem275#1.offset, main_~_hd_head~1#1.base, main_~_hd_head~1#1.offset, main_#t~mem276#1.base, main_#t~mem276#1.offset, main_#t~mem277#1, main_#t~post278#1, main_~_hd_bkt~1#1, main_~_hd_hh_del~1#1.base, main_~_hd_hh_del~1#1.offset, main_#t~ite237#1.base, main_#t~ite237#1.offset, main_#t~mem236#1.base, main_#t~mem236#1.offset, main_~#i~0#1.base, main_~#i~0#1.offset, main_~user~0#1.base, main_~user~0#1.offset, main_~tmp~0#1.base, main_~tmp~0#1.offset, main_~users~0#1.base, main_~users~0#1.offset, main_~temp~0#1.base, main_~temp~0#1.offset;call main_~#i~0#1.base, main_~#i~0#1.offset := #Ultimate.allocOnStack(4);havoc main_~user~0#1.base, main_~user~0#1.offset;havoc main_~tmp~0#1.base, main_~tmp~0#1.offset;main_~users~0#1.base, main_~users~0#1.offset := 0, 0;call write~int(0, main_~#i~0#1.base, main_~#i~0#1.offset, 4); {10245#true} is VALID [2022-02-20 23:33:16,252 INFO L290 TraceCheckUtils]: 2: Hoare triple {10245#true} call main_#t~mem7#1 := read~int(main_~#i~0#1.base, main_~#i~0#1.offset, 4); {10245#true} is VALID [2022-02-20 23:33:16,252 INFO L290 TraceCheckUtils]: 3: Hoare triple {10245#true} assume !!(main_#t~mem7#1 < 10);havoc main_#t~mem7#1;call main_#t~malloc8#1.base, main_#t~malloc8#1.offset := #Ultimate.allocOnHeap(40);main_~user~0#1.base, main_~user~0#1.offset := main_#t~malloc8#1.base, main_#t~malloc8#1.offset;havoc main_#t~malloc8#1.base, main_#t~malloc8#1.offset; {10245#true} is VALID [2022-02-20 23:33:16,252 INFO L290 TraceCheckUtils]: 4: Hoare triple {10245#true} assume !(main_~user~0#1.base == 0 && main_~user~0#1.offset == 0); {10245#true} is VALID [2022-02-20 23:33:16,252 INFO L290 TraceCheckUtils]: 5: Hoare triple {10245#true} call main_#t~mem9#1 := read~int(main_~#i~0#1.base, main_~#i~0#1.offset, 4);call write~int(main_#t~mem9#1, main_~user~0#1.base, main_~user~0#1.offset, 4);havoc main_#t~mem9#1;call main_#t~mem10#1 := read~int(main_~#i~0#1.base, main_~#i~0#1.offset, 4);call main_#t~mem11#1 := read~int(main_~#i~0#1.base, main_~#i~0#1.offset, 4);call write~int(main_#t~mem10#1 * main_#t~mem11#1, main_~user~0#1.base, 4 + main_~user~0#1.offset, 4);havoc main_#t~mem10#1;havoc main_#t~mem11#1; {10245#true} is VALID [2022-02-20 23:33:16,252 INFO L290 TraceCheckUtils]: 6: Hoare triple {10245#true} havoc main_~_ha_hashv~0#1; {10245#true} is VALID [2022-02-20 23:33:16,252 INFO L290 TraceCheckUtils]: 7: Hoare triple {10245#true} goto; {10245#true} is VALID [2022-02-20 23:33:16,252 INFO L290 TraceCheckUtils]: 8: Hoare triple {10245#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; {10245#true} is VALID [2022-02-20 23:33:16,253 INFO L290 TraceCheckUtils]: 9: Hoare triple {10245#true} assume !(main_~_hj_k~0#1 % 4294967296 >= 12); {10245#true} is VALID [2022-02-20 23:33:16,253 INFO L290 TraceCheckUtils]: 10: Hoare triple {10245#true} main_~_ha_hashv~0#1 := 4 + main_~_ha_hashv~0#1;main_#t~switch24#1 := 11 == main_~_hj_k~0#1; {10245#true} is VALID [2022-02-20 23:33:16,253 INFO L290 TraceCheckUtils]: 11: Hoare triple {10245#true} assume !main_#t~switch24#1; {10245#true} is VALID [2022-02-20 23:33:16,253 INFO L290 TraceCheckUtils]: 12: Hoare triple {10245#true} main_#t~switch24#1 := main_#t~switch24#1 || 10 == main_~_hj_k~0#1; {10245#true} is VALID [2022-02-20 23:33:16,253 INFO L290 TraceCheckUtils]: 13: Hoare triple {10245#true} assume !main_#t~switch24#1; {10245#true} is VALID [2022-02-20 23:33:16,253 INFO L290 TraceCheckUtils]: 14: Hoare triple {10245#true} main_#t~switch24#1 := main_#t~switch24#1 || 9 == main_~_hj_k~0#1; {10245#true} is VALID [2022-02-20 23:33:16,253 INFO L290 TraceCheckUtils]: 15: Hoare triple {10245#true} assume !main_#t~switch24#1; {10245#true} is VALID [2022-02-20 23:33:16,253 INFO L290 TraceCheckUtils]: 16: Hoare triple {10245#true} main_#t~switch24#1 := main_#t~switch24#1 || 8 == main_~_hj_k~0#1; {10245#true} is VALID [2022-02-20 23:33:16,254 INFO L290 TraceCheckUtils]: 17: Hoare triple {10245#true} assume !main_#t~switch24#1; {10245#true} is VALID [2022-02-20 23:33:16,254 INFO L290 TraceCheckUtils]: 18: Hoare triple {10245#true} main_#t~switch24#1 := main_#t~switch24#1 || 7 == main_~_hj_k~0#1; {10245#true} is VALID [2022-02-20 23:33:16,254 INFO L290 TraceCheckUtils]: 19: Hoare triple {10245#true} assume !main_#t~switch24#1; {10245#true} is VALID [2022-02-20 23:33:16,254 INFO L290 TraceCheckUtils]: 20: Hoare triple {10245#true} main_#t~switch24#1 := main_#t~switch24#1 || 6 == main_~_hj_k~0#1; {10245#true} is VALID [2022-02-20 23:33:16,254 INFO L290 TraceCheckUtils]: 21: Hoare triple {10245#true} assume !main_#t~switch24#1; {10245#true} is VALID [2022-02-20 23:33:16,254 INFO L290 TraceCheckUtils]: 22: Hoare triple {10245#true} main_#t~switch24#1 := main_#t~switch24#1 || 5 == main_~_hj_k~0#1; {10245#true} is VALID [2022-02-20 23:33:16,254 INFO L290 TraceCheckUtils]: 23: Hoare triple {10245#true} assume !main_#t~switch24#1; {10245#true} is VALID [2022-02-20 23:33:16,255 INFO L290 TraceCheckUtils]: 24: Hoare triple {10245#true} main_#t~switch24#1 := main_#t~switch24#1 || 4 == main_~_hj_k~0#1; {10245#true} is VALID [2022-02-20 23:33:16,255 INFO L290 TraceCheckUtils]: 25: Hoare triple {10245#true} assume main_#t~switch24#1;call main_#t~mem32#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~mem32#1 % 256);havoc main_#t~mem32#1; {10245#true} is VALID [2022-02-20 23:33:16,255 INFO L290 TraceCheckUtils]: 26: Hoare triple {10245#true} main_#t~switch24#1 := main_#t~switch24#1 || 3 == main_~_hj_k~0#1; {10245#true} is VALID [2022-02-20 23:33:16,255 INFO L290 TraceCheckUtils]: 27: Hoare triple {10245#true} assume main_#t~switch24#1;call main_#t~mem33#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~mem33#1 % 256);havoc main_#t~mem33#1; {10245#true} is VALID [2022-02-20 23:33:16,256 INFO L290 TraceCheckUtils]: 28: Hoare triple {10245#true} main_#t~switch24#1 := main_#t~switch24#1 || 2 == main_~_hj_k~0#1; {10245#true} is VALID [2022-02-20 23:33:16,256 INFO L290 TraceCheckUtils]: 29: Hoare triple {10245#true} assume main_#t~switch24#1;call main_#t~mem34#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~mem34#1 % 256);havoc main_#t~mem34#1; {10245#true} is VALID [2022-02-20 23:33:16,256 INFO L290 TraceCheckUtils]: 30: Hoare triple {10245#true} main_#t~switch24#1 := main_#t~switch24#1 || 1 == main_~_hj_k~0#1; {10245#true} is VALID [2022-02-20 23:33:16,256 INFO L290 TraceCheckUtils]: 31: Hoare triple {10245#true} assume main_#t~switch24#1;call main_#t~mem35#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~mem35#1 % 256;havoc main_#t~mem35#1; {10245#true} is VALID [2022-02-20 23:33:16,256 INFO L290 TraceCheckUtils]: 32: Hoare triple {10245#true} havoc main_#t~switch24#1; {10245#true} is VALID [2022-02-20 23:33:16,256 INFO L290 TraceCheckUtils]: 33: Hoare triple {10245#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)))); {10245#true} is VALID [2022-02-20 23:33:16,256 INFO L290 TraceCheckUtils]: 34: Hoare triple {10245#true} goto; {10245#true} is VALID [2022-02-20 23:33:16,257 INFO L290 TraceCheckUtils]: 35: Hoare triple {10245#true} goto; {10245#true} is VALID [2022-02-20 23:33:16,257 INFO L290 TraceCheckUtils]: 36: Hoare triple {10245#true} goto; {10245#true} is VALID [2022-02-20 23:33:16,257 INFO L290 TraceCheckUtils]: 37: Hoare triple {10245#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); {10245#true} is VALID [2022-02-20 23:33:16,257 INFO L290 TraceCheckUtils]: 38: Hoare triple {10245#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); {10245#true} is VALID [2022-02-20 23:33:16,257 INFO L290 TraceCheckUtils]: 39: Hoare triple {10245#true} call main_#t~malloc36#1.base, main_#t~malloc36#1.offset := #Ultimate.allocOnHeap(44);call write~$Pointer$(main_#t~malloc36#1.base, main_#t~malloc36#1.offset, main_~user~0#1.base, 8 + main_~user~0#1.offset, 4);havoc main_#t~malloc36#1.base, main_#t~malloc36#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); {10245#true} is VALID [2022-02-20 23:33:16,257 INFO L290 TraceCheckUtils]: 40: Hoare triple {10245#true} assume !(main_#t~mem37#1.base == 0 && main_#t~mem37#1.offset == 0);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); {10245#true} is VALID [2022-02-20 23:33:16,257 INFO L272 TraceCheckUtils]: 41: Hoare triple {10245#true} call main_#t~memset~res39#1.base, main_#t~memset~res39#1.offset := #Ultimate.C_memset(main_#t~mem38#1.base, main_#t~mem38#1.offset, 0, 44); {10245#true} is VALID [2022-02-20 23:33:16,258 INFO L290 TraceCheckUtils]: 42: Hoare triple {10245#true} #t~loopctr280 := 0; {10376#(= |#Ultimate.C_memset_#t~loopctr280| 0)} is VALID [2022-02-20 23:33:16,259 INFO L290 TraceCheckUtils]: 43: Hoare triple {10376#(= |#Ultimate.C_memset_#t~loopctr280| 0)} assume #t~loopctr280 % 4294967296 < #amount % 4294967296;#memory_$Pointer$.base, #memory_$Pointer$.offset := #memory_$Pointer$.base[#ptr.base,#ptr.offset + #t~loopctr280 := 0], #memory_$Pointer$.offset[#ptr.base,#ptr.offset + #t~loopctr280 := #value % 256];#memory_int := #memory_int[#ptr.base,#ptr.offset + #t~loopctr280 := #value];#t~loopctr280 := 1 + #t~loopctr280; {10380#(= |#Ultimate.C_memset_#t~loopctr280| 1)} is VALID [2022-02-20 23:33:16,259 INFO L290 TraceCheckUtils]: 44: Hoare triple {10380#(= |#Ultimate.C_memset_#t~loopctr280| 1)} assume !(#t~loopctr280 % 4294967296 < #amount % 4294967296); {10384#(not (< 1 (mod |#Ultimate.C_memset_#amount| 4294967296)))} is VALID [2022-02-20 23:33:16,259 INFO L290 TraceCheckUtils]: 45: Hoare triple {10384#(not (< 1 (mod |#Ultimate.C_memset_#amount| 4294967296)))} assume #res.base == #ptr.base && #res.offset == #ptr.offset; {10384#(not (< 1 (mod |#Ultimate.C_memset_#amount| 4294967296)))} is VALID [2022-02-20 23:33:16,260 INFO L284 TraceCheckUtils]: 46: Hoare quadruple {10384#(not (< 1 (mod |#Ultimate.C_memset_#amount| 4294967296)))} {10245#true} #1027#return; {10246#false} is VALID [2022-02-20 23:33:16,261 INFO L290 TraceCheckUtils]: 47: Hoare triple {10246#false} havoc main_#t~mem38#1.base, main_#t~mem38#1.offset;havoc main_#t~memset~res39#1.base, main_#t~memset~res39#1.offset;call main_#t~mem40#1.base, main_#t~mem40#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~mem40#1.base, 16 + main_#t~mem40#1.offset, 4);havoc main_#t~mem40#1.base, main_#t~mem40#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(32, main_#t~mem41#1.base, 4 + 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 write~int(5, main_#t~mem42#1.base, 8 + main_#t~mem42#1.offset, 4);havoc main_#t~mem42#1.base, main_#t~mem42#1.offset;call main_#t~mem43#1.base, main_#t~mem43#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~mem43#1.base, 20 + main_#t~mem43#1.offset, 4);havoc main_#t~mem43#1.base, main_#t~mem43#1.offset;call main_#t~mem44#1.base, main_#t~mem44#1.offset := read~$Pointer$(main_~user~0#1.base, 8 + main_~user~0#1.offset, 4);call main_#t~malloc45#1.base, main_#t~malloc45#1.offset := #Ultimate.allocOnHeap(384);call write~$Pointer$(main_#t~malloc45#1.base, main_#t~malloc45#1.offset, main_#t~mem44#1.base, main_#t~mem44#1.offset, 4);havoc main_#t~mem44#1.base, main_#t~mem44#1.offset;havoc main_#t~malloc45#1.base, main_#t~malloc45#1.offset;call main_#t~mem46#1.base, main_#t~mem46#1.offset := read~$Pointer$(main_~user~0#1.base, 8 + main_~user~0#1.offset, 4);call write~int(2685476833, main_#t~mem46#1.base, 40 + main_#t~mem46#1.offset, 4);havoc main_#t~mem46#1.base, main_#t~mem46#1.offset;call main_#t~mem47#1.base, main_#t~mem47#1.offset := read~$Pointer$(main_~user~0#1.base, 8 + main_~user~0#1.offset, 4);call main_#t~mem48#1.base, main_#t~mem48#1.offset := read~$Pointer$(main_#t~mem47#1.base, main_#t~mem47#1.offset, 4); {10246#false} is VALID [2022-02-20 23:33:16,261 INFO L290 TraceCheckUtils]: 48: Hoare triple {10246#false} assume !(main_#t~mem48#1.base == 0 && main_#t~mem48#1.offset == 0);havoc main_#t~mem47#1.base, main_#t~mem47#1.offset;havoc main_#t~mem48#1.base, main_#t~mem48#1.offset;call main_#t~mem50#1.base, main_#t~mem50#1.offset := read~$Pointer$(main_~user~0#1.base, 8 + main_~user~0#1.offset, 4);call main_#t~mem51#1.base, main_#t~mem51#1.offset := read~$Pointer$(main_#t~mem50#1.base, main_#t~mem50#1.offset, 4); {10246#false} is VALID [2022-02-20 23:33:16,261 INFO L272 TraceCheckUtils]: 49: Hoare triple {10246#false} call main_#t~memset~res52#1.base, main_#t~memset~res52#1.offset := #Ultimate.C_memset(main_#t~mem51#1.base, main_#t~mem51#1.offset, 0, 384); {10246#false} is VALID [2022-02-20 23:33:16,262 INFO L290 TraceCheckUtils]: 50: Hoare triple {10246#false} #t~loopctr280 := 0; {10246#false} is VALID [2022-02-20 23:33:16,262 INFO L290 TraceCheckUtils]: 51: Hoare triple {10246#false} assume #t~loopctr280 % 4294967296 < #amount % 4294967296;#memory_$Pointer$.base, #memory_$Pointer$.offset := #memory_$Pointer$.base[#ptr.base,#ptr.offset + #t~loopctr280 := 0], #memory_$Pointer$.offset[#ptr.base,#ptr.offset + #t~loopctr280 := #value % 256];#memory_int := #memory_int[#ptr.base,#ptr.offset + #t~loopctr280 := #value];#t~loopctr280 := 1 + #t~loopctr280; {10246#false} is VALID [2022-02-20 23:33:16,262 INFO L290 TraceCheckUtils]: 52: Hoare triple {10246#false} assume !(#t~loopctr280 % 4294967296 < #amount % 4294967296); {10246#false} is VALID [2022-02-20 23:33:16,262 INFO L290 TraceCheckUtils]: 53: Hoare triple {10246#false} assume #res.base == #ptr.base && #res.offset == #ptr.offset; {10246#false} is VALID [2022-02-20 23:33:16,262 INFO L284 TraceCheckUtils]: 54: Hoare quadruple {10246#false} {10246#false} #1029#return; {10246#false} is VALID [2022-02-20 23:33:16,262 INFO L290 TraceCheckUtils]: 55: Hoare triple {10246#false} 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~memset~res52#1.base, main_#t~memset~res52#1.offset; {10246#false} is VALID [2022-02-20 23:33:16,262 INFO L290 TraceCheckUtils]: 56: Hoare triple {10246#false} goto; {10246#false} is VALID [2022-02-20 23:33:16,263 INFO L290 TraceCheckUtils]: 57: Hoare triple {10246#false} main_~users~0#1.base, main_~users~0#1.offset := main_~user~0#1.base, main_~user~0#1.offset; {10246#false} is VALID [2022-02-20 23:33:16,265 INFO L290 TraceCheckUtils]: 58: Hoare triple {10246#false} havoc main_~_ha_bkt~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 := read~int(main_#t~mem61#1.base, 12 + main_#t~mem61#1.offset, 4);main_#t~post63#1 := main_#t~mem62#1;call write~int(1 + main_#t~post63#1, main_#t~mem61#1.base, 12 + main_#t~mem61#1.offset, 4);havoc main_#t~mem61#1.base, main_#t~mem61#1.offset;havoc main_#t~mem62#1;havoc main_#t~post63#1; {10246#false} is VALID [2022-02-20 23:33:16,267 INFO L290 TraceCheckUtils]: 59: Hoare triple {10246#false} call main_#t~mem64#1.base, main_#t~mem64#1.offset := read~$Pointer$(main_~users~0#1.base, 8 + main_~users~0#1.offset, 4);call main_#t~mem65#1 := read~int(main_#t~mem64#1.base, 4 + main_#t~mem64#1.offset, 4);main_~_ha_bkt~0#1 := (if 0 == main_~_ha_hashv~0#1 || 0 == main_#t~mem65#1 - 1 then 0 else (if 1 == main_#t~mem65#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~mem65#1 - 1))) else (if 1 == main_~_ha_hashv~0#1 then (if 1 == main_#t~mem65#1 - 1 || 0 == main_#t~mem65#1 - 1 then main_#t~mem65#1 - 1 else (if main_#t~mem65#1 - 1 >= 0 then (main_#t~mem65#1 - 1) % 2 else ~bitwiseAnd(main_~_ha_hashv~0#1, main_#t~mem65#1 - 1))) else ~bitwiseAnd(main_~_ha_hashv~0#1, main_#t~mem65#1 - 1))));havoc main_#t~mem64#1.base, main_#t~mem64#1.offset;havoc main_#t~mem65#1; {10246#false} is VALID [2022-02-20 23:33:16,268 INFO L290 TraceCheckUtils]: 60: Hoare triple {10246#false} goto; {10246#false} is VALID [2022-02-20 23:33:16,268 INFO L290 TraceCheckUtils]: 61: Hoare triple {10246#false} call main_#t~mem66#1.base, main_#t~mem66#1.offset := read~$Pointer$(main_~users~0#1.base, 8 + main_~users~0#1.offset, 4);call main_#t~mem67#1.base, main_#t~mem67#1.offset := read~$Pointer$(main_#t~mem66#1.base, main_#t~mem66#1.offset, 4);main_~_ha_head~0#1.base, main_~_ha_head~0#1.offset := main_#t~mem67#1.base, main_#t~mem67#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~mem66#1.base, main_#t~mem66#1.offset;havoc main_#t~mem67#1.base, main_#t~mem67#1.offset;call main_#t~mem68#1 := read~int(main_~_ha_head~0#1.base, 4 + main_~_ha_head~0#1.offset, 4);main_#t~post69#1 := main_#t~mem68#1;call write~int(1 + main_#t~post69#1, main_~_ha_head~0#1.base, 4 + main_~_ha_head~0#1.offset, 4);havoc main_#t~mem68#1;havoc main_#t~post69#1;call main_#t~mem70#1.base, main_#t~mem70#1.offset := read~$Pointer$(main_~_ha_head~0#1.base, main_~_ha_head~0#1.offset, 4);call write~$Pointer$(main_#t~mem70#1.base, main_#t~mem70#1.offset, main_~user~0#1.base, 24 + main_~user~0#1.offset, 4);havoc main_#t~mem70#1.base, main_#t~mem70#1.offset;call write~$Pointer$(0, 0, main_~user~0#1.base, 20 + main_~user~0#1.offset, 4);call main_#t~mem71#1.base, main_#t~mem71#1.offset := read~$Pointer$(main_~_ha_head~0#1.base, main_~_ha_head~0#1.offset, 4); {10246#false} is VALID [2022-02-20 23:33:16,268 INFO L290 TraceCheckUtils]: 62: Hoare triple {10246#false} assume main_#t~mem71#1.base != 0 || main_#t~mem71#1.offset != 0;havoc main_#t~mem71#1.base, main_#t~mem71#1.offset;call main_#t~mem72#1.base, main_#t~mem72#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~mem72#1.base, 12 + main_#t~mem72#1.offset, 4);havoc main_#t~mem72#1.base, main_#t~mem72#1.offset; {10246#false} is VALID [2022-02-20 23:33:16,268 INFO L290 TraceCheckUtils]: 63: Hoare triple {10246#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~mem74#1 := read~int(main_~_ha_head~0#1.base, 4 + main_~_ha_head~0#1.offset, 4);call main_#t~mem73#1 := read~int(main_~_ha_head~0#1.base, 8 + main_~_ha_head~0#1.offset, 4);main_#t~short77#1 := main_#t~mem74#1 % 4294967296 >= 10 * (1 + main_#t~mem73#1) % 4294967296; {10246#false} is VALID [2022-02-20 23:33:16,269 INFO L290 TraceCheckUtils]: 64: Hoare triple {10246#false} assume !main_#t~short77#1; {10246#false} is VALID [2022-02-20 23:33:16,271 INFO L290 TraceCheckUtils]: 65: Hoare triple {10246#false} assume !main_#t~short77#1;havoc main_#t~mem74#1;havoc main_#t~mem73#1;havoc main_#t~mem75#1.base, main_#t~mem75#1.offset;havoc main_#t~mem76#1;havoc main_#t~short77#1; {10246#false} is VALID [2022-02-20 23:33:16,271 INFO L290 TraceCheckUtils]: 66: Hoare triple {10246#false} goto; {10246#false} is VALID [2022-02-20 23:33:16,271 INFO L290 TraceCheckUtils]: 67: Hoare triple {10246#false} goto; {10246#false} is VALID [2022-02-20 23:33:16,272 INFO L290 TraceCheckUtils]: 68: Hoare triple {10246#false} goto; {10246#false} is VALID [2022-02-20 23:33:16,272 INFO L290 TraceCheckUtils]: 69: Hoare triple {10246#false} goto; {10246#false} is VALID [2022-02-20 23:33:16,272 INFO L290 TraceCheckUtils]: 70: Hoare triple {10246#false} call main_#t~mem144#1.base, main_#t~mem144#1.offset := read~$Pointer$(main_~user~0#1.base, 8 + main_~user~0#1.offset, 4);call main_#t~mem145#1 := read~int(main_#t~mem144#1.base, 12 + main_#t~mem144#1.offset, 4); {10246#false} is VALID [2022-02-20 23:33:16,275 INFO L272 TraceCheckUtils]: 71: Hoare triple {10246#false} call test_int((if main_#t~mem145#1 % 4294967296 % 4294967296 <= 2147483647 then main_#t~mem145#1 % 4294967296 % 4294967296 else main_#t~mem145#1 % 4294967296 % 4294967296 - 4294967296)); {10246#false} is VALID [2022-02-20 23:33:16,275 INFO L290 TraceCheckUtils]: 72: Hoare triple {10246#false} ~a := #in~a;#t~post3 := ~count_int~0;~count_int~0 := 1 + #t~post3;#t~switch4 := 0 == #t~post3; {10246#false} is VALID [2022-02-20 23:33:16,275 INFO L290 TraceCheckUtils]: 73: Hoare triple {10246#false} assume #t~switch4; {10246#false} is VALID [2022-02-20 23:33:16,275 INFO L272 TraceCheckUtils]: 74: Hoare triple {10246#false} call __VERIFIER_assert((if 1 == ~a then 1 else 0)); {10246#false} is VALID [2022-02-20 23:33:16,275 INFO L290 TraceCheckUtils]: 75: Hoare triple {10246#false} ~cond := #in~cond; {10246#false} is VALID [2022-02-20 23:33:16,276 INFO L290 TraceCheckUtils]: 76: Hoare triple {10246#false} assume 0 == ~cond; {10246#false} is VALID [2022-02-20 23:33:16,276 INFO L290 TraceCheckUtils]: 77: Hoare triple {10246#false} assume !false; {10246#false} is VALID [2022-02-20 23:33:16,276 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 7 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-02-20 23:33:16,276 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-20 23:33:16,501 INFO L290 TraceCheckUtils]: 77: Hoare triple {10246#false} assume !false; {10246#false} is VALID [2022-02-20 23:33:16,502 INFO L290 TraceCheckUtils]: 76: Hoare triple {10246#false} assume 0 == ~cond; {10246#false} is VALID [2022-02-20 23:33:16,502 INFO L290 TraceCheckUtils]: 75: Hoare triple {10246#false} ~cond := #in~cond; {10246#false} is VALID [2022-02-20 23:33:16,502 INFO L272 TraceCheckUtils]: 74: Hoare triple {10246#false} call __VERIFIER_assert((if 1 == ~a then 1 else 0)); {10246#false} is VALID [2022-02-20 23:33:16,502 INFO L290 TraceCheckUtils]: 73: Hoare triple {10246#false} assume #t~switch4; {10246#false} is VALID [2022-02-20 23:33:16,502 INFO L290 TraceCheckUtils]: 72: Hoare triple {10246#false} ~a := #in~a;#t~post3 := ~count_int~0;~count_int~0 := 1 + #t~post3;#t~switch4 := 0 == #t~post3; {10246#false} is VALID [2022-02-20 23:33:16,502 INFO L272 TraceCheckUtils]: 71: Hoare triple {10246#false} call test_int((if main_#t~mem145#1 % 4294967296 % 4294967296 <= 2147483647 then main_#t~mem145#1 % 4294967296 % 4294967296 else main_#t~mem145#1 % 4294967296 % 4294967296 - 4294967296)); {10246#false} is VALID [2022-02-20 23:33:16,502 INFO L290 TraceCheckUtils]: 70: Hoare triple {10246#false} call main_#t~mem144#1.base, main_#t~mem144#1.offset := read~$Pointer$(main_~user~0#1.base, 8 + main_~user~0#1.offset, 4);call main_#t~mem145#1 := read~int(main_#t~mem144#1.base, 12 + main_#t~mem144#1.offset, 4); {10246#false} is VALID [2022-02-20 23:33:16,503 INFO L290 TraceCheckUtils]: 69: Hoare triple {10246#false} goto; {10246#false} is VALID [2022-02-20 23:33:16,503 INFO L290 TraceCheckUtils]: 68: Hoare triple {10246#false} goto; {10246#false} is VALID [2022-02-20 23:33:16,503 INFO L290 TraceCheckUtils]: 67: Hoare triple {10246#false} goto; {10246#false} is VALID [2022-02-20 23:33:16,503 INFO L290 TraceCheckUtils]: 66: Hoare triple {10246#false} goto; {10246#false} is VALID [2022-02-20 23:33:16,503 INFO L290 TraceCheckUtils]: 65: Hoare triple {10246#false} assume !main_#t~short77#1;havoc main_#t~mem74#1;havoc main_#t~mem73#1;havoc main_#t~mem75#1.base, main_#t~mem75#1.offset;havoc main_#t~mem76#1;havoc main_#t~short77#1; {10246#false} is VALID [2022-02-20 23:33:16,503 INFO L290 TraceCheckUtils]: 64: Hoare triple {10246#false} assume !main_#t~short77#1; {10246#false} is VALID [2022-02-20 23:33:16,503 INFO L290 TraceCheckUtils]: 63: Hoare triple {10246#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~mem74#1 := read~int(main_~_ha_head~0#1.base, 4 + main_~_ha_head~0#1.offset, 4);call main_#t~mem73#1 := read~int(main_~_ha_head~0#1.base, 8 + main_~_ha_head~0#1.offset, 4);main_#t~short77#1 := main_#t~mem74#1 % 4294967296 >= 10 * (1 + main_#t~mem73#1) % 4294967296; {10246#false} is VALID [2022-02-20 23:33:16,503 INFO L290 TraceCheckUtils]: 62: Hoare triple {10246#false} assume main_#t~mem71#1.base != 0 || main_#t~mem71#1.offset != 0;havoc main_#t~mem71#1.base, main_#t~mem71#1.offset;call main_#t~mem72#1.base, main_#t~mem72#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~mem72#1.base, 12 + main_#t~mem72#1.offset, 4);havoc main_#t~mem72#1.base, main_#t~mem72#1.offset; {10246#false} is VALID [2022-02-20 23:33:16,504 INFO L290 TraceCheckUtils]: 61: Hoare triple {10246#false} call main_#t~mem66#1.base, main_#t~mem66#1.offset := read~$Pointer$(main_~users~0#1.base, 8 + main_~users~0#1.offset, 4);call main_#t~mem67#1.base, main_#t~mem67#1.offset := read~$Pointer$(main_#t~mem66#1.base, main_#t~mem66#1.offset, 4);main_~_ha_head~0#1.base, main_~_ha_head~0#1.offset := main_#t~mem67#1.base, main_#t~mem67#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~mem66#1.base, main_#t~mem66#1.offset;havoc main_#t~mem67#1.base, main_#t~mem67#1.offset;call main_#t~mem68#1 := read~int(main_~_ha_head~0#1.base, 4 + main_~_ha_head~0#1.offset, 4);main_#t~post69#1 := main_#t~mem68#1;call write~int(1 + main_#t~post69#1, main_~_ha_head~0#1.base, 4 + main_~_ha_head~0#1.offset, 4);havoc main_#t~mem68#1;havoc main_#t~post69#1;call main_#t~mem70#1.base, main_#t~mem70#1.offset := read~$Pointer$(main_~_ha_head~0#1.base, main_~_ha_head~0#1.offset, 4);call write~$Pointer$(main_#t~mem70#1.base, main_#t~mem70#1.offset, main_~user~0#1.base, 24 + main_~user~0#1.offset, 4);havoc main_#t~mem70#1.base, main_#t~mem70#1.offset;call write~$Pointer$(0, 0, main_~user~0#1.base, 20 + main_~user~0#1.offset, 4);call main_#t~mem71#1.base, main_#t~mem71#1.offset := read~$Pointer$(main_~_ha_head~0#1.base, main_~_ha_head~0#1.offset, 4); {10246#false} is VALID [2022-02-20 23:33:16,504 INFO L290 TraceCheckUtils]: 60: Hoare triple {10246#false} goto; {10246#false} is VALID [2022-02-20 23:33:16,504 INFO L290 TraceCheckUtils]: 59: Hoare triple {10246#false} call main_#t~mem64#1.base, main_#t~mem64#1.offset := read~$Pointer$(main_~users~0#1.base, 8 + main_~users~0#1.offset, 4);call main_#t~mem65#1 := read~int(main_#t~mem64#1.base, 4 + main_#t~mem64#1.offset, 4);main_~_ha_bkt~0#1 := (if 0 == main_~_ha_hashv~0#1 || 0 == main_#t~mem65#1 - 1 then 0 else (if 1 == main_#t~mem65#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~mem65#1 - 1))) else (if 1 == main_~_ha_hashv~0#1 then (if 1 == main_#t~mem65#1 - 1 || 0 == main_#t~mem65#1 - 1 then main_#t~mem65#1 - 1 else (if main_#t~mem65#1 - 1 >= 0 then (main_#t~mem65#1 - 1) % 2 else ~bitwiseAnd(main_~_ha_hashv~0#1, main_#t~mem65#1 - 1))) else ~bitwiseAnd(main_~_ha_hashv~0#1, main_#t~mem65#1 - 1))));havoc main_#t~mem64#1.base, main_#t~mem64#1.offset;havoc main_#t~mem65#1; {10246#false} is VALID [2022-02-20 23:33:16,504 INFO L290 TraceCheckUtils]: 58: Hoare triple {10246#false} havoc main_~_ha_bkt~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 := read~int(main_#t~mem61#1.base, 12 + main_#t~mem61#1.offset, 4);main_#t~post63#1 := main_#t~mem62#1;call write~int(1 + main_#t~post63#1, main_#t~mem61#1.base, 12 + main_#t~mem61#1.offset, 4);havoc main_#t~mem61#1.base, main_#t~mem61#1.offset;havoc main_#t~mem62#1;havoc main_#t~post63#1; {10246#false} is VALID [2022-02-20 23:33:16,504 INFO L290 TraceCheckUtils]: 57: Hoare triple {10246#false} main_~users~0#1.base, main_~users~0#1.offset := main_~user~0#1.base, main_~user~0#1.offset; {10246#false} is VALID [2022-02-20 23:33:16,504 INFO L290 TraceCheckUtils]: 56: Hoare triple {10246#false} goto; {10246#false} is VALID [2022-02-20 23:33:16,504 INFO L290 TraceCheckUtils]: 55: Hoare triple {10246#false} 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~memset~res52#1.base, main_#t~memset~res52#1.offset; {10246#false} is VALID [2022-02-20 23:33:16,504 INFO L284 TraceCheckUtils]: 54: Hoare quadruple {10245#true} {10246#false} #1029#return; {10246#false} is VALID [2022-02-20 23:33:16,505 INFO L290 TraceCheckUtils]: 53: Hoare triple {10245#true} assume #res.base == #ptr.base && #res.offset == #ptr.offset; {10245#true} is VALID [2022-02-20 23:33:16,505 INFO L290 TraceCheckUtils]: 52: Hoare triple {10245#true} assume !(#t~loopctr280 % 4294967296 < #amount % 4294967296); {10245#true} is VALID [2022-02-20 23:33:16,505 INFO L290 TraceCheckUtils]: 51: Hoare triple {10245#true} assume #t~loopctr280 % 4294967296 < #amount % 4294967296;#memory_$Pointer$.base, #memory_$Pointer$.offset := #memory_$Pointer$.base[#ptr.base,#ptr.offset + #t~loopctr280 := 0], #memory_$Pointer$.offset[#ptr.base,#ptr.offset + #t~loopctr280 := #value % 256];#memory_int := #memory_int[#ptr.base,#ptr.offset + #t~loopctr280 := #value];#t~loopctr280 := 1 + #t~loopctr280; {10245#true} is VALID [2022-02-20 23:33:16,505 INFO L290 TraceCheckUtils]: 50: Hoare triple {10245#true} #t~loopctr280 := 0; {10245#true} is VALID [2022-02-20 23:33:16,505 INFO L272 TraceCheckUtils]: 49: Hoare triple {10246#false} call main_#t~memset~res52#1.base, main_#t~memset~res52#1.offset := #Ultimate.C_memset(main_#t~mem51#1.base, main_#t~mem51#1.offset, 0, 384); {10245#true} is VALID [2022-02-20 23:33:16,505 INFO L290 TraceCheckUtils]: 48: Hoare triple {10246#false} assume !(main_#t~mem48#1.base == 0 && main_#t~mem48#1.offset == 0);havoc main_#t~mem47#1.base, main_#t~mem47#1.offset;havoc main_#t~mem48#1.base, main_#t~mem48#1.offset;call main_#t~mem50#1.base, main_#t~mem50#1.offset := read~$Pointer$(main_~user~0#1.base, 8 + main_~user~0#1.offset, 4);call main_#t~mem51#1.base, main_#t~mem51#1.offset := read~$Pointer$(main_#t~mem50#1.base, main_#t~mem50#1.offset, 4); {10246#false} is VALID [2022-02-20 23:33:16,505 INFO L290 TraceCheckUtils]: 47: Hoare triple {10246#false} havoc main_#t~mem38#1.base, main_#t~mem38#1.offset;havoc main_#t~memset~res39#1.base, main_#t~memset~res39#1.offset;call main_#t~mem40#1.base, main_#t~mem40#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~mem40#1.base, 16 + main_#t~mem40#1.offset, 4);havoc main_#t~mem40#1.base, main_#t~mem40#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(32, main_#t~mem41#1.base, 4 + 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 write~int(5, main_#t~mem42#1.base, 8 + main_#t~mem42#1.offset, 4);havoc main_#t~mem42#1.base, main_#t~mem42#1.offset;call main_#t~mem43#1.base, main_#t~mem43#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~mem43#1.base, 20 + main_#t~mem43#1.offset, 4);havoc main_#t~mem43#1.base, main_#t~mem43#1.offset;call main_#t~mem44#1.base, main_#t~mem44#1.offset := read~$Pointer$(main_~user~0#1.base, 8 + main_~user~0#1.offset, 4);call main_#t~malloc45#1.base, main_#t~malloc45#1.offset := #Ultimate.allocOnHeap(384);call write~$Pointer$(main_#t~malloc45#1.base, main_#t~malloc45#1.offset, main_#t~mem44#1.base, main_#t~mem44#1.offset, 4);havoc main_#t~mem44#1.base, main_#t~mem44#1.offset;havoc main_#t~malloc45#1.base, main_#t~malloc45#1.offset;call main_#t~mem46#1.base, main_#t~mem46#1.offset := read~$Pointer$(main_~user~0#1.base, 8 + main_~user~0#1.offset, 4);call write~int(2685476833, main_#t~mem46#1.base, 40 + main_#t~mem46#1.offset, 4);havoc main_#t~mem46#1.base, main_#t~mem46#1.offset;call main_#t~mem47#1.base, main_#t~mem47#1.offset := read~$Pointer$(main_~user~0#1.base, 8 + main_~user~0#1.offset, 4);call main_#t~mem48#1.base, main_#t~mem48#1.offset := read~$Pointer$(main_#t~mem47#1.base, main_#t~mem47#1.offset, 4); {10246#false} is VALID [2022-02-20 23:33:16,506 INFO L284 TraceCheckUtils]: 46: Hoare quadruple {10580#(not (= 44 |#Ultimate.C_memset_#amount|))} {10245#true} #1027#return; {10246#false} is VALID [2022-02-20 23:33:16,507 INFO L290 TraceCheckUtils]: 45: Hoare triple {10580#(not (= 44 |#Ultimate.C_memset_#amount|))} assume #res.base == #ptr.base && #res.offset == #ptr.offset; {10580#(not (= 44 |#Ultimate.C_memset_#amount|))} is VALID [2022-02-20 23:33:16,507 INFO L290 TraceCheckUtils]: 44: Hoare triple {10587#(or (< (mod |#Ultimate.C_memset_#t~loopctr280| 4294967296) (mod |#Ultimate.C_memset_#amount| 4294967296)) (not (= 44 |#Ultimate.C_memset_#amount|)))} assume !(#t~loopctr280 % 4294967296 < #amount % 4294967296); {10580#(not (= 44 |#Ultimate.C_memset_#amount|))} is VALID [2022-02-20 23:33:16,509 INFO L290 TraceCheckUtils]: 43: Hoare triple {10591#(or (< (mod (+ |#Ultimate.C_memset_#t~loopctr280| 1) 4294967296) (mod |#Ultimate.C_memset_#amount| 4294967296)) (not (= 44 |#Ultimate.C_memset_#amount|)))} assume #t~loopctr280 % 4294967296 < #amount % 4294967296;#memory_$Pointer$.base, #memory_$Pointer$.offset := #memory_$Pointer$.base[#ptr.base,#ptr.offset + #t~loopctr280 := 0], #memory_$Pointer$.offset[#ptr.base,#ptr.offset + #t~loopctr280 := #value % 256];#memory_int := #memory_int[#ptr.base,#ptr.offset + #t~loopctr280 := #value];#t~loopctr280 := 1 + #t~loopctr280; {10587#(or (< (mod |#Ultimate.C_memset_#t~loopctr280| 4294967296) (mod |#Ultimate.C_memset_#amount| 4294967296)) (not (= 44 |#Ultimate.C_memset_#amount|)))} is VALID [2022-02-20 23:33:16,509 INFO L290 TraceCheckUtils]: 42: Hoare triple {10245#true} #t~loopctr280 := 0; {10591#(or (< (mod (+ |#Ultimate.C_memset_#t~loopctr280| 1) 4294967296) (mod |#Ultimate.C_memset_#amount| 4294967296)) (not (= 44 |#Ultimate.C_memset_#amount|)))} is VALID [2022-02-20 23:33:16,509 INFO L272 TraceCheckUtils]: 41: Hoare triple {10245#true} call main_#t~memset~res39#1.base, main_#t~memset~res39#1.offset := #Ultimate.C_memset(main_#t~mem38#1.base, main_#t~mem38#1.offset, 0, 44); {10245#true} is VALID [2022-02-20 23:33:16,509 INFO L290 TraceCheckUtils]: 40: Hoare triple {10245#true} assume !(main_#t~mem37#1.base == 0 && main_#t~mem37#1.offset == 0);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); {10245#true} is VALID [2022-02-20 23:33:16,509 INFO L290 TraceCheckUtils]: 39: Hoare triple {10245#true} call main_#t~malloc36#1.base, main_#t~malloc36#1.offset := #Ultimate.allocOnHeap(44);call write~$Pointer$(main_#t~malloc36#1.base, main_#t~malloc36#1.offset, main_~user~0#1.base, 8 + main_~user~0#1.offset, 4);havoc main_#t~malloc36#1.base, main_#t~malloc36#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); {10245#true} is VALID [2022-02-20 23:33:16,510 INFO L290 TraceCheckUtils]: 38: Hoare triple {10245#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); {10245#true} is VALID [2022-02-20 23:33:16,510 INFO L290 TraceCheckUtils]: 37: Hoare triple {10245#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); {10245#true} is VALID [2022-02-20 23:33:16,510 INFO L290 TraceCheckUtils]: 36: Hoare triple {10245#true} goto; {10245#true} is VALID [2022-02-20 23:33:16,510 INFO L290 TraceCheckUtils]: 35: Hoare triple {10245#true} goto; {10245#true} is VALID [2022-02-20 23:33:16,510 INFO L290 TraceCheckUtils]: 34: Hoare triple {10245#true} goto; {10245#true} is VALID [2022-02-20 23:33:16,510 INFO L290 TraceCheckUtils]: 33: Hoare triple {10245#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)))); {10245#true} is VALID [2022-02-20 23:33:16,510 INFO L290 TraceCheckUtils]: 32: Hoare triple {10245#true} havoc main_#t~switch24#1; {10245#true} is VALID [2022-02-20 23:33:16,510 INFO L290 TraceCheckUtils]: 31: Hoare triple {10245#true} assume main_#t~switch24#1;call main_#t~mem35#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~mem35#1 % 256;havoc main_#t~mem35#1; {10245#true} is VALID [2022-02-20 23:33:16,511 INFO L290 TraceCheckUtils]: 30: Hoare triple {10245#true} main_#t~switch24#1 := main_#t~switch24#1 || 1 == main_~_hj_k~0#1; {10245#true} is VALID [2022-02-20 23:33:16,511 INFO L290 TraceCheckUtils]: 29: Hoare triple {10245#true} assume main_#t~switch24#1;call main_#t~mem34#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~mem34#1 % 256);havoc main_#t~mem34#1; {10245#true} is VALID [2022-02-20 23:33:16,511 INFO L290 TraceCheckUtils]: 28: Hoare triple {10245#true} main_#t~switch24#1 := main_#t~switch24#1 || 2 == main_~_hj_k~0#1; {10245#true} is VALID [2022-02-20 23:33:16,511 INFO L290 TraceCheckUtils]: 27: Hoare triple {10245#true} assume main_#t~switch24#1;call main_#t~mem33#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~mem33#1 % 256);havoc main_#t~mem33#1; {10245#true} is VALID [2022-02-20 23:33:16,511 INFO L290 TraceCheckUtils]: 26: Hoare triple {10245#true} main_#t~switch24#1 := main_#t~switch24#1 || 3 == main_~_hj_k~0#1; {10245#true} is VALID [2022-02-20 23:33:16,511 INFO L290 TraceCheckUtils]: 25: Hoare triple {10245#true} assume main_#t~switch24#1;call main_#t~mem32#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~mem32#1 % 256);havoc main_#t~mem32#1; {10245#true} is VALID [2022-02-20 23:33:16,511 INFO L290 TraceCheckUtils]: 24: Hoare triple {10245#true} main_#t~switch24#1 := main_#t~switch24#1 || 4 == main_~_hj_k~0#1; {10245#true} is VALID [2022-02-20 23:33:16,511 INFO L290 TraceCheckUtils]: 23: Hoare triple {10245#true} assume !main_#t~switch24#1; {10245#true} is VALID [2022-02-20 23:33:16,512 INFO L290 TraceCheckUtils]: 22: Hoare triple {10245#true} main_#t~switch24#1 := main_#t~switch24#1 || 5 == main_~_hj_k~0#1; {10245#true} is VALID [2022-02-20 23:33:16,512 INFO L290 TraceCheckUtils]: 21: Hoare triple {10245#true} assume !main_#t~switch24#1; {10245#true} is VALID [2022-02-20 23:33:16,512 INFO L290 TraceCheckUtils]: 20: Hoare triple {10245#true} main_#t~switch24#1 := main_#t~switch24#1 || 6 == main_~_hj_k~0#1; {10245#true} is VALID [2022-02-20 23:33:16,512 INFO L290 TraceCheckUtils]: 19: Hoare triple {10245#true} assume !main_#t~switch24#1; {10245#true} is VALID [2022-02-20 23:33:16,512 INFO L290 TraceCheckUtils]: 18: Hoare triple {10245#true} main_#t~switch24#1 := main_#t~switch24#1 || 7 == main_~_hj_k~0#1; {10245#true} is VALID [2022-02-20 23:33:16,512 INFO L290 TraceCheckUtils]: 17: Hoare triple {10245#true} assume !main_#t~switch24#1; {10245#true} is VALID [2022-02-20 23:33:16,512 INFO L290 TraceCheckUtils]: 16: Hoare triple {10245#true} main_#t~switch24#1 := main_#t~switch24#1 || 8 == main_~_hj_k~0#1; {10245#true} is VALID [2022-02-20 23:33:16,512 INFO L290 TraceCheckUtils]: 15: Hoare triple {10245#true} assume !main_#t~switch24#1; {10245#true} is VALID [2022-02-20 23:33:16,513 INFO L290 TraceCheckUtils]: 14: Hoare triple {10245#true} main_#t~switch24#1 := main_#t~switch24#1 || 9 == main_~_hj_k~0#1; {10245#true} is VALID [2022-02-20 23:33:16,513 INFO L290 TraceCheckUtils]: 13: Hoare triple {10245#true} assume !main_#t~switch24#1; {10245#true} is VALID [2022-02-20 23:33:16,513 INFO L290 TraceCheckUtils]: 12: Hoare triple {10245#true} main_#t~switch24#1 := main_#t~switch24#1 || 10 == main_~_hj_k~0#1; {10245#true} is VALID [2022-02-20 23:33:16,513 INFO L290 TraceCheckUtils]: 11: Hoare triple {10245#true} assume !main_#t~switch24#1; {10245#true} is VALID [2022-02-20 23:33:16,513 INFO L290 TraceCheckUtils]: 10: Hoare triple {10245#true} main_~_ha_hashv~0#1 := 4 + main_~_ha_hashv~0#1;main_#t~switch24#1 := 11 == main_~_hj_k~0#1; {10245#true} is VALID [2022-02-20 23:33:16,513 INFO L290 TraceCheckUtils]: 9: Hoare triple {10245#true} assume !(main_~_hj_k~0#1 % 4294967296 >= 12); {10245#true} is VALID [2022-02-20 23:33:16,513 INFO L290 TraceCheckUtils]: 8: Hoare triple {10245#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; {10245#true} is VALID [2022-02-20 23:33:16,513 INFO L290 TraceCheckUtils]: 7: Hoare triple {10245#true} goto; {10245#true} is VALID [2022-02-20 23:33:16,514 INFO L290 TraceCheckUtils]: 6: Hoare triple {10245#true} havoc main_~_ha_hashv~0#1; {10245#true} is VALID [2022-02-20 23:33:16,514 INFO L290 TraceCheckUtils]: 5: Hoare triple {10245#true} call main_#t~mem9#1 := read~int(main_~#i~0#1.base, main_~#i~0#1.offset, 4);call write~int(main_#t~mem9#1, main_~user~0#1.base, main_~user~0#1.offset, 4);havoc main_#t~mem9#1;call main_#t~mem10#1 := read~int(main_~#i~0#1.base, main_~#i~0#1.offset, 4);call main_#t~mem11#1 := read~int(main_~#i~0#1.base, main_~#i~0#1.offset, 4);call write~int(main_#t~mem10#1 * main_#t~mem11#1, main_~user~0#1.base, 4 + main_~user~0#1.offset, 4);havoc main_#t~mem10#1;havoc main_#t~mem11#1; {10245#true} is VALID [2022-02-20 23:33:16,514 INFO L290 TraceCheckUtils]: 4: Hoare triple {10245#true} assume !(main_~user~0#1.base == 0 && main_~user~0#1.offset == 0); {10245#true} is VALID [2022-02-20 23:33:16,514 INFO L290 TraceCheckUtils]: 3: Hoare triple {10245#true} assume !!(main_#t~mem7#1 < 10);havoc main_#t~mem7#1;call main_#t~malloc8#1.base, main_#t~malloc8#1.offset := #Ultimate.allocOnHeap(40);main_~user~0#1.base, main_~user~0#1.offset := main_#t~malloc8#1.base, main_#t~malloc8#1.offset;havoc main_#t~malloc8#1.base, main_#t~malloc8#1.offset; {10245#true} is VALID [2022-02-20 23:33:16,514 INFO L290 TraceCheckUtils]: 2: Hoare triple {10245#true} call main_#t~mem7#1 := read~int(main_~#i~0#1.base, main_~#i~0#1.offset, 4); {10245#true} is VALID [2022-02-20 23:33:16,514 INFO L290 TraceCheckUtils]: 1: Hoare triple {10245#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc8#1.base, main_#t~malloc8#1.offset, main_#t~mem9#1, main_#t~mem10#1, main_#t~mem11#1, main_#t~mem13#1, main_#t~mem12#1, main_#t~mem14#1, main_#t~mem15#1, main_#t~mem17#1, main_#t~mem16#1, main_#t~mem18#1, main_#t~mem19#1, main_#t~mem21#1, main_#t~mem20#1, main_#t~mem22#1, main_#t~mem23#1, main_#t~switch24#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_#t~mem31#1, main_#t~mem32#1, main_#t~mem33#1, main_#t~mem34#1, main_#t~mem35#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~malloc36#1.base, main_#t~malloc36#1.offset, main_#t~mem37#1.base, main_#t~mem37#1.offset, main_#t~mem38#1.base, main_#t~mem38#1.offset, main_#t~memset~res39#1.base, main_#t~memset~res39#1.offset, main_#t~mem40#1.base, main_#t~mem40#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~malloc45#1.base, main_#t~malloc45#1.offset, main_#t~mem46#1.base, main_#t~mem46#1.offset, main_#t~mem47#1.base, main_#t~mem47#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~memset~res52#1.base, main_#t~memset~res52#1.offset, 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~mem58#1.base, main_#t~mem58#1.offset, main_#t~mem59#1.base, main_#t~mem59#1.offset, main_#t~mem60#1.base, main_#t~mem60#1.offset, main_#t~mem61#1.base, main_#t~mem61#1.offset, main_#t~mem62#1, main_#t~post63#1, main_#t~mem64#1.base, main_#t~mem64#1.offset, main_#t~mem65#1, main_#t~mem66#1.base, main_#t~mem66#1.offset, main_#t~mem67#1.base, main_#t~mem67#1.offset, main_#t~mem68#1, main_#t~post69#1, main_#t~mem70#1.base, main_#t~mem70#1.offset, main_#t~mem71#1.base, main_#t~mem71#1.offset, main_#t~mem72#1.base, main_#t~mem72#1.offset, main_#t~mem74#1, main_#t~mem73#1, main_#t~mem75#1.base, main_#t~mem75#1.offset, main_#t~mem76#1, main_#t~short77#1, main_#t~mem78#1.base, main_#t~mem78#1.offset, main_#t~mem79#1, main_#t~malloc80#1.base, main_#t~malloc80#1.offset, main_#t~mem81#1.base, main_#t~mem81#1.offset, main_#t~mem82#1.base, main_#t~mem82#1.offset, main_#t~mem83#1.base, main_#t~mem83#1.offset, main_#t~mem84#1, main_#t~memset~res85#1.base, main_#t~memset~res85#1.offset, main_#t~mem86#1.base, main_#t~mem86#1.offset, main_#t~mem87#1.base, main_#t~mem87#1.offset, main_#t~mem90#1, main_#t~mem88#1.base, main_#t~mem88#1.offset, main_#t~mem89#1, main_#t~mem91#1.base, main_#t~mem91#1.offset, main_#t~mem94#1, main_#t~mem92#1.base, main_#t~mem92#1.offset, main_#t~mem93#1, main_#t~ite95#1, main_#t~mem96#1.base, main_#t~mem96#1.offset, main_#t~mem100#1.base, main_#t~mem100#1.offset, main_#t~mem101#1.base, main_#t~mem101#1.offset, main_#t~mem102#1.base, main_#t~mem102#1.offset, main_#t~mem103#1.base, main_#t~mem103#1.offset, main_#t~mem106#1, main_#t~mem104#1.base, main_#t~mem104#1.offset, main_#t~mem105#1, main_#t~mem107#1.base, main_#t~mem107#1.offset, main_#t~mem108#1, main_#t~pre109#1, main_#t~mem110#1.base, main_#t~mem110#1.offset, main_#t~mem111#1, main_#t~mem112#1.base, main_#t~mem112#1.offset, main_#t~mem113#1, main_#t~post114#1, main_#t~mem118#1, main_#t~mem116#1, main_#t~mem115#1.base, main_#t~mem115#1.offset, main_#t~mem117#1, main_#t~mem119#1, main_#t~post120#1, main_#t~mem121#1.base, main_#t~mem121#1.offset, main_#t~mem122#1.base, main_#t~mem122#1.offset, main_#t~mem123#1.base, main_#t~mem123#1.offset, main_#t~post97#1, main_#t~mem98#1.base, main_#t~mem98#1.offset, main_#t~mem99#1, main_#t~mem124#1.base, main_#t~mem124#1.offset, main_#t~mem125#1.base, main_#t~mem125#1.offset, main_#t~mem126#1.base, main_#t~mem126#1.offset, main_#t~mem127#1, main_#t~mem128#1.base, main_#t~mem128#1.offset, main_#t~mem129#1, main_#t~post130#1, main_#t~mem131#1.base, main_#t~mem131#1.offset, main_#t~mem132#1.base, main_#t~mem132#1.offset, main_#t~mem133#1.base, main_#t~mem133#1.offset, main_#t~mem134#1.base, main_#t~mem134#1.offset, main_#t~mem137#1, main_#t~mem135#1.base, main_#t~mem135#1.offset, main_#t~mem136#1, main_#t~ite140#1, main_#t~mem138#1.base, main_#t~mem138#1.offset, main_#t~mem139#1, main_#t~mem141#1.base, main_#t~mem141#1.offset, main_#t~mem142#1, main_#t~mem143#1.base, main_#t~mem143#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~mem144#1.base, main_#t~mem144#1.offset, main_#t~mem145#1, main_#t~mem5#1, main_#t~post6#1, main_#t~mem7#1, main_#t~mem149#1, main_#t~mem148#1, main_#t~mem150#1, main_#t~mem151#1, main_#t~mem153#1, main_#t~mem152#1, main_#t~mem154#1, main_#t~mem155#1, main_#t~mem157#1, main_#t~mem156#1, main_#t~mem158#1, main_#t~mem159#1, main_#t~switch160#1, main_#t~mem161#1, main_#t~mem162#1, main_#t~mem163#1, main_#t~mem164#1, main_#t~mem165#1, main_#t~mem166#1, main_#t~mem167#1, main_#t~mem168#1, main_#t~mem169#1, main_#t~mem170#1, main_#t~mem171#1, main_~_hj_i~1#1, main_~_hj_j~1#1, main_~_hj_k~1#1, main_~_hj_key~1#1.base, main_~_hj_key~1#1.offset, main_#t~mem172#1.base, main_#t~mem172#1.offset, main_#t~mem173#1, main_#t~mem174#1.base, main_#t~mem174#1.offset, main_#t~mem175#1.base, main_#t~mem175#1.offset, main_#t~mem176#1.base, main_#t~mem176#1.offset, main_#t~mem177#1.base, main_#t~mem177#1.offset, main_#t~mem178#1.base, main_#t~mem178#1.offset, main_#t~mem179#1.base, main_#t~mem179#1.offset, main_#t~mem180#1.base, main_#t~mem180#1.offset, main_#t~mem181#1, main_#t~mem182#1, main_#t~mem183#1, main_#t~short184#1, main_#t~mem185#1.base, main_#t~mem185#1.offset, main_#t~ret186#1, main_#t~mem187#1.base, main_#t~mem187#1.offset, main_#t~mem188#1.base, main_#t~mem188#1.offset, main_#t~mem189#1.base, main_#t~mem189#1.offset, main_#t~mem190#1, main_~_hf_bkt~0#1, main_~_hf_hashv~0#1, main_#t~mem191#1.base, main_#t~mem191#1.offset, main_#t~mem192#1.base, main_#t~mem192#1.offset, main_#t~short193#1, main_#t~mem194#1.base, main_#t~mem194#1.offset, main_#t~mem195#1.base, main_#t~mem195#1.offset, main_#t~mem196#1.base, main_#t~mem196#1.offset, main_#t~mem197#1.base, main_#t~mem197#1.offset, main_#t~mem198#1.base, main_#t~mem198#1.offset, main_#t~mem199#1.base, main_#t~mem199#1.offset, main_#t~mem200#1.base, main_#t~mem200#1.offset, main_#t~mem201#1.base, main_#t~mem201#1.offset, main_#t~mem202#1, main_#t~mem203#1.base, main_#t~mem203#1.offset, main_#t~mem204#1.base, main_#t~mem204#1.offset, main_#t~mem205#1.base, main_#t~mem205#1.offset, main_#t~mem206#1, main_#t~mem207#1.base, main_#t~mem207#1.offset, main_#t~mem208#1.base, main_#t~mem208#1.offset, main_#t~mem209#1.base, main_#t~mem209#1.offset, main_#t~mem210#1.base, main_#t~mem210#1.offset, main_#t~mem211#1.base, main_#t~mem211#1.offset, main_#t~mem212#1, main_#t~mem213#1.base, main_#t~mem213#1.offset, main_#t~mem216#1, main_#t~mem214#1.base, main_#t~mem214#1.offset, main_#t~mem215#1, main_#t~mem217#1.base, main_#t~mem217#1.offset, main_#t~mem218#1.base, main_#t~mem218#1.offset, main_#t~mem219#1, main_#t~post220#1, main_#t~mem221#1.base, main_#t~mem221#1.offset, main_#t~mem222#1.base, main_#t~mem222#1.offset, main_#t~mem223#1.base, main_#t~mem223#1.offset, main_#t~mem224#1.base, main_#t~mem224#1.offset, main_#t~mem225#1.base, main_#t~mem225#1.offset, main_#t~mem226#1.base, main_#t~mem226#1.offset, main_#t~mem227#1.base, main_#t~mem227#1.offset, main_#t~mem228#1.base, main_#t~mem228#1.offset, main_~_hd_head~0#1.base, main_~_hd_head~0#1.offset, main_#t~mem229#1.base, main_#t~mem229#1.offset, main_#t~mem230#1, main_#t~post231#1, main_~_hd_bkt~0#1, main_~_hd_hh_del~0#1.base, main_~_hd_hh_del~0#1.offset, main_#t~mem232#1.base, main_#t~mem232#1.offset, main_#t~mem233#1, main_#t~mem146#1, main_#t~mem147#1, main_#t~ite235#1.base, main_#t~ite235#1.offset, main_#t~mem234#1.base, main_#t~mem234#1.offset, main_#t~mem238#1.base, main_#t~mem238#1.offset, main_#t~mem239#1.base, main_#t~mem239#1.offset, main_#t~short240#1, main_#t~mem241#1.base, main_#t~mem241#1.offset, main_#t~mem242#1.base, main_#t~mem242#1.offset, main_#t~mem243#1.base, main_#t~mem243#1.offset, main_#t~mem244#1.base, main_#t~mem244#1.offset, main_#t~mem245#1.base, main_#t~mem245#1.offset, main_#t~mem246#1.base, main_#t~mem246#1.offset, main_#t~mem247#1.base, main_#t~mem247#1.offset, main_#t~mem248#1.base, main_#t~mem248#1.offset, main_#t~mem249#1, main_#t~mem250#1.base, main_#t~mem250#1.offset, main_#t~mem251#1.base, main_#t~mem251#1.offset, main_#t~mem252#1.base, main_#t~mem252#1.offset, main_#t~mem253#1, main_#t~mem254#1.base, main_#t~mem254#1.offset, main_#t~mem255#1.base, main_#t~mem255#1.offset, main_#t~mem256#1.base, main_#t~mem256#1.offset, main_#t~mem257#1.base, main_#t~mem257#1.offset, main_#t~mem258#1.base, main_#t~mem258#1.offset, main_#t~mem259#1, main_#t~mem260#1.base, main_#t~mem260#1.offset, main_#t~mem263#1, main_#t~mem261#1.base, main_#t~mem261#1.offset, main_#t~mem262#1, main_#t~mem264#1.base, main_#t~mem264#1.offset, main_#t~mem265#1.base, main_#t~mem265#1.offset, main_#t~mem266#1, main_#t~post267#1, main_#t~mem268#1.base, main_#t~mem268#1.offset, main_#t~mem269#1.base, main_#t~mem269#1.offset, main_#t~mem270#1.base, main_#t~mem270#1.offset, main_#t~mem271#1.base, main_#t~mem271#1.offset, main_#t~mem272#1.base, main_#t~mem272#1.offset, main_#t~mem273#1.base, main_#t~mem273#1.offset, main_#t~mem274#1.base, main_#t~mem274#1.offset, main_#t~mem275#1.base, main_#t~mem275#1.offset, main_~_hd_head~1#1.base, main_~_hd_head~1#1.offset, main_#t~mem276#1.base, main_#t~mem276#1.offset, main_#t~mem277#1, main_#t~post278#1, main_~_hd_bkt~1#1, main_~_hd_hh_del~1#1.base, main_~_hd_hh_del~1#1.offset, main_#t~ite237#1.base, main_#t~ite237#1.offset, main_#t~mem236#1.base, main_#t~mem236#1.offset, main_~#i~0#1.base, main_~#i~0#1.offset, main_~user~0#1.base, main_~user~0#1.offset, main_~tmp~0#1.base, main_~tmp~0#1.offset, main_~users~0#1.base, main_~users~0#1.offset, main_~temp~0#1.base, main_~temp~0#1.offset;call main_~#i~0#1.base, main_~#i~0#1.offset := #Ultimate.allocOnStack(4);havoc main_~user~0#1.base, main_~user~0#1.offset;havoc main_~tmp~0#1.base, main_~tmp~0#1.offset;main_~users~0#1.base, main_~users~0#1.offset := 0, 0;call write~int(0, main_~#i~0#1.base, main_~#i~0#1.offset, 4); {10245#true} is VALID [2022-02-20 23:33:16,514 INFO L290 TraceCheckUtils]: 0: Hoare triple {10245#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~0 := 0; {10245#true} is VALID [2022-02-20 23:33:16,515 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-02-20 23:33:16,515 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 23:33:16,515 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2063048634] [2022-02-20 23:33:16,515 WARN L317 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-02-20 23:33:16,515 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [511274073] [2022-02-20 23:33:16,515 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [511274073] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-20 23:33:16,515 INFO L191 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-02-20 23:33:16,516 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2022-02-20 23:33:16,516 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [132231032] [2022-02-20 23:33:16,516 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-02-20 23:33:16,516 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 10.0) internal successors, (80), 8 states have internal predecessors, (80), 2 states have call successors, (5), 2 states have call predecessors, (5), 4 states have return successors, (4), 1 states have call predecessors, (4), 2 states have call successors, (4) Word has length 78 [2022-02-20 23:33:16,517 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:33:16,517 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 8 states, 8 states have (on average 10.0) internal successors, (80), 8 states have internal predecessors, (80), 2 states have call successors, (5), 2 states have call predecessors, (5), 4 states have return successors, (4), 1 states have call predecessors, (4), 2 states have call successors, (4) [2022-02-20 23:33:16,586 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-20 23:33:16,586 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-02-20 23:33:16,586 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 23:33:16,587 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-02-20 23:33:16,587 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2022-02-20 23:33:16,587 INFO L87 Difference]: Start difference. First operand 341 states and 447 transitions. Second operand has 8 states, 8 states have (on average 10.0) internal successors, (80), 8 states have internal predecessors, (80), 2 states have call successors, (5), 2 states have call predecessors, (5), 4 states have return successors, (4), 1 states have call predecessors, (4), 2 states have call successors, (4) [2022-02-20 23:33:18,516 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:33:18,516 INFO L93 Difference]: Finished difference Result 645 states and 860 transitions. [2022-02-20 23:33:18,516 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-02-20 23:33:18,517 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 10.0) internal successors, (80), 8 states have internal predecessors, (80), 2 states have call successors, (5), 2 states have call predecessors, (5), 4 states have return successors, (4), 1 states have call predecessors, (4), 2 states have call successors, (4) Word has length 78 [2022-02-20 23:33:18,517 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:33:18,517 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 10.0) internal successors, (80), 8 states have internal predecessors, (80), 2 states have call successors, (5), 2 states have call predecessors, (5), 4 states have return successors, (4), 1 states have call predecessors, (4), 2 states have call successors, (4) [2022-02-20 23:33:18,534 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 621 transitions. [2022-02-20 23:33:18,535 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 10.0) internal successors, (80), 8 states have internal predecessors, (80), 2 states have call successors, (5), 2 states have call predecessors, (5), 4 states have return successors, (4), 1 states have call predecessors, (4), 2 states have call successors, (4) [2022-02-20 23:33:18,541 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 621 transitions. [2022-02-20 23:33:18,541 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 11 states and 621 transitions. [2022-02-20 23:33:18,989 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 621 edges. 621 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:33:18,996 INFO L225 Difference]: With dead ends: 645 [2022-02-20 23:33:18,996 INFO L226 Difference]: Without dead ends: 352 [2022-02-20 23:33:18,997 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-20 23:33:18,997 INFO L933 BasicCegarLoop]: 298 mSDtfsCounter, 14 mSDsluCounter, 1177 mSDsCounter, 0 mSdLazyCounter, 52 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 1475 SdHoareTripleChecker+Invalid, 64 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 52 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-20 23:33:18,997 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [14 Valid, 1475 Invalid, 64 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 52 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-20 23:33:18,998 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 352 states. [2022-02-20 23:33:19,041 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 352 to 350. [2022-02-20 23:33:19,041 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:33:19,042 INFO L82 GeneralOperation]: Start isEquivalent. First operand 352 states. Second operand has 350 states, 322 states have (on average 1.2981366459627328) internal successors, (418), 339 states have internal predecessors, (418), 21 states have call successors, (21), 4 states have call predecessors, (21), 5 states have return successors, (22), 7 states have call predecessors, (22), 21 states have call successors, (22) [2022-02-20 23:33:19,043 INFO L74 IsIncluded]: Start isIncluded. First operand 352 states. Second operand has 350 states, 322 states have (on average 1.2981366459627328) internal successors, (418), 339 states have internal predecessors, (418), 21 states have call successors, (21), 4 states have call predecessors, (21), 5 states have return successors, (22), 7 states have call predecessors, (22), 21 states have call successors, (22) [2022-02-20 23:33:19,043 INFO L87 Difference]: Start difference. First operand 352 states. Second operand has 350 states, 322 states have (on average 1.2981366459627328) internal successors, (418), 339 states have internal predecessors, (418), 21 states have call successors, (21), 4 states have call predecessors, (21), 5 states have return successors, (22), 7 states have call predecessors, (22), 21 states have call successors, (22) [2022-02-20 23:33:19,050 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:33:19,050 INFO L93 Difference]: Finished difference Result 352 states and 463 transitions. [2022-02-20 23:33:19,050 INFO L276 IsEmpty]: Start isEmpty. Operand 352 states and 463 transitions. [2022-02-20 23:33:19,051 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:33:19,051 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:33:19,052 INFO L74 IsIncluded]: Start isIncluded. First operand has 350 states, 322 states have (on average 1.2981366459627328) internal successors, (418), 339 states have internal predecessors, (418), 21 states have call successors, (21), 4 states have call predecessors, (21), 5 states have return successors, (22), 7 states have call predecessors, (22), 21 states have call successors, (22) Second operand 352 states. [2022-02-20 23:33:19,052 INFO L87 Difference]: Start difference. First operand has 350 states, 322 states have (on average 1.2981366459627328) internal successors, (418), 339 states have internal predecessors, (418), 21 states have call successors, (21), 4 states have call predecessors, (21), 5 states have return successors, (22), 7 states have call predecessors, (22), 21 states have call successors, (22) Second operand 352 states. [2022-02-20 23:33:19,058 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:33:19,058 INFO L93 Difference]: Finished difference Result 352 states and 463 transitions. [2022-02-20 23:33:19,058 INFO L276 IsEmpty]: Start isEmpty. Operand 352 states and 463 transitions. [2022-02-20 23:33:19,059 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:33:19,059 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:33:19,059 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:33:19,059 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:33:19,060 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 350 states, 322 states have (on average 1.2981366459627328) internal successors, (418), 339 states have internal predecessors, (418), 21 states have call successors, (21), 4 states have call predecessors, (21), 5 states have return successors, (22), 7 states have call predecessors, (22), 21 states have call successors, (22) [2022-02-20 23:33:19,066 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 350 states to 350 states and 461 transitions. [2022-02-20 23:33:19,066 INFO L78 Accepts]: Start accepts. Automaton has 350 states and 461 transitions. Word has length 78 [2022-02-20 23:33:19,066 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:33:19,067 INFO L470 AbstractCegarLoop]: Abstraction has 350 states and 461 transitions. [2022-02-20 23:33:19,067 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 10.0) internal successors, (80), 8 states have internal predecessors, (80), 2 states have call successors, (5), 2 states have call predecessors, (5), 4 states have return successors, (4), 1 states have call predecessors, (4), 2 states have call successors, (4) [2022-02-20 23:33:19,067 INFO L276 IsEmpty]: Start isEmpty. Operand 350 states and 461 transitions. [2022-02-20 23:33:19,067 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2022-02-20 23:33:19,068 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:33:19,068 INFO L514 BasicCegarLoop]: trace histogram [6, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 23:33:19,088 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-20 23:33:19,278 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 23:33:19,279 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 23:33:19,279 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:33:19,279 INFO L85 PathProgramCache]: Analyzing trace with hash -1737208967, now seen corresponding path program 2 times [2022-02-20 23:33:19,279 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 23:33:19,279 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [488022697] [2022-02-20 23:33:19,279 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:33:19,280 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 23:33:19,318 ERROR L252 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-02-20 23:33:19,319 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [531984331] [2022-02-20 23:33:19,319 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-02-20 23:33:19,319 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 23:33:19,319 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 23:33:19,327 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-20 23:33:19,328 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-20 23:33:27,135 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-02-20 23:33:27,136 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-02-20 23:33:27,151 INFO L263 TraceCheckSpWp]: Trace formula consists of 774 conjuncts, 25 conjunts are in the unsatisfiable core [2022-02-20 23:33:27,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:33:27,189 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 23:33:27,740 INFO L290 TraceCheckUtils]: 0: Hoare triple {12640#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~0 := 0; {12640#true} is VALID [2022-02-20 23:33:27,740 INFO L290 TraceCheckUtils]: 1: Hoare triple {12640#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc8#1.base, main_#t~malloc8#1.offset, main_#t~mem9#1, main_#t~mem10#1, main_#t~mem11#1, main_#t~mem13#1, main_#t~mem12#1, main_#t~mem14#1, main_#t~mem15#1, main_#t~mem17#1, main_#t~mem16#1, main_#t~mem18#1, main_#t~mem19#1, main_#t~mem21#1, main_#t~mem20#1, main_#t~mem22#1, main_#t~mem23#1, main_#t~switch24#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_#t~mem31#1, main_#t~mem32#1, main_#t~mem33#1, main_#t~mem34#1, main_#t~mem35#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~malloc36#1.base, main_#t~malloc36#1.offset, main_#t~mem37#1.base, main_#t~mem37#1.offset, main_#t~mem38#1.base, main_#t~mem38#1.offset, main_#t~memset~res39#1.base, main_#t~memset~res39#1.offset, main_#t~mem40#1.base, main_#t~mem40#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~malloc45#1.base, main_#t~malloc45#1.offset, main_#t~mem46#1.base, main_#t~mem46#1.offset, main_#t~mem47#1.base, main_#t~mem47#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~memset~res52#1.base, main_#t~memset~res52#1.offset, 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~mem58#1.base, main_#t~mem58#1.offset, main_#t~mem59#1.base, main_#t~mem59#1.offset, main_#t~mem60#1.base, main_#t~mem60#1.offset, main_#t~mem61#1.base, main_#t~mem61#1.offset, main_#t~mem62#1, main_#t~post63#1, main_#t~mem64#1.base, main_#t~mem64#1.offset, main_#t~mem65#1, main_#t~mem66#1.base, main_#t~mem66#1.offset, main_#t~mem67#1.base, main_#t~mem67#1.offset, main_#t~mem68#1, main_#t~post69#1, main_#t~mem70#1.base, main_#t~mem70#1.offset, main_#t~mem71#1.base, main_#t~mem71#1.offset, main_#t~mem72#1.base, main_#t~mem72#1.offset, main_#t~mem74#1, main_#t~mem73#1, main_#t~mem75#1.base, main_#t~mem75#1.offset, main_#t~mem76#1, main_#t~short77#1, main_#t~mem78#1.base, main_#t~mem78#1.offset, main_#t~mem79#1, main_#t~malloc80#1.base, main_#t~malloc80#1.offset, main_#t~mem81#1.base, main_#t~mem81#1.offset, main_#t~mem82#1.base, main_#t~mem82#1.offset, main_#t~mem83#1.base, main_#t~mem83#1.offset, main_#t~mem84#1, main_#t~memset~res85#1.base, main_#t~memset~res85#1.offset, main_#t~mem86#1.base, main_#t~mem86#1.offset, main_#t~mem87#1.base, main_#t~mem87#1.offset, main_#t~mem90#1, main_#t~mem88#1.base, main_#t~mem88#1.offset, main_#t~mem89#1, main_#t~mem91#1.base, main_#t~mem91#1.offset, main_#t~mem94#1, main_#t~mem92#1.base, main_#t~mem92#1.offset, main_#t~mem93#1, main_#t~ite95#1, main_#t~mem96#1.base, main_#t~mem96#1.offset, main_#t~mem100#1.base, main_#t~mem100#1.offset, main_#t~mem101#1.base, main_#t~mem101#1.offset, main_#t~mem102#1.base, main_#t~mem102#1.offset, main_#t~mem103#1.base, main_#t~mem103#1.offset, main_#t~mem106#1, main_#t~mem104#1.base, main_#t~mem104#1.offset, main_#t~mem105#1, main_#t~mem107#1.base, main_#t~mem107#1.offset, main_#t~mem108#1, main_#t~pre109#1, main_#t~mem110#1.base, main_#t~mem110#1.offset, main_#t~mem111#1, main_#t~mem112#1.base, main_#t~mem112#1.offset, main_#t~mem113#1, main_#t~post114#1, main_#t~mem118#1, main_#t~mem116#1, main_#t~mem115#1.base, main_#t~mem115#1.offset, main_#t~mem117#1, main_#t~mem119#1, main_#t~post120#1, main_#t~mem121#1.base, main_#t~mem121#1.offset, main_#t~mem122#1.base, main_#t~mem122#1.offset, main_#t~mem123#1.base, main_#t~mem123#1.offset, main_#t~post97#1, main_#t~mem98#1.base, main_#t~mem98#1.offset, main_#t~mem99#1, main_#t~mem124#1.base, main_#t~mem124#1.offset, main_#t~mem125#1.base, main_#t~mem125#1.offset, main_#t~mem126#1.base, main_#t~mem126#1.offset, main_#t~mem127#1, main_#t~mem128#1.base, main_#t~mem128#1.offset, main_#t~mem129#1, main_#t~post130#1, main_#t~mem131#1.base, main_#t~mem131#1.offset, main_#t~mem132#1.base, main_#t~mem132#1.offset, main_#t~mem133#1.base, main_#t~mem133#1.offset, main_#t~mem134#1.base, main_#t~mem134#1.offset, main_#t~mem137#1, main_#t~mem135#1.base, main_#t~mem135#1.offset, main_#t~mem136#1, main_#t~ite140#1, main_#t~mem138#1.base, main_#t~mem138#1.offset, main_#t~mem139#1, main_#t~mem141#1.base, main_#t~mem141#1.offset, main_#t~mem142#1, main_#t~mem143#1.base, main_#t~mem143#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~mem144#1.base, main_#t~mem144#1.offset, main_#t~mem145#1, main_#t~mem5#1, main_#t~post6#1, main_#t~mem7#1, main_#t~mem149#1, main_#t~mem148#1, main_#t~mem150#1, main_#t~mem151#1, main_#t~mem153#1, main_#t~mem152#1, main_#t~mem154#1, main_#t~mem155#1, main_#t~mem157#1, main_#t~mem156#1, main_#t~mem158#1, main_#t~mem159#1, main_#t~switch160#1, main_#t~mem161#1, main_#t~mem162#1, main_#t~mem163#1, main_#t~mem164#1, main_#t~mem165#1, main_#t~mem166#1, main_#t~mem167#1, main_#t~mem168#1, main_#t~mem169#1, main_#t~mem170#1, main_#t~mem171#1, main_~_hj_i~1#1, main_~_hj_j~1#1, main_~_hj_k~1#1, main_~_hj_key~1#1.base, main_~_hj_key~1#1.offset, main_#t~mem172#1.base, main_#t~mem172#1.offset, main_#t~mem173#1, main_#t~mem174#1.base, main_#t~mem174#1.offset, main_#t~mem175#1.base, main_#t~mem175#1.offset, main_#t~mem176#1.base, main_#t~mem176#1.offset, main_#t~mem177#1.base, main_#t~mem177#1.offset, main_#t~mem178#1.base, main_#t~mem178#1.offset, main_#t~mem179#1.base, main_#t~mem179#1.offset, main_#t~mem180#1.base, main_#t~mem180#1.offset, main_#t~mem181#1, main_#t~mem182#1, main_#t~mem183#1, main_#t~short184#1, main_#t~mem185#1.base, main_#t~mem185#1.offset, main_#t~ret186#1, main_#t~mem187#1.base, main_#t~mem187#1.offset, main_#t~mem188#1.base, main_#t~mem188#1.offset, main_#t~mem189#1.base, main_#t~mem189#1.offset, main_#t~mem190#1, main_~_hf_bkt~0#1, main_~_hf_hashv~0#1, main_#t~mem191#1.base, main_#t~mem191#1.offset, main_#t~mem192#1.base, main_#t~mem192#1.offset, main_#t~short193#1, main_#t~mem194#1.base, main_#t~mem194#1.offset, main_#t~mem195#1.base, main_#t~mem195#1.offset, main_#t~mem196#1.base, main_#t~mem196#1.offset, main_#t~mem197#1.base, main_#t~mem197#1.offset, main_#t~mem198#1.base, main_#t~mem198#1.offset, main_#t~mem199#1.base, main_#t~mem199#1.offset, main_#t~mem200#1.base, main_#t~mem200#1.offset, main_#t~mem201#1.base, main_#t~mem201#1.offset, main_#t~mem202#1, main_#t~mem203#1.base, main_#t~mem203#1.offset, main_#t~mem204#1.base, main_#t~mem204#1.offset, main_#t~mem205#1.base, main_#t~mem205#1.offset, main_#t~mem206#1, main_#t~mem207#1.base, main_#t~mem207#1.offset, main_#t~mem208#1.base, main_#t~mem208#1.offset, main_#t~mem209#1.base, main_#t~mem209#1.offset, main_#t~mem210#1.base, main_#t~mem210#1.offset, main_#t~mem211#1.base, main_#t~mem211#1.offset, main_#t~mem212#1, main_#t~mem213#1.base, main_#t~mem213#1.offset, main_#t~mem216#1, main_#t~mem214#1.base, main_#t~mem214#1.offset, main_#t~mem215#1, main_#t~mem217#1.base, main_#t~mem217#1.offset, main_#t~mem218#1.base, main_#t~mem218#1.offset, main_#t~mem219#1, main_#t~post220#1, main_#t~mem221#1.base, main_#t~mem221#1.offset, main_#t~mem222#1.base, main_#t~mem222#1.offset, main_#t~mem223#1.base, main_#t~mem223#1.offset, main_#t~mem224#1.base, main_#t~mem224#1.offset, main_#t~mem225#1.base, main_#t~mem225#1.offset, main_#t~mem226#1.base, main_#t~mem226#1.offset, main_#t~mem227#1.base, main_#t~mem227#1.offset, main_#t~mem228#1.base, main_#t~mem228#1.offset, main_~_hd_head~0#1.base, main_~_hd_head~0#1.offset, main_#t~mem229#1.base, main_#t~mem229#1.offset, main_#t~mem230#1, main_#t~post231#1, main_~_hd_bkt~0#1, main_~_hd_hh_del~0#1.base, main_~_hd_hh_del~0#1.offset, main_#t~mem232#1.base, main_#t~mem232#1.offset, main_#t~mem233#1, main_#t~mem146#1, main_#t~mem147#1, main_#t~ite235#1.base, main_#t~ite235#1.offset, main_#t~mem234#1.base, main_#t~mem234#1.offset, main_#t~mem238#1.base, main_#t~mem238#1.offset, main_#t~mem239#1.base, main_#t~mem239#1.offset, main_#t~short240#1, main_#t~mem241#1.base, main_#t~mem241#1.offset, main_#t~mem242#1.base, main_#t~mem242#1.offset, main_#t~mem243#1.base, main_#t~mem243#1.offset, main_#t~mem244#1.base, main_#t~mem244#1.offset, main_#t~mem245#1.base, main_#t~mem245#1.offset, main_#t~mem246#1.base, main_#t~mem246#1.offset, main_#t~mem247#1.base, main_#t~mem247#1.offset, main_#t~mem248#1.base, main_#t~mem248#1.offset, main_#t~mem249#1, main_#t~mem250#1.base, main_#t~mem250#1.offset, main_#t~mem251#1.base, main_#t~mem251#1.offset, main_#t~mem252#1.base, main_#t~mem252#1.offset, main_#t~mem253#1, main_#t~mem254#1.base, main_#t~mem254#1.offset, main_#t~mem255#1.base, main_#t~mem255#1.offset, main_#t~mem256#1.base, main_#t~mem256#1.offset, main_#t~mem257#1.base, main_#t~mem257#1.offset, main_#t~mem258#1.base, main_#t~mem258#1.offset, main_#t~mem259#1, main_#t~mem260#1.base, main_#t~mem260#1.offset, main_#t~mem263#1, main_#t~mem261#1.base, main_#t~mem261#1.offset, main_#t~mem262#1, main_#t~mem264#1.base, main_#t~mem264#1.offset, main_#t~mem265#1.base, main_#t~mem265#1.offset, main_#t~mem266#1, main_#t~post267#1, main_#t~mem268#1.base, main_#t~mem268#1.offset, main_#t~mem269#1.base, main_#t~mem269#1.offset, main_#t~mem270#1.base, main_#t~mem270#1.offset, main_#t~mem271#1.base, main_#t~mem271#1.offset, main_#t~mem272#1.base, main_#t~mem272#1.offset, main_#t~mem273#1.base, main_#t~mem273#1.offset, main_#t~mem274#1.base, main_#t~mem274#1.offset, main_#t~mem275#1.base, main_#t~mem275#1.offset, main_~_hd_head~1#1.base, main_~_hd_head~1#1.offset, main_#t~mem276#1.base, main_#t~mem276#1.offset, main_#t~mem277#1, main_#t~post278#1, main_~_hd_bkt~1#1, main_~_hd_hh_del~1#1.base, main_~_hd_hh_del~1#1.offset, main_#t~ite237#1.base, main_#t~ite237#1.offset, main_#t~mem236#1.base, main_#t~mem236#1.offset, main_~#i~0#1.base, main_~#i~0#1.offset, main_~user~0#1.base, main_~user~0#1.offset, main_~tmp~0#1.base, main_~tmp~0#1.offset, main_~users~0#1.base, main_~users~0#1.offset, main_~temp~0#1.base, main_~temp~0#1.offset;call main_~#i~0#1.base, main_~#i~0#1.offset := #Ultimate.allocOnStack(4);havoc main_~user~0#1.base, main_~user~0#1.offset;havoc main_~tmp~0#1.base, main_~tmp~0#1.offset;main_~users~0#1.base, main_~users~0#1.offset := 0, 0;call write~int(0, main_~#i~0#1.base, main_~#i~0#1.offset, 4); {12640#true} is VALID [2022-02-20 23:33:27,740 INFO L290 TraceCheckUtils]: 2: Hoare triple {12640#true} call main_#t~mem7#1 := read~int(main_~#i~0#1.base, main_~#i~0#1.offset, 4); {12640#true} is VALID [2022-02-20 23:33:27,741 INFO L290 TraceCheckUtils]: 3: Hoare triple {12640#true} assume !!(main_#t~mem7#1 < 10);havoc main_#t~mem7#1;call main_#t~malloc8#1.base, main_#t~malloc8#1.offset := #Ultimate.allocOnHeap(40);main_~user~0#1.base, main_~user~0#1.offset := main_#t~malloc8#1.base, main_#t~malloc8#1.offset;havoc main_#t~malloc8#1.base, main_#t~malloc8#1.offset; {12640#true} is VALID [2022-02-20 23:33:27,742 INFO L290 TraceCheckUtils]: 4: Hoare triple {12640#true} assume !(main_~user~0#1.base == 0 && main_~user~0#1.offset == 0); {12640#true} is VALID [2022-02-20 23:33:27,742 INFO L290 TraceCheckUtils]: 5: Hoare triple {12640#true} call main_#t~mem9#1 := read~int(main_~#i~0#1.base, main_~#i~0#1.offset, 4);call write~int(main_#t~mem9#1, main_~user~0#1.base, main_~user~0#1.offset, 4);havoc main_#t~mem9#1;call main_#t~mem10#1 := read~int(main_~#i~0#1.base, main_~#i~0#1.offset, 4);call main_#t~mem11#1 := read~int(main_~#i~0#1.base, main_~#i~0#1.offset, 4);call write~int(main_#t~mem10#1 * main_#t~mem11#1, main_~user~0#1.base, 4 + main_~user~0#1.offset, 4);havoc main_#t~mem10#1;havoc main_#t~mem11#1; {12640#true} is VALID [2022-02-20 23:33:27,742 INFO L290 TraceCheckUtils]: 6: Hoare triple {12640#true} havoc main_~_ha_hashv~0#1; {12640#true} is VALID [2022-02-20 23:33:27,742 INFO L290 TraceCheckUtils]: 7: Hoare triple {12640#true} goto; {12640#true} is VALID [2022-02-20 23:33:27,742 INFO L290 TraceCheckUtils]: 8: Hoare triple {12640#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; {12669#(= 4 |ULTIMATE.start_main_~_hj_k~0#1|)} is VALID [2022-02-20 23:33:27,743 INFO L290 TraceCheckUtils]: 9: Hoare triple {12669#(= 4 |ULTIMATE.start_main_~_hj_k~0#1|)} assume !(main_~_hj_k~0#1 % 4294967296 >= 12); {12640#true} is VALID [2022-02-20 23:33:27,743 INFO L290 TraceCheckUtils]: 10: Hoare triple {12640#true} main_~_ha_hashv~0#1 := 4 + main_~_ha_hashv~0#1;main_#t~switch24#1 := 11 == main_~_hj_k~0#1; {12640#true} is VALID [2022-02-20 23:33:27,743 INFO L290 TraceCheckUtils]: 11: Hoare triple {12640#true} assume !main_#t~switch24#1; {12640#true} is VALID [2022-02-20 23:33:27,743 INFO L290 TraceCheckUtils]: 12: Hoare triple {12640#true} main_#t~switch24#1 := main_#t~switch24#1 || 10 == main_~_hj_k~0#1; {12640#true} is VALID [2022-02-20 23:33:27,743 INFO L290 TraceCheckUtils]: 13: Hoare triple {12640#true} assume !main_#t~switch24#1; {12640#true} is VALID [2022-02-20 23:33:27,743 INFO L290 TraceCheckUtils]: 14: Hoare triple {12640#true} main_#t~switch24#1 := main_#t~switch24#1 || 9 == main_~_hj_k~0#1; {12640#true} is VALID [2022-02-20 23:33:27,743 INFO L290 TraceCheckUtils]: 15: Hoare triple {12640#true} assume !main_#t~switch24#1; {12640#true} is VALID [2022-02-20 23:33:27,743 INFO L290 TraceCheckUtils]: 16: Hoare triple {12640#true} main_#t~switch24#1 := main_#t~switch24#1 || 8 == main_~_hj_k~0#1; {12640#true} is VALID [2022-02-20 23:33:27,744 INFO L290 TraceCheckUtils]: 17: Hoare triple {12640#true} assume !main_#t~switch24#1; {12640#true} is VALID [2022-02-20 23:33:27,744 INFO L290 TraceCheckUtils]: 18: Hoare triple {12640#true} main_#t~switch24#1 := main_#t~switch24#1 || 7 == main_~_hj_k~0#1; {12640#true} is VALID [2022-02-20 23:33:27,744 INFO L290 TraceCheckUtils]: 19: Hoare triple {12640#true} assume !main_#t~switch24#1; {12640#true} is VALID [2022-02-20 23:33:27,744 INFO L290 TraceCheckUtils]: 20: Hoare triple {12640#true} main_#t~switch24#1 := main_#t~switch24#1 || 6 == main_~_hj_k~0#1; {12640#true} is VALID [2022-02-20 23:33:27,744 INFO L290 TraceCheckUtils]: 21: Hoare triple {12640#true} assume !main_#t~switch24#1; {12640#true} is VALID [2022-02-20 23:33:27,744 INFO L290 TraceCheckUtils]: 22: Hoare triple {12640#true} main_#t~switch24#1 := main_#t~switch24#1 || 5 == main_~_hj_k~0#1; {12640#true} is VALID [2022-02-20 23:33:27,745 INFO L290 TraceCheckUtils]: 23: Hoare triple {12640#true} assume !main_#t~switch24#1; {12640#true} is VALID [2022-02-20 23:33:27,745 INFO L290 TraceCheckUtils]: 24: Hoare triple {12640#true} main_#t~switch24#1 := main_#t~switch24#1 || 4 == main_~_hj_k~0#1; {12640#true} is VALID [2022-02-20 23:33:27,745 INFO L290 TraceCheckUtils]: 25: Hoare triple {12640#true} assume main_#t~switch24#1;call main_#t~mem32#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~mem32#1 % 256);havoc main_#t~mem32#1; {12640#true} is VALID [2022-02-20 23:33:27,745 INFO L290 TraceCheckUtils]: 26: Hoare triple {12640#true} main_#t~switch24#1 := main_#t~switch24#1 || 3 == main_~_hj_k~0#1; {12640#true} is VALID [2022-02-20 23:33:27,745 INFO L290 TraceCheckUtils]: 27: Hoare triple {12640#true} assume main_#t~switch24#1;call main_#t~mem33#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~mem33#1 % 256);havoc main_#t~mem33#1; {12640#true} is VALID [2022-02-20 23:33:27,746 INFO L290 TraceCheckUtils]: 28: Hoare triple {12640#true} main_#t~switch24#1 := main_#t~switch24#1 || 2 == main_~_hj_k~0#1; {12640#true} is VALID [2022-02-20 23:33:27,746 INFO L290 TraceCheckUtils]: 29: Hoare triple {12640#true} assume main_#t~switch24#1;call main_#t~mem34#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~mem34#1 % 256);havoc main_#t~mem34#1; {12640#true} is VALID [2022-02-20 23:33:27,746 INFO L290 TraceCheckUtils]: 30: Hoare triple {12640#true} main_#t~switch24#1 := main_#t~switch24#1 || 1 == main_~_hj_k~0#1; {12640#true} is VALID [2022-02-20 23:33:27,747 INFO L290 TraceCheckUtils]: 31: Hoare triple {12640#true} assume main_#t~switch24#1;call main_#t~mem35#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~mem35#1 % 256;havoc main_#t~mem35#1; {12640#true} is VALID [2022-02-20 23:33:27,747 INFO L290 TraceCheckUtils]: 32: Hoare triple {12640#true} havoc main_#t~switch24#1; {12640#true} is VALID [2022-02-20 23:33:27,748 INFO L290 TraceCheckUtils]: 33: Hoare triple {12640#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)))); {12640#true} is VALID [2022-02-20 23:33:27,748 INFO L290 TraceCheckUtils]: 34: Hoare triple {12640#true} goto; {12640#true} is VALID [2022-02-20 23:33:27,748 INFO L290 TraceCheckUtils]: 35: Hoare triple {12640#true} goto; {12640#true} is VALID [2022-02-20 23:33:27,748 INFO L290 TraceCheckUtils]: 36: Hoare triple {12640#true} goto; {12640#true} is VALID [2022-02-20 23:33:27,748 INFO L290 TraceCheckUtils]: 37: Hoare triple {12640#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); {12640#true} is VALID [2022-02-20 23:33:27,748 INFO L290 TraceCheckUtils]: 38: Hoare triple {12640#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); {12640#true} is VALID [2022-02-20 23:33:27,748 INFO L290 TraceCheckUtils]: 39: Hoare triple {12640#true} call main_#t~malloc36#1.base, main_#t~malloc36#1.offset := #Ultimate.allocOnHeap(44);call write~$Pointer$(main_#t~malloc36#1.base, main_#t~malloc36#1.offset, main_~user~0#1.base, 8 + main_~user~0#1.offset, 4);havoc main_#t~malloc36#1.base, main_#t~malloc36#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); {12640#true} is VALID [2022-02-20 23:33:27,748 INFO L290 TraceCheckUtils]: 40: Hoare triple {12640#true} assume !(main_#t~mem37#1.base == 0 && main_#t~mem37#1.offset == 0);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); {12640#true} is VALID [2022-02-20 23:33:27,749 INFO L272 TraceCheckUtils]: 41: Hoare triple {12640#true} call main_#t~memset~res39#1.base, main_#t~memset~res39#1.offset := #Ultimate.C_memset(main_#t~mem38#1.base, main_#t~mem38#1.offset, 0, 44); {12640#true} is VALID [2022-02-20 23:33:27,749 INFO L290 TraceCheckUtils]: 42: Hoare triple {12640#true} #t~loopctr280 := 0; {12772#(= |#Ultimate.C_memset_#t~loopctr280| 0)} is VALID [2022-02-20 23:33:27,749 INFO L290 TraceCheckUtils]: 43: Hoare triple {12772#(= |#Ultimate.C_memset_#t~loopctr280| 0)} assume #t~loopctr280 % 4294967296 < #amount % 4294967296;#memory_$Pointer$.base, #memory_$Pointer$.offset := #memory_$Pointer$.base[#ptr.base,#ptr.offset + #t~loopctr280 := 0], #memory_$Pointer$.offset[#ptr.base,#ptr.offset + #t~loopctr280 := #value % 256];#memory_int := #memory_int[#ptr.base,#ptr.offset + #t~loopctr280 := #value];#t~loopctr280 := 1 + #t~loopctr280; {12776#(= |#Ultimate.C_memset_#t~loopctr280| 1)} is VALID [2022-02-20 23:33:27,750 INFO L290 TraceCheckUtils]: 44: Hoare triple {12776#(= |#Ultimate.C_memset_#t~loopctr280| 1)} assume #t~loopctr280 % 4294967296 < #amount % 4294967296;#memory_$Pointer$.base, #memory_$Pointer$.offset := #memory_$Pointer$.base[#ptr.base,#ptr.offset + #t~loopctr280 := 0], #memory_$Pointer$.offset[#ptr.base,#ptr.offset + #t~loopctr280 := #value % 256];#memory_int := #memory_int[#ptr.base,#ptr.offset + #t~loopctr280 := #value];#t~loopctr280 := 1 + #t~loopctr280; {12780#(= |#Ultimate.C_memset_#t~loopctr280| 2)} is VALID [2022-02-20 23:33:27,751 INFO L290 TraceCheckUtils]: 45: Hoare triple {12780#(= |#Ultimate.C_memset_#t~loopctr280| 2)} assume #t~loopctr280 % 4294967296 < #amount % 4294967296;#memory_$Pointer$.base, #memory_$Pointer$.offset := #memory_$Pointer$.base[#ptr.base,#ptr.offset + #t~loopctr280 := 0], #memory_$Pointer$.offset[#ptr.base,#ptr.offset + #t~loopctr280 := #value % 256];#memory_int := #memory_int[#ptr.base,#ptr.offset + #t~loopctr280 := #value];#t~loopctr280 := 1 + #t~loopctr280; {12784#(and (= (+ (- 1) |#Ultimate.C_memset_#t~loopctr280|) 2) (< (mod (+ |#Ultimate.C_memset_#t~loopctr280| 4294967295) 4294967296) (mod |#Ultimate.C_memset_#amount| 4294967296)))} is VALID [2022-02-20 23:33:27,751 INFO L290 TraceCheckUtils]: 46: Hoare triple {12784#(and (= (+ (- 1) |#Ultimate.C_memset_#t~loopctr280|) 2) (< (mod (+ |#Ultimate.C_memset_#t~loopctr280| 4294967295) 4294967296) (mod |#Ultimate.C_memset_#amount| 4294967296)))} assume #t~loopctr280 % 4294967296 < #amount % 4294967296;#memory_$Pointer$.base, #memory_$Pointer$.offset := #memory_$Pointer$.base[#ptr.base,#ptr.offset + #t~loopctr280 := 0], #memory_$Pointer$.offset[#ptr.base,#ptr.offset + #t~loopctr280 := #value % 256];#memory_int := #memory_int[#ptr.base,#ptr.offset + #t~loopctr280 := #value];#t~loopctr280 := 1 + #t~loopctr280; {12788#(and (< (mod (+ |#Ultimate.C_memset_#t~loopctr280| 4294967294) 4294967296) (mod |#Ultimate.C_memset_#amount| 4294967296)) (= 2 (+ (- 2) |#Ultimate.C_memset_#t~loopctr280|)))} is VALID [2022-02-20 23:33:27,751 INFO L290 TraceCheckUtils]: 47: Hoare triple {12788#(and (< (mod (+ |#Ultimate.C_memset_#t~loopctr280| 4294967294) 4294967296) (mod |#Ultimate.C_memset_#amount| 4294967296)) (= 2 (+ (- 2) |#Ultimate.C_memset_#t~loopctr280|)))} assume !(#t~loopctr280 % 4294967296 < #amount % 4294967296); {12640#true} is VALID [2022-02-20 23:33:27,751 INFO L290 TraceCheckUtils]: 48: Hoare triple {12640#true} assume #res.base == #ptr.base && #res.offset == #ptr.offset; {12640#true} is VALID [2022-02-20 23:33:27,752 INFO L284 TraceCheckUtils]: 49: Hoare quadruple {12640#true} {12640#true} #1027#return; {12640#true} is VALID [2022-02-20 23:33:27,752 INFO L290 TraceCheckUtils]: 50: Hoare triple {12640#true} havoc main_#t~mem38#1.base, main_#t~mem38#1.offset;havoc main_#t~memset~res39#1.base, main_#t~memset~res39#1.offset;call main_#t~mem40#1.base, main_#t~mem40#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~mem40#1.base, 16 + main_#t~mem40#1.offset, 4);havoc main_#t~mem40#1.base, main_#t~mem40#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(32, main_#t~mem41#1.base, 4 + 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 write~int(5, main_#t~mem42#1.base, 8 + main_#t~mem42#1.offset, 4);havoc main_#t~mem42#1.base, main_#t~mem42#1.offset;call main_#t~mem43#1.base, main_#t~mem43#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~mem43#1.base, 20 + main_#t~mem43#1.offset, 4);havoc main_#t~mem43#1.base, main_#t~mem43#1.offset;call main_#t~mem44#1.base, main_#t~mem44#1.offset := read~$Pointer$(main_~user~0#1.base, 8 + main_~user~0#1.offset, 4);call main_#t~malloc45#1.base, main_#t~malloc45#1.offset := #Ultimate.allocOnHeap(384);call write~$Pointer$(main_#t~malloc45#1.base, main_#t~malloc45#1.offset, main_#t~mem44#1.base, main_#t~mem44#1.offset, 4);havoc main_#t~mem44#1.base, main_#t~mem44#1.offset;havoc main_#t~malloc45#1.base, main_#t~malloc45#1.offset;call main_#t~mem46#1.base, main_#t~mem46#1.offset := read~$Pointer$(main_~user~0#1.base, 8 + main_~user~0#1.offset, 4);call write~int(2685476833, main_#t~mem46#1.base, 40 + main_#t~mem46#1.offset, 4);havoc main_#t~mem46#1.base, main_#t~mem46#1.offset;call main_#t~mem47#1.base, main_#t~mem47#1.offset := read~$Pointer$(main_~user~0#1.base, 8 + main_~user~0#1.offset, 4);call main_#t~mem48#1.base, main_#t~mem48#1.offset := read~$Pointer$(main_#t~mem47#1.base, main_#t~mem47#1.offset, 4); {12640#true} is VALID [2022-02-20 23:33:27,752 INFO L290 TraceCheckUtils]: 51: Hoare triple {12640#true} assume !(main_#t~mem48#1.base == 0 && main_#t~mem48#1.offset == 0);havoc main_#t~mem47#1.base, main_#t~mem47#1.offset;havoc main_#t~mem48#1.base, main_#t~mem48#1.offset;call main_#t~mem50#1.base, main_#t~mem50#1.offset := read~$Pointer$(main_~user~0#1.base, 8 + main_~user~0#1.offset, 4);call main_#t~mem51#1.base, main_#t~mem51#1.offset := read~$Pointer$(main_#t~mem50#1.base, main_#t~mem50#1.offset, 4); {12640#true} is VALID [2022-02-20 23:33:27,752 INFO L272 TraceCheckUtils]: 52: Hoare triple {12640#true} call main_#t~memset~res52#1.base, main_#t~memset~res52#1.offset := #Ultimate.C_memset(main_#t~mem51#1.base, main_#t~mem51#1.offset, 0, 384); {12640#true} is VALID [2022-02-20 23:33:27,752 INFO L290 TraceCheckUtils]: 53: Hoare triple {12640#true} #t~loopctr280 := 0; {12772#(= |#Ultimate.C_memset_#t~loopctr280| 0)} is VALID [2022-02-20 23:33:27,753 INFO L290 TraceCheckUtils]: 54: Hoare triple {12772#(= |#Ultimate.C_memset_#t~loopctr280| 0)} assume #t~loopctr280 % 4294967296 < #amount % 4294967296;#memory_$Pointer$.base, #memory_$Pointer$.offset := #memory_$Pointer$.base[#ptr.base,#ptr.offset + #t~loopctr280 := 0], #memory_$Pointer$.offset[#ptr.base,#ptr.offset + #t~loopctr280 := #value % 256];#memory_int := #memory_int[#ptr.base,#ptr.offset + #t~loopctr280 := #value];#t~loopctr280 := 1 + #t~loopctr280; {12813#(and (= (+ (- 1) |#Ultimate.C_memset_#t~loopctr280|) 0) (< (mod (+ |#Ultimate.C_memset_#t~loopctr280| 4294967295) 4294967296) (mod |#Ultimate.C_memset_#amount| 4294967296)))} is VALID [2022-02-20 23:33:27,753 INFO L290 TraceCheckUtils]: 55: Hoare triple {12813#(and (= (+ (- 1) |#Ultimate.C_memset_#t~loopctr280|) 0) (< (mod (+ |#Ultimate.C_memset_#t~loopctr280| 4294967295) 4294967296) (mod |#Ultimate.C_memset_#amount| 4294967296)))} assume #t~loopctr280 % 4294967296 < #amount % 4294967296;#memory_$Pointer$.base, #memory_$Pointer$.offset := #memory_$Pointer$.base[#ptr.base,#ptr.offset + #t~loopctr280 := 0], #memory_$Pointer$.offset[#ptr.base,#ptr.offset + #t~loopctr280 := #value % 256];#memory_int := #memory_int[#ptr.base,#ptr.offset + #t~loopctr280 := #value];#t~loopctr280 := 1 + #t~loopctr280; {12817#(and (= (+ (- 2) |#Ultimate.C_memset_#t~loopctr280|) 0) (< (mod (+ |#Ultimate.C_memset_#t~loopctr280| 4294967294) 4294967296) (mod |#Ultimate.C_memset_#amount| 4294967296)))} is VALID [2022-02-20 23:33:27,754 INFO L290 TraceCheckUtils]: 56: Hoare triple {12817#(and (= (+ (- 2) |#Ultimate.C_memset_#t~loopctr280|) 0) (< (mod (+ |#Ultimate.C_memset_#t~loopctr280| 4294967294) 4294967296) (mod |#Ultimate.C_memset_#amount| 4294967296)))} assume !(#t~loopctr280 % 4294967296 < #amount % 4294967296); {12821#(and (not (< 2 (mod |#Ultimate.C_memset_#amount| 4294967296))) (< 0 (mod |#Ultimate.C_memset_#amount| 4294967296)))} is VALID [2022-02-20 23:33:27,754 INFO L290 TraceCheckUtils]: 57: Hoare triple {12821#(and (not (< 2 (mod |#Ultimate.C_memset_#amount| 4294967296))) (< 0 (mod |#Ultimate.C_memset_#amount| 4294967296)))} assume #res.base == #ptr.base && #res.offset == #ptr.offset; {12821#(and (not (< 2 (mod |#Ultimate.C_memset_#amount| 4294967296))) (< 0 (mod |#Ultimate.C_memset_#amount| 4294967296)))} is VALID [2022-02-20 23:33:27,755 INFO L284 TraceCheckUtils]: 58: Hoare quadruple {12821#(and (not (< 2 (mod |#Ultimate.C_memset_#amount| 4294967296))) (< 0 (mod |#Ultimate.C_memset_#amount| 4294967296)))} {12640#true} #1029#return; {12641#false} is VALID [2022-02-20 23:33:27,755 INFO L290 TraceCheckUtils]: 59: Hoare triple {12641#false} 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~memset~res52#1.base, main_#t~memset~res52#1.offset; {12641#false} is VALID [2022-02-20 23:33:27,755 INFO L290 TraceCheckUtils]: 60: Hoare triple {12641#false} goto; {12641#false} is VALID [2022-02-20 23:33:27,755 INFO L290 TraceCheckUtils]: 61: Hoare triple {12641#false} main_~users~0#1.base, main_~users~0#1.offset := main_~user~0#1.base, main_~user~0#1.offset; {12641#false} is VALID [2022-02-20 23:33:27,756 INFO L290 TraceCheckUtils]: 62: Hoare triple {12641#false} havoc main_~_ha_bkt~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 := read~int(main_#t~mem61#1.base, 12 + main_#t~mem61#1.offset, 4);main_#t~post63#1 := main_#t~mem62#1;call write~int(1 + main_#t~post63#1, main_#t~mem61#1.base, 12 + main_#t~mem61#1.offset, 4);havoc main_#t~mem61#1.base, main_#t~mem61#1.offset;havoc main_#t~mem62#1;havoc main_#t~post63#1; {12641#false} is VALID [2022-02-20 23:33:27,756 INFO L290 TraceCheckUtils]: 63: Hoare triple {12641#false} call main_#t~mem64#1.base, main_#t~mem64#1.offset := read~$Pointer$(main_~users~0#1.base, 8 + main_~users~0#1.offset, 4);call main_#t~mem65#1 := read~int(main_#t~mem64#1.base, 4 + main_#t~mem64#1.offset, 4);main_~_ha_bkt~0#1 := (if 0 == main_~_ha_hashv~0#1 || 0 == main_#t~mem65#1 - 1 then 0 else (if 1 == main_#t~mem65#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~mem65#1 - 1))) else (if 1 == main_~_ha_hashv~0#1 then (if 1 == main_#t~mem65#1 - 1 || 0 == main_#t~mem65#1 - 1 then main_#t~mem65#1 - 1 else (if main_#t~mem65#1 - 1 >= 0 then (main_#t~mem65#1 - 1) % 2 else ~bitwiseAnd(main_~_ha_hashv~0#1, main_#t~mem65#1 - 1))) else ~bitwiseAnd(main_~_ha_hashv~0#1, main_#t~mem65#1 - 1))));havoc main_#t~mem64#1.base, main_#t~mem64#1.offset;havoc main_#t~mem65#1; {12641#false} is VALID [2022-02-20 23:33:27,756 INFO L290 TraceCheckUtils]: 64: Hoare triple {12641#false} goto; {12641#false} is VALID [2022-02-20 23:33:27,756 INFO L290 TraceCheckUtils]: 65: Hoare triple {12641#false} call main_#t~mem66#1.base, main_#t~mem66#1.offset := read~$Pointer$(main_~users~0#1.base, 8 + main_~users~0#1.offset, 4);call main_#t~mem67#1.base, main_#t~mem67#1.offset := read~$Pointer$(main_#t~mem66#1.base, main_#t~mem66#1.offset, 4);main_~_ha_head~0#1.base, main_~_ha_head~0#1.offset := main_#t~mem67#1.base, main_#t~mem67#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~mem66#1.base, main_#t~mem66#1.offset;havoc main_#t~mem67#1.base, main_#t~mem67#1.offset;call main_#t~mem68#1 := read~int(main_~_ha_head~0#1.base, 4 + main_~_ha_head~0#1.offset, 4);main_#t~post69#1 := main_#t~mem68#1;call write~int(1 + main_#t~post69#1, main_~_ha_head~0#1.base, 4 + main_~_ha_head~0#1.offset, 4);havoc main_#t~mem68#1;havoc main_#t~post69#1;call main_#t~mem70#1.base, main_#t~mem70#1.offset := read~$Pointer$(main_~_ha_head~0#1.base, main_~_ha_head~0#1.offset, 4);call write~$Pointer$(main_#t~mem70#1.base, main_#t~mem70#1.offset, main_~user~0#1.base, 24 + main_~user~0#1.offset, 4);havoc main_#t~mem70#1.base, main_#t~mem70#1.offset;call write~$Pointer$(0, 0, main_~user~0#1.base, 20 + main_~user~0#1.offset, 4);call main_#t~mem71#1.base, main_#t~mem71#1.offset := read~$Pointer$(main_~_ha_head~0#1.base, main_~_ha_head~0#1.offset, 4); {12641#false} is VALID [2022-02-20 23:33:27,756 INFO L290 TraceCheckUtils]: 66: Hoare triple {12641#false} assume main_#t~mem71#1.base != 0 || main_#t~mem71#1.offset != 0;havoc main_#t~mem71#1.base, main_#t~mem71#1.offset;call main_#t~mem72#1.base, main_#t~mem72#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~mem72#1.base, 12 + main_#t~mem72#1.offset, 4);havoc main_#t~mem72#1.base, main_#t~mem72#1.offset; {12641#false} is VALID [2022-02-20 23:33:27,756 INFO L290 TraceCheckUtils]: 67: Hoare triple {12641#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~mem74#1 := read~int(main_~_ha_head~0#1.base, 4 + main_~_ha_head~0#1.offset, 4);call main_#t~mem73#1 := read~int(main_~_ha_head~0#1.base, 8 + main_~_ha_head~0#1.offset, 4);main_#t~short77#1 := main_#t~mem74#1 % 4294967296 >= 10 * (1 + main_#t~mem73#1) % 4294967296; {12641#false} is VALID [2022-02-20 23:33:27,756 INFO L290 TraceCheckUtils]: 68: Hoare triple {12641#false} assume !main_#t~short77#1; {12641#false} is VALID [2022-02-20 23:33:27,756 INFO L290 TraceCheckUtils]: 69: Hoare triple {12641#false} assume !main_#t~short77#1;havoc main_#t~mem74#1;havoc main_#t~mem73#1;havoc main_#t~mem75#1.base, main_#t~mem75#1.offset;havoc main_#t~mem76#1;havoc main_#t~short77#1; {12641#false} is VALID [2022-02-20 23:33:27,757 INFO L290 TraceCheckUtils]: 70: Hoare triple {12641#false} goto; {12641#false} is VALID [2022-02-20 23:33:27,757 INFO L290 TraceCheckUtils]: 71: Hoare triple {12641#false} goto; {12641#false} is VALID [2022-02-20 23:33:27,757 INFO L290 TraceCheckUtils]: 72: Hoare triple {12641#false} goto; {12641#false} is VALID [2022-02-20 23:33:27,757 INFO L290 TraceCheckUtils]: 73: Hoare triple {12641#false} goto; {12641#false} is VALID [2022-02-20 23:33:27,757 INFO L290 TraceCheckUtils]: 74: Hoare triple {12641#false} call main_#t~mem144#1.base, main_#t~mem144#1.offset := read~$Pointer$(main_~user~0#1.base, 8 + main_~user~0#1.offset, 4);call main_#t~mem145#1 := read~int(main_#t~mem144#1.base, 12 + main_#t~mem144#1.offset, 4); {12641#false} is VALID [2022-02-20 23:33:27,757 INFO L272 TraceCheckUtils]: 75: Hoare triple {12641#false} call test_int((if main_#t~mem145#1 % 4294967296 % 4294967296 <= 2147483647 then main_#t~mem145#1 % 4294967296 % 4294967296 else main_#t~mem145#1 % 4294967296 % 4294967296 - 4294967296)); {12641#false} is VALID [2022-02-20 23:33:27,757 INFO L290 TraceCheckUtils]: 76: Hoare triple {12641#false} ~a := #in~a;#t~post3 := ~count_int~0;~count_int~0 := 1 + #t~post3;#t~switch4 := 0 == #t~post3; {12641#false} is VALID [2022-02-20 23:33:27,757 INFO L290 TraceCheckUtils]: 77: Hoare triple {12641#false} assume #t~switch4; {12641#false} is VALID [2022-02-20 23:33:27,758 INFO L272 TraceCheckUtils]: 78: Hoare triple {12641#false} call __VERIFIER_assert((if 1 == ~a then 1 else 0)); {12641#false} is VALID [2022-02-20 23:33:27,758 INFO L290 TraceCheckUtils]: 79: Hoare triple {12641#false} ~cond := #in~cond; {12641#false} is VALID [2022-02-20 23:33:27,758 INFO L290 TraceCheckUtils]: 80: Hoare triple {12641#false} assume 0 == ~cond; {12641#false} is VALID [2022-02-20 23:33:27,758 INFO L290 TraceCheckUtils]: 81: Hoare triple {12641#false} assume !false; {12641#false} is VALID [2022-02-20 23:33:27,758 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 4 proven. 25 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-02-20 23:33:27,758 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-20 23:33:29,133 INFO L290 TraceCheckUtils]: 81: Hoare triple {12641#false} assume !false; {12641#false} is VALID [2022-02-20 23:33:29,134 INFO L290 TraceCheckUtils]: 80: Hoare triple {12641#false} assume 0 == ~cond; {12641#false} is VALID [2022-02-20 23:33:29,134 INFO L290 TraceCheckUtils]: 79: Hoare triple {12641#false} ~cond := #in~cond; {12641#false} is VALID [2022-02-20 23:33:29,134 INFO L272 TraceCheckUtils]: 78: Hoare triple {12641#false} call __VERIFIER_assert((if 1 == ~a then 1 else 0)); {12641#false} is VALID [2022-02-20 23:33:29,134 INFO L290 TraceCheckUtils]: 77: Hoare triple {12641#false} assume #t~switch4; {12641#false} is VALID [2022-02-20 23:33:29,134 INFO L290 TraceCheckUtils]: 76: Hoare triple {12641#false} ~a := #in~a;#t~post3 := ~count_int~0;~count_int~0 := 1 + #t~post3;#t~switch4 := 0 == #t~post3; {12641#false} is VALID [2022-02-20 23:33:29,134 INFO L272 TraceCheckUtils]: 75: Hoare triple {12641#false} call test_int((if main_#t~mem145#1 % 4294967296 % 4294967296 <= 2147483647 then main_#t~mem145#1 % 4294967296 % 4294967296 else main_#t~mem145#1 % 4294967296 % 4294967296 - 4294967296)); {12641#false} is VALID [2022-02-20 23:33:29,134 INFO L290 TraceCheckUtils]: 74: Hoare triple {12641#false} call main_#t~mem144#1.base, main_#t~mem144#1.offset := read~$Pointer$(main_~user~0#1.base, 8 + main_~user~0#1.offset, 4);call main_#t~mem145#1 := read~int(main_#t~mem144#1.base, 12 + main_#t~mem144#1.offset, 4); {12641#false} is VALID [2022-02-20 23:33:29,134 INFO L290 TraceCheckUtils]: 73: Hoare triple {12641#false} goto; {12641#false} is VALID [2022-02-20 23:33:29,134 INFO L290 TraceCheckUtils]: 72: Hoare triple {12641#false} goto; {12641#false} is VALID [2022-02-20 23:33:29,134 INFO L290 TraceCheckUtils]: 71: Hoare triple {12641#false} goto; {12641#false} is VALID [2022-02-20 23:33:29,134 INFO L290 TraceCheckUtils]: 70: Hoare triple {12641#false} goto; {12641#false} is VALID [2022-02-20 23:33:29,134 INFO L290 TraceCheckUtils]: 69: Hoare triple {12641#false} assume !main_#t~short77#1;havoc main_#t~mem74#1;havoc main_#t~mem73#1;havoc main_#t~mem75#1.base, main_#t~mem75#1.offset;havoc main_#t~mem76#1;havoc main_#t~short77#1; {12641#false} is VALID [2022-02-20 23:33:29,134 INFO L290 TraceCheckUtils]: 68: Hoare triple {12641#false} assume !main_#t~short77#1; {12641#false} is VALID [2022-02-20 23:33:29,134 INFO L290 TraceCheckUtils]: 67: Hoare triple {12641#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~mem74#1 := read~int(main_~_ha_head~0#1.base, 4 + main_~_ha_head~0#1.offset, 4);call main_#t~mem73#1 := read~int(main_~_ha_head~0#1.base, 8 + main_~_ha_head~0#1.offset, 4);main_#t~short77#1 := main_#t~mem74#1 % 4294967296 >= 10 * (1 + main_#t~mem73#1) % 4294967296; {12641#false} is VALID [2022-02-20 23:33:29,134 INFO L290 TraceCheckUtils]: 66: Hoare triple {12641#false} assume main_#t~mem71#1.base != 0 || main_#t~mem71#1.offset != 0;havoc main_#t~mem71#1.base, main_#t~mem71#1.offset;call main_#t~mem72#1.base, main_#t~mem72#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~mem72#1.base, 12 + main_#t~mem72#1.offset, 4);havoc main_#t~mem72#1.base, main_#t~mem72#1.offset; {12641#false} is VALID [2022-02-20 23:33:29,134 INFO L290 TraceCheckUtils]: 65: Hoare triple {12641#false} call main_#t~mem66#1.base, main_#t~mem66#1.offset := read~$Pointer$(main_~users~0#1.base, 8 + main_~users~0#1.offset, 4);call main_#t~mem67#1.base, main_#t~mem67#1.offset := read~$Pointer$(main_#t~mem66#1.base, main_#t~mem66#1.offset, 4);main_~_ha_head~0#1.base, main_~_ha_head~0#1.offset := main_#t~mem67#1.base, main_#t~mem67#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~mem66#1.base, main_#t~mem66#1.offset;havoc main_#t~mem67#1.base, main_#t~mem67#1.offset;call main_#t~mem68#1 := read~int(main_~_ha_head~0#1.base, 4 + main_~_ha_head~0#1.offset, 4);main_#t~post69#1 := main_#t~mem68#1;call write~int(1 + main_#t~post69#1, main_~_ha_head~0#1.base, 4 + main_~_ha_head~0#1.offset, 4);havoc main_#t~mem68#1;havoc main_#t~post69#1;call main_#t~mem70#1.base, main_#t~mem70#1.offset := read~$Pointer$(main_~_ha_head~0#1.base, main_~_ha_head~0#1.offset, 4);call write~$Pointer$(main_#t~mem70#1.base, main_#t~mem70#1.offset, main_~user~0#1.base, 24 + main_~user~0#1.offset, 4);havoc main_#t~mem70#1.base, main_#t~mem70#1.offset;call write~$Pointer$(0, 0, main_~user~0#1.base, 20 + main_~user~0#1.offset, 4);call main_#t~mem71#1.base, main_#t~mem71#1.offset := read~$Pointer$(main_~_ha_head~0#1.base, main_~_ha_head~0#1.offset, 4); {12641#false} is VALID [2022-02-20 23:33:29,135 INFO L290 TraceCheckUtils]: 64: Hoare triple {12641#false} goto; {12641#false} is VALID [2022-02-20 23:33:29,135 INFO L290 TraceCheckUtils]: 63: Hoare triple {12641#false} call main_#t~mem64#1.base, main_#t~mem64#1.offset := read~$Pointer$(main_~users~0#1.base, 8 + main_~users~0#1.offset, 4);call main_#t~mem65#1 := read~int(main_#t~mem64#1.base, 4 + main_#t~mem64#1.offset, 4);main_~_ha_bkt~0#1 := (if 0 == main_~_ha_hashv~0#1 || 0 == main_#t~mem65#1 - 1 then 0 else (if 1 == main_#t~mem65#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~mem65#1 - 1))) else (if 1 == main_~_ha_hashv~0#1 then (if 1 == main_#t~mem65#1 - 1 || 0 == main_#t~mem65#1 - 1 then main_#t~mem65#1 - 1 else (if main_#t~mem65#1 - 1 >= 0 then (main_#t~mem65#1 - 1) % 2 else ~bitwiseAnd(main_~_ha_hashv~0#1, main_#t~mem65#1 - 1))) else ~bitwiseAnd(main_~_ha_hashv~0#1, main_#t~mem65#1 - 1))));havoc main_#t~mem64#1.base, main_#t~mem64#1.offset;havoc main_#t~mem65#1; {12641#false} is VALID [2022-02-20 23:33:29,135 INFO L290 TraceCheckUtils]: 62: Hoare triple {12641#false} havoc main_~_ha_bkt~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 := read~int(main_#t~mem61#1.base, 12 + main_#t~mem61#1.offset, 4);main_#t~post63#1 := main_#t~mem62#1;call write~int(1 + main_#t~post63#1, main_#t~mem61#1.base, 12 + main_#t~mem61#1.offset, 4);havoc main_#t~mem61#1.base, main_#t~mem61#1.offset;havoc main_#t~mem62#1;havoc main_#t~post63#1; {12641#false} is VALID [2022-02-20 23:33:29,135 INFO L290 TraceCheckUtils]: 61: Hoare triple {12641#false} main_~users~0#1.base, main_~users~0#1.offset := main_~user~0#1.base, main_~user~0#1.offset; {12641#false} is VALID [2022-02-20 23:33:29,135 INFO L290 TraceCheckUtils]: 60: Hoare triple {12641#false} goto; {12641#false} is VALID [2022-02-20 23:33:29,135 INFO L290 TraceCheckUtils]: 59: Hoare triple {12641#false} 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~memset~res52#1.base, main_#t~memset~res52#1.offset; {12641#false} is VALID [2022-02-20 23:33:29,136 INFO L284 TraceCheckUtils]: 58: Hoare quadruple {12969#(not (= 384 |#Ultimate.C_memset_#amount|))} {12640#true} #1029#return; {12641#false} is VALID [2022-02-20 23:33:29,136 INFO L290 TraceCheckUtils]: 57: Hoare triple {12969#(not (= 384 |#Ultimate.C_memset_#amount|))} assume #res.base == #ptr.base && #res.offset == #ptr.offset; {12969#(not (= 384 |#Ultimate.C_memset_#amount|))} is VALID [2022-02-20 23:33:29,136 INFO L290 TraceCheckUtils]: 56: Hoare triple {12976#(or (not (= 384 |#Ultimate.C_memset_#amount|)) (< (mod |#Ultimate.C_memset_#t~loopctr280| 4294967296) (mod |#Ultimate.C_memset_#amount| 4294967296)))} assume !(#t~loopctr280 % 4294967296 < #amount % 4294967296); {12969#(not (= 384 |#Ultimate.C_memset_#amount|))} is VALID [2022-02-20 23:33:29,138 INFO L290 TraceCheckUtils]: 55: Hoare triple {12980#(or (not (= 384 |#Ultimate.C_memset_#amount|)) (< (mod (+ |#Ultimate.C_memset_#t~loopctr280| 1) 4294967296) (mod |#Ultimate.C_memset_#amount| 4294967296)))} assume #t~loopctr280 % 4294967296 < #amount % 4294967296;#memory_$Pointer$.base, #memory_$Pointer$.offset := #memory_$Pointer$.base[#ptr.base,#ptr.offset + #t~loopctr280 := 0], #memory_$Pointer$.offset[#ptr.base,#ptr.offset + #t~loopctr280 := #value % 256];#memory_int := #memory_int[#ptr.base,#ptr.offset + #t~loopctr280 := #value];#t~loopctr280 := 1 + #t~loopctr280; {12976#(or (not (= 384 |#Ultimate.C_memset_#amount|)) (< (mod |#Ultimate.C_memset_#t~loopctr280| 4294967296) (mod |#Ultimate.C_memset_#amount| 4294967296)))} is VALID [2022-02-20 23:33:29,139 INFO L290 TraceCheckUtils]: 54: Hoare triple {12984#(or (not (= 384 |#Ultimate.C_memset_#amount|)) (< (mod (+ |#Ultimate.C_memset_#t~loopctr280| 2) 4294967296) (mod |#Ultimate.C_memset_#amount| 4294967296)) (not (< (mod |#Ultimate.C_memset_#t~loopctr280| 4294967296) (mod |#Ultimate.C_memset_#amount| 4294967296))))} assume #t~loopctr280 % 4294967296 < #amount % 4294967296;#memory_$Pointer$.base, #memory_$Pointer$.offset := #memory_$Pointer$.base[#ptr.base,#ptr.offset + #t~loopctr280 := 0], #memory_$Pointer$.offset[#ptr.base,#ptr.offset + #t~loopctr280 := #value % 256];#memory_int := #memory_int[#ptr.base,#ptr.offset + #t~loopctr280 := #value];#t~loopctr280 := 1 + #t~loopctr280; {12980#(or (not (= 384 |#Ultimate.C_memset_#amount|)) (< (mod (+ |#Ultimate.C_memset_#t~loopctr280| 1) 4294967296) (mod |#Ultimate.C_memset_#amount| 4294967296)))} is VALID [2022-02-20 23:33:29,139 INFO L290 TraceCheckUtils]: 53: Hoare triple {12640#true} #t~loopctr280 := 0; {12984#(or (not (= 384 |#Ultimate.C_memset_#amount|)) (< (mod (+ |#Ultimate.C_memset_#t~loopctr280| 2) 4294967296) (mod |#Ultimate.C_memset_#amount| 4294967296)) (not (< (mod |#Ultimate.C_memset_#t~loopctr280| 4294967296) (mod |#Ultimate.C_memset_#amount| 4294967296))))} is VALID [2022-02-20 23:33:29,139 INFO L272 TraceCheckUtils]: 52: Hoare triple {12640#true} call main_#t~memset~res52#1.base, main_#t~memset~res52#1.offset := #Ultimate.C_memset(main_#t~mem51#1.base, main_#t~mem51#1.offset, 0, 384); {12640#true} is VALID [2022-02-20 23:33:29,139 INFO L290 TraceCheckUtils]: 51: Hoare triple {12640#true} assume !(main_#t~mem48#1.base == 0 && main_#t~mem48#1.offset == 0);havoc main_#t~mem47#1.base, main_#t~mem47#1.offset;havoc main_#t~mem48#1.base, main_#t~mem48#1.offset;call main_#t~mem50#1.base, main_#t~mem50#1.offset := read~$Pointer$(main_~user~0#1.base, 8 + main_~user~0#1.offset, 4);call main_#t~mem51#1.base, main_#t~mem51#1.offset := read~$Pointer$(main_#t~mem50#1.base, main_#t~mem50#1.offset, 4); {12640#true} is VALID [2022-02-20 23:33:29,139 INFO L290 TraceCheckUtils]: 50: Hoare triple {12640#true} havoc main_#t~mem38#1.base, main_#t~mem38#1.offset;havoc main_#t~memset~res39#1.base, main_#t~memset~res39#1.offset;call main_#t~mem40#1.base, main_#t~mem40#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~mem40#1.base, 16 + main_#t~mem40#1.offset, 4);havoc main_#t~mem40#1.base, main_#t~mem40#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(32, main_#t~mem41#1.base, 4 + 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 write~int(5, main_#t~mem42#1.base, 8 + main_#t~mem42#1.offset, 4);havoc main_#t~mem42#1.base, main_#t~mem42#1.offset;call main_#t~mem43#1.base, main_#t~mem43#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~mem43#1.base, 20 + main_#t~mem43#1.offset, 4);havoc main_#t~mem43#1.base, main_#t~mem43#1.offset;call main_#t~mem44#1.base, main_#t~mem44#1.offset := read~$Pointer$(main_~user~0#1.base, 8 + main_~user~0#1.offset, 4);call main_#t~malloc45#1.base, main_#t~malloc45#1.offset := #Ultimate.allocOnHeap(384);call write~$Pointer$(main_#t~malloc45#1.base, main_#t~malloc45#1.offset, main_#t~mem44#1.base, main_#t~mem44#1.offset, 4);havoc main_#t~mem44#1.base, main_#t~mem44#1.offset;havoc main_#t~malloc45#1.base, main_#t~malloc45#1.offset;call main_#t~mem46#1.base, main_#t~mem46#1.offset := read~$Pointer$(main_~user~0#1.base, 8 + main_~user~0#1.offset, 4);call write~int(2685476833, main_#t~mem46#1.base, 40 + main_#t~mem46#1.offset, 4);havoc main_#t~mem46#1.base, main_#t~mem46#1.offset;call main_#t~mem47#1.base, main_#t~mem47#1.offset := read~$Pointer$(main_~user~0#1.base, 8 + main_~user~0#1.offset, 4);call main_#t~mem48#1.base, main_#t~mem48#1.offset := read~$Pointer$(main_#t~mem47#1.base, main_#t~mem47#1.offset, 4); {12640#true} is VALID [2022-02-20 23:33:29,140 INFO L284 TraceCheckUtils]: 49: Hoare quadruple {12640#true} {12640#true} #1027#return; {12640#true} is VALID [2022-02-20 23:33:29,140 INFO L290 TraceCheckUtils]: 48: Hoare triple {12640#true} assume #res.base == #ptr.base && #res.offset == #ptr.offset; {12640#true} is VALID [2022-02-20 23:33:29,140 INFO L290 TraceCheckUtils]: 47: Hoare triple {12640#true} assume !(#t~loopctr280 % 4294967296 < #amount % 4294967296); {12640#true} is VALID [2022-02-20 23:33:29,140 INFO L290 TraceCheckUtils]: 46: Hoare triple {12640#true} assume #t~loopctr280 % 4294967296 < #amount % 4294967296;#memory_$Pointer$.base, #memory_$Pointer$.offset := #memory_$Pointer$.base[#ptr.base,#ptr.offset + #t~loopctr280 := 0], #memory_$Pointer$.offset[#ptr.base,#ptr.offset + #t~loopctr280 := #value % 256];#memory_int := #memory_int[#ptr.base,#ptr.offset + #t~loopctr280 := #value];#t~loopctr280 := 1 + #t~loopctr280; {12640#true} is VALID [2022-02-20 23:33:29,140 INFO L290 TraceCheckUtils]: 45: Hoare triple {12640#true} assume #t~loopctr280 % 4294967296 < #amount % 4294967296;#memory_$Pointer$.base, #memory_$Pointer$.offset := #memory_$Pointer$.base[#ptr.base,#ptr.offset + #t~loopctr280 := 0], #memory_$Pointer$.offset[#ptr.base,#ptr.offset + #t~loopctr280 := #value % 256];#memory_int := #memory_int[#ptr.base,#ptr.offset + #t~loopctr280 := #value];#t~loopctr280 := 1 + #t~loopctr280; {12640#true} is VALID [2022-02-20 23:33:29,140 INFO L290 TraceCheckUtils]: 44: Hoare triple {12640#true} assume #t~loopctr280 % 4294967296 < #amount % 4294967296;#memory_$Pointer$.base, #memory_$Pointer$.offset := #memory_$Pointer$.base[#ptr.base,#ptr.offset + #t~loopctr280 := 0], #memory_$Pointer$.offset[#ptr.base,#ptr.offset + #t~loopctr280 := #value % 256];#memory_int := #memory_int[#ptr.base,#ptr.offset + #t~loopctr280 := #value];#t~loopctr280 := 1 + #t~loopctr280; {12640#true} is VALID [2022-02-20 23:33:29,140 INFO L290 TraceCheckUtils]: 43: Hoare triple {12640#true} assume #t~loopctr280 % 4294967296 < #amount % 4294967296;#memory_$Pointer$.base, #memory_$Pointer$.offset := #memory_$Pointer$.base[#ptr.base,#ptr.offset + #t~loopctr280 := 0], #memory_$Pointer$.offset[#ptr.base,#ptr.offset + #t~loopctr280 := #value % 256];#memory_int := #memory_int[#ptr.base,#ptr.offset + #t~loopctr280 := #value];#t~loopctr280 := 1 + #t~loopctr280; {12640#true} is VALID [2022-02-20 23:33:29,140 INFO L290 TraceCheckUtils]: 42: Hoare triple {12640#true} #t~loopctr280 := 0; {12640#true} is VALID [2022-02-20 23:33:29,140 INFO L272 TraceCheckUtils]: 41: Hoare triple {12640#true} call main_#t~memset~res39#1.base, main_#t~memset~res39#1.offset := #Ultimate.C_memset(main_#t~mem38#1.base, main_#t~mem38#1.offset, 0, 44); {12640#true} is VALID [2022-02-20 23:33:29,140 INFO L290 TraceCheckUtils]: 40: Hoare triple {12640#true} assume !(main_#t~mem37#1.base == 0 && main_#t~mem37#1.offset == 0);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); {12640#true} is VALID [2022-02-20 23:33:29,141 INFO L290 TraceCheckUtils]: 39: Hoare triple {12640#true} call main_#t~malloc36#1.base, main_#t~malloc36#1.offset := #Ultimate.allocOnHeap(44);call write~$Pointer$(main_#t~malloc36#1.base, main_#t~malloc36#1.offset, main_~user~0#1.base, 8 + main_~user~0#1.offset, 4);havoc main_#t~malloc36#1.base, main_#t~malloc36#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); {12640#true} is VALID [2022-02-20 23:33:29,141 INFO L290 TraceCheckUtils]: 38: Hoare triple {12640#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); {12640#true} is VALID [2022-02-20 23:33:29,141 INFO L290 TraceCheckUtils]: 37: Hoare triple {12640#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); {12640#true} is VALID [2022-02-20 23:33:29,141 INFO L290 TraceCheckUtils]: 36: Hoare triple {12640#true} goto; {12640#true} is VALID [2022-02-20 23:33:29,141 INFO L290 TraceCheckUtils]: 35: Hoare triple {12640#true} goto; {12640#true} is VALID [2022-02-20 23:33:29,141 INFO L290 TraceCheckUtils]: 34: Hoare triple {12640#true} goto; {12640#true} is VALID [2022-02-20 23:33:29,141 INFO L290 TraceCheckUtils]: 33: Hoare triple {12640#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)))); {12640#true} is VALID [2022-02-20 23:33:29,141 INFO L290 TraceCheckUtils]: 32: Hoare triple {12640#true} havoc main_#t~switch24#1; {12640#true} is VALID [2022-02-20 23:33:29,141 INFO L290 TraceCheckUtils]: 31: Hoare triple {12640#true} assume main_#t~switch24#1;call main_#t~mem35#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~mem35#1 % 256;havoc main_#t~mem35#1; {12640#true} is VALID [2022-02-20 23:33:29,142 INFO L290 TraceCheckUtils]: 30: Hoare triple {12640#true} main_#t~switch24#1 := main_#t~switch24#1 || 1 == main_~_hj_k~0#1; {12640#true} is VALID [2022-02-20 23:33:29,142 INFO L290 TraceCheckUtils]: 29: Hoare triple {12640#true} assume main_#t~switch24#1;call main_#t~mem34#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~mem34#1 % 256);havoc main_#t~mem34#1; {12640#true} is VALID [2022-02-20 23:33:29,142 INFO L290 TraceCheckUtils]: 28: Hoare triple {12640#true} main_#t~switch24#1 := main_#t~switch24#1 || 2 == main_~_hj_k~0#1; {12640#true} is VALID [2022-02-20 23:33:29,142 INFO L290 TraceCheckUtils]: 27: Hoare triple {12640#true} assume main_#t~switch24#1;call main_#t~mem33#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~mem33#1 % 256);havoc main_#t~mem33#1; {12640#true} is VALID [2022-02-20 23:33:29,142 INFO L290 TraceCheckUtils]: 26: Hoare triple {12640#true} main_#t~switch24#1 := main_#t~switch24#1 || 3 == main_~_hj_k~0#1; {12640#true} is VALID [2022-02-20 23:33:29,142 INFO L290 TraceCheckUtils]: 25: Hoare triple {12640#true} assume main_#t~switch24#1;call main_#t~mem32#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~mem32#1 % 256);havoc main_#t~mem32#1; {12640#true} is VALID [2022-02-20 23:33:29,142 INFO L290 TraceCheckUtils]: 24: Hoare triple {12640#true} main_#t~switch24#1 := main_#t~switch24#1 || 4 == main_~_hj_k~0#1; {12640#true} is VALID [2022-02-20 23:33:29,142 INFO L290 TraceCheckUtils]: 23: Hoare triple {12640#true} assume !main_#t~switch24#1; {12640#true} is VALID [2022-02-20 23:33:29,142 INFO L290 TraceCheckUtils]: 22: Hoare triple {12640#true} main_#t~switch24#1 := main_#t~switch24#1 || 5 == main_~_hj_k~0#1; {12640#true} is VALID [2022-02-20 23:33:29,142 INFO L290 TraceCheckUtils]: 21: Hoare triple {12640#true} assume !main_#t~switch24#1; {12640#true} is VALID [2022-02-20 23:33:29,142 INFO L290 TraceCheckUtils]: 20: Hoare triple {12640#true} main_#t~switch24#1 := main_#t~switch24#1 || 6 == main_~_hj_k~0#1; {12640#true} is VALID [2022-02-20 23:33:29,142 INFO L290 TraceCheckUtils]: 19: Hoare triple {12640#true} assume !main_#t~switch24#1; {12640#true} is VALID [2022-02-20 23:33:29,142 INFO L290 TraceCheckUtils]: 18: Hoare triple {12640#true} main_#t~switch24#1 := main_#t~switch24#1 || 7 == main_~_hj_k~0#1; {12640#true} is VALID [2022-02-20 23:33:29,142 INFO L290 TraceCheckUtils]: 17: Hoare triple {12640#true} assume !main_#t~switch24#1; {12640#true} is VALID [2022-02-20 23:33:29,142 INFO L290 TraceCheckUtils]: 16: Hoare triple {12640#true} main_#t~switch24#1 := main_#t~switch24#1 || 8 == main_~_hj_k~0#1; {12640#true} is VALID [2022-02-20 23:33:29,142 INFO L290 TraceCheckUtils]: 15: Hoare triple {12640#true} assume !main_#t~switch24#1; {12640#true} is VALID [2022-02-20 23:33:29,143 INFO L290 TraceCheckUtils]: 14: Hoare triple {12640#true} main_#t~switch24#1 := main_#t~switch24#1 || 9 == main_~_hj_k~0#1; {12640#true} is VALID [2022-02-20 23:33:29,143 INFO L290 TraceCheckUtils]: 13: Hoare triple {12640#true} assume !main_#t~switch24#1; {12640#true} is VALID [2022-02-20 23:33:29,143 INFO L290 TraceCheckUtils]: 12: Hoare triple {12640#true} main_#t~switch24#1 := main_#t~switch24#1 || 10 == main_~_hj_k~0#1; {12640#true} is VALID [2022-02-20 23:33:29,143 INFO L290 TraceCheckUtils]: 11: Hoare triple {12640#true} assume !main_#t~switch24#1; {12640#true} is VALID [2022-02-20 23:33:29,143 INFO L290 TraceCheckUtils]: 10: Hoare triple {12640#true} main_~_ha_hashv~0#1 := 4 + main_~_ha_hashv~0#1;main_#t~switch24#1 := 11 == main_~_hj_k~0#1; {12640#true} is VALID [2022-02-20 23:33:29,143 INFO L290 TraceCheckUtils]: 9: Hoare triple {12640#true} assume !(main_~_hj_k~0#1 % 4294967296 >= 12); {12640#true} is VALID [2022-02-20 23:33:29,143 INFO L290 TraceCheckUtils]: 8: Hoare triple {12640#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; {12640#true} is VALID [2022-02-20 23:33:29,143 INFO L290 TraceCheckUtils]: 7: Hoare triple {12640#true} goto; {12640#true} is VALID [2022-02-20 23:33:29,143 INFO L290 TraceCheckUtils]: 6: Hoare triple {12640#true} havoc main_~_ha_hashv~0#1; {12640#true} is VALID [2022-02-20 23:33:29,143 INFO L290 TraceCheckUtils]: 5: Hoare triple {12640#true} call main_#t~mem9#1 := read~int(main_~#i~0#1.base, main_~#i~0#1.offset, 4);call write~int(main_#t~mem9#1, main_~user~0#1.base, main_~user~0#1.offset, 4);havoc main_#t~mem9#1;call main_#t~mem10#1 := read~int(main_~#i~0#1.base, main_~#i~0#1.offset, 4);call main_#t~mem11#1 := read~int(main_~#i~0#1.base, main_~#i~0#1.offset, 4);call write~int(main_#t~mem10#1 * main_#t~mem11#1, main_~user~0#1.base, 4 + main_~user~0#1.offset, 4);havoc main_#t~mem10#1;havoc main_#t~mem11#1; {12640#true} is VALID [2022-02-20 23:33:29,143 INFO L290 TraceCheckUtils]: 4: Hoare triple {12640#true} assume !(main_~user~0#1.base == 0 && main_~user~0#1.offset == 0); {12640#true} is VALID [2022-02-20 23:33:29,143 INFO L290 TraceCheckUtils]: 3: Hoare triple {12640#true} assume !!(main_#t~mem7#1 < 10);havoc main_#t~mem7#1;call main_#t~malloc8#1.base, main_#t~malloc8#1.offset := #Ultimate.allocOnHeap(40);main_~user~0#1.base, main_~user~0#1.offset := main_#t~malloc8#1.base, main_#t~malloc8#1.offset;havoc main_#t~malloc8#1.base, main_#t~malloc8#1.offset; {12640#true} is VALID [2022-02-20 23:33:29,143 INFO L290 TraceCheckUtils]: 2: Hoare triple {12640#true} call main_#t~mem7#1 := read~int(main_~#i~0#1.base, main_~#i~0#1.offset, 4); {12640#true} is VALID [2022-02-20 23:33:29,144 INFO L290 TraceCheckUtils]: 1: Hoare triple {12640#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc8#1.base, main_#t~malloc8#1.offset, main_#t~mem9#1, main_#t~mem10#1, main_#t~mem11#1, main_#t~mem13#1, main_#t~mem12#1, main_#t~mem14#1, main_#t~mem15#1, main_#t~mem17#1, main_#t~mem16#1, main_#t~mem18#1, main_#t~mem19#1, main_#t~mem21#1, main_#t~mem20#1, main_#t~mem22#1, main_#t~mem23#1, main_#t~switch24#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_#t~mem31#1, main_#t~mem32#1, main_#t~mem33#1, main_#t~mem34#1, main_#t~mem35#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~malloc36#1.base, main_#t~malloc36#1.offset, main_#t~mem37#1.base, main_#t~mem37#1.offset, main_#t~mem38#1.base, main_#t~mem38#1.offset, main_#t~memset~res39#1.base, main_#t~memset~res39#1.offset, main_#t~mem40#1.base, main_#t~mem40#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~malloc45#1.base, main_#t~malloc45#1.offset, main_#t~mem46#1.base, main_#t~mem46#1.offset, main_#t~mem47#1.base, main_#t~mem47#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~memset~res52#1.base, main_#t~memset~res52#1.offset, 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~mem58#1.base, main_#t~mem58#1.offset, main_#t~mem59#1.base, main_#t~mem59#1.offset, main_#t~mem60#1.base, main_#t~mem60#1.offset, main_#t~mem61#1.base, main_#t~mem61#1.offset, main_#t~mem62#1, main_#t~post63#1, main_#t~mem64#1.base, main_#t~mem64#1.offset, main_#t~mem65#1, main_#t~mem66#1.base, main_#t~mem66#1.offset, main_#t~mem67#1.base, main_#t~mem67#1.offset, main_#t~mem68#1, main_#t~post69#1, main_#t~mem70#1.base, main_#t~mem70#1.offset, main_#t~mem71#1.base, main_#t~mem71#1.offset, main_#t~mem72#1.base, main_#t~mem72#1.offset, main_#t~mem74#1, main_#t~mem73#1, main_#t~mem75#1.base, main_#t~mem75#1.offset, main_#t~mem76#1, main_#t~short77#1, main_#t~mem78#1.base, main_#t~mem78#1.offset, main_#t~mem79#1, main_#t~malloc80#1.base, main_#t~malloc80#1.offset, main_#t~mem81#1.base, main_#t~mem81#1.offset, main_#t~mem82#1.base, main_#t~mem82#1.offset, main_#t~mem83#1.base, main_#t~mem83#1.offset, main_#t~mem84#1, main_#t~memset~res85#1.base, main_#t~memset~res85#1.offset, main_#t~mem86#1.base, main_#t~mem86#1.offset, main_#t~mem87#1.base, main_#t~mem87#1.offset, main_#t~mem90#1, main_#t~mem88#1.base, main_#t~mem88#1.offset, main_#t~mem89#1, main_#t~mem91#1.base, main_#t~mem91#1.offset, main_#t~mem94#1, main_#t~mem92#1.base, main_#t~mem92#1.offset, main_#t~mem93#1, main_#t~ite95#1, main_#t~mem96#1.base, main_#t~mem96#1.offset, main_#t~mem100#1.base, main_#t~mem100#1.offset, main_#t~mem101#1.base, main_#t~mem101#1.offset, main_#t~mem102#1.base, main_#t~mem102#1.offset, main_#t~mem103#1.base, main_#t~mem103#1.offset, main_#t~mem106#1, main_#t~mem104#1.base, main_#t~mem104#1.offset, main_#t~mem105#1, main_#t~mem107#1.base, main_#t~mem107#1.offset, main_#t~mem108#1, main_#t~pre109#1, main_#t~mem110#1.base, main_#t~mem110#1.offset, main_#t~mem111#1, main_#t~mem112#1.base, main_#t~mem112#1.offset, main_#t~mem113#1, main_#t~post114#1, main_#t~mem118#1, main_#t~mem116#1, main_#t~mem115#1.base, main_#t~mem115#1.offset, main_#t~mem117#1, main_#t~mem119#1, main_#t~post120#1, main_#t~mem121#1.base, main_#t~mem121#1.offset, main_#t~mem122#1.base, main_#t~mem122#1.offset, main_#t~mem123#1.base, main_#t~mem123#1.offset, main_#t~post97#1, main_#t~mem98#1.base, main_#t~mem98#1.offset, main_#t~mem99#1, main_#t~mem124#1.base, main_#t~mem124#1.offset, main_#t~mem125#1.base, main_#t~mem125#1.offset, main_#t~mem126#1.base, main_#t~mem126#1.offset, main_#t~mem127#1, main_#t~mem128#1.base, main_#t~mem128#1.offset, main_#t~mem129#1, main_#t~post130#1, main_#t~mem131#1.base, main_#t~mem131#1.offset, main_#t~mem132#1.base, main_#t~mem132#1.offset, main_#t~mem133#1.base, main_#t~mem133#1.offset, main_#t~mem134#1.base, main_#t~mem134#1.offset, main_#t~mem137#1, main_#t~mem135#1.base, main_#t~mem135#1.offset, main_#t~mem136#1, main_#t~ite140#1, main_#t~mem138#1.base, main_#t~mem138#1.offset, main_#t~mem139#1, main_#t~mem141#1.base, main_#t~mem141#1.offset, main_#t~mem142#1, main_#t~mem143#1.base, main_#t~mem143#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~mem144#1.base, main_#t~mem144#1.offset, main_#t~mem145#1, main_#t~mem5#1, main_#t~post6#1, main_#t~mem7#1, main_#t~mem149#1, main_#t~mem148#1, main_#t~mem150#1, main_#t~mem151#1, main_#t~mem153#1, main_#t~mem152#1, main_#t~mem154#1, main_#t~mem155#1, main_#t~mem157#1, main_#t~mem156#1, main_#t~mem158#1, main_#t~mem159#1, main_#t~switch160#1, main_#t~mem161#1, main_#t~mem162#1, main_#t~mem163#1, main_#t~mem164#1, main_#t~mem165#1, main_#t~mem166#1, main_#t~mem167#1, main_#t~mem168#1, main_#t~mem169#1, main_#t~mem170#1, main_#t~mem171#1, main_~_hj_i~1#1, main_~_hj_j~1#1, main_~_hj_k~1#1, main_~_hj_key~1#1.base, main_~_hj_key~1#1.offset, main_#t~mem172#1.base, main_#t~mem172#1.offset, main_#t~mem173#1, main_#t~mem174#1.base, main_#t~mem174#1.offset, main_#t~mem175#1.base, main_#t~mem175#1.offset, main_#t~mem176#1.base, main_#t~mem176#1.offset, main_#t~mem177#1.base, main_#t~mem177#1.offset, main_#t~mem178#1.base, main_#t~mem178#1.offset, main_#t~mem179#1.base, main_#t~mem179#1.offset, main_#t~mem180#1.base, main_#t~mem180#1.offset, main_#t~mem181#1, main_#t~mem182#1, main_#t~mem183#1, main_#t~short184#1, main_#t~mem185#1.base, main_#t~mem185#1.offset, main_#t~ret186#1, main_#t~mem187#1.base, main_#t~mem187#1.offset, main_#t~mem188#1.base, main_#t~mem188#1.offset, main_#t~mem189#1.base, main_#t~mem189#1.offset, main_#t~mem190#1, main_~_hf_bkt~0#1, main_~_hf_hashv~0#1, main_#t~mem191#1.base, main_#t~mem191#1.offset, main_#t~mem192#1.base, main_#t~mem192#1.offset, main_#t~short193#1, main_#t~mem194#1.base, main_#t~mem194#1.offset, main_#t~mem195#1.base, main_#t~mem195#1.offset, main_#t~mem196#1.base, main_#t~mem196#1.offset, main_#t~mem197#1.base, main_#t~mem197#1.offset, main_#t~mem198#1.base, main_#t~mem198#1.offset, main_#t~mem199#1.base, main_#t~mem199#1.offset, main_#t~mem200#1.base, main_#t~mem200#1.offset, main_#t~mem201#1.base, main_#t~mem201#1.offset, main_#t~mem202#1, main_#t~mem203#1.base, main_#t~mem203#1.offset, main_#t~mem204#1.base, main_#t~mem204#1.offset, main_#t~mem205#1.base, main_#t~mem205#1.offset, main_#t~mem206#1, main_#t~mem207#1.base, main_#t~mem207#1.offset, main_#t~mem208#1.base, main_#t~mem208#1.offset, main_#t~mem209#1.base, main_#t~mem209#1.offset, main_#t~mem210#1.base, main_#t~mem210#1.offset, main_#t~mem211#1.base, main_#t~mem211#1.offset, main_#t~mem212#1, main_#t~mem213#1.base, main_#t~mem213#1.offset, main_#t~mem216#1, main_#t~mem214#1.base, main_#t~mem214#1.offset, main_#t~mem215#1, main_#t~mem217#1.base, main_#t~mem217#1.offset, main_#t~mem218#1.base, main_#t~mem218#1.offset, main_#t~mem219#1, main_#t~post220#1, main_#t~mem221#1.base, main_#t~mem221#1.offset, main_#t~mem222#1.base, main_#t~mem222#1.offset, main_#t~mem223#1.base, main_#t~mem223#1.offset, main_#t~mem224#1.base, main_#t~mem224#1.offset, main_#t~mem225#1.base, main_#t~mem225#1.offset, main_#t~mem226#1.base, main_#t~mem226#1.offset, main_#t~mem227#1.base, main_#t~mem227#1.offset, main_#t~mem228#1.base, main_#t~mem228#1.offset, main_~_hd_head~0#1.base, main_~_hd_head~0#1.offset, main_#t~mem229#1.base, main_#t~mem229#1.offset, main_#t~mem230#1, main_#t~post231#1, main_~_hd_bkt~0#1, main_~_hd_hh_del~0#1.base, main_~_hd_hh_del~0#1.offset, main_#t~mem232#1.base, main_#t~mem232#1.offset, main_#t~mem233#1, main_#t~mem146#1, main_#t~mem147#1, main_#t~ite235#1.base, main_#t~ite235#1.offset, main_#t~mem234#1.base, main_#t~mem234#1.offset, main_#t~mem238#1.base, main_#t~mem238#1.offset, main_#t~mem239#1.base, main_#t~mem239#1.offset, main_#t~short240#1, main_#t~mem241#1.base, main_#t~mem241#1.offset, main_#t~mem242#1.base, main_#t~mem242#1.offset, main_#t~mem243#1.base, main_#t~mem243#1.offset, main_#t~mem244#1.base, main_#t~mem244#1.offset, main_#t~mem245#1.base, main_#t~mem245#1.offset, main_#t~mem246#1.base, main_#t~mem246#1.offset, main_#t~mem247#1.base, main_#t~mem247#1.offset, main_#t~mem248#1.base, main_#t~mem248#1.offset, main_#t~mem249#1, main_#t~mem250#1.base, main_#t~mem250#1.offset, main_#t~mem251#1.base, main_#t~mem251#1.offset, main_#t~mem252#1.base, main_#t~mem252#1.offset, main_#t~mem253#1, main_#t~mem254#1.base, main_#t~mem254#1.offset, main_#t~mem255#1.base, main_#t~mem255#1.offset, main_#t~mem256#1.base, main_#t~mem256#1.offset, main_#t~mem257#1.base, main_#t~mem257#1.offset, main_#t~mem258#1.base, main_#t~mem258#1.offset, main_#t~mem259#1, main_#t~mem260#1.base, main_#t~mem260#1.offset, main_#t~mem263#1, main_#t~mem261#1.base, main_#t~mem261#1.offset, main_#t~mem262#1, main_#t~mem264#1.base, main_#t~mem264#1.offset, main_#t~mem265#1.base, main_#t~mem265#1.offset, main_#t~mem266#1, main_#t~post267#1, main_#t~mem268#1.base, main_#t~mem268#1.offset, main_#t~mem269#1.base, main_#t~mem269#1.offset, main_#t~mem270#1.base, main_#t~mem270#1.offset, main_#t~mem271#1.base, main_#t~mem271#1.offset, main_#t~mem272#1.base, main_#t~mem272#1.offset, main_#t~mem273#1.base, main_#t~mem273#1.offset, main_#t~mem274#1.base, main_#t~mem274#1.offset, main_#t~mem275#1.base, main_#t~mem275#1.offset, main_~_hd_head~1#1.base, main_~_hd_head~1#1.offset, main_#t~mem276#1.base, main_#t~mem276#1.offset, main_#t~mem277#1, main_#t~post278#1, main_~_hd_bkt~1#1, main_~_hd_hh_del~1#1.base, main_~_hd_hh_del~1#1.offset, main_#t~ite237#1.base, main_#t~ite237#1.offset, main_#t~mem236#1.base, main_#t~mem236#1.offset, main_~#i~0#1.base, main_~#i~0#1.offset, main_~user~0#1.base, main_~user~0#1.offset, main_~tmp~0#1.base, main_~tmp~0#1.offset, main_~users~0#1.base, main_~users~0#1.offset, main_~temp~0#1.base, main_~temp~0#1.offset;call main_~#i~0#1.base, main_~#i~0#1.offset := #Ultimate.allocOnStack(4);havoc main_~user~0#1.base, main_~user~0#1.offset;havoc main_~tmp~0#1.base, main_~tmp~0#1.offset;main_~users~0#1.base, main_~users~0#1.offset := 0, 0;call write~int(0, main_~#i~0#1.base, main_~#i~0#1.offset, 4); {12640#true} is VALID [2022-02-20 23:33:29,144 INFO L290 TraceCheckUtils]: 0: Hoare triple {12640#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~0 := 0; {12640#true} is VALID [2022-02-20 23:33:29,144 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 17 proven. 3 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2022-02-20 23:33:29,144 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 23:33:29,144 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [488022697] [2022-02-20 23:33:29,144 WARN L317 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-02-20 23:33:29,144 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [531984331] [2022-02-20 23:33:29,144 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [531984331] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-20 23:33:29,145 INFO L191 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-02-20 23:33:29,145 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 6] total 15 [2022-02-20 23:33:29,145 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [920169220] [2022-02-20 23:33:29,145 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-02-20 23:33:29,146 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 5.666666666666667) internal successors, (85), 15 states have internal predecessors, (85), 2 states have call successors, (4), 2 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) Word has length 82 [2022-02-20 23:33:29,146 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:33:29,146 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 15 states, 15 states have (on average 5.666666666666667) internal successors, (85), 15 states have internal predecessors, (85), 2 states have call successors, (4), 2 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2022-02-20 23:33:29,216 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 92 edges. 92 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:33:29,217 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-02-20 23:33:29,217 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 23:33:29,218 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-02-20 23:33:29,218 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=153, Unknown=0, NotChecked=0, Total=210 [2022-02-20 23:33:29,218 INFO L87 Difference]: Start difference. First operand 350 states and 461 transitions. Second operand has 15 states, 15 states have (on average 5.666666666666667) internal successors, (85), 15 states have internal predecessors, (85), 2 states have call successors, (4), 2 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2022-02-20 23:33:31,837 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:33:31,837 INFO L93 Difference]: Finished difference Result 704 states and 937 transitions. [2022-02-20 23:33:31,855 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-02-20 23:33:31,855 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 5.666666666666667) internal successors, (85), 15 states have internal predecessors, (85), 2 states have call successors, (4), 2 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) Word has length 82 [2022-02-20 23:33:31,855 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:33:31,855 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 15 states have (on average 5.666666666666667) internal successors, (85), 15 states have internal predecessors, (85), 2 states have call successors, (4), 2 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2022-02-20 23:33:31,861 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 648 transitions. [2022-02-20 23:33:31,861 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 15 states have (on average 5.666666666666667) internal successors, (85), 15 states have internal predecessors, (85), 2 states have call successors, (4), 2 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2022-02-20 23:33:31,864 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 648 transitions. [2022-02-20 23:33:31,864 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 20 states and 648 transitions. [2022-02-20 23:33:32,371 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 648 edges. 648 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:33:32,377 INFO L225 Difference]: With dead ends: 704 [2022-02-20 23:33:32,377 INFO L226 Difference]: Without dead ends: 359 [2022-02-20 23:33:32,378 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 171 GetRequests, 149 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 83 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=156, Invalid=396, Unknown=0, NotChecked=0, Total=552 [2022-02-20 23:33:32,378 INFO L933 BasicCegarLoop]: 290 mSDtfsCounter, 266 mSDsluCounter, 963 mSDsCounter, 0 mSdLazyCounter, 171 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 276 SdHoareTripleChecker+Valid, 1253 SdHoareTripleChecker+Invalid, 194 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 171 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-02-20 23:33:32,378 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [276 Valid, 1253 Invalid, 194 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 171 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-02-20 23:33:32,379 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 359 states. [2022-02-20 23:33:32,418 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 359 to 350. [2022-02-20 23:33:32,419 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:33:32,420 INFO L82 GeneralOperation]: Start isEquivalent. First operand 359 states. Second operand has 350 states, 322 states have (on average 1.2981366459627328) internal successors, (418), 339 states have internal predecessors, (418), 21 states have call successors, (21), 4 states have call predecessors, (21), 5 states have return successors, (22), 7 states have call predecessors, (22), 21 states have call successors, (22) [2022-02-20 23:33:32,420 INFO L74 IsIncluded]: Start isIncluded. First operand 359 states. Second operand has 350 states, 322 states have (on average 1.2981366459627328) internal successors, (418), 339 states have internal predecessors, (418), 21 states have call successors, (21), 4 states have call predecessors, (21), 5 states have return successors, (22), 7 states have call predecessors, (22), 21 states have call successors, (22) [2022-02-20 23:33:32,421 INFO L87 Difference]: Start difference. First operand 359 states. Second operand has 350 states, 322 states have (on average 1.2981366459627328) internal successors, (418), 339 states have internal predecessors, (418), 21 states have call successors, (21), 4 states have call predecessors, (21), 5 states have return successors, (22), 7 states have call predecessors, (22), 21 states have call successors, (22) [2022-02-20 23:33:32,430 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:33:32,430 INFO L93 Difference]: Finished difference Result 359 states and 471 transitions. [2022-02-20 23:33:32,430 INFO L276 IsEmpty]: Start isEmpty. Operand 359 states and 471 transitions. [2022-02-20 23:33:32,431 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:33:32,431 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:33:32,432 INFO L74 IsIncluded]: Start isIncluded. First operand has 350 states, 322 states have (on average 1.2981366459627328) internal successors, (418), 339 states have internal predecessors, (418), 21 states have call successors, (21), 4 states have call predecessors, (21), 5 states have return successors, (22), 7 states have call predecessors, (22), 21 states have call successors, (22) Second operand 359 states. [2022-02-20 23:33:32,433 INFO L87 Difference]: Start difference. First operand has 350 states, 322 states have (on average 1.2981366459627328) internal successors, (418), 339 states have internal predecessors, (418), 21 states have call successors, (21), 4 states have call predecessors, (21), 5 states have return successors, (22), 7 states have call predecessors, (22), 21 states have call successors, (22) Second operand 359 states. [2022-02-20 23:33:32,440 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:33:32,441 INFO L93 Difference]: Finished difference Result 359 states and 471 transitions. [2022-02-20 23:33:32,441 INFO L276 IsEmpty]: Start isEmpty. Operand 359 states and 471 transitions. [2022-02-20 23:33:32,441 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:33:32,441 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:33:32,441 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:33:32,442 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:33:32,442 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 350 states, 322 states have (on average 1.2981366459627328) internal successors, (418), 339 states have internal predecessors, (418), 21 states have call successors, (21), 4 states have call predecessors, (21), 5 states have return successors, (22), 7 states have call predecessors, (22), 21 states have call successors, (22) [2022-02-20 23:33:32,451 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 350 states to 350 states and 461 transitions. [2022-02-20 23:33:32,451 INFO L78 Accepts]: Start accepts. Automaton has 350 states and 461 transitions. Word has length 82 [2022-02-20 23:33:32,451 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:33:32,452 INFO L470 AbstractCegarLoop]: Abstraction has 350 states and 461 transitions. [2022-02-20 23:33:32,452 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 5.666666666666667) internal successors, (85), 15 states have internal predecessors, (85), 2 states have call successors, (4), 2 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2022-02-20 23:33:32,452 INFO L276 IsEmpty]: Start isEmpty. Operand 350 states and 461 transitions. [2022-02-20 23:33:32,453 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2022-02-20 23:33:32,453 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:33:32,453 INFO L514 BasicCegarLoop]: trace histogram [12, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 23:33:32,472 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-02-20 23:33:32,670 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 23:33:32,670 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 23:33:32,671 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:33:32,671 INFO L85 PathProgramCache]: Analyzing trace with hash -184704007, now seen corresponding path program 3 times [2022-02-20 23:33:32,671 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 23:33:32,671 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1291069633] [2022-02-20 23:33:32,671 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:33:32,671 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 23:33:32,722 ERROR L252 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-02-20 23:33:32,722 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1997918535] [2022-02-20 23:33:32,722 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-02-20 23:33:32,723 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 23:33:32,723 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 23:33:32,724 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-20 23:33:32,725 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process