./Ultimate.py --spec ../sv-benchmarks/c/properties/no-overflow.prp --file ../sv-benchmarks/c/uthash-2.0.2/uthash_SFH_test1-2.i --full-output -ea --architecture 32bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version 03d7b7b3 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -ea -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/uthash-2.0.2/uthash_SFH_test1-2.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! overflow) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 1447114af8a4b489e3ec713f117f7a92d9cc93e5175903910b61bfe512c41aed --- Real Ultimate output --- This is Ultimate 0.2.2-dev-03d7b7b [2022-02-21 03:20:42,756 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-02-21 03:20:42,758 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-02-21 03:20:42,791 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-02-21 03:20:42,791 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-02-21 03:20:42,794 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-02-21 03:20:42,795 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-02-21 03:20:42,800 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-02-21 03:20:42,801 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-02-21 03:20:42,802 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-02-21 03:20:42,802 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-02-21 03:20:42,804 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-02-21 03:20:42,804 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-02-21 03:20:42,809 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-02-21 03:20:42,810 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-02-21 03:20:42,812 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-02-21 03:20:42,815 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-02-21 03:20:42,816 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-02-21 03:20:42,817 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-02-21 03:20:42,819 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-02-21 03:20:42,823 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-02-21 03:20:42,824 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-02-21 03:20:42,824 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-02-21 03:20:42,825 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-02-21 03:20:42,827 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-02-21 03:20:42,829 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-02-21 03:20:42,829 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-02-21 03:20:42,830 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-02-21 03:20:42,831 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-02-21 03:20:42,831 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-02-21 03:20:42,831 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-02-21 03:20:42,832 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-02-21 03:20:42,833 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-02-21 03:20:42,833 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-02-21 03:20:42,834 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-02-21 03:20:42,834 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-02-21 03:20:42,835 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-02-21 03:20:42,835 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-02-21 03:20:42,835 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-02-21 03:20:42,836 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-02-21 03:20:42,836 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-02-21 03:20:42,837 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf [2022-02-21 03:20:42,855 INFO L113 SettingsManager]: Loading preferences was successful [2022-02-21 03:20:42,855 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-02-21 03:20:42,855 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-02-21 03:20:42,855 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-02-21 03:20:42,856 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-02-21 03:20:42,856 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-02-21 03:20:42,857 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-02-21 03:20:42,857 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-02-21 03:20:42,857 INFO L138 SettingsManager]: * Use SBE=true [2022-02-21 03:20:42,857 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-02-21 03:20:42,858 INFO L138 SettingsManager]: * sizeof long=4 [2022-02-21 03:20:42,858 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-02-21 03:20:42,858 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-02-21 03:20:42,858 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-02-21 03:20:42,858 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-02-21 03:20:42,858 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-02-21 03:20:42,859 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-02-21 03:20:42,859 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-02-21 03:20:42,859 INFO L138 SettingsManager]: * Check absence of signed integer overflows=true [2022-02-21 03:20:42,859 INFO L138 SettingsManager]: * sizeof long double=12 [2022-02-21 03:20:42,859 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-02-21 03:20:42,859 INFO L138 SettingsManager]: * Use constant arrays=true [2022-02-21 03:20:42,860 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-02-21 03:20:42,860 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-02-21 03:20:42,860 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-02-21 03:20:42,860 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-02-21 03:20:42,860 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-21 03:20:42,860 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-02-21 03:20:42,861 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-02-21 03:20:42,861 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-02-21 03:20:42,861 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-02-21 03:20:42,861 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-02-21 03:20:42,861 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-02-21 03:20:42,861 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! overflow) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 1447114af8a4b489e3ec713f117f7a92d9cc93e5175903910b61bfe512c41aed [2022-02-21 03:20:43,074 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-02-21 03:20:43,096 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-02-21 03:20:43,098 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-02-21 03:20:43,099 INFO L271 PluginConnector]: Initializing CDTParser... [2022-02-21 03:20:43,099 INFO L275 PluginConnector]: CDTParser initialized [2022-02-21 03:20:43,100 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/uthash-2.0.2/uthash_SFH_test1-2.i [2022-02-21 03:20:43,165 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ab36fd245/33c740381d5f44d8979a855c140f46ed/FLAG75b3ae8ea [2022-02-21 03:20:43,708 INFO L306 CDTParser]: Found 1 translation units. [2022-02-21 03:20:43,709 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_SFH_test1-2.i [2022-02-21 03:20:43,724 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ab36fd245/33c740381d5f44d8979a855c140f46ed/FLAG75b3ae8ea [2022-02-21 03:20:44,200 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ab36fd245/33c740381d5f44d8979a855c140f46ed [2022-02-21 03:20:44,203 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-02-21 03:20:44,204 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-02-21 03:20:44,208 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-02-21 03:20:44,208 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-02-21 03:20:44,210 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-02-21 03:20:44,211 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.02 03:20:44" (1/1) ... [2022-02-21 03:20:44,212 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1c11e3d1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:20:44, skipping insertion in model container [2022-02-21 03:20:44,216 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.02 03:20:44" (1/1) ... [2022-02-21 03:20:44,220 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-02-21 03:20:44,258 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-21 03:20:44,463 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_SFH_test1-2.i[33021,33034] [2022-02-21 03:20:44,534 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-21 03:20:44,540 INFO L203 MainTranslator]: Completed pre-run [2022-02-21 03:20:44,575 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_SFH_test1-2.i[33021,33034] [2022-02-21 03:20:44,612 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-21 03:20:44,638 INFO L208 MainTranslator]: Completed translation [2022-02-21 03:20:44,641 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:20:44 WrapperNode [2022-02-21 03:20:44,641 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-02-21 03:20:44,642 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-02-21 03:20:44,642 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-02-21 03:20:44,642 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-02-21 03:20:44,647 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:20:44" (1/1) ... [2022-02-21 03:20:44,665 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:20:44" (1/1) ... [2022-02-21 03:20:44,731 INFO L137 Inliner]: procedures = 177, calls = 237, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 782 [2022-02-21 03:20:44,731 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-02-21 03:20:44,732 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-02-21 03:20:44,732 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-02-21 03:20:44,732 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-02-21 03:20:44,739 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:20:44" (1/1) ... [2022-02-21 03:20:44,739 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:20:44" (1/1) ... [2022-02-21 03:20:44,745 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:20:44" (1/1) ... [2022-02-21 03:20:44,746 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:20:44" (1/1) ... [2022-02-21 03:20:44,779 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:20:44" (1/1) ... [2022-02-21 03:20:44,814 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:20:44" (1/1) ... [2022-02-21 03:20:44,819 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:20:44" (1/1) ... [2022-02-21 03:20:44,851 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-02-21 03:20:44,869 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-02-21 03:20:44,869 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-02-21 03:20:44,869 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-02-21 03:20:44,870 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:20:44" (1/1) ... [2022-02-21 03:20:44,883 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-21 03:20:44,890 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:20:44,901 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-02-21 03:20:44,910 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-02-21 03:20:44,927 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-02-21 03:20:44,928 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-02-21 03:20:44,928 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-02-21 03:20:44,928 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-02-21 03:20:44,928 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset [2022-02-21 03:20:44,928 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset [2022-02-21 03:20:44,928 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-02-21 03:20:44,928 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-02-21 03:20:44,929 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-02-21 03:20:44,929 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-02-21 03:20:44,929 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-02-21 03:20:44,929 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-02-21 03:20:44,929 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-02-21 03:20:44,929 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-02-21 03:20:44,929 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-02-21 03:20:45,107 INFO L234 CfgBuilder]: Building ICFG [2022-02-21 03:20:45,110 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-02-21 03:20:46,432 INFO L275 CfgBuilder]: Performing block encoding [2022-02-21 03:20:46,439 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-02-21 03:20:46,439 INFO L299 CfgBuilder]: Removed 40 assume(true) statements. [2022-02-21 03:20:46,441 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.02 03:20:46 BoogieIcfgContainer [2022-02-21 03:20:46,441 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-02-21 03:20:46,442 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-02-21 03:20:46,442 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-02-21 03:20:46,445 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-02-21 03:20:46,445 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 21.02 03:20:44" (1/3) ... [2022-02-21 03:20:46,446 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@34197a7d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.02 03:20:46, skipping insertion in model container [2022-02-21 03:20:46,446 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:20:44" (2/3) ... [2022-02-21 03:20:46,446 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@34197a7d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.02 03:20:46, skipping insertion in model container [2022-02-21 03:20:46,446 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.02 03:20:46" (3/3) ... [2022-02-21 03:20:46,447 INFO L111 eAbstractionObserver]: Analyzing ICFG uthash_SFH_test1-2.i [2022-02-21 03:20:46,451 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-02-21 03:20:46,451 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 6 error locations. [2022-02-21 03:20:46,482 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-02-21 03:20:46,487 INFO L339 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mLoopAccelerationTechnique=FAST_UPR [2022-02-21 03:20:46,487 INFO L340 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2022-02-21 03:20:46,504 INFO L276 IsEmpty]: Start isEmpty. Operand has 167 states, 145 states have (on average 1.6827586206896552) internal successors, (244), 161 states have internal predecessors, (244), 13 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (13), 4 states have call predecessors, (13), 13 states have call successors, (13) [2022-02-21 03:20:46,506 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2022-02-21 03:20:46,506 INFO L506 BasicCegarLoop]: Found error trace [2022-02-21 03:20:46,506 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2022-02-21 03:20:46,507 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2022-02-21 03:20:46,510 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:20:46,510 INFO L85 PathProgramCache]: Analyzing trace with hash 1126635289, now seen corresponding path program 1 times [2022-02-21 03:20:46,517 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:20:46,517 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [318759896] [2022-02-21 03:20:46,517 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:20:46,518 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:20:46,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:20:46,650 INFO L290 TraceCheckUtils]: 0: Hoare triple {170#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(21, 2);~count_int_int~0 := 0; {170#true} is VALID [2022-02-21 03:20:46,651 INFO L290 TraceCheckUtils]: 1: Hoare triple {170#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc6#1.base, main_#t~malloc6#1.offset, main_#t~mem8#1, main_#t~mem7#1, main_#t~mem9#1, main_#t~mem10#1, main_#t~mem12#1, main_#t~mem11#1, main_#t~mem13#1, main_#t~mem14#1, main_#t~mem16#1, main_#t~mem15#1, main_#t~mem17#1, main_#t~mem18#1, main_#t~switch19#1, main_#t~mem20#1, main_#t~mem21#1, main_#t~mem22#1, main_#t~mem23#1, main_#t~mem24#1, main_#t~mem25#1, main_#t~mem26#1, main_#t~mem27#1, main_#t~mem28#1, main_#t~mem29#1, main_#t~mem30#1, main_~_hj_i~0#1, main_~_hj_j~0#1, main_~_hj_k~0#1, main_~_hj_key~0#1.base, main_~_hj_key~0#1.offset, main_#t~malloc31#1.base, main_#t~malloc31#1.offset, main_#t~mem32#1.base, main_#t~mem32#1.offset, main_#t~mem33#1.base, main_#t~mem33#1.offset, main_#t~memset~res34#1.base, main_#t~memset~res34#1.offset, main_#t~mem35#1.base, main_#t~mem35#1.offset, main_#t~mem36#1.base, main_#t~mem36#1.offset, main_#t~mem37#1.base, main_#t~mem37#1.offset, main_#t~mem38#1.base, main_#t~mem38#1.offset, main_#t~mem39#1.base, main_#t~mem39#1.offset, main_#t~malloc40#1.base, main_#t~malloc40#1.offset, main_#t~mem41#1.base, main_#t~mem41#1.offset, main_#t~mem42#1.base, main_#t~mem42#1.offset, main_#t~mem43#1.base, main_#t~mem43#1.offset, main_#t~mem44#1.base, main_#t~mem44#1.offset, main_#t~mem45#1.base, main_#t~mem45#1.offset, main_#t~mem46#1.base, main_#t~mem46#1.offset, main_#t~memset~res47#1.base, main_#t~memset~res47#1.offset, main_#t~mem48#1.base, main_#t~mem48#1.offset, main_#t~mem49#1.base, main_#t~mem49#1.offset, main_#t~mem50#1.base, main_#t~mem50#1.offset, main_#t~mem51#1.base, main_#t~mem51#1.offset, main_#t~mem52#1, main_#t~mem53#1.base, main_#t~mem53#1.offset, main_#t~mem54#1.base, main_#t~mem54#1.offset, main_#t~mem55#1.base, main_#t~mem55#1.offset, main_#t~mem56#1.base, main_#t~mem56#1.offset, main_#t~mem57#1, main_#t~post58#1, main_#t~mem59#1.base, main_#t~mem59#1.offset, main_#t~mem60#1, main_#t~mem61#1.base, main_#t~mem61#1.offset, main_#t~mem62#1.base, main_#t~mem62#1.offset, main_#t~mem63#1, main_#t~post64#1, main_#t~mem65#1.base, main_#t~mem65#1.offset, main_#t~mem66#1.base, main_#t~mem66#1.offset, main_#t~mem67#1.base, main_#t~mem67#1.offset, main_#t~mem69#1, main_#t~mem68#1, main_#t~mem70#1.base, main_#t~mem70#1.offset, main_#t~mem71#1, main_#t~short72#1, main_#t~mem73#1.base, main_#t~mem73#1.offset, main_#t~mem74#1, main_#t~malloc75#1.base, main_#t~malloc75#1.offset, main_#t~mem76#1.base, main_#t~mem76#1.offset, main_#t~mem77#1.base, main_#t~mem77#1.offset, main_#t~mem78#1.base, main_#t~mem78#1.offset, main_#t~mem79#1, main_#t~memset~res80#1.base, main_#t~memset~res80#1.offset, main_#t~mem81#1.base, main_#t~mem81#1.offset, main_#t~mem82#1.base, main_#t~mem82#1.offset, main_#t~mem85#1, main_#t~mem83#1.base, main_#t~mem83#1.offset, main_#t~mem84#1, main_#t~mem86#1.base, main_#t~mem86#1.offset, main_#t~mem89#1, main_#t~mem87#1.base, main_#t~mem87#1.offset, main_#t~mem88#1, main_#t~ite90#1, main_#t~mem91#1.base, main_#t~mem91#1.offset, main_#t~mem95#1.base, main_#t~mem95#1.offset, main_#t~mem96#1.base, main_#t~mem96#1.offset, main_#t~mem97#1.base, main_#t~mem97#1.offset, main_#t~mem98#1.base, main_#t~mem98#1.offset, main_#t~mem101#1, main_#t~mem99#1.base, main_#t~mem99#1.offset, main_#t~mem100#1, main_#t~mem102#1.base, main_#t~mem102#1.offset, main_#t~mem103#1, main_#t~pre104#1, main_#t~mem105#1.base, main_#t~mem105#1.offset, main_#t~mem106#1, main_#t~mem107#1.base, main_#t~mem107#1.offset, main_#t~mem108#1, main_#t~post109#1, main_#t~mem113#1, main_#t~mem111#1, main_#t~mem110#1.base, main_#t~mem110#1.offset, main_#t~mem112#1, main_#t~mem114#1, main_#t~post115#1, main_#t~mem116#1.base, main_#t~mem116#1.offset, main_#t~mem117#1.base, main_#t~mem117#1.offset, main_#t~mem118#1.base, main_#t~mem118#1.offset, main_#t~post92#1, main_#t~mem93#1.base, main_#t~mem93#1.offset, main_#t~mem94#1, main_#t~mem119#1.base, main_#t~mem119#1.offset, main_#t~mem120#1.base, main_#t~mem120#1.offset, main_#t~mem121#1.base, main_#t~mem121#1.offset, main_#t~mem122#1, main_#t~mem123#1.base, main_#t~mem123#1.offset, main_#t~mem124#1, main_#t~post125#1, main_#t~mem126#1.base, main_#t~mem126#1.offset, main_#t~mem127#1.base, main_#t~mem127#1.offset, main_#t~mem128#1.base, main_#t~mem128#1.offset, main_#t~mem129#1.base, main_#t~mem129#1.offset, main_#t~mem132#1, main_#t~mem130#1.base, main_#t~mem130#1.offset, main_#t~mem131#1, main_#t~ite135#1, main_#t~mem133#1.base, main_#t~mem133#1.offset, main_#t~mem134#1, main_#t~mem136#1.base, main_#t~mem136#1.offset, main_#t~mem137#1, main_#t~mem138#1.base, main_#t~mem138#1.offset, main_~_he_bkt~0#1, main_~_he_bkt_i~0#1, main_~_he_thh~0#1.base, main_~_he_thh~0#1.offset, main_~_he_hh_nxt~0#1.base, main_~_he_hh_nxt~0#1.offset, main_~#_he_new_buckets~0#1.base, main_~#_he_new_buckets~0#1.offset, main_~_he_newbkt~0#1.base, main_~_he_newbkt~0#1.offset, main_~_ha_head~0#1.base, main_~_ha_head~0#1.offset, main_~_ha_bkt~0#1, main_~_ha_hashv~0#1, main_#t~post5#1, main_#t~mem140#1, main_#t~mem141#1, main_#t~mem139#1.base, main_#t~mem139#1.offset, main_#t~ite143#1.base, main_#t~ite143#1.offset, main_#t~mem142#1.base, main_#t~mem142#1.offset, main_#t~mem146#1.base, main_#t~mem146#1.offset, main_#t~mem147#1.base, main_#t~mem147#1.offset, main_#t~short148#1, main_#t~mem149#1.base, main_#t~mem149#1.offset, main_#t~mem150#1.base, main_#t~mem150#1.offset, main_#t~mem151#1.base, main_#t~mem151#1.offset, main_#t~mem152#1.base, main_#t~mem152#1.offset, main_#t~mem153#1.base, main_#t~mem153#1.offset, main_#t~mem154#1.base, main_#t~mem154#1.offset, main_#t~mem155#1.base, main_#t~mem155#1.offset, main_#t~mem156#1.base, main_#t~mem156#1.offset, main_#t~mem157#1, main_#t~mem158#1.base, main_#t~mem158#1.offset, main_#t~mem159#1.base, main_#t~mem159#1.offset, main_#t~mem160#1.base, main_#t~mem160#1.offset, main_#t~mem161#1, main_#t~mem162#1.base, main_#t~mem162#1.offset, main_#t~mem163#1.base, main_#t~mem163#1.offset, main_#t~mem164#1.base, main_#t~mem164#1.offset, main_#t~mem165#1.base, main_#t~mem165#1.offset, main_#t~mem166#1.base, main_#t~mem166#1.offset, main_#t~mem167#1, main_#t~mem168#1.base, main_#t~mem168#1.offset, main_#t~mem171#1, main_#t~mem169#1.base, main_#t~mem169#1.offset, main_#t~mem170#1, main_#t~mem172#1.base, main_#t~mem172#1.offset, main_#t~mem173#1.base, main_#t~mem173#1.offset, main_#t~mem174#1, main_#t~post175#1, 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.base, main_#t~mem181#1.offset, main_#t~mem182#1.base, main_#t~mem182#1.offset, main_#t~mem183#1.base, main_#t~mem183#1.offset, main_~_hd_head~0#1.base, main_~_hd_head~0#1.offset, main_#t~mem184#1.base, main_#t~mem184#1.offset, main_#t~mem185#1, main_#t~post186#1, main_~_hd_bkt~0#1, main_~_hd_hh_del~0#1.base, main_~_hd_hh_del~0#1.offset, main_#t~ite145#1.base, main_#t~ite145#1.offset, main_#t~mem144#1.base, main_#t~mem144#1.offset, main_~i~0#1, main_~user~0#1.base, main_~user~0#1.offset, main_~users~0#1.base, main_~users~0#1.offset, main_~temp~0#1.base, main_~temp~0#1.offset;havoc main_~i~0#1;havoc main_~user~0#1.base, main_~user~0#1.offset;main_~users~0#1.base, main_~users~0#1.offset := 0, 0;main_~i~0#1 := 0; {172#(= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-21 03:20:46,652 INFO L290 TraceCheckUtils]: 2: Hoare triple {172#(= |ULTIMATE.start_main_~i~0#1| 0)} assume !(main_~i~0#1 < 10); {171#false} is VALID [2022-02-21 03:20:46,652 INFO L290 TraceCheckUtils]: 3: Hoare triple {171#false} main_~user~0#1.base, main_~user~0#1.offset := main_~users~0#1.base, main_~users~0#1.offset; {171#false} is VALID [2022-02-21 03:20:46,652 INFO L290 TraceCheckUtils]: 4: Hoare triple {171#false} assume !!(main_~user~0#1.base != 0 || main_~user~0#1.offset != 0);call main_#t~mem140#1 := read~int(main_~user~0#1.base, main_~user~0#1.offset, 4);call main_#t~mem141#1 := read~int(main_~user~0#1.base, 4 + main_~user~0#1.offset, 4);assume { :begin_inline_test_int_int } true;test_int_int_#in~a#1, test_int_int_#in~b#1 := main_#t~mem140#1, main_#t~mem141#1;havoc test_int_int_#t~post3#1, test_int_int_#t~switch4#1, test_int_int_~a#1, test_int_int_~b#1;test_int_int_~a#1 := test_int_int_#in~a#1;test_int_int_~b#1 := test_int_int_#in~b#1;test_int_int_#t~post3#1 := ~count_int_int~0; {171#false} is VALID [2022-02-21 03:20:46,653 INFO L290 TraceCheckUtils]: 5: Hoare triple {171#false} assume !(1 + test_int_int_#t~post3#1 <= 2147483647); {171#false} is VALID [2022-02-21 03:20:46,653 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-21 03:20:46,654 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 03:20:46,654 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [318759896] [2022-02-21 03:20:46,655 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [318759896] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-21 03:20:46,655 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-21 03:20:46,655 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-21 03:20:46,657 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [240816098] [2022-02-21 03:20:46,658 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-21 03:20:46,662 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2022-02-21 03:20:46,663 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-21 03:20:46,667 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:20:46,676 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 6 edges. 6 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:20:46,676 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-21 03:20:46,676 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 03:20:46,699 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-21 03:20:46,700 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-21 03:20:46,706 INFO L87 Difference]: Start difference. First operand has 167 states, 145 states have (on average 1.6827586206896552) internal successors, (244), 161 states have internal predecessors, (244), 13 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (13), 4 states have call predecessors, (13), 13 states have call successors, (13) Second operand has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:20:47,383 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:20:47,383 INFO L93 Difference]: Finished difference Result 424 states and 705 transitions. [2022-02-21 03:20:47,383 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-21 03:20:47,384 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2022-02-21 03:20:47,384 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-21 03:20:47,385 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:20:47,397 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 705 transitions. [2022-02-21 03:20:47,397 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:20:47,405 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 705 transitions. [2022-02-21 03:20:47,406 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 705 transitions. [2022-02-21 03:20:47,920 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 705 edges. 705 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:20:47,933 INFO L225 Difference]: With dead ends: 424 [2022-02-21 03:20:47,933 INFO L226 Difference]: Without dead ends: 226 [2022-02-21 03:20:47,936 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-21 03:20:47,938 INFO L933 BasicCegarLoop]: 251 mSDtfsCounter, 113 mSDsluCounter, 215 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 116 SdHoareTripleChecker+Valid, 466 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-21 03:20:47,939 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [116 Valid, 466 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-21 03:20:47,950 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 226 states. [2022-02-21 03:20:47,977 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 226 to 137. [2022-02-21 03:20:47,977 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 03:20:47,978 INFO L82 GeneralOperation]: Start isEquivalent. First operand 226 states. Second operand has 137 states, 117 states have (on average 1.3504273504273505) internal successors, (158), 131 states have internal predecessors, (158), 13 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (13), 4 states have call predecessors, (13), 13 states have call successors, (13) [2022-02-21 03:20:47,979 INFO L74 IsIncluded]: Start isIncluded. First operand 226 states. Second operand has 137 states, 117 states have (on average 1.3504273504273505) internal successors, (158), 131 states have internal predecessors, (158), 13 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (13), 4 states have call predecessors, (13), 13 states have call successors, (13) [2022-02-21 03:20:47,980 INFO L87 Difference]: Start difference. First operand 226 states. Second operand has 137 states, 117 states have (on average 1.3504273504273505) internal successors, (158), 131 states have internal predecessors, (158), 13 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (13), 4 states have call predecessors, (13), 13 states have call successors, (13) [2022-02-21 03:20:47,988 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:20:47,988 INFO L93 Difference]: Finished difference Result 226 states and 300 transitions. [2022-02-21 03:20:47,989 INFO L276 IsEmpty]: Start isEmpty. Operand 226 states and 300 transitions. [2022-02-21 03:20:47,990 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:20:47,990 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:20:47,991 INFO L74 IsIncluded]: Start isIncluded. First operand has 137 states, 117 states have (on average 1.3504273504273505) internal successors, (158), 131 states have internal predecessors, (158), 13 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (13), 4 states have call predecessors, (13), 13 states have call successors, (13) Second operand 226 states. [2022-02-21 03:20:47,992 INFO L87 Difference]: Start difference. First operand has 137 states, 117 states have (on average 1.3504273504273505) internal successors, (158), 131 states have internal predecessors, (158), 13 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (13), 4 states have call predecessors, (13), 13 states have call successors, (13) Second operand 226 states. [2022-02-21 03:20:48,000 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:20:48,000 INFO L93 Difference]: Finished difference Result 226 states and 300 transitions. [2022-02-21 03:20:48,000 INFO L276 IsEmpty]: Start isEmpty. Operand 226 states and 300 transitions. [2022-02-21 03:20:48,002 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:20:48,002 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:20:48,002 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 03:20:48,002 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 03:20:48,003 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 137 states, 117 states have (on average 1.3504273504273505) internal successors, (158), 131 states have internal predecessors, (158), 13 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (13), 4 states have call predecessors, (13), 13 states have call successors, (13) [2022-02-21 03:20:48,007 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 184 transitions. [2022-02-21 03:20:48,009 INFO L78 Accepts]: Start accepts. Automaton has 137 states and 184 transitions. Word has length 6 [2022-02-21 03:20:48,009 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-21 03:20:48,009 INFO L470 AbstractCegarLoop]: Abstraction has 137 states and 184 transitions. [2022-02-21 03:20:48,009 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:20:48,010 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 184 transitions. [2022-02-21 03:20:48,011 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2022-02-21 03:20:48,011 INFO L506 BasicCegarLoop]: Found error trace [2022-02-21 03:20:48,011 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-21 03:20:48,012 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-02-21 03:20:48,012 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2022-02-21 03:20:48,013 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:20:48,013 INFO L85 PathProgramCache]: Analyzing trace with hash -1116651610, now seen corresponding path program 1 times [2022-02-21 03:20:48,013 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:20:48,013 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [501448062] [2022-02-21 03:20:48,013 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:20:48,014 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:20:48,102 ERROR L252 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-02-21 03:20:48,102 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [44782772] [2022-02-21 03:20:48,103 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:20:48,103 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-21 03:20:48,103 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:20:48,128 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-02-21 03:20:48,134 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-02-21 03:20:48,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:20:48,564 INFO L263 TraceCheckSpWp]: Trace formula consists of 1517 conjuncts, 3 conjunts are in the unsatisfiable core [2022-02-21 03:20:48,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:20:48,620 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 03:20:48,845 INFO L290 TraceCheckUtils]: 0: Hoare triple {1310#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(21, 2);~count_int_int~0 := 0; {1310#true} is VALID [2022-02-21 03:20:48,845 INFO L290 TraceCheckUtils]: 1: Hoare triple {1310#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc6#1.base, main_#t~malloc6#1.offset, main_#t~mem8#1, main_#t~mem7#1, main_#t~mem9#1, main_#t~mem10#1, main_#t~mem12#1, main_#t~mem11#1, main_#t~mem13#1, main_#t~mem14#1, main_#t~mem16#1, main_#t~mem15#1, main_#t~mem17#1, main_#t~mem18#1, main_#t~switch19#1, main_#t~mem20#1, main_#t~mem21#1, main_#t~mem22#1, main_#t~mem23#1, main_#t~mem24#1, main_#t~mem25#1, main_#t~mem26#1, main_#t~mem27#1, main_#t~mem28#1, main_#t~mem29#1, main_#t~mem30#1, main_~_hj_i~0#1, main_~_hj_j~0#1, main_~_hj_k~0#1, main_~_hj_key~0#1.base, main_~_hj_key~0#1.offset, main_#t~malloc31#1.base, main_#t~malloc31#1.offset, main_#t~mem32#1.base, main_#t~mem32#1.offset, main_#t~mem33#1.base, main_#t~mem33#1.offset, main_#t~memset~res34#1.base, main_#t~memset~res34#1.offset, main_#t~mem35#1.base, main_#t~mem35#1.offset, main_#t~mem36#1.base, main_#t~mem36#1.offset, main_#t~mem37#1.base, main_#t~mem37#1.offset, main_#t~mem38#1.base, main_#t~mem38#1.offset, main_#t~mem39#1.base, main_#t~mem39#1.offset, main_#t~malloc40#1.base, main_#t~malloc40#1.offset, main_#t~mem41#1.base, main_#t~mem41#1.offset, main_#t~mem42#1.base, main_#t~mem42#1.offset, main_#t~mem43#1.base, main_#t~mem43#1.offset, main_#t~mem44#1.base, main_#t~mem44#1.offset, main_#t~mem45#1.base, main_#t~mem45#1.offset, main_#t~mem46#1.base, main_#t~mem46#1.offset, main_#t~memset~res47#1.base, main_#t~memset~res47#1.offset, main_#t~mem48#1.base, main_#t~mem48#1.offset, main_#t~mem49#1.base, main_#t~mem49#1.offset, main_#t~mem50#1.base, main_#t~mem50#1.offset, main_#t~mem51#1.base, main_#t~mem51#1.offset, main_#t~mem52#1, main_#t~mem53#1.base, main_#t~mem53#1.offset, main_#t~mem54#1.base, main_#t~mem54#1.offset, main_#t~mem55#1.base, main_#t~mem55#1.offset, main_#t~mem56#1.base, main_#t~mem56#1.offset, main_#t~mem57#1, main_#t~post58#1, main_#t~mem59#1.base, main_#t~mem59#1.offset, main_#t~mem60#1, main_#t~mem61#1.base, main_#t~mem61#1.offset, main_#t~mem62#1.base, main_#t~mem62#1.offset, main_#t~mem63#1, main_#t~post64#1, main_#t~mem65#1.base, main_#t~mem65#1.offset, main_#t~mem66#1.base, main_#t~mem66#1.offset, main_#t~mem67#1.base, main_#t~mem67#1.offset, main_#t~mem69#1, main_#t~mem68#1, main_#t~mem70#1.base, main_#t~mem70#1.offset, main_#t~mem71#1, main_#t~short72#1, main_#t~mem73#1.base, main_#t~mem73#1.offset, main_#t~mem74#1, main_#t~malloc75#1.base, main_#t~malloc75#1.offset, main_#t~mem76#1.base, main_#t~mem76#1.offset, main_#t~mem77#1.base, main_#t~mem77#1.offset, main_#t~mem78#1.base, main_#t~mem78#1.offset, main_#t~mem79#1, main_#t~memset~res80#1.base, main_#t~memset~res80#1.offset, main_#t~mem81#1.base, main_#t~mem81#1.offset, main_#t~mem82#1.base, main_#t~mem82#1.offset, main_#t~mem85#1, main_#t~mem83#1.base, main_#t~mem83#1.offset, main_#t~mem84#1, main_#t~mem86#1.base, main_#t~mem86#1.offset, main_#t~mem89#1, main_#t~mem87#1.base, main_#t~mem87#1.offset, main_#t~mem88#1, main_#t~ite90#1, main_#t~mem91#1.base, main_#t~mem91#1.offset, main_#t~mem95#1.base, main_#t~mem95#1.offset, main_#t~mem96#1.base, main_#t~mem96#1.offset, main_#t~mem97#1.base, main_#t~mem97#1.offset, main_#t~mem98#1.base, main_#t~mem98#1.offset, main_#t~mem101#1, main_#t~mem99#1.base, main_#t~mem99#1.offset, main_#t~mem100#1, main_#t~mem102#1.base, main_#t~mem102#1.offset, main_#t~mem103#1, main_#t~pre104#1, main_#t~mem105#1.base, main_#t~mem105#1.offset, main_#t~mem106#1, main_#t~mem107#1.base, main_#t~mem107#1.offset, main_#t~mem108#1, main_#t~post109#1, main_#t~mem113#1, main_#t~mem111#1, main_#t~mem110#1.base, main_#t~mem110#1.offset, main_#t~mem112#1, main_#t~mem114#1, main_#t~post115#1, main_#t~mem116#1.base, main_#t~mem116#1.offset, main_#t~mem117#1.base, main_#t~mem117#1.offset, main_#t~mem118#1.base, main_#t~mem118#1.offset, main_#t~post92#1, main_#t~mem93#1.base, main_#t~mem93#1.offset, main_#t~mem94#1, main_#t~mem119#1.base, main_#t~mem119#1.offset, main_#t~mem120#1.base, main_#t~mem120#1.offset, main_#t~mem121#1.base, main_#t~mem121#1.offset, main_#t~mem122#1, main_#t~mem123#1.base, main_#t~mem123#1.offset, main_#t~mem124#1, main_#t~post125#1, main_#t~mem126#1.base, main_#t~mem126#1.offset, main_#t~mem127#1.base, main_#t~mem127#1.offset, main_#t~mem128#1.base, main_#t~mem128#1.offset, main_#t~mem129#1.base, main_#t~mem129#1.offset, main_#t~mem132#1, main_#t~mem130#1.base, main_#t~mem130#1.offset, main_#t~mem131#1, main_#t~ite135#1, main_#t~mem133#1.base, main_#t~mem133#1.offset, main_#t~mem134#1, main_#t~mem136#1.base, main_#t~mem136#1.offset, main_#t~mem137#1, main_#t~mem138#1.base, main_#t~mem138#1.offset, main_~_he_bkt~0#1, main_~_he_bkt_i~0#1, main_~_he_thh~0#1.base, main_~_he_thh~0#1.offset, main_~_he_hh_nxt~0#1.base, main_~_he_hh_nxt~0#1.offset, main_~#_he_new_buckets~0#1.base, main_~#_he_new_buckets~0#1.offset, main_~_he_newbkt~0#1.base, main_~_he_newbkt~0#1.offset, main_~_ha_head~0#1.base, main_~_ha_head~0#1.offset, main_~_ha_bkt~0#1, main_~_ha_hashv~0#1, main_#t~post5#1, main_#t~mem140#1, main_#t~mem141#1, main_#t~mem139#1.base, main_#t~mem139#1.offset, main_#t~ite143#1.base, main_#t~ite143#1.offset, main_#t~mem142#1.base, main_#t~mem142#1.offset, main_#t~mem146#1.base, main_#t~mem146#1.offset, main_#t~mem147#1.base, main_#t~mem147#1.offset, main_#t~short148#1, main_#t~mem149#1.base, main_#t~mem149#1.offset, main_#t~mem150#1.base, main_#t~mem150#1.offset, main_#t~mem151#1.base, main_#t~mem151#1.offset, main_#t~mem152#1.base, main_#t~mem152#1.offset, main_#t~mem153#1.base, main_#t~mem153#1.offset, main_#t~mem154#1.base, main_#t~mem154#1.offset, main_#t~mem155#1.base, main_#t~mem155#1.offset, main_#t~mem156#1.base, main_#t~mem156#1.offset, main_#t~mem157#1, main_#t~mem158#1.base, main_#t~mem158#1.offset, main_#t~mem159#1.base, main_#t~mem159#1.offset, main_#t~mem160#1.base, main_#t~mem160#1.offset, main_#t~mem161#1, main_#t~mem162#1.base, main_#t~mem162#1.offset, main_#t~mem163#1.base, main_#t~mem163#1.offset, main_#t~mem164#1.base, main_#t~mem164#1.offset, main_#t~mem165#1.base, main_#t~mem165#1.offset, main_#t~mem166#1.base, main_#t~mem166#1.offset, main_#t~mem167#1, main_#t~mem168#1.base, main_#t~mem168#1.offset, main_#t~mem171#1, main_#t~mem169#1.base, main_#t~mem169#1.offset, main_#t~mem170#1, main_#t~mem172#1.base, main_#t~mem172#1.offset, main_#t~mem173#1.base, main_#t~mem173#1.offset, main_#t~mem174#1, main_#t~post175#1, 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.base, main_#t~mem181#1.offset, main_#t~mem182#1.base, main_#t~mem182#1.offset, main_#t~mem183#1.base, main_#t~mem183#1.offset, main_~_hd_head~0#1.base, main_~_hd_head~0#1.offset, main_#t~mem184#1.base, main_#t~mem184#1.offset, main_#t~mem185#1, main_#t~post186#1, main_~_hd_bkt~0#1, main_~_hd_hh_del~0#1.base, main_~_hd_hh_del~0#1.offset, main_#t~ite145#1.base, main_#t~ite145#1.offset, main_#t~mem144#1.base, main_#t~mem144#1.offset, main_~i~0#1, main_~user~0#1.base, main_~user~0#1.offset, main_~users~0#1.base, main_~users~0#1.offset, main_~temp~0#1.base, main_~temp~0#1.offset;havoc main_~i~0#1;havoc main_~user~0#1.base, main_~user~0#1.offset;main_~users~0#1.base, main_~users~0#1.offset := 0, 0;main_~i~0#1 := 0; {1310#true} is VALID [2022-02-21 03:20:48,845 INFO L290 TraceCheckUtils]: 2: Hoare triple {1310#true} assume !!(main_~i~0#1 < 10);call main_#t~malloc6#1.base, main_#t~malloc6#1.offset := #Ultimate.allocOnHeap(40);main_~user~0#1.base, main_~user~0#1.offset := main_#t~malloc6#1.base, main_#t~malloc6#1.offset;havoc main_#t~malloc6#1.base, main_#t~malloc6#1.offset; {1310#true} is VALID [2022-02-21 03:20:48,846 INFO L290 TraceCheckUtils]: 3: Hoare triple {1310#true} assume !(main_~user~0#1.base == 0 && main_~user~0#1.offset == 0); {1310#true} is VALID [2022-02-21 03:20:48,846 INFO L290 TraceCheckUtils]: 4: Hoare triple {1310#true} call write~int(main_~i~0#1, main_~user~0#1.base, main_~user~0#1.offset, 4); {1310#true} is VALID [2022-02-21 03:20:48,846 INFO L290 TraceCheckUtils]: 5: Hoare triple {1310#true} assume main_~i~0#1 * main_~i~0#1 <= 2147483647; {1310#true} is VALID [2022-02-21 03:20:48,846 INFO L290 TraceCheckUtils]: 6: Hoare triple {1310#true} assume main_~i~0#1 * main_~i~0#1 >= -2147483648;call write~int(main_~i~0#1 * main_~i~0#1, main_~user~0#1.base, 4 + main_~user~0#1.offset, 4); {1310#true} is VALID [2022-02-21 03:20:48,846 INFO L290 TraceCheckUtils]: 7: Hoare triple {1310#true} havoc main_~_ha_hashv~0#1; {1310#true} is VALID [2022-02-21 03:20:48,847 INFO L290 TraceCheckUtils]: 8: Hoare triple {1310#true} goto; {1310#true} is VALID [2022-02-21 03:20:48,847 INFO L290 TraceCheckUtils]: 9: Hoare triple {1310#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; {1310#true} is VALID [2022-02-21 03:20:48,847 INFO L290 TraceCheckUtils]: 10: Hoare triple {1310#true} assume !(main_~_hj_k~0#1 % 4294967296 >= 12); {1310#true} is VALID [2022-02-21 03:20:48,847 INFO L290 TraceCheckUtils]: 11: Hoare triple {1310#true} main_~_ha_hashv~0#1 := 4 + main_~_ha_hashv~0#1;main_#t~switch19#1 := 11 == main_~_hj_k~0#1; {1310#true} is VALID [2022-02-21 03:20:48,847 INFO L290 TraceCheckUtils]: 12: Hoare triple {1310#true} assume main_#t~switch19#1;call main_#t~mem20#1 := read~int(main_~_hj_key~0#1.base, 10 + main_~_hj_key~0#1.offset, 1);main_~_ha_hashv~0#1 := main_~_ha_hashv~0#1 + 16777216 * (main_#t~mem20#1 % 256);havoc main_#t~mem20#1; {1310#true} is VALID [2022-02-21 03:20:48,848 INFO L290 TraceCheckUtils]: 13: Hoare triple {1310#true} main_#t~switch19#1 := main_#t~switch19#1 || 10 == main_~_hj_k~0#1; {1310#true} is VALID [2022-02-21 03:20:48,848 INFO L290 TraceCheckUtils]: 14: Hoare triple {1310#true} assume main_#t~switch19#1;call main_#t~mem21#1 := read~int(main_~_hj_key~0#1.base, 9 + main_~_hj_key~0#1.offset, 1);main_~_ha_hashv~0#1 := main_~_ha_hashv~0#1 + 65536 * (main_#t~mem21#1 % 256);havoc main_#t~mem21#1; {1310#true} is VALID [2022-02-21 03:20:48,848 INFO L290 TraceCheckUtils]: 15: Hoare triple {1310#true} main_#t~switch19#1 := main_#t~switch19#1 || 9 == main_~_hj_k~0#1; {1310#true} is VALID [2022-02-21 03:20:48,848 INFO L290 TraceCheckUtils]: 16: Hoare triple {1310#true} assume main_#t~switch19#1;call main_#t~mem22#1 := read~int(main_~_hj_key~0#1.base, 8 + main_~_hj_key~0#1.offset, 1);main_~_ha_hashv~0#1 := main_~_ha_hashv~0#1 + 256 * (main_#t~mem22#1 % 256);havoc main_#t~mem22#1; {1310#true} is VALID [2022-02-21 03:20:48,848 INFO L290 TraceCheckUtils]: 17: Hoare triple {1310#true} main_#t~switch19#1 := main_#t~switch19#1 || 8 == main_~_hj_k~0#1; {1310#true} is VALID [2022-02-21 03:20:48,849 INFO L290 TraceCheckUtils]: 18: Hoare triple {1310#true} assume main_#t~switch19#1;call main_#t~mem23#1 := read~int(main_~_hj_key~0#1.base, 7 + main_~_hj_key~0#1.offset, 1);main_~_hj_j~0#1 := main_~_hj_j~0#1 + 16777216 * (main_#t~mem23#1 % 256);havoc main_#t~mem23#1; {1310#true} is VALID [2022-02-21 03:20:48,849 INFO L290 TraceCheckUtils]: 19: Hoare triple {1310#true} main_#t~switch19#1 := main_#t~switch19#1 || 7 == main_~_hj_k~0#1; {1310#true} is VALID [2022-02-21 03:20:48,849 INFO L290 TraceCheckUtils]: 20: Hoare triple {1310#true} assume main_#t~switch19#1;call main_#t~mem24#1 := read~int(main_~_hj_key~0#1.base, 6 + main_~_hj_key~0#1.offset, 1);main_~_hj_j~0#1 := main_~_hj_j~0#1 + 65536 * (main_#t~mem24#1 % 256);havoc main_#t~mem24#1; {1310#true} is VALID [2022-02-21 03:20:48,849 INFO L290 TraceCheckUtils]: 21: Hoare triple {1310#true} main_#t~switch19#1 := main_#t~switch19#1 || 6 == main_~_hj_k~0#1; {1310#true} is VALID [2022-02-21 03:20:48,850 INFO L290 TraceCheckUtils]: 22: Hoare triple {1310#true} assume main_#t~switch19#1;call main_#t~mem25#1 := read~int(main_~_hj_key~0#1.base, 5 + main_~_hj_key~0#1.offset, 1);main_~_hj_j~0#1 := main_~_hj_j~0#1 + 256 * (main_#t~mem25#1 % 256);havoc main_#t~mem25#1; {1381#|ULTIMATE.start_main_#t~switch19#1|} is VALID [2022-02-21 03:20:48,850 INFO L290 TraceCheckUtils]: 23: Hoare triple {1381#|ULTIMATE.start_main_#t~switch19#1|} main_#t~switch19#1 := main_#t~switch19#1 || 5 == main_~_hj_k~0#1; {1381#|ULTIMATE.start_main_#t~switch19#1|} is VALID [2022-02-21 03:20:48,851 INFO L290 TraceCheckUtils]: 24: Hoare triple {1381#|ULTIMATE.start_main_#t~switch19#1|} assume !main_#t~switch19#1; {1311#false} is VALID [2022-02-21 03:20:48,851 INFO L290 TraceCheckUtils]: 25: Hoare triple {1311#false} main_#t~switch19#1 := main_#t~switch19#1 || 4 == main_~_hj_k~0#1; {1311#false} is VALID [2022-02-21 03:20:48,851 INFO L290 TraceCheckUtils]: 26: Hoare triple {1311#false} assume main_#t~switch19#1;call main_#t~mem27#1 := read~int(main_~_hj_key~0#1.base, 3 + main_~_hj_key~0#1.offset, 1);main_~_hj_i~0#1 := main_~_hj_i~0#1 + 16777216 * (main_#t~mem27#1 % 256);havoc main_#t~mem27#1; {1311#false} is VALID [2022-02-21 03:20:48,851 INFO L290 TraceCheckUtils]: 27: Hoare triple {1311#false} main_#t~switch19#1 := main_#t~switch19#1 || 3 == main_~_hj_k~0#1; {1311#false} is VALID [2022-02-21 03:20:48,851 INFO L290 TraceCheckUtils]: 28: Hoare triple {1311#false} assume main_#t~switch19#1;call main_#t~mem28#1 := read~int(main_~_hj_key~0#1.base, 2 + main_~_hj_key~0#1.offset, 1);main_~_hj_i~0#1 := main_~_hj_i~0#1 + 65536 * (main_#t~mem28#1 % 256);havoc main_#t~mem28#1; {1311#false} is VALID [2022-02-21 03:20:48,863 INFO L290 TraceCheckUtils]: 29: Hoare triple {1311#false} main_#t~switch19#1 := main_#t~switch19#1 || 2 == main_~_hj_k~0#1; {1311#false} is VALID [2022-02-21 03:20:48,864 INFO L290 TraceCheckUtils]: 30: Hoare triple {1311#false} assume main_#t~switch19#1;call main_#t~mem29#1 := read~int(main_~_hj_key~0#1.base, 1 + main_~_hj_key~0#1.offset, 1);main_~_hj_i~0#1 := main_~_hj_i~0#1 + 256 * (main_#t~mem29#1 % 256);havoc main_#t~mem29#1; {1311#false} is VALID [2022-02-21 03:20:48,864 INFO L290 TraceCheckUtils]: 31: Hoare triple {1311#false} main_#t~switch19#1 := main_#t~switch19#1 || 1 == main_~_hj_k~0#1; {1311#false} is VALID [2022-02-21 03:20:48,864 INFO L290 TraceCheckUtils]: 32: Hoare triple {1311#false} assume main_#t~switch19#1;call main_#t~mem30#1 := read~int(main_~_hj_key~0#1.base, main_~_hj_key~0#1.offset, 1);main_~_hj_i~0#1 := main_~_hj_i~0#1 + main_#t~mem30#1 % 256;havoc main_#t~mem30#1; {1311#false} is VALID [2022-02-21 03:20:48,864 INFO L290 TraceCheckUtils]: 33: Hoare triple {1311#false} havoc main_#t~switch19#1; {1311#false} is VALID [2022-02-21 03:20:48,865 INFO L290 TraceCheckUtils]: 34: Hoare triple {1311#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)))); {1311#false} is VALID [2022-02-21 03:20:48,865 INFO L290 TraceCheckUtils]: 35: Hoare triple {1311#false} goto; {1311#false} is VALID [2022-02-21 03:20:48,865 INFO L290 TraceCheckUtils]: 36: Hoare triple {1311#false} goto; {1311#false} is VALID [2022-02-21 03:20:48,865 INFO L290 TraceCheckUtils]: 37: Hoare triple {1311#false} goto; {1311#false} is VALID [2022-02-21 03:20:48,866 INFO L290 TraceCheckUtils]: 38: Hoare triple {1311#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); {1311#false} is VALID [2022-02-21 03:20:48,866 INFO L290 TraceCheckUtils]: 39: Hoare triple {1311#false} assume !(main_~users~0#1.base == 0 && main_~users~0#1.offset == 0);call main_#t~mem48#1.base, main_#t~mem48#1.offset := read~$Pointer$(main_~users~0#1.base, 8 + main_~users~0#1.offset, 4);call write~$Pointer$(main_#t~mem48#1.base, main_#t~mem48#1.offset, main_~user~0#1.base, 8 + main_~user~0#1.offset, 4);havoc main_#t~mem48#1.base, main_#t~mem48#1.offset; {1311#false} is VALID [2022-02-21 03:20:48,866 INFO L290 TraceCheckUtils]: 40: Hoare triple {1311#false} call write~$Pointer$(0, 0, main_~user~0#1.base, 16 + main_~user~0#1.offset, 4);call main_#t~mem49#1.base, main_#t~mem49#1.offset := read~$Pointer$(main_~users~0#1.base, 8 + main_~users~0#1.offset, 4);call main_#t~mem50#1.base, main_#t~mem50#1.offset := read~$Pointer$(main_#t~mem49#1.base, 16 + main_#t~mem49#1.offset, 4);call main_#t~mem51#1.base, main_#t~mem51#1.offset := read~$Pointer$(main_~users~0#1.base, 8 + main_~users~0#1.offset, 4);call main_#t~mem52#1 := read~int(main_#t~mem51#1.base, 20 + main_#t~mem51#1.offset, 4);call write~$Pointer$(main_#t~mem50#1.base, main_#t~mem50#1.offset - main_#t~mem52#1, main_~user~0#1.base, 12 + main_~user~0#1.offset, 4);havoc main_#t~mem49#1.base, main_#t~mem49#1.offset;havoc main_#t~mem50#1.base, main_#t~mem50#1.offset;havoc main_#t~mem51#1.base, main_#t~mem51#1.offset;havoc main_#t~mem52#1;call main_#t~mem53#1.base, main_#t~mem53#1.offset := read~$Pointer$(main_~users~0#1.base, 8 + main_~users~0#1.offset, 4);call main_#t~mem54#1.base, main_#t~mem54#1.offset := read~$Pointer$(main_#t~mem53#1.base, 16 + main_#t~mem53#1.offset, 4);call write~$Pointer$(main_~user~0#1.base, main_~user~0#1.offset, main_#t~mem54#1.base, 8 + main_#t~mem54#1.offset, 4);havoc main_#t~mem53#1.base, main_#t~mem53#1.offset;havoc main_#t~mem54#1.base, main_#t~mem54#1.offset;call main_#t~mem55#1.base, main_#t~mem55#1.offset := read~$Pointer$(main_~users~0#1.base, 8 + main_~users~0#1.offset, 4);call write~$Pointer$(main_~user~0#1.base, 8 + main_~user~0#1.offset, main_#t~mem55#1.base, 16 + main_#t~mem55#1.offset, 4);havoc main_#t~mem55#1.base, main_#t~mem55#1.offset; {1311#false} is VALID [2022-02-21 03:20:48,866 INFO L290 TraceCheckUtils]: 41: Hoare triple {1311#false} goto; {1311#false} is VALID [2022-02-21 03:20:48,866 INFO L290 TraceCheckUtils]: 42: Hoare triple {1311#false} havoc main_~_ha_bkt~0#1;call main_#t~mem56#1.base, main_#t~mem56#1.offset := read~$Pointer$(main_~users~0#1.base, 8 + main_~users~0#1.offset, 4);call main_#t~mem57#1 := read~int(main_#t~mem56#1.base, 12 + main_#t~mem56#1.offset, 4);main_#t~post58#1 := main_#t~mem57#1;call write~int(1 + main_#t~post58#1, main_#t~mem56#1.base, 12 + main_#t~mem56#1.offset, 4);havoc main_#t~mem56#1.base, main_#t~mem56#1.offset;havoc main_#t~mem57#1;havoc main_#t~post58#1; {1311#false} is VALID [2022-02-21 03:20:48,867 INFO L290 TraceCheckUtils]: 43: Hoare triple {1311#false} call main_#t~mem59#1.base, main_#t~mem59#1.offset := read~$Pointer$(main_~users~0#1.base, 8 + main_~users~0#1.offset, 4);call main_#t~mem60#1 := read~int(main_#t~mem59#1.base, 4 + main_#t~mem59#1.offset, 4);main_~_ha_bkt~0#1 := (if 0 == main_~_ha_hashv~0#1 || 0 == main_#t~mem60#1 - 1 then 0 else (if 1 == main_#t~mem60#1 - 1 then (if 1 == main_~_ha_hashv~0#1 || 0 == main_~_ha_hashv~0#1 then main_~_ha_hashv~0#1 else (if main_~_ha_hashv~0#1 >= 0 then main_~_ha_hashv~0#1 % 2 else ~bitwiseAnd(main_~_ha_hashv~0#1, main_#t~mem60#1 - 1))) else (if 1 == main_~_ha_hashv~0#1 then (if 1 == main_#t~mem60#1 - 1 || 0 == main_#t~mem60#1 - 1 then main_#t~mem60#1 - 1 else (if main_#t~mem60#1 - 1 >= 0 then (main_#t~mem60#1 - 1) % 2 else ~bitwiseAnd(main_~_ha_hashv~0#1, main_#t~mem60#1 - 1))) else ~bitwiseAnd(main_~_ha_hashv~0#1, main_#t~mem60#1 - 1))));havoc main_#t~mem59#1.base, main_#t~mem59#1.offset;havoc main_#t~mem60#1; {1311#false} is VALID [2022-02-21 03:20:48,867 INFO L290 TraceCheckUtils]: 44: Hoare triple {1311#false} goto; {1311#false} is VALID [2022-02-21 03:20:48,867 INFO L290 TraceCheckUtils]: 45: Hoare triple {1311#false} call main_#t~mem61#1.base, main_#t~mem61#1.offset := read~$Pointer$(main_~users~0#1.base, 8 + main_~users~0#1.offset, 4);call main_#t~mem62#1.base, main_#t~mem62#1.offset := read~$Pointer$(main_#t~mem61#1.base, main_#t~mem61#1.offset, 4);main_~_ha_head~0#1.base, main_~_ha_head~0#1.offset := main_#t~mem62#1.base, main_#t~mem62#1.offset + 12 * (if main_~_ha_bkt~0#1 % 4294967296 % 4294967296 <= 2147483647 then main_~_ha_bkt~0#1 % 4294967296 % 4294967296 else main_~_ha_bkt~0#1 % 4294967296 % 4294967296 - 4294967296);havoc main_#t~mem61#1.base, main_#t~mem61#1.offset;havoc main_#t~mem62#1.base, main_#t~mem62#1.offset;call main_#t~mem63#1 := read~int(main_~_ha_head~0#1.base, 4 + main_~_ha_head~0#1.offset, 4);main_#t~post64#1 := main_#t~mem63#1;call write~int(1 + main_#t~post64#1, main_~_ha_head~0#1.base, 4 + main_~_ha_head~0#1.offset, 4);havoc main_#t~mem63#1;havoc main_#t~post64#1;call main_#t~mem65#1.base, main_#t~mem65#1.offset := read~$Pointer$(main_~_ha_head~0#1.base, main_~_ha_head~0#1.offset, 4);call write~$Pointer$(main_#t~mem65#1.base, main_#t~mem65#1.offset, main_~user~0#1.base, 24 + main_~user~0#1.offset, 4);havoc main_#t~mem65#1.base, main_#t~mem65#1.offset;call write~$Pointer$(0, 0, main_~user~0#1.base, 20 + main_~user~0#1.offset, 4);call main_#t~mem66#1.base, main_#t~mem66#1.offset := read~$Pointer$(main_~_ha_head~0#1.base, main_~_ha_head~0#1.offset, 4); {1311#false} is VALID [2022-02-21 03:20:48,867 INFO L290 TraceCheckUtils]: 46: Hoare triple {1311#false} assume main_#t~mem66#1.base != 0 || main_#t~mem66#1.offset != 0;havoc main_#t~mem66#1.base, main_#t~mem66#1.offset;call main_#t~mem67#1.base, main_#t~mem67#1.offset := read~$Pointer$(main_~_ha_head~0#1.base, main_~_ha_head~0#1.offset, 4);call write~$Pointer$(main_~user~0#1.base, 8 + main_~user~0#1.offset, main_#t~mem67#1.base, 12 + main_#t~mem67#1.offset, 4);havoc main_#t~mem67#1.base, main_#t~mem67#1.offset; {1311#false} is VALID [2022-02-21 03:20:48,868 INFO L290 TraceCheckUtils]: 47: Hoare triple {1311#false} call write~$Pointer$(main_~user~0#1.base, 8 + main_~user~0#1.offset, main_~_ha_head~0#1.base, main_~_ha_head~0#1.offset, 4);call main_#t~mem69#1 := read~int(main_~_ha_head~0#1.base, 4 + main_~_ha_head~0#1.offset, 4);call main_#t~mem68#1 := read~int(main_~_ha_head~0#1.base, 8 + main_~_ha_head~0#1.offset, 4);main_#t~short72#1 := main_#t~mem69#1 % 4294967296 >= 10 * (1 + main_#t~mem68#1) % 4294967296; {1311#false} is VALID [2022-02-21 03:20:48,868 INFO L290 TraceCheckUtils]: 48: Hoare triple {1311#false} assume main_#t~short72#1;call main_#t~mem70#1.base, main_#t~mem70#1.offset := read~$Pointer$(main_~user~0#1.base, 8 + main_~user~0#1.offset, 4);call main_#t~mem71#1 := read~int(main_#t~mem70#1.base, 36 + main_#t~mem70#1.offset, 4);main_#t~short72#1 := 0 == main_#t~mem71#1 % 4294967296; {1311#false} is VALID [2022-02-21 03:20:48,868 INFO L290 TraceCheckUtils]: 49: Hoare triple {1311#false} assume !main_#t~short72#1;havoc main_#t~mem69#1;havoc main_#t~mem68#1;havoc main_#t~mem70#1.base, main_#t~mem70#1.offset;havoc main_#t~mem71#1;havoc main_#t~short72#1; {1311#false} is VALID [2022-02-21 03:20:48,868 INFO L290 TraceCheckUtils]: 50: Hoare triple {1311#false} goto; {1311#false} is VALID [2022-02-21 03:20:48,868 INFO L290 TraceCheckUtils]: 51: Hoare triple {1311#false} goto; {1311#false} is VALID [2022-02-21 03:20:48,869 INFO L290 TraceCheckUtils]: 52: Hoare triple {1311#false} goto; {1311#false} is VALID [2022-02-21 03:20:48,869 INFO L290 TraceCheckUtils]: 53: Hoare triple {1311#false} goto; {1311#false} is VALID [2022-02-21 03:20:48,869 INFO L290 TraceCheckUtils]: 54: Hoare triple {1311#false} main_#t~post5#1 := main_~i~0#1; {1311#false} is VALID [2022-02-21 03:20:48,869 INFO L290 TraceCheckUtils]: 55: Hoare triple {1311#false} assume !(1 + main_#t~post5#1 <= 2147483647); {1311#false} is VALID [2022-02-21 03:20:48,870 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-21 03:20:48,873 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-21 03:20:48,874 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 03:20:48,874 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [501448062] [2022-02-21 03:20:48,874 WARN L317 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-02-21 03:20:48,874 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [44782772] [2022-02-21 03:20:48,874 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [44782772] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-21 03:20:48,875 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-21 03:20:48,875 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-21 03:20:48,875 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [857898567] [2022-02-21 03:20:48,876 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-21 03:20:48,876 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 18.666666666666668) internal successors, (56), 3 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 56 [2022-02-21 03:20:48,876 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-21 03:20:48,877 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 18.666666666666668) internal successors, (56), 3 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:20:48,970 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 56 edges. 56 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:20:48,971 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-21 03:20:48,971 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 03:20:48,971 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-21 03:20:48,972 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-21 03:20:48,972 INFO L87 Difference]: Start difference. First operand 137 states and 184 transitions. Second operand has 3 states, 3 states have (on average 18.666666666666668) internal successors, (56), 3 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:20:49,450 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:20:49,451 INFO L93 Difference]: Finished difference Result 289 states and 393 transitions. [2022-02-21 03:20:49,451 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-21 03:20:49,451 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 18.666666666666668) internal successors, (56), 3 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 56 [2022-02-21 03:20:49,452 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-21 03:20:49,452 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 18.666666666666668) internal successors, (56), 3 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:20:49,455 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 389 transitions. [2022-02-21 03:20:49,456 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 18.666666666666668) internal successors, (56), 3 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:20:49,459 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 389 transitions. [2022-02-21 03:20:49,459 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 389 transitions. [2022-02-21 03:20:49,754 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 389 edges. 389 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:20:49,756 INFO L225 Difference]: With dead ends: 289 [2022-02-21 03:20:49,757 INFO L226 Difference]: Without dead ends: 158 [2022-02-21 03:20:49,757 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 54 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-21 03:20:49,758 INFO L933 BasicCegarLoop]: 160 mSDtfsCounter, 9 mSDsluCounter, 145 mSDsCounter, 0 mSdLazyCounter, 44 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 305 SdHoareTripleChecker+Invalid, 72 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 44 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-21 03:20:49,758 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [9 Valid, 305 Invalid, 72 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 44 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-21 03:20:49,759 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 158 states. [2022-02-21 03:20:49,765 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 158 to 157. [2022-02-21 03:20:49,765 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 03:20:49,766 INFO L82 GeneralOperation]: Start isEquivalent. First operand 158 states. Second operand has 157 states, 137 states have (on average 1.2992700729927007) internal successors, (178), 151 states have internal predecessors, (178), 13 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (13), 4 states have call predecessors, (13), 13 states have call successors, (13) [2022-02-21 03:20:49,775 INFO L74 IsIncluded]: Start isIncluded. First operand 158 states. Second operand has 157 states, 137 states have (on average 1.2992700729927007) internal successors, (178), 151 states have internal predecessors, (178), 13 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (13), 4 states have call predecessors, (13), 13 states have call successors, (13) [2022-02-21 03:20:49,776 INFO L87 Difference]: Start difference. First operand 158 states. Second operand has 157 states, 137 states have (on average 1.2992700729927007) internal successors, (178), 151 states have internal predecessors, (178), 13 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (13), 4 states have call predecessors, (13), 13 states have call successors, (13) [2022-02-21 03:20:49,780 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:20:49,782 INFO L93 Difference]: Finished difference Result 158 states and 205 transitions. [2022-02-21 03:20:49,782 INFO L276 IsEmpty]: Start isEmpty. Operand 158 states and 205 transitions. [2022-02-21 03:20:49,782 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:20:49,782 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:20:49,783 INFO L74 IsIncluded]: Start isIncluded. First operand has 157 states, 137 states have (on average 1.2992700729927007) internal successors, (178), 151 states have internal predecessors, (178), 13 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (13), 4 states have call predecessors, (13), 13 states have call successors, (13) Second operand 158 states. [2022-02-21 03:20:49,783 INFO L87 Difference]: Start difference. First operand has 157 states, 137 states have (on average 1.2992700729927007) internal successors, (178), 151 states have internal predecessors, (178), 13 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (13), 4 states have call predecessors, (13), 13 states have call successors, (13) Second operand 158 states. [2022-02-21 03:20:49,797 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:20:49,797 INFO L93 Difference]: Finished difference Result 158 states and 205 transitions. [2022-02-21 03:20:49,798 INFO L276 IsEmpty]: Start isEmpty. Operand 158 states and 205 transitions. [2022-02-21 03:20:49,799 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:20:49,801 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:20:49,801 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 03:20:49,801 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 03:20:49,802 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 157 states, 137 states have (on average 1.2992700729927007) internal successors, (178), 151 states have internal predecessors, (178), 13 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (13), 4 states have call predecessors, (13), 13 states have call successors, (13) [2022-02-21 03:20:49,806 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157 states to 157 states and 204 transitions. [2022-02-21 03:20:49,807 INFO L78 Accepts]: Start accepts. Automaton has 157 states and 204 transitions. Word has length 56 [2022-02-21 03:20:49,807 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-21 03:20:49,811 INFO L470 AbstractCegarLoop]: Abstraction has 157 states and 204 transitions. [2022-02-21 03:20:49,811 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 18.666666666666668) internal successors, (56), 3 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:20:49,823 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 204 transitions. [2022-02-21 03:20:49,824 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2022-02-21 03:20:49,824 INFO L506 BasicCegarLoop]: Found error trace [2022-02-21 03:20:49,824 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-21 03:20:49,848 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2022-02-21 03:20:50,049 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-21 03:20:50,050 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2022-02-21 03:20:50,051 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:20:50,051 INFO L85 PathProgramCache]: Analyzing trace with hash -1391411224, now seen corresponding path program 1 times [2022-02-21 03:20:50,051 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:20:50,051 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [557228291] [2022-02-21 03:20:50,051 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:20:50,051 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:20:50,125 ERROR L252 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-02-21 03:20:50,125 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1434222745] [2022-02-21 03:20:50,125 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:20:50,125 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-21 03:20:50,126 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:20:50,143 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-02-21 03:20:50,156 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-02-21 03:20:50,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:20:50,630 INFO L263 TraceCheckSpWp]: Trace formula consists of 1519 conjuncts, 3 conjunts are in the unsatisfiable core [2022-02-21 03:20:50,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:20:50,658 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 03:20:50,760 INFO L290 TraceCheckUtils]: 0: Hoare triple {2340#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(21, 2);~count_int_int~0 := 0; {2340#true} is VALID [2022-02-21 03:20:50,761 INFO L290 TraceCheckUtils]: 1: Hoare triple {2340#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc6#1.base, main_#t~malloc6#1.offset, main_#t~mem8#1, main_#t~mem7#1, main_#t~mem9#1, main_#t~mem10#1, main_#t~mem12#1, main_#t~mem11#1, main_#t~mem13#1, main_#t~mem14#1, main_#t~mem16#1, main_#t~mem15#1, main_#t~mem17#1, main_#t~mem18#1, main_#t~switch19#1, main_#t~mem20#1, main_#t~mem21#1, main_#t~mem22#1, main_#t~mem23#1, main_#t~mem24#1, main_#t~mem25#1, main_#t~mem26#1, main_#t~mem27#1, main_#t~mem28#1, main_#t~mem29#1, main_#t~mem30#1, main_~_hj_i~0#1, main_~_hj_j~0#1, main_~_hj_k~0#1, main_~_hj_key~0#1.base, main_~_hj_key~0#1.offset, main_#t~malloc31#1.base, main_#t~malloc31#1.offset, main_#t~mem32#1.base, main_#t~mem32#1.offset, main_#t~mem33#1.base, main_#t~mem33#1.offset, main_#t~memset~res34#1.base, main_#t~memset~res34#1.offset, main_#t~mem35#1.base, main_#t~mem35#1.offset, main_#t~mem36#1.base, main_#t~mem36#1.offset, main_#t~mem37#1.base, main_#t~mem37#1.offset, main_#t~mem38#1.base, main_#t~mem38#1.offset, main_#t~mem39#1.base, main_#t~mem39#1.offset, main_#t~malloc40#1.base, main_#t~malloc40#1.offset, main_#t~mem41#1.base, main_#t~mem41#1.offset, main_#t~mem42#1.base, main_#t~mem42#1.offset, main_#t~mem43#1.base, main_#t~mem43#1.offset, main_#t~mem44#1.base, main_#t~mem44#1.offset, main_#t~mem45#1.base, main_#t~mem45#1.offset, main_#t~mem46#1.base, main_#t~mem46#1.offset, main_#t~memset~res47#1.base, main_#t~memset~res47#1.offset, main_#t~mem48#1.base, main_#t~mem48#1.offset, main_#t~mem49#1.base, main_#t~mem49#1.offset, main_#t~mem50#1.base, main_#t~mem50#1.offset, main_#t~mem51#1.base, main_#t~mem51#1.offset, main_#t~mem52#1, main_#t~mem53#1.base, main_#t~mem53#1.offset, main_#t~mem54#1.base, main_#t~mem54#1.offset, main_#t~mem55#1.base, main_#t~mem55#1.offset, main_#t~mem56#1.base, main_#t~mem56#1.offset, main_#t~mem57#1, main_#t~post58#1, main_#t~mem59#1.base, main_#t~mem59#1.offset, main_#t~mem60#1, main_#t~mem61#1.base, main_#t~mem61#1.offset, main_#t~mem62#1.base, main_#t~mem62#1.offset, main_#t~mem63#1, main_#t~post64#1, main_#t~mem65#1.base, main_#t~mem65#1.offset, main_#t~mem66#1.base, main_#t~mem66#1.offset, main_#t~mem67#1.base, main_#t~mem67#1.offset, main_#t~mem69#1, main_#t~mem68#1, main_#t~mem70#1.base, main_#t~mem70#1.offset, main_#t~mem71#1, main_#t~short72#1, main_#t~mem73#1.base, main_#t~mem73#1.offset, main_#t~mem74#1, main_#t~malloc75#1.base, main_#t~malloc75#1.offset, main_#t~mem76#1.base, main_#t~mem76#1.offset, main_#t~mem77#1.base, main_#t~mem77#1.offset, main_#t~mem78#1.base, main_#t~mem78#1.offset, main_#t~mem79#1, main_#t~memset~res80#1.base, main_#t~memset~res80#1.offset, main_#t~mem81#1.base, main_#t~mem81#1.offset, main_#t~mem82#1.base, main_#t~mem82#1.offset, main_#t~mem85#1, main_#t~mem83#1.base, main_#t~mem83#1.offset, main_#t~mem84#1, main_#t~mem86#1.base, main_#t~mem86#1.offset, main_#t~mem89#1, main_#t~mem87#1.base, main_#t~mem87#1.offset, main_#t~mem88#1, main_#t~ite90#1, main_#t~mem91#1.base, main_#t~mem91#1.offset, main_#t~mem95#1.base, main_#t~mem95#1.offset, main_#t~mem96#1.base, main_#t~mem96#1.offset, main_#t~mem97#1.base, main_#t~mem97#1.offset, main_#t~mem98#1.base, main_#t~mem98#1.offset, main_#t~mem101#1, main_#t~mem99#1.base, main_#t~mem99#1.offset, main_#t~mem100#1, main_#t~mem102#1.base, main_#t~mem102#1.offset, main_#t~mem103#1, main_#t~pre104#1, main_#t~mem105#1.base, main_#t~mem105#1.offset, main_#t~mem106#1, main_#t~mem107#1.base, main_#t~mem107#1.offset, main_#t~mem108#1, main_#t~post109#1, main_#t~mem113#1, main_#t~mem111#1, main_#t~mem110#1.base, main_#t~mem110#1.offset, main_#t~mem112#1, main_#t~mem114#1, main_#t~post115#1, main_#t~mem116#1.base, main_#t~mem116#1.offset, main_#t~mem117#1.base, main_#t~mem117#1.offset, main_#t~mem118#1.base, main_#t~mem118#1.offset, main_#t~post92#1, main_#t~mem93#1.base, main_#t~mem93#1.offset, main_#t~mem94#1, main_#t~mem119#1.base, main_#t~mem119#1.offset, main_#t~mem120#1.base, main_#t~mem120#1.offset, main_#t~mem121#1.base, main_#t~mem121#1.offset, main_#t~mem122#1, main_#t~mem123#1.base, main_#t~mem123#1.offset, main_#t~mem124#1, main_#t~post125#1, main_#t~mem126#1.base, main_#t~mem126#1.offset, main_#t~mem127#1.base, main_#t~mem127#1.offset, main_#t~mem128#1.base, main_#t~mem128#1.offset, main_#t~mem129#1.base, main_#t~mem129#1.offset, main_#t~mem132#1, main_#t~mem130#1.base, main_#t~mem130#1.offset, main_#t~mem131#1, main_#t~ite135#1, main_#t~mem133#1.base, main_#t~mem133#1.offset, main_#t~mem134#1, main_#t~mem136#1.base, main_#t~mem136#1.offset, main_#t~mem137#1, main_#t~mem138#1.base, main_#t~mem138#1.offset, main_~_he_bkt~0#1, main_~_he_bkt_i~0#1, main_~_he_thh~0#1.base, main_~_he_thh~0#1.offset, main_~_he_hh_nxt~0#1.base, main_~_he_hh_nxt~0#1.offset, main_~#_he_new_buckets~0#1.base, main_~#_he_new_buckets~0#1.offset, main_~_he_newbkt~0#1.base, main_~_he_newbkt~0#1.offset, main_~_ha_head~0#1.base, main_~_ha_head~0#1.offset, main_~_ha_bkt~0#1, main_~_ha_hashv~0#1, main_#t~post5#1, main_#t~mem140#1, main_#t~mem141#1, main_#t~mem139#1.base, main_#t~mem139#1.offset, main_#t~ite143#1.base, main_#t~ite143#1.offset, main_#t~mem142#1.base, main_#t~mem142#1.offset, main_#t~mem146#1.base, main_#t~mem146#1.offset, main_#t~mem147#1.base, main_#t~mem147#1.offset, main_#t~short148#1, main_#t~mem149#1.base, main_#t~mem149#1.offset, main_#t~mem150#1.base, main_#t~mem150#1.offset, main_#t~mem151#1.base, main_#t~mem151#1.offset, main_#t~mem152#1.base, main_#t~mem152#1.offset, main_#t~mem153#1.base, main_#t~mem153#1.offset, main_#t~mem154#1.base, main_#t~mem154#1.offset, main_#t~mem155#1.base, main_#t~mem155#1.offset, main_#t~mem156#1.base, main_#t~mem156#1.offset, main_#t~mem157#1, main_#t~mem158#1.base, main_#t~mem158#1.offset, main_#t~mem159#1.base, main_#t~mem159#1.offset, main_#t~mem160#1.base, main_#t~mem160#1.offset, main_#t~mem161#1, main_#t~mem162#1.base, main_#t~mem162#1.offset, main_#t~mem163#1.base, main_#t~mem163#1.offset, main_#t~mem164#1.base, main_#t~mem164#1.offset, main_#t~mem165#1.base, main_#t~mem165#1.offset, main_#t~mem166#1.base, main_#t~mem166#1.offset, main_#t~mem167#1, main_#t~mem168#1.base, main_#t~mem168#1.offset, main_#t~mem171#1, main_#t~mem169#1.base, main_#t~mem169#1.offset, main_#t~mem170#1, main_#t~mem172#1.base, main_#t~mem172#1.offset, main_#t~mem173#1.base, main_#t~mem173#1.offset, main_#t~mem174#1, main_#t~post175#1, 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.base, main_#t~mem181#1.offset, main_#t~mem182#1.base, main_#t~mem182#1.offset, main_#t~mem183#1.base, main_#t~mem183#1.offset, main_~_hd_head~0#1.base, main_~_hd_head~0#1.offset, main_#t~mem184#1.base, main_#t~mem184#1.offset, main_#t~mem185#1, main_#t~post186#1, main_~_hd_bkt~0#1, main_~_hd_hh_del~0#1.base, main_~_hd_hh_del~0#1.offset, main_#t~ite145#1.base, main_#t~ite145#1.offset, main_#t~mem144#1.base, main_#t~mem144#1.offset, main_~i~0#1, main_~user~0#1.base, main_~user~0#1.offset, main_~users~0#1.base, main_~users~0#1.offset, main_~temp~0#1.base, main_~temp~0#1.offset;havoc main_~i~0#1;havoc main_~user~0#1.base, main_~user~0#1.offset;main_~users~0#1.base, main_~users~0#1.offset := 0, 0;main_~i~0#1 := 0; {2340#true} is VALID [2022-02-21 03:20:50,761 INFO L290 TraceCheckUtils]: 2: Hoare triple {2340#true} assume !!(main_~i~0#1 < 10);call main_#t~malloc6#1.base, main_#t~malloc6#1.offset := #Ultimate.allocOnHeap(40);main_~user~0#1.base, main_~user~0#1.offset := main_#t~malloc6#1.base, main_#t~malloc6#1.offset;havoc main_#t~malloc6#1.base, main_#t~malloc6#1.offset; {2340#true} is VALID [2022-02-21 03:20:50,761 INFO L290 TraceCheckUtils]: 3: Hoare triple {2340#true} assume !(main_~user~0#1.base == 0 && main_~user~0#1.offset == 0); {2340#true} is VALID [2022-02-21 03:20:50,761 INFO L290 TraceCheckUtils]: 4: Hoare triple {2340#true} call write~int(main_~i~0#1, main_~user~0#1.base, main_~user~0#1.offset, 4); {2340#true} is VALID [2022-02-21 03:20:50,762 INFO L290 TraceCheckUtils]: 5: Hoare triple {2340#true} assume main_~i~0#1 * main_~i~0#1 <= 2147483647; {2340#true} is VALID [2022-02-21 03:20:50,762 INFO L290 TraceCheckUtils]: 6: Hoare triple {2340#true} assume main_~i~0#1 * main_~i~0#1 >= -2147483648;call write~int(main_~i~0#1 * main_~i~0#1, main_~user~0#1.base, 4 + main_~user~0#1.offset, 4); {2340#true} is VALID [2022-02-21 03:20:50,762 INFO L290 TraceCheckUtils]: 7: Hoare triple {2340#true} havoc main_~_ha_hashv~0#1; {2340#true} is VALID [2022-02-21 03:20:50,762 INFO L290 TraceCheckUtils]: 8: Hoare triple {2340#true} goto; {2340#true} is VALID [2022-02-21 03:20:50,763 INFO L290 TraceCheckUtils]: 9: Hoare triple {2340#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; {2372#(<= |ULTIMATE.start_main_~_hj_k~0#1| 4)} is VALID [2022-02-21 03:20:50,763 INFO L290 TraceCheckUtils]: 10: Hoare triple {2372#(<= |ULTIMATE.start_main_~_hj_k~0#1| 4)} assume !(main_~_hj_k~0#1 % 4294967296 >= 12); {2372#(<= |ULTIMATE.start_main_~_hj_k~0#1| 4)} is VALID [2022-02-21 03:20:50,763 INFO L290 TraceCheckUtils]: 11: Hoare triple {2372#(<= |ULTIMATE.start_main_~_hj_k~0#1| 4)} main_~_ha_hashv~0#1 := 4 + main_~_ha_hashv~0#1;main_#t~switch19#1 := 11 == main_~_hj_k~0#1; {2379#(not |ULTIMATE.start_main_#t~switch19#1|)} is VALID [2022-02-21 03:20:50,764 INFO L290 TraceCheckUtils]: 12: Hoare triple {2379#(not |ULTIMATE.start_main_#t~switch19#1|)} assume main_#t~switch19#1;call main_#t~mem20#1 := read~int(main_~_hj_key~0#1.base, 10 + main_~_hj_key~0#1.offset, 1);main_~_ha_hashv~0#1 := main_~_ha_hashv~0#1 + 16777216 * (main_#t~mem20#1 % 256);havoc main_#t~mem20#1; {2341#false} is VALID [2022-02-21 03:20:50,764 INFO L290 TraceCheckUtils]: 13: Hoare triple {2341#false} main_#t~switch19#1 := main_#t~switch19#1 || 10 == main_~_hj_k~0#1; {2341#false} is VALID [2022-02-21 03:20:50,764 INFO L290 TraceCheckUtils]: 14: Hoare triple {2341#false} assume main_#t~switch19#1;call main_#t~mem21#1 := read~int(main_~_hj_key~0#1.base, 9 + main_~_hj_key~0#1.offset, 1);main_~_ha_hashv~0#1 := main_~_ha_hashv~0#1 + 65536 * (main_#t~mem21#1 % 256);havoc main_#t~mem21#1; {2341#false} is VALID [2022-02-21 03:20:50,764 INFO L290 TraceCheckUtils]: 15: Hoare triple {2341#false} main_#t~switch19#1 := main_#t~switch19#1 || 9 == main_~_hj_k~0#1; {2341#false} is VALID [2022-02-21 03:20:50,765 INFO L290 TraceCheckUtils]: 16: Hoare triple {2341#false} assume main_#t~switch19#1;call main_#t~mem22#1 := read~int(main_~_hj_key~0#1.base, 8 + main_~_hj_key~0#1.offset, 1);main_~_ha_hashv~0#1 := main_~_ha_hashv~0#1 + 256 * (main_#t~mem22#1 % 256);havoc main_#t~mem22#1; {2341#false} is VALID [2022-02-21 03:20:50,765 INFO L290 TraceCheckUtils]: 17: Hoare triple {2341#false} main_#t~switch19#1 := main_#t~switch19#1 || 8 == main_~_hj_k~0#1; {2341#false} is VALID [2022-02-21 03:20:50,765 INFO L290 TraceCheckUtils]: 18: Hoare triple {2341#false} assume main_#t~switch19#1;call main_#t~mem23#1 := read~int(main_~_hj_key~0#1.base, 7 + main_~_hj_key~0#1.offset, 1);main_~_hj_j~0#1 := main_~_hj_j~0#1 + 16777216 * (main_#t~mem23#1 % 256);havoc main_#t~mem23#1; {2341#false} is VALID [2022-02-21 03:20:50,765 INFO L290 TraceCheckUtils]: 19: Hoare triple {2341#false} main_#t~switch19#1 := main_#t~switch19#1 || 7 == main_~_hj_k~0#1; {2341#false} is VALID [2022-02-21 03:20:50,765 INFO L290 TraceCheckUtils]: 20: Hoare triple {2341#false} assume main_#t~switch19#1;call main_#t~mem24#1 := read~int(main_~_hj_key~0#1.base, 6 + main_~_hj_key~0#1.offset, 1);main_~_hj_j~0#1 := main_~_hj_j~0#1 + 65536 * (main_#t~mem24#1 % 256);havoc main_#t~mem24#1; {2341#false} is VALID [2022-02-21 03:20:50,765 INFO L290 TraceCheckUtils]: 21: Hoare triple {2341#false} main_#t~switch19#1 := main_#t~switch19#1 || 6 == main_~_hj_k~0#1; {2341#false} is VALID [2022-02-21 03:20:50,765 INFO L290 TraceCheckUtils]: 22: Hoare triple {2341#false} assume main_#t~switch19#1;call main_#t~mem25#1 := read~int(main_~_hj_key~0#1.base, 5 + main_~_hj_key~0#1.offset, 1);main_~_hj_j~0#1 := main_~_hj_j~0#1 + 256 * (main_#t~mem25#1 % 256);havoc main_#t~mem25#1; {2341#false} is VALID [2022-02-21 03:20:50,766 INFO L290 TraceCheckUtils]: 23: Hoare triple {2341#false} main_#t~switch19#1 := main_#t~switch19#1 || 5 == main_~_hj_k~0#1; {2341#false} is VALID [2022-02-21 03:20:50,766 INFO L290 TraceCheckUtils]: 24: Hoare triple {2341#false} assume main_#t~switch19#1;call main_#t~mem26#1 := read~int(main_~_hj_key~0#1.base, 4 + main_~_hj_key~0#1.offset, 1);main_~_hj_j~0#1 := main_~_hj_j~0#1 + main_#t~mem26#1 % 256;havoc main_#t~mem26#1; {2341#false} is VALID [2022-02-21 03:20:50,766 INFO L290 TraceCheckUtils]: 25: Hoare triple {2341#false} main_#t~switch19#1 := main_#t~switch19#1 || 4 == main_~_hj_k~0#1; {2341#false} is VALID [2022-02-21 03:20:50,766 INFO L290 TraceCheckUtils]: 26: Hoare triple {2341#false} assume main_#t~switch19#1;call main_#t~mem27#1 := read~int(main_~_hj_key~0#1.base, 3 + main_~_hj_key~0#1.offset, 1);main_~_hj_i~0#1 := main_~_hj_i~0#1 + 16777216 * (main_#t~mem27#1 % 256);havoc main_#t~mem27#1; {2341#false} is VALID [2022-02-21 03:20:50,766 INFO L290 TraceCheckUtils]: 27: Hoare triple {2341#false} main_#t~switch19#1 := main_#t~switch19#1 || 3 == main_~_hj_k~0#1; {2341#false} is VALID [2022-02-21 03:20:50,767 INFO L290 TraceCheckUtils]: 28: Hoare triple {2341#false} assume main_#t~switch19#1;call main_#t~mem28#1 := read~int(main_~_hj_key~0#1.base, 2 + main_~_hj_key~0#1.offset, 1);main_~_hj_i~0#1 := main_~_hj_i~0#1 + 65536 * (main_#t~mem28#1 % 256);havoc main_#t~mem28#1; {2341#false} is VALID [2022-02-21 03:20:50,767 INFO L290 TraceCheckUtils]: 29: Hoare triple {2341#false} main_#t~switch19#1 := main_#t~switch19#1 || 2 == main_~_hj_k~0#1; {2341#false} is VALID [2022-02-21 03:20:50,767 INFO L290 TraceCheckUtils]: 30: Hoare triple {2341#false} assume main_#t~switch19#1;call main_#t~mem29#1 := read~int(main_~_hj_key~0#1.base, 1 + main_~_hj_key~0#1.offset, 1);main_~_hj_i~0#1 := main_~_hj_i~0#1 + 256 * (main_#t~mem29#1 % 256);havoc main_#t~mem29#1; {2341#false} is VALID [2022-02-21 03:20:50,767 INFO L290 TraceCheckUtils]: 31: Hoare triple {2341#false} main_#t~switch19#1 := main_#t~switch19#1 || 1 == main_~_hj_k~0#1; {2341#false} is VALID [2022-02-21 03:20:50,767 INFO L290 TraceCheckUtils]: 32: Hoare triple {2341#false} assume main_#t~switch19#1;call main_#t~mem30#1 := read~int(main_~_hj_key~0#1.base, main_~_hj_key~0#1.offset, 1);main_~_hj_i~0#1 := main_~_hj_i~0#1 + main_#t~mem30#1 % 256;havoc main_#t~mem30#1; {2341#false} is VALID [2022-02-21 03:20:50,767 INFO L290 TraceCheckUtils]: 33: Hoare triple {2341#false} havoc main_#t~switch19#1; {2341#false} is VALID [2022-02-21 03:20:50,768 INFO L290 TraceCheckUtils]: 34: Hoare triple {2341#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)))); {2341#false} is VALID [2022-02-21 03:20:50,768 INFO L290 TraceCheckUtils]: 35: Hoare triple {2341#false} goto; {2341#false} is VALID [2022-02-21 03:20:50,768 INFO L290 TraceCheckUtils]: 36: Hoare triple {2341#false} goto; {2341#false} is VALID [2022-02-21 03:20:50,768 INFO L290 TraceCheckUtils]: 37: Hoare triple {2341#false} goto; {2341#false} is VALID [2022-02-21 03:20:50,768 INFO L290 TraceCheckUtils]: 38: Hoare triple {2341#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); {2341#false} is VALID [2022-02-21 03:20:50,768 INFO L290 TraceCheckUtils]: 39: Hoare triple {2341#false} assume !(main_~users~0#1.base == 0 && main_~users~0#1.offset == 0);call main_#t~mem48#1.base, main_#t~mem48#1.offset := read~$Pointer$(main_~users~0#1.base, 8 + main_~users~0#1.offset, 4);call write~$Pointer$(main_#t~mem48#1.base, main_#t~mem48#1.offset, main_~user~0#1.base, 8 + main_~user~0#1.offset, 4);havoc main_#t~mem48#1.base, main_#t~mem48#1.offset; {2341#false} is VALID [2022-02-21 03:20:50,769 INFO L290 TraceCheckUtils]: 40: Hoare triple {2341#false} call write~$Pointer$(0, 0, main_~user~0#1.base, 16 + main_~user~0#1.offset, 4);call main_#t~mem49#1.base, main_#t~mem49#1.offset := read~$Pointer$(main_~users~0#1.base, 8 + main_~users~0#1.offset, 4);call main_#t~mem50#1.base, main_#t~mem50#1.offset := read~$Pointer$(main_#t~mem49#1.base, 16 + main_#t~mem49#1.offset, 4);call main_#t~mem51#1.base, main_#t~mem51#1.offset := read~$Pointer$(main_~users~0#1.base, 8 + main_~users~0#1.offset, 4);call main_#t~mem52#1 := read~int(main_#t~mem51#1.base, 20 + main_#t~mem51#1.offset, 4);call write~$Pointer$(main_#t~mem50#1.base, main_#t~mem50#1.offset - main_#t~mem52#1, main_~user~0#1.base, 12 + main_~user~0#1.offset, 4);havoc main_#t~mem49#1.base, main_#t~mem49#1.offset;havoc main_#t~mem50#1.base, main_#t~mem50#1.offset;havoc main_#t~mem51#1.base, main_#t~mem51#1.offset;havoc main_#t~mem52#1;call main_#t~mem53#1.base, main_#t~mem53#1.offset := read~$Pointer$(main_~users~0#1.base, 8 + main_~users~0#1.offset, 4);call main_#t~mem54#1.base, main_#t~mem54#1.offset := read~$Pointer$(main_#t~mem53#1.base, 16 + main_#t~mem53#1.offset, 4);call write~$Pointer$(main_~user~0#1.base, main_~user~0#1.offset, main_#t~mem54#1.base, 8 + main_#t~mem54#1.offset, 4);havoc main_#t~mem53#1.base, main_#t~mem53#1.offset;havoc main_#t~mem54#1.base, main_#t~mem54#1.offset;call main_#t~mem55#1.base, main_#t~mem55#1.offset := read~$Pointer$(main_~users~0#1.base, 8 + main_~users~0#1.offset, 4);call write~$Pointer$(main_~user~0#1.base, 8 + main_~user~0#1.offset, main_#t~mem55#1.base, 16 + main_#t~mem55#1.offset, 4);havoc main_#t~mem55#1.base, main_#t~mem55#1.offset; {2341#false} is VALID [2022-02-21 03:20:50,769 INFO L290 TraceCheckUtils]: 41: Hoare triple {2341#false} goto; {2341#false} is VALID [2022-02-21 03:20:50,769 INFO L290 TraceCheckUtils]: 42: Hoare triple {2341#false} havoc main_~_ha_bkt~0#1;call main_#t~mem56#1.base, main_#t~mem56#1.offset := read~$Pointer$(main_~users~0#1.base, 8 + main_~users~0#1.offset, 4);call main_#t~mem57#1 := read~int(main_#t~mem56#1.base, 12 + main_#t~mem56#1.offset, 4);main_#t~post58#1 := main_#t~mem57#1;call write~int(1 + main_#t~post58#1, main_#t~mem56#1.base, 12 + main_#t~mem56#1.offset, 4);havoc main_#t~mem56#1.base, main_#t~mem56#1.offset;havoc main_#t~mem57#1;havoc main_#t~post58#1; {2341#false} is VALID [2022-02-21 03:20:50,769 INFO L290 TraceCheckUtils]: 43: Hoare triple {2341#false} call main_#t~mem59#1.base, main_#t~mem59#1.offset := read~$Pointer$(main_~users~0#1.base, 8 + main_~users~0#1.offset, 4);call main_#t~mem60#1 := read~int(main_#t~mem59#1.base, 4 + main_#t~mem59#1.offset, 4);main_~_ha_bkt~0#1 := (if 0 == main_~_ha_hashv~0#1 || 0 == main_#t~mem60#1 - 1 then 0 else (if 1 == main_#t~mem60#1 - 1 then (if 1 == main_~_ha_hashv~0#1 || 0 == main_~_ha_hashv~0#1 then main_~_ha_hashv~0#1 else (if main_~_ha_hashv~0#1 >= 0 then main_~_ha_hashv~0#1 % 2 else ~bitwiseAnd(main_~_ha_hashv~0#1, main_#t~mem60#1 - 1))) else (if 1 == main_~_ha_hashv~0#1 then (if 1 == main_#t~mem60#1 - 1 || 0 == main_#t~mem60#1 - 1 then main_#t~mem60#1 - 1 else (if main_#t~mem60#1 - 1 >= 0 then (main_#t~mem60#1 - 1) % 2 else ~bitwiseAnd(main_~_ha_hashv~0#1, main_#t~mem60#1 - 1))) else ~bitwiseAnd(main_~_ha_hashv~0#1, main_#t~mem60#1 - 1))));havoc main_#t~mem59#1.base, main_#t~mem59#1.offset;havoc main_#t~mem60#1; {2341#false} is VALID [2022-02-21 03:20:50,769 INFO L290 TraceCheckUtils]: 44: Hoare triple {2341#false} goto; {2341#false} is VALID [2022-02-21 03:20:50,770 INFO L290 TraceCheckUtils]: 45: Hoare triple {2341#false} call main_#t~mem61#1.base, main_#t~mem61#1.offset := read~$Pointer$(main_~users~0#1.base, 8 + main_~users~0#1.offset, 4);call main_#t~mem62#1.base, main_#t~mem62#1.offset := read~$Pointer$(main_#t~mem61#1.base, main_#t~mem61#1.offset, 4);main_~_ha_head~0#1.base, main_~_ha_head~0#1.offset := main_#t~mem62#1.base, main_#t~mem62#1.offset + 12 * (if main_~_ha_bkt~0#1 % 4294967296 % 4294967296 <= 2147483647 then main_~_ha_bkt~0#1 % 4294967296 % 4294967296 else main_~_ha_bkt~0#1 % 4294967296 % 4294967296 - 4294967296);havoc main_#t~mem61#1.base, main_#t~mem61#1.offset;havoc main_#t~mem62#1.base, main_#t~mem62#1.offset;call main_#t~mem63#1 := read~int(main_~_ha_head~0#1.base, 4 + main_~_ha_head~0#1.offset, 4);main_#t~post64#1 := main_#t~mem63#1;call write~int(1 + main_#t~post64#1, main_~_ha_head~0#1.base, 4 + main_~_ha_head~0#1.offset, 4);havoc main_#t~mem63#1;havoc main_#t~post64#1;call main_#t~mem65#1.base, main_#t~mem65#1.offset := read~$Pointer$(main_~_ha_head~0#1.base, main_~_ha_head~0#1.offset, 4);call write~$Pointer$(main_#t~mem65#1.base, main_#t~mem65#1.offset, main_~user~0#1.base, 24 + main_~user~0#1.offset, 4);havoc main_#t~mem65#1.base, main_#t~mem65#1.offset;call write~$Pointer$(0, 0, main_~user~0#1.base, 20 + main_~user~0#1.offset, 4);call main_#t~mem66#1.base, main_#t~mem66#1.offset := read~$Pointer$(main_~_ha_head~0#1.base, main_~_ha_head~0#1.offset, 4); {2341#false} is VALID [2022-02-21 03:20:50,770 INFO L290 TraceCheckUtils]: 46: Hoare triple {2341#false} assume main_#t~mem66#1.base != 0 || main_#t~mem66#1.offset != 0;havoc main_#t~mem66#1.base, main_#t~mem66#1.offset;call main_#t~mem67#1.base, main_#t~mem67#1.offset := read~$Pointer$(main_~_ha_head~0#1.base, main_~_ha_head~0#1.offset, 4);call write~$Pointer$(main_~user~0#1.base, 8 + main_~user~0#1.offset, main_#t~mem67#1.base, 12 + main_#t~mem67#1.offset, 4);havoc main_#t~mem67#1.base, main_#t~mem67#1.offset; {2341#false} is VALID [2022-02-21 03:20:50,770 INFO L290 TraceCheckUtils]: 47: Hoare triple {2341#false} call write~$Pointer$(main_~user~0#1.base, 8 + main_~user~0#1.offset, main_~_ha_head~0#1.base, main_~_ha_head~0#1.offset, 4);call main_#t~mem69#1 := read~int(main_~_ha_head~0#1.base, 4 + main_~_ha_head~0#1.offset, 4);call main_#t~mem68#1 := read~int(main_~_ha_head~0#1.base, 8 + main_~_ha_head~0#1.offset, 4);main_#t~short72#1 := main_#t~mem69#1 % 4294967296 >= 10 * (1 + main_#t~mem68#1) % 4294967296; {2341#false} is VALID [2022-02-21 03:20:50,770 INFO L290 TraceCheckUtils]: 48: Hoare triple {2341#false} assume main_#t~short72#1;call main_#t~mem70#1.base, main_#t~mem70#1.offset := read~$Pointer$(main_~user~0#1.base, 8 + main_~user~0#1.offset, 4);call main_#t~mem71#1 := read~int(main_#t~mem70#1.base, 36 + main_#t~mem70#1.offset, 4);main_#t~short72#1 := 0 == main_#t~mem71#1 % 4294967296; {2341#false} is VALID [2022-02-21 03:20:50,770 INFO L290 TraceCheckUtils]: 49: Hoare triple {2341#false} assume !main_#t~short72#1;havoc main_#t~mem69#1;havoc main_#t~mem68#1;havoc main_#t~mem70#1.base, main_#t~mem70#1.offset;havoc main_#t~mem71#1;havoc main_#t~short72#1; {2341#false} is VALID [2022-02-21 03:20:50,770 INFO L290 TraceCheckUtils]: 50: Hoare triple {2341#false} goto; {2341#false} is VALID [2022-02-21 03:20:50,771 INFO L290 TraceCheckUtils]: 51: Hoare triple {2341#false} goto; {2341#false} is VALID [2022-02-21 03:20:50,771 INFO L290 TraceCheckUtils]: 52: Hoare triple {2341#false} goto; {2341#false} is VALID [2022-02-21 03:20:50,771 INFO L290 TraceCheckUtils]: 53: Hoare triple {2341#false} goto; {2341#false} is VALID [2022-02-21 03:20:50,771 INFO L290 TraceCheckUtils]: 54: Hoare triple {2341#false} main_#t~post5#1 := main_~i~0#1; {2341#false} is VALID [2022-02-21 03:20:50,771 INFO L290 TraceCheckUtils]: 55: Hoare triple {2341#false} assume !(1 + main_#t~post5#1 <= 2147483647); {2341#false} is VALID [2022-02-21 03:20:50,772 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-21 03:20:50,772 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-21 03:20:50,772 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 03:20:50,772 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [557228291] [2022-02-21 03:20:50,772 WARN L317 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-02-21 03:20:50,772 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1434222745] [2022-02-21 03:20:50,773 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1434222745] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-21 03:20:50,773 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-21 03:20:50,773 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-02-21 03:20:50,773 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1971973777] [2022-02-21 03:20:50,773 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-21 03:20:50,774 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 14.0) internal successors, (56), 4 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 56 [2022-02-21 03:20:50,774 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-21 03:20:50,774 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 14.0) internal successors, (56), 4 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:20:50,814 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 56 edges. 56 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:20:50,815 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-02-21 03:20:50,815 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 03:20:50,815 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-02-21 03:20:50,815 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-02-21 03:20:50,816 INFO L87 Difference]: Start difference. First operand 157 states and 204 transitions. Second operand has 4 states, 4 states have (on average 14.0) internal successors, (56), 4 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:20:51,241 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:20:51,241 INFO L93 Difference]: Finished difference Result 299 states and 393 transitions. [2022-02-21 03:20:51,241 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-02-21 03:20:51,242 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 14.0) internal successors, (56), 4 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 56 [2022-02-21 03:20:51,242 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-21 03:20:51,242 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 14.0) internal successors, (56), 4 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:20:51,245 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 370 transitions. [2022-02-21 03:20:51,245 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 14.0) internal successors, (56), 4 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:20:51,248 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 370 transitions. [2022-02-21 03:20:51,248 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 370 transitions. [2022-02-21 03:20:51,540 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 370 edges. 370 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:20:51,542 INFO L225 Difference]: With dead ends: 299 [2022-02-21 03:20:51,542 INFO L226 Difference]: Without dead ends: 148 [2022-02-21 03:20:51,543 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 53 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-02-21 03:20:51,543 INFO L933 BasicCegarLoop]: 161 mSDtfsCounter, 135 mSDsluCounter, 178 mSDsCounter, 0 mSdLazyCounter, 42 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 148 SdHoareTripleChecker+Valid, 339 SdHoareTripleChecker+Invalid, 66 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 42 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-21 03:20:51,544 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [148 Valid, 339 Invalid, 66 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 42 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-21 03:20:51,544 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 148 states. [2022-02-21 03:20:51,561 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 148 to 143. [2022-02-21 03:20:51,561 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 03:20:51,562 INFO L82 GeneralOperation]: Start isEquivalent. First operand 148 states. Second operand has 143 states, 123 states have (on average 1.2764227642276422) internal successors, (157), 137 states have internal predecessors, (157), 13 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (13), 4 states have call predecessors, (13), 13 states have call successors, (13) [2022-02-21 03:20:51,562 INFO L74 IsIncluded]: Start isIncluded. First operand 148 states. Second operand has 143 states, 123 states have (on average 1.2764227642276422) internal successors, (157), 137 states have internal predecessors, (157), 13 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (13), 4 states have call predecessors, (13), 13 states have call successors, (13) [2022-02-21 03:20:51,563 INFO L87 Difference]: Start difference. First operand 148 states. Second operand has 143 states, 123 states have (on average 1.2764227642276422) internal successors, (157), 137 states have internal predecessors, (157), 13 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (13), 4 states have call predecessors, (13), 13 states have call successors, (13) [2022-02-21 03:20:51,566 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:20:51,566 INFO L93 Difference]: Finished difference Result 148 states and 188 transitions. [2022-02-21 03:20:51,566 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states and 188 transitions. [2022-02-21 03:20:51,567 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:20:51,567 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:20:51,567 INFO L74 IsIncluded]: Start isIncluded. First operand has 143 states, 123 states have (on average 1.2764227642276422) internal successors, (157), 137 states have internal predecessors, (157), 13 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (13), 4 states have call predecessors, (13), 13 states have call successors, (13) Second operand 148 states. [2022-02-21 03:20:51,568 INFO L87 Difference]: Start difference. First operand has 143 states, 123 states have (on average 1.2764227642276422) internal successors, (157), 137 states have internal predecessors, (157), 13 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (13), 4 states have call predecessors, (13), 13 states have call successors, (13) Second operand 148 states. [2022-02-21 03:20:51,571 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:20:51,571 INFO L93 Difference]: Finished difference Result 148 states and 188 transitions. [2022-02-21 03:20:51,571 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states and 188 transitions. [2022-02-21 03:20:51,571 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:20:51,572 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:20:51,572 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 03:20:51,572 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 03:20:51,572 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 143 states, 123 states have (on average 1.2764227642276422) internal successors, (157), 137 states have internal predecessors, (157), 13 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (13), 4 states have call predecessors, (13), 13 states have call successors, (13) [2022-02-21 03:20:51,575 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143 states to 143 states and 183 transitions. [2022-02-21 03:20:51,575 INFO L78 Accepts]: Start accepts. Automaton has 143 states and 183 transitions. Word has length 56 [2022-02-21 03:20:51,575 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-21 03:20:51,576 INFO L470 AbstractCegarLoop]: Abstraction has 143 states and 183 transitions. [2022-02-21 03:20:51,576 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.0) internal successors, (56), 4 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:20:51,576 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 183 transitions. [2022-02-21 03:20:51,577 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2022-02-21 03:20:51,577 INFO L506 BasicCegarLoop]: Found error trace [2022-02-21 03:20:51,577 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-21 03:20:51,599 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-02-21 03:20:51,796 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable2 [2022-02-21 03:20:51,796 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2022-02-21 03:20:51,797 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:20:51,797 INFO L85 PathProgramCache]: Analyzing trace with hash 632524954, now seen corresponding path program 1 times [2022-02-21 03:20:51,797 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:20:51,798 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1082311970] [2022-02-21 03:20:51,798 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:20:51,798 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:20:51,888 ERROR L252 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-02-21 03:20:51,897 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [755029527] [2022-02-21 03:20:51,898 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:20:51,898 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-21 03:20:51,898 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:20:51,900 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-02-21 03:20:51,935 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-02-21 03:20:52,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:20:52,456 INFO L263 TraceCheckSpWp]: Trace formula consists of 1505 conjuncts, 3 conjunts are in the unsatisfiable core [2022-02-21 03:20:52,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:20:52,484 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 03:20:52,702 INFO L290 TraceCheckUtils]: 0: Hoare triple {3352#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(21, 2);~count_int_int~0 := 0; {3352#true} is VALID [2022-02-21 03:20:52,703 INFO L290 TraceCheckUtils]: 1: Hoare triple {3352#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc6#1.base, main_#t~malloc6#1.offset, main_#t~mem8#1, main_#t~mem7#1, main_#t~mem9#1, main_#t~mem10#1, main_#t~mem12#1, main_#t~mem11#1, main_#t~mem13#1, main_#t~mem14#1, main_#t~mem16#1, main_#t~mem15#1, main_#t~mem17#1, main_#t~mem18#1, main_#t~switch19#1, main_#t~mem20#1, main_#t~mem21#1, main_#t~mem22#1, main_#t~mem23#1, main_#t~mem24#1, main_#t~mem25#1, main_#t~mem26#1, main_#t~mem27#1, main_#t~mem28#1, main_#t~mem29#1, main_#t~mem30#1, main_~_hj_i~0#1, main_~_hj_j~0#1, main_~_hj_k~0#1, main_~_hj_key~0#1.base, main_~_hj_key~0#1.offset, main_#t~malloc31#1.base, main_#t~malloc31#1.offset, main_#t~mem32#1.base, main_#t~mem32#1.offset, main_#t~mem33#1.base, main_#t~mem33#1.offset, main_#t~memset~res34#1.base, main_#t~memset~res34#1.offset, main_#t~mem35#1.base, main_#t~mem35#1.offset, main_#t~mem36#1.base, main_#t~mem36#1.offset, main_#t~mem37#1.base, main_#t~mem37#1.offset, main_#t~mem38#1.base, main_#t~mem38#1.offset, main_#t~mem39#1.base, main_#t~mem39#1.offset, main_#t~malloc40#1.base, main_#t~malloc40#1.offset, main_#t~mem41#1.base, main_#t~mem41#1.offset, main_#t~mem42#1.base, main_#t~mem42#1.offset, main_#t~mem43#1.base, main_#t~mem43#1.offset, main_#t~mem44#1.base, main_#t~mem44#1.offset, main_#t~mem45#1.base, main_#t~mem45#1.offset, main_#t~mem46#1.base, main_#t~mem46#1.offset, main_#t~memset~res47#1.base, main_#t~memset~res47#1.offset, main_#t~mem48#1.base, main_#t~mem48#1.offset, main_#t~mem49#1.base, main_#t~mem49#1.offset, main_#t~mem50#1.base, main_#t~mem50#1.offset, main_#t~mem51#1.base, main_#t~mem51#1.offset, main_#t~mem52#1, main_#t~mem53#1.base, main_#t~mem53#1.offset, main_#t~mem54#1.base, main_#t~mem54#1.offset, main_#t~mem55#1.base, main_#t~mem55#1.offset, main_#t~mem56#1.base, main_#t~mem56#1.offset, main_#t~mem57#1, main_#t~post58#1, main_#t~mem59#1.base, main_#t~mem59#1.offset, main_#t~mem60#1, main_#t~mem61#1.base, main_#t~mem61#1.offset, main_#t~mem62#1.base, main_#t~mem62#1.offset, main_#t~mem63#1, main_#t~post64#1, main_#t~mem65#1.base, main_#t~mem65#1.offset, main_#t~mem66#1.base, main_#t~mem66#1.offset, main_#t~mem67#1.base, main_#t~mem67#1.offset, main_#t~mem69#1, main_#t~mem68#1, main_#t~mem70#1.base, main_#t~mem70#1.offset, main_#t~mem71#1, main_#t~short72#1, main_#t~mem73#1.base, main_#t~mem73#1.offset, main_#t~mem74#1, main_#t~malloc75#1.base, main_#t~malloc75#1.offset, main_#t~mem76#1.base, main_#t~mem76#1.offset, main_#t~mem77#1.base, main_#t~mem77#1.offset, main_#t~mem78#1.base, main_#t~mem78#1.offset, main_#t~mem79#1, main_#t~memset~res80#1.base, main_#t~memset~res80#1.offset, main_#t~mem81#1.base, main_#t~mem81#1.offset, main_#t~mem82#1.base, main_#t~mem82#1.offset, main_#t~mem85#1, main_#t~mem83#1.base, main_#t~mem83#1.offset, main_#t~mem84#1, main_#t~mem86#1.base, main_#t~mem86#1.offset, main_#t~mem89#1, main_#t~mem87#1.base, main_#t~mem87#1.offset, main_#t~mem88#1, main_#t~ite90#1, main_#t~mem91#1.base, main_#t~mem91#1.offset, main_#t~mem95#1.base, main_#t~mem95#1.offset, main_#t~mem96#1.base, main_#t~mem96#1.offset, main_#t~mem97#1.base, main_#t~mem97#1.offset, main_#t~mem98#1.base, main_#t~mem98#1.offset, main_#t~mem101#1, main_#t~mem99#1.base, main_#t~mem99#1.offset, main_#t~mem100#1, main_#t~mem102#1.base, main_#t~mem102#1.offset, main_#t~mem103#1, main_#t~pre104#1, main_#t~mem105#1.base, main_#t~mem105#1.offset, main_#t~mem106#1, main_#t~mem107#1.base, main_#t~mem107#1.offset, main_#t~mem108#1, main_#t~post109#1, main_#t~mem113#1, main_#t~mem111#1, main_#t~mem110#1.base, main_#t~mem110#1.offset, main_#t~mem112#1, main_#t~mem114#1, main_#t~post115#1, main_#t~mem116#1.base, main_#t~mem116#1.offset, main_#t~mem117#1.base, main_#t~mem117#1.offset, main_#t~mem118#1.base, main_#t~mem118#1.offset, main_#t~post92#1, main_#t~mem93#1.base, main_#t~mem93#1.offset, main_#t~mem94#1, main_#t~mem119#1.base, main_#t~mem119#1.offset, main_#t~mem120#1.base, main_#t~mem120#1.offset, main_#t~mem121#1.base, main_#t~mem121#1.offset, main_#t~mem122#1, main_#t~mem123#1.base, main_#t~mem123#1.offset, main_#t~mem124#1, main_#t~post125#1, main_#t~mem126#1.base, main_#t~mem126#1.offset, main_#t~mem127#1.base, main_#t~mem127#1.offset, main_#t~mem128#1.base, main_#t~mem128#1.offset, main_#t~mem129#1.base, main_#t~mem129#1.offset, main_#t~mem132#1, main_#t~mem130#1.base, main_#t~mem130#1.offset, main_#t~mem131#1, main_#t~ite135#1, main_#t~mem133#1.base, main_#t~mem133#1.offset, main_#t~mem134#1, main_#t~mem136#1.base, main_#t~mem136#1.offset, main_#t~mem137#1, main_#t~mem138#1.base, main_#t~mem138#1.offset, main_~_he_bkt~0#1, main_~_he_bkt_i~0#1, main_~_he_thh~0#1.base, main_~_he_thh~0#1.offset, main_~_he_hh_nxt~0#1.base, main_~_he_hh_nxt~0#1.offset, main_~#_he_new_buckets~0#1.base, main_~#_he_new_buckets~0#1.offset, main_~_he_newbkt~0#1.base, main_~_he_newbkt~0#1.offset, main_~_ha_head~0#1.base, main_~_ha_head~0#1.offset, main_~_ha_bkt~0#1, main_~_ha_hashv~0#1, main_#t~post5#1, main_#t~mem140#1, main_#t~mem141#1, main_#t~mem139#1.base, main_#t~mem139#1.offset, main_#t~ite143#1.base, main_#t~ite143#1.offset, main_#t~mem142#1.base, main_#t~mem142#1.offset, main_#t~mem146#1.base, main_#t~mem146#1.offset, main_#t~mem147#1.base, main_#t~mem147#1.offset, main_#t~short148#1, main_#t~mem149#1.base, main_#t~mem149#1.offset, main_#t~mem150#1.base, main_#t~mem150#1.offset, main_#t~mem151#1.base, main_#t~mem151#1.offset, main_#t~mem152#1.base, main_#t~mem152#1.offset, main_#t~mem153#1.base, main_#t~mem153#1.offset, main_#t~mem154#1.base, main_#t~mem154#1.offset, main_#t~mem155#1.base, main_#t~mem155#1.offset, main_#t~mem156#1.base, main_#t~mem156#1.offset, main_#t~mem157#1, main_#t~mem158#1.base, main_#t~mem158#1.offset, main_#t~mem159#1.base, main_#t~mem159#1.offset, main_#t~mem160#1.base, main_#t~mem160#1.offset, main_#t~mem161#1, main_#t~mem162#1.base, main_#t~mem162#1.offset, main_#t~mem163#1.base, main_#t~mem163#1.offset, main_#t~mem164#1.base, main_#t~mem164#1.offset, main_#t~mem165#1.base, main_#t~mem165#1.offset, main_#t~mem166#1.base, main_#t~mem166#1.offset, main_#t~mem167#1, main_#t~mem168#1.base, main_#t~mem168#1.offset, main_#t~mem171#1, main_#t~mem169#1.base, main_#t~mem169#1.offset, main_#t~mem170#1, main_#t~mem172#1.base, main_#t~mem172#1.offset, main_#t~mem173#1.base, main_#t~mem173#1.offset, main_#t~mem174#1, main_#t~post175#1, 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.base, main_#t~mem181#1.offset, main_#t~mem182#1.base, main_#t~mem182#1.offset, main_#t~mem183#1.base, main_#t~mem183#1.offset, main_~_hd_head~0#1.base, main_~_hd_head~0#1.offset, main_#t~mem184#1.base, main_#t~mem184#1.offset, main_#t~mem185#1, main_#t~post186#1, main_~_hd_bkt~0#1, main_~_hd_hh_del~0#1.base, main_~_hd_hh_del~0#1.offset, main_#t~ite145#1.base, main_#t~ite145#1.offset, main_#t~mem144#1.base, main_#t~mem144#1.offset, main_~i~0#1, main_~user~0#1.base, main_~user~0#1.offset, main_~users~0#1.base, main_~users~0#1.offset, main_~temp~0#1.base, main_~temp~0#1.offset;havoc main_~i~0#1;havoc main_~user~0#1.base, main_~user~0#1.offset;main_~users~0#1.base, main_~users~0#1.offset := 0, 0;main_~i~0#1 := 0; {3360#(<= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-21 03:20:52,703 INFO L290 TraceCheckUtils]: 2: Hoare triple {3360#(<= |ULTIMATE.start_main_~i~0#1| 0)} assume !!(main_~i~0#1 < 10);call main_#t~malloc6#1.base, main_#t~malloc6#1.offset := #Ultimate.allocOnHeap(40);main_~user~0#1.base, main_~user~0#1.offset := main_#t~malloc6#1.base, main_#t~malloc6#1.offset;havoc main_#t~malloc6#1.base, main_#t~malloc6#1.offset; {3360#(<= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-21 03:20:52,704 INFO L290 TraceCheckUtils]: 3: Hoare triple {3360#(<= |ULTIMATE.start_main_~i~0#1| 0)} assume !(main_~user~0#1.base == 0 && main_~user~0#1.offset == 0); {3360#(<= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-21 03:20:52,704 INFO L290 TraceCheckUtils]: 4: Hoare triple {3360#(<= |ULTIMATE.start_main_~i~0#1| 0)} call write~int(main_~i~0#1, main_~user~0#1.base, main_~user~0#1.offset, 4); {3360#(<= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-21 03:20:52,704 INFO L290 TraceCheckUtils]: 5: Hoare triple {3360#(<= |ULTIMATE.start_main_~i~0#1| 0)} assume main_~i~0#1 * main_~i~0#1 <= 2147483647; {3360#(<= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-21 03:20:52,705 INFO L290 TraceCheckUtils]: 6: Hoare triple {3360#(<= |ULTIMATE.start_main_~i~0#1| 0)} assume main_~i~0#1 * main_~i~0#1 >= -2147483648;call write~int(main_~i~0#1 * main_~i~0#1, main_~user~0#1.base, 4 + main_~user~0#1.offset, 4); {3360#(<= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-21 03:20:52,705 INFO L290 TraceCheckUtils]: 7: Hoare triple {3360#(<= |ULTIMATE.start_main_~i~0#1| 0)} havoc main_~_ha_hashv~0#1; {3360#(<= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-21 03:20:52,705 INFO L290 TraceCheckUtils]: 8: Hoare triple {3360#(<= |ULTIMATE.start_main_~i~0#1| 0)} goto; {3360#(<= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-21 03:20:52,706 INFO L290 TraceCheckUtils]: 9: Hoare triple {3360#(<= |ULTIMATE.start_main_~i~0#1| 0)} havoc main_~_hj_i~0#1;havoc main_~_hj_j~0#1;havoc main_~_hj_k~0#1;main_~_hj_key~0#1.base, main_~_hj_key~0#1.offset := main_~user~0#1.base, main_~user~0#1.offset;main_~_ha_hashv~0#1 := 4276993775;main_~_hj_j~0#1 := 2654435769;main_~_hj_i~0#1 := main_~_hj_j~0#1;main_~_hj_k~0#1 := 4; {3360#(<= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-21 03:20:52,706 INFO L290 TraceCheckUtils]: 10: Hoare triple {3360#(<= |ULTIMATE.start_main_~i~0#1| 0)} assume !(main_~_hj_k~0#1 % 4294967296 >= 12); {3360#(<= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-21 03:20:52,706 INFO L290 TraceCheckUtils]: 11: Hoare triple {3360#(<= |ULTIMATE.start_main_~i~0#1| 0)} main_~_ha_hashv~0#1 := 4 + main_~_ha_hashv~0#1;main_#t~switch19#1 := 11 == main_~_hj_k~0#1; {3360#(<= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-21 03:20:52,707 INFO L290 TraceCheckUtils]: 12: Hoare triple {3360#(<= |ULTIMATE.start_main_~i~0#1| 0)} assume !main_#t~switch19#1; {3360#(<= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-21 03:20:52,707 INFO L290 TraceCheckUtils]: 13: Hoare triple {3360#(<= |ULTIMATE.start_main_~i~0#1| 0)} main_#t~switch19#1 := main_#t~switch19#1 || 10 == main_~_hj_k~0#1; {3360#(<= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-21 03:20:52,707 INFO L290 TraceCheckUtils]: 14: Hoare triple {3360#(<= |ULTIMATE.start_main_~i~0#1| 0)} assume !main_#t~switch19#1; {3360#(<= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-21 03:20:52,708 INFO L290 TraceCheckUtils]: 15: Hoare triple {3360#(<= |ULTIMATE.start_main_~i~0#1| 0)} main_#t~switch19#1 := main_#t~switch19#1 || 9 == main_~_hj_k~0#1; {3360#(<= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-21 03:20:52,708 INFO L290 TraceCheckUtils]: 16: Hoare triple {3360#(<= |ULTIMATE.start_main_~i~0#1| 0)} assume !main_#t~switch19#1; {3360#(<= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-21 03:20:52,708 INFO L290 TraceCheckUtils]: 17: Hoare triple {3360#(<= |ULTIMATE.start_main_~i~0#1| 0)} main_#t~switch19#1 := main_#t~switch19#1 || 8 == main_~_hj_k~0#1; {3360#(<= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-21 03:20:52,709 INFO L290 TraceCheckUtils]: 18: Hoare triple {3360#(<= |ULTIMATE.start_main_~i~0#1| 0)} assume !main_#t~switch19#1; {3360#(<= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-21 03:20:52,709 INFO L290 TraceCheckUtils]: 19: Hoare triple {3360#(<= |ULTIMATE.start_main_~i~0#1| 0)} main_#t~switch19#1 := main_#t~switch19#1 || 7 == main_~_hj_k~0#1; {3360#(<= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-21 03:20:52,709 INFO L290 TraceCheckUtils]: 20: Hoare triple {3360#(<= |ULTIMATE.start_main_~i~0#1| 0)} assume !main_#t~switch19#1; {3360#(<= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-21 03:20:52,710 INFO L290 TraceCheckUtils]: 21: Hoare triple {3360#(<= |ULTIMATE.start_main_~i~0#1| 0)} main_#t~switch19#1 := main_#t~switch19#1 || 6 == main_~_hj_k~0#1; {3360#(<= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-21 03:20:52,710 INFO L290 TraceCheckUtils]: 22: Hoare triple {3360#(<= |ULTIMATE.start_main_~i~0#1| 0)} assume !main_#t~switch19#1; {3360#(<= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-21 03:20:52,710 INFO L290 TraceCheckUtils]: 23: Hoare triple {3360#(<= |ULTIMATE.start_main_~i~0#1| 0)} main_#t~switch19#1 := main_#t~switch19#1 || 5 == main_~_hj_k~0#1; {3360#(<= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-21 03:20:52,711 INFO L290 TraceCheckUtils]: 24: Hoare triple {3360#(<= |ULTIMATE.start_main_~i~0#1| 0)} assume !main_#t~switch19#1; {3360#(<= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-21 03:20:52,711 INFO L290 TraceCheckUtils]: 25: Hoare triple {3360#(<= |ULTIMATE.start_main_~i~0#1| 0)} main_#t~switch19#1 := main_#t~switch19#1 || 4 == main_~_hj_k~0#1; {3360#(<= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-21 03:20:52,711 INFO L290 TraceCheckUtils]: 26: Hoare triple {3360#(<= |ULTIMATE.start_main_~i~0#1| 0)} assume main_#t~switch19#1;call main_#t~mem27#1 := read~int(main_~_hj_key~0#1.base, 3 + main_~_hj_key~0#1.offset, 1);main_~_hj_i~0#1 := main_~_hj_i~0#1 + 16777216 * (main_#t~mem27#1 % 256);havoc main_#t~mem27#1; {3360#(<= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-21 03:20:52,712 INFO L290 TraceCheckUtils]: 27: Hoare triple {3360#(<= |ULTIMATE.start_main_~i~0#1| 0)} main_#t~switch19#1 := main_#t~switch19#1 || 3 == main_~_hj_k~0#1; {3360#(<= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-21 03:20:52,712 INFO L290 TraceCheckUtils]: 28: Hoare triple {3360#(<= |ULTIMATE.start_main_~i~0#1| 0)} assume main_#t~switch19#1;call main_#t~mem28#1 := read~int(main_~_hj_key~0#1.base, 2 + main_~_hj_key~0#1.offset, 1);main_~_hj_i~0#1 := main_~_hj_i~0#1 + 65536 * (main_#t~mem28#1 % 256);havoc main_#t~mem28#1; {3360#(<= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-21 03:20:52,712 INFO L290 TraceCheckUtils]: 29: Hoare triple {3360#(<= |ULTIMATE.start_main_~i~0#1| 0)} main_#t~switch19#1 := main_#t~switch19#1 || 2 == main_~_hj_k~0#1; {3360#(<= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-21 03:20:52,713 INFO L290 TraceCheckUtils]: 30: Hoare triple {3360#(<= |ULTIMATE.start_main_~i~0#1| 0)} assume main_#t~switch19#1;call main_#t~mem29#1 := read~int(main_~_hj_key~0#1.base, 1 + main_~_hj_key~0#1.offset, 1);main_~_hj_i~0#1 := main_~_hj_i~0#1 + 256 * (main_#t~mem29#1 % 256);havoc main_#t~mem29#1; {3360#(<= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-21 03:20:52,713 INFO L290 TraceCheckUtils]: 31: Hoare triple {3360#(<= |ULTIMATE.start_main_~i~0#1| 0)} main_#t~switch19#1 := main_#t~switch19#1 || 1 == main_~_hj_k~0#1; {3360#(<= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-21 03:20:52,713 INFO L290 TraceCheckUtils]: 32: Hoare triple {3360#(<= |ULTIMATE.start_main_~i~0#1| 0)} assume main_#t~switch19#1;call main_#t~mem30#1 := read~int(main_~_hj_key~0#1.base, main_~_hj_key~0#1.offset, 1);main_~_hj_i~0#1 := main_~_hj_i~0#1 + main_#t~mem30#1 % 256;havoc main_#t~mem30#1; {3360#(<= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-21 03:20:52,714 INFO L290 TraceCheckUtils]: 33: Hoare triple {3360#(<= |ULTIMATE.start_main_~i~0#1| 0)} havoc main_#t~switch19#1; {3360#(<= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-21 03:20:52,714 INFO L290 TraceCheckUtils]: 34: Hoare triple {3360#(<= |ULTIMATE.start_main_~i~0#1| 0)} main_~_hj_i~0#1 := main_~_hj_i~0#1 - main_~_hj_j~0#1;main_~_hj_i~0#1 := main_~_hj_i~0#1 - main_~_ha_hashv~0#1;main_~_hj_i~0#1 := (if (1 == main_~_hj_i~0#1 || 0 == main_~_hj_i~0#1) && (1 == main_~_ha_hashv~0#1 / 8192 || 0 == main_~_ha_hashv~0#1 / 8192) then (if main_~_hj_i~0#1 == main_~_ha_hashv~0#1 / 8192 then 0 else 1) else (if 0 == main_~_hj_i~0#1 then main_~_ha_hashv~0#1 / 8192 else (if 0 == main_~_ha_hashv~0#1 / 8192 then main_~_hj_i~0#1 else ~bitwiseXOr(main_~_hj_i~0#1, main_~_ha_hashv~0#1 / 8192))));main_~_hj_j~0#1 := main_~_hj_j~0#1 - main_~_ha_hashv~0#1;main_~_hj_j~0#1 := main_~_hj_j~0#1 - main_~_hj_i~0#1;main_~_hj_j~0#1 := (if (1 == main_~_hj_j~0#1 || 0 == main_~_hj_j~0#1) && (1 == 256 * main_~_hj_i~0#1 || 0 == 256 * main_~_hj_i~0#1) then (if main_~_hj_j~0#1 == 256 * main_~_hj_i~0#1 then 0 else 1) else (if 0 == main_~_hj_j~0#1 then 256 * main_~_hj_i~0#1 else (if 0 == 256 * main_~_hj_i~0#1 then main_~_hj_j~0#1 else ~bitwiseXOr(main_~_hj_j~0#1, 256 * main_~_hj_i~0#1))));main_~_ha_hashv~0#1 := main_~_ha_hashv~0#1 - main_~_hj_i~0#1;main_~_ha_hashv~0#1 := main_~_ha_hashv~0#1 - main_~_hj_j~0#1;main_~_ha_hashv~0#1 := (if (1 == main_~_ha_hashv~0#1 || 0 == main_~_ha_hashv~0#1) && (1 == main_~_hj_j~0#1 / 8192 || 0 == main_~_hj_j~0#1 / 8192) then (if main_~_ha_hashv~0#1 == main_~_hj_j~0#1 / 8192 then 0 else 1) else (if 0 == main_~_ha_hashv~0#1 then main_~_hj_j~0#1 / 8192 else (if 0 == main_~_hj_j~0#1 / 8192 then main_~_ha_hashv~0#1 else ~bitwiseXOr(main_~_ha_hashv~0#1, main_~_hj_j~0#1 / 8192))));main_~_hj_i~0#1 := main_~_hj_i~0#1 - main_~_hj_j~0#1;main_~_hj_i~0#1 := main_~_hj_i~0#1 - main_~_ha_hashv~0#1;main_~_hj_i~0#1 := (if (1 == main_~_hj_i~0#1 || 0 == main_~_hj_i~0#1) && (1 == main_~_ha_hashv~0#1 / 4096 || 0 == main_~_ha_hashv~0#1 / 4096) then (if main_~_hj_i~0#1 == main_~_ha_hashv~0#1 / 4096 then 0 else 1) else (if 0 == main_~_hj_i~0#1 then main_~_ha_hashv~0#1 / 4096 else (if 0 == main_~_ha_hashv~0#1 / 4096 then main_~_hj_i~0#1 else ~bitwiseXOr(main_~_hj_i~0#1, main_~_ha_hashv~0#1 / 4096))));main_~_hj_j~0#1 := main_~_hj_j~0#1 - main_~_ha_hashv~0#1;main_~_hj_j~0#1 := main_~_hj_j~0#1 - main_~_hj_i~0#1;main_~_hj_j~0#1 := (if (1 == main_~_hj_j~0#1 || 0 == main_~_hj_j~0#1) && (1 == 65536 * main_~_hj_i~0#1 || 0 == 65536 * main_~_hj_i~0#1) then (if main_~_hj_j~0#1 == 65536 * main_~_hj_i~0#1 then 0 else 1) else (if 0 == main_~_hj_j~0#1 then 65536 * main_~_hj_i~0#1 else (if 0 == 65536 * main_~_hj_i~0#1 then main_~_hj_j~0#1 else ~bitwiseXOr(main_~_hj_j~0#1, 65536 * main_~_hj_i~0#1))));main_~_ha_hashv~0#1 := main_~_ha_hashv~0#1 - main_~_hj_i~0#1;main_~_ha_hashv~0#1 := main_~_ha_hashv~0#1 - main_~_hj_j~0#1;main_~_ha_hashv~0#1 := (if (1 == main_~_ha_hashv~0#1 || 0 == main_~_ha_hashv~0#1) && (1 == main_~_hj_j~0#1 / 32 || 0 == main_~_hj_j~0#1 / 32) then (if main_~_ha_hashv~0#1 == main_~_hj_j~0#1 / 32 then 0 else 1) else (if 0 == main_~_ha_hashv~0#1 then main_~_hj_j~0#1 / 32 else (if 0 == main_~_hj_j~0#1 / 32 then main_~_ha_hashv~0#1 else ~bitwiseXOr(main_~_ha_hashv~0#1, main_~_hj_j~0#1 / 32))));main_~_hj_i~0#1 := main_~_hj_i~0#1 - main_~_hj_j~0#1;main_~_hj_i~0#1 := main_~_hj_i~0#1 - main_~_ha_hashv~0#1;main_~_hj_i~0#1 := (if (1 == main_~_hj_i~0#1 || 0 == main_~_hj_i~0#1) && (1 == main_~_ha_hashv~0#1 / 8 || 0 == main_~_ha_hashv~0#1 / 8) then (if main_~_hj_i~0#1 == main_~_ha_hashv~0#1 / 8 then 0 else 1) else (if 0 == main_~_hj_i~0#1 then main_~_ha_hashv~0#1 / 8 else (if 0 == main_~_ha_hashv~0#1 / 8 then main_~_hj_i~0#1 else ~bitwiseXOr(main_~_hj_i~0#1, main_~_ha_hashv~0#1 / 8))));main_~_hj_j~0#1 := main_~_hj_j~0#1 - main_~_ha_hashv~0#1;main_~_hj_j~0#1 := main_~_hj_j~0#1 - main_~_hj_i~0#1;main_~_hj_j~0#1 := (if (1 == main_~_hj_j~0#1 || 0 == main_~_hj_j~0#1) && (1 == 1024 * main_~_hj_i~0#1 || 0 == 1024 * main_~_hj_i~0#1) then (if main_~_hj_j~0#1 == 1024 * main_~_hj_i~0#1 then 0 else 1) else (if 0 == main_~_hj_j~0#1 then 1024 * main_~_hj_i~0#1 else (if 0 == 1024 * main_~_hj_i~0#1 then main_~_hj_j~0#1 else ~bitwiseXOr(main_~_hj_j~0#1, 1024 * main_~_hj_i~0#1))));main_~_ha_hashv~0#1 := main_~_ha_hashv~0#1 - main_~_hj_i~0#1;main_~_ha_hashv~0#1 := main_~_ha_hashv~0#1 - main_~_hj_j~0#1;main_~_ha_hashv~0#1 := (if (1 == main_~_ha_hashv~0#1 || 0 == main_~_ha_hashv~0#1) && (1 == main_~_hj_j~0#1 / 32768 || 0 == main_~_hj_j~0#1 / 32768) then (if main_~_ha_hashv~0#1 == main_~_hj_j~0#1 / 32768 then 0 else 1) else (if 0 == main_~_ha_hashv~0#1 then main_~_hj_j~0#1 / 32768 else (if 0 == main_~_hj_j~0#1 / 32768 then main_~_ha_hashv~0#1 else ~bitwiseXOr(main_~_ha_hashv~0#1, main_~_hj_j~0#1 / 32768)))); {3360#(<= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-21 03:20:52,714 INFO L290 TraceCheckUtils]: 35: Hoare triple {3360#(<= |ULTIMATE.start_main_~i~0#1| 0)} goto; {3360#(<= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-21 03:20:52,715 INFO L290 TraceCheckUtils]: 36: Hoare triple {3360#(<= |ULTIMATE.start_main_~i~0#1| 0)} goto; {3360#(<= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-21 03:20:52,715 INFO L290 TraceCheckUtils]: 37: Hoare triple {3360#(<= |ULTIMATE.start_main_~i~0#1| 0)} goto; {3360#(<= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-21 03:20:52,715 INFO L290 TraceCheckUtils]: 38: Hoare triple {3360#(<= |ULTIMATE.start_main_~i~0#1| 0)} call write~int(main_~_ha_hashv~0#1, main_~user~0#1.base, 36 + main_~user~0#1.offset, 4);call write~$Pointer$(main_~user~0#1.base, main_~user~0#1.offset, main_~user~0#1.base, 28 + main_~user~0#1.offset, 4);call write~int(4, main_~user~0#1.base, 32 + main_~user~0#1.offset, 4); {3360#(<= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-21 03:20:52,715 INFO L290 TraceCheckUtils]: 39: Hoare triple {3360#(<= |ULTIMATE.start_main_~i~0#1| 0)} assume !(main_~users~0#1.base == 0 && main_~users~0#1.offset == 0);call main_#t~mem48#1.base, main_#t~mem48#1.offset := read~$Pointer$(main_~users~0#1.base, 8 + main_~users~0#1.offset, 4);call write~$Pointer$(main_#t~mem48#1.base, main_#t~mem48#1.offset, main_~user~0#1.base, 8 + main_~user~0#1.offset, 4);havoc main_#t~mem48#1.base, main_#t~mem48#1.offset; {3360#(<= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-21 03:20:52,716 INFO L290 TraceCheckUtils]: 40: Hoare triple {3360#(<= |ULTIMATE.start_main_~i~0#1| 0)} call write~$Pointer$(0, 0, main_~user~0#1.base, 16 + main_~user~0#1.offset, 4);call main_#t~mem49#1.base, main_#t~mem49#1.offset := read~$Pointer$(main_~users~0#1.base, 8 + main_~users~0#1.offset, 4);call main_#t~mem50#1.base, main_#t~mem50#1.offset := read~$Pointer$(main_#t~mem49#1.base, 16 + main_#t~mem49#1.offset, 4);call main_#t~mem51#1.base, main_#t~mem51#1.offset := read~$Pointer$(main_~users~0#1.base, 8 + main_~users~0#1.offset, 4);call main_#t~mem52#1 := read~int(main_#t~mem51#1.base, 20 + main_#t~mem51#1.offset, 4);call write~$Pointer$(main_#t~mem50#1.base, main_#t~mem50#1.offset - main_#t~mem52#1, main_~user~0#1.base, 12 + main_~user~0#1.offset, 4);havoc main_#t~mem49#1.base, main_#t~mem49#1.offset;havoc main_#t~mem50#1.base, main_#t~mem50#1.offset;havoc main_#t~mem51#1.base, main_#t~mem51#1.offset;havoc main_#t~mem52#1;call main_#t~mem53#1.base, main_#t~mem53#1.offset := read~$Pointer$(main_~users~0#1.base, 8 + main_~users~0#1.offset, 4);call main_#t~mem54#1.base, main_#t~mem54#1.offset := read~$Pointer$(main_#t~mem53#1.base, 16 + main_#t~mem53#1.offset, 4);call write~$Pointer$(main_~user~0#1.base, main_~user~0#1.offset, main_#t~mem54#1.base, 8 + main_#t~mem54#1.offset, 4);havoc main_#t~mem53#1.base, main_#t~mem53#1.offset;havoc main_#t~mem54#1.base, main_#t~mem54#1.offset;call main_#t~mem55#1.base, main_#t~mem55#1.offset := read~$Pointer$(main_~users~0#1.base, 8 + main_~users~0#1.offset, 4);call write~$Pointer$(main_~user~0#1.base, 8 + main_~user~0#1.offset, main_#t~mem55#1.base, 16 + main_#t~mem55#1.offset, 4);havoc main_#t~mem55#1.base, main_#t~mem55#1.offset; {3360#(<= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-21 03:20:52,716 INFO L290 TraceCheckUtils]: 41: Hoare triple {3360#(<= |ULTIMATE.start_main_~i~0#1| 0)} goto; {3360#(<= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-21 03:20:52,716 INFO L290 TraceCheckUtils]: 42: Hoare triple {3360#(<= |ULTIMATE.start_main_~i~0#1| 0)} havoc main_~_ha_bkt~0#1;call main_#t~mem56#1.base, main_#t~mem56#1.offset := read~$Pointer$(main_~users~0#1.base, 8 + main_~users~0#1.offset, 4);call main_#t~mem57#1 := read~int(main_#t~mem56#1.base, 12 + main_#t~mem56#1.offset, 4);main_#t~post58#1 := main_#t~mem57#1;call write~int(1 + main_#t~post58#1, main_#t~mem56#1.base, 12 + main_#t~mem56#1.offset, 4);havoc main_#t~mem56#1.base, main_#t~mem56#1.offset;havoc main_#t~mem57#1;havoc main_#t~post58#1; {3360#(<= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-21 03:20:52,717 INFO L290 TraceCheckUtils]: 43: Hoare triple {3360#(<= |ULTIMATE.start_main_~i~0#1| 0)} call main_#t~mem59#1.base, main_#t~mem59#1.offset := read~$Pointer$(main_~users~0#1.base, 8 + main_~users~0#1.offset, 4);call main_#t~mem60#1 := read~int(main_#t~mem59#1.base, 4 + main_#t~mem59#1.offset, 4);main_~_ha_bkt~0#1 := (if 0 == main_~_ha_hashv~0#1 || 0 == main_#t~mem60#1 - 1 then 0 else (if 1 == main_#t~mem60#1 - 1 then (if 1 == main_~_ha_hashv~0#1 || 0 == main_~_ha_hashv~0#1 then main_~_ha_hashv~0#1 else (if main_~_ha_hashv~0#1 >= 0 then main_~_ha_hashv~0#1 % 2 else ~bitwiseAnd(main_~_ha_hashv~0#1, main_#t~mem60#1 - 1))) else (if 1 == main_~_ha_hashv~0#1 then (if 1 == main_#t~mem60#1 - 1 || 0 == main_#t~mem60#1 - 1 then main_#t~mem60#1 - 1 else (if main_#t~mem60#1 - 1 >= 0 then (main_#t~mem60#1 - 1) % 2 else ~bitwiseAnd(main_~_ha_hashv~0#1, main_#t~mem60#1 - 1))) else ~bitwiseAnd(main_~_ha_hashv~0#1, main_#t~mem60#1 - 1))));havoc main_#t~mem59#1.base, main_#t~mem59#1.offset;havoc main_#t~mem60#1; {3360#(<= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-21 03:20:52,717 INFO L290 TraceCheckUtils]: 44: Hoare triple {3360#(<= |ULTIMATE.start_main_~i~0#1| 0)} goto; {3360#(<= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-21 03:20:52,717 INFO L290 TraceCheckUtils]: 45: Hoare triple {3360#(<= |ULTIMATE.start_main_~i~0#1| 0)} call main_#t~mem61#1.base, main_#t~mem61#1.offset := read~$Pointer$(main_~users~0#1.base, 8 + main_~users~0#1.offset, 4);call main_#t~mem62#1.base, main_#t~mem62#1.offset := read~$Pointer$(main_#t~mem61#1.base, main_#t~mem61#1.offset, 4);main_~_ha_head~0#1.base, main_~_ha_head~0#1.offset := main_#t~mem62#1.base, main_#t~mem62#1.offset + 12 * (if main_~_ha_bkt~0#1 % 4294967296 % 4294967296 <= 2147483647 then main_~_ha_bkt~0#1 % 4294967296 % 4294967296 else main_~_ha_bkt~0#1 % 4294967296 % 4294967296 - 4294967296);havoc main_#t~mem61#1.base, main_#t~mem61#1.offset;havoc main_#t~mem62#1.base, main_#t~mem62#1.offset;call main_#t~mem63#1 := read~int(main_~_ha_head~0#1.base, 4 + main_~_ha_head~0#1.offset, 4);main_#t~post64#1 := main_#t~mem63#1;call write~int(1 + main_#t~post64#1, main_~_ha_head~0#1.base, 4 + main_~_ha_head~0#1.offset, 4);havoc main_#t~mem63#1;havoc main_#t~post64#1;call main_#t~mem65#1.base, main_#t~mem65#1.offset := read~$Pointer$(main_~_ha_head~0#1.base, main_~_ha_head~0#1.offset, 4);call write~$Pointer$(main_#t~mem65#1.base, main_#t~mem65#1.offset, main_~user~0#1.base, 24 + main_~user~0#1.offset, 4);havoc main_#t~mem65#1.base, main_#t~mem65#1.offset;call write~$Pointer$(0, 0, main_~user~0#1.base, 20 + main_~user~0#1.offset, 4);call main_#t~mem66#1.base, main_#t~mem66#1.offset := read~$Pointer$(main_~_ha_head~0#1.base, main_~_ha_head~0#1.offset, 4); {3360#(<= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-21 03:20:52,718 INFO L290 TraceCheckUtils]: 46: Hoare triple {3360#(<= |ULTIMATE.start_main_~i~0#1| 0)} assume main_#t~mem66#1.base != 0 || main_#t~mem66#1.offset != 0;havoc main_#t~mem66#1.base, main_#t~mem66#1.offset;call main_#t~mem67#1.base, main_#t~mem67#1.offset := read~$Pointer$(main_~_ha_head~0#1.base, main_~_ha_head~0#1.offset, 4);call write~$Pointer$(main_~user~0#1.base, 8 + main_~user~0#1.offset, main_#t~mem67#1.base, 12 + main_#t~mem67#1.offset, 4);havoc main_#t~mem67#1.base, main_#t~mem67#1.offset; {3360#(<= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-21 03:20:52,718 INFO L290 TraceCheckUtils]: 47: Hoare triple {3360#(<= |ULTIMATE.start_main_~i~0#1| 0)} call write~$Pointer$(main_~user~0#1.base, 8 + main_~user~0#1.offset, main_~_ha_head~0#1.base, main_~_ha_head~0#1.offset, 4);call main_#t~mem69#1 := read~int(main_~_ha_head~0#1.base, 4 + main_~_ha_head~0#1.offset, 4);call main_#t~mem68#1 := read~int(main_~_ha_head~0#1.base, 8 + main_~_ha_head~0#1.offset, 4);main_#t~short72#1 := main_#t~mem69#1 % 4294967296 >= 10 * (1 + main_#t~mem68#1) % 4294967296; {3360#(<= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-21 03:20:52,718 INFO L290 TraceCheckUtils]: 48: Hoare triple {3360#(<= |ULTIMATE.start_main_~i~0#1| 0)} assume main_#t~short72#1;call main_#t~mem70#1.base, main_#t~mem70#1.offset := read~$Pointer$(main_~user~0#1.base, 8 + main_~user~0#1.offset, 4);call main_#t~mem71#1 := read~int(main_#t~mem70#1.base, 36 + main_#t~mem70#1.offset, 4);main_#t~short72#1 := 0 == main_#t~mem71#1 % 4294967296; {3360#(<= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-21 03:20:52,718 INFO L290 TraceCheckUtils]: 49: Hoare triple {3360#(<= |ULTIMATE.start_main_~i~0#1| 0)} assume !main_#t~short72#1;havoc main_#t~mem69#1;havoc main_#t~mem68#1;havoc main_#t~mem70#1.base, main_#t~mem70#1.offset;havoc main_#t~mem71#1;havoc main_#t~short72#1; {3360#(<= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-21 03:20:52,719 INFO L290 TraceCheckUtils]: 50: Hoare triple {3360#(<= |ULTIMATE.start_main_~i~0#1| 0)} goto; {3360#(<= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-21 03:20:52,719 INFO L290 TraceCheckUtils]: 51: Hoare triple {3360#(<= |ULTIMATE.start_main_~i~0#1| 0)} goto; {3360#(<= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-21 03:20:52,719 INFO L290 TraceCheckUtils]: 52: Hoare triple {3360#(<= |ULTIMATE.start_main_~i~0#1| 0)} goto; {3360#(<= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-21 03:20:52,720 INFO L290 TraceCheckUtils]: 53: Hoare triple {3360#(<= |ULTIMATE.start_main_~i~0#1| 0)} goto; {3360#(<= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-21 03:20:52,720 INFO L290 TraceCheckUtils]: 54: Hoare triple {3360#(<= |ULTIMATE.start_main_~i~0#1| 0)} main_#t~post5#1 := main_~i~0#1; {3520#(<= |ULTIMATE.start_main_#t~post5#1| 0)} is VALID [2022-02-21 03:20:52,720 INFO L290 TraceCheckUtils]: 55: Hoare triple {3520#(<= |ULTIMATE.start_main_#t~post5#1| 0)} assume !(1 + main_#t~post5#1 <= 2147483647); {3353#false} is VALID [2022-02-21 03:20:52,721 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-21 03:20:52,721 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-21 03:20:52,721 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 03:20:52,721 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1082311970] [2022-02-21 03:20:52,721 WARN L317 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-02-21 03:20:52,721 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [755029527] [2022-02-21 03:20:52,721 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [755029527] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-21 03:20:52,722 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-21 03:20:52,722 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-21 03:20:52,722 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1164521851] [2022-02-21 03:20:52,722 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-21 03:20:52,722 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 18.666666666666668) internal successors, (56), 4 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 56 [2022-02-21 03:20:52,723 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-21 03:20:52,723 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 4 states, 3 states have (on average 18.666666666666668) internal successors, (56), 4 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:20:52,765 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 56 edges. 56 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:20:52,766 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-02-21 03:20:52,766 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 03:20:52,766 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-02-21 03:20:52,766 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-02-21 03:20:52,767 INFO L87 Difference]: Start difference. First operand 143 states and 183 transitions. Second operand has 4 states, 3 states have (on average 18.666666666666668) internal successors, (56), 4 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:20:53,446 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:20:53,447 INFO L93 Difference]: Finished difference Result 238 states and 298 transitions. [2022-02-21 03:20:53,447 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-02-21 03:20:53,447 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 18.666666666666668) internal successors, (56), 4 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 56 [2022-02-21 03:20:53,447 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-21 03:20:53,447 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 3 states have (on average 18.666666666666668) internal successors, (56), 4 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:20:53,450 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 286 transitions. [2022-02-21 03:20:53,450 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 3 states have (on average 18.666666666666668) internal successors, (56), 4 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:20:53,452 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 286 transitions. [2022-02-21 03:20:53,452 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 286 transitions. [2022-02-21 03:20:53,663 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 286 edges. 286 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:20:53,667 INFO L225 Difference]: With dead ends: 238 [2022-02-21 03:20:53,667 INFO L226 Difference]: Without dead ends: 237 [2022-02-21 03:20:53,668 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 53 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-02-21 03:20:53,668 INFO L933 BasicCegarLoop]: 168 mSDtfsCounter, 55 mSDsluCounter, 330 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 58 SdHoareTripleChecker+Valid, 498 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-21 03:20:53,668 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [58 Valid, 498 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-21 03:20:53,669 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 237 states. [2022-02-21 03:20:53,716 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 237 to 235. [2022-02-21 03:20:53,716 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 03:20:53,717 INFO L82 GeneralOperation]: Start isEquivalent. First operand 237 states. Second operand has 235 states, 212 states have (on average 1.240566037735849) internal successors, (263), 226 states have internal predecessors, (263), 16 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 7 states have call predecessors, (16), 16 states have call successors, (16) [2022-02-21 03:20:53,718 INFO L74 IsIncluded]: Start isIncluded. First operand 237 states. Second operand has 235 states, 212 states have (on average 1.240566037735849) internal successors, (263), 226 states have internal predecessors, (263), 16 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 7 states have call predecessors, (16), 16 states have call successors, (16) [2022-02-21 03:20:53,718 INFO L87 Difference]: Start difference. First operand 237 states. Second operand has 235 states, 212 states have (on average 1.240566037735849) internal successors, (263), 226 states have internal predecessors, (263), 16 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 7 states have call predecessors, (16), 16 states have call successors, (16) [2022-02-21 03:20:53,723 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:20:53,723 INFO L93 Difference]: Finished difference Result 237 states and 297 transitions. [2022-02-21 03:20:53,723 INFO L276 IsEmpty]: Start isEmpty. Operand 237 states and 297 transitions. [2022-02-21 03:20:53,724 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:20:53,724 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:20:53,724 INFO L74 IsIncluded]: Start isIncluded. First operand has 235 states, 212 states have (on average 1.240566037735849) internal successors, (263), 226 states have internal predecessors, (263), 16 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 7 states have call predecessors, (16), 16 states have call successors, (16) Second operand 237 states. [2022-02-21 03:20:53,725 INFO L87 Difference]: Start difference. First operand has 235 states, 212 states have (on average 1.240566037735849) internal successors, (263), 226 states have internal predecessors, (263), 16 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 7 states have call predecessors, (16), 16 states have call successors, (16) Second operand 237 states. [2022-02-21 03:20:53,729 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:20:53,730 INFO L93 Difference]: Finished difference Result 237 states and 297 transitions. [2022-02-21 03:20:53,730 INFO L276 IsEmpty]: Start isEmpty. Operand 237 states and 297 transitions. [2022-02-21 03:20:53,730 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:20:53,730 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:20:53,730 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 03:20:53,731 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 03:20:53,731 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 235 states, 212 states have (on average 1.240566037735849) internal successors, (263), 226 states have internal predecessors, (263), 16 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 7 states have call predecessors, (16), 16 states have call successors, (16) [2022-02-21 03:20:53,736 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 235 states to 235 states and 295 transitions. [2022-02-21 03:20:53,736 INFO L78 Accepts]: Start accepts. Automaton has 235 states and 295 transitions. Word has length 56 [2022-02-21 03:20:53,736 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-21 03:20:53,736 INFO L470 AbstractCegarLoop]: Abstraction has 235 states and 295 transitions. [2022-02-21 03:20:53,736 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 18.666666666666668) internal successors, (56), 4 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:20:53,737 INFO L276 IsEmpty]: Start isEmpty. Operand 235 states and 295 transitions. [2022-02-21 03:20:53,737 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2022-02-21 03:20:53,737 INFO L506 BasicCegarLoop]: Found error trace [2022-02-21 03:20:53,737 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-21 03:20:53,759 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-02-21 03:20:53,957 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-21 03:20:53,957 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2022-02-21 03:20:53,958 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:20:53,958 INFO L85 PathProgramCache]: Analyzing trace with hash -1866562491, now seen corresponding path program 1 times [2022-02-21 03:20:53,958 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:20:53,958 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1624419631] [2022-02-21 03:20:53,958 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:20:53,958 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:20:54,038 ERROR L252 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-02-21 03:20:54,039 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1942078773] [2022-02-21 03:20:54,039 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:20:54,039 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-21 03:20:54,039 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:20:54,040 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-02-21 03:20:54,041 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-02-21 03:20:54,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:20:54,744 INFO L263 TraceCheckSpWp]: Trace formula consists of 1506 conjuncts, 3 conjunts are in the unsatisfiable core [2022-02-21 03:20:54,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:20:54,790 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 03:20:55,016 INFO L290 TraceCheckUtils]: 0: Hoare triple {4570#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(21, 2);~count_int_int~0 := 0; {4570#true} is VALID [2022-02-21 03:20:55,018 INFO L290 TraceCheckUtils]: 1: Hoare triple {4570#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc6#1.base, main_#t~malloc6#1.offset, main_#t~mem8#1, main_#t~mem7#1, main_#t~mem9#1, main_#t~mem10#1, main_#t~mem12#1, main_#t~mem11#1, main_#t~mem13#1, main_#t~mem14#1, main_#t~mem16#1, main_#t~mem15#1, main_#t~mem17#1, main_#t~mem18#1, main_#t~switch19#1, main_#t~mem20#1, main_#t~mem21#1, main_#t~mem22#1, main_#t~mem23#1, main_#t~mem24#1, main_#t~mem25#1, main_#t~mem26#1, main_#t~mem27#1, main_#t~mem28#1, main_#t~mem29#1, main_#t~mem30#1, main_~_hj_i~0#1, main_~_hj_j~0#1, main_~_hj_k~0#1, main_~_hj_key~0#1.base, main_~_hj_key~0#1.offset, main_#t~malloc31#1.base, main_#t~malloc31#1.offset, main_#t~mem32#1.base, main_#t~mem32#1.offset, main_#t~mem33#1.base, main_#t~mem33#1.offset, main_#t~memset~res34#1.base, main_#t~memset~res34#1.offset, main_#t~mem35#1.base, main_#t~mem35#1.offset, main_#t~mem36#1.base, main_#t~mem36#1.offset, main_#t~mem37#1.base, main_#t~mem37#1.offset, main_#t~mem38#1.base, main_#t~mem38#1.offset, main_#t~mem39#1.base, main_#t~mem39#1.offset, main_#t~malloc40#1.base, main_#t~malloc40#1.offset, main_#t~mem41#1.base, main_#t~mem41#1.offset, main_#t~mem42#1.base, main_#t~mem42#1.offset, main_#t~mem43#1.base, main_#t~mem43#1.offset, main_#t~mem44#1.base, main_#t~mem44#1.offset, main_#t~mem45#1.base, main_#t~mem45#1.offset, main_#t~mem46#1.base, main_#t~mem46#1.offset, main_#t~memset~res47#1.base, main_#t~memset~res47#1.offset, main_#t~mem48#1.base, main_#t~mem48#1.offset, main_#t~mem49#1.base, main_#t~mem49#1.offset, main_#t~mem50#1.base, main_#t~mem50#1.offset, main_#t~mem51#1.base, main_#t~mem51#1.offset, main_#t~mem52#1, main_#t~mem53#1.base, main_#t~mem53#1.offset, main_#t~mem54#1.base, main_#t~mem54#1.offset, main_#t~mem55#1.base, main_#t~mem55#1.offset, main_#t~mem56#1.base, main_#t~mem56#1.offset, main_#t~mem57#1, main_#t~post58#1, main_#t~mem59#1.base, main_#t~mem59#1.offset, main_#t~mem60#1, main_#t~mem61#1.base, main_#t~mem61#1.offset, main_#t~mem62#1.base, main_#t~mem62#1.offset, main_#t~mem63#1, main_#t~post64#1, main_#t~mem65#1.base, main_#t~mem65#1.offset, main_#t~mem66#1.base, main_#t~mem66#1.offset, main_#t~mem67#1.base, main_#t~mem67#1.offset, main_#t~mem69#1, main_#t~mem68#1, main_#t~mem70#1.base, main_#t~mem70#1.offset, main_#t~mem71#1, main_#t~short72#1, main_#t~mem73#1.base, main_#t~mem73#1.offset, main_#t~mem74#1, main_#t~malloc75#1.base, main_#t~malloc75#1.offset, main_#t~mem76#1.base, main_#t~mem76#1.offset, main_#t~mem77#1.base, main_#t~mem77#1.offset, main_#t~mem78#1.base, main_#t~mem78#1.offset, main_#t~mem79#1, main_#t~memset~res80#1.base, main_#t~memset~res80#1.offset, main_#t~mem81#1.base, main_#t~mem81#1.offset, main_#t~mem82#1.base, main_#t~mem82#1.offset, main_#t~mem85#1, main_#t~mem83#1.base, main_#t~mem83#1.offset, main_#t~mem84#1, main_#t~mem86#1.base, main_#t~mem86#1.offset, main_#t~mem89#1, main_#t~mem87#1.base, main_#t~mem87#1.offset, main_#t~mem88#1, main_#t~ite90#1, main_#t~mem91#1.base, main_#t~mem91#1.offset, main_#t~mem95#1.base, main_#t~mem95#1.offset, main_#t~mem96#1.base, main_#t~mem96#1.offset, main_#t~mem97#1.base, main_#t~mem97#1.offset, main_#t~mem98#1.base, main_#t~mem98#1.offset, main_#t~mem101#1, main_#t~mem99#1.base, main_#t~mem99#1.offset, main_#t~mem100#1, main_#t~mem102#1.base, main_#t~mem102#1.offset, main_#t~mem103#1, main_#t~pre104#1, main_#t~mem105#1.base, main_#t~mem105#1.offset, main_#t~mem106#1, main_#t~mem107#1.base, main_#t~mem107#1.offset, main_#t~mem108#1, main_#t~post109#1, main_#t~mem113#1, main_#t~mem111#1, main_#t~mem110#1.base, main_#t~mem110#1.offset, main_#t~mem112#1, main_#t~mem114#1, main_#t~post115#1, main_#t~mem116#1.base, main_#t~mem116#1.offset, main_#t~mem117#1.base, main_#t~mem117#1.offset, main_#t~mem118#1.base, main_#t~mem118#1.offset, main_#t~post92#1, main_#t~mem93#1.base, main_#t~mem93#1.offset, main_#t~mem94#1, main_#t~mem119#1.base, main_#t~mem119#1.offset, main_#t~mem120#1.base, main_#t~mem120#1.offset, main_#t~mem121#1.base, main_#t~mem121#1.offset, main_#t~mem122#1, main_#t~mem123#1.base, main_#t~mem123#1.offset, main_#t~mem124#1, main_#t~post125#1, main_#t~mem126#1.base, main_#t~mem126#1.offset, main_#t~mem127#1.base, main_#t~mem127#1.offset, main_#t~mem128#1.base, main_#t~mem128#1.offset, main_#t~mem129#1.base, main_#t~mem129#1.offset, main_#t~mem132#1, main_#t~mem130#1.base, main_#t~mem130#1.offset, main_#t~mem131#1, main_#t~ite135#1, main_#t~mem133#1.base, main_#t~mem133#1.offset, main_#t~mem134#1, main_#t~mem136#1.base, main_#t~mem136#1.offset, main_#t~mem137#1, main_#t~mem138#1.base, main_#t~mem138#1.offset, main_~_he_bkt~0#1, main_~_he_bkt_i~0#1, main_~_he_thh~0#1.base, main_~_he_thh~0#1.offset, main_~_he_hh_nxt~0#1.base, main_~_he_hh_nxt~0#1.offset, main_~#_he_new_buckets~0#1.base, main_~#_he_new_buckets~0#1.offset, main_~_he_newbkt~0#1.base, main_~_he_newbkt~0#1.offset, main_~_ha_head~0#1.base, main_~_ha_head~0#1.offset, main_~_ha_bkt~0#1, main_~_ha_hashv~0#1, main_#t~post5#1, main_#t~mem140#1, main_#t~mem141#1, main_#t~mem139#1.base, main_#t~mem139#1.offset, main_#t~ite143#1.base, main_#t~ite143#1.offset, main_#t~mem142#1.base, main_#t~mem142#1.offset, main_#t~mem146#1.base, main_#t~mem146#1.offset, main_#t~mem147#1.base, main_#t~mem147#1.offset, main_#t~short148#1, main_#t~mem149#1.base, main_#t~mem149#1.offset, main_#t~mem150#1.base, main_#t~mem150#1.offset, main_#t~mem151#1.base, main_#t~mem151#1.offset, main_#t~mem152#1.base, main_#t~mem152#1.offset, main_#t~mem153#1.base, main_#t~mem153#1.offset, main_#t~mem154#1.base, main_#t~mem154#1.offset, main_#t~mem155#1.base, main_#t~mem155#1.offset, main_#t~mem156#1.base, main_#t~mem156#1.offset, main_#t~mem157#1, main_#t~mem158#1.base, main_#t~mem158#1.offset, main_#t~mem159#1.base, main_#t~mem159#1.offset, main_#t~mem160#1.base, main_#t~mem160#1.offset, main_#t~mem161#1, main_#t~mem162#1.base, main_#t~mem162#1.offset, main_#t~mem163#1.base, main_#t~mem163#1.offset, main_#t~mem164#1.base, main_#t~mem164#1.offset, main_#t~mem165#1.base, main_#t~mem165#1.offset, main_#t~mem166#1.base, main_#t~mem166#1.offset, main_#t~mem167#1, main_#t~mem168#1.base, main_#t~mem168#1.offset, main_#t~mem171#1, main_#t~mem169#1.base, main_#t~mem169#1.offset, main_#t~mem170#1, main_#t~mem172#1.base, main_#t~mem172#1.offset, main_#t~mem173#1.base, main_#t~mem173#1.offset, main_#t~mem174#1, main_#t~post175#1, 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.base, main_#t~mem181#1.offset, main_#t~mem182#1.base, main_#t~mem182#1.offset, main_#t~mem183#1.base, main_#t~mem183#1.offset, main_~_hd_head~0#1.base, main_~_hd_head~0#1.offset, main_#t~mem184#1.base, main_#t~mem184#1.offset, main_#t~mem185#1, main_#t~post186#1, main_~_hd_bkt~0#1, main_~_hd_hh_del~0#1.base, main_~_hd_hh_del~0#1.offset, main_#t~ite145#1.base, main_#t~ite145#1.offset, main_#t~mem144#1.base, main_#t~mem144#1.offset, main_~i~0#1, main_~user~0#1.base, main_~user~0#1.offset, main_~users~0#1.base, main_~users~0#1.offset, main_~temp~0#1.base, main_~temp~0#1.offset;havoc main_~i~0#1;havoc main_~user~0#1.base, main_~user~0#1.offset;main_~users~0#1.base, main_~users~0#1.offset := 0, 0;main_~i~0#1 := 0; {4578#(<= 0 |ULTIMATE.start_main_~i~0#1|)} is VALID [2022-02-21 03:20:55,019 INFO L290 TraceCheckUtils]: 2: Hoare triple {4578#(<= 0 |ULTIMATE.start_main_~i~0#1|)} assume !!(main_~i~0#1 < 10);call main_#t~malloc6#1.base, main_#t~malloc6#1.offset := #Ultimate.allocOnHeap(40);main_~user~0#1.base, main_~user~0#1.offset := main_#t~malloc6#1.base, main_#t~malloc6#1.offset;havoc main_#t~malloc6#1.base, main_#t~malloc6#1.offset; {4578#(<= 0 |ULTIMATE.start_main_~i~0#1|)} is VALID [2022-02-21 03:20:55,021 INFO L290 TraceCheckUtils]: 3: Hoare triple {4578#(<= 0 |ULTIMATE.start_main_~i~0#1|)} assume !(main_~user~0#1.base == 0 && main_~user~0#1.offset == 0); {4578#(<= 0 |ULTIMATE.start_main_~i~0#1|)} is VALID [2022-02-21 03:20:55,021 INFO L290 TraceCheckUtils]: 4: Hoare triple {4578#(<= 0 |ULTIMATE.start_main_~i~0#1|)} call write~int(main_~i~0#1, main_~user~0#1.base, main_~user~0#1.offset, 4); {4578#(<= 0 |ULTIMATE.start_main_~i~0#1|)} is VALID [2022-02-21 03:20:55,027 INFO L290 TraceCheckUtils]: 5: Hoare triple {4578#(<= 0 |ULTIMATE.start_main_~i~0#1|)} assume main_~i~0#1 * main_~i~0#1 <= 2147483647; {4578#(<= 0 |ULTIMATE.start_main_~i~0#1|)} is VALID [2022-02-21 03:20:55,027 INFO L290 TraceCheckUtils]: 6: Hoare triple {4578#(<= 0 |ULTIMATE.start_main_~i~0#1|)} assume main_~i~0#1 * main_~i~0#1 >= -2147483648;call write~int(main_~i~0#1 * main_~i~0#1, main_~user~0#1.base, 4 + main_~user~0#1.offset, 4); {4578#(<= 0 |ULTIMATE.start_main_~i~0#1|)} is VALID [2022-02-21 03:20:55,027 INFO L290 TraceCheckUtils]: 7: Hoare triple {4578#(<= 0 |ULTIMATE.start_main_~i~0#1|)} havoc main_~_ha_hashv~0#1; {4578#(<= 0 |ULTIMATE.start_main_~i~0#1|)} is VALID [2022-02-21 03:20:55,028 INFO L290 TraceCheckUtils]: 8: Hoare triple {4578#(<= 0 |ULTIMATE.start_main_~i~0#1|)} goto; {4578#(<= 0 |ULTIMATE.start_main_~i~0#1|)} is VALID [2022-02-21 03:20:55,028 INFO L290 TraceCheckUtils]: 9: Hoare triple {4578#(<= 0 |ULTIMATE.start_main_~i~0#1|)} havoc main_~_hj_i~0#1;havoc main_~_hj_j~0#1;havoc main_~_hj_k~0#1;main_~_hj_key~0#1.base, main_~_hj_key~0#1.offset := main_~user~0#1.base, main_~user~0#1.offset;main_~_ha_hashv~0#1 := 4276993775;main_~_hj_j~0#1 := 2654435769;main_~_hj_i~0#1 := main_~_hj_j~0#1;main_~_hj_k~0#1 := 4; {4578#(<= 0 |ULTIMATE.start_main_~i~0#1|)} is VALID [2022-02-21 03:20:55,028 INFO L290 TraceCheckUtils]: 10: Hoare triple {4578#(<= 0 |ULTIMATE.start_main_~i~0#1|)} assume !(main_~_hj_k~0#1 % 4294967296 >= 12); {4578#(<= 0 |ULTIMATE.start_main_~i~0#1|)} is VALID [2022-02-21 03:20:55,029 INFO L290 TraceCheckUtils]: 11: Hoare triple {4578#(<= 0 |ULTIMATE.start_main_~i~0#1|)} main_~_ha_hashv~0#1 := 4 + main_~_ha_hashv~0#1;main_#t~switch19#1 := 11 == main_~_hj_k~0#1; {4578#(<= 0 |ULTIMATE.start_main_~i~0#1|)} is VALID [2022-02-21 03:20:55,029 INFO L290 TraceCheckUtils]: 12: Hoare triple {4578#(<= 0 |ULTIMATE.start_main_~i~0#1|)} assume !main_#t~switch19#1; {4578#(<= 0 |ULTIMATE.start_main_~i~0#1|)} is VALID [2022-02-21 03:20:55,029 INFO L290 TraceCheckUtils]: 13: Hoare triple {4578#(<= 0 |ULTIMATE.start_main_~i~0#1|)} main_#t~switch19#1 := main_#t~switch19#1 || 10 == main_~_hj_k~0#1; {4578#(<= 0 |ULTIMATE.start_main_~i~0#1|)} is VALID [2022-02-21 03:20:55,029 INFO L290 TraceCheckUtils]: 14: Hoare triple {4578#(<= 0 |ULTIMATE.start_main_~i~0#1|)} assume !main_#t~switch19#1; {4578#(<= 0 |ULTIMATE.start_main_~i~0#1|)} is VALID [2022-02-21 03:20:55,030 INFO L290 TraceCheckUtils]: 15: Hoare triple {4578#(<= 0 |ULTIMATE.start_main_~i~0#1|)} main_#t~switch19#1 := main_#t~switch19#1 || 9 == main_~_hj_k~0#1; {4578#(<= 0 |ULTIMATE.start_main_~i~0#1|)} is VALID [2022-02-21 03:20:55,030 INFO L290 TraceCheckUtils]: 16: Hoare triple {4578#(<= 0 |ULTIMATE.start_main_~i~0#1|)} assume !main_#t~switch19#1; {4578#(<= 0 |ULTIMATE.start_main_~i~0#1|)} is VALID [2022-02-21 03:20:55,030 INFO L290 TraceCheckUtils]: 17: Hoare triple {4578#(<= 0 |ULTIMATE.start_main_~i~0#1|)} main_#t~switch19#1 := main_#t~switch19#1 || 8 == main_~_hj_k~0#1; {4578#(<= 0 |ULTIMATE.start_main_~i~0#1|)} is VALID [2022-02-21 03:20:55,031 INFO L290 TraceCheckUtils]: 18: Hoare triple {4578#(<= 0 |ULTIMATE.start_main_~i~0#1|)} assume !main_#t~switch19#1; {4578#(<= 0 |ULTIMATE.start_main_~i~0#1|)} is VALID [2022-02-21 03:20:55,031 INFO L290 TraceCheckUtils]: 19: Hoare triple {4578#(<= 0 |ULTIMATE.start_main_~i~0#1|)} main_#t~switch19#1 := main_#t~switch19#1 || 7 == main_~_hj_k~0#1; {4578#(<= 0 |ULTIMATE.start_main_~i~0#1|)} is VALID [2022-02-21 03:20:55,031 INFO L290 TraceCheckUtils]: 20: Hoare triple {4578#(<= 0 |ULTIMATE.start_main_~i~0#1|)} assume !main_#t~switch19#1; {4578#(<= 0 |ULTIMATE.start_main_~i~0#1|)} is VALID [2022-02-21 03:20:55,031 INFO L290 TraceCheckUtils]: 21: Hoare triple {4578#(<= 0 |ULTIMATE.start_main_~i~0#1|)} main_#t~switch19#1 := main_#t~switch19#1 || 6 == main_~_hj_k~0#1; {4578#(<= 0 |ULTIMATE.start_main_~i~0#1|)} is VALID [2022-02-21 03:20:55,032 INFO L290 TraceCheckUtils]: 22: Hoare triple {4578#(<= 0 |ULTIMATE.start_main_~i~0#1|)} assume !main_#t~switch19#1; {4578#(<= 0 |ULTIMATE.start_main_~i~0#1|)} is VALID [2022-02-21 03:20:55,032 INFO L290 TraceCheckUtils]: 23: Hoare triple {4578#(<= 0 |ULTIMATE.start_main_~i~0#1|)} main_#t~switch19#1 := main_#t~switch19#1 || 5 == main_~_hj_k~0#1; {4578#(<= 0 |ULTIMATE.start_main_~i~0#1|)} is VALID [2022-02-21 03:20:55,032 INFO L290 TraceCheckUtils]: 24: Hoare triple {4578#(<= 0 |ULTIMATE.start_main_~i~0#1|)} assume !main_#t~switch19#1; {4578#(<= 0 |ULTIMATE.start_main_~i~0#1|)} is VALID [2022-02-21 03:20:55,038 INFO L290 TraceCheckUtils]: 25: Hoare triple {4578#(<= 0 |ULTIMATE.start_main_~i~0#1|)} main_#t~switch19#1 := main_#t~switch19#1 || 4 == main_~_hj_k~0#1; {4578#(<= 0 |ULTIMATE.start_main_~i~0#1|)} is VALID [2022-02-21 03:20:55,038 INFO L290 TraceCheckUtils]: 26: Hoare triple {4578#(<= 0 |ULTIMATE.start_main_~i~0#1|)} assume main_#t~switch19#1;call main_#t~mem27#1 := read~int(main_~_hj_key~0#1.base, 3 + main_~_hj_key~0#1.offset, 1);main_~_hj_i~0#1 := main_~_hj_i~0#1 + 16777216 * (main_#t~mem27#1 % 256);havoc main_#t~mem27#1; {4578#(<= 0 |ULTIMATE.start_main_~i~0#1|)} is VALID [2022-02-21 03:20:55,039 INFO L290 TraceCheckUtils]: 27: Hoare triple {4578#(<= 0 |ULTIMATE.start_main_~i~0#1|)} main_#t~switch19#1 := main_#t~switch19#1 || 3 == main_~_hj_k~0#1; {4578#(<= 0 |ULTIMATE.start_main_~i~0#1|)} is VALID [2022-02-21 03:20:55,039 INFO L290 TraceCheckUtils]: 28: Hoare triple {4578#(<= 0 |ULTIMATE.start_main_~i~0#1|)} assume main_#t~switch19#1;call main_#t~mem28#1 := read~int(main_~_hj_key~0#1.base, 2 + main_~_hj_key~0#1.offset, 1);main_~_hj_i~0#1 := main_~_hj_i~0#1 + 65536 * (main_#t~mem28#1 % 256);havoc main_#t~mem28#1; {4578#(<= 0 |ULTIMATE.start_main_~i~0#1|)} is VALID [2022-02-21 03:20:55,043 INFO L290 TraceCheckUtils]: 29: Hoare triple {4578#(<= 0 |ULTIMATE.start_main_~i~0#1|)} main_#t~switch19#1 := main_#t~switch19#1 || 2 == main_~_hj_k~0#1; {4578#(<= 0 |ULTIMATE.start_main_~i~0#1|)} is VALID [2022-02-21 03:20:55,043 INFO L290 TraceCheckUtils]: 30: Hoare triple {4578#(<= 0 |ULTIMATE.start_main_~i~0#1|)} assume main_#t~switch19#1;call main_#t~mem29#1 := read~int(main_~_hj_key~0#1.base, 1 + main_~_hj_key~0#1.offset, 1);main_~_hj_i~0#1 := main_~_hj_i~0#1 + 256 * (main_#t~mem29#1 % 256);havoc main_#t~mem29#1; {4578#(<= 0 |ULTIMATE.start_main_~i~0#1|)} is VALID [2022-02-21 03:20:55,045 INFO L290 TraceCheckUtils]: 31: Hoare triple {4578#(<= 0 |ULTIMATE.start_main_~i~0#1|)} main_#t~switch19#1 := main_#t~switch19#1 || 1 == main_~_hj_k~0#1; {4578#(<= 0 |ULTIMATE.start_main_~i~0#1|)} is VALID [2022-02-21 03:20:55,045 INFO L290 TraceCheckUtils]: 32: Hoare triple {4578#(<= 0 |ULTIMATE.start_main_~i~0#1|)} assume main_#t~switch19#1;call main_#t~mem30#1 := read~int(main_~_hj_key~0#1.base, main_~_hj_key~0#1.offset, 1);main_~_hj_i~0#1 := main_~_hj_i~0#1 + main_#t~mem30#1 % 256;havoc main_#t~mem30#1; {4578#(<= 0 |ULTIMATE.start_main_~i~0#1|)} is VALID [2022-02-21 03:20:55,045 INFO L290 TraceCheckUtils]: 33: Hoare triple {4578#(<= 0 |ULTIMATE.start_main_~i~0#1|)} havoc main_#t~switch19#1; {4578#(<= 0 |ULTIMATE.start_main_~i~0#1|)} is VALID [2022-02-21 03:20:55,046 INFO L290 TraceCheckUtils]: 34: Hoare triple {4578#(<= 0 |ULTIMATE.start_main_~i~0#1|)} main_~_hj_i~0#1 := main_~_hj_i~0#1 - main_~_hj_j~0#1;main_~_hj_i~0#1 := main_~_hj_i~0#1 - main_~_ha_hashv~0#1;main_~_hj_i~0#1 := (if (1 == main_~_hj_i~0#1 || 0 == main_~_hj_i~0#1) && (1 == main_~_ha_hashv~0#1 / 8192 || 0 == main_~_ha_hashv~0#1 / 8192) then (if main_~_hj_i~0#1 == main_~_ha_hashv~0#1 / 8192 then 0 else 1) else (if 0 == main_~_hj_i~0#1 then main_~_ha_hashv~0#1 / 8192 else (if 0 == main_~_ha_hashv~0#1 / 8192 then main_~_hj_i~0#1 else ~bitwiseXOr(main_~_hj_i~0#1, main_~_ha_hashv~0#1 / 8192))));main_~_hj_j~0#1 := main_~_hj_j~0#1 - main_~_ha_hashv~0#1;main_~_hj_j~0#1 := main_~_hj_j~0#1 - main_~_hj_i~0#1;main_~_hj_j~0#1 := (if (1 == main_~_hj_j~0#1 || 0 == main_~_hj_j~0#1) && (1 == 256 * main_~_hj_i~0#1 || 0 == 256 * main_~_hj_i~0#1) then (if main_~_hj_j~0#1 == 256 * main_~_hj_i~0#1 then 0 else 1) else (if 0 == main_~_hj_j~0#1 then 256 * main_~_hj_i~0#1 else (if 0 == 256 * main_~_hj_i~0#1 then main_~_hj_j~0#1 else ~bitwiseXOr(main_~_hj_j~0#1, 256 * main_~_hj_i~0#1))));main_~_ha_hashv~0#1 := main_~_ha_hashv~0#1 - main_~_hj_i~0#1;main_~_ha_hashv~0#1 := main_~_ha_hashv~0#1 - main_~_hj_j~0#1;main_~_ha_hashv~0#1 := (if (1 == main_~_ha_hashv~0#1 || 0 == main_~_ha_hashv~0#1) && (1 == main_~_hj_j~0#1 / 8192 || 0 == main_~_hj_j~0#1 / 8192) then (if main_~_ha_hashv~0#1 == main_~_hj_j~0#1 / 8192 then 0 else 1) else (if 0 == main_~_ha_hashv~0#1 then main_~_hj_j~0#1 / 8192 else (if 0 == main_~_hj_j~0#1 / 8192 then main_~_ha_hashv~0#1 else ~bitwiseXOr(main_~_ha_hashv~0#1, main_~_hj_j~0#1 / 8192))));main_~_hj_i~0#1 := main_~_hj_i~0#1 - main_~_hj_j~0#1;main_~_hj_i~0#1 := main_~_hj_i~0#1 - main_~_ha_hashv~0#1;main_~_hj_i~0#1 := (if (1 == main_~_hj_i~0#1 || 0 == main_~_hj_i~0#1) && (1 == main_~_ha_hashv~0#1 / 4096 || 0 == main_~_ha_hashv~0#1 / 4096) then (if main_~_hj_i~0#1 == main_~_ha_hashv~0#1 / 4096 then 0 else 1) else (if 0 == main_~_hj_i~0#1 then main_~_ha_hashv~0#1 / 4096 else (if 0 == main_~_ha_hashv~0#1 / 4096 then main_~_hj_i~0#1 else ~bitwiseXOr(main_~_hj_i~0#1, main_~_ha_hashv~0#1 / 4096))));main_~_hj_j~0#1 := main_~_hj_j~0#1 - main_~_ha_hashv~0#1;main_~_hj_j~0#1 := main_~_hj_j~0#1 - main_~_hj_i~0#1;main_~_hj_j~0#1 := (if (1 == main_~_hj_j~0#1 || 0 == main_~_hj_j~0#1) && (1 == 65536 * main_~_hj_i~0#1 || 0 == 65536 * main_~_hj_i~0#1) then (if main_~_hj_j~0#1 == 65536 * main_~_hj_i~0#1 then 0 else 1) else (if 0 == main_~_hj_j~0#1 then 65536 * main_~_hj_i~0#1 else (if 0 == 65536 * main_~_hj_i~0#1 then main_~_hj_j~0#1 else ~bitwiseXOr(main_~_hj_j~0#1, 65536 * main_~_hj_i~0#1))));main_~_ha_hashv~0#1 := main_~_ha_hashv~0#1 - main_~_hj_i~0#1;main_~_ha_hashv~0#1 := main_~_ha_hashv~0#1 - main_~_hj_j~0#1;main_~_ha_hashv~0#1 := (if (1 == main_~_ha_hashv~0#1 || 0 == main_~_ha_hashv~0#1) && (1 == main_~_hj_j~0#1 / 32 || 0 == main_~_hj_j~0#1 / 32) then (if main_~_ha_hashv~0#1 == main_~_hj_j~0#1 / 32 then 0 else 1) else (if 0 == main_~_ha_hashv~0#1 then main_~_hj_j~0#1 / 32 else (if 0 == main_~_hj_j~0#1 / 32 then main_~_ha_hashv~0#1 else ~bitwiseXOr(main_~_ha_hashv~0#1, main_~_hj_j~0#1 / 32))));main_~_hj_i~0#1 := main_~_hj_i~0#1 - main_~_hj_j~0#1;main_~_hj_i~0#1 := main_~_hj_i~0#1 - main_~_ha_hashv~0#1;main_~_hj_i~0#1 := (if (1 == main_~_hj_i~0#1 || 0 == main_~_hj_i~0#1) && (1 == main_~_ha_hashv~0#1 / 8 || 0 == main_~_ha_hashv~0#1 / 8) then (if main_~_hj_i~0#1 == main_~_ha_hashv~0#1 / 8 then 0 else 1) else (if 0 == main_~_hj_i~0#1 then main_~_ha_hashv~0#1 / 8 else (if 0 == main_~_ha_hashv~0#1 / 8 then main_~_hj_i~0#1 else ~bitwiseXOr(main_~_hj_i~0#1, main_~_ha_hashv~0#1 / 8))));main_~_hj_j~0#1 := main_~_hj_j~0#1 - main_~_ha_hashv~0#1;main_~_hj_j~0#1 := main_~_hj_j~0#1 - main_~_hj_i~0#1;main_~_hj_j~0#1 := (if (1 == main_~_hj_j~0#1 || 0 == main_~_hj_j~0#1) && (1 == 1024 * main_~_hj_i~0#1 || 0 == 1024 * main_~_hj_i~0#1) then (if main_~_hj_j~0#1 == 1024 * main_~_hj_i~0#1 then 0 else 1) else (if 0 == main_~_hj_j~0#1 then 1024 * main_~_hj_i~0#1 else (if 0 == 1024 * main_~_hj_i~0#1 then main_~_hj_j~0#1 else ~bitwiseXOr(main_~_hj_j~0#1, 1024 * main_~_hj_i~0#1))));main_~_ha_hashv~0#1 := main_~_ha_hashv~0#1 - main_~_hj_i~0#1;main_~_ha_hashv~0#1 := main_~_ha_hashv~0#1 - main_~_hj_j~0#1;main_~_ha_hashv~0#1 := (if (1 == main_~_ha_hashv~0#1 || 0 == main_~_ha_hashv~0#1) && (1 == main_~_hj_j~0#1 / 32768 || 0 == main_~_hj_j~0#1 / 32768) then (if main_~_ha_hashv~0#1 == main_~_hj_j~0#1 / 32768 then 0 else 1) else (if 0 == main_~_ha_hashv~0#1 then main_~_hj_j~0#1 / 32768 else (if 0 == main_~_hj_j~0#1 / 32768 then main_~_ha_hashv~0#1 else ~bitwiseXOr(main_~_ha_hashv~0#1, main_~_hj_j~0#1 / 32768)))); {4578#(<= 0 |ULTIMATE.start_main_~i~0#1|)} is VALID [2022-02-21 03:20:55,046 INFO L290 TraceCheckUtils]: 35: Hoare triple {4578#(<= 0 |ULTIMATE.start_main_~i~0#1|)} goto; {4578#(<= 0 |ULTIMATE.start_main_~i~0#1|)} is VALID [2022-02-21 03:20:55,046 INFO L290 TraceCheckUtils]: 36: Hoare triple {4578#(<= 0 |ULTIMATE.start_main_~i~0#1|)} goto; {4578#(<= 0 |ULTIMATE.start_main_~i~0#1|)} is VALID [2022-02-21 03:20:55,047 INFO L290 TraceCheckUtils]: 37: Hoare triple {4578#(<= 0 |ULTIMATE.start_main_~i~0#1|)} goto; {4578#(<= 0 |ULTIMATE.start_main_~i~0#1|)} is VALID [2022-02-21 03:20:55,047 INFO L290 TraceCheckUtils]: 38: Hoare triple {4578#(<= 0 |ULTIMATE.start_main_~i~0#1|)} call write~int(main_~_ha_hashv~0#1, main_~user~0#1.base, 36 + main_~user~0#1.offset, 4);call write~$Pointer$(main_~user~0#1.base, main_~user~0#1.offset, main_~user~0#1.base, 28 + main_~user~0#1.offset, 4);call write~int(4, main_~user~0#1.base, 32 + main_~user~0#1.offset, 4); {4578#(<= 0 |ULTIMATE.start_main_~i~0#1|)} is VALID [2022-02-21 03:20:55,047 INFO L290 TraceCheckUtils]: 39: Hoare triple {4578#(<= 0 |ULTIMATE.start_main_~i~0#1|)} assume !(main_~users~0#1.base == 0 && main_~users~0#1.offset == 0);call main_#t~mem48#1.base, main_#t~mem48#1.offset := read~$Pointer$(main_~users~0#1.base, 8 + main_~users~0#1.offset, 4);call write~$Pointer$(main_#t~mem48#1.base, main_#t~mem48#1.offset, main_~user~0#1.base, 8 + main_~user~0#1.offset, 4);havoc main_#t~mem48#1.base, main_#t~mem48#1.offset; {4578#(<= 0 |ULTIMATE.start_main_~i~0#1|)} is VALID [2022-02-21 03:20:55,047 INFO L290 TraceCheckUtils]: 40: Hoare triple {4578#(<= 0 |ULTIMATE.start_main_~i~0#1|)} call write~$Pointer$(0, 0, main_~user~0#1.base, 16 + main_~user~0#1.offset, 4);call main_#t~mem49#1.base, main_#t~mem49#1.offset := read~$Pointer$(main_~users~0#1.base, 8 + main_~users~0#1.offset, 4);call main_#t~mem50#1.base, main_#t~mem50#1.offset := read~$Pointer$(main_#t~mem49#1.base, 16 + main_#t~mem49#1.offset, 4);call main_#t~mem51#1.base, main_#t~mem51#1.offset := read~$Pointer$(main_~users~0#1.base, 8 + main_~users~0#1.offset, 4);call main_#t~mem52#1 := read~int(main_#t~mem51#1.base, 20 + main_#t~mem51#1.offset, 4);call write~$Pointer$(main_#t~mem50#1.base, main_#t~mem50#1.offset - main_#t~mem52#1, main_~user~0#1.base, 12 + main_~user~0#1.offset, 4);havoc main_#t~mem49#1.base, main_#t~mem49#1.offset;havoc main_#t~mem50#1.base, main_#t~mem50#1.offset;havoc main_#t~mem51#1.base, main_#t~mem51#1.offset;havoc main_#t~mem52#1;call main_#t~mem53#1.base, main_#t~mem53#1.offset := read~$Pointer$(main_~users~0#1.base, 8 + main_~users~0#1.offset, 4);call main_#t~mem54#1.base, main_#t~mem54#1.offset := read~$Pointer$(main_#t~mem53#1.base, 16 + main_#t~mem53#1.offset, 4);call write~$Pointer$(main_~user~0#1.base, main_~user~0#1.offset, main_#t~mem54#1.base, 8 + main_#t~mem54#1.offset, 4);havoc main_#t~mem53#1.base, main_#t~mem53#1.offset;havoc main_#t~mem54#1.base, main_#t~mem54#1.offset;call main_#t~mem55#1.base, main_#t~mem55#1.offset := read~$Pointer$(main_~users~0#1.base, 8 + main_~users~0#1.offset, 4);call write~$Pointer$(main_~user~0#1.base, 8 + main_~user~0#1.offset, main_#t~mem55#1.base, 16 + main_#t~mem55#1.offset, 4);havoc main_#t~mem55#1.base, main_#t~mem55#1.offset; {4578#(<= 0 |ULTIMATE.start_main_~i~0#1|)} is VALID [2022-02-21 03:20:55,048 INFO L290 TraceCheckUtils]: 41: Hoare triple {4578#(<= 0 |ULTIMATE.start_main_~i~0#1|)} goto; {4578#(<= 0 |ULTIMATE.start_main_~i~0#1|)} is VALID [2022-02-21 03:20:55,048 INFO L290 TraceCheckUtils]: 42: Hoare triple {4578#(<= 0 |ULTIMATE.start_main_~i~0#1|)} havoc main_~_ha_bkt~0#1;call main_#t~mem56#1.base, main_#t~mem56#1.offset := read~$Pointer$(main_~users~0#1.base, 8 + main_~users~0#1.offset, 4);call main_#t~mem57#1 := read~int(main_#t~mem56#1.base, 12 + main_#t~mem56#1.offset, 4);main_#t~post58#1 := main_#t~mem57#1;call write~int(1 + main_#t~post58#1, main_#t~mem56#1.base, 12 + main_#t~mem56#1.offset, 4);havoc main_#t~mem56#1.base, main_#t~mem56#1.offset;havoc main_#t~mem57#1;havoc main_#t~post58#1; {4578#(<= 0 |ULTIMATE.start_main_~i~0#1|)} is VALID [2022-02-21 03:20:55,048 INFO L290 TraceCheckUtils]: 43: Hoare triple {4578#(<= 0 |ULTIMATE.start_main_~i~0#1|)} call main_#t~mem59#1.base, main_#t~mem59#1.offset := read~$Pointer$(main_~users~0#1.base, 8 + main_~users~0#1.offset, 4);call main_#t~mem60#1 := read~int(main_#t~mem59#1.base, 4 + main_#t~mem59#1.offset, 4);main_~_ha_bkt~0#1 := (if 0 == main_~_ha_hashv~0#1 || 0 == main_#t~mem60#1 - 1 then 0 else (if 1 == main_#t~mem60#1 - 1 then (if 1 == main_~_ha_hashv~0#1 || 0 == main_~_ha_hashv~0#1 then main_~_ha_hashv~0#1 else (if main_~_ha_hashv~0#1 >= 0 then main_~_ha_hashv~0#1 % 2 else ~bitwiseAnd(main_~_ha_hashv~0#1, main_#t~mem60#1 - 1))) else (if 1 == main_~_ha_hashv~0#1 then (if 1 == main_#t~mem60#1 - 1 || 0 == main_#t~mem60#1 - 1 then main_#t~mem60#1 - 1 else (if main_#t~mem60#1 - 1 >= 0 then (main_#t~mem60#1 - 1) % 2 else ~bitwiseAnd(main_~_ha_hashv~0#1, main_#t~mem60#1 - 1))) else ~bitwiseAnd(main_~_ha_hashv~0#1, main_#t~mem60#1 - 1))));havoc main_#t~mem59#1.base, main_#t~mem59#1.offset;havoc main_#t~mem60#1; {4578#(<= 0 |ULTIMATE.start_main_~i~0#1|)} is VALID [2022-02-21 03:20:55,049 INFO L290 TraceCheckUtils]: 44: Hoare triple {4578#(<= 0 |ULTIMATE.start_main_~i~0#1|)} goto; {4578#(<= 0 |ULTIMATE.start_main_~i~0#1|)} is VALID [2022-02-21 03:20:55,049 INFO L290 TraceCheckUtils]: 45: Hoare triple {4578#(<= 0 |ULTIMATE.start_main_~i~0#1|)} call main_#t~mem61#1.base, main_#t~mem61#1.offset := read~$Pointer$(main_~users~0#1.base, 8 + main_~users~0#1.offset, 4);call main_#t~mem62#1.base, main_#t~mem62#1.offset := read~$Pointer$(main_#t~mem61#1.base, main_#t~mem61#1.offset, 4);main_~_ha_head~0#1.base, main_~_ha_head~0#1.offset := main_#t~mem62#1.base, main_#t~mem62#1.offset + 12 * (if main_~_ha_bkt~0#1 % 4294967296 % 4294967296 <= 2147483647 then main_~_ha_bkt~0#1 % 4294967296 % 4294967296 else main_~_ha_bkt~0#1 % 4294967296 % 4294967296 - 4294967296);havoc main_#t~mem61#1.base, main_#t~mem61#1.offset;havoc main_#t~mem62#1.base, main_#t~mem62#1.offset;call main_#t~mem63#1 := read~int(main_~_ha_head~0#1.base, 4 + main_~_ha_head~0#1.offset, 4);main_#t~post64#1 := main_#t~mem63#1;call write~int(1 + main_#t~post64#1, main_~_ha_head~0#1.base, 4 + main_~_ha_head~0#1.offset, 4);havoc main_#t~mem63#1;havoc main_#t~post64#1;call main_#t~mem65#1.base, main_#t~mem65#1.offset := read~$Pointer$(main_~_ha_head~0#1.base, main_~_ha_head~0#1.offset, 4);call write~$Pointer$(main_#t~mem65#1.base, main_#t~mem65#1.offset, main_~user~0#1.base, 24 + main_~user~0#1.offset, 4);havoc main_#t~mem65#1.base, main_#t~mem65#1.offset;call write~$Pointer$(0, 0, main_~user~0#1.base, 20 + main_~user~0#1.offset, 4);call main_#t~mem66#1.base, main_#t~mem66#1.offset := read~$Pointer$(main_~_ha_head~0#1.base, main_~_ha_head~0#1.offset, 4); {4578#(<= 0 |ULTIMATE.start_main_~i~0#1|)} is VALID [2022-02-21 03:20:55,049 INFO L290 TraceCheckUtils]: 46: Hoare triple {4578#(<= 0 |ULTIMATE.start_main_~i~0#1|)} assume main_#t~mem66#1.base != 0 || main_#t~mem66#1.offset != 0;havoc main_#t~mem66#1.base, main_#t~mem66#1.offset;call main_#t~mem67#1.base, main_#t~mem67#1.offset := read~$Pointer$(main_~_ha_head~0#1.base, main_~_ha_head~0#1.offset, 4);call write~$Pointer$(main_~user~0#1.base, 8 + main_~user~0#1.offset, main_#t~mem67#1.base, 12 + main_#t~mem67#1.offset, 4);havoc main_#t~mem67#1.base, main_#t~mem67#1.offset; {4578#(<= 0 |ULTIMATE.start_main_~i~0#1|)} is VALID [2022-02-21 03:20:55,050 INFO L290 TraceCheckUtils]: 47: Hoare triple {4578#(<= 0 |ULTIMATE.start_main_~i~0#1|)} call write~$Pointer$(main_~user~0#1.base, 8 + main_~user~0#1.offset, main_~_ha_head~0#1.base, main_~_ha_head~0#1.offset, 4);call main_#t~mem69#1 := read~int(main_~_ha_head~0#1.base, 4 + main_~_ha_head~0#1.offset, 4);call main_#t~mem68#1 := read~int(main_~_ha_head~0#1.base, 8 + main_~_ha_head~0#1.offset, 4);main_#t~short72#1 := main_#t~mem69#1 % 4294967296 >= 10 * (1 + main_#t~mem68#1) % 4294967296; {4578#(<= 0 |ULTIMATE.start_main_~i~0#1|)} is VALID [2022-02-21 03:20:55,050 INFO L290 TraceCheckUtils]: 48: Hoare triple {4578#(<= 0 |ULTIMATE.start_main_~i~0#1|)} assume main_#t~short72#1;call main_#t~mem70#1.base, main_#t~mem70#1.offset := read~$Pointer$(main_~user~0#1.base, 8 + main_~user~0#1.offset, 4);call main_#t~mem71#1 := read~int(main_#t~mem70#1.base, 36 + main_#t~mem70#1.offset, 4);main_#t~short72#1 := 0 == main_#t~mem71#1 % 4294967296; {4578#(<= 0 |ULTIMATE.start_main_~i~0#1|)} is VALID [2022-02-21 03:20:55,050 INFO L290 TraceCheckUtils]: 49: Hoare triple {4578#(<= 0 |ULTIMATE.start_main_~i~0#1|)} assume !main_#t~short72#1;havoc main_#t~mem69#1;havoc main_#t~mem68#1;havoc main_#t~mem70#1.base, main_#t~mem70#1.offset;havoc main_#t~mem71#1;havoc main_#t~short72#1; {4578#(<= 0 |ULTIMATE.start_main_~i~0#1|)} is VALID [2022-02-21 03:20:55,050 INFO L290 TraceCheckUtils]: 50: Hoare triple {4578#(<= 0 |ULTIMATE.start_main_~i~0#1|)} goto; {4578#(<= 0 |ULTIMATE.start_main_~i~0#1|)} is VALID [2022-02-21 03:20:55,051 INFO L290 TraceCheckUtils]: 51: Hoare triple {4578#(<= 0 |ULTIMATE.start_main_~i~0#1|)} goto; {4578#(<= 0 |ULTIMATE.start_main_~i~0#1|)} is VALID [2022-02-21 03:20:55,051 INFO L290 TraceCheckUtils]: 52: Hoare triple {4578#(<= 0 |ULTIMATE.start_main_~i~0#1|)} goto; {4578#(<= 0 |ULTIMATE.start_main_~i~0#1|)} is VALID [2022-02-21 03:20:55,051 INFO L290 TraceCheckUtils]: 53: Hoare triple {4578#(<= 0 |ULTIMATE.start_main_~i~0#1|)} goto; {4578#(<= 0 |ULTIMATE.start_main_~i~0#1|)} is VALID [2022-02-21 03:20:55,052 INFO L290 TraceCheckUtils]: 54: Hoare triple {4578#(<= 0 |ULTIMATE.start_main_~i~0#1|)} main_#t~post5#1 := main_~i~0#1; {4738#(<= 0 |ULTIMATE.start_main_#t~post5#1|)} is VALID [2022-02-21 03:20:55,052 INFO L290 TraceCheckUtils]: 55: Hoare triple {4738#(<= 0 |ULTIMATE.start_main_#t~post5#1|)} assume 1 + main_#t~post5#1 <= 2147483647; {4738#(<= 0 |ULTIMATE.start_main_#t~post5#1|)} is VALID [2022-02-21 03:20:55,057 INFO L290 TraceCheckUtils]: 56: Hoare triple {4738#(<= 0 |ULTIMATE.start_main_#t~post5#1|)} assume !(1 + main_#t~post5#1 >= -2147483648); {4571#false} is VALID [2022-02-21 03:20:55,057 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-21 03:20:55,057 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-21 03:20:55,058 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 03:20:55,058 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1624419631] [2022-02-21 03:20:55,058 WARN L317 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-02-21 03:20:55,058 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1942078773] [2022-02-21 03:20:55,058 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1942078773] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-21 03:20:55,058 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-21 03:20:55,058 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-21 03:20:55,058 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1076357461] [2022-02-21 03:20:55,058 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-21 03:20:55,059 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 19.0) internal successors, (57), 4 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 57 [2022-02-21 03:20:55,059 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-21 03:20:55,059 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 4 states, 3 states have (on average 19.0) internal successors, (57), 4 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:20:55,141 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 57 edges. 57 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:20:55,142 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-02-21 03:20:55,142 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 03:20:55,142 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-02-21 03:20:55,142 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-02-21 03:20:55,143 INFO L87 Difference]: Start difference. First operand 235 states and 295 transitions. Second operand has 4 states, 3 states have (on average 19.0) internal successors, (57), 4 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:20:55,593 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:20:55,593 INFO L93 Difference]: Finished difference Result 235 states and 295 transitions. [2022-02-21 03:20:55,593 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-02-21 03:20:55,594 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 19.0) internal successors, (57), 4 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 57 [2022-02-21 03:20:55,594 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-21 03:20:55,594 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 3 states have (on average 19.0) internal successors, (57), 4 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:20:55,595 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 173 transitions. [2022-02-21 03:20:55,595 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 3 states have (on average 19.0) internal successors, (57), 4 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:20:55,596 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 173 transitions. [2022-02-21 03:20:55,596 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 173 transitions. [2022-02-21 03:20:55,712 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 173 edges. 173 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:20:55,715 INFO L225 Difference]: With dead ends: 235 [2022-02-21 03:20:55,715 INFO L226 Difference]: Without dead ends: 234 [2022-02-21 03:20:55,715 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 54 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-02-21 03:20:55,716 INFO L933 BasicCegarLoop]: 162 mSDtfsCounter, 85 mSDsluCounter, 182 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 98 SdHoareTripleChecker+Valid, 344 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-21 03:20:55,716 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [98 Valid, 344 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-21 03:20:55,716 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 234 states. [2022-02-21 03:20:55,770 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 234 to 234. [2022-02-21 03:20:55,770 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 03:20:55,770 INFO L82 GeneralOperation]: Start isEquivalent. First operand 234 states. Second operand has 234 states, 212 states have (on average 1.2358490566037736) internal successors, (262), 225 states have internal predecessors, (262), 16 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 7 states have call predecessors, (16), 16 states have call successors, (16) [2022-02-21 03:20:55,771 INFO L74 IsIncluded]: Start isIncluded. First operand 234 states. Second operand has 234 states, 212 states have (on average 1.2358490566037736) internal successors, (262), 225 states have internal predecessors, (262), 16 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 7 states have call predecessors, (16), 16 states have call successors, (16) [2022-02-21 03:20:55,771 INFO L87 Difference]: Start difference. First operand 234 states. Second operand has 234 states, 212 states have (on average 1.2358490566037736) internal successors, (262), 225 states have internal predecessors, (262), 16 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 7 states have call predecessors, (16), 16 states have call successors, (16) [2022-02-21 03:20:55,775 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:20:55,775 INFO L93 Difference]: Finished difference Result 234 states and 294 transitions. [2022-02-21 03:20:55,775 INFO L276 IsEmpty]: Start isEmpty. Operand 234 states and 294 transitions. [2022-02-21 03:20:55,775 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:20:55,775 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:20:55,776 INFO L74 IsIncluded]: Start isIncluded. First operand has 234 states, 212 states have (on average 1.2358490566037736) internal successors, (262), 225 states have internal predecessors, (262), 16 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 7 states have call predecessors, (16), 16 states have call successors, (16) Second operand 234 states. [2022-02-21 03:20:55,777 INFO L87 Difference]: Start difference. First operand has 234 states, 212 states have (on average 1.2358490566037736) internal successors, (262), 225 states have internal predecessors, (262), 16 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 7 states have call predecessors, (16), 16 states have call successors, (16) Second operand 234 states. [2022-02-21 03:20:55,780 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:20:55,780 INFO L93 Difference]: Finished difference Result 234 states and 294 transitions. [2022-02-21 03:20:55,780 INFO L276 IsEmpty]: Start isEmpty. Operand 234 states and 294 transitions. [2022-02-21 03:20:55,781 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:20:55,781 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:20:55,781 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 03:20:55,781 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 03:20:55,782 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 234 states, 212 states have (on average 1.2358490566037736) internal successors, (262), 225 states have internal predecessors, (262), 16 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 7 states have call predecessors, (16), 16 states have call successors, (16) [2022-02-21 03:20:55,785 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 234 states to 234 states and 294 transitions. [2022-02-21 03:20:55,785 INFO L78 Accepts]: Start accepts. Automaton has 234 states and 294 transitions. Word has length 57 [2022-02-21 03:20:55,785 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-21 03:20:55,785 INFO L470 AbstractCegarLoop]: Abstraction has 234 states and 294 transitions. [2022-02-21 03:20:55,785 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 19.0) internal successors, (57), 4 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:20:55,786 INFO L276 IsEmpty]: Start isEmpty. Operand 234 states and 294 transitions. [2022-02-21 03:20:55,786 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2022-02-21 03:20:55,786 INFO L506 BasicCegarLoop]: Found error trace [2022-02-21 03:20:55,786 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-21 03:20:55,809 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2022-02-21 03:20:55,999 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-21 03:20:56,000 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2022-02-21 03:20:56,000 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:20:56,000 INFO L85 PathProgramCache]: Analyzing trace with hash 1237589276, now seen corresponding path program 1 times [2022-02-21 03:20:56,000 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:20:56,000 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1671180338] [2022-02-21 03:20:56,000 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:20:56,000 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:20:56,082 ERROR L252 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-02-21 03:20:56,082 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2074412475] [2022-02-21 03:20:56,082 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:20:56,082 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-21 03:20:56,082 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:20:56,083 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-02-21 03:20:56,084 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-02-21 03:20:56,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:20:56,769 INFO L263 TraceCheckSpWp]: Trace formula consists of 1529 conjuncts, 4 conjunts are in the unsatisfiable core [2022-02-21 03:20:56,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:20:56,800 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 03:20:57,022 INFO L290 TraceCheckUtils]: 0: Hoare triple {5781#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(21, 2);~count_int_int~0 := 0; {5781#true} is VALID [2022-02-21 03:20:57,022 INFO L290 TraceCheckUtils]: 1: Hoare triple {5781#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc6#1.base, main_#t~malloc6#1.offset, main_#t~mem8#1, main_#t~mem7#1, main_#t~mem9#1, main_#t~mem10#1, main_#t~mem12#1, main_#t~mem11#1, main_#t~mem13#1, main_#t~mem14#1, main_#t~mem16#1, main_#t~mem15#1, main_#t~mem17#1, main_#t~mem18#1, main_#t~switch19#1, main_#t~mem20#1, main_#t~mem21#1, main_#t~mem22#1, main_#t~mem23#1, main_#t~mem24#1, main_#t~mem25#1, main_#t~mem26#1, main_#t~mem27#1, main_#t~mem28#1, main_#t~mem29#1, main_#t~mem30#1, main_~_hj_i~0#1, main_~_hj_j~0#1, main_~_hj_k~0#1, main_~_hj_key~0#1.base, main_~_hj_key~0#1.offset, main_#t~malloc31#1.base, main_#t~malloc31#1.offset, main_#t~mem32#1.base, main_#t~mem32#1.offset, main_#t~mem33#1.base, main_#t~mem33#1.offset, main_#t~memset~res34#1.base, main_#t~memset~res34#1.offset, main_#t~mem35#1.base, main_#t~mem35#1.offset, main_#t~mem36#1.base, main_#t~mem36#1.offset, main_#t~mem37#1.base, main_#t~mem37#1.offset, main_#t~mem38#1.base, main_#t~mem38#1.offset, main_#t~mem39#1.base, main_#t~mem39#1.offset, main_#t~malloc40#1.base, main_#t~malloc40#1.offset, main_#t~mem41#1.base, main_#t~mem41#1.offset, main_#t~mem42#1.base, main_#t~mem42#1.offset, main_#t~mem43#1.base, main_#t~mem43#1.offset, main_#t~mem44#1.base, main_#t~mem44#1.offset, main_#t~mem45#1.base, main_#t~mem45#1.offset, main_#t~mem46#1.base, main_#t~mem46#1.offset, main_#t~memset~res47#1.base, main_#t~memset~res47#1.offset, main_#t~mem48#1.base, main_#t~mem48#1.offset, main_#t~mem49#1.base, main_#t~mem49#1.offset, main_#t~mem50#1.base, main_#t~mem50#1.offset, main_#t~mem51#1.base, main_#t~mem51#1.offset, main_#t~mem52#1, main_#t~mem53#1.base, main_#t~mem53#1.offset, main_#t~mem54#1.base, main_#t~mem54#1.offset, main_#t~mem55#1.base, main_#t~mem55#1.offset, main_#t~mem56#1.base, main_#t~mem56#1.offset, main_#t~mem57#1, main_#t~post58#1, main_#t~mem59#1.base, main_#t~mem59#1.offset, main_#t~mem60#1, main_#t~mem61#1.base, main_#t~mem61#1.offset, main_#t~mem62#1.base, main_#t~mem62#1.offset, main_#t~mem63#1, main_#t~post64#1, main_#t~mem65#1.base, main_#t~mem65#1.offset, main_#t~mem66#1.base, main_#t~mem66#1.offset, main_#t~mem67#1.base, main_#t~mem67#1.offset, main_#t~mem69#1, main_#t~mem68#1, main_#t~mem70#1.base, main_#t~mem70#1.offset, main_#t~mem71#1, main_#t~short72#1, main_#t~mem73#1.base, main_#t~mem73#1.offset, main_#t~mem74#1, main_#t~malloc75#1.base, main_#t~malloc75#1.offset, main_#t~mem76#1.base, main_#t~mem76#1.offset, main_#t~mem77#1.base, main_#t~mem77#1.offset, main_#t~mem78#1.base, main_#t~mem78#1.offset, main_#t~mem79#1, main_#t~memset~res80#1.base, main_#t~memset~res80#1.offset, main_#t~mem81#1.base, main_#t~mem81#1.offset, main_#t~mem82#1.base, main_#t~mem82#1.offset, main_#t~mem85#1, main_#t~mem83#1.base, main_#t~mem83#1.offset, main_#t~mem84#1, main_#t~mem86#1.base, main_#t~mem86#1.offset, main_#t~mem89#1, main_#t~mem87#1.base, main_#t~mem87#1.offset, main_#t~mem88#1, main_#t~ite90#1, main_#t~mem91#1.base, main_#t~mem91#1.offset, main_#t~mem95#1.base, main_#t~mem95#1.offset, main_#t~mem96#1.base, main_#t~mem96#1.offset, main_#t~mem97#1.base, main_#t~mem97#1.offset, main_#t~mem98#1.base, main_#t~mem98#1.offset, main_#t~mem101#1, main_#t~mem99#1.base, main_#t~mem99#1.offset, main_#t~mem100#1, main_#t~mem102#1.base, main_#t~mem102#1.offset, main_#t~mem103#1, main_#t~pre104#1, main_#t~mem105#1.base, main_#t~mem105#1.offset, main_#t~mem106#1, main_#t~mem107#1.base, main_#t~mem107#1.offset, main_#t~mem108#1, main_#t~post109#1, main_#t~mem113#1, main_#t~mem111#1, main_#t~mem110#1.base, main_#t~mem110#1.offset, main_#t~mem112#1, main_#t~mem114#1, main_#t~post115#1, main_#t~mem116#1.base, main_#t~mem116#1.offset, main_#t~mem117#1.base, main_#t~mem117#1.offset, main_#t~mem118#1.base, main_#t~mem118#1.offset, main_#t~post92#1, main_#t~mem93#1.base, main_#t~mem93#1.offset, main_#t~mem94#1, main_#t~mem119#1.base, main_#t~mem119#1.offset, main_#t~mem120#1.base, main_#t~mem120#1.offset, main_#t~mem121#1.base, main_#t~mem121#1.offset, main_#t~mem122#1, main_#t~mem123#1.base, main_#t~mem123#1.offset, main_#t~mem124#1, main_#t~post125#1, main_#t~mem126#1.base, main_#t~mem126#1.offset, main_#t~mem127#1.base, main_#t~mem127#1.offset, main_#t~mem128#1.base, main_#t~mem128#1.offset, main_#t~mem129#1.base, main_#t~mem129#1.offset, main_#t~mem132#1, main_#t~mem130#1.base, main_#t~mem130#1.offset, main_#t~mem131#1, main_#t~ite135#1, main_#t~mem133#1.base, main_#t~mem133#1.offset, main_#t~mem134#1, main_#t~mem136#1.base, main_#t~mem136#1.offset, main_#t~mem137#1, main_#t~mem138#1.base, main_#t~mem138#1.offset, main_~_he_bkt~0#1, main_~_he_bkt_i~0#1, main_~_he_thh~0#1.base, main_~_he_thh~0#1.offset, main_~_he_hh_nxt~0#1.base, main_~_he_hh_nxt~0#1.offset, main_~#_he_new_buckets~0#1.base, main_~#_he_new_buckets~0#1.offset, main_~_he_newbkt~0#1.base, main_~_he_newbkt~0#1.offset, main_~_ha_head~0#1.base, main_~_ha_head~0#1.offset, main_~_ha_bkt~0#1, main_~_ha_hashv~0#1, main_#t~post5#1, main_#t~mem140#1, main_#t~mem141#1, main_#t~mem139#1.base, main_#t~mem139#1.offset, main_#t~ite143#1.base, main_#t~ite143#1.offset, main_#t~mem142#1.base, main_#t~mem142#1.offset, main_#t~mem146#1.base, main_#t~mem146#1.offset, main_#t~mem147#1.base, main_#t~mem147#1.offset, main_#t~short148#1, main_#t~mem149#1.base, main_#t~mem149#1.offset, main_#t~mem150#1.base, main_#t~mem150#1.offset, main_#t~mem151#1.base, main_#t~mem151#1.offset, main_#t~mem152#1.base, main_#t~mem152#1.offset, main_#t~mem153#1.base, main_#t~mem153#1.offset, main_#t~mem154#1.base, main_#t~mem154#1.offset, main_#t~mem155#1.base, main_#t~mem155#1.offset, main_#t~mem156#1.base, main_#t~mem156#1.offset, main_#t~mem157#1, main_#t~mem158#1.base, main_#t~mem158#1.offset, main_#t~mem159#1.base, main_#t~mem159#1.offset, main_#t~mem160#1.base, main_#t~mem160#1.offset, main_#t~mem161#1, main_#t~mem162#1.base, main_#t~mem162#1.offset, main_#t~mem163#1.base, main_#t~mem163#1.offset, main_#t~mem164#1.base, main_#t~mem164#1.offset, main_#t~mem165#1.base, main_#t~mem165#1.offset, main_#t~mem166#1.base, main_#t~mem166#1.offset, main_#t~mem167#1, main_#t~mem168#1.base, main_#t~mem168#1.offset, main_#t~mem171#1, main_#t~mem169#1.base, main_#t~mem169#1.offset, main_#t~mem170#1, main_#t~mem172#1.base, main_#t~mem172#1.offset, main_#t~mem173#1.base, main_#t~mem173#1.offset, main_#t~mem174#1, main_#t~post175#1, 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.base, main_#t~mem181#1.offset, main_#t~mem182#1.base, main_#t~mem182#1.offset, main_#t~mem183#1.base, main_#t~mem183#1.offset, main_~_hd_head~0#1.base, main_~_hd_head~0#1.offset, main_#t~mem184#1.base, main_#t~mem184#1.offset, main_#t~mem185#1, main_#t~post186#1, main_~_hd_bkt~0#1, main_~_hd_hh_del~0#1.base, main_~_hd_hh_del~0#1.offset, main_#t~ite145#1.base, main_#t~ite145#1.offset, main_#t~mem144#1.base, main_#t~mem144#1.offset, main_~i~0#1, main_~user~0#1.base, main_~user~0#1.offset, main_~users~0#1.base, main_~users~0#1.offset, main_~temp~0#1.base, main_~temp~0#1.offset;havoc main_~i~0#1;havoc main_~user~0#1.base, main_~user~0#1.offset;main_~users~0#1.base, main_~users~0#1.offset := 0, 0;main_~i~0#1 := 0; {5789#(<= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-21 03:20:57,023 INFO L290 TraceCheckUtils]: 2: Hoare triple {5789#(<= |ULTIMATE.start_main_~i~0#1| 0)} assume !!(main_~i~0#1 < 10);call main_#t~malloc6#1.base, main_#t~malloc6#1.offset := #Ultimate.allocOnHeap(40);main_~user~0#1.base, main_~user~0#1.offset := main_#t~malloc6#1.base, main_#t~malloc6#1.offset;havoc main_#t~malloc6#1.base, main_#t~malloc6#1.offset; {5789#(<= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-21 03:20:57,023 INFO L290 TraceCheckUtils]: 3: Hoare triple {5789#(<= |ULTIMATE.start_main_~i~0#1| 0)} assume !(main_~user~0#1.base == 0 && main_~user~0#1.offset == 0); {5789#(<= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-21 03:20:57,023 INFO L290 TraceCheckUtils]: 4: Hoare triple {5789#(<= |ULTIMATE.start_main_~i~0#1| 0)} call write~int(main_~i~0#1, main_~user~0#1.base, main_~user~0#1.offset, 4); {5789#(<= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-21 03:20:57,028 INFO L290 TraceCheckUtils]: 5: Hoare triple {5789#(<= |ULTIMATE.start_main_~i~0#1| 0)} assume main_~i~0#1 * main_~i~0#1 <= 2147483647; {5789#(<= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-21 03:20:57,029 INFO L290 TraceCheckUtils]: 6: Hoare triple {5789#(<= |ULTIMATE.start_main_~i~0#1| 0)} assume main_~i~0#1 * main_~i~0#1 >= -2147483648;call write~int(main_~i~0#1 * main_~i~0#1, main_~user~0#1.base, 4 + main_~user~0#1.offset, 4); {5789#(<= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-21 03:20:57,030 INFO L290 TraceCheckUtils]: 7: Hoare triple {5789#(<= |ULTIMATE.start_main_~i~0#1| 0)} havoc main_~_ha_hashv~0#1; {5789#(<= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-21 03:20:57,031 INFO L290 TraceCheckUtils]: 8: Hoare triple {5789#(<= |ULTIMATE.start_main_~i~0#1| 0)} goto; {5789#(<= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-21 03:20:57,034 INFO L290 TraceCheckUtils]: 9: Hoare triple {5789#(<= |ULTIMATE.start_main_~i~0#1| 0)} havoc main_~_hj_i~0#1;havoc main_~_hj_j~0#1;havoc main_~_hj_k~0#1;main_~_hj_key~0#1.base, main_~_hj_key~0#1.offset := main_~user~0#1.base, main_~user~0#1.offset;main_~_ha_hashv~0#1 := 4276993775;main_~_hj_j~0#1 := 2654435769;main_~_hj_i~0#1 := main_~_hj_j~0#1;main_~_hj_k~0#1 := 4; {5789#(<= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-21 03:20:57,035 INFO L290 TraceCheckUtils]: 10: Hoare triple {5789#(<= |ULTIMATE.start_main_~i~0#1| 0)} assume !(main_~_hj_k~0#1 % 4294967296 >= 12); {5789#(<= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-21 03:20:57,035 INFO L290 TraceCheckUtils]: 11: Hoare triple {5789#(<= |ULTIMATE.start_main_~i~0#1| 0)} main_~_ha_hashv~0#1 := 4 + main_~_ha_hashv~0#1;main_#t~switch19#1 := 11 == main_~_hj_k~0#1; {5789#(<= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-21 03:20:57,036 INFO L290 TraceCheckUtils]: 12: Hoare triple {5789#(<= |ULTIMATE.start_main_~i~0#1| 0)} assume !main_#t~switch19#1; {5789#(<= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-21 03:20:57,036 INFO L290 TraceCheckUtils]: 13: Hoare triple {5789#(<= |ULTIMATE.start_main_~i~0#1| 0)} main_#t~switch19#1 := main_#t~switch19#1 || 10 == main_~_hj_k~0#1; {5789#(<= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-21 03:20:57,036 INFO L290 TraceCheckUtils]: 14: Hoare triple {5789#(<= |ULTIMATE.start_main_~i~0#1| 0)} assume !main_#t~switch19#1; {5789#(<= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-21 03:20:57,037 INFO L290 TraceCheckUtils]: 15: Hoare triple {5789#(<= |ULTIMATE.start_main_~i~0#1| 0)} main_#t~switch19#1 := main_#t~switch19#1 || 9 == main_~_hj_k~0#1; {5789#(<= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-21 03:20:57,038 INFO L290 TraceCheckUtils]: 16: Hoare triple {5789#(<= |ULTIMATE.start_main_~i~0#1| 0)} assume !main_#t~switch19#1; {5789#(<= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-21 03:20:57,038 INFO L290 TraceCheckUtils]: 17: Hoare triple {5789#(<= |ULTIMATE.start_main_~i~0#1| 0)} main_#t~switch19#1 := main_#t~switch19#1 || 8 == main_~_hj_k~0#1; {5789#(<= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-21 03:20:57,038 INFO L290 TraceCheckUtils]: 18: Hoare triple {5789#(<= |ULTIMATE.start_main_~i~0#1| 0)} assume !main_#t~switch19#1; {5789#(<= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-21 03:20:57,039 INFO L290 TraceCheckUtils]: 19: Hoare triple {5789#(<= |ULTIMATE.start_main_~i~0#1| 0)} main_#t~switch19#1 := main_#t~switch19#1 || 7 == main_~_hj_k~0#1; {5789#(<= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-21 03:20:57,039 INFO L290 TraceCheckUtils]: 20: Hoare triple {5789#(<= |ULTIMATE.start_main_~i~0#1| 0)} assume !main_#t~switch19#1; {5789#(<= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-21 03:20:57,041 INFO L290 TraceCheckUtils]: 21: Hoare triple {5789#(<= |ULTIMATE.start_main_~i~0#1| 0)} main_#t~switch19#1 := main_#t~switch19#1 || 6 == main_~_hj_k~0#1; {5789#(<= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-21 03:20:57,042 INFO L290 TraceCheckUtils]: 22: Hoare triple {5789#(<= |ULTIMATE.start_main_~i~0#1| 0)} assume !main_#t~switch19#1; {5789#(<= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-21 03:20:57,042 INFO L290 TraceCheckUtils]: 23: Hoare triple {5789#(<= |ULTIMATE.start_main_~i~0#1| 0)} main_#t~switch19#1 := main_#t~switch19#1 || 5 == main_~_hj_k~0#1; {5789#(<= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-21 03:20:57,044 INFO L290 TraceCheckUtils]: 24: Hoare triple {5789#(<= |ULTIMATE.start_main_~i~0#1| 0)} assume !main_#t~switch19#1; {5789#(<= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-21 03:20:57,045 INFO L290 TraceCheckUtils]: 25: Hoare triple {5789#(<= |ULTIMATE.start_main_~i~0#1| 0)} main_#t~switch19#1 := main_#t~switch19#1 || 4 == main_~_hj_k~0#1; {5789#(<= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-21 03:20:57,045 INFO L290 TraceCheckUtils]: 26: Hoare triple {5789#(<= |ULTIMATE.start_main_~i~0#1| 0)} assume main_#t~switch19#1;call main_#t~mem27#1 := read~int(main_~_hj_key~0#1.base, 3 + main_~_hj_key~0#1.offset, 1);main_~_hj_i~0#1 := main_~_hj_i~0#1 + 16777216 * (main_#t~mem27#1 % 256);havoc main_#t~mem27#1; {5789#(<= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-21 03:20:57,045 INFO L290 TraceCheckUtils]: 27: Hoare triple {5789#(<= |ULTIMATE.start_main_~i~0#1| 0)} main_#t~switch19#1 := main_#t~switch19#1 || 3 == main_~_hj_k~0#1; {5789#(<= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-21 03:20:57,046 INFO L290 TraceCheckUtils]: 28: Hoare triple {5789#(<= |ULTIMATE.start_main_~i~0#1| 0)} assume main_#t~switch19#1;call main_#t~mem28#1 := read~int(main_~_hj_key~0#1.base, 2 + main_~_hj_key~0#1.offset, 1);main_~_hj_i~0#1 := main_~_hj_i~0#1 + 65536 * (main_#t~mem28#1 % 256);havoc main_#t~mem28#1; {5789#(<= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-21 03:20:57,046 INFO L290 TraceCheckUtils]: 29: Hoare triple {5789#(<= |ULTIMATE.start_main_~i~0#1| 0)} main_#t~switch19#1 := main_#t~switch19#1 || 2 == main_~_hj_k~0#1; {5789#(<= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-21 03:20:57,046 INFO L290 TraceCheckUtils]: 30: Hoare triple {5789#(<= |ULTIMATE.start_main_~i~0#1| 0)} assume main_#t~switch19#1;call main_#t~mem29#1 := read~int(main_~_hj_key~0#1.base, 1 + main_~_hj_key~0#1.offset, 1);main_~_hj_i~0#1 := main_~_hj_i~0#1 + 256 * (main_#t~mem29#1 % 256);havoc main_#t~mem29#1; {5789#(<= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-21 03:20:57,047 INFO L290 TraceCheckUtils]: 31: Hoare triple {5789#(<= |ULTIMATE.start_main_~i~0#1| 0)} main_#t~switch19#1 := main_#t~switch19#1 || 1 == main_~_hj_k~0#1; {5789#(<= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-21 03:20:57,047 INFO L290 TraceCheckUtils]: 32: Hoare triple {5789#(<= |ULTIMATE.start_main_~i~0#1| 0)} assume main_#t~switch19#1;call main_#t~mem30#1 := read~int(main_~_hj_key~0#1.base, main_~_hj_key~0#1.offset, 1);main_~_hj_i~0#1 := main_~_hj_i~0#1 + main_#t~mem30#1 % 256;havoc main_#t~mem30#1; {5789#(<= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-21 03:20:57,047 INFO L290 TraceCheckUtils]: 33: Hoare triple {5789#(<= |ULTIMATE.start_main_~i~0#1| 0)} havoc main_#t~switch19#1; {5789#(<= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-21 03:20:57,048 INFO L290 TraceCheckUtils]: 34: Hoare triple {5789#(<= |ULTIMATE.start_main_~i~0#1| 0)} main_~_hj_i~0#1 := main_~_hj_i~0#1 - main_~_hj_j~0#1;main_~_hj_i~0#1 := main_~_hj_i~0#1 - main_~_ha_hashv~0#1;main_~_hj_i~0#1 := (if (1 == main_~_hj_i~0#1 || 0 == main_~_hj_i~0#1) && (1 == main_~_ha_hashv~0#1 / 8192 || 0 == main_~_ha_hashv~0#1 / 8192) then (if main_~_hj_i~0#1 == main_~_ha_hashv~0#1 / 8192 then 0 else 1) else (if 0 == main_~_hj_i~0#1 then main_~_ha_hashv~0#1 / 8192 else (if 0 == main_~_ha_hashv~0#1 / 8192 then main_~_hj_i~0#1 else ~bitwiseXOr(main_~_hj_i~0#1, main_~_ha_hashv~0#1 / 8192))));main_~_hj_j~0#1 := main_~_hj_j~0#1 - main_~_ha_hashv~0#1;main_~_hj_j~0#1 := main_~_hj_j~0#1 - main_~_hj_i~0#1;main_~_hj_j~0#1 := (if (1 == main_~_hj_j~0#1 || 0 == main_~_hj_j~0#1) && (1 == 256 * main_~_hj_i~0#1 || 0 == 256 * main_~_hj_i~0#1) then (if main_~_hj_j~0#1 == 256 * main_~_hj_i~0#1 then 0 else 1) else (if 0 == main_~_hj_j~0#1 then 256 * main_~_hj_i~0#1 else (if 0 == 256 * main_~_hj_i~0#1 then main_~_hj_j~0#1 else ~bitwiseXOr(main_~_hj_j~0#1, 256 * main_~_hj_i~0#1))));main_~_ha_hashv~0#1 := main_~_ha_hashv~0#1 - main_~_hj_i~0#1;main_~_ha_hashv~0#1 := main_~_ha_hashv~0#1 - main_~_hj_j~0#1;main_~_ha_hashv~0#1 := (if (1 == main_~_ha_hashv~0#1 || 0 == main_~_ha_hashv~0#1) && (1 == main_~_hj_j~0#1 / 8192 || 0 == main_~_hj_j~0#1 / 8192) then (if main_~_ha_hashv~0#1 == main_~_hj_j~0#1 / 8192 then 0 else 1) else (if 0 == main_~_ha_hashv~0#1 then main_~_hj_j~0#1 / 8192 else (if 0 == main_~_hj_j~0#1 / 8192 then main_~_ha_hashv~0#1 else ~bitwiseXOr(main_~_ha_hashv~0#1, main_~_hj_j~0#1 / 8192))));main_~_hj_i~0#1 := main_~_hj_i~0#1 - main_~_hj_j~0#1;main_~_hj_i~0#1 := main_~_hj_i~0#1 - main_~_ha_hashv~0#1;main_~_hj_i~0#1 := (if (1 == main_~_hj_i~0#1 || 0 == main_~_hj_i~0#1) && (1 == main_~_ha_hashv~0#1 / 4096 || 0 == main_~_ha_hashv~0#1 / 4096) then (if main_~_hj_i~0#1 == main_~_ha_hashv~0#1 / 4096 then 0 else 1) else (if 0 == main_~_hj_i~0#1 then main_~_ha_hashv~0#1 / 4096 else (if 0 == main_~_ha_hashv~0#1 / 4096 then main_~_hj_i~0#1 else ~bitwiseXOr(main_~_hj_i~0#1, main_~_ha_hashv~0#1 / 4096))));main_~_hj_j~0#1 := main_~_hj_j~0#1 - main_~_ha_hashv~0#1;main_~_hj_j~0#1 := main_~_hj_j~0#1 - main_~_hj_i~0#1;main_~_hj_j~0#1 := (if (1 == main_~_hj_j~0#1 || 0 == main_~_hj_j~0#1) && (1 == 65536 * main_~_hj_i~0#1 || 0 == 65536 * main_~_hj_i~0#1) then (if main_~_hj_j~0#1 == 65536 * main_~_hj_i~0#1 then 0 else 1) else (if 0 == main_~_hj_j~0#1 then 65536 * main_~_hj_i~0#1 else (if 0 == 65536 * main_~_hj_i~0#1 then main_~_hj_j~0#1 else ~bitwiseXOr(main_~_hj_j~0#1, 65536 * main_~_hj_i~0#1))));main_~_ha_hashv~0#1 := main_~_ha_hashv~0#1 - main_~_hj_i~0#1;main_~_ha_hashv~0#1 := main_~_ha_hashv~0#1 - main_~_hj_j~0#1;main_~_ha_hashv~0#1 := (if (1 == main_~_ha_hashv~0#1 || 0 == main_~_ha_hashv~0#1) && (1 == main_~_hj_j~0#1 / 32 || 0 == main_~_hj_j~0#1 / 32) then (if main_~_ha_hashv~0#1 == main_~_hj_j~0#1 / 32 then 0 else 1) else (if 0 == main_~_ha_hashv~0#1 then main_~_hj_j~0#1 / 32 else (if 0 == main_~_hj_j~0#1 / 32 then main_~_ha_hashv~0#1 else ~bitwiseXOr(main_~_ha_hashv~0#1, main_~_hj_j~0#1 / 32))));main_~_hj_i~0#1 := main_~_hj_i~0#1 - main_~_hj_j~0#1;main_~_hj_i~0#1 := main_~_hj_i~0#1 - main_~_ha_hashv~0#1;main_~_hj_i~0#1 := (if (1 == main_~_hj_i~0#1 || 0 == main_~_hj_i~0#1) && (1 == main_~_ha_hashv~0#1 / 8 || 0 == main_~_ha_hashv~0#1 / 8) then (if main_~_hj_i~0#1 == main_~_ha_hashv~0#1 / 8 then 0 else 1) else (if 0 == main_~_hj_i~0#1 then main_~_ha_hashv~0#1 / 8 else (if 0 == main_~_ha_hashv~0#1 / 8 then main_~_hj_i~0#1 else ~bitwiseXOr(main_~_hj_i~0#1, main_~_ha_hashv~0#1 / 8))));main_~_hj_j~0#1 := main_~_hj_j~0#1 - main_~_ha_hashv~0#1;main_~_hj_j~0#1 := main_~_hj_j~0#1 - main_~_hj_i~0#1;main_~_hj_j~0#1 := (if (1 == main_~_hj_j~0#1 || 0 == main_~_hj_j~0#1) && (1 == 1024 * main_~_hj_i~0#1 || 0 == 1024 * main_~_hj_i~0#1) then (if main_~_hj_j~0#1 == 1024 * main_~_hj_i~0#1 then 0 else 1) else (if 0 == main_~_hj_j~0#1 then 1024 * main_~_hj_i~0#1 else (if 0 == 1024 * main_~_hj_i~0#1 then main_~_hj_j~0#1 else ~bitwiseXOr(main_~_hj_j~0#1, 1024 * main_~_hj_i~0#1))));main_~_ha_hashv~0#1 := main_~_ha_hashv~0#1 - main_~_hj_i~0#1;main_~_ha_hashv~0#1 := main_~_ha_hashv~0#1 - main_~_hj_j~0#1;main_~_ha_hashv~0#1 := (if (1 == main_~_ha_hashv~0#1 || 0 == main_~_ha_hashv~0#1) && (1 == main_~_hj_j~0#1 / 32768 || 0 == main_~_hj_j~0#1 / 32768) then (if main_~_ha_hashv~0#1 == main_~_hj_j~0#1 / 32768 then 0 else 1) else (if 0 == main_~_ha_hashv~0#1 then main_~_hj_j~0#1 / 32768 else (if 0 == main_~_hj_j~0#1 / 32768 then main_~_ha_hashv~0#1 else ~bitwiseXOr(main_~_ha_hashv~0#1, main_~_hj_j~0#1 / 32768)))); {5789#(<= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-21 03:20:57,048 INFO L290 TraceCheckUtils]: 35: Hoare triple {5789#(<= |ULTIMATE.start_main_~i~0#1| 0)} goto; {5789#(<= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-21 03:20:57,048 INFO L290 TraceCheckUtils]: 36: Hoare triple {5789#(<= |ULTIMATE.start_main_~i~0#1| 0)} goto; {5789#(<= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-21 03:20:57,048 INFO L290 TraceCheckUtils]: 37: Hoare triple {5789#(<= |ULTIMATE.start_main_~i~0#1| 0)} goto; {5789#(<= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-21 03:20:57,049 INFO L290 TraceCheckUtils]: 38: Hoare triple {5789#(<= |ULTIMATE.start_main_~i~0#1| 0)} call write~int(main_~_ha_hashv~0#1, main_~user~0#1.base, 36 + main_~user~0#1.offset, 4);call write~$Pointer$(main_~user~0#1.base, main_~user~0#1.offset, main_~user~0#1.base, 28 + main_~user~0#1.offset, 4);call write~int(4, main_~user~0#1.base, 32 + main_~user~0#1.offset, 4); {5789#(<= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-21 03:20:57,049 INFO L290 TraceCheckUtils]: 39: Hoare triple {5789#(<= |ULTIMATE.start_main_~i~0#1| 0)} assume !(main_~users~0#1.base == 0 && main_~users~0#1.offset == 0);call main_#t~mem48#1.base, main_#t~mem48#1.offset := read~$Pointer$(main_~users~0#1.base, 8 + main_~users~0#1.offset, 4);call write~$Pointer$(main_#t~mem48#1.base, main_#t~mem48#1.offset, main_~user~0#1.base, 8 + main_~user~0#1.offset, 4);havoc main_#t~mem48#1.base, main_#t~mem48#1.offset; {5789#(<= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-21 03:20:57,049 INFO L290 TraceCheckUtils]: 40: Hoare triple {5789#(<= |ULTIMATE.start_main_~i~0#1| 0)} call write~$Pointer$(0, 0, main_~user~0#1.base, 16 + main_~user~0#1.offset, 4);call main_#t~mem49#1.base, main_#t~mem49#1.offset := read~$Pointer$(main_~users~0#1.base, 8 + main_~users~0#1.offset, 4);call main_#t~mem50#1.base, main_#t~mem50#1.offset := read~$Pointer$(main_#t~mem49#1.base, 16 + main_#t~mem49#1.offset, 4);call main_#t~mem51#1.base, main_#t~mem51#1.offset := read~$Pointer$(main_~users~0#1.base, 8 + main_~users~0#1.offset, 4);call main_#t~mem52#1 := read~int(main_#t~mem51#1.base, 20 + main_#t~mem51#1.offset, 4);call write~$Pointer$(main_#t~mem50#1.base, main_#t~mem50#1.offset - main_#t~mem52#1, main_~user~0#1.base, 12 + main_~user~0#1.offset, 4);havoc main_#t~mem49#1.base, main_#t~mem49#1.offset;havoc main_#t~mem50#1.base, main_#t~mem50#1.offset;havoc main_#t~mem51#1.base, main_#t~mem51#1.offset;havoc main_#t~mem52#1;call main_#t~mem53#1.base, main_#t~mem53#1.offset := read~$Pointer$(main_~users~0#1.base, 8 + main_~users~0#1.offset, 4);call main_#t~mem54#1.base, main_#t~mem54#1.offset := read~$Pointer$(main_#t~mem53#1.base, 16 + main_#t~mem53#1.offset, 4);call write~$Pointer$(main_~user~0#1.base, main_~user~0#1.offset, main_#t~mem54#1.base, 8 + main_#t~mem54#1.offset, 4);havoc main_#t~mem53#1.base, main_#t~mem53#1.offset;havoc main_#t~mem54#1.base, main_#t~mem54#1.offset;call main_#t~mem55#1.base, main_#t~mem55#1.offset := read~$Pointer$(main_~users~0#1.base, 8 + main_~users~0#1.offset, 4);call write~$Pointer$(main_~user~0#1.base, 8 + main_~user~0#1.offset, main_#t~mem55#1.base, 16 + main_#t~mem55#1.offset, 4);havoc main_#t~mem55#1.base, main_#t~mem55#1.offset; {5789#(<= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-21 03:20:57,050 INFO L290 TraceCheckUtils]: 41: Hoare triple {5789#(<= |ULTIMATE.start_main_~i~0#1| 0)} goto; {5789#(<= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-21 03:20:57,050 INFO L290 TraceCheckUtils]: 42: Hoare triple {5789#(<= |ULTIMATE.start_main_~i~0#1| 0)} havoc main_~_ha_bkt~0#1;call main_#t~mem56#1.base, main_#t~mem56#1.offset := read~$Pointer$(main_~users~0#1.base, 8 + main_~users~0#1.offset, 4);call main_#t~mem57#1 := read~int(main_#t~mem56#1.base, 12 + main_#t~mem56#1.offset, 4);main_#t~post58#1 := main_#t~mem57#1;call write~int(1 + main_#t~post58#1, main_#t~mem56#1.base, 12 + main_#t~mem56#1.offset, 4);havoc main_#t~mem56#1.base, main_#t~mem56#1.offset;havoc main_#t~mem57#1;havoc main_#t~post58#1; {5789#(<= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-21 03:20:57,050 INFO L290 TraceCheckUtils]: 43: Hoare triple {5789#(<= |ULTIMATE.start_main_~i~0#1| 0)} call main_#t~mem59#1.base, main_#t~mem59#1.offset := read~$Pointer$(main_~users~0#1.base, 8 + main_~users~0#1.offset, 4);call main_#t~mem60#1 := read~int(main_#t~mem59#1.base, 4 + main_#t~mem59#1.offset, 4);main_~_ha_bkt~0#1 := (if 0 == main_~_ha_hashv~0#1 || 0 == main_#t~mem60#1 - 1 then 0 else (if 1 == main_#t~mem60#1 - 1 then (if 1 == main_~_ha_hashv~0#1 || 0 == main_~_ha_hashv~0#1 then main_~_ha_hashv~0#1 else (if main_~_ha_hashv~0#1 >= 0 then main_~_ha_hashv~0#1 % 2 else ~bitwiseAnd(main_~_ha_hashv~0#1, main_#t~mem60#1 - 1))) else (if 1 == main_~_ha_hashv~0#1 then (if 1 == main_#t~mem60#1 - 1 || 0 == main_#t~mem60#1 - 1 then main_#t~mem60#1 - 1 else (if main_#t~mem60#1 - 1 >= 0 then (main_#t~mem60#1 - 1) % 2 else ~bitwiseAnd(main_~_ha_hashv~0#1, main_#t~mem60#1 - 1))) else ~bitwiseAnd(main_~_ha_hashv~0#1, main_#t~mem60#1 - 1))));havoc main_#t~mem59#1.base, main_#t~mem59#1.offset;havoc main_#t~mem60#1; {5789#(<= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-21 03:20:57,051 INFO L290 TraceCheckUtils]: 44: Hoare triple {5789#(<= |ULTIMATE.start_main_~i~0#1| 0)} goto; {5789#(<= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-21 03:20:57,051 INFO L290 TraceCheckUtils]: 45: Hoare triple {5789#(<= |ULTIMATE.start_main_~i~0#1| 0)} call main_#t~mem61#1.base, main_#t~mem61#1.offset := read~$Pointer$(main_~users~0#1.base, 8 + main_~users~0#1.offset, 4);call main_#t~mem62#1.base, main_#t~mem62#1.offset := read~$Pointer$(main_#t~mem61#1.base, main_#t~mem61#1.offset, 4);main_~_ha_head~0#1.base, main_~_ha_head~0#1.offset := main_#t~mem62#1.base, main_#t~mem62#1.offset + 12 * (if main_~_ha_bkt~0#1 % 4294967296 % 4294967296 <= 2147483647 then main_~_ha_bkt~0#1 % 4294967296 % 4294967296 else main_~_ha_bkt~0#1 % 4294967296 % 4294967296 - 4294967296);havoc main_#t~mem61#1.base, main_#t~mem61#1.offset;havoc main_#t~mem62#1.base, main_#t~mem62#1.offset;call main_#t~mem63#1 := read~int(main_~_ha_head~0#1.base, 4 + main_~_ha_head~0#1.offset, 4);main_#t~post64#1 := main_#t~mem63#1;call write~int(1 + main_#t~post64#1, main_~_ha_head~0#1.base, 4 + main_~_ha_head~0#1.offset, 4);havoc main_#t~mem63#1;havoc main_#t~post64#1;call main_#t~mem65#1.base, main_#t~mem65#1.offset := read~$Pointer$(main_~_ha_head~0#1.base, main_~_ha_head~0#1.offset, 4);call write~$Pointer$(main_#t~mem65#1.base, main_#t~mem65#1.offset, main_~user~0#1.base, 24 + main_~user~0#1.offset, 4);havoc main_#t~mem65#1.base, main_#t~mem65#1.offset;call write~$Pointer$(0, 0, main_~user~0#1.base, 20 + main_~user~0#1.offset, 4);call main_#t~mem66#1.base, main_#t~mem66#1.offset := read~$Pointer$(main_~_ha_head~0#1.base, main_~_ha_head~0#1.offset, 4); {5789#(<= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-21 03:20:57,051 INFO L290 TraceCheckUtils]: 46: Hoare triple {5789#(<= |ULTIMATE.start_main_~i~0#1| 0)} assume main_#t~mem66#1.base != 0 || main_#t~mem66#1.offset != 0;havoc main_#t~mem66#1.base, main_#t~mem66#1.offset;call main_#t~mem67#1.base, main_#t~mem67#1.offset := read~$Pointer$(main_~_ha_head~0#1.base, main_~_ha_head~0#1.offset, 4);call write~$Pointer$(main_~user~0#1.base, 8 + main_~user~0#1.offset, main_#t~mem67#1.base, 12 + main_#t~mem67#1.offset, 4);havoc main_#t~mem67#1.base, main_#t~mem67#1.offset; {5789#(<= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-21 03:20:57,052 INFO L290 TraceCheckUtils]: 47: Hoare triple {5789#(<= |ULTIMATE.start_main_~i~0#1| 0)} call write~$Pointer$(main_~user~0#1.base, 8 + main_~user~0#1.offset, main_~_ha_head~0#1.base, main_~_ha_head~0#1.offset, 4);call main_#t~mem69#1 := read~int(main_~_ha_head~0#1.base, 4 + main_~_ha_head~0#1.offset, 4);call main_#t~mem68#1 := read~int(main_~_ha_head~0#1.base, 8 + main_~_ha_head~0#1.offset, 4);main_#t~short72#1 := main_#t~mem69#1 % 4294967296 >= 10 * (1 + main_#t~mem68#1) % 4294967296; {5789#(<= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-21 03:20:57,052 INFO L290 TraceCheckUtils]: 48: Hoare triple {5789#(<= |ULTIMATE.start_main_~i~0#1| 0)} assume main_#t~short72#1;call main_#t~mem70#1.base, main_#t~mem70#1.offset := read~$Pointer$(main_~user~0#1.base, 8 + main_~user~0#1.offset, 4);call main_#t~mem71#1 := read~int(main_#t~mem70#1.base, 36 + main_#t~mem70#1.offset, 4);main_#t~short72#1 := 0 == main_#t~mem71#1 % 4294967296; {5789#(<= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-21 03:20:57,052 INFO L290 TraceCheckUtils]: 49: Hoare triple {5789#(<= |ULTIMATE.start_main_~i~0#1| 0)} assume !main_#t~short72#1;havoc main_#t~mem69#1;havoc main_#t~mem68#1;havoc main_#t~mem70#1.base, main_#t~mem70#1.offset;havoc main_#t~mem71#1;havoc main_#t~short72#1; {5789#(<= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-21 03:20:57,052 INFO L290 TraceCheckUtils]: 50: Hoare triple {5789#(<= |ULTIMATE.start_main_~i~0#1| 0)} goto; {5789#(<= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-21 03:20:57,053 INFO L290 TraceCheckUtils]: 51: Hoare triple {5789#(<= |ULTIMATE.start_main_~i~0#1| 0)} goto; {5789#(<= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-21 03:20:57,053 INFO L290 TraceCheckUtils]: 52: Hoare triple {5789#(<= |ULTIMATE.start_main_~i~0#1| 0)} goto; {5789#(<= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-21 03:20:57,053 INFO L290 TraceCheckUtils]: 53: Hoare triple {5789#(<= |ULTIMATE.start_main_~i~0#1| 0)} goto; {5789#(<= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-21 03:20:57,054 INFO L290 TraceCheckUtils]: 54: Hoare triple {5789#(<= |ULTIMATE.start_main_~i~0#1| 0)} main_#t~post5#1 := main_~i~0#1; {5949#(<= |ULTIMATE.start_main_#t~post5#1| 0)} is VALID [2022-02-21 03:20:57,054 INFO L290 TraceCheckUtils]: 55: Hoare triple {5949#(<= |ULTIMATE.start_main_#t~post5#1| 0)} assume 1 + main_#t~post5#1 <= 2147483647; {5949#(<= |ULTIMATE.start_main_#t~post5#1| 0)} is VALID [2022-02-21 03:20:57,054 INFO L290 TraceCheckUtils]: 56: Hoare triple {5949#(<= |ULTIMATE.start_main_#t~post5#1| 0)} assume 1 + main_#t~post5#1 >= -2147483648;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; {5956#(<= |ULTIMATE.start_main_~i~0#1| 1)} is VALID [2022-02-21 03:20:57,055 INFO L290 TraceCheckUtils]: 57: Hoare triple {5956#(<= |ULTIMATE.start_main_~i~0#1| 1)} assume !(main_~i~0#1 < 10); {5782#false} is VALID [2022-02-21 03:20:57,055 INFO L290 TraceCheckUtils]: 58: Hoare triple {5782#false} main_~user~0#1.base, main_~user~0#1.offset := main_~users~0#1.base, main_~users~0#1.offset; {5782#false} is VALID [2022-02-21 03:20:57,055 INFO L290 TraceCheckUtils]: 59: Hoare triple {5782#false} assume !!(main_~user~0#1.base != 0 || main_~user~0#1.offset != 0);call main_#t~mem140#1 := read~int(main_~user~0#1.base, main_~user~0#1.offset, 4);call main_#t~mem141#1 := read~int(main_~user~0#1.base, 4 + main_~user~0#1.offset, 4);assume { :begin_inline_test_int_int } true;test_int_int_#in~a#1, test_int_int_#in~b#1 := main_#t~mem140#1, main_#t~mem141#1;havoc test_int_int_#t~post3#1, test_int_int_#t~switch4#1, test_int_int_~a#1, test_int_int_~b#1;test_int_int_~a#1 := test_int_int_#in~a#1;test_int_int_~b#1 := test_int_int_#in~b#1;test_int_int_#t~post3#1 := ~count_int_int~0; {5782#false} is VALID [2022-02-21 03:20:57,055 INFO L290 TraceCheckUtils]: 60: Hoare triple {5782#false} assume !(1 + test_int_int_#t~post3#1 <= 2147483647); {5782#false} is VALID [2022-02-21 03:20:57,057 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-21 03:20:57,058 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-21 03:20:57,298 INFO L290 TraceCheckUtils]: 60: Hoare triple {5782#false} assume !(1 + test_int_int_#t~post3#1 <= 2147483647); {5782#false} is VALID [2022-02-21 03:20:57,299 INFO L290 TraceCheckUtils]: 59: Hoare triple {5782#false} assume !!(main_~user~0#1.base != 0 || main_~user~0#1.offset != 0);call main_#t~mem140#1 := read~int(main_~user~0#1.base, main_~user~0#1.offset, 4);call main_#t~mem141#1 := read~int(main_~user~0#1.base, 4 + main_~user~0#1.offset, 4);assume { :begin_inline_test_int_int } true;test_int_int_#in~a#1, test_int_int_#in~b#1 := main_#t~mem140#1, main_#t~mem141#1;havoc test_int_int_#t~post3#1, test_int_int_#t~switch4#1, test_int_int_~a#1, test_int_int_~b#1;test_int_int_~a#1 := test_int_int_#in~a#1;test_int_int_~b#1 := test_int_int_#in~b#1;test_int_int_#t~post3#1 := ~count_int_int~0; {5782#false} is VALID [2022-02-21 03:20:57,299 INFO L290 TraceCheckUtils]: 58: Hoare triple {5782#false} main_~user~0#1.base, main_~user~0#1.offset := main_~users~0#1.base, main_~users~0#1.offset; {5782#false} is VALID [2022-02-21 03:20:57,299 INFO L290 TraceCheckUtils]: 57: Hoare triple {5978#(< |ULTIMATE.start_main_~i~0#1| 10)} assume !(main_~i~0#1 < 10); {5782#false} is VALID [2022-02-21 03:20:57,300 INFO L290 TraceCheckUtils]: 56: Hoare triple {5982#(< |ULTIMATE.start_main_#t~post5#1| 9)} assume 1 + main_#t~post5#1 >= -2147483648;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; {5978#(< |ULTIMATE.start_main_~i~0#1| 10)} is VALID [2022-02-21 03:20:57,300 INFO L290 TraceCheckUtils]: 55: Hoare triple {5982#(< |ULTIMATE.start_main_#t~post5#1| 9)} assume 1 + main_#t~post5#1 <= 2147483647; {5982#(< |ULTIMATE.start_main_#t~post5#1| 9)} is VALID [2022-02-21 03:20:57,300 INFO L290 TraceCheckUtils]: 54: Hoare triple {5989#(< |ULTIMATE.start_main_~i~0#1| 9)} main_#t~post5#1 := main_~i~0#1; {5982#(< |ULTIMATE.start_main_#t~post5#1| 9)} is VALID [2022-02-21 03:20:57,301 INFO L290 TraceCheckUtils]: 53: Hoare triple {5989#(< |ULTIMATE.start_main_~i~0#1| 9)} goto; {5989#(< |ULTIMATE.start_main_~i~0#1| 9)} is VALID [2022-02-21 03:20:57,301 INFO L290 TraceCheckUtils]: 52: Hoare triple {5989#(< |ULTIMATE.start_main_~i~0#1| 9)} goto; {5989#(< |ULTIMATE.start_main_~i~0#1| 9)} is VALID [2022-02-21 03:20:57,301 INFO L290 TraceCheckUtils]: 51: Hoare triple {5989#(< |ULTIMATE.start_main_~i~0#1| 9)} goto; {5989#(< |ULTIMATE.start_main_~i~0#1| 9)} is VALID [2022-02-21 03:20:57,302 INFO L290 TraceCheckUtils]: 50: Hoare triple {5989#(< |ULTIMATE.start_main_~i~0#1| 9)} goto; {5989#(< |ULTIMATE.start_main_~i~0#1| 9)} is VALID [2022-02-21 03:20:57,302 INFO L290 TraceCheckUtils]: 49: Hoare triple {5989#(< |ULTIMATE.start_main_~i~0#1| 9)} assume !main_#t~short72#1;havoc main_#t~mem69#1;havoc main_#t~mem68#1;havoc main_#t~mem70#1.base, main_#t~mem70#1.offset;havoc main_#t~mem71#1;havoc main_#t~short72#1; {5989#(< |ULTIMATE.start_main_~i~0#1| 9)} is VALID [2022-02-21 03:20:57,302 INFO L290 TraceCheckUtils]: 48: Hoare triple {5989#(< |ULTIMATE.start_main_~i~0#1| 9)} assume main_#t~short72#1;call main_#t~mem70#1.base, main_#t~mem70#1.offset := read~$Pointer$(main_~user~0#1.base, 8 + main_~user~0#1.offset, 4);call main_#t~mem71#1 := read~int(main_#t~mem70#1.base, 36 + main_#t~mem70#1.offset, 4);main_#t~short72#1 := 0 == main_#t~mem71#1 % 4294967296; {5989#(< |ULTIMATE.start_main_~i~0#1| 9)} is VALID [2022-02-21 03:20:57,303 INFO L290 TraceCheckUtils]: 47: Hoare triple {5989#(< |ULTIMATE.start_main_~i~0#1| 9)} call write~$Pointer$(main_~user~0#1.base, 8 + main_~user~0#1.offset, main_~_ha_head~0#1.base, main_~_ha_head~0#1.offset, 4);call main_#t~mem69#1 := read~int(main_~_ha_head~0#1.base, 4 + main_~_ha_head~0#1.offset, 4);call main_#t~mem68#1 := read~int(main_~_ha_head~0#1.base, 8 + main_~_ha_head~0#1.offset, 4);main_#t~short72#1 := main_#t~mem69#1 % 4294967296 >= 10 * (1 + main_#t~mem68#1) % 4294967296; {5989#(< |ULTIMATE.start_main_~i~0#1| 9)} is VALID [2022-02-21 03:20:57,303 INFO L290 TraceCheckUtils]: 46: Hoare triple {5989#(< |ULTIMATE.start_main_~i~0#1| 9)} assume main_#t~mem66#1.base != 0 || main_#t~mem66#1.offset != 0;havoc main_#t~mem66#1.base, main_#t~mem66#1.offset;call main_#t~mem67#1.base, main_#t~mem67#1.offset := read~$Pointer$(main_~_ha_head~0#1.base, main_~_ha_head~0#1.offset, 4);call write~$Pointer$(main_~user~0#1.base, 8 + main_~user~0#1.offset, main_#t~mem67#1.base, 12 + main_#t~mem67#1.offset, 4);havoc main_#t~mem67#1.base, main_#t~mem67#1.offset; {5989#(< |ULTIMATE.start_main_~i~0#1| 9)} is VALID [2022-02-21 03:20:57,303 INFO L290 TraceCheckUtils]: 45: Hoare triple {5989#(< |ULTIMATE.start_main_~i~0#1| 9)} call main_#t~mem61#1.base, main_#t~mem61#1.offset := read~$Pointer$(main_~users~0#1.base, 8 + main_~users~0#1.offset, 4);call main_#t~mem62#1.base, main_#t~mem62#1.offset := read~$Pointer$(main_#t~mem61#1.base, main_#t~mem61#1.offset, 4);main_~_ha_head~0#1.base, main_~_ha_head~0#1.offset := main_#t~mem62#1.base, main_#t~mem62#1.offset + 12 * (if main_~_ha_bkt~0#1 % 4294967296 % 4294967296 <= 2147483647 then main_~_ha_bkt~0#1 % 4294967296 % 4294967296 else main_~_ha_bkt~0#1 % 4294967296 % 4294967296 - 4294967296);havoc main_#t~mem61#1.base, main_#t~mem61#1.offset;havoc main_#t~mem62#1.base, main_#t~mem62#1.offset;call main_#t~mem63#1 := read~int(main_~_ha_head~0#1.base, 4 + main_~_ha_head~0#1.offset, 4);main_#t~post64#1 := main_#t~mem63#1;call write~int(1 + main_#t~post64#1, main_~_ha_head~0#1.base, 4 + main_~_ha_head~0#1.offset, 4);havoc main_#t~mem63#1;havoc main_#t~post64#1;call main_#t~mem65#1.base, main_#t~mem65#1.offset := read~$Pointer$(main_~_ha_head~0#1.base, main_~_ha_head~0#1.offset, 4);call write~$Pointer$(main_#t~mem65#1.base, main_#t~mem65#1.offset, main_~user~0#1.base, 24 + main_~user~0#1.offset, 4);havoc main_#t~mem65#1.base, main_#t~mem65#1.offset;call write~$Pointer$(0, 0, main_~user~0#1.base, 20 + main_~user~0#1.offset, 4);call main_#t~mem66#1.base, main_#t~mem66#1.offset := read~$Pointer$(main_~_ha_head~0#1.base, main_~_ha_head~0#1.offset, 4); {5989#(< |ULTIMATE.start_main_~i~0#1| 9)} is VALID [2022-02-21 03:20:57,303 INFO L290 TraceCheckUtils]: 44: Hoare triple {5989#(< |ULTIMATE.start_main_~i~0#1| 9)} goto; {5989#(< |ULTIMATE.start_main_~i~0#1| 9)} is VALID [2022-02-21 03:20:57,304 INFO L290 TraceCheckUtils]: 43: Hoare triple {5989#(< |ULTIMATE.start_main_~i~0#1| 9)} call main_#t~mem59#1.base, main_#t~mem59#1.offset := read~$Pointer$(main_~users~0#1.base, 8 + main_~users~0#1.offset, 4);call main_#t~mem60#1 := read~int(main_#t~mem59#1.base, 4 + main_#t~mem59#1.offset, 4);main_~_ha_bkt~0#1 := (if 0 == main_~_ha_hashv~0#1 || 0 == main_#t~mem60#1 - 1 then 0 else (if 1 == main_#t~mem60#1 - 1 then (if 1 == main_~_ha_hashv~0#1 || 0 == main_~_ha_hashv~0#1 then main_~_ha_hashv~0#1 else (if main_~_ha_hashv~0#1 >= 0 then main_~_ha_hashv~0#1 % 2 else ~bitwiseAnd(main_~_ha_hashv~0#1, main_#t~mem60#1 - 1))) else (if 1 == main_~_ha_hashv~0#1 then (if 1 == main_#t~mem60#1 - 1 || 0 == main_#t~mem60#1 - 1 then main_#t~mem60#1 - 1 else (if main_#t~mem60#1 - 1 >= 0 then (main_#t~mem60#1 - 1) % 2 else ~bitwiseAnd(main_~_ha_hashv~0#1, main_#t~mem60#1 - 1))) else ~bitwiseAnd(main_~_ha_hashv~0#1, main_#t~mem60#1 - 1))));havoc main_#t~mem59#1.base, main_#t~mem59#1.offset;havoc main_#t~mem60#1; {5989#(< |ULTIMATE.start_main_~i~0#1| 9)} is VALID [2022-02-21 03:20:57,304 INFO L290 TraceCheckUtils]: 42: Hoare triple {5989#(< |ULTIMATE.start_main_~i~0#1| 9)} havoc main_~_ha_bkt~0#1;call main_#t~mem56#1.base, main_#t~mem56#1.offset := read~$Pointer$(main_~users~0#1.base, 8 + main_~users~0#1.offset, 4);call main_#t~mem57#1 := read~int(main_#t~mem56#1.base, 12 + main_#t~mem56#1.offset, 4);main_#t~post58#1 := main_#t~mem57#1;call write~int(1 + main_#t~post58#1, main_#t~mem56#1.base, 12 + main_#t~mem56#1.offset, 4);havoc main_#t~mem56#1.base, main_#t~mem56#1.offset;havoc main_#t~mem57#1;havoc main_#t~post58#1; {5989#(< |ULTIMATE.start_main_~i~0#1| 9)} is VALID [2022-02-21 03:20:57,305 INFO L290 TraceCheckUtils]: 41: Hoare triple {5989#(< |ULTIMATE.start_main_~i~0#1| 9)} goto; {5989#(< |ULTIMATE.start_main_~i~0#1| 9)} is VALID [2022-02-21 03:20:57,305 INFO L290 TraceCheckUtils]: 40: Hoare triple {5989#(< |ULTIMATE.start_main_~i~0#1| 9)} call write~$Pointer$(0, 0, main_~user~0#1.base, 16 + main_~user~0#1.offset, 4);call main_#t~mem49#1.base, main_#t~mem49#1.offset := read~$Pointer$(main_~users~0#1.base, 8 + main_~users~0#1.offset, 4);call main_#t~mem50#1.base, main_#t~mem50#1.offset := read~$Pointer$(main_#t~mem49#1.base, 16 + main_#t~mem49#1.offset, 4);call main_#t~mem51#1.base, main_#t~mem51#1.offset := read~$Pointer$(main_~users~0#1.base, 8 + main_~users~0#1.offset, 4);call main_#t~mem52#1 := read~int(main_#t~mem51#1.base, 20 + main_#t~mem51#1.offset, 4);call write~$Pointer$(main_#t~mem50#1.base, main_#t~mem50#1.offset - main_#t~mem52#1, main_~user~0#1.base, 12 + main_~user~0#1.offset, 4);havoc main_#t~mem49#1.base, main_#t~mem49#1.offset;havoc main_#t~mem50#1.base, main_#t~mem50#1.offset;havoc main_#t~mem51#1.base, main_#t~mem51#1.offset;havoc main_#t~mem52#1;call main_#t~mem53#1.base, main_#t~mem53#1.offset := read~$Pointer$(main_~users~0#1.base, 8 + main_~users~0#1.offset, 4);call main_#t~mem54#1.base, main_#t~mem54#1.offset := read~$Pointer$(main_#t~mem53#1.base, 16 + main_#t~mem53#1.offset, 4);call write~$Pointer$(main_~user~0#1.base, main_~user~0#1.offset, main_#t~mem54#1.base, 8 + main_#t~mem54#1.offset, 4);havoc main_#t~mem53#1.base, main_#t~mem53#1.offset;havoc main_#t~mem54#1.base, main_#t~mem54#1.offset;call main_#t~mem55#1.base, main_#t~mem55#1.offset := read~$Pointer$(main_~users~0#1.base, 8 + main_~users~0#1.offset, 4);call write~$Pointer$(main_~user~0#1.base, 8 + main_~user~0#1.offset, main_#t~mem55#1.base, 16 + main_#t~mem55#1.offset, 4);havoc main_#t~mem55#1.base, main_#t~mem55#1.offset; {5989#(< |ULTIMATE.start_main_~i~0#1| 9)} is VALID [2022-02-21 03:20:57,306 INFO L290 TraceCheckUtils]: 39: Hoare triple {5989#(< |ULTIMATE.start_main_~i~0#1| 9)} assume !(main_~users~0#1.base == 0 && main_~users~0#1.offset == 0);call main_#t~mem48#1.base, main_#t~mem48#1.offset := read~$Pointer$(main_~users~0#1.base, 8 + main_~users~0#1.offset, 4);call write~$Pointer$(main_#t~mem48#1.base, main_#t~mem48#1.offset, main_~user~0#1.base, 8 + main_~user~0#1.offset, 4);havoc main_#t~mem48#1.base, main_#t~mem48#1.offset; {5989#(< |ULTIMATE.start_main_~i~0#1| 9)} is VALID [2022-02-21 03:20:57,306 INFO L290 TraceCheckUtils]: 38: Hoare triple {5989#(< |ULTIMATE.start_main_~i~0#1| 9)} call write~int(main_~_ha_hashv~0#1, main_~user~0#1.base, 36 + main_~user~0#1.offset, 4);call write~$Pointer$(main_~user~0#1.base, main_~user~0#1.offset, main_~user~0#1.base, 28 + main_~user~0#1.offset, 4);call write~int(4, main_~user~0#1.base, 32 + main_~user~0#1.offset, 4); {5989#(< |ULTIMATE.start_main_~i~0#1| 9)} is VALID [2022-02-21 03:20:57,306 INFO L290 TraceCheckUtils]: 37: Hoare triple {5989#(< |ULTIMATE.start_main_~i~0#1| 9)} goto; {5989#(< |ULTIMATE.start_main_~i~0#1| 9)} is VALID [2022-02-21 03:20:57,307 INFO L290 TraceCheckUtils]: 36: Hoare triple {5989#(< |ULTIMATE.start_main_~i~0#1| 9)} goto; {5989#(< |ULTIMATE.start_main_~i~0#1| 9)} is VALID [2022-02-21 03:20:57,307 INFO L290 TraceCheckUtils]: 35: Hoare triple {5989#(< |ULTIMATE.start_main_~i~0#1| 9)} goto; {5989#(< |ULTIMATE.start_main_~i~0#1| 9)} is VALID [2022-02-21 03:20:57,307 INFO L290 TraceCheckUtils]: 34: Hoare triple {5989#(< |ULTIMATE.start_main_~i~0#1| 9)} main_~_hj_i~0#1 := main_~_hj_i~0#1 - main_~_hj_j~0#1;main_~_hj_i~0#1 := main_~_hj_i~0#1 - main_~_ha_hashv~0#1;main_~_hj_i~0#1 := (if (1 == main_~_hj_i~0#1 || 0 == main_~_hj_i~0#1) && (1 == main_~_ha_hashv~0#1 / 8192 || 0 == main_~_ha_hashv~0#1 / 8192) then (if main_~_hj_i~0#1 == main_~_ha_hashv~0#1 / 8192 then 0 else 1) else (if 0 == main_~_hj_i~0#1 then main_~_ha_hashv~0#1 / 8192 else (if 0 == main_~_ha_hashv~0#1 / 8192 then main_~_hj_i~0#1 else ~bitwiseXOr(main_~_hj_i~0#1, main_~_ha_hashv~0#1 / 8192))));main_~_hj_j~0#1 := main_~_hj_j~0#1 - main_~_ha_hashv~0#1;main_~_hj_j~0#1 := main_~_hj_j~0#1 - main_~_hj_i~0#1;main_~_hj_j~0#1 := (if (1 == main_~_hj_j~0#1 || 0 == main_~_hj_j~0#1) && (1 == 256 * main_~_hj_i~0#1 || 0 == 256 * main_~_hj_i~0#1) then (if main_~_hj_j~0#1 == 256 * main_~_hj_i~0#1 then 0 else 1) else (if 0 == main_~_hj_j~0#1 then 256 * main_~_hj_i~0#1 else (if 0 == 256 * main_~_hj_i~0#1 then main_~_hj_j~0#1 else ~bitwiseXOr(main_~_hj_j~0#1, 256 * main_~_hj_i~0#1))));main_~_ha_hashv~0#1 := main_~_ha_hashv~0#1 - main_~_hj_i~0#1;main_~_ha_hashv~0#1 := main_~_ha_hashv~0#1 - main_~_hj_j~0#1;main_~_ha_hashv~0#1 := (if (1 == main_~_ha_hashv~0#1 || 0 == main_~_ha_hashv~0#1) && (1 == main_~_hj_j~0#1 / 8192 || 0 == main_~_hj_j~0#1 / 8192) then (if main_~_ha_hashv~0#1 == main_~_hj_j~0#1 / 8192 then 0 else 1) else (if 0 == main_~_ha_hashv~0#1 then main_~_hj_j~0#1 / 8192 else (if 0 == main_~_hj_j~0#1 / 8192 then main_~_ha_hashv~0#1 else ~bitwiseXOr(main_~_ha_hashv~0#1, main_~_hj_j~0#1 / 8192))));main_~_hj_i~0#1 := main_~_hj_i~0#1 - main_~_hj_j~0#1;main_~_hj_i~0#1 := main_~_hj_i~0#1 - main_~_ha_hashv~0#1;main_~_hj_i~0#1 := (if (1 == main_~_hj_i~0#1 || 0 == main_~_hj_i~0#1) && (1 == main_~_ha_hashv~0#1 / 4096 || 0 == main_~_ha_hashv~0#1 / 4096) then (if main_~_hj_i~0#1 == main_~_ha_hashv~0#1 / 4096 then 0 else 1) else (if 0 == main_~_hj_i~0#1 then main_~_ha_hashv~0#1 / 4096 else (if 0 == main_~_ha_hashv~0#1 / 4096 then main_~_hj_i~0#1 else ~bitwiseXOr(main_~_hj_i~0#1, main_~_ha_hashv~0#1 / 4096))));main_~_hj_j~0#1 := main_~_hj_j~0#1 - main_~_ha_hashv~0#1;main_~_hj_j~0#1 := main_~_hj_j~0#1 - main_~_hj_i~0#1;main_~_hj_j~0#1 := (if (1 == main_~_hj_j~0#1 || 0 == main_~_hj_j~0#1) && (1 == 65536 * main_~_hj_i~0#1 || 0 == 65536 * main_~_hj_i~0#1) then (if main_~_hj_j~0#1 == 65536 * main_~_hj_i~0#1 then 0 else 1) else (if 0 == main_~_hj_j~0#1 then 65536 * main_~_hj_i~0#1 else (if 0 == 65536 * main_~_hj_i~0#1 then main_~_hj_j~0#1 else ~bitwiseXOr(main_~_hj_j~0#1, 65536 * main_~_hj_i~0#1))));main_~_ha_hashv~0#1 := main_~_ha_hashv~0#1 - main_~_hj_i~0#1;main_~_ha_hashv~0#1 := main_~_ha_hashv~0#1 - main_~_hj_j~0#1;main_~_ha_hashv~0#1 := (if (1 == main_~_ha_hashv~0#1 || 0 == main_~_ha_hashv~0#1) && (1 == main_~_hj_j~0#1 / 32 || 0 == main_~_hj_j~0#1 / 32) then (if main_~_ha_hashv~0#1 == main_~_hj_j~0#1 / 32 then 0 else 1) else (if 0 == main_~_ha_hashv~0#1 then main_~_hj_j~0#1 / 32 else (if 0 == main_~_hj_j~0#1 / 32 then main_~_ha_hashv~0#1 else ~bitwiseXOr(main_~_ha_hashv~0#1, main_~_hj_j~0#1 / 32))));main_~_hj_i~0#1 := main_~_hj_i~0#1 - main_~_hj_j~0#1;main_~_hj_i~0#1 := main_~_hj_i~0#1 - main_~_ha_hashv~0#1;main_~_hj_i~0#1 := (if (1 == main_~_hj_i~0#1 || 0 == main_~_hj_i~0#1) && (1 == main_~_ha_hashv~0#1 / 8 || 0 == main_~_ha_hashv~0#1 / 8) then (if main_~_hj_i~0#1 == main_~_ha_hashv~0#1 / 8 then 0 else 1) else (if 0 == main_~_hj_i~0#1 then main_~_ha_hashv~0#1 / 8 else (if 0 == main_~_ha_hashv~0#1 / 8 then main_~_hj_i~0#1 else ~bitwiseXOr(main_~_hj_i~0#1, main_~_ha_hashv~0#1 / 8))));main_~_hj_j~0#1 := main_~_hj_j~0#1 - main_~_ha_hashv~0#1;main_~_hj_j~0#1 := main_~_hj_j~0#1 - main_~_hj_i~0#1;main_~_hj_j~0#1 := (if (1 == main_~_hj_j~0#1 || 0 == main_~_hj_j~0#1) && (1 == 1024 * main_~_hj_i~0#1 || 0 == 1024 * main_~_hj_i~0#1) then (if main_~_hj_j~0#1 == 1024 * main_~_hj_i~0#1 then 0 else 1) else (if 0 == main_~_hj_j~0#1 then 1024 * main_~_hj_i~0#1 else (if 0 == 1024 * main_~_hj_i~0#1 then main_~_hj_j~0#1 else ~bitwiseXOr(main_~_hj_j~0#1, 1024 * main_~_hj_i~0#1))));main_~_ha_hashv~0#1 := main_~_ha_hashv~0#1 - main_~_hj_i~0#1;main_~_ha_hashv~0#1 := main_~_ha_hashv~0#1 - main_~_hj_j~0#1;main_~_ha_hashv~0#1 := (if (1 == main_~_ha_hashv~0#1 || 0 == main_~_ha_hashv~0#1) && (1 == main_~_hj_j~0#1 / 32768 || 0 == main_~_hj_j~0#1 / 32768) then (if main_~_ha_hashv~0#1 == main_~_hj_j~0#1 / 32768 then 0 else 1) else (if 0 == main_~_ha_hashv~0#1 then main_~_hj_j~0#1 / 32768 else (if 0 == main_~_hj_j~0#1 / 32768 then main_~_ha_hashv~0#1 else ~bitwiseXOr(main_~_ha_hashv~0#1, main_~_hj_j~0#1 / 32768)))); {5989#(< |ULTIMATE.start_main_~i~0#1| 9)} is VALID [2022-02-21 03:20:57,308 INFO L290 TraceCheckUtils]: 33: Hoare triple {5989#(< |ULTIMATE.start_main_~i~0#1| 9)} havoc main_#t~switch19#1; {5989#(< |ULTIMATE.start_main_~i~0#1| 9)} is VALID [2022-02-21 03:20:57,308 INFO L290 TraceCheckUtils]: 32: Hoare triple {5989#(< |ULTIMATE.start_main_~i~0#1| 9)} assume main_#t~switch19#1;call main_#t~mem30#1 := read~int(main_~_hj_key~0#1.base, main_~_hj_key~0#1.offset, 1);main_~_hj_i~0#1 := main_~_hj_i~0#1 + main_#t~mem30#1 % 256;havoc main_#t~mem30#1; {5989#(< |ULTIMATE.start_main_~i~0#1| 9)} is VALID [2022-02-21 03:20:57,308 INFO L290 TraceCheckUtils]: 31: Hoare triple {5989#(< |ULTIMATE.start_main_~i~0#1| 9)} main_#t~switch19#1 := main_#t~switch19#1 || 1 == main_~_hj_k~0#1; {5989#(< |ULTIMATE.start_main_~i~0#1| 9)} is VALID [2022-02-21 03:20:57,309 INFO L290 TraceCheckUtils]: 30: Hoare triple {5989#(< |ULTIMATE.start_main_~i~0#1| 9)} assume main_#t~switch19#1;call main_#t~mem29#1 := read~int(main_~_hj_key~0#1.base, 1 + main_~_hj_key~0#1.offset, 1);main_~_hj_i~0#1 := main_~_hj_i~0#1 + 256 * (main_#t~mem29#1 % 256);havoc main_#t~mem29#1; {5989#(< |ULTIMATE.start_main_~i~0#1| 9)} is VALID [2022-02-21 03:20:57,309 INFO L290 TraceCheckUtils]: 29: Hoare triple {5989#(< |ULTIMATE.start_main_~i~0#1| 9)} main_#t~switch19#1 := main_#t~switch19#1 || 2 == main_~_hj_k~0#1; {5989#(< |ULTIMATE.start_main_~i~0#1| 9)} is VALID [2022-02-21 03:20:57,309 INFO L290 TraceCheckUtils]: 28: Hoare triple {5989#(< |ULTIMATE.start_main_~i~0#1| 9)} assume main_#t~switch19#1;call main_#t~mem28#1 := read~int(main_~_hj_key~0#1.base, 2 + main_~_hj_key~0#1.offset, 1);main_~_hj_i~0#1 := main_~_hj_i~0#1 + 65536 * (main_#t~mem28#1 % 256);havoc main_#t~mem28#1; {5989#(< |ULTIMATE.start_main_~i~0#1| 9)} is VALID [2022-02-21 03:20:57,309 INFO L290 TraceCheckUtils]: 27: Hoare triple {5989#(< |ULTIMATE.start_main_~i~0#1| 9)} main_#t~switch19#1 := main_#t~switch19#1 || 3 == main_~_hj_k~0#1; {5989#(< |ULTIMATE.start_main_~i~0#1| 9)} is VALID [2022-02-21 03:20:57,310 INFO L290 TraceCheckUtils]: 26: Hoare triple {5989#(< |ULTIMATE.start_main_~i~0#1| 9)} assume main_#t~switch19#1;call main_#t~mem27#1 := read~int(main_~_hj_key~0#1.base, 3 + main_~_hj_key~0#1.offset, 1);main_~_hj_i~0#1 := main_~_hj_i~0#1 + 16777216 * (main_#t~mem27#1 % 256);havoc main_#t~mem27#1; {5989#(< |ULTIMATE.start_main_~i~0#1| 9)} is VALID [2022-02-21 03:20:57,310 INFO L290 TraceCheckUtils]: 25: Hoare triple {5989#(< |ULTIMATE.start_main_~i~0#1| 9)} main_#t~switch19#1 := main_#t~switch19#1 || 4 == main_~_hj_k~0#1; {5989#(< |ULTIMATE.start_main_~i~0#1| 9)} is VALID [2022-02-21 03:20:57,310 INFO L290 TraceCheckUtils]: 24: Hoare triple {5989#(< |ULTIMATE.start_main_~i~0#1| 9)} assume !main_#t~switch19#1; {5989#(< |ULTIMATE.start_main_~i~0#1| 9)} is VALID [2022-02-21 03:20:57,311 INFO L290 TraceCheckUtils]: 23: Hoare triple {5989#(< |ULTIMATE.start_main_~i~0#1| 9)} main_#t~switch19#1 := main_#t~switch19#1 || 5 == main_~_hj_k~0#1; {5989#(< |ULTIMATE.start_main_~i~0#1| 9)} is VALID [2022-02-21 03:20:57,311 INFO L290 TraceCheckUtils]: 22: Hoare triple {5989#(< |ULTIMATE.start_main_~i~0#1| 9)} assume !main_#t~switch19#1; {5989#(< |ULTIMATE.start_main_~i~0#1| 9)} is VALID [2022-02-21 03:20:57,311 INFO L290 TraceCheckUtils]: 21: Hoare triple {5989#(< |ULTIMATE.start_main_~i~0#1| 9)} main_#t~switch19#1 := main_#t~switch19#1 || 6 == main_~_hj_k~0#1; {5989#(< |ULTIMATE.start_main_~i~0#1| 9)} is VALID [2022-02-21 03:20:57,311 INFO L290 TraceCheckUtils]: 20: Hoare triple {5989#(< |ULTIMATE.start_main_~i~0#1| 9)} assume !main_#t~switch19#1; {5989#(< |ULTIMATE.start_main_~i~0#1| 9)} is VALID [2022-02-21 03:20:57,312 INFO L290 TraceCheckUtils]: 19: Hoare triple {5989#(< |ULTIMATE.start_main_~i~0#1| 9)} main_#t~switch19#1 := main_#t~switch19#1 || 7 == main_~_hj_k~0#1; {5989#(< |ULTIMATE.start_main_~i~0#1| 9)} is VALID [2022-02-21 03:20:57,312 INFO L290 TraceCheckUtils]: 18: Hoare triple {5989#(< |ULTIMATE.start_main_~i~0#1| 9)} assume !main_#t~switch19#1; {5989#(< |ULTIMATE.start_main_~i~0#1| 9)} is VALID [2022-02-21 03:20:57,313 INFO L290 TraceCheckUtils]: 17: Hoare triple {5989#(< |ULTIMATE.start_main_~i~0#1| 9)} main_#t~switch19#1 := main_#t~switch19#1 || 8 == main_~_hj_k~0#1; {5989#(< |ULTIMATE.start_main_~i~0#1| 9)} is VALID [2022-02-21 03:20:57,313 INFO L290 TraceCheckUtils]: 16: Hoare triple {5989#(< |ULTIMATE.start_main_~i~0#1| 9)} assume !main_#t~switch19#1; {5989#(< |ULTIMATE.start_main_~i~0#1| 9)} is VALID [2022-02-21 03:20:57,313 INFO L290 TraceCheckUtils]: 15: Hoare triple {5989#(< |ULTIMATE.start_main_~i~0#1| 9)} main_#t~switch19#1 := main_#t~switch19#1 || 9 == main_~_hj_k~0#1; {5989#(< |ULTIMATE.start_main_~i~0#1| 9)} is VALID [2022-02-21 03:20:57,313 INFO L290 TraceCheckUtils]: 14: Hoare triple {5989#(< |ULTIMATE.start_main_~i~0#1| 9)} assume !main_#t~switch19#1; {5989#(< |ULTIMATE.start_main_~i~0#1| 9)} is VALID [2022-02-21 03:20:57,314 INFO L290 TraceCheckUtils]: 13: Hoare triple {5989#(< |ULTIMATE.start_main_~i~0#1| 9)} main_#t~switch19#1 := main_#t~switch19#1 || 10 == main_~_hj_k~0#1; {5989#(< |ULTIMATE.start_main_~i~0#1| 9)} is VALID [2022-02-21 03:20:57,314 INFO L290 TraceCheckUtils]: 12: Hoare triple {5989#(< |ULTIMATE.start_main_~i~0#1| 9)} assume !main_#t~switch19#1; {5989#(< |ULTIMATE.start_main_~i~0#1| 9)} is VALID [2022-02-21 03:20:57,314 INFO L290 TraceCheckUtils]: 11: Hoare triple {5989#(< |ULTIMATE.start_main_~i~0#1| 9)} main_~_ha_hashv~0#1 := 4 + main_~_ha_hashv~0#1;main_#t~switch19#1 := 11 == main_~_hj_k~0#1; {5989#(< |ULTIMATE.start_main_~i~0#1| 9)} is VALID [2022-02-21 03:20:57,315 INFO L290 TraceCheckUtils]: 10: Hoare triple {5989#(< |ULTIMATE.start_main_~i~0#1| 9)} assume !(main_~_hj_k~0#1 % 4294967296 >= 12); {5989#(< |ULTIMATE.start_main_~i~0#1| 9)} is VALID [2022-02-21 03:20:57,315 INFO L290 TraceCheckUtils]: 9: Hoare triple {5989#(< |ULTIMATE.start_main_~i~0#1| 9)} havoc main_~_hj_i~0#1;havoc main_~_hj_j~0#1;havoc main_~_hj_k~0#1;main_~_hj_key~0#1.base, main_~_hj_key~0#1.offset := main_~user~0#1.base, main_~user~0#1.offset;main_~_ha_hashv~0#1 := 4276993775;main_~_hj_j~0#1 := 2654435769;main_~_hj_i~0#1 := main_~_hj_j~0#1;main_~_hj_k~0#1 := 4; {5989#(< |ULTIMATE.start_main_~i~0#1| 9)} is VALID [2022-02-21 03:20:57,315 INFO L290 TraceCheckUtils]: 8: Hoare triple {5989#(< |ULTIMATE.start_main_~i~0#1| 9)} goto; {5989#(< |ULTIMATE.start_main_~i~0#1| 9)} is VALID [2022-02-21 03:20:57,315 INFO L290 TraceCheckUtils]: 7: Hoare triple {5989#(< |ULTIMATE.start_main_~i~0#1| 9)} havoc main_~_ha_hashv~0#1; {5989#(< |ULTIMATE.start_main_~i~0#1| 9)} is VALID [2022-02-21 03:20:57,316 INFO L290 TraceCheckUtils]: 6: Hoare triple {5989#(< |ULTIMATE.start_main_~i~0#1| 9)} assume main_~i~0#1 * main_~i~0#1 >= -2147483648;call write~int(main_~i~0#1 * main_~i~0#1, main_~user~0#1.base, 4 + main_~user~0#1.offset, 4); {5989#(< |ULTIMATE.start_main_~i~0#1| 9)} is VALID [2022-02-21 03:20:57,316 INFO L290 TraceCheckUtils]: 5: Hoare triple {5989#(< |ULTIMATE.start_main_~i~0#1| 9)} assume main_~i~0#1 * main_~i~0#1 <= 2147483647; {5989#(< |ULTIMATE.start_main_~i~0#1| 9)} is VALID [2022-02-21 03:20:57,316 INFO L290 TraceCheckUtils]: 4: Hoare triple {5989#(< |ULTIMATE.start_main_~i~0#1| 9)} call write~int(main_~i~0#1, main_~user~0#1.base, main_~user~0#1.offset, 4); {5989#(< |ULTIMATE.start_main_~i~0#1| 9)} is VALID [2022-02-21 03:20:57,317 INFO L290 TraceCheckUtils]: 3: Hoare triple {5989#(< |ULTIMATE.start_main_~i~0#1| 9)} assume !(main_~user~0#1.base == 0 && main_~user~0#1.offset == 0); {5989#(< |ULTIMATE.start_main_~i~0#1| 9)} is VALID [2022-02-21 03:20:57,317 INFO L290 TraceCheckUtils]: 2: Hoare triple {5989#(< |ULTIMATE.start_main_~i~0#1| 9)} assume !!(main_~i~0#1 < 10);call main_#t~malloc6#1.base, main_#t~malloc6#1.offset := #Ultimate.allocOnHeap(40);main_~user~0#1.base, main_~user~0#1.offset := main_#t~malloc6#1.base, main_#t~malloc6#1.offset;havoc main_#t~malloc6#1.base, main_#t~malloc6#1.offset; {5989#(< |ULTIMATE.start_main_~i~0#1| 9)} is VALID [2022-02-21 03:20:57,317 INFO L290 TraceCheckUtils]: 1: Hoare triple {5781#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc6#1.base, main_#t~malloc6#1.offset, main_#t~mem8#1, main_#t~mem7#1, main_#t~mem9#1, main_#t~mem10#1, main_#t~mem12#1, main_#t~mem11#1, main_#t~mem13#1, main_#t~mem14#1, main_#t~mem16#1, main_#t~mem15#1, main_#t~mem17#1, main_#t~mem18#1, main_#t~switch19#1, main_#t~mem20#1, main_#t~mem21#1, main_#t~mem22#1, main_#t~mem23#1, main_#t~mem24#1, main_#t~mem25#1, main_#t~mem26#1, main_#t~mem27#1, main_#t~mem28#1, main_#t~mem29#1, main_#t~mem30#1, main_~_hj_i~0#1, main_~_hj_j~0#1, main_~_hj_k~0#1, main_~_hj_key~0#1.base, main_~_hj_key~0#1.offset, main_#t~malloc31#1.base, main_#t~malloc31#1.offset, main_#t~mem32#1.base, main_#t~mem32#1.offset, main_#t~mem33#1.base, main_#t~mem33#1.offset, main_#t~memset~res34#1.base, main_#t~memset~res34#1.offset, main_#t~mem35#1.base, main_#t~mem35#1.offset, main_#t~mem36#1.base, main_#t~mem36#1.offset, main_#t~mem37#1.base, main_#t~mem37#1.offset, main_#t~mem38#1.base, main_#t~mem38#1.offset, main_#t~mem39#1.base, main_#t~mem39#1.offset, main_#t~malloc40#1.base, main_#t~malloc40#1.offset, main_#t~mem41#1.base, main_#t~mem41#1.offset, main_#t~mem42#1.base, main_#t~mem42#1.offset, main_#t~mem43#1.base, main_#t~mem43#1.offset, main_#t~mem44#1.base, main_#t~mem44#1.offset, main_#t~mem45#1.base, main_#t~mem45#1.offset, main_#t~mem46#1.base, main_#t~mem46#1.offset, main_#t~memset~res47#1.base, main_#t~memset~res47#1.offset, main_#t~mem48#1.base, main_#t~mem48#1.offset, main_#t~mem49#1.base, main_#t~mem49#1.offset, main_#t~mem50#1.base, main_#t~mem50#1.offset, main_#t~mem51#1.base, main_#t~mem51#1.offset, main_#t~mem52#1, main_#t~mem53#1.base, main_#t~mem53#1.offset, main_#t~mem54#1.base, main_#t~mem54#1.offset, main_#t~mem55#1.base, main_#t~mem55#1.offset, main_#t~mem56#1.base, main_#t~mem56#1.offset, main_#t~mem57#1, main_#t~post58#1, main_#t~mem59#1.base, main_#t~mem59#1.offset, main_#t~mem60#1, main_#t~mem61#1.base, main_#t~mem61#1.offset, main_#t~mem62#1.base, main_#t~mem62#1.offset, main_#t~mem63#1, main_#t~post64#1, main_#t~mem65#1.base, main_#t~mem65#1.offset, main_#t~mem66#1.base, main_#t~mem66#1.offset, main_#t~mem67#1.base, main_#t~mem67#1.offset, main_#t~mem69#1, main_#t~mem68#1, main_#t~mem70#1.base, main_#t~mem70#1.offset, main_#t~mem71#1, main_#t~short72#1, main_#t~mem73#1.base, main_#t~mem73#1.offset, main_#t~mem74#1, main_#t~malloc75#1.base, main_#t~malloc75#1.offset, main_#t~mem76#1.base, main_#t~mem76#1.offset, main_#t~mem77#1.base, main_#t~mem77#1.offset, main_#t~mem78#1.base, main_#t~mem78#1.offset, main_#t~mem79#1, main_#t~memset~res80#1.base, main_#t~memset~res80#1.offset, main_#t~mem81#1.base, main_#t~mem81#1.offset, main_#t~mem82#1.base, main_#t~mem82#1.offset, main_#t~mem85#1, main_#t~mem83#1.base, main_#t~mem83#1.offset, main_#t~mem84#1, main_#t~mem86#1.base, main_#t~mem86#1.offset, main_#t~mem89#1, main_#t~mem87#1.base, main_#t~mem87#1.offset, main_#t~mem88#1, main_#t~ite90#1, main_#t~mem91#1.base, main_#t~mem91#1.offset, main_#t~mem95#1.base, main_#t~mem95#1.offset, main_#t~mem96#1.base, main_#t~mem96#1.offset, main_#t~mem97#1.base, main_#t~mem97#1.offset, main_#t~mem98#1.base, main_#t~mem98#1.offset, main_#t~mem101#1, main_#t~mem99#1.base, main_#t~mem99#1.offset, main_#t~mem100#1, main_#t~mem102#1.base, main_#t~mem102#1.offset, main_#t~mem103#1, main_#t~pre104#1, main_#t~mem105#1.base, main_#t~mem105#1.offset, main_#t~mem106#1, main_#t~mem107#1.base, main_#t~mem107#1.offset, main_#t~mem108#1, main_#t~post109#1, main_#t~mem113#1, main_#t~mem111#1, main_#t~mem110#1.base, main_#t~mem110#1.offset, main_#t~mem112#1, main_#t~mem114#1, main_#t~post115#1, main_#t~mem116#1.base, main_#t~mem116#1.offset, main_#t~mem117#1.base, main_#t~mem117#1.offset, main_#t~mem118#1.base, main_#t~mem118#1.offset, main_#t~post92#1, main_#t~mem93#1.base, main_#t~mem93#1.offset, main_#t~mem94#1, main_#t~mem119#1.base, main_#t~mem119#1.offset, main_#t~mem120#1.base, main_#t~mem120#1.offset, main_#t~mem121#1.base, main_#t~mem121#1.offset, main_#t~mem122#1, main_#t~mem123#1.base, main_#t~mem123#1.offset, main_#t~mem124#1, main_#t~post125#1, main_#t~mem126#1.base, main_#t~mem126#1.offset, main_#t~mem127#1.base, main_#t~mem127#1.offset, main_#t~mem128#1.base, main_#t~mem128#1.offset, main_#t~mem129#1.base, main_#t~mem129#1.offset, main_#t~mem132#1, main_#t~mem130#1.base, main_#t~mem130#1.offset, main_#t~mem131#1, main_#t~ite135#1, main_#t~mem133#1.base, main_#t~mem133#1.offset, main_#t~mem134#1, main_#t~mem136#1.base, main_#t~mem136#1.offset, main_#t~mem137#1, main_#t~mem138#1.base, main_#t~mem138#1.offset, main_~_he_bkt~0#1, main_~_he_bkt_i~0#1, main_~_he_thh~0#1.base, main_~_he_thh~0#1.offset, main_~_he_hh_nxt~0#1.base, main_~_he_hh_nxt~0#1.offset, main_~#_he_new_buckets~0#1.base, main_~#_he_new_buckets~0#1.offset, main_~_he_newbkt~0#1.base, main_~_he_newbkt~0#1.offset, main_~_ha_head~0#1.base, main_~_ha_head~0#1.offset, main_~_ha_bkt~0#1, main_~_ha_hashv~0#1, main_#t~post5#1, main_#t~mem140#1, main_#t~mem141#1, main_#t~mem139#1.base, main_#t~mem139#1.offset, main_#t~ite143#1.base, main_#t~ite143#1.offset, main_#t~mem142#1.base, main_#t~mem142#1.offset, main_#t~mem146#1.base, main_#t~mem146#1.offset, main_#t~mem147#1.base, main_#t~mem147#1.offset, main_#t~short148#1, main_#t~mem149#1.base, main_#t~mem149#1.offset, main_#t~mem150#1.base, main_#t~mem150#1.offset, main_#t~mem151#1.base, main_#t~mem151#1.offset, main_#t~mem152#1.base, main_#t~mem152#1.offset, main_#t~mem153#1.base, main_#t~mem153#1.offset, main_#t~mem154#1.base, main_#t~mem154#1.offset, main_#t~mem155#1.base, main_#t~mem155#1.offset, main_#t~mem156#1.base, main_#t~mem156#1.offset, main_#t~mem157#1, main_#t~mem158#1.base, main_#t~mem158#1.offset, main_#t~mem159#1.base, main_#t~mem159#1.offset, main_#t~mem160#1.base, main_#t~mem160#1.offset, main_#t~mem161#1, main_#t~mem162#1.base, main_#t~mem162#1.offset, main_#t~mem163#1.base, main_#t~mem163#1.offset, main_#t~mem164#1.base, main_#t~mem164#1.offset, main_#t~mem165#1.base, main_#t~mem165#1.offset, main_#t~mem166#1.base, main_#t~mem166#1.offset, main_#t~mem167#1, main_#t~mem168#1.base, main_#t~mem168#1.offset, main_#t~mem171#1, main_#t~mem169#1.base, main_#t~mem169#1.offset, main_#t~mem170#1, main_#t~mem172#1.base, main_#t~mem172#1.offset, main_#t~mem173#1.base, main_#t~mem173#1.offset, main_#t~mem174#1, main_#t~post175#1, 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.base, main_#t~mem181#1.offset, main_#t~mem182#1.base, main_#t~mem182#1.offset, main_#t~mem183#1.base, main_#t~mem183#1.offset, main_~_hd_head~0#1.base, main_~_hd_head~0#1.offset, main_#t~mem184#1.base, main_#t~mem184#1.offset, main_#t~mem185#1, main_#t~post186#1, main_~_hd_bkt~0#1, main_~_hd_hh_del~0#1.base, main_~_hd_hh_del~0#1.offset, main_#t~ite145#1.base, main_#t~ite145#1.offset, main_#t~mem144#1.base, main_#t~mem144#1.offset, main_~i~0#1, main_~user~0#1.base, main_~user~0#1.offset, main_~users~0#1.base, main_~users~0#1.offset, main_~temp~0#1.base, main_~temp~0#1.offset;havoc main_~i~0#1;havoc main_~user~0#1.base, main_~user~0#1.offset;main_~users~0#1.base, main_~users~0#1.offset := 0, 0;main_~i~0#1 := 0; {5989#(< |ULTIMATE.start_main_~i~0#1| 9)} is VALID [2022-02-21 03:20:57,317 INFO L290 TraceCheckUtils]: 0: Hoare triple {5781#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(21, 2);~count_int_int~0 := 0; {5781#true} is VALID [2022-02-21 03:20:57,318 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-21 03:20:57,318 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 03:20:57,318 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1671180338] [2022-02-21 03:20:57,318 WARN L317 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-02-21 03:20:57,318 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2074412475] [2022-02-21 03:20:57,318 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2074412475] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-21 03:20:57,318 INFO L191 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-02-21 03:20:57,318 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2022-02-21 03:20:57,319 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1347765855] [2022-02-21 03:20:57,319 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-02-21 03:20:57,319 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 14.75) internal successors, (118), 8 states have internal predecessors, (118), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 61 [2022-02-21 03:20:57,319 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-21 03:20:57,320 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 8 states, 8 states have (on average 14.75) internal successors, (118), 8 states have internal predecessors, (118), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:20:57,403 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 118 edges. 118 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:20:57,404 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-02-21 03:20:57,404 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 03:20:57,404 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-02-21 03:20:57,404 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2022-02-21 03:20:57,405 INFO L87 Difference]: Start difference. First operand 234 states and 294 transitions. Second operand has 8 states, 8 states have (on average 14.75) internal successors, (118), 8 states have internal predecessors, (118), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:20:58,730 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:20:58,731 INFO L93 Difference]: Finished difference Result 367 states and 469 transitions. [2022-02-21 03:20:58,731 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-02-21 03:20:58,731 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 14.75) internal successors, (118), 8 states have internal predecessors, (118), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 61 [2022-02-21 03:20:58,731 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-21 03:20:58,731 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 14.75) internal successors, (118), 8 states have internal predecessors, (118), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:20:58,734 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 451 transitions. [2022-02-21 03:20:58,735 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 14.75) internal successors, (118), 8 states have internal predecessors, (118), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:20:58,737 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 451 transitions. [2022-02-21 03:20:58,737 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states and 451 transitions. [2022-02-21 03:20:59,086 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 451 edges. 451 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:20:59,091 INFO L225 Difference]: With dead ends: 367 [2022-02-21 03:20:59,091 INFO L226 Difference]: Without dead ends: 333 [2022-02-21 03:20:59,091 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 122 GetRequests, 114 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=35, Invalid=55, Unknown=0, NotChecked=0, Total=90 [2022-02-21 03:20:59,094 INFO L933 BasicCegarLoop]: 199 mSDtfsCounter, 493 mSDsluCounter, 515 mSDsCounter, 0 mSdLazyCounter, 42 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 502 SdHoareTripleChecker+Valid, 714 SdHoareTripleChecker+Invalid, 56 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 42 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-21 03:20:59,094 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [502 Valid, 714 Invalid, 56 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 42 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-21 03:20:59,095 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 333 states. [2022-02-21 03:20:59,178 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 333 to 333. [2022-02-21 03:20:59,178 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 03:20:59,179 INFO L82 GeneralOperation]: Start isEquivalent. First operand 333 states. Second operand has 333 states, 308 states have (on average 1.2207792207792207) internal successors, (376), 321 states have internal predecessors, (376), 19 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (19), 10 states have call predecessors, (19), 19 states have call successors, (19) [2022-02-21 03:20:59,179 INFO L74 IsIncluded]: Start isIncluded. First operand 333 states. Second operand has 333 states, 308 states have (on average 1.2207792207792207) internal successors, (376), 321 states have internal predecessors, (376), 19 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (19), 10 states have call predecessors, (19), 19 states have call successors, (19) [2022-02-21 03:20:59,180 INFO L87 Difference]: Start difference. First operand 333 states. Second operand has 333 states, 308 states have (on average 1.2207792207792207) internal successors, (376), 321 states have internal predecessors, (376), 19 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (19), 10 states have call predecessors, (19), 19 states have call successors, (19) [2022-02-21 03:20:59,187 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:20:59,188 INFO L93 Difference]: Finished difference Result 333 states and 414 transitions. [2022-02-21 03:20:59,188 INFO L276 IsEmpty]: Start isEmpty. Operand 333 states and 414 transitions. [2022-02-21 03:20:59,188 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:20:59,188 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:20:59,189 INFO L74 IsIncluded]: Start isIncluded. First operand has 333 states, 308 states have (on average 1.2207792207792207) internal successors, (376), 321 states have internal predecessors, (376), 19 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (19), 10 states have call predecessors, (19), 19 states have call successors, (19) Second operand 333 states. [2022-02-21 03:20:59,190 INFO L87 Difference]: Start difference. First operand has 333 states, 308 states have (on average 1.2207792207792207) internal successors, (376), 321 states have internal predecessors, (376), 19 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (19), 10 states have call predecessors, (19), 19 states have call successors, (19) Second operand 333 states. [2022-02-21 03:20:59,195 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:20:59,196 INFO L93 Difference]: Finished difference Result 333 states and 414 transitions. [2022-02-21 03:20:59,196 INFO L276 IsEmpty]: Start isEmpty. Operand 333 states and 414 transitions. [2022-02-21 03:20:59,196 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:20:59,196 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:20:59,196 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 03:20:59,197 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 03:20:59,197 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 333 states, 308 states have (on average 1.2207792207792207) internal successors, (376), 321 states have internal predecessors, (376), 19 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (19), 10 states have call predecessors, (19), 19 states have call successors, (19) [2022-02-21 03:20:59,203 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 333 states to 333 states and 414 transitions. [2022-02-21 03:20:59,203 INFO L78 Accepts]: Start accepts. Automaton has 333 states and 414 transitions. Word has length 61 [2022-02-21 03:20:59,203 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-21 03:20:59,203 INFO L470 AbstractCegarLoop]: Abstraction has 333 states and 414 transitions. [2022-02-21 03:20:59,203 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 14.75) internal successors, (118), 8 states have internal predecessors, (118), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:20:59,203 INFO L276 IsEmpty]: Start isEmpty. Operand 333 states and 414 transitions. [2022-02-21 03:20:59,204 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2022-02-21 03:20:59,204 INFO L506 BasicCegarLoop]: Found error trace [2022-02-21 03:20:59,204 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-21 03:20:59,225 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-02-21 03:20:59,415 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-21 03:20:59,416 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2022-02-21 03:20:59,416 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:20:59,416 INFO L85 PathProgramCache]: Analyzing trace with hash 1237285228, now seen corresponding path program 1 times [2022-02-21 03:20:59,416 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:20:59,416 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1070781354] [2022-02-21 03:20:59,416 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:20:59,417 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:20:59,518 ERROR L252 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-02-21 03:20:59,518 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1751375991] [2022-02-21 03:20:59,519 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:20:59,519 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-21 03:20:59,519 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:20:59,536 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-02-21 03:20:59,577 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-02-21 03:21:00,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:21:00,304 INFO L263 TraceCheckSpWp]: Trace formula consists of 1535 conjuncts, 5 conjunts are in the unsatisfiable core [2022-02-21 03:21:00,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:21:00,332 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 03:21:00,595 INFO L290 TraceCheckUtils]: 0: Hoare triple {7668#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(21, 2);~count_int_int~0 := 0; {7668#true} is VALID [2022-02-21 03:21:00,596 INFO L290 TraceCheckUtils]: 1: Hoare triple {7668#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc6#1.base, main_#t~malloc6#1.offset, main_#t~mem8#1, main_#t~mem7#1, main_#t~mem9#1, main_#t~mem10#1, main_#t~mem12#1, main_#t~mem11#1, main_#t~mem13#1, main_#t~mem14#1, main_#t~mem16#1, main_#t~mem15#1, main_#t~mem17#1, main_#t~mem18#1, main_#t~switch19#1, main_#t~mem20#1, main_#t~mem21#1, main_#t~mem22#1, main_#t~mem23#1, main_#t~mem24#1, main_#t~mem25#1, main_#t~mem26#1, main_#t~mem27#1, main_#t~mem28#1, main_#t~mem29#1, main_#t~mem30#1, main_~_hj_i~0#1, main_~_hj_j~0#1, main_~_hj_k~0#1, main_~_hj_key~0#1.base, main_~_hj_key~0#1.offset, main_#t~malloc31#1.base, main_#t~malloc31#1.offset, main_#t~mem32#1.base, main_#t~mem32#1.offset, main_#t~mem33#1.base, main_#t~mem33#1.offset, main_#t~memset~res34#1.base, main_#t~memset~res34#1.offset, main_#t~mem35#1.base, main_#t~mem35#1.offset, main_#t~mem36#1.base, main_#t~mem36#1.offset, main_#t~mem37#1.base, main_#t~mem37#1.offset, main_#t~mem38#1.base, main_#t~mem38#1.offset, main_#t~mem39#1.base, main_#t~mem39#1.offset, main_#t~malloc40#1.base, main_#t~malloc40#1.offset, main_#t~mem41#1.base, main_#t~mem41#1.offset, main_#t~mem42#1.base, main_#t~mem42#1.offset, main_#t~mem43#1.base, main_#t~mem43#1.offset, main_#t~mem44#1.base, main_#t~mem44#1.offset, main_#t~mem45#1.base, main_#t~mem45#1.offset, main_#t~mem46#1.base, main_#t~mem46#1.offset, main_#t~memset~res47#1.base, main_#t~memset~res47#1.offset, main_#t~mem48#1.base, main_#t~mem48#1.offset, main_#t~mem49#1.base, main_#t~mem49#1.offset, main_#t~mem50#1.base, main_#t~mem50#1.offset, main_#t~mem51#1.base, main_#t~mem51#1.offset, main_#t~mem52#1, main_#t~mem53#1.base, main_#t~mem53#1.offset, main_#t~mem54#1.base, main_#t~mem54#1.offset, main_#t~mem55#1.base, main_#t~mem55#1.offset, main_#t~mem56#1.base, main_#t~mem56#1.offset, main_#t~mem57#1, main_#t~post58#1, main_#t~mem59#1.base, main_#t~mem59#1.offset, main_#t~mem60#1, main_#t~mem61#1.base, main_#t~mem61#1.offset, main_#t~mem62#1.base, main_#t~mem62#1.offset, main_#t~mem63#1, main_#t~post64#1, main_#t~mem65#1.base, main_#t~mem65#1.offset, main_#t~mem66#1.base, main_#t~mem66#1.offset, main_#t~mem67#1.base, main_#t~mem67#1.offset, main_#t~mem69#1, main_#t~mem68#1, main_#t~mem70#1.base, main_#t~mem70#1.offset, main_#t~mem71#1, main_#t~short72#1, main_#t~mem73#1.base, main_#t~mem73#1.offset, main_#t~mem74#1, main_#t~malloc75#1.base, main_#t~malloc75#1.offset, main_#t~mem76#1.base, main_#t~mem76#1.offset, main_#t~mem77#1.base, main_#t~mem77#1.offset, main_#t~mem78#1.base, main_#t~mem78#1.offset, main_#t~mem79#1, main_#t~memset~res80#1.base, main_#t~memset~res80#1.offset, main_#t~mem81#1.base, main_#t~mem81#1.offset, main_#t~mem82#1.base, main_#t~mem82#1.offset, main_#t~mem85#1, main_#t~mem83#1.base, main_#t~mem83#1.offset, main_#t~mem84#1, main_#t~mem86#1.base, main_#t~mem86#1.offset, main_#t~mem89#1, main_#t~mem87#1.base, main_#t~mem87#1.offset, main_#t~mem88#1, main_#t~ite90#1, main_#t~mem91#1.base, main_#t~mem91#1.offset, main_#t~mem95#1.base, main_#t~mem95#1.offset, main_#t~mem96#1.base, main_#t~mem96#1.offset, main_#t~mem97#1.base, main_#t~mem97#1.offset, main_#t~mem98#1.base, main_#t~mem98#1.offset, main_#t~mem101#1, main_#t~mem99#1.base, main_#t~mem99#1.offset, main_#t~mem100#1, main_#t~mem102#1.base, main_#t~mem102#1.offset, main_#t~mem103#1, main_#t~pre104#1, main_#t~mem105#1.base, main_#t~mem105#1.offset, main_#t~mem106#1, main_#t~mem107#1.base, main_#t~mem107#1.offset, main_#t~mem108#1, main_#t~post109#1, main_#t~mem113#1, main_#t~mem111#1, main_#t~mem110#1.base, main_#t~mem110#1.offset, main_#t~mem112#1, main_#t~mem114#1, main_#t~post115#1, main_#t~mem116#1.base, main_#t~mem116#1.offset, main_#t~mem117#1.base, main_#t~mem117#1.offset, main_#t~mem118#1.base, main_#t~mem118#1.offset, main_#t~post92#1, main_#t~mem93#1.base, main_#t~mem93#1.offset, main_#t~mem94#1, main_#t~mem119#1.base, main_#t~mem119#1.offset, main_#t~mem120#1.base, main_#t~mem120#1.offset, main_#t~mem121#1.base, main_#t~mem121#1.offset, main_#t~mem122#1, main_#t~mem123#1.base, main_#t~mem123#1.offset, main_#t~mem124#1, main_#t~post125#1, main_#t~mem126#1.base, main_#t~mem126#1.offset, main_#t~mem127#1.base, main_#t~mem127#1.offset, main_#t~mem128#1.base, main_#t~mem128#1.offset, main_#t~mem129#1.base, main_#t~mem129#1.offset, main_#t~mem132#1, main_#t~mem130#1.base, main_#t~mem130#1.offset, main_#t~mem131#1, main_#t~ite135#1, main_#t~mem133#1.base, main_#t~mem133#1.offset, main_#t~mem134#1, main_#t~mem136#1.base, main_#t~mem136#1.offset, main_#t~mem137#1, main_#t~mem138#1.base, main_#t~mem138#1.offset, main_~_he_bkt~0#1, main_~_he_bkt_i~0#1, main_~_he_thh~0#1.base, main_~_he_thh~0#1.offset, main_~_he_hh_nxt~0#1.base, main_~_he_hh_nxt~0#1.offset, main_~#_he_new_buckets~0#1.base, main_~#_he_new_buckets~0#1.offset, main_~_he_newbkt~0#1.base, main_~_he_newbkt~0#1.offset, main_~_ha_head~0#1.base, main_~_ha_head~0#1.offset, main_~_ha_bkt~0#1, main_~_ha_hashv~0#1, main_#t~post5#1, main_#t~mem140#1, main_#t~mem141#1, main_#t~mem139#1.base, main_#t~mem139#1.offset, main_#t~ite143#1.base, main_#t~ite143#1.offset, main_#t~mem142#1.base, main_#t~mem142#1.offset, main_#t~mem146#1.base, main_#t~mem146#1.offset, main_#t~mem147#1.base, main_#t~mem147#1.offset, main_#t~short148#1, main_#t~mem149#1.base, main_#t~mem149#1.offset, main_#t~mem150#1.base, main_#t~mem150#1.offset, main_#t~mem151#1.base, main_#t~mem151#1.offset, main_#t~mem152#1.base, main_#t~mem152#1.offset, main_#t~mem153#1.base, main_#t~mem153#1.offset, main_#t~mem154#1.base, main_#t~mem154#1.offset, main_#t~mem155#1.base, main_#t~mem155#1.offset, main_#t~mem156#1.base, main_#t~mem156#1.offset, main_#t~mem157#1, main_#t~mem158#1.base, main_#t~mem158#1.offset, main_#t~mem159#1.base, main_#t~mem159#1.offset, main_#t~mem160#1.base, main_#t~mem160#1.offset, main_#t~mem161#1, main_#t~mem162#1.base, main_#t~mem162#1.offset, main_#t~mem163#1.base, main_#t~mem163#1.offset, main_#t~mem164#1.base, main_#t~mem164#1.offset, main_#t~mem165#1.base, main_#t~mem165#1.offset, main_#t~mem166#1.base, main_#t~mem166#1.offset, main_#t~mem167#1, main_#t~mem168#1.base, main_#t~mem168#1.offset, main_#t~mem171#1, main_#t~mem169#1.base, main_#t~mem169#1.offset, main_#t~mem170#1, main_#t~mem172#1.base, main_#t~mem172#1.offset, main_#t~mem173#1.base, main_#t~mem173#1.offset, main_#t~mem174#1, main_#t~post175#1, 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.base, main_#t~mem181#1.offset, main_#t~mem182#1.base, main_#t~mem182#1.offset, main_#t~mem183#1.base, main_#t~mem183#1.offset, main_~_hd_head~0#1.base, main_~_hd_head~0#1.offset, main_#t~mem184#1.base, main_#t~mem184#1.offset, main_#t~mem185#1, main_#t~post186#1, main_~_hd_bkt~0#1, main_~_hd_hh_del~0#1.base, main_~_hd_hh_del~0#1.offset, main_#t~ite145#1.base, main_#t~ite145#1.offset, main_#t~mem144#1.base, main_#t~mem144#1.offset, main_~i~0#1, main_~user~0#1.base, main_~user~0#1.offset, main_~users~0#1.base, main_~users~0#1.offset, main_~temp~0#1.base, main_~temp~0#1.offset;havoc main_~i~0#1;havoc main_~user~0#1.base, main_~user~0#1.offset;main_~users~0#1.base, main_~users~0#1.offset := 0, 0;main_~i~0#1 := 0; {7676#(and (= |ULTIMATE.start_main_~users~0#1.offset| 0) (= |ULTIMATE.start_main_~users~0#1.base| 0))} is VALID [2022-02-21 03:21:00,597 INFO L290 TraceCheckUtils]: 2: Hoare triple {7676#(and (= |ULTIMATE.start_main_~users~0#1.offset| 0) (= |ULTIMATE.start_main_~users~0#1.base| 0))} assume !!(main_~i~0#1 < 10);call main_#t~malloc6#1.base, main_#t~malloc6#1.offset := #Ultimate.allocOnHeap(40);main_~user~0#1.base, main_~user~0#1.offset := main_#t~malloc6#1.base, main_#t~malloc6#1.offset;havoc main_#t~malloc6#1.base, main_#t~malloc6#1.offset; {7676#(and (= |ULTIMATE.start_main_~users~0#1.offset| 0) (= |ULTIMATE.start_main_~users~0#1.base| 0))} is VALID [2022-02-21 03:21:00,597 INFO L290 TraceCheckUtils]: 3: Hoare triple {7676#(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); {7676#(and (= |ULTIMATE.start_main_~users~0#1.offset| 0) (= |ULTIMATE.start_main_~users~0#1.base| 0))} is VALID [2022-02-21 03:21:00,598 INFO L290 TraceCheckUtils]: 4: Hoare triple {7676#(and (= |ULTIMATE.start_main_~users~0#1.offset| 0) (= |ULTIMATE.start_main_~users~0#1.base| 0))} call write~int(main_~i~0#1, main_~user~0#1.base, main_~user~0#1.offset, 4); {7676#(and (= |ULTIMATE.start_main_~users~0#1.offset| 0) (= |ULTIMATE.start_main_~users~0#1.base| 0))} is VALID [2022-02-21 03:21:00,598 INFO L290 TraceCheckUtils]: 5: Hoare triple {7676#(and (= |ULTIMATE.start_main_~users~0#1.offset| 0) (= |ULTIMATE.start_main_~users~0#1.base| 0))} assume main_~i~0#1 * main_~i~0#1 <= 2147483647; {7676#(and (= |ULTIMATE.start_main_~users~0#1.offset| 0) (= |ULTIMATE.start_main_~users~0#1.base| 0))} is VALID [2022-02-21 03:21:00,599 INFO L290 TraceCheckUtils]: 6: Hoare triple {7676#(and (= |ULTIMATE.start_main_~users~0#1.offset| 0) (= |ULTIMATE.start_main_~users~0#1.base| 0))} assume main_~i~0#1 * main_~i~0#1 >= -2147483648;call write~int(main_~i~0#1 * main_~i~0#1, main_~user~0#1.base, 4 + main_~user~0#1.offset, 4); {7676#(and (= |ULTIMATE.start_main_~users~0#1.offset| 0) (= |ULTIMATE.start_main_~users~0#1.base| 0))} is VALID [2022-02-21 03:21:00,599 INFO L290 TraceCheckUtils]: 7: Hoare triple {7676#(and (= |ULTIMATE.start_main_~users~0#1.offset| 0) (= |ULTIMATE.start_main_~users~0#1.base| 0))} havoc main_~_ha_hashv~0#1; {7676#(and (= |ULTIMATE.start_main_~users~0#1.offset| 0) (= |ULTIMATE.start_main_~users~0#1.base| 0))} is VALID [2022-02-21 03:21:00,600 INFO L290 TraceCheckUtils]: 8: Hoare triple {7676#(and (= |ULTIMATE.start_main_~users~0#1.offset| 0) (= |ULTIMATE.start_main_~users~0#1.base| 0))} goto; {7676#(and (= |ULTIMATE.start_main_~users~0#1.offset| 0) (= |ULTIMATE.start_main_~users~0#1.base| 0))} is VALID [2022-02-21 03:21:00,600 INFO L290 TraceCheckUtils]: 9: Hoare triple {7676#(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; {7676#(and (= |ULTIMATE.start_main_~users~0#1.offset| 0) (= |ULTIMATE.start_main_~users~0#1.base| 0))} is VALID [2022-02-21 03:21:00,600 INFO L290 TraceCheckUtils]: 10: Hoare triple {7676#(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); {7676#(and (= |ULTIMATE.start_main_~users~0#1.offset| 0) (= |ULTIMATE.start_main_~users~0#1.base| 0))} is VALID [2022-02-21 03:21:00,601 INFO L290 TraceCheckUtils]: 11: Hoare triple {7676#(and (= |ULTIMATE.start_main_~users~0#1.offset| 0) (= |ULTIMATE.start_main_~users~0#1.base| 0))} main_~_ha_hashv~0#1 := 4 + main_~_ha_hashv~0#1;main_#t~switch19#1 := 11 == main_~_hj_k~0#1; {7676#(and (= |ULTIMATE.start_main_~users~0#1.offset| 0) (= |ULTIMATE.start_main_~users~0#1.base| 0))} is VALID [2022-02-21 03:21:00,601 INFO L290 TraceCheckUtils]: 12: Hoare triple {7676#(and (= |ULTIMATE.start_main_~users~0#1.offset| 0) (= |ULTIMATE.start_main_~users~0#1.base| 0))} assume !main_#t~switch19#1; {7676#(and (= |ULTIMATE.start_main_~users~0#1.offset| 0) (= |ULTIMATE.start_main_~users~0#1.base| 0))} is VALID [2022-02-21 03:21:00,602 INFO L290 TraceCheckUtils]: 13: Hoare triple {7676#(and (= |ULTIMATE.start_main_~users~0#1.offset| 0) (= |ULTIMATE.start_main_~users~0#1.base| 0))} main_#t~switch19#1 := main_#t~switch19#1 || 10 == main_~_hj_k~0#1; {7676#(and (= |ULTIMATE.start_main_~users~0#1.offset| 0) (= |ULTIMATE.start_main_~users~0#1.base| 0))} is VALID [2022-02-21 03:21:00,602 INFO L290 TraceCheckUtils]: 14: Hoare triple {7676#(and (= |ULTIMATE.start_main_~users~0#1.offset| 0) (= |ULTIMATE.start_main_~users~0#1.base| 0))} assume !main_#t~switch19#1; {7676#(and (= |ULTIMATE.start_main_~users~0#1.offset| 0) (= |ULTIMATE.start_main_~users~0#1.base| 0))} is VALID [2022-02-21 03:21:00,602 INFO L290 TraceCheckUtils]: 15: Hoare triple {7676#(and (= |ULTIMATE.start_main_~users~0#1.offset| 0) (= |ULTIMATE.start_main_~users~0#1.base| 0))} main_#t~switch19#1 := main_#t~switch19#1 || 9 == main_~_hj_k~0#1; {7676#(and (= |ULTIMATE.start_main_~users~0#1.offset| 0) (= |ULTIMATE.start_main_~users~0#1.base| 0))} is VALID [2022-02-21 03:21:00,603 INFO L290 TraceCheckUtils]: 16: Hoare triple {7676#(and (= |ULTIMATE.start_main_~users~0#1.offset| 0) (= |ULTIMATE.start_main_~users~0#1.base| 0))} assume !main_#t~switch19#1; {7676#(and (= |ULTIMATE.start_main_~users~0#1.offset| 0) (= |ULTIMATE.start_main_~users~0#1.base| 0))} is VALID [2022-02-21 03:21:00,603 INFO L290 TraceCheckUtils]: 17: Hoare triple {7676#(and (= |ULTIMATE.start_main_~users~0#1.offset| 0) (= |ULTIMATE.start_main_~users~0#1.base| 0))} main_#t~switch19#1 := main_#t~switch19#1 || 8 == main_~_hj_k~0#1; {7676#(and (= |ULTIMATE.start_main_~users~0#1.offset| 0) (= |ULTIMATE.start_main_~users~0#1.base| 0))} is VALID [2022-02-21 03:21:00,604 INFO L290 TraceCheckUtils]: 18: Hoare triple {7676#(and (= |ULTIMATE.start_main_~users~0#1.offset| 0) (= |ULTIMATE.start_main_~users~0#1.base| 0))} assume !main_#t~switch19#1; {7676#(and (= |ULTIMATE.start_main_~users~0#1.offset| 0) (= |ULTIMATE.start_main_~users~0#1.base| 0))} is VALID [2022-02-21 03:21:00,604 INFO L290 TraceCheckUtils]: 19: Hoare triple {7676#(and (= |ULTIMATE.start_main_~users~0#1.offset| 0) (= |ULTIMATE.start_main_~users~0#1.base| 0))} main_#t~switch19#1 := main_#t~switch19#1 || 7 == main_~_hj_k~0#1; {7676#(and (= |ULTIMATE.start_main_~users~0#1.offset| 0) (= |ULTIMATE.start_main_~users~0#1.base| 0))} is VALID [2022-02-21 03:21:00,604 INFO L290 TraceCheckUtils]: 20: Hoare triple {7676#(and (= |ULTIMATE.start_main_~users~0#1.offset| 0) (= |ULTIMATE.start_main_~users~0#1.base| 0))} assume !main_#t~switch19#1; {7676#(and (= |ULTIMATE.start_main_~users~0#1.offset| 0) (= |ULTIMATE.start_main_~users~0#1.base| 0))} is VALID [2022-02-21 03:21:00,605 INFO L290 TraceCheckUtils]: 21: Hoare triple {7676#(and (= |ULTIMATE.start_main_~users~0#1.offset| 0) (= |ULTIMATE.start_main_~users~0#1.base| 0))} main_#t~switch19#1 := main_#t~switch19#1 || 6 == main_~_hj_k~0#1; {7676#(and (= |ULTIMATE.start_main_~users~0#1.offset| 0) (= |ULTIMATE.start_main_~users~0#1.base| 0))} is VALID [2022-02-21 03:21:00,605 INFO L290 TraceCheckUtils]: 22: Hoare triple {7676#(and (= |ULTIMATE.start_main_~users~0#1.offset| 0) (= |ULTIMATE.start_main_~users~0#1.base| 0))} assume !main_#t~switch19#1; {7676#(and (= |ULTIMATE.start_main_~users~0#1.offset| 0) (= |ULTIMATE.start_main_~users~0#1.base| 0))} is VALID [2022-02-21 03:21:00,606 INFO L290 TraceCheckUtils]: 23: Hoare triple {7676#(and (= |ULTIMATE.start_main_~users~0#1.offset| 0) (= |ULTIMATE.start_main_~users~0#1.base| 0))} main_#t~switch19#1 := main_#t~switch19#1 || 5 == main_~_hj_k~0#1; {7676#(and (= |ULTIMATE.start_main_~users~0#1.offset| 0) (= |ULTIMATE.start_main_~users~0#1.base| 0))} is VALID [2022-02-21 03:21:00,606 INFO L290 TraceCheckUtils]: 24: Hoare triple {7676#(and (= |ULTIMATE.start_main_~users~0#1.offset| 0) (= |ULTIMATE.start_main_~users~0#1.base| 0))} assume !main_#t~switch19#1; {7676#(and (= |ULTIMATE.start_main_~users~0#1.offset| 0) (= |ULTIMATE.start_main_~users~0#1.base| 0))} is VALID [2022-02-21 03:21:00,606 INFO L290 TraceCheckUtils]: 25: Hoare triple {7676#(and (= |ULTIMATE.start_main_~users~0#1.offset| 0) (= |ULTIMATE.start_main_~users~0#1.base| 0))} main_#t~switch19#1 := main_#t~switch19#1 || 4 == main_~_hj_k~0#1; {7676#(and (= |ULTIMATE.start_main_~users~0#1.offset| 0) (= |ULTIMATE.start_main_~users~0#1.base| 0))} is VALID [2022-02-21 03:21:00,607 INFO L290 TraceCheckUtils]: 26: Hoare triple {7676#(and (= |ULTIMATE.start_main_~users~0#1.offset| 0) (= |ULTIMATE.start_main_~users~0#1.base| 0))} assume main_#t~switch19#1;call main_#t~mem27#1 := read~int(main_~_hj_key~0#1.base, 3 + main_~_hj_key~0#1.offset, 1);main_~_hj_i~0#1 := main_~_hj_i~0#1 + 16777216 * (main_#t~mem27#1 % 256);havoc main_#t~mem27#1; {7676#(and (= |ULTIMATE.start_main_~users~0#1.offset| 0) (= |ULTIMATE.start_main_~users~0#1.base| 0))} is VALID [2022-02-21 03:21:00,607 INFO L290 TraceCheckUtils]: 27: Hoare triple {7676#(and (= |ULTIMATE.start_main_~users~0#1.offset| 0) (= |ULTIMATE.start_main_~users~0#1.base| 0))} main_#t~switch19#1 := main_#t~switch19#1 || 3 == main_~_hj_k~0#1; {7676#(and (= |ULTIMATE.start_main_~users~0#1.offset| 0) (= |ULTIMATE.start_main_~users~0#1.base| 0))} is VALID [2022-02-21 03:21:00,608 INFO L290 TraceCheckUtils]: 28: Hoare triple {7676#(and (= |ULTIMATE.start_main_~users~0#1.offset| 0) (= |ULTIMATE.start_main_~users~0#1.base| 0))} assume main_#t~switch19#1;call main_#t~mem28#1 := read~int(main_~_hj_key~0#1.base, 2 + main_~_hj_key~0#1.offset, 1);main_~_hj_i~0#1 := main_~_hj_i~0#1 + 65536 * (main_#t~mem28#1 % 256);havoc main_#t~mem28#1; {7676#(and (= |ULTIMATE.start_main_~users~0#1.offset| 0) (= |ULTIMATE.start_main_~users~0#1.base| 0))} is VALID [2022-02-21 03:21:00,608 INFO L290 TraceCheckUtils]: 29: Hoare triple {7676#(and (= |ULTIMATE.start_main_~users~0#1.offset| 0) (= |ULTIMATE.start_main_~users~0#1.base| 0))} main_#t~switch19#1 := main_#t~switch19#1 || 2 == main_~_hj_k~0#1; {7676#(and (= |ULTIMATE.start_main_~users~0#1.offset| 0) (= |ULTIMATE.start_main_~users~0#1.base| 0))} is VALID [2022-02-21 03:21:00,609 INFO L290 TraceCheckUtils]: 30: Hoare triple {7676#(and (= |ULTIMATE.start_main_~users~0#1.offset| 0) (= |ULTIMATE.start_main_~users~0#1.base| 0))} assume main_#t~switch19#1;call main_#t~mem29#1 := read~int(main_~_hj_key~0#1.base, 1 + main_~_hj_key~0#1.offset, 1);main_~_hj_i~0#1 := main_~_hj_i~0#1 + 256 * (main_#t~mem29#1 % 256);havoc main_#t~mem29#1; {7676#(and (= |ULTIMATE.start_main_~users~0#1.offset| 0) (= |ULTIMATE.start_main_~users~0#1.base| 0))} is VALID [2022-02-21 03:21:00,609 INFO L290 TraceCheckUtils]: 31: Hoare triple {7676#(and (= |ULTIMATE.start_main_~users~0#1.offset| 0) (= |ULTIMATE.start_main_~users~0#1.base| 0))} main_#t~switch19#1 := main_#t~switch19#1 || 1 == main_~_hj_k~0#1; {7676#(and (= |ULTIMATE.start_main_~users~0#1.offset| 0) (= |ULTIMATE.start_main_~users~0#1.base| 0))} is VALID [2022-02-21 03:21:00,609 INFO L290 TraceCheckUtils]: 32: Hoare triple {7676#(and (= |ULTIMATE.start_main_~users~0#1.offset| 0) (= |ULTIMATE.start_main_~users~0#1.base| 0))} assume main_#t~switch19#1;call main_#t~mem30#1 := read~int(main_~_hj_key~0#1.base, main_~_hj_key~0#1.offset, 1);main_~_hj_i~0#1 := main_~_hj_i~0#1 + main_#t~mem30#1 % 256;havoc main_#t~mem30#1; {7676#(and (= |ULTIMATE.start_main_~users~0#1.offset| 0) (= |ULTIMATE.start_main_~users~0#1.base| 0))} is VALID [2022-02-21 03:21:00,610 INFO L290 TraceCheckUtils]: 33: Hoare triple {7676#(and (= |ULTIMATE.start_main_~users~0#1.offset| 0) (= |ULTIMATE.start_main_~users~0#1.base| 0))} havoc main_#t~switch19#1; {7676#(and (= |ULTIMATE.start_main_~users~0#1.offset| 0) (= |ULTIMATE.start_main_~users~0#1.base| 0))} is VALID [2022-02-21 03:21:00,611 INFO L290 TraceCheckUtils]: 34: Hoare triple {7676#(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)))); {7676#(and (= |ULTIMATE.start_main_~users~0#1.offset| 0) (= |ULTIMATE.start_main_~users~0#1.base| 0))} is VALID [2022-02-21 03:21:00,612 INFO L290 TraceCheckUtils]: 35: Hoare triple {7676#(and (= |ULTIMATE.start_main_~users~0#1.offset| 0) (= |ULTIMATE.start_main_~users~0#1.base| 0))} goto; {7676#(and (= |ULTIMATE.start_main_~users~0#1.offset| 0) (= |ULTIMATE.start_main_~users~0#1.base| 0))} is VALID [2022-02-21 03:21:00,612 INFO L290 TraceCheckUtils]: 36: Hoare triple {7676#(and (= |ULTIMATE.start_main_~users~0#1.offset| 0) (= |ULTIMATE.start_main_~users~0#1.base| 0))} goto; {7676#(and (= |ULTIMATE.start_main_~users~0#1.offset| 0) (= |ULTIMATE.start_main_~users~0#1.base| 0))} is VALID [2022-02-21 03:21:00,612 INFO L290 TraceCheckUtils]: 37: Hoare triple {7676#(and (= |ULTIMATE.start_main_~users~0#1.offset| 0) (= |ULTIMATE.start_main_~users~0#1.base| 0))} goto; {7676#(and (= |ULTIMATE.start_main_~users~0#1.offset| 0) (= |ULTIMATE.start_main_~users~0#1.base| 0))} is VALID [2022-02-21 03:21:00,613 INFO L290 TraceCheckUtils]: 38: Hoare triple {7676#(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); {7676#(and (= |ULTIMATE.start_main_~users~0#1.offset| 0) (= |ULTIMATE.start_main_~users~0#1.base| 0))} is VALID [2022-02-21 03:21:00,613 INFO L290 TraceCheckUtils]: 39: Hoare triple {7676#(and (= |ULTIMATE.start_main_~users~0#1.offset| 0) (= |ULTIMATE.start_main_~users~0#1.base| 0))} assume !(main_~users~0#1.base == 0 && main_~users~0#1.offset == 0);call main_#t~mem48#1.base, main_#t~mem48#1.offset := read~$Pointer$(main_~users~0#1.base, 8 + main_~users~0#1.offset, 4);call write~$Pointer$(main_#t~mem48#1.base, main_#t~mem48#1.offset, main_~user~0#1.base, 8 + main_~user~0#1.offset, 4);havoc main_#t~mem48#1.base, main_#t~mem48#1.offset; {7669#false} is VALID [2022-02-21 03:21:00,614 INFO L290 TraceCheckUtils]: 40: Hoare triple {7669#false} call write~$Pointer$(0, 0, main_~user~0#1.base, 16 + main_~user~0#1.offset, 4);call main_#t~mem49#1.base, main_#t~mem49#1.offset := read~$Pointer$(main_~users~0#1.base, 8 + main_~users~0#1.offset, 4);call main_#t~mem50#1.base, main_#t~mem50#1.offset := read~$Pointer$(main_#t~mem49#1.base, 16 + main_#t~mem49#1.offset, 4);call main_#t~mem51#1.base, main_#t~mem51#1.offset := read~$Pointer$(main_~users~0#1.base, 8 + main_~users~0#1.offset, 4);call main_#t~mem52#1 := read~int(main_#t~mem51#1.base, 20 + main_#t~mem51#1.offset, 4);call write~$Pointer$(main_#t~mem50#1.base, main_#t~mem50#1.offset - main_#t~mem52#1, main_~user~0#1.base, 12 + main_~user~0#1.offset, 4);havoc main_#t~mem49#1.base, main_#t~mem49#1.offset;havoc main_#t~mem50#1.base, main_#t~mem50#1.offset;havoc main_#t~mem51#1.base, main_#t~mem51#1.offset;havoc main_#t~mem52#1;call main_#t~mem53#1.base, main_#t~mem53#1.offset := read~$Pointer$(main_~users~0#1.base, 8 + main_~users~0#1.offset, 4);call main_#t~mem54#1.base, main_#t~mem54#1.offset := read~$Pointer$(main_#t~mem53#1.base, 16 + main_#t~mem53#1.offset, 4);call write~$Pointer$(main_~user~0#1.base, main_~user~0#1.offset, main_#t~mem54#1.base, 8 + main_#t~mem54#1.offset, 4);havoc main_#t~mem53#1.base, main_#t~mem53#1.offset;havoc main_#t~mem54#1.base, main_#t~mem54#1.offset;call main_#t~mem55#1.base, main_#t~mem55#1.offset := read~$Pointer$(main_~users~0#1.base, 8 + main_~users~0#1.offset, 4);call write~$Pointer$(main_~user~0#1.base, 8 + main_~user~0#1.offset, main_#t~mem55#1.base, 16 + main_#t~mem55#1.offset, 4);havoc main_#t~mem55#1.base, main_#t~mem55#1.offset; {7669#false} is VALID [2022-02-21 03:21:00,614 INFO L290 TraceCheckUtils]: 41: Hoare triple {7669#false} goto; {7669#false} is VALID [2022-02-21 03:21:00,614 INFO L290 TraceCheckUtils]: 42: Hoare triple {7669#false} havoc main_~_ha_bkt~0#1;call main_#t~mem56#1.base, main_#t~mem56#1.offset := read~$Pointer$(main_~users~0#1.base, 8 + main_~users~0#1.offset, 4);call main_#t~mem57#1 := read~int(main_#t~mem56#1.base, 12 + main_#t~mem56#1.offset, 4);main_#t~post58#1 := main_#t~mem57#1;call write~int(1 + main_#t~post58#1, main_#t~mem56#1.base, 12 + main_#t~mem56#1.offset, 4);havoc main_#t~mem56#1.base, main_#t~mem56#1.offset;havoc main_#t~mem57#1;havoc main_#t~post58#1; {7669#false} is VALID [2022-02-21 03:21:00,614 INFO L290 TraceCheckUtils]: 43: Hoare triple {7669#false} call main_#t~mem59#1.base, main_#t~mem59#1.offset := read~$Pointer$(main_~users~0#1.base, 8 + main_~users~0#1.offset, 4);call main_#t~mem60#1 := read~int(main_#t~mem59#1.base, 4 + main_#t~mem59#1.offset, 4);main_~_ha_bkt~0#1 := (if 0 == main_~_ha_hashv~0#1 || 0 == main_#t~mem60#1 - 1 then 0 else (if 1 == main_#t~mem60#1 - 1 then (if 1 == main_~_ha_hashv~0#1 || 0 == main_~_ha_hashv~0#1 then main_~_ha_hashv~0#1 else (if main_~_ha_hashv~0#1 >= 0 then main_~_ha_hashv~0#1 % 2 else ~bitwiseAnd(main_~_ha_hashv~0#1, main_#t~mem60#1 - 1))) else (if 1 == main_~_ha_hashv~0#1 then (if 1 == main_#t~mem60#1 - 1 || 0 == main_#t~mem60#1 - 1 then main_#t~mem60#1 - 1 else (if main_#t~mem60#1 - 1 >= 0 then (main_#t~mem60#1 - 1) % 2 else ~bitwiseAnd(main_~_ha_hashv~0#1, main_#t~mem60#1 - 1))) else ~bitwiseAnd(main_~_ha_hashv~0#1, main_#t~mem60#1 - 1))));havoc main_#t~mem59#1.base, main_#t~mem59#1.offset;havoc main_#t~mem60#1; {7669#false} is VALID [2022-02-21 03:21:00,614 INFO L290 TraceCheckUtils]: 44: Hoare triple {7669#false} goto; {7669#false} is VALID [2022-02-21 03:21:00,614 INFO L290 TraceCheckUtils]: 45: Hoare triple {7669#false} call main_#t~mem61#1.base, main_#t~mem61#1.offset := read~$Pointer$(main_~users~0#1.base, 8 + main_~users~0#1.offset, 4);call main_#t~mem62#1.base, main_#t~mem62#1.offset := read~$Pointer$(main_#t~mem61#1.base, main_#t~mem61#1.offset, 4);main_~_ha_head~0#1.base, main_~_ha_head~0#1.offset := main_#t~mem62#1.base, main_#t~mem62#1.offset + 12 * (if main_~_ha_bkt~0#1 % 4294967296 % 4294967296 <= 2147483647 then main_~_ha_bkt~0#1 % 4294967296 % 4294967296 else main_~_ha_bkt~0#1 % 4294967296 % 4294967296 - 4294967296);havoc main_#t~mem61#1.base, main_#t~mem61#1.offset;havoc main_#t~mem62#1.base, main_#t~mem62#1.offset;call main_#t~mem63#1 := read~int(main_~_ha_head~0#1.base, 4 + main_~_ha_head~0#1.offset, 4);main_#t~post64#1 := main_#t~mem63#1;call write~int(1 + main_#t~post64#1, main_~_ha_head~0#1.base, 4 + main_~_ha_head~0#1.offset, 4);havoc main_#t~mem63#1;havoc main_#t~post64#1;call main_#t~mem65#1.base, main_#t~mem65#1.offset := read~$Pointer$(main_~_ha_head~0#1.base, main_~_ha_head~0#1.offset, 4);call write~$Pointer$(main_#t~mem65#1.base, main_#t~mem65#1.offset, main_~user~0#1.base, 24 + main_~user~0#1.offset, 4);havoc main_#t~mem65#1.base, main_#t~mem65#1.offset;call write~$Pointer$(0, 0, main_~user~0#1.base, 20 + main_~user~0#1.offset, 4);call main_#t~mem66#1.base, main_#t~mem66#1.offset := read~$Pointer$(main_~_ha_head~0#1.base, main_~_ha_head~0#1.offset, 4); {7669#false} is VALID [2022-02-21 03:21:00,614 INFO L290 TraceCheckUtils]: 46: Hoare triple {7669#false} assume main_#t~mem66#1.base != 0 || main_#t~mem66#1.offset != 0;havoc main_#t~mem66#1.base, main_#t~mem66#1.offset;call main_#t~mem67#1.base, main_#t~mem67#1.offset := read~$Pointer$(main_~_ha_head~0#1.base, main_~_ha_head~0#1.offset, 4);call write~$Pointer$(main_~user~0#1.base, 8 + main_~user~0#1.offset, main_#t~mem67#1.base, 12 + main_#t~mem67#1.offset, 4);havoc main_#t~mem67#1.base, main_#t~mem67#1.offset; {7669#false} is VALID [2022-02-21 03:21:00,614 INFO L290 TraceCheckUtils]: 47: Hoare triple {7669#false} call write~$Pointer$(main_~user~0#1.base, 8 + main_~user~0#1.offset, main_~_ha_head~0#1.base, main_~_ha_head~0#1.offset, 4);call main_#t~mem69#1 := read~int(main_~_ha_head~0#1.base, 4 + main_~_ha_head~0#1.offset, 4);call main_#t~mem68#1 := read~int(main_~_ha_head~0#1.base, 8 + main_~_ha_head~0#1.offset, 4);main_#t~short72#1 := main_#t~mem69#1 % 4294967296 >= 10 * (1 + main_#t~mem68#1) % 4294967296; {7669#false} is VALID [2022-02-21 03:21:00,614 INFO L290 TraceCheckUtils]: 48: Hoare triple {7669#false} assume main_#t~short72#1;call main_#t~mem70#1.base, main_#t~mem70#1.offset := read~$Pointer$(main_~user~0#1.base, 8 + main_~user~0#1.offset, 4);call main_#t~mem71#1 := read~int(main_#t~mem70#1.base, 36 + main_#t~mem70#1.offset, 4);main_#t~short72#1 := 0 == main_#t~mem71#1 % 4294967296; {7669#false} is VALID [2022-02-21 03:21:00,615 INFO L290 TraceCheckUtils]: 49: Hoare triple {7669#false} assume !main_#t~short72#1;havoc main_#t~mem69#1;havoc main_#t~mem68#1;havoc main_#t~mem70#1.base, main_#t~mem70#1.offset;havoc main_#t~mem71#1;havoc main_#t~short72#1; {7669#false} is VALID [2022-02-21 03:21:00,615 INFO L290 TraceCheckUtils]: 50: Hoare triple {7669#false} goto; {7669#false} is VALID [2022-02-21 03:21:00,615 INFO L290 TraceCheckUtils]: 51: Hoare triple {7669#false} goto; {7669#false} is VALID [2022-02-21 03:21:00,615 INFO L290 TraceCheckUtils]: 52: Hoare triple {7669#false} goto; {7669#false} is VALID [2022-02-21 03:21:00,615 INFO L290 TraceCheckUtils]: 53: Hoare triple {7669#false} goto; {7669#false} is VALID [2022-02-21 03:21:00,615 INFO L290 TraceCheckUtils]: 54: Hoare triple {7669#false} main_#t~post5#1 := main_~i~0#1; {7669#false} is VALID [2022-02-21 03:21:00,615 INFO L290 TraceCheckUtils]: 55: Hoare triple {7669#false} assume 1 + main_#t~post5#1 <= 2147483647; {7669#false} is VALID [2022-02-21 03:21:00,615 INFO L290 TraceCheckUtils]: 56: Hoare triple {7669#false} assume 1 + main_#t~post5#1 >= -2147483648;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; {7669#false} is VALID [2022-02-21 03:21:00,615 INFO L290 TraceCheckUtils]: 57: Hoare triple {7669#false} assume !!(main_~i~0#1 < 10);call main_#t~malloc6#1.base, main_#t~malloc6#1.offset := #Ultimate.allocOnHeap(40);main_~user~0#1.base, main_~user~0#1.offset := main_#t~malloc6#1.base, main_#t~malloc6#1.offset;havoc main_#t~malloc6#1.base, main_#t~malloc6#1.offset; {7669#false} is VALID [2022-02-21 03:21:00,616 INFO L290 TraceCheckUtils]: 58: Hoare triple {7669#false} assume !(main_~user~0#1.base == 0 && main_~user~0#1.offset == 0); {7669#false} is VALID [2022-02-21 03:21:00,616 INFO L290 TraceCheckUtils]: 59: Hoare triple {7669#false} call write~int(main_~i~0#1, main_~user~0#1.base, main_~user~0#1.offset, 4); {7669#false} is VALID [2022-02-21 03:21:00,616 INFO L290 TraceCheckUtils]: 60: Hoare triple {7669#false} assume !(main_~i~0#1 * main_~i~0#1 <= 2147483647); {7669#false} is VALID [2022-02-21 03:21:00,616 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-21 03:21:00,616 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-21 03:21:00,617 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 03:21:00,617 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1070781354] [2022-02-21 03:21:00,617 WARN L317 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-02-21 03:21:00,617 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1751375991] [2022-02-21 03:21:00,617 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1751375991] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-21 03:21:00,617 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-21 03:21:00,617 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-21 03:21:00,617 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [868890241] [2022-02-21 03:21:00,617 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-21 03:21:00,618 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 20.333333333333332) internal successors, (61), 3 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 61 [2022-02-21 03:21:00,618 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-21 03:21:00,618 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 20.333333333333332) internal successors, (61), 3 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:21:00,666 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 61 edges. 61 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:21:00,666 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-21 03:21:00,666 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 03:21:00,666 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-21 03:21:00,667 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-21 03:21:00,667 INFO L87 Difference]: Start difference. First operand 333 states and 414 transitions. Second operand has 3 states, 3 states have (on average 20.333333333333332) internal successors, (61), 3 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:21:01,106 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:21:01,107 INFO L93 Difference]: Finished difference Result 606 states and 760 transitions. [2022-02-21 03:21:01,107 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-21 03:21:01,107 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 20.333333333333332) internal successors, (61), 3 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 61 [2022-02-21 03:21:01,107 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-21 03:21:01,107 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 20.333333333333332) internal successors, (61), 3 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:21:01,110 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 389 transitions. [2022-02-21 03:21:01,110 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 20.333333333333332) internal successors, (61), 3 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:21:01,113 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 389 transitions. [2022-02-21 03:21:01,113 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 389 transitions. [2022-02-21 03:21:01,403 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 389 edges. 389 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:21:01,409 INFO L225 Difference]: With dead ends: 606 [2022-02-21 03:21:01,409 INFO L226 Difference]: Without dead ends: 331 [2022-02-21 03:21:01,409 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 59 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-21 03:21:01,410 INFO L933 BasicCegarLoop]: 171 mSDtfsCounter, 15 mSDsluCounter, 155 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 326 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-21 03:21:01,410 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [17 Valid, 326 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-21 03:21:01,410 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 331 states. [2022-02-21 03:21:01,500 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 331 to 331. [2022-02-21 03:21:01,500 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 03:21:01,501 INFO L82 GeneralOperation]: Start isEquivalent. First operand 331 states. Second operand has 331 states, 306 states have (on average 1.2189542483660132) internal successors, (373), 319 states have internal predecessors, (373), 19 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (19), 10 states have call predecessors, (19), 19 states have call successors, (19) [2022-02-21 03:21:01,502 INFO L74 IsIncluded]: Start isIncluded. First operand 331 states. Second operand has 331 states, 306 states have (on average 1.2189542483660132) internal successors, (373), 319 states have internal predecessors, (373), 19 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (19), 10 states have call predecessors, (19), 19 states have call successors, (19) [2022-02-21 03:21:01,502 INFO L87 Difference]: Start difference. First operand 331 states. Second operand has 331 states, 306 states have (on average 1.2189542483660132) internal successors, (373), 319 states have internal predecessors, (373), 19 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (19), 10 states have call predecessors, (19), 19 states have call successors, (19) [2022-02-21 03:21:01,508 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:21:01,509 INFO L93 Difference]: Finished difference Result 331 states and 411 transitions. [2022-02-21 03:21:01,509 INFO L276 IsEmpty]: Start isEmpty. Operand 331 states and 411 transitions. [2022-02-21 03:21:01,509 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:21:01,509 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:21:01,510 INFO L74 IsIncluded]: Start isIncluded. First operand has 331 states, 306 states have (on average 1.2189542483660132) internal successors, (373), 319 states have internal predecessors, (373), 19 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (19), 10 states have call predecessors, (19), 19 states have call successors, (19) Second operand 331 states. [2022-02-21 03:21:01,510 INFO L87 Difference]: Start difference. First operand has 331 states, 306 states have (on average 1.2189542483660132) internal successors, (373), 319 states have internal predecessors, (373), 19 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (19), 10 states have call predecessors, (19), 19 states have call successors, (19) Second operand 331 states. [2022-02-21 03:21:01,516 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:21:01,516 INFO L93 Difference]: Finished difference Result 331 states and 411 transitions. [2022-02-21 03:21:01,516 INFO L276 IsEmpty]: Start isEmpty. Operand 331 states and 411 transitions. [2022-02-21 03:21:01,517 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:21:01,517 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:21:01,517 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 03:21:01,517 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 03:21:01,518 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 331 states, 306 states have (on average 1.2189542483660132) internal successors, (373), 319 states have internal predecessors, (373), 19 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (19), 10 states have call predecessors, (19), 19 states have call successors, (19) [2022-02-21 03:21:01,524 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 331 states to 331 states and 411 transitions. [2022-02-21 03:21:01,524 INFO L78 Accepts]: Start accepts. Automaton has 331 states and 411 transitions. Word has length 61 [2022-02-21 03:21:01,524 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-21 03:21:01,524 INFO L470 AbstractCegarLoop]: Abstraction has 331 states and 411 transitions. [2022-02-21 03:21:01,525 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 20.333333333333332) internal successors, (61), 3 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:21:01,525 INFO L276 IsEmpty]: Start isEmpty. Operand 331 states and 411 transitions. [2022-02-21 03:21:01,525 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2022-02-21 03:21:01,525 INFO L506 BasicCegarLoop]: Found error trace [2022-02-21 03:21:01,526 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-21 03:21:01,555 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-02-21 03:21:01,755 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-21 03:21:01,755 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2022-02-21 03:21:01,756 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:21:01,756 INFO L85 PathProgramCache]: Analyzing trace with hash 233271851, now seen corresponding path program 1 times [2022-02-21 03:21:01,756 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:21:01,756 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1892046793] [2022-02-21 03:21:01,756 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:21:01,756 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:21:01,819 ERROR L252 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-02-21 03:21:01,819 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1622602950] [2022-02-21 03:21:01,819 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:21:01,819 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-21 03:21:01,819 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:21:01,823 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-02-21 03:21:01,824 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-02-21 03:21:03,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:21:03,313 INFO L263 TraceCheckSpWp]: Trace formula consists of 672 conjuncts, 7 conjunts are in the unsatisfiable core [2022-02-21 03:21:03,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:21:03,346 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 03:21:03,504 INFO L290 TraceCheckUtils]: 0: Hoare triple {9641#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(21, 2);~count_int_int~0 := 0; {9641#true} is VALID [2022-02-21 03:21:03,504 INFO L290 TraceCheckUtils]: 1: Hoare triple {9641#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc6#1.base, main_#t~malloc6#1.offset, main_#t~mem8#1, main_#t~mem7#1, main_#t~mem9#1, main_#t~mem10#1, main_#t~mem12#1, main_#t~mem11#1, main_#t~mem13#1, main_#t~mem14#1, main_#t~mem16#1, main_#t~mem15#1, main_#t~mem17#1, main_#t~mem18#1, main_#t~switch19#1, main_#t~mem20#1, main_#t~mem21#1, main_#t~mem22#1, main_#t~mem23#1, main_#t~mem24#1, main_#t~mem25#1, main_#t~mem26#1, main_#t~mem27#1, main_#t~mem28#1, main_#t~mem29#1, main_#t~mem30#1, main_~_hj_i~0#1, main_~_hj_j~0#1, main_~_hj_k~0#1, main_~_hj_key~0#1.base, main_~_hj_key~0#1.offset, main_#t~malloc31#1.base, main_#t~malloc31#1.offset, main_#t~mem32#1.base, main_#t~mem32#1.offset, main_#t~mem33#1.base, main_#t~mem33#1.offset, main_#t~memset~res34#1.base, main_#t~memset~res34#1.offset, main_#t~mem35#1.base, main_#t~mem35#1.offset, main_#t~mem36#1.base, main_#t~mem36#1.offset, main_#t~mem37#1.base, main_#t~mem37#1.offset, main_#t~mem38#1.base, main_#t~mem38#1.offset, main_#t~mem39#1.base, main_#t~mem39#1.offset, main_#t~malloc40#1.base, main_#t~malloc40#1.offset, main_#t~mem41#1.base, main_#t~mem41#1.offset, main_#t~mem42#1.base, main_#t~mem42#1.offset, main_#t~mem43#1.base, main_#t~mem43#1.offset, main_#t~mem44#1.base, main_#t~mem44#1.offset, main_#t~mem45#1.base, main_#t~mem45#1.offset, main_#t~mem46#1.base, main_#t~mem46#1.offset, main_#t~memset~res47#1.base, main_#t~memset~res47#1.offset, main_#t~mem48#1.base, main_#t~mem48#1.offset, main_#t~mem49#1.base, main_#t~mem49#1.offset, main_#t~mem50#1.base, main_#t~mem50#1.offset, main_#t~mem51#1.base, main_#t~mem51#1.offset, main_#t~mem52#1, main_#t~mem53#1.base, main_#t~mem53#1.offset, main_#t~mem54#1.base, main_#t~mem54#1.offset, main_#t~mem55#1.base, main_#t~mem55#1.offset, main_#t~mem56#1.base, main_#t~mem56#1.offset, main_#t~mem57#1, main_#t~post58#1, main_#t~mem59#1.base, main_#t~mem59#1.offset, main_#t~mem60#1, main_#t~mem61#1.base, main_#t~mem61#1.offset, main_#t~mem62#1.base, main_#t~mem62#1.offset, main_#t~mem63#1, main_#t~post64#1, main_#t~mem65#1.base, main_#t~mem65#1.offset, main_#t~mem66#1.base, main_#t~mem66#1.offset, main_#t~mem67#1.base, main_#t~mem67#1.offset, main_#t~mem69#1, main_#t~mem68#1, main_#t~mem70#1.base, main_#t~mem70#1.offset, main_#t~mem71#1, main_#t~short72#1, main_#t~mem73#1.base, main_#t~mem73#1.offset, main_#t~mem74#1, main_#t~malloc75#1.base, main_#t~malloc75#1.offset, main_#t~mem76#1.base, main_#t~mem76#1.offset, main_#t~mem77#1.base, main_#t~mem77#1.offset, main_#t~mem78#1.base, main_#t~mem78#1.offset, main_#t~mem79#1, main_#t~memset~res80#1.base, main_#t~memset~res80#1.offset, main_#t~mem81#1.base, main_#t~mem81#1.offset, main_#t~mem82#1.base, main_#t~mem82#1.offset, main_#t~mem85#1, main_#t~mem83#1.base, main_#t~mem83#1.offset, main_#t~mem84#1, main_#t~mem86#1.base, main_#t~mem86#1.offset, main_#t~mem89#1, main_#t~mem87#1.base, main_#t~mem87#1.offset, main_#t~mem88#1, main_#t~ite90#1, main_#t~mem91#1.base, main_#t~mem91#1.offset, main_#t~mem95#1.base, main_#t~mem95#1.offset, main_#t~mem96#1.base, main_#t~mem96#1.offset, main_#t~mem97#1.base, main_#t~mem97#1.offset, main_#t~mem98#1.base, main_#t~mem98#1.offset, main_#t~mem101#1, main_#t~mem99#1.base, main_#t~mem99#1.offset, main_#t~mem100#1, main_#t~mem102#1.base, main_#t~mem102#1.offset, main_#t~mem103#1, main_#t~pre104#1, main_#t~mem105#1.base, main_#t~mem105#1.offset, main_#t~mem106#1, main_#t~mem107#1.base, main_#t~mem107#1.offset, main_#t~mem108#1, main_#t~post109#1, main_#t~mem113#1, main_#t~mem111#1, main_#t~mem110#1.base, main_#t~mem110#1.offset, main_#t~mem112#1, main_#t~mem114#1, main_#t~post115#1, main_#t~mem116#1.base, main_#t~mem116#1.offset, main_#t~mem117#1.base, main_#t~mem117#1.offset, main_#t~mem118#1.base, main_#t~mem118#1.offset, main_#t~post92#1, main_#t~mem93#1.base, main_#t~mem93#1.offset, main_#t~mem94#1, main_#t~mem119#1.base, main_#t~mem119#1.offset, main_#t~mem120#1.base, main_#t~mem120#1.offset, main_#t~mem121#1.base, main_#t~mem121#1.offset, main_#t~mem122#1, main_#t~mem123#1.base, main_#t~mem123#1.offset, main_#t~mem124#1, main_#t~post125#1, main_#t~mem126#1.base, main_#t~mem126#1.offset, main_#t~mem127#1.base, main_#t~mem127#1.offset, main_#t~mem128#1.base, main_#t~mem128#1.offset, main_#t~mem129#1.base, main_#t~mem129#1.offset, main_#t~mem132#1, main_#t~mem130#1.base, main_#t~mem130#1.offset, main_#t~mem131#1, main_#t~ite135#1, main_#t~mem133#1.base, main_#t~mem133#1.offset, main_#t~mem134#1, main_#t~mem136#1.base, main_#t~mem136#1.offset, main_#t~mem137#1, main_#t~mem138#1.base, main_#t~mem138#1.offset, main_~_he_bkt~0#1, main_~_he_bkt_i~0#1, main_~_he_thh~0#1.base, main_~_he_thh~0#1.offset, main_~_he_hh_nxt~0#1.base, main_~_he_hh_nxt~0#1.offset, main_~#_he_new_buckets~0#1.base, main_~#_he_new_buckets~0#1.offset, main_~_he_newbkt~0#1.base, main_~_he_newbkt~0#1.offset, main_~_ha_head~0#1.base, main_~_ha_head~0#1.offset, main_~_ha_bkt~0#1, main_~_ha_hashv~0#1, main_#t~post5#1, main_#t~mem140#1, main_#t~mem141#1, main_#t~mem139#1.base, main_#t~mem139#1.offset, main_#t~ite143#1.base, main_#t~ite143#1.offset, main_#t~mem142#1.base, main_#t~mem142#1.offset, main_#t~mem146#1.base, main_#t~mem146#1.offset, main_#t~mem147#1.base, main_#t~mem147#1.offset, main_#t~short148#1, main_#t~mem149#1.base, main_#t~mem149#1.offset, main_#t~mem150#1.base, main_#t~mem150#1.offset, main_#t~mem151#1.base, main_#t~mem151#1.offset, main_#t~mem152#1.base, main_#t~mem152#1.offset, main_#t~mem153#1.base, main_#t~mem153#1.offset, main_#t~mem154#1.base, main_#t~mem154#1.offset, main_#t~mem155#1.base, main_#t~mem155#1.offset, main_#t~mem156#1.base, main_#t~mem156#1.offset, main_#t~mem157#1, main_#t~mem158#1.base, main_#t~mem158#1.offset, main_#t~mem159#1.base, main_#t~mem159#1.offset, main_#t~mem160#1.base, main_#t~mem160#1.offset, main_#t~mem161#1, main_#t~mem162#1.base, main_#t~mem162#1.offset, main_#t~mem163#1.base, main_#t~mem163#1.offset, main_#t~mem164#1.base, main_#t~mem164#1.offset, main_#t~mem165#1.base, main_#t~mem165#1.offset, main_#t~mem166#1.base, main_#t~mem166#1.offset, main_#t~mem167#1, main_#t~mem168#1.base, main_#t~mem168#1.offset, main_#t~mem171#1, main_#t~mem169#1.base, main_#t~mem169#1.offset, main_#t~mem170#1, main_#t~mem172#1.base, main_#t~mem172#1.offset, main_#t~mem173#1.base, main_#t~mem173#1.offset, main_#t~mem174#1, main_#t~post175#1, 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.base, main_#t~mem181#1.offset, main_#t~mem182#1.base, main_#t~mem182#1.offset, main_#t~mem183#1.base, main_#t~mem183#1.offset, main_~_hd_head~0#1.base, main_~_hd_head~0#1.offset, main_#t~mem184#1.base, main_#t~mem184#1.offset, main_#t~mem185#1, main_#t~post186#1, main_~_hd_bkt~0#1, main_~_hd_hh_del~0#1.base, main_~_hd_hh_del~0#1.offset, main_#t~ite145#1.base, main_#t~ite145#1.offset, main_#t~mem144#1.base, main_#t~mem144#1.offset, main_~i~0#1, main_~user~0#1.base, main_~user~0#1.offset, main_~users~0#1.base, main_~users~0#1.offset, main_~temp~0#1.base, main_~temp~0#1.offset;havoc main_~i~0#1;havoc main_~user~0#1.base, main_~user~0#1.offset;main_~users~0#1.base, main_~users~0#1.offset := 0, 0;main_~i~0#1 := 0; {9641#true} is VALID [2022-02-21 03:21:03,504 INFO L290 TraceCheckUtils]: 2: Hoare triple {9641#true} assume !!(main_~i~0#1 < 10);call main_#t~malloc6#1.base, main_#t~malloc6#1.offset := #Ultimate.allocOnHeap(40);main_~user~0#1.base, main_~user~0#1.offset := main_#t~malloc6#1.base, main_#t~malloc6#1.offset;havoc main_#t~malloc6#1.base, main_#t~malloc6#1.offset; {9641#true} is VALID [2022-02-21 03:21:03,505 INFO L290 TraceCheckUtils]: 3: Hoare triple {9641#true} assume !(main_~user~0#1.base == 0 && main_~user~0#1.offset == 0); {9641#true} is VALID [2022-02-21 03:21:03,505 INFO L290 TraceCheckUtils]: 4: Hoare triple {9641#true} call write~int(main_~i~0#1, main_~user~0#1.base, main_~user~0#1.offset, 4); {9641#true} is VALID [2022-02-21 03:21:03,505 INFO L290 TraceCheckUtils]: 5: Hoare triple {9641#true} assume main_~i~0#1 * main_~i~0#1 <= 2147483647; {9641#true} is VALID [2022-02-21 03:21:03,505 INFO L290 TraceCheckUtils]: 6: Hoare triple {9641#true} assume main_~i~0#1 * main_~i~0#1 >= -2147483648;call write~int(main_~i~0#1 * main_~i~0#1, main_~user~0#1.base, 4 + main_~user~0#1.offset, 4); {9641#true} is VALID [2022-02-21 03:21:03,505 INFO L290 TraceCheckUtils]: 7: Hoare triple {9641#true} havoc main_~_ha_hashv~0#1; {9641#true} is VALID [2022-02-21 03:21:03,505 INFO L290 TraceCheckUtils]: 8: Hoare triple {9641#true} goto; {9641#true} is VALID [2022-02-21 03:21:03,505 INFO L290 TraceCheckUtils]: 9: Hoare triple {9641#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; {9641#true} is VALID [2022-02-21 03:21:03,505 INFO L290 TraceCheckUtils]: 10: Hoare triple {9641#true} assume !(main_~_hj_k~0#1 % 4294967296 >= 12); {9641#true} is VALID [2022-02-21 03:21:03,505 INFO L290 TraceCheckUtils]: 11: Hoare triple {9641#true} main_~_ha_hashv~0#1 := 4 + main_~_ha_hashv~0#1;main_#t~switch19#1 := 11 == main_~_hj_k~0#1; {9641#true} is VALID [2022-02-21 03:21:03,506 INFO L290 TraceCheckUtils]: 12: Hoare triple {9641#true} assume !main_#t~switch19#1; {9641#true} is VALID [2022-02-21 03:21:03,506 INFO L290 TraceCheckUtils]: 13: Hoare triple {9641#true} main_#t~switch19#1 := main_#t~switch19#1 || 10 == main_~_hj_k~0#1; {9641#true} is VALID [2022-02-21 03:21:03,506 INFO L290 TraceCheckUtils]: 14: Hoare triple {9641#true} assume !main_#t~switch19#1; {9641#true} is VALID [2022-02-21 03:21:03,506 INFO L290 TraceCheckUtils]: 15: Hoare triple {9641#true} main_#t~switch19#1 := main_#t~switch19#1 || 9 == main_~_hj_k~0#1; {9641#true} is VALID [2022-02-21 03:21:03,506 INFO L290 TraceCheckUtils]: 16: Hoare triple {9641#true} assume !main_#t~switch19#1; {9641#true} is VALID [2022-02-21 03:21:03,506 INFO L290 TraceCheckUtils]: 17: Hoare triple {9641#true} main_#t~switch19#1 := main_#t~switch19#1 || 8 == main_~_hj_k~0#1; {9641#true} is VALID [2022-02-21 03:21:03,506 INFO L290 TraceCheckUtils]: 18: Hoare triple {9641#true} assume !main_#t~switch19#1; {9641#true} is VALID [2022-02-21 03:21:03,506 INFO L290 TraceCheckUtils]: 19: Hoare triple {9641#true} main_#t~switch19#1 := main_#t~switch19#1 || 7 == main_~_hj_k~0#1; {9641#true} is VALID [2022-02-21 03:21:03,506 INFO L290 TraceCheckUtils]: 20: Hoare triple {9641#true} assume !main_#t~switch19#1; {9641#true} is VALID [2022-02-21 03:21:03,507 INFO L290 TraceCheckUtils]: 21: Hoare triple {9641#true} main_#t~switch19#1 := main_#t~switch19#1 || 6 == main_~_hj_k~0#1; {9641#true} is VALID [2022-02-21 03:21:03,507 INFO L290 TraceCheckUtils]: 22: Hoare triple {9641#true} assume !main_#t~switch19#1; {9641#true} is VALID [2022-02-21 03:21:03,507 INFO L290 TraceCheckUtils]: 23: Hoare triple {9641#true} main_#t~switch19#1 := main_#t~switch19#1 || 5 == main_~_hj_k~0#1; {9641#true} is VALID [2022-02-21 03:21:03,507 INFO L290 TraceCheckUtils]: 24: Hoare triple {9641#true} assume !main_#t~switch19#1; {9641#true} is VALID [2022-02-21 03:21:03,507 INFO L290 TraceCheckUtils]: 25: Hoare triple {9641#true} main_#t~switch19#1 := main_#t~switch19#1 || 4 == main_~_hj_k~0#1; {9641#true} is VALID [2022-02-21 03:21:03,507 INFO L290 TraceCheckUtils]: 26: Hoare triple {9641#true} assume main_#t~switch19#1;call main_#t~mem27#1 := read~int(main_~_hj_key~0#1.base, 3 + main_~_hj_key~0#1.offset, 1);main_~_hj_i~0#1 := main_~_hj_i~0#1 + 16777216 * (main_#t~mem27#1 % 256);havoc main_#t~mem27#1; {9641#true} is VALID [2022-02-21 03:21:03,507 INFO L290 TraceCheckUtils]: 27: Hoare triple {9641#true} main_#t~switch19#1 := main_#t~switch19#1 || 3 == main_~_hj_k~0#1; {9641#true} is VALID [2022-02-21 03:21:03,507 INFO L290 TraceCheckUtils]: 28: Hoare triple {9641#true} assume main_#t~switch19#1;call main_#t~mem28#1 := read~int(main_~_hj_key~0#1.base, 2 + main_~_hj_key~0#1.offset, 1);main_~_hj_i~0#1 := main_~_hj_i~0#1 + 65536 * (main_#t~mem28#1 % 256);havoc main_#t~mem28#1; {9641#true} is VALID [2022-02-21 03:21:03,507 INFO L290 TraceCheckUtils]: 29: Hoare triple {9641#true} main_#t~switch19#1 := main_#t~switch19#1 || 2 == main_~_hj_k~0#1; {9641#true} is VALID [2022-02-21 03:21:03,508 INFO L290 TraceCheckUtils]: 30: Hoare triple {9641#true} assume main_#t~switch19#1;call main_#t~mem29#1 := read~int(main_~_hj_key~0#1.base, 1 + main_~_hj_key~0#1.offset, 1);main_~_hj_i~0#1 := main_~_hj_i~0#1 + 256 * (main_#t~mem29#1 % 256);havoc main_#t~mem29#1; {9641#true} is VALID [2022-02-21 03:21:03,508 INFO L290 TraceCheckUtils]: 31: Hoare triple {9641#true} main_#t~switch19#1 := main_#t~switch19#1 || 1 == main_~_hj_k~0#1; {9641#true} is VALID [2022-02-21 03:21:03,508 INFO L290 TraceCheckUtils]: 32: Hoare triple {9641#true} assume main_#t~switch19#1;call main_#t~mem30#1 := read~int(main_~_hj_key~0#1.base, main_~_hj_key~0#1.offset, 1);main_~_hj_i~0#1 := main_~_hj_i~0#1 + main_#t~mem30#1 % 256;havoc main_#t~mem30#1; {9641#true} is VALID [2022-02-21 03:21:03,508 INFO L290 TraceCheckUtils]: 33: Hoare triple {9641#true} havoc main_#t~switch19#1; {9641#true} is VALID [2022-02-21 03:21:03,508 INFO L290 TraceCheckUtils]: 34: Hoare triple {9641#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)))); {9641#true} is VALID [2022-02-21 03:21:03,508 INFO L290 TraceCheckUtils]: 35: Hoare triple {9641#true} goto; {9641#true} is VALID [2022-02-21 03:21:03,508 INFO L290 TraceCheckUtils]: 36: Hoare triple {9641#true} goto; {9641#true} is VALID [2022-02-21 03:21:03,508 INFO L290 TraceCheckUtils]: 37: Hoare triple {9641#true} goto; {9641#true} is VALID [2022-02-21 03:21:03,508 INFO L290 TraceCheckUtils]: 38: Hoare triple {9641#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); {9641#true} is VALID [2022-02-21 03:21:03,509 INFO L290 TraceCheckUtils]: 39: Hoare triple {9641#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); {9641#true} is VALID [2022-02-21 03:21:03,509 INFO L290 TraceCheckUtils]: 40: Hoare triple {9641#true} call main_#t~malloc31#1.base, main_#t~malloc31#1.offset := #Ultimate.allocOnHeap(44);call write~$Pointer$(main_#t~malloc31#1.base, main_#t~malloc31#1.offset, main_~user~0#1.base, 8 + main_~user~0#1.offset, 4);havoc main_#t~malloc31#1.base, main_#t~malloc31#1.offset;call main_#t~mem32#1.base, main_#t~mem32#1.offset := read~$Pointer$(main_~user~0#1.base, 8 + main_~user~0#1.offset, 4); {9641#true} is VALID [2022-02-21 03:21:03,509 INFO L290 TraceCheckUtils]: 41: Hoare triple {9641#true} assume !(main_#t~mem32#1.base == 0 && main_#t~mem32#1.offset == 0);havoc main_#t~mem32#1.base, main_#t~mem32#1.offset;call main_#t~mem33#1.base, main_#t~mem33#1.offset := read~$Pointer$(main_~user~0#1.base, 8 + main_~user~0#1.offset, 4); {9641#true} is VALID [2022-02-21 03:21:03,509 INFO L272 TraceCheckUtils]: 42: Hoare triple {9641#true} call main_#t~memset~res34#1.base, main_#t~memset~res34#1.offset := #Ultimate.C_memset(main_#t~mem33#1.base, main_#t~mem33#1.offset, 0, 44); {9641#true} is VALID [2022-02-21 03:21:03,510 INFO L290 TraceCheckUtils]: 43: Hoare triple {9641#true} #t~loopctr188 := 0; {9775#(= |#Ultimate.C_memset_#t~loopctr188| 0)} is VALID [2022-02-21 03:21:03,510 INFO L290 TraceCheckUtils]: 44: Hoare triple {9775#(= |#Ultimate.C_memset_#t~loopctr188| 0)} assume !(#t~loopctr188 % 4294967296 < #amount % 4294967296); {9779#(not (< 0 (mod |#Ultimate.C_memset_#amount| 4294967296)))} is VALID [2022-02-21 03:21:03,510 INFO L290 TraceCheckUtils]: 45: Hoare triple {9779#(not (< 0 (mod |#Ultimate.C_memset_#amount| 4294967296)))} assume #res.base == #ptr.base && #res.offset == #ptr.offset; {9779#(not (< 0 (mod |#Ultimate.C_memset_#amount| 4294967296)))} is VALID [2022-02-21 03:21:03,511 INFO L284 TraceCheckUtils]: 46: Hoare quadruple {9779#(not (< 0 (mod |#Ultimate.C_memset_#amount| 4294967296)))} {9641#true} #609#return; {9642#false} is VALID [2022-02-21 03:21:03,512 INFO L290 TraceCheckUtils]: 47: Hoare triple {9642#false} havoc main_#t~mem33#1.base, main_#t~mem33#1.offset;havoc main_#t~memset~res34#1.base, main_#t~memset~res34#1.offset;call main_#t~mem35#1.base, main_#t~mem35#1.offset := read~$Pointer$(main_~user~0#1.base, 8 + main_~user~0#1.offset, 4);call write~$Pointer$(main_~user~0#1.base, 8 + main_~user~0#1.offset, main_#t~mem35#1.base, 16 + main_#t~mem35#1.offset, 4);havoc main_#t~mem35#1.base, main_#t~mem35#1.offset;call main_#t~mem36#1.base, main_#t~mem36#1.offset := read~$Pointer$(main_~user~0#1.base, 8 + main_~user~0#1.offset, 4);call write~int(32, main_#t~mem36#1.base, 4 + main_#t~mem36#1.offset, 4);havoc main_#t~mem36#1.base, main_#t~mem36#1.offset;call main_#t~mem37#1.base, main_#t~mem37#1.offset := read~$Pointer$(main_~user~0#1.base, 8 + main_~user~0#1.offset, 4);call write~int(5, main_#t~mem37#1.base, 8 + main_#t~mem37#1.offset, 4);havoc main_#t~mem37#1.base, main_#t~mem37#1.offset;call main_#t~mem38#1.base, main_#t~mem38#1.offset := read~$Pointer$(main_~user~0#1.base, 8 + main_~user~0#1.offset, 4);call write~int((if 8 + main_~user~0#1.offset - main_~user~0#1.offset < 0 && 0 != (8 + main_~user~0#1.offset - main_~user~0#1.offset) % 1 then 1 + (8 + main_~user~0#1.offset - main_~user~0#1.offset) / 1 else (8 + main_~user~0#1.offset - main_~user~0#1.offset) / 1), main_#t~mem38#1.base, 20 + main_#t~mem38#1.offset, 4);havoc main_#t~mem38#1.base, main_#t~mem38#1.offset;call main_#t~mem39#1.base, main_#t~mem39#1.offset := read~$Pointer$(main_~user~0#1.base, 8 + main_~user~0#1.offset, 4);call main_#t~malloc40#1.base, main_#t~malloc40#1.offset := #Ultimate.allocOnHeap(384);call write~$Pointer$(main_#t~malloc40#1.base, main_#t~malloc40#1.offset, main_#t~mem39#1.base, main_#t~mem39#1.offset, 4);havoc main_#t~mem39#1.base, main_#t~mem39#1.offset;havoc main_#t~malloc40#1.base, main_#t~malloc40#1.offset;call main_#t~mem41#1.base, main_#t~mem41#1.offset := read~$Pointer$(main_~user~0#1.base, 8 + main_~user~0#1.offset, 4);call write~int(2685476833, main_#t~mem41#1.base, 40 + main_#t~mem41#1.offset, 4);havoc main_#t~mem41#1.base, main_#t~mem41#1.offset;call main_#t~mem42#1.base, main_#t~mem42#1.offset := read~$Pointer$(main_~user~0#1.base, 8 + main_~user~0#1.offset, 4);call main_#t~mem43#1.base, main_#t~mem43#1.offset := read~$Pointer$(main_#t~mem42#1.base, main_#t~mem42#1.offset, 4); {9642#false} is VALID [2022-02-21 03:21:03,512 INFO L290 TraceCheckUtils]: 48: Hoare triple {9642#false} assume !(main_#t~mem43#1.base == 0 && main_#t~mem43#1.offset == 0);havoc main_#t~mem42#1.base, main_#t~mem42#1.offset;havoc main_#t~mem43#1.base, main_#t~mem43#1.offset;call main_#t~mem45#1.base, main_#t~mem45#1.offset := read~$Pointer$(main_~user~0#1.base, 8 + main_~user~0#1.offset, 4);call main_#t~mem46#1.base, main_#t~mem46#1.offset := read~$Pointer$(main_#t~mem45#1.base, main_#t~mem45#1.offset, 4); {9642#false} is VALID [2022-02-21 03:21:03,512 INFO L272 TraceCheckUtils]: 49: Hoare triple {9642#false} call main_#t~memset~res47#1.base, main_#t~memset~res47#1.offset := #Ultimate.C_memset(main_#t~mem46#1.base, main_#t~mem46#1.offset, 0, 384); {9642#false} is VALID [2022-02-21 03:21:03,512 INFO L290 TraceCheckUtils]: 50: Hoare triple {9642#false} #t~loopctr188 := 0; {9642#false} is VALID [2022-02-21 03:21:03,512 INFO L290 TraceCheckUtils]: 51: Hoare triple {9642#false} assume !(#t~loopctr188 % 4294967296 < #amount % 4294967296); {9642#false} is VALID [2022-02-21 03:21:03,512 INFO L290 TraceCheckUtils]: 52: Hoare triple {9642#false} assume #res.base == #ptr.base && #res.offset == #ptr.offset; {9642#false} is VALID [2022-02-21 03:21:03,512 INFO L284 TraceCheckUtils]: 53: Hoare quadruple {9642#false} {9642#false} #611#return; {9642#false} is VALID [2022-02-21 03:21:03,512 INFO L290 TraceCheckUtils]: 54: Hoare triple {9642#false} havoc main_#t~mem45#1.base, main_#t~mem45#1.offset;havoc main_#t~mem46#1.base, main_#t~mem46#1.offset;havoc main_#t~memset~res47#1.base, main_#t~memset~res47#1.offset; {9642#false} is VALID [2022-02-21 03:21:03,513 INFO L290 TraceCheckUtils]: 55: Hoare triple {9642#false} goto; {9642#false} is VALID [2022-02-21 03:21:03,513 INFO L290 TraceCheckUtils]: 56: Hoare triple {9642#false} main_~users~0#1.base, main_~users~0#1.offset := main_~user~0#1.base, main_~user~0#1.offset; {9642#false} is VALID [2022-02-21 03:21:03,513 INFO L290 TraceCheckUtils]: 57: Hoare triple {9642#false} havoc main_~_ha_bkt~0#1;call main_#t~mem56#1.base, main_#t~mem56#1.offset := read~$Pointer$(main_~users~0#1.base, 8 + main_~users~0#1.offset, 4);call main_#t~mem57#1 := read~int(main_#t~mem56#1.base, 12 + main_#t~mem56#1.offset, 4);main_#t~post58#1 := main_#t~mem57#1;call write~int(1 + main_#t~post58#1, main_#t~mem56#1.base, 12 + main_#t~mem56#1.offset, 4);havoc main_#t~mem56#1.base, main_#t~mem56#1.offset;havoc main_#t~mem57#1;havoc main_#t~post58#1; {9642#false} is VALID [2022-02-21 03:21:03,513 INFO L290 TraceCheckUtils]: 58: Hoare triple {9642#false} call main_#t~mem59#1.base, main_#t~mem59#1.offset := read~$Pointer$(main_~users~0#1.base, 8 + main_~users~0#1.offset, 4);call main_#t~mem60#1 := read~int(main_#t~mem59#1.base, 4 + main_#t~mem59#1.offset, 4);main_~_ha_bkt~0#1 := (if 0 == main_~_ha_hashv~0#1 || 0 == main_#t~mem60#1 - 1 then 0 else (if 1 == main_#t~mem60#1 - 1 then (if 1 == main_~_ha_hashv~0#1 || 0 == main_~_ha_hashv~0#1 then main_~_ha_hashv~0#1 else (if main_~_ha_hashv~0#1 >= 0 then main_~_ha_hashv~0#1 % 2 else ~bitwiseAnd(main_~_ha_hashv~0#1, main_#t~mem60#1 - 1))) else (if 1 == main_~_ha_hashv~0#1 then (if 1 == main_#t~mem60#1 - 1 || 0 == main_#t~mem60#1 - 1 then main_#t~mem60#1 - 1 else (if main_#t~mem60#1 - 1 >= 0 then (main_#t~mem60#1 - 1) % 2 else ~bitwiseAnd(main_~_ha_hashv~0#1, main_#t~mem60#1 - 1))) else ~bitwiseAnd(main_~_ha_hashv~0#1, main_#t~mem60#1 - 1))));havoc main_#t~mem59#1.base, main_#t~mem59#1.offset;havoc main_#t~mem60#1; {9642#false} is VALID [2022-02-21 03:21:03,513 INFO L290 TraceCheckUtils]: 59: Hoare triple {9642#false} goto; {9642#false} is VALID [2022-02-21 03:21:03,513 INFO L290 TraceCheckUtils]: 60: Hoare triple {9642#false} call main_#t~mem61#1.base, main_#t~mem61#1.offset := read~$Pointer$(main_~users~0#1.base, 8 + main_~users~0#1.offset, 4);call main_#t~mem62#1.base, main_#t~mem62#1.offset := read~$Pointer$(main_#t~mem61#1.base, main_#t~mem61#1.offset, 4);main_~_ha_head~0#1.base, main_~_ha_head~0#1.offset := main_#t~mem62#1.base, main_#t~mem62#1.offset + 12 * (if main_~_ha_bkt~0#1 % 4294967296 % 4294967296 <= 2147483647 then main_~_ha_bkt~0#1 % 4294967296 % 4294967296 else main_~_ha_bkt~0#1 % 4294967296 % 4294967296 - 4294967296);havoc main_#t~mem61#1.base, main_#t~mem61#1.offset;havoc main_#t~mem62#1.base, main_#t~mem62#1.offset;call main_#t~mem63#1 := read~int(main_~_ha_head~0#1.base, 4 + main_~_ha_head~0#1.offset, 4);main_#t~post64#1 := main_#t~mem63#1;call write~int(1 + main_#t~post64#1, main_~_ha_head~0#1.base, 4 + main_~_ha_head~0#1.offset, 4);havoc main_#t~mem63#1;havoc main_#t~post64#1;call main_#t~mem65#1.base, main_#t~mem65#1.offset := read~$Pointer$(main_~_ha_head~0#1.base, main_~_ha_head~0#1.offset, 4);call write~$Pointer$(main_#t~mem65#1.base, main_#t~mem65#1.offset, main_~user~0#1.base, 24 + main_~user~0#1.offset, 4);havoc main_#t~mem65#1.base, main_#t~mem65#1.offset;call write~$Pointer$(0, 0, main_~user~0#1.base, 20 + main_~user~0#1.offset, 4);call main_#t~mem66#1.base, main_#t~mem66#1.offset := read~$Pointer$(main_~_ha_head~0#1.base, main_~_ha_head~0#1.offset, 4); {9642#false} is VALID [2022-02-21 03:21:03,513 INFO L290 TraceCheckUtils]: 61: Hoare triple {9642#false} assume main_#t~mem66#1.base != 0 || main_#t~mem66#1.offset != 0;havoc main_#t~mem66#1.base, main_#t~mem66#1.offset;call main_#t~mem67#1.base, main_#t~mem67#1.offset := read~$Pointer$(main_~_ha_head~0#1.base, main_~_ha_head~0#1.offset, 4);call write~$Pointer$(main_~user~0#1.base, 8 + main_~user~0#1.offset, main_#t~mem67#1.base, 12 + main_#t~mem67#1.offset, 4);havoc main_#t~mem67#1.base, main_#t~mem67#1.offset; {9642#false} is VALID [2022-02-21 03:21:03,513 INFO L290 TraceCheckUtils]: 62: Hoare triple {9642#false} call write~$Pointer$(main_~user~0#1.base, 8 + main_~user~0#1.offset, main_~_ha_head~0#1.base, main_~_ha_head~0#1.offset, 4);call main_#t~mem69#1 := read~int(main_~_ha_head~0#1.base, 4 + main_~_ha_head~0#1.offset, 4);call main_#t~mem68#1 := read~int(main_~_ha_head~0#1.base, 8 + main_~_ha_head~0#1.offset, 4);main_#t~short72#1 := main_#t~mem69#1 % 4294967296 >= 10 * (1 + main_#t~mem68#1) % 4294967296; {9642#false} is VALID [2022-02-21 03:21:03,513 INFO L290 TraceCheckUtils]: 63: Hoare triple {9642#false} assume main_#t~short72#1;call main_#t~mem70#1.base, main_#t~mem70#1.offset := read~$Pointer$(main_~user~0#1.base, 8 + main_~user~0#1.offset, 4);call main_#t~mem71#1 := read~int(main_#t~mem70#1.base, 36 + main_#t~mem70#1.offset, 4);main_#t~short72#1 := 0 == main_#t~mem71#1 % 4294967296; {9642#false} is VALID [2022-02-21 03:21:03,514 INFO L290 TraceCheckUtils]: 64: Hoare triple {9642#false} assume !main_#t~short72#1;havoc main_#t~mem69#1;havoc main_#t~mem68#1;havoc main_#t~mem70#1.base, main_#t~mem70#1.offset;havoc main_#t~mem71#1;havoc main_#t~short72#1; {9642#false} is VALID [2022-02-21 03:21:03,514 INFO L290 TraceCheckUtils]: 65: Hoare triple {9642#false} goto; {9642#false} is VALID [2022-02-21 03:21:03,514 INFO L290 TraceCheckUtils]: 66: Hoare triple {9642#false} goto; {9642#false} is VALID [2022-02-21 03:21:03,514 INFO L290 TraceCheckUtils]: 67: Hoare triple {9642#false} goto; {9642#false} is VALID [2022-02-21 03:21:03,514 INFO L290 TraceCheckUtils]: 68: Hoare triple {9642#false} goto; {9642#false} is VALID [2022-02-21 03:21:03,514 INFO L290 TraceCheckUtils]: 69: Hoare triple {9642#false} main_#t~post5#1 := main_~i~0#1; {9642#false} is VALID [2022-02-21 03:21:03,514 INFO L290 TraceCheckUtils]: 70: Hoare triple {9642#false} assume 1 + main_#t~post5#1 <= 2147483647; {9642#false} is VALID [2022-02-21 03:21:03,514 INFO L290 TraceCheckUtils]: 71: Hoare triple {9642#false} assume 1 + main_#t~post5#1 >= -2147483648;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; {9642#false} is VALID [2022-02-21 03:21:03,514 INFO L290 TraceCheckUtils]: 72: Hoare triple {9642#false} assume !!(main_~i~0#1 < 10);call main_#t~malloc6#1.base, main_#t~malloc6#1.offset := #Ultimate.allocOnHeap(40);main_~user~0#1.base, main_~user~0#1.offset := main_#t~malloc6#1.base, main_#t~malloc6#1.offset;havoc main_#t~malloc6#1.base, main_#t~malloc6#1.offset; {9642#false} is VALID [2022-02-21 03:21:03,514 INFO L290 TraceCheckUtils]: 73: Hoare triple {9642#false} assume !(main_~user~0#1.base == 0 && main_~user~0#1.offset == 0); {9642#false} is VALID [2022-02-21 03:21:03,515 INFO L290 TraceCheckUtils]: 74: Hoare triple {9642#false} call write~int(main_~i~0#1, main_~user~0#1.base, main_~user~0#1.offset, 4); {9642#false} is VALID [2022-02-21 03:21:03,515 INFO L290 TraceCheckUtils]: 75: Hoare triple {9642#false} assume !(main_~i~0#1 * main_~i~0#1 <= 2147483647); {9642#false} is VALID [2022-02-21 03:21:03,515 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-21 03:21:03,515 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-21 03:21:03,515 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 03:21:03,515 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1892046793] [2022-02-21 03:21:03,515 WARN L317 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-02-21 03:21:03,515 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1622602950] [2022-02-21 03:21:03,516 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1622602950] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-21 03:21:03,516 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-21 03:21:03,516 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-02-21 03:21:03,516 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [439093090] [2022-02-21 03:21:03,516 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-21 03:21:03,517 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 18.0) internal successors, (72), 4 states have internal predecessors, (72), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Word has length 76 [2022-02-21 03:21:03,517 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-21 03:21:03,517 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 18.0) internal successors, (72), 4 states have internal predecessors, (72), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-21 03:21:03,575 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 76 edges. 76 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:21:03,575 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-02-21 03:21:03,575 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 03:21:03,576 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-02-21 03:21:03,576 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-02-21 03:21:03,576 INFO L87 Difference]: Start difference. First operand 331 states and 411 transitions. Second operand has 4 states, 4 states have (on average 18.0) internal successors, (72), 4 states have internal predecessors, (72), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-21 03:21:04,936 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:21:04,936 INFO L93 Difference]: Finished difference Result 613 states and 776 transitions. [2022-02-21 03:21:04,936 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-02-21 03:21:04,936 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 18.0) internal successors, (72), 4 states have internal predecessors, (72), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Word has length 76 [2022-02-21 03:21:04,936 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-21 03:21:04,937 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 18.0) internal successors, (72), 4 states have internal predecessors, (72), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-21 03:21:04,939 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 348 transitions. [2022-02-21 03:21:04,939 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 18.0) internal successors, (72), 4 states have internal predecessors, (72), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-21 03:21:04,941 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 348 transitions. [2022-02-21 03:21:04,941 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 348 transitions. [2022-02-21 03:21:05,213 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 348 edges. 348 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:21:05,219 INFO L225 Difference]: With dead ends: 613 [2022-02-21 03:21:05,219 INFO L226 Difference]: Without dead ends: 334 [2022-02-21 03:21:05,220 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 73 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-02-21 03:21:05,220 INFO L933 BasicCegarLoop]: 169 mSDtfsCounter, 2 mSDsluCounter, 334 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 503 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-21 03:21:05,220 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2 Valid, 503 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-21 03:21:05,220 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 334 states. [2022-02-21 03:21:05,296 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 334 to 334. [2022-02-21 03:21:05,296 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 03:21:05,297 INFO L82 GeneralOperation]: Start isEquivalent. First operand 334 states. Second operand has 334 states, 308 states have (on average 1.2207792207792207) internal successors, (376), 322 states have internal predecessors, (376), 19 states have call successors, (19), 2 states have call predecessors, (19), 3 states have return successors, (22), 10 states have call predecessors, (22), 19 states have call successors, (22) [2022-02-21 03:21:05,297 INFO L74 IsIncluded]: Start isIncluded. First operand 334 states. Second operand has 334 states, 308 states have (on average 1.2207792207792207) internal successors, (376), 322 states have internal predecessors, (376), 19 states have call successors, (19), 2 states have call predecessors, (19), 3 states have return successors, (22), 10 states have call predecessors, (22), 19 states have call successors, (22) [2022-02-21 03:21:05,298 INFO L87 Difference]: Start difference. First operand 334 states. Second operand has 334 states, 308 states have (on average 1.2207792207792207) internal successors, (376), 322 states have internal predecessors, (376), 19 states have call successors, (19), 2 states have call predecessors, (19), 3 states have return successors, (22), 10 states have call predecessors, (22), 19 states have call successors, (22) [2022-02-21 03:21:05,303 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:21:05,303 INFO L93 Difference]: Finished difference Result 334 states and 417 transitions. [2022-02-21 03:21:05,304 INFO L276 IsEmpty]: Start isEmpty. Operand 334 states and 417 transitions. [2022-02-21 03:21:05,304 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:21:05,304 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:21:05,305 INFO L74 IsIncluded]: Start isIncluded. First operand has 334 states, 308 states have (on average 1.2207792207792207) internal successors, (376), 322 states have internal predecessors, (376), 19 states have call successors, (19), 2 states have call predecessors, (19), 3 states have return successors, (22), 10 states have call predecessors, (22), 19 states have call successors, (22) Second operand 334 states. [2022-02-21 03:21:05,306 INFO L87 Difference]: Start difference. First operand has 334 states, 308 states have (on average 1.2207792207792207) internal successors, (376), 322 states have internal predecessors, (376), 19 states have call successors, (19), 2 states have call predecessors, (19), 3 states have return successors, (22), 10 states have call predecessors, (22), 19 states have call successors, (22) Second operand 334 states. [2022-02-21 03:21:05,311 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:21:05,311 INFO L93 Difference]: Finished difference Result 334 states and 417 transitions. [2022-02-21 03:21:05,311 INFO L276 IsEmpty]: Start isEmpty. Operand 334 states and 417 transitions. [2022-02-21 03:21:05,312 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:21:05,312 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:21:05,312 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 03:21:05,312 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 03:21:05,312 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 334 states, 308 states have (on average 1.2207792207792207) internal successors, (376), 322 states have internal predecessors, (376), 19 states have call successors, (19), 2 states have call predecessors, (19), 3 states have return successors, (22), 10 states have call predecessors, (22), 19 states have call successors, (22) [2022-02-21 03:21:05,318 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 334 states to 334 states and 417 transitions. [2022-02-21 03:21:05,318 INFO L78 Accepts]: Start accepts. Automaton has 334 states and 417 transitions. Word has length 76 [2022-02-21 03:21:05,318 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-21 03:21:05,318 INFO L470 AbstractCegarLoop]: Abstraction has 334 states and 417 transitions. [2022-02-21 03:21:05,319 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 18.0) internal successors, (72), 4 states have internal predecessors, (72), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-21 03:21:05,319 INFO L276 IsEmpty]: Start isEmpty. Operand 334 states and 417 transitions. [2022-02-21 03:21:05,319 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2022-02-21 03:21:05,319 INFO L506 BasicCegarLoop]: Found error trace [2022-02-21 03:21:05,320 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-21 03:21:05,358 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2022-02-21 03:21:05,546 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-21 03:21:05,546 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2022-02-21 03:21:05,546 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:21:05,546 INFO L85 PathProgramCache]: Analyzing trace with hash -158908919, now seen corresponding path program 1 times [2022-02-21 03:21:05,546 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:21:05,547 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [117955533] [2022-02-21 03:21:05,547 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:21:05,547 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:21:05,604 ERROR L252 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-02-21 03:21:05,605 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [266593589] [2022-02-21 03:21:05,605 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:21:05,605 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-21 03:21:05,605 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:21:05,606 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-02-21 03:21:05,607 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-02-21 03:21:08,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:21:08,115 INFO L263 TraceCheckSpWp]: Trace formula consists of 702 conjuncts, 14 conjunts are in the unsatisfiable core [2022-02-21 03:21:08,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:21:08,149 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 03:21:08,641 INFO L290 TraceCheckUtils]: 0: Hoare triple {11680#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(21, 2);~count_int_int~0 := 0; {11680#true} is VALID [2022-02-21 03:21:08,641 INFO L290 TraceCheckUtils]: 1: Hoare triple {11680#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc6#1.base, main_#t~malloc6#1.offset, main_#t~mem8#1, main_#t~mem7#1, main_#t~mem9#1, main_#t~mem10#1, main_#t~mem12#1, main_#t~mem11#1, main_#t~mem13#1, main_#t~mem14#1, main_#t~mem16#1, main_#t~mem15#1, main_#t~mem17#1, main_#t~mem18#1, main_#t~switch19#1, main_#t~mem20#1, main_#t~mem21#1, main_#t~mem22#1, main_#t~mem23#1, main_#t~mem24#1, main_#t~mem25#1, main_#t~mem26#1, main_#t~mem27#1, main_#t~mem28#1, main_#t~mem29#1, main_#t~mem30#1, main_~_hj_i~0#1, main_~_hj_j~0#1, main_~_hj_k~0#1, main_~_hj_key~0#1.base, main_~_hj_key~0#1.offset, main_#t~malloc31#1.base, main_#t~malloc31#1.offset, main_#t~mem32#1.base, main_#t~mem32#1.offset, main_#t~mem33#1.base, main_#t~mem33#1.offset, main_#t~memset~res34#1.base, main_#t~memset~res34#1.offset, main_#t~mem35#1.base, main_#t~mem35#1.offset, main_#t~mem36#1.base, main_#t~mem36#1.offset, main_#t~mem37#1.base, main_#t~mem37#1.offset, main_#t~mem38#1.base, main_#t~mem38#1.offset, main_#t~mem39#1.base, main_#t~mem39#1.offset, main_#t~malloc40#1.base, main_#t~malloc40#1.offset, main_#t~mem41#1.base, main_#t~mem41#1.offset, main_#t~mem42#1.base, main_#t~mem42#1.offset, main_#t~mem43#1.base, main_#t~mem43#1.offset, main_#t~mem44#1.base, main_#t~mem44#1.offset, main_#t~mem45#1.base, main_#t~mem45#1.offset, main_#t~mem46#1.base, main_#t~mem46#1.offset, main_#t~memset~res47#1.base, main_#t~memset~res47#1.offset, main_#t~mem48#1.base, main_#t~mem48#1.offset, main_#t~mem49#1.base, main_#t~mem49#1.offset, main_#t~mem50#1.base, main_#t~mem50#1.offset, main_#t~mem51#1.base, main_#t~mem51#1.offset, main_#t~mem52#1, main_#t~mem53#1.base, main_#t~mem53#1.offset, main_#t~mem54#1.base, main_#t~mem54#1.offset, main_#t~mem55#1.base, main_#t~mem55#1.offset, main_#t~mem56#1.base, main_#t~mem56#1.offset, main_#t~mem57#1, main_#t~post58#1, main_#t~mem59#1.base, main_#t~mem59#1.offset, main_#t~mem60#1, main_#t~mem61#1.base, main_#t~mem61#1.offset, main_#t~mem62#1.base, main_#t~mem62#1.offset, main_#t~mem63#1, main_#t~post64#1, main_#t~mem65#1.base, main_#t~mem65#1.offset, main_#t~mem66#1.base, main_#t~mem66#1.offset, main_#t~mem67#1.base, main_#t~mem67#1.offset, main_#t~mem69#1, main_#t~mem68#1, main_#t~mem70#1.base, main_#t~mem70#1.offset, main_#t~mem71#1, main_#t~short72#1, main_#t~mem73#1.base, main_#t~mem73#1.offset, main_#t~mem74#1, main_#t~malloc75#1.base, main_#t~malloc75#1.offset, main_#t~mem76#1.base, main_#t~mem76#1.offset, main_#t~mem77#1.base, main_#t~mem77#1.offset, main_#t~mem78#1.base, main_#t~mem78#1.offset, main_#t~mem79#1, main_#t~memset~res80#1.base, main_#t~memset~res80#1.offset, main_#t~mem81#1.base, main_#t~mem81#1.offset, main_#t~mem82#1.base, main_#t~mem82#1.offset, main_#t~mem85#1, main_#t~mem83#1.base, main_#t~mem83#1.offset, main_#t~mem84#1, main_#t~mem86#1.base, main_#t~mem86#1.offset, main_#t~mem89#1, main_#t~mem87#1.base, main_#t~mem87#1.offset, main_#t~mem88#1, main_#t~ite90#1, main_#t~mem91#1.base, main_#t~mem91#1.offset, main_#t~mem95#1.base, main_#t~mem95#1.offset, main_#t~mem96#1.base, main_#t~mem96#1.offset, main_#t~mem97#1.base, main_#t~mem97#1.offset, main_#t~mem98#1.base, main_#t~mem98#1.offset, main_#t~mem101#1, main_#t~mem99#1.base, main_#t~mem99#1.offset, main_#t~mem100#1, main_#t~mem102#1.base, main_#t~mem102#1.offset, main_#t~mem103#1, main_#t~pre104#1, main_#t~mem105#1.base, main_#t~mem105#1.offset, main_#t~mem106#1, main_#t~mem107#1.base, main_#t~mem107#1.offset, main_#t~mem108#1, main_#t~post109#1, main_#t~mem113#1, main_#t~mem111#1, main_#t~mem110#1.base, main_#t~mem110#1.offset, main_#t~mem112#1, main_#t~mem114#1, main_#t~post115#1, main_#t~mem116#1.base, main_#t~mem116#1.offset, main_#t~mem117#1.base, main_#t~mem117#1.offset, main_#t~mem118#1.base, main_#t~mem118#1.offset, main_#t~post92#1, main_#t~mem93#1.base, main_#t~mem93#1.offset, main_#t~mem94#1, main_#t~mem119#1.base, main_#t~mem119#1.offset, main_#t~mem120#1.base, main_#t~mem120#1.offset, main_#t~mem121#1.base, main_#t~mem121#1.offset, main_#t~mem122#1, main_#t~mem123#1.base, main_#t~mem123#1.offset, main_#t~mem124#1, main_#t~post125#1, main_#t~mem126#1.base, main_#t~mem126#1.offset, main_#t~mem127#1.base, main_#t~mem127#1.offset, main_#t~mem128#1.base, main_#t~mem128#1.offset, main_#t~mem129#1.base, main_#t~mem129#1.offset, main_#t~mem132#1, main_#t~mem130#1.base, main_#t~mem130#1.offset, main_#t~mem131#1, main_#t~ite135#1, main_#t~mem133#1.base, main_#t~mem133#1.offset, main_#t~mem134#1, main_#t~mem136#1.base, main_#t~mem136#1.offset, main_#t~mem137#1, main_#t~mem138#1.base, main_#t~mem138#1.offset, main_~_he_bkt~0#1, main_~_he_bkt_i~0#1, main_~_he_thh~0#1.base, main_~_he_thh~0#1.offset, main_~_he_hh_nxt~0#1.base, main_~_he_hh_nxt~0#1.offset, main_~#_he_new_buckets~0#1.base, main_~#_he_new_buckets~0#1.offset, main_~_he_newbkt~0#1.base, main_~_he_newbkt~0#1.offset, main_~_ha_head~0#1.base, main_~_ha_head~0#1.offset, main_~_ha_bkt~0#1, main_~_ha_hashv~0#1, main_#t~post5#1, main_#t~mem140#1, main_#t~mem141#1, main_#t~mem139#1.base, main_#t~mem139#1.offset, main_#t~ite143#1.base, main_#t~ite143#1.offset, main_#t~mem142#1.base, main_#t~mem142#1.offset, main_#t~mem146#1.base, main_#t~mem146#1.offset, main_#t~mem147#1.base, main_#t~mem147#1.offset, main_#t~short148#1, main_#t~mem149#1.base, main_#t~mem149#1.offset, main_#t~mem150#1.base, main_#t~mem150#1.offset, main_#t~mem151#1.base, main_#t~mem151#1.offset, main_#t~mem152#1.base, main_#t~mem152#1.offset, main_#t~mem153#1.base, main_#t~mem153#1.offset, main_#t~mem154#1.base, main_#t~mem154#1.offset, main_#t~mem155#1.base, main_#t~mem155#1.offset, main_#t~mem156#1.base, main_#t~mem156#1.offset, main_#t~mem157#1, main_#t~mem158#1.base, main_#t~mem158#1.offset, main_#t~mem159#1.base, main_#t~mem159#1.offset, main_#t~mem160#1.base, main_#t~mem160#1.offset, main_#t~mem161#1, main_#t~mem162#1.base, main_#t~mem162#1.offset, main_#t~mem163#1.base, main_#t~mem163#1.offset, main_#t~mem164#1.base, main_#t~mem164#1.offset, main_#t~mem165#1.base, main_#t~mem165#1.offset, main_#t~mem166#1.base, main_#t~mem166#1.offset, main_#t~mem167#1, main_#t~mem168#1.base, main_#t~mem168#1.offset, main_#t~mem171#1, main_#t~mem169#1.base, main_#t~mem169#1.offset, main_#t~mem170#1, main_#t~mem172#1.base, main_#t~mem172#1.offset, main_#t~mem173#1.base, main_#t~mem173#1.offset, main_#t~mem174#1, main_#t~post175#1, 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.base, main_#t~mem181#1.offset, main_#t~mem182#1.base, main_#t~mem182#1.offset, main_#t~mem183#1.base, main_#t~mem183#1.offset, main_~_hd_head~0#1.base, main_~_hd_head~0#1.offset, main_#t~mem184#1.base, main_#t~mem184#1.offset, main_#t~mem185#1, main_#t~post186#1, main_~_hd_bkt~0#1, main_~_hd_hh_del~0#1.base, main_~_hd_hh_del~0#1.offset, main_#t~ite145#1.base, main_#t~ite145#1.offset, main_#t~mem144#1.base, main_#t~mem144#1.offset, main_~i~0#1, main_~user~0#1.base, main_~user~0#1.offset, main_~users~0#1.base, main_~users~0#1.offset, main_~temp~0#1.base, main_~temp~0#1.offset;havoc main_~i~0#1;havoc main_~user~0#1.base, main_~user~0#1.offset;main_~users~0#1.base, main_~users~0#1.offset := 0, 0;main_~i~0#1 := 0; {11680#true} is VALID [2022-02-21 03:21:08,642 INFO L290 TraceCheckUtils]: 2: Hoare triple {11680#true} assume !!(main_~i~0#1 < 10);call main_#t~malloc6#1.base, main_#t~malloc6#1.offset := #Ultimate.allocOnHeap(40);main_~user~0#1.base, main_~user~0#1.offset := main_#t~malloc6#1.base, main_#t~malloc6#1.offset;havoc main_#t~malloc6#1.base, main_#t~malloc6#1.offset; {11680#true} is VALID [2022-02-21 03:21:08,642 INFO L290 TraceCheckUtils]: 3: Hoare triple {11680#true} assume !(main_~user~0#1.base == 0 && main_~user~0#1.offset == 0); {11680#true} is VALID [2022-02-21 03:21:08,642 INFO L290 TraceCheckUtils]: 4: Hoare triple {11680#true} call write~int(main_~i~0#1, main_~user~0#1.base, main_~user~0#1.offset, 4); {11680#true} is VALID [2022-02-21 03:21:08,642 INFO L290 TraceCheckUtils]: 5: Hoare triple {11680#true} assume main_~i~0#1 * main_~i~0#1 <= 2147483647; {11680#true} is VALID [2022-02-21 03:21:08,642 INFO L290 TraceCheckUtils]: 6: Hoare triple {11680#true} assume main_~i~0#1 * main_~i~0#1 >= -2147483648;call write~int(main_~i~0#1 * main_~i~0#1, main_~user~0#1.base, 4 + main_~user~0#1.offset, 4); {11680#true} is VALID [2022-02-21 03:21:08,642 INFO L290 TraceCheckUtils]: 7: Hoare triple {11680#true} havoc main_~_ha_hashv~0#1; {11680#true} is VALID [2022-02-21 03:21:08,642 INFO L290 TraceCheckUtils]: 8: Hoare triple {11680#true} goto; {11680#true} is VALID [2022-02-21 03:21:08,642 INFO L290 TraceCheckUtils]: 9: Hoare triple {11680#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; {11680#true} is VALID [2022-02-21 03:21:08,643 INFO L290 TraceCheckUtils]: 10: Hoare triple {11680#true} assume !(main_~_hj_k~0#1 % 4294967296 >= 12); {11680#true} is VALID [2022-02-21 03:21:08,643 INFO L290 TraceCheckUtils]: 11: Hoare triple {11680#true} main_~_ha_hashv~0#1 := 4 + main_~_ha_hashv~0#1;main_#t~switch19#1 := 11 == main_~_hj_k~0#1; {11680#true} is VALID [2022-02-21 03:21:08,643 INFO L290 TraceCheckUtils]: 12: Hoare triple {11680#true} assume !main_#t~switch19#1; {11680#true} is VALID [2022-02-21 03:21:08,643 INFO L290 TraceCheckUtils]: 13: Hoare triple {11680#true} main_#t~switch19#1 := main_#t~switch19#1 || 10 == main_~_hj_k~0#1; {11680#true} is VALID [2022-02-21 03:21:08,643 INFO L290 TraceCheckUtils]: 14: Hoare triple {11680#true} assume !main_#t~switch19#1; {11680#true} is VALID [2022-02-21 03:21:08,643 INFO L290 TraceCheckUtils]: 15: Hoare triple {11680#true} main_#t~switch19#1 := main_#t~switch19#1 || 9 == main_~_hj_k~0#1; {11680#true} is VALID [2022-02-21 03:21:08,643 INFO L290 TraceCheckUtils]: 16: Hoare triple {11680#true} assume !main_#t~switch19#1; {11680#true} is VALID [2022-02-21 03:21:08,643 INFO L290 TraceCheckUtils]: 17: Hoare triple {11680#true} main_#t~switch19#1 := main_#t~switch19#1 || 8 == main_~_hj_k~0#1; {11680#true} is VALID [2022-02-21 03:21:08,643 INFO L290 TraceCheckUtils]: 18: Hoare triple {11680#true} assume !main_#t~switch19#1; {11680#true} is VALID [2022-02-21 03:21:08,643 INFO L290 TraceCheckUtils]: 19: Hoare triple {11680#true} main_#t~switch19#1 := main_#t~switch19#1 || 7 == main_~_hj_k~0#1; {11680#true} is VALID [2022-02-21 03:21:08,644 INFO L290 TraceCheckUtils]: 20: Hoare triple {11680#true} assume !main_#t~switch19#1; {11680#true} is VALID [2022-02-21 03:21:08,644 INFO L290 TraceCheckUtils]: 21: Hoare triple {11680#true} main_#t~switch19#1 := main_#t~switch19#1 || 6 == main_~_hj_k~0#1; {11680#true} is VALID [2022-02-21 03:21:08,644 INFO L290 TraceCheckUtils]: 22: Hoare triple {11680#true} assume !main_#t~switch19#1; {11680#true} is VALID [2022-02-21 03:21:08,644 INFO L290 TraceCheckUtils]: 23: Hoare triple {11680#true} main_#t~switch19#1 := main_#t~switch19#1 || 5 == main_~_hj_k~0#1; {11680#true} is VALID [2022-02-21 03:21:08,644 INFO L290 TraceCheckUtils]: 24: Hoare triple {11680#true} assume !main_#t~switch19#1; {11680#true} is VALID [2022-02-21 03:21:08,644 INFO L290 TraceCheckUtils]: 25: Hoare triple {11680#true} main_#t~switch19#1 := main_#t~switch19#1 || 4 == main_~_hj_k~0#1; {11680#true} is VALID [2022-02-21 03:21:08,644 INFO L290 TraceCheckUtils]: 26: Hoare triple {11680#true} assume main_#t~switch19#1;call main_#t~mem27#1 := read~int(main_~_hj_key~0#1.base, 3 + main_~_hj_key~0#1.offset, 1);main_~_hj_i~0#1 := main_~_hj_i~0#1 + 16777216 * (main_#t~mem27#1 % 256);havoc main_#t~mem27#1; {11680#true} is VALID [2022-02-21 03:21:08,644 INFO L290 TraceCheckUtils]: 27: Hoare triple {11680#true} main_#t~switch19#1 := main_#t~switch19#1 || 3 == main_~_hj_k~0#1; {11680#true} is VALID [2022-02-21 03:21:08,644 INFO L290 TraceCheckUtils]: 28: Hoare triple {11680#true} assume main_#t~switch19#1;call main_#t~mem28#1 := read~int(main_~_hj_key~0#1.base, 2 + main_~_hj_key~0#1.offset, 1);main_~_hj_i~0#1 := main_~_hj_i~0#1 + 65536 * (main_#t~mem28#1 % 256);havoc main_#t~mem28#1; {11680#true} is VALID [2022-02-21 03:21:08,645 INFO L290 TraceCheckUtils]: 29: Hoare triple {11680#true} main_#t~switch19#1 := main_#t~switch19#1 || 2 == main_~_hj_k~0#1; {11680#true} is VALID [2022-02-21 03:21:08,645 INFO L290 TraceCheckUtils]: 30: Hoare triple {11680#true} assume main_#t~switch19#1;call main_#t~mem29#1 := read~int(main_~_hj_key~0#1.base, 1 + main_~_hj_key~0#1.offset, 1);main_~_hj_i~0#1 := main_~_hj_i~0#1 + 256 * (main_#t~mem29#1 % 256);havoc main_#t~mem29#1; {11680#true} is VALID [2022-02-21 03:21:08,645 INFO L290 TraceCheckUtils]: 31: Hoare triple {11680#true} main_#t~switch19#1 := main_#t~switch19#1 || 1 == main_~_hj_k~0#1; {11680#true} is VALID [2022-02-21 03:21:08,645 INFO L290 TraceCheckUtils]: 32: Hoare triple {11680#true} assume main_#t~switch19#1;call main_#t~mem30#1 := read~int(main_~_hj_key~0#1.base, main_~_hj_key~0#1.offset, 1);main_~_hj_i~0#1 := main_~_hj_i~0#1 + main_#t~mem30#1 % 256;havoc main_#t~mem30#1; {11680#true} is VALID [2022-02-21 03:21:08,645 INFO L290 TraceCheckUtils]: 33: Hoare triple {11680#true} havoc main_#t~switch19#1; {11680#true} is VALID [2022-02-21 03:21:08,645 INFO L290 TraceCheckUtils]: 34: Hoare triple {11680#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)))); {11680#true} is VALID [2022-02-21 03:21:08,645 INFO L290 TraceCheckUtils]: 35: Hoare triple {11680#true} goto; {11680#true} is VALID [2022-02-21 03:21:08,645 INFO L290 TraceCheckUtils]: 36: Hoare triple {11680#true} goto; {11680#true} is VALID [2022-02-21 03:21:08,645 INFO L290 TraceCheckUtils]: 37: Hoare triple {11680#true} goto; {11680#true} is VALID [2022-02-21 03:21:08,645 INFO L290 TraceCheckUtils]: 38: Hoare triple {11680#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); {11680#true} is VALID [2022-02-21 03:21:08,646 INFO L290 TraceCheckUtils]: 39: Hoare triple {11680#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); {11680#true} is VALID [2022-02-21 03:21:08,646 INFO L290 TraceCheckUtils]: 40: Hoare triple {11680#true} call main_#t~malloc31#1.base, main_#t~malloc31#1.offset := #Ultimate.allocOnHeap(44);call write~$Pointer$(main_#t~malloc31#1.base, main_#t~malloc31#1.offset, main_~user~0#1.base, 8 + main_~user~0#1.offset, 4);havoc main_#t~malloc31#1.base, main_#t~malloc31#1.offset;call main_#t~mem32#1.base, main_#t~mem32#1.offset := read~$Pointer$(main_~user~0#1.base, 8 + main_~user~0#1.offset, 4); {11680#true} is VALID [2022-02-21 03:21:08,646 INFO L290 TraceCheckUtils]: 41: Hoare triple {11680#true} assume !(main_#t~mem32#1.base == 0 && main_#t~mem32#1.offset == 0);havoc main_#t~mem32#1.base, main_#t~mem32#1.offset;call main_#t~mem33#1.base, main_#t~mem33#1.offset := read~$Pointer$(main_~user~0#1.base, 8 + main_~user~0#1.offset, 4); {11680#true} is VALID [2022-02-21 03:21:08,646 INFO L272 TraceCheckUtils]: 42: Hoare triple {11680#true} call main_#t~memset~res34#1.base, main_#t~memset~res34#1.offset := #Ultimate.C_memset(main_#t~mem33#1.base, main_#t~mem33#1.offset, 0, 44); {11680#true} is VALID [2022-02-21 03:21:08,646 INFO L290 TraceCheckUtils]: 43: Hoare triple {11680#true} #t~loopctr188 := 0; {11814#(= |#Ultimate.C_memset_#t~loopctr188| 0)} is VALID [2022-02-21 03:21:08,647 INFO L290 TraceCheckUtils]: 44: Hoare triple {11814#(= |#Ultimate.C_memset_#t~loopctr188| 0)} assume #t~loopctr188 % 4294967296 < #amount % 4294967296;#memory_int := #memory_int[#ptr.base,#ptr.offset + #t~loopctr188 := #value];#memory_$Pointer$.base, #memory_$Pointer$.offset := #memory_$Pointer$.base[#ptr.base,#ptr.offset + #t~loopctr188 := 0], #memory_$Pointer$.offset[#ptr.base,#ptr.offset + #t~loopctr188 := #value % 256];#t~loopctr188 := 1 + #t~loopctr188; {11818#(and (< (mod (+ |#Ultimate.C_memset_#t~loopctr188| 4294967295) 4294967296) (mod |#Ultimate.C_memset_#amount| 4294967296)) (= (+ (- 1) |#Ultimate.C_memset_#t~loopctr188|) 0))} is VALID [2022-02-21 03:21:08,647 INFO L290 TraceCheckUtils]: 45: Hoare triple {11818#(and (< (mod (+ |#Ultimate.C_memset_#t~loopctr188| 4294967295) 4294967296) (mod |#Ultimate.C_memset_#amount| 4294967296)) (= (+ (- 1) |#Ultimate.C_memset_#t~loopctr188|) 0))} assume !(#t~loopctr188 % 4294967296 < #amount % 4294967296); {11680#true} is VALID [2022-02-21 03:21:08,647 INFO L290 TraceCheckUtils]: 46: Hoare triple {11680#true} assume #res.base == #ptr.base && #res.offset == #ptr.offset; {11680#true} is VALID [2022-02-21 03:21:08,647 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {11680#true} {11680#true} #609#return; {11680#true} is VALID [2022-02-21 03:21:08,648 INFO L290 TraceCheckUtils]: 48: Hoare triple {11680#true} havoc main_#t~mem33#1.base, main_#t~mem33#1.offset;havoc main_#t~memset~res34#1.base, main_#t~memset~res34#1.offset;call main_#t~mem35#1.base, main_#t~mem35#1.offset := read~$Pointer$(main_~user~0#1.base, 8 + main_~user~0#1.offset, 4);call write~$Pointer$(main_~user~0#1.base, 8 + main_~user~0#1.offset, main_#t~mem35#1.base, 16 + main_#t~mem35#1.offset, 4);havoc main_#t~mem35#1.base, main_#t~mem35#1.offset;call main_#t~mem36#1.base, main_#t~mem36#1.offset := read~$Pointer$(main_~user~0#1.base, 8 + main_~user~0#1.offset, 4);call write~int(32, main_#t~mem36#1.base, 4 + main_#t~mem36#1.offset, 4);havoc main_#t~mem36#1.base, main_#t~mem36#1.offset;call main_#t~mem37#1.base, main_#t~mem37#1.offset := read~$Pointer$(main_~user~0#1.base, 8 + main_~user~0#1.offset, 4);call write~int(5, main_#t~mem37#1.base, 8 + main_#t~mem37#1.offset, 4);havoc main_#t~mem37#1.base, main_#t~mem37#1.offset;call main_#t~mem38#1.base, main_#t~mem38#1.offset := read~$Pointer$(main_~user~0#1.base, 8 + main_~user~0#1.offset, 4);call write~int((if 8 + main_~user~0#1.offset - main_~user~0#1.offset < 0 && 0 != (8 + main_~user~0#1.offset - main_~user~0#1.offset) % 1 then 1 + (8 + main_~user~0#1.offset - main_~user~0#1.offset) / 1 else (8 + main_~user~0#1.offset - main_~user~0#1.offset) / 1), main_#t~mem38#1.base, 20 + main_#t~mem38#1.offset, 4);havoc main_#t~mem38#1.base, main_#t~mem38#1.offset;call main_#t~mem39#1.base, main_#t~mem39#1.offset := read~$Pointer$(main_~user~0#1.base, 8 + main_~user~0#1.offset, 4);call main_#t~malloc40#1.base, main_#t~malloc40#1.offset := #Ultimate.allocOnHeap(384);call write~$Pointer$(main_#t~malloc40#1.base, main_#t~malloc40#1.offset, main_#t~mem39#1.base, main_#t~mem39#1.offset, 4);havoc main_#t~mem39#1.base, main_#t~mem39#1.offset;havoc main_#t~malloc40#1.base, main_#t~malloc40#1.offset;call main_#t~mem41#1.base, main_#t~mem41#1.offset := read~$Pointer$(main_~user~0#1.base, 8 + main_~user~0#1.offset, 4);call write~int(2685476833, main_#t~mem41#1.base, 40 + main_#t~mem41#1.offset, 4);havoc main_#t~mem41#1.base, main_#t~mem41#1.offset;call main_#t~mem42#1.base, main_#t~mem42#1.offset := read~$Pointer$(main_~user~0#1.base, 8 + main_~user~0#1.offset, 4);call main_#t~mem43#1.base, main_#t~mem43#1.offset := read~$Pointer$(main_#t~mem42#1.base, main_#t~mem42#1.offset, 4); {11680#true} is VALID [2022-02-21 03:21:08,648 INFO L290 TraceCheckUtils]: 49: Hoare triple {11680#true} assume !(main_#t~mem43#1.base == 0 && main_#t~mem43#1.offset == 0);havoc main_#t~mem42#1.base, main_#t~mem42#1.offset;havoc main_#t~mem43#1.base, main_#t~mem43#1.offset;call main_#t~mem45#1.base, main_#t~mem45#1.offset := read~$Pointer$(main_~user~0#1.base, 8 + main_~user~0#1.offset, 4);call main_#t~mem46#1.base, main_#t~mem46#1.offset := read~$Pointer$(main_#t~mem45#1.base, main_#t~mem45#1.offset, 4); {11680#true} is VALID [2022-02-21 03:21:08,648 INFO L272 TraceCheckUtils]: 50: Hoare triple {11680#true} call main_#t~memset~res47#1.base, main_#t~memset~res47#1.offset := #Ultimate.C_memset(main_#t~mem46#1.base, main_#t~mem46#1.offset, 0, 384); {11680#true} is VALID [2022-02-21 03:21:08,648 INFO L290 TraceCheckUtils]: 51: Hoare triple {11680#true} #t~loopctr188 := 0; {11814#(= |#Ultimate.C_memset_#t~loopctr188| 0)} is VALID [2022-02-21 03:21:08,649 INFO L290 TraceCheckUtils]: 52: Hoare triple {11814#(= |#Ultimate.C_memset_#t~loopctr188| 0)} assume #t~loopctr188 % 4294967296 < #amount % 4294967296;#memory_int := #memory_int[#ptr.base,#ptr.offset + #t~loopctr188 := #value];#memory_$Pointer$.base, #memory_$Pointer$.offset := #memory_$Pointer$.base[#ptr.base,#ptr.offset + #t~loopctr188 := 0], #memory_$Pointer$.offset[#ptr.base,#ptr.offset + #t~loopctr188 := #value % 256];#t~loopctr188 := 1 + #t~loopctr188; {11818#(and (< (mod (+ |#Ultimate.C_memset_#t~loopctr188| 4294967295) 4294967296) (mod |#Ultimate.C_memset_#amount| 4294967296)) (= (+ (- 1) |#Ultimate.C_memset_#t~loopctr188|) 0))} is VALID [2022-02-21 03:21:08,649 INFO L290 TraceCheckUtils]: 53: Hoare triple {11818#(and (< (mod (+ |#Ultimate.C_memset_#t~loopctr188| 4294967295) 4294967296) (mod |#Ultimate.C_memset_#amount| 4294967296)) (= (+ (- 1) |#Ultimate.C_memset_#t~loopctr188|) 0))} assume !(#t~loopctr188 % 4294967296 < #amount % 4294967296); {11846#(and (< 0 (mod |#Ultimate.C_memset_#amount| 4294967296)) (not (< 1 (mod |#Ultimate.C_memset_#amount| 4294967296))))} is VALID [2022-02-21 03:21:08,650 INFO L290 TraceCheckUtils]: 54: Hoare triple {11846#(and (< 0 (mod |#Ultimate.C_memset_#amount| 4294967296)) (not (< 1 (mod |#Ultimate.C_memset_#amount| 4294967296))))} assume #res.base == #ptr.base && #res.offset == #ptr.offset; {11846#(and (< 0 (mod |#Ultimate.C_memset_#amount| 4294967296)) (not (< 1 (mod |#Ultimate.C_memset_#amount| 4294967296))))} is VALID [2022-02-21 03:21:08,651 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {11846#(and (< 0 (mod |#Ultimate.C_memset_#amount| 4294967296)) (not (< 1 (mod |#Ultimate.C_memset_#amount| 4294967296))))} {11680#true} #611#return; {11681#false} is VALID [2022-02-21 03:21:08,651 INFO L290 TraceCheckUtils]: 56: Hoare triple {11681#false} havoc main_#t~mem45#1.base, main_#t~mem45#1.offset;havoc main_#t~mem46#1.base, main_#t~mem46#1.offset;havoc main_#t~memset~res47#1.base, main_#t~memset~res47#1.offset; {11681#false} is VALID [2022-02-21 03:21:08,651 INFO L290 TraceCheckUtils]: 57: Hoare triple {11681#false} goto; {11681#false} is VALID [2022-02-21 03:21:08,652 INFO L290 TraceCheckUtils]: 58: Hoare triple {11681#false} main_~users~0#1.base, main_~users~0#1.offset := main_~user~0#1.base, main_~user~0#1.offset; {11681#false} is VALID [2022-02-21 03:21:08,652 INFO L290 TraceCheckUtils]: 59: Hoare triple {11681#false} havoc main_~_ha_bkt~0#1;call main_#t~mem56#1.base, main_#t~mem56#1.offset := read~$Pointer$(main_~users~0#1.base, 8 + main_~users~0#1.offset, 4);call main_#t~mem57#1 := read~int(main_#t~mem56#1.base, 12 + main_#t~mem56#1.offset, 4);main_#t~post58#1 := main_#t~mem57#1;call write~int(1 + main_#t~post58#1, main_#t~mem56#1.base, 12 + main_#t~mem56#1.offset, 4);havoc main_#t~mem56#1.base, main_#t~mem56#1.offset;havoc main_#t~mem57#1;havoc main_#t~post58#1; {11681#false} is VALID [2022-02-21 03:21:08,652 INFO L290 TraceCheckUtils]: 60: Hoare triple {11681#false} call main_#t~mem59#1.base, main_#t~mem59#1.offset := read~$Pointer$(main_~users~0#1.base, 8 + main_~users~0#1.offset, 4);call main_#t~mem60#1 := read~int(main_#t~mem59#1.base, 4 + main_#t~mem59#1.offset, 4);main_~_ha_bkt~0#1 := (if 0 == main_~_ha_hashv~0#1 || 0 == main_#t~mem60#1 - 1 then 0 else (if 1 == main_#t~mem60#1 - 1 then (if 1 == main_~_ha_hashv~0#1 || 0 == main_~_ha_hashv~0#1 then main_~_ha_hashv~0#1 else (if main_~_ha_hashv~0#1 >= 0 then main_~_ha_hashv~0#1 % 2 else ~bitwiseAnd(main_~_ha_hashv~0#1, main_#t~mem60#1 - 1))) else (if 1 == main_~_ha_hashv~0#1 then (if 1 == main_#t~mem60#1 - 1 || 0 == main_#t~mem60#1 - 1 then main_#t~mem60#1 - 1 else (if main_#t~mem60#1 - 1 >= 0 then (main_#t~mem60#1 - 1) % 2 else ~bitwiseAnd(main_~_ha_hashv~0#1, main_#t~mem60#1 - 1))) else ~bitwiseAnd(main_~_ha_hashv~0#1, main_#t~mem60#1 - 1))));havoc main_#t~mem59#1.base, main_#t~mem59#1.offset;havoc main_#t~mem60#1; {11681#false} is VALID [2022-02-21 03:21:08,652 INFO L290 TraceCheckUtils]: 61: Hoare triple {11681#false} goto; {11681#false} is VALID [2022-02-21 03:21:08,652 INFO L290 TraceCheckUtils]: 62: Hoare triple {11681#false} call main_#t~mem61#1.base, main_#t~mem61#1.offset := read~$Pointer$(main_~users~0#1.base, 8 + main_~users~0#1.offset, 4);call main_#t~mem62#1.base, main_#t~mem62#1.offset := read~$Pointer$(main_#t~mem61#1.base, main_#t~mem61#1.offset, 4);main_~_ha_head~0#1.base, main_~_ha_head~0#1.offset := main_#t~mem62#1.base, main_#t~mem62#1.offset + 12 * (if main_~_ha_bkt~0#1 % 4294967296 % 4294967296 <= 2147483647 then main_~_ha_bkt~0#1 % 4294967296 % 4294967296 else main_~_ha_bkt~0#1 % 4294967296 % 4294967296 - 4294967296);havoc main_#t~mem61#1.base, main_#t~mem61#1.offset;havoc main_#t~mem62#1.base, main_#t~mem62#1.offset;call main_#t~mem63#1 := read~int(main_~_ha_head~0#1.base, 4 + main_~_ha_head~0#1.offset, 4);main_#t~post64#1 := main_#t~mem63#1;call write~int(1 + main_#t~post64#1, main_~_ha_head~0#1.base, 4 + main_~_ha_head~0#1.offset, 4);havoc main_#t~mem63#1;havoc main_#t~post64#1;call main_#t~mem65#1.base, main_#t~mem65#1.offset := read~$Pointer$(main_~_ha_head~0#1.base, main_~_ha_head~0#1.offset, 4);call write~$Pointer$(main_#t~mem65#1.base, main_#t~mem65#1.offset, main_~user~0#1.base, 24 + main_~user~0#1.offset, 4);havoc main_#t~mem65#1.base, main_#t~mem65#1.offset;call write~$Pointer$(0, 0, main_~user~0#1.base, 20 + main_~user~0#1.offset, 4);call main_#t~mem66#1.base, main_#t~mem66#1.offset := read~$Pointer$(main_~_ha_head~0#1.base, main_~_ha_head~0#1.offset, 4); {11681#false} is VALID [2022-02-21 03:21:08,652 INFO L290 TraceCheckUtils]: 63: Hoare triple {11681#false} assume main_#t~mem66#1.base != 0 || main_#t~mem66#1.offset != 0;havoc main_#t~mem66#1.base, main_#t~mem66#1.offset;call main_#t~mem67#1.base, main_#t~mem67#1.offset := read~$Pointer$(main_~_ha_head~0#1.base, main_~_ha_head~0#1.offset, 4);call write~$Pointer$(main_~user~0#1.base, 8 + main_~user~0#1.offset, main_#t~mem67#1.base, 12 + main_#t~mem67#1.offset, 4);havoc main_#t~mem67#1.base, main_#t~mem67#1.offset; {11681#false} is VALID [2022-02-21 03:21:08,652 INFO L290 TraceCheckUtils]: 64: Hoare triple {11681#false} call write~$Pointer$(main_~user~0#1.base, 8 + main_~user~0#1.offset, main_~_ha_head~0#1.base, main_~_ha_head~0#1.offset, 4);call main_#t~mem69#1 := read~int(main_~_ha_head~0#1.base, 4 + main_~_ha_head~0#1.offset, 4);call main_#t~mem68#1 := read~int(main_~_ha_head~0#1.base, 8 + main_~_ha_head~0#1.offset, 4);main_#t~short72#1 := main_#t~mem69#1 % 4294967296 >= 10 * (1 + main_#t~mem68#1) % 4294967296; {11681#false} is VALID [2022-02-21 03:21:08,652 INFO L290 TraceCheckUtils]: 65: Hoare triple {11681#false} assume main_#t~short72#1;call main_#t~mem70#1.base, main_#t~mem70#1.offset := read~$Pointer$(main_~user~0#1.base, 8 + main_~user~0#1.offset, 4);call main_#t~mem71#1 := read~int(main_#t~mem70#1.base, 36 + main_#t~mem70#1.offset, 4);main_#t~short72#1 := 0 == main_#t~mem71#1 % 4294967296; {11681#false} is VALID [2022-02-21 03:21:08,652 INFO L290 TraceCheckUtils]: 66: Hoare triple {11681#false} assume !main_#t~short72#1;havoc main_#t~mem69#1;havoc main_#t~mem68#1;havoc main_#t~mem70#1.base, main_#t~mem70#1.offset;havoc main_#t~mem71#1;havoc main_#t~short72#1; {11681#false} is VALID [2022-02-21 03:21:08,653 INFO L290 TraceCheckUtils]: 67: Hoare triple {11681#false} goto; {11681#false} is VALID [2022-02-21 03:21:08,653 INFO L290 TraceCheckUtils]: 68: Hoare triple {11681#false} goto; {11681#false} is VALID [2022-02-21 03:21:08,653 INFO L290 TraceCheckUtils]: 69: Hoare triple {11681#false} goto; {11681#false} is VALID [2022-02-21 03:21:08,653 INFO L290 TraceCheckUtils]: 70: Hoare triple {11681#false} goto; {11681#false} is VALID [2022-02-21 03:21:08,653 INFO L290 TraceCheckUtils]: 71: Hoare triple {11681#false} main_#t~post5#1 := main_~i~0#1; {11681#false} is VALID [2022-02-21 03:21:08,653 INFO L290 TraceCheckUtils]: 72: Hoare triple {11681#false} assume 1 + main_#t~post5#1 <= 2147483647; {11681#false} is VALID [2022-02-21 03:21:08,653 INFO L290 TraceCheckUtils]: 73: Hoare triple {11681#false} assume 1 + main_#t~post5#1 >= -2147483648;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; {11681#false} is VALID [2022-02-21 03:21:08,653 INFO L290 TraceCheckUtils]: 74: Hoare triple {11681#false} assume !!(main_~i~0#1 < 10);call main_#t~malloc6#1.base, main_#t~malloc6#1.offset := #Ultimate.allocOnHeap(40);main_~user~0#1.base, main_~user~0#1.offset := main_#t~malloc6#1.base, main_#t~malloc6#1.offset;havoc main_#t~malloc6#1.base, main_#t~malloc6#1.offset; {11681#false} is VALID [2022-02-21 03:21:08,653 INFO L290 TraceCheckUtils]: 75: Hoare triple {11681#false} assume !(main_~user~0#1.base == 0 && main_~user~0#1.offset == 0); {11681#false} is VALID [2022-02-21 03:21:08,654 INFO L290 TraceCheckUtils]: 76: Hoare triple {11681#false} call write~int(main_~i~0#1, main_~user~0#1.base, main_~user~0#1.offset, 4); {11681#false} is VALID [2022-02-21 03:21:08,654 INFO L290 TraceCheckUtils]: 77: Hoare triple {11681#false} assume !(main_~i~0#1 * main_~i~0#1 <= 2147483647); {11681#false} is VALID [2022-02-21 03:21:08,654 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 6 proven. 4 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-02-21 03:21:08,654 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-21 03:21:09,481 INFO L290 TraceCheckUtils]: 77: Hoare triple {11681#false} assume !(main_~i~0#1 * main_~i~0#1 <= 2147483647); {11681#false} is VALID [2022-02-21 03:21:09,481 INFO L290 TraceCheckUtils]: 76: Hoare triple {11681#false} call write~int(main_~i~0#1, main_~user~0#1.base, main_~user~0#1.offset, 4); {11681#false} is VALID [2022-02-21 03:21:09,481 INFO L290 TraceCheckUtils]: 75: Hoare triple {11681#false} assume !(main_~user~0#1.base == 0 && main_~user~0#1.offset == 0); {11681#false} is VALID [2022-02-21 03:21:09,481 INFO L290 TraceCheckUtils]: 74: Hoare triple {11681#false} assume !!(main_~i~0#1 < 10);call main_#t~malloc6#1.base, main_#t~malloc6#1.offset := #Ultimate.allocOnHeap(40);main_~user~0#1.base, main_~user~0#1.offset := main_#t~malloc6#1.base, main_#t~malloc6#1.offset;havoc main_#t~malloc6#1.base, main_#t~malloc6#1.offset; {11681#false} is VALID [2022-02-21 03:21:09,481 INFO L290 TraceCheckUtils]: 73: Hoare triple {11681#false} assume 1 + main_#t~post5#1 >= -2147483648;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; {11681#false} is VALID [2022-02-21 03:21:09,481 INFO L290 TraceCheckUtils]: 72: Hoare triple {11681#false} assume 1 + main_#t~post5#1 <= 2147483647; {11681#false} is VALID [2022-02-21 03:21:09,482 INFO L290 TraceCheckUtils]: 71: Hoare triple {11681#false} main_#t~post5#1 := main_~i~0#1; {11681#false} is VALID [2022-02-21 03:21:09,482 INFO L290 TraceCheckUtils]: 70: Hoare triple {11681#false} goto; {11681#false} is VALID [2022-02-21 03:21:09,482 INFO L290 TraceCheckUtils]: 69: Hoare triple {11681#false} goto; {11681#false} is VALID [2022-02-21 03:21:09,482 INFO L290 TraceCheckUtils]: 68: Hoare triple {11681#false} goto; {11681#false} is VALID [2022-02-21 03:21:09,482 INFO L290 TraceCheckUtils]: 67: Hoare triple {11681#false} goto; {11681#false} is VALID [2022-02-21 03:21:09,482 INFO L290 TraceCheckUtils]: 66: Hoare triple {11681#false} assume !main_#t~short72#1;havoc main_#t~mem69#1;havoc main_#t~mem68#1;havoc main_#t~mem70#1.base, main_#t~mem70#1.offset;havoc main_#t~mem71#1;havoc main_#t~short72#1; {11681#false} is VALID [2022-02-21 03:21:09,482 INFO L290 TraceCheckUtils]: 65: Hoare triple {11681#false} assume main_#t~short72#1;call main_#t~mem70#1.base, main_#t~mem70#1.offset := read~$Pointer$(main_~user~0#1.base, 8 + main_~user~0#1.offset, 4);call main_#t~mem71#1 := read~int(main_#t~mem70#1.base, 36 + main_#t~mem70#1.offset, 4);main_#t~short72#1 := 0 == main_#t~mem71#1 % 4294967296; {11681#false} is VALID [2022-02-21 03:21:09,482 INFO L290 TraceCheckUtils]: 64: Hoare triple {11681#false} call write~$Pointer$(main_~user~0#1.base, 8 + main_~user~0#1.offset, main_~_ha_head~0#1.base, main_~_ha_head~0#1.offset, 4);call main_#t~mem69#1 := read~int(main_~_ha_head~0#1.base, 4 + main_~_ha_head~0#1.offset, 4);call main_#t~mem68#1 := read~int(main_~_ha_head~0#1.base, 8 + main_~_ha_head~0#1.offset, 4);main_#t~short72#1 := main_#t~mem69#1 % 4294967296 >= 10 * (1 + main_#t~mem68#1) % 4294967296; {11681#false} is VALID [2022-02-21 03:21:09,482 INFO L290 TraceCheckUtils]: 63: Hoare triple {11681#false} assume main_#t~mem66#1.base != 0 || main_#t~mem66#1.offset != 0;havoc main_#t~mem66#1.base, main_#t~mem66#1.offset;call main_#t~mem67#1.base, main_#t~mem67#1.offset := read~$Pointer$(main_~_ha_head~0#1.base, main_~_ha_head~0#1.offset, 4);call write~$Pointer$(main_~user~0#1.base, 8 + main_~user~0#1.offset, main_#t~mem67#1.base, 12 + main_#t~mem67#1.offset, 4);havoc main_#t~mem67#1.base, main_#t~mem67#1.offset; {11681#false} is VALID [2022-02-21 03:21:09,483 INFO L290 TraceCheckUtils]: 62: Hoare triple {11681#false} call main_#t~mem61#1.base, main_#t~mem61#1.offset := read~$Pointer$(main_~users~0#1.base, 8 + main_~users~0#1.offset, 4);call main_#t~mem62#1.base, main_#t~mem62#1.offset := read~$Pointer$(main_#t~mem61#1.base, main_#t~mem61#1.offset, 4);main_~_ha_head~0#1.base, main_~_ha_head~0#1.offset := main_#t~mem62#1.base, main_#t~mem62#1.offset + 12 * (if main_~_ha_bkt~0#1 % 4294967296 % 4294967296 <= 2147483647 then main_~_ha_bkt~0#1 % 4294967296 % 4294967296 else main_~_ha_bkt~0#1 % 4294967296 % 4294967296 - 4294967296);havoc main_#t~mem61#1.base, main_#t~mem61#1.offset;havoc main_#t~mem62#1.base, main_#t~mem62#1.offset;call main_#t~mem63#1 := read~int(main_~_ha_head~0#1.base, 4 + main_~_ha_head~0#1.offset, 4);main_#t~post64#1 := main_#t~mem63#1;call write~int(1 + main_#t~post64#1, main_~_ha_head~0#1.base, 4 + main_~_ha_head~0#1.offset, 4);havoc main_#t~mem63#1;havoc main_#t~post64#1;call main_#t~mem65#1.base, main_#t~mem65#1.offset := read~$Pointer$(main_~_ha_head~0#1.base, main_~_ha_head~0#1.offset, 4);call write~$Pointer$(main_#t~mem65#1.base, main_#t~mem65#1.offset, main_~user~0#1.base, 24 + main_~user~0#1.offset, 4);havoc main_#t~mem65#1.base, main_#t~mem65#1.offset;call write~$Pointer$(0, 0, main_~user~0#1.base, 20 + main_~user~0#1.offset, 4);call main_#t~mem66#1.base, main_#t~mem66#1.offset := read~$Pointer$(main_~_ha_head~0#1.base, main_~_ha_head~0#1.offset, 4); {11681#false} is VALID [2022-02-21 03:21:09,483 INFO L290 TraceCheckUtils]: 61: Hoare triple {11681#false} goto; {11681#false} is VALID [2022-02-21 03:21:09,483 INFO L290 TraceCheckUtils]: 60: Hoare triple {11681#false} call main_#t~mem59#1.base, main_#t~mem59#1.offset := read~$Pointer$(main_~users~0#1.base, 8 + main_~users~0#1.offset, 4);call main_#t~mem60#1 := read~int(main_#t~mem59#1.base, 4 + main_#t~mem59#1.offset, 4);main_~_ha_bkt~0#1 := (if 0 == main_~_ha_hashv~0#1 || 0 == main_#t~mem60#1 - 1 then 0 else (if 1 == main_#t~mem60#1 - 1 then (if 1 == main_~_ha_hashv~0#1 || 0 == main_~_ha_hashv~0#1 then main_~_ha_hashv~0#1 else (if main_~_ha_hashv~0#1 >= 0 then main_~_ha_hashv~0#1 % 2 else ~bitwiseAnd(main_~_ha_hashv~0#1, main_#t~mem60#1 - 1))) else (if 1 == main_~_ha_hashv~0#1 then (if 1 == main_#t~mem60#1 - 1 || 0 == main_#t~mem60#1 - 1 then main_#t~mem60#1 - 1 else (if main_#t~mem60#1 - 1 >= 0 then (main_#t~mem60#1 - 1) % 2 else ~bitwiseAnd(main_~_ha_hashv~0#1, main_#t~mem60#1 - 1))) else ~bitwiseAnd(main_~_ha_hashv~0#1, main_#t~mem60#1 - 1))));havoc main_#t~mem59#1.base, main_#t~mem59#1.offset;havoc main_#t~mem60#1; {11681#false} is VALID [2022-02-21 03:21:09,483 INFO L290 TraceCheckUtils]: 59: Hoare triple {11681#false} havoc main_~_ha_bkt~0#1;call main_#t~mem56#1.base, main_#t~mem56#1.offset := read~$Pointer$(main_~users~0#1.base, 8 + main_~users~0#1.offset, 4);call main_#t~mem57#1 := read~int(main_#t~mem56#1.base, 12 + main_#t~mem56#1.offset, 4);main_#t~post58#1 := main_#t~mem57#1;call write~int(1 + main_#t~post58#1, main_#t~mem56#1.base, 12 + main_#t~mem56#1.offset, 4);havoc main_#t~mem56#1.base, main_#t~mem56#1.offset;havoc main_#t~mem57#1;havoc main_#t~post58#1; {11681#false} is VALID [2022-02-21 03:21:09,483 INFO L290 TraceCheckUtils]: 58: Hoare triple {11681#false} main_~users~0#1.base, main_~users~0#1.offset := main_~user~0#1.base, main_~user~0#1.offset; {11681#false} is VALID [2022-02-21 03:21:09,483 INFO L290 TraceCheckUtils]: 57: Hoare triple {11681#false} goto; {11681#false} is VALID [2022-02-21 03:21:09,483 INFO L290 TraceCheckUtils]: 56: Hoare triple {11681#false} havoc main_#t~mem45#1.base, main_#t~mem45#1.offset;havoc main_#t~mem46#1.base, main_#t~mem46#1.offset;havoc main_#t~memset~res47#1.base, main_#t~memset~res47#1.offset; {11681#false} is VALID [2022-02-21 03:21:09,484 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {11988#(not (= 384 |#Ultimate.C_memset_#amount|))} {11680#true} #611#return; {11681#false} is VALID [2022-02-21 03:21:09,485 INFO L290 TraceCheckUtils]: 54: Hoare triple {11988#(not (= 384 |#Ultimate.C_memset_#amount|))} assume #res.base == #ptr.base && #res.offset == #ptr.offset; {11988#(not (= 384 |#Ultimate.C_memset_#amount|))} is VALID [2022-02-21 03:21:09,485 INFO L290 TraceCheckUtils]: 53: Hoare triple {11995#(or (not (= 384 |#Ultimate.C_memset_#amount|)) (< (mod |#Ultimate.C_memset_#t~loopctr188| 4294967296) (mod |#Ultimate.C_memset_#amount| 4294967296)))} assume !(#t~loopctr188 % 4294967296 < #amount % 4294967296); {11988#(not (= 384 |#Ultimate.C_memset_#amount|))} is VALID [2022-02-21 03:21:09,488 INFO L290 TraceCheckUtils]: 52: Hoare triple {11999#(or (not (= 384 |#Ultimate.C_memset_#amount|)) (not (< (mod |#Ultimate.C_memset_#t~loopctr188| 4294967296) (mod |#Ultimate.C_memset_#amount| 4294967296))) (< (mod (+ |#Ultimate.C_memset_#t~loopctr188| 1) 4294967296) (mod |#Ultimate.C_memset_#amount| 4294967296)))} assume #t~loopctr188 % 4294967296 < #amount % 4294967296;#memory_int := #memory_int[#ptr.base,#ptr.offset + #t~loopctr188 := #value];#memory_$Pointer$.base, #memory_$Pointer$.offset := #memory_$Pointer$.base[#ptr.base,#ptr.offset + #t~loopctr188 := 0], #memory_$Pointer$.offset[#ptr.base,#ptr.offset + #t~loopctr188 := #value % 256];#t~loopctr188 := 1 + #t~loopctr188; {11995#(or (not (= 384 |#Ultimate.C_memset_#amount|)) (< (mod |#Ultimate.C_memset_#t~loopctr188| 4294967296) (mod |#Ultimate.C_memset_#amount| 4294967296)))} is VALID [2022-02-21 03:21:09,489 INFO L290 TraceCheckUtils]: 51: Hoare triple {11680#true} #t~loopctr188 := 0; {11999#(or (not (= 384 |#Ultimate.C_memset_#amount|)) (not (< (mod |#Ultimate.C_memset_#t~loopctr188| 4294967296) (mod |#Ultimate.C_memset_#amount| 4294967296))) (< (mod (+ |#Ultimate.C_memset_#t~loopctr188| 1) 4294967296) (mod |#Ultimate.C_memset_#amount| 4294967296)))} is VALID [2022-02-21 03:21:09,489 INFO L272 TraceCheckUtils]: 50: Hoare triple {11680#true} call main_#t~memset~res47#1.base, main_#t~memset~res47#1.offset := #Ultimate.C_memset(main_#t~mem46#1.base, main_#t~mem46#1.offset, 0, 384); {11680#true} is VALID [2022-02-21 03:21:09,489 INFO L290 TraceCheckUtils]: 49: Hoare triple {11680#true} assume !(main_#t~mem43#1.base == 0 && main_#t~mem43#1.offset == 0);havoc main_#t~mem42#1.base, main_#t~mem42#1.offset;havoc main_#t~mem43#1.base, main_#t~mem43#1.offset;call main_#t~mem45#1.base, main_#t~mem45#1.offset := read~$Pointer$(main_~user~0#1.base, 8 + main_~user~0#1.offset, 4);call main_#t~mem46#1.base, main_#t~mem46#1.offset := read~$Pointer$(main_#t~mem45#1.base, main_#t~mem45#1.offset, 4); {11680#true} is VALID [2022-02-21 03:21:09,489 INFO L290 TraceCheckUtils]: 48: Hoare triple {11680#true} havoc main_#t~mem33#1.base, main_#t~mem33#1.offset;havoc main_#t~memset~res34#1.base, main_#t~memset~res34#1.offset;call main_#t~mem35#1.base, main_#t~mem35#1.offset := read~$Pointer$(main_~user~0#1.base, 8 + main_~user~0#1.offset, 4);call write~$Pointer$(main_~user~0#1.base, 8 + main_~user~0#1.offset, main_#t~mem35#1.base, 16 + main_#t~mem35#1.offset, 4);havoc main_#t~mem35#1.base, main_#t~mem35#1.offset;call main_#t~mem36#1.base, main_#t~mem36#1.offset := read~$Pointer$(main_~user~0#1.base, 8 + main_~user~0#1.offset, 4);call write~int(32, main_#t~mem36#1.base, 4 + main_#t~mem36#1.offset, 4);havoc main_#t~mem36#1.base, main_#t~mem36#1.offset;call main_#t~mem37#1.base, main_#t~mem37#1.offset := read~$Pointer$(main_~user~0#1.base, 8 + main_~user~0#1.offset, 4);call write~int(5, main_#t~mem37#1.base, 8 + main_#t~mem37#1.offset, 4);havoc main_#t~mem37#1.base, main_#t~mem37#1.offset;call main_#t~mem38#1.base, main_#t~mem38#1.offset := read~$Pointer$(main_~user~0#1.base, 8 + main_~user~0#1.offset, 4);call write~int((if 8 + main_~user~0#1.offset - main_~user~0#1.offset < 0 && 0 != (8 + main_~user~0#1.offset - main_~user~0#1.offset) % 1 then 1 + (8 + main_~user~0#1.offset - main_~user~0#1.offset) / 1 else (8 + main_~user~0#1.offset - main_~user~0#1.offset) / 1), main_#t~mem38#1.base, 20 + main_#t~mem38#1.offset, 4);havoc main_#t~mem38#1.base, main_#t~mem38#1.offset;call main_#t~mem39#1.base, main_#t~mem39#1.offset := read~$Pointer$(main_~user~0#1.base, 8 + main_~user~0#1.offset, 4);call main_#t~malloc40#1.base, main_#t~malloc40#1.offset := #Ultimate.allocOnHeap(384);call write~$Pointer$(main_#t~malloc40#1.base, main_#t~malloc40#1.offset, main_#t~mem39#1.base, main_#t~mem39#1.offset, 4);havoc main_#t~mem39#1.base, main_#t~mem39#1.offset;havoc main_#t~malloc40#1.base, main_#t~malloc40#1.offset;call main_#t~mem41#1.base, main_#t~mem41#1.offset := read~$Pointer$(main_~user~0#1.base, 8 + main_~user~0#1.offset, 4);call write~int(2685476833, main_#t~mem41#1.base, 40 + main_#t~mem41#1.offset, 4);havoc main_#t~mem41#1.base, main_#t~mem41#1.offset;call main_#t~mem42#1.base, main_#t~mem42#1.offset := read~$Pointer$(main_~user~0#1.base, 8 + main_~user~0#1.offset, 4);call main_#t~mem43#1.base, main_#t~mem43#1.offset := read~$Pointer$(main_#t~mem42#1.base, main_#t~mem42#1.offset, 4); {11680#true} is VALID [2022-02-21 03:21:09,489 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {11680#true} {11680#true} #609#return; {11680#true} is VALID [2022-02-21 03:21:09,489 INFO L290 TraceCheckUtils]: 46: Hoare triple {11680#true} assume #res.base == #ptr.base && #res.offset == #ptr.offset; {11680#true} is VALID [2022-02-21 03:21:09,489 INFO L290 TraceCheckUtils]: 45: Hoare triple {11680#true} assume !(#t~loopctr188 % 4294967296 < #amount % 4294967296); {11680#true} is VALID [2022-02-21 03:21:09,490 INFO L290 TraceCheckUtils]: 44: Hoare triple {11680#true} assume #t~loopctr188 % 4294967296 < #amount % 4294967296;#memory_int := #memory_int[#ptr.base,#ptr.offset + #t~loopctr188 := #value];#memory_$Pointer$.base, #memory_$Pointer$.offset := #memory_$Pointer$.base[#ptr.base,#ptr.offset + #t~loopctr188 := 0], #memory_$Pointer$.offset[#ptr.base,#ptr.offset + #t~loopctr188 := #value % 256];#t~loopctr188 := 1 + #t~loopctr188; {11680#true} is VALID [2022-02-21 03:21:09,490 INFO L290 TraceCheckUtils]: 43: Hoare triple {11680#true} #t~loopctr188 := 0; {11680#true} is VALID [2022-02-21 03:21:09,490 INFO L272 TraceCheckUtils]: 42: Hoare triple {11680#true} call main_#t~memset~res34#1.base, main_#t~memset~res34#1.offset := #Ultimate.C_memset(main_#t~mem33#1.base, main_#t~mem33#1.offset, 0, 44); {11680#true} is VALID [2022-02-21 03:21:09,490 INFO L290 TraceCheckUtils]: 41: Hoare triple {11680#true} assume !(main_#t~mem32#1.base == 0 && main_#t~mem32#1.offset == 0);havoc main_#t~mem32#1.base, main_#t~mem32#1.offset;call main_#t~mem33#1.base, main_#t~mem33#1.offset := read~$Pointer$(main_~user~0#1.base, 8 + main_~user~0#1.offset, 4); {11680#true} is VALID [2022-02-21 03:21:09,490 INFO L290 TraceCheckUtils]: 40: Hoare triple {11680#true} call main_#t~malloc31#1.base, main_#t~malloc31#1.offset := #Ultimate.allocOnHeap(44);call write~$Pointer$(main_#t~malloc31#1.base, main_#t~malloc31#1.offset, main_~user~0#1.base, 8 + main_~user~0#1.offset, 4);havoc main_#t~malloc31#1.base, main_#t~malloc31#1.offset;call main_#t~mem32#1.base, main_#t~mem32#1.offset := read~$Pointer$(main_~user~0#1.base, 8 + main_~user~0#1.offset, 4); {11680#true} is VALID [2022-02-21 03:21:09,490 INFO L290 TraceCheckUtils]: 39: Hoare triple {11680#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); {11680#true} is VALID [2022-02-21 03:21:09,490 INFO L290 TraceCheckUtils]: 38: Hoare triple {11680#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); {11680#true} is VALID [2022-02-21 03:21:09,490 INFO L290 TraceCheckUtils]: 37: Hoare triple {11680#true} goto; {11680#true} is VALID [2022-02-21 03:21:09,490 INFO L290 TraceCheckUtils]: 36: Hoare triple {11680#true} goto; {11680#true} is VALID [2022-02-21 03:21:09,490 INFO L290 TraceCheckUtils]: 35: Hoare triple {11680#true} goto; {11680#true} is VALID [2022-02-21 03:21:09,491 INFO L290 TraceCheckUtils]: 34: Hoare triple {11680#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)))); {11680#true} is VALID [2022-02-21 03:21:09,491 INFO L290 TraceCheckUtils]: 33: Hoare triple {11680#true} havoc main_#t~switch19#1; {11680#true} is VALID [2022-02-21 03:21:09,491 INFO L290 TraceCheckUtils]: 32: Hoare triple {11680#true} assume main_#t~switch19#1;call main_#t~mem30#1 := read~int(main_~_hj_key~0#1.base, main_~_hj_key~0#1.offset, 1);main_~_hj_i~0#1 := main_~_hj_i~0#1 + main_#t~mem30#1 % 256;havoc main_#t~mem30#1; {11680#true} is VALID [2022-02-21 03:21:09,491 INFO L290 TraceCheckUtils]: 31: Hoare triple {11680#true} main_#t~switch19#1 := main_#t~switch19#1 || 1 == main_~_hj_k~0#1; {11680#true} is VALID [2022-02-21 03:21:09,491 INFO L290 TraceCheckUtils]: 30: Hoare triple {11680#true} assume main_#t~switch19#1;call main_#t~mem29#1 := read~int(main_~_hj_key~0#1.base, 1 + main_~_hj_key~0#1.offset, 1);main_~_hj_i~0#1 := main_~_hj_i~0#1 + 256 * (main_#t~mem29#1 % 256);havoc main_#t~mem29#1; {11680#true} is VALID [2022-02-21 03:21:09,491 INFO L290 TraceCheckUtils]: 29: Hoare triple {11680#true} main_#t~switch19#1 := main_#t~switch19#1 || 2 == main_~_hj_k~0#1; {11680#true} is VALID [2022-02-21 03:21:09,491 INFO L290 TraceCheckUtils]: 28: Hoare triple {11680#true} assume main_#t~switch19#1;call main_#t~mem28#1 := read~int(main_~_hj_key~0#1.base, 2 + main_~_hj_key~0#1.offset, 1);main_~_hj_i~0#1 := main_~_hj_i~0#1 + 65536 * (main_#t~mem28#1 % 256);havoc main_#t~mem28#1; {11680#true} is VALID [2022-02-21 03:21:09,491 INFO L290 TraceCheckUtils]: 27: Hoare triple {11680#true} main_#t~switch19#1 := main_#t~switch19#1 || 3 == main_~_hj_k~0#1; {11680#true} is VALID [2022-02-21 03:21:09,491 INFO L290 TraceCheckUtils]: 26: Hoare triple {11680#true} assume main_#t~switch19#1;call main_#t~mem27#1 := read~int(main_~_hj_key~0#1.base, 3 + main_~_hj_key~0#1.offset, 1);main_~_hj_i~0#1 := main_~_hj_i~0#1 + 16777216 * (main_#t~mem27#1 % 256);havoc main_#t~mem27#1; {11680#true} is VALID [2022-02-21 03:21:09,492 INFO L290 TraceCheckUtils]: 25: Hoare triple {11680#true} main_#t~switch19#1 := main_#t~switch19#1 || 4 == main_~_hj_k~0#1; {11680#true} is VALID [2022-02-21 03:21:09,492 INFO L290 TraceCheckUtils]: 24: Hoare triple {11680#true} assume !main_#t~switch19#1; {11680#true} is VALID [2022-02-21 03:21:09,492 INFO L290 TraceCheckUtils]: 23: Hoare triple {11680#true} main_#t~switch19#1 := main_#t~switch19#1 || 5 == main_~_hj_k~0#1; {11680#true} is VALID [2022-02-21 03:21:09,492 INFO L290 TraceCheckUtils]: 22: Hoare triple {11680#true} assume !main_#t~switch19#1; {11680#true} is VALID [2022-02-21 03:21:09,493 INFO L290 TraceCheckUtils]: 21: Hoare triple {11680#true} main_#t~switch19#1 := main_#t~switch19#1 || 6 == main_~_hj_k~0#1; {11680#true} is VALID [2022-02-21 03:21:09,493 INFO L290 TraceCheckUtils]: 20: Hoare triple {11680#true} assume !main_#t~switch19#1; {11680#true} is VALID [2022-02-21 03:21:09,493 INFO L290 TraceCheckUtils]: 19: Hoare triple {11680#true} main_#t~switch19#1 := main_#t~switch19#1 || 7 == main_~_hj_k~0#1; {11680#true} is VALID [2022-02-21 03:21:09,493 INFO L290 TraceCheckUtils]: 18: Hoare triple {11680#true} assume !main_#t~switch19#1; {11680#true} is VALID [2022-02-21 03:21:09,493 INFO L290 TraceCheckUtils]: 17: Hoare triple {11680#true} main_#t~switch19#1 := main_#t~switch19#1 || 8 == main_~_hj_k~0#1; {11680#true} is VALID [2022-02-21 03:21:09,494 INFO L290 TraceCheckUtils]: 16: Hoare triple {11680#true} assume !main_#t~switch19#1; {11680#true} is VALID [2022-02-21 03:21:09,494 INFO L290 TraceCheckUtils]: 15: Hoare triple {11680#true} main_#t~switch19#1 := main_#t~switch19#1 || 9 == main_~_hj_k~0#1; {11680#true} is VALID [2022-02-21 03:21:09,494 INFO L290 TraceCheckUtils]: 14: Hoare triple {11680#true} assume !main_#t~switch19#1; {11680#true} is VALID [2022-02-21 03:21:09,494 INFO L290 TraceCheckUtils]: 13: Hoare triple {11680#true} main_#t~switch19#1 := main_#t~switch19#1 || 10 == main_~_hj_k~0#1; {11680#true} is VALID [2022-02-21 03:21:09,494 INFO L290 TraceCheckUtils]: 12: Hoare triple {11680#true} assume !main_#t~switch19#1; {11680#true} is VALID [2022-02-21 03:21:09,494 INFO L290 TraceCheckUtils]: 11: Hoare triple {11680#true} main_~_ha_hashv~0#1 := 4 + main_~_ha_hashv~0#1;main_#t~switch19#1 := 11 == main_~_hj_k~0#1; {11680#true} is VALID [2022-02-21 03:21:09,494 INFO L290 TraceCheckUtils]: 10: Hoare triple {11680#true} assume !(main_~_hj_k~0#1 % 4294967296 >= 12); {11680#true} is VALID [2022-02-21 03:21:09,494 INFO L290 TraceCheckUtils]: 9: Hoare triple {11680#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; {11680#true} is VALID [2022-02-21 03:21:09,494 INFO L290 TraceCheckUtils]: 8: Hoare triple {11680#true} goto; {11680#true} is VALID [2022-02-21 03:21:09,495 INFO L290 TraceCheckUtils]: 7: Hoare triple {11680#true} havoc main_~_ha_hashv~0#1; {11680#true} is VALID [2022-02-21 03:21:09,495 INFO L290 TraceCheckUtils]: 6: Hoare triple {11680#true} assume main_~i~0#1 * main_~i~0#1 >= -2147483648;call write~int(main_~i~0#1 * main_~i~0#1, main_~user~0#1.base, 4 + main_~user~0#1.offset, 4); {11680#true} is VALID [2022-02-21 03:21:09,495 INFO L290 TraceCheckUtils]: 5: Hoare triple {11680#true} assume main_~i~0#1 * main_~i~0#1 <= 2147483647; {11680#true} is VALID [2022-02-21 03:21:09,495 INFO L290 TraceCheckUtils]: 4: Hoare triple {11680#true} call write~int(main_~i~0#1, main_~user~0#1.base, main_~user~0#1.offset, 4); {11680#true} is VALID [2022-02-21 03:21:09,495 INFO L290 TraceCheckUtils]: 3: Hoare triple {11680#true} assume !(main_~user~0#1.base == 0 && main_~user~0#1.offset == 0); {11680#true} is VALID [2022-02-21 03:21:09,495 INFO L290 TraceCheckUtils]: 2: Hoare triple {11680#true} assume !!(main_~i~0#1 < 10);call main_#t~malloc6#1.base, main_#t~malloc6#1.offset := #Ultimate.allocOnHeap(40);main_~user~0#1.base, main_~user~0#1.offset := main_#t~malloc6#1.base, main_#t~malloc6#1.offset;havoc main_#t~malloc6#1.base, main_#t~malloc6#1.offset; {11680#true} is VALID [2022-02-21 03:21:09,495 INFO L290 TraceCheckUtils]: 1: Hoare triple {11680#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc6#1.base, main_#t~malloc6#1.offset, main_#t~mem8#1, main_#t~mem7#1, main_#t~mem9#1, main_#t~mem10#1, main_#t~mem12#1, main_#t~mem11#1, main_#t~mem13#1, main_#t~mem14#1, main_#t~mem16#1, main_#t~mem15#1, main_#t~mem17#1, main_#t~mem18#1, main_#t~switch19#1, main_#t~mem20#1, main_#t~mem21#1, main_#t~mem22#1, main_#t~mem23#1, main_#t~mem24#1, main_#t~mem25#1, main_#t~mem26#1, main_#t~mem27#1, main_#t~mem28#1, main_#t~mem29#1, main_#t~mem30#1, main_~_hj_i~0#1, main_~_hj_j~0#1, main_~_hj_k~0#1, main_~_hj_key~0#1.base, main_~_hj_key~0#1.offset, main_#t~malloc31#1.base, main_#t~malloc31#1.offset, main_#t~mem32#1.base, main_#t~mem32#1.offset, main_#t~mem33#1.base, main_#t~mem33#1.offset, main_#t~memset~res34#1.base, main_#t~memset~res34#1.offset, main_#t~mem35#1.base, main_#t~mem35#1.offset, main_#t~mem36#1.base, main_#t~mem36#1.offset, main_#t~mem37#1.base, main_#t~mem37#1.offset, main_#t~mem38#1.base, main_#t~mem38#1.offset, main_#t~mem39#1.base, main_#t~mem39#1.offset, main_#t~malloc40#1.base, main_#t~malloc40#1.offset, main_#t~mem41#1.base, main_#t~mem41#1.offset, main_#t~mem42#1.base, main_#t~mem42#1.offset, main_#t~mem43#1.base, main_#t~mem43#1.offset, main_#t~mem44#1.base, main_#t~mem44#1.offset, main_#t~mem45#1.base, main_#t~mem45#1.offset, main_#t~mem46#1.base, main_#t~mem46#1.offset, main_#t~memset~res47#1.base, main_#t~memset~res47#1.offset, main_#t~mem48#1.base, main_#t~mem48#1.offset, main_#t~mem49#1.base, main_#t~mem49#1.offset, main_#t~mem50#1.base, main_#t~mem50#1.offset, main_#t~mem51#1.base, main_#t~mem51#1.offset, main_#t~mem52#1, main_#t~mem53#1.base, main_#t~mem53#1.offset, main_#t~mem54#1.base, main_#t~mem54#1.offset, main_#t~mem55#1.base, main_#t~mem55#1.offset, main_#t~mem56#1.base, main_#t~mem56#1.offset, main_#t~mem57#1, main_#t~post58#1, main_#t~mem59#1.base, main_#t~mem59#1.offset, main_#t~mem60#1, main_#t~mem61#1.base, main_#t~mem61#1.offset, main_#t~mem62#1.base, main_#t~mem62#1.offset, main_#t~mem63#1, main_#t~post64#1, main_#t~mem65#1.base, main_#t~mem65#1.offset, main_#t~mem66#1.base, main_#t~mem66#1.offset, main_#t~mem67#1.base, main_#t~mem67#1.offset, main_#t~mem69#1, main_#t~mem68#1, main_#t~mem70#1.base, main_#t~mem70#1.offset, main_#t~mem71#1, main_#t~short72#1, main_#t~mem73#1.base, main_#t~mem73#1.offset, main_#t~mem74#1, main_#t~malloc75#1.base, main_#t~malloc75#1.offset, main_#t~mem76#1.base, main_#t~mem76#1.offset, main_#t~mem77#1.base, main_#t~mem77#1.offset, main_#t~mem78#1.base, main_#t~mem78#1.offset, main_#t~mem79#1, main_#t~memset~res80#1.base, main_#t~memset~res80#1.offset, main_#t~mem81#1.base, main_#t~mem81#1.offset, main_#t~mem82#1.base, main_#t~mem82#1.offset, main_#t~mem85#1, main_#t~mem83#1.base, main_#t~mem83#1.offset, main_#t~mem84#1, main_#t~mem86#1.base, main_#t~mem86#1.offset, main_#t~mem89#1, main_#t~mem87#1.base, main_#t~mem87#1.offset, main_#t~mem88#1, main_#t~ite90#1, main_#t~mem91#1.base, main_#t~mem91#1.offset, main_#t~mem95#1.base, main_#t~mem95#1.offset, main_#t~mem96#1.base, main_#t~mem96#1.offset, main_#t~mem97#1.base, main_#t~mem97#1.offset, main_#t~mem98#1.base, main_#t~mem98#1.offset, main_#t~mem101#1, main_#t~mem99#1.base, main_#t~mem99#1.offset, main_#t~mem100#1, main_#t~mem102#1.base, main_#t~mem102#1.offset, main_#t~mem103#1, main_#t~pre104#1, main_#t~mem105#1.base, main_#t~mem105#1.offset, main_#t~mem106#1, main_#t~mem107#1.base, main_#t~mem107#1.offset, main_#t~mem108#1, main_#t~post109#1, main_#t~mem113#1, main_#t~mem111#1, main_#t~mem110#1.base, main_#t~mem110#1.offset, main_#t~mem112#1, main_#t~mem114#1, main_#t~post115#1, main_#t~mem116#1.base, main_#t~mem116#1.offset, main_#t~mem117#1.base, main_#t~mem117#1.offset, main_#t~mem118#1.base, main_#t~mem118#1.offset, main_#t~post92#1, main_#t~mem93#1.base, main_#t~mem93#1.offset, main_#t~mem94#1, main_#t~mem119#1.base, main_#t~mem119#1.offset, main_#t~mem120#1.base, main_#t~mem120#1.offset, main_#t~mem121#1.base, main_#t~mem121#1.offset, main_#t~mem122#1, main_#t~mem123#1.base, main_#t~mem123#1.offset, main_#t~mem124#1, main_#t~post125#1, main_#t~mem126#1.base, main_#t~mem126#1.offset, main_#t~mem127#1.base, main_#t~mem127#1.offset, main_#t~mem128#1.base, main_#t~mem128#1.offset, main_#t~mem129#1.base, main_#t~mem129#1.offset, main_#t~mem132#1, main_#t~mem130#1.base, main_#t~mem130#1.offset, main_#t~mem131#1, main_#t~ite135#1, main_#t~mem133#1.base, main_#t~mem133#1.offset, main_#t~mem134#1, main_#t~mem136#1.base, main_#t~mem136#1.offset, main_#t~mem137#1, main_#t~mem138#1.base, main_#t~mem138#1.offset, main_~_he_bkt~0#1, main_~_he_bkt_i~0#1, main_~_he_thh~0#1.base, main_~_he_thh~0#1.offset, main_~_he_hh_nxt~0#1.base, main_~_he_hh_nxt~0#1.offset, main_~#_he_new_buckets~0#1.base, main_~#_he_new_buckets~0#1.offset, main_~_he_newbkt~0#1.base, main_~_he_newbkt~0#1.offset, main_~_ha_head~0#1.base, main_~_ha_head~0#1.offset, main_~_ha_bkt~0#1, main_~_ha_hashv~0#1, main_#t~post5#1, main_#t~mem140#1, main_#t~mem141#1, main_#t~mem139#1.base, main_#t~mem139#1.offset, main_#t~ite143#1.base, main_#t~ite143#1.offset, main_#t~mem142#1.base, main_#t~mem142#1.offset, main_#t~mem146#1.base, main_#t~mem146#1.offset, main_#t~mem147#1.base, main_#t~mem147#1.offset, main_#t~short148#1, main_#t~mem149#1.base, main_#t~mem149#1.offset, main_#t~mem150#1.base, main_#t~mem150#1.offset, main_#t~mem151#1.base, main_#t~mem151#1.offset, main_#t~mem152#1.base, main_#t~mem152#1.offset, main_#t~mem153#1.base, main_#t~mem153#1.offset, main_#t~mem154#1.base, main_#t~mem154#1.offset, main_#t~mem155#1.base, main_#t~mem155#1.offset, main_#t~mem156#1.base, main_#t~mem156#1.offset, main_#t~mem157#1, main_#t~mem158#1.base, main_#t~mem158#1.offset, main_#t~mem159#1.base, main_#t~mem159#1.offset, main_#t~mem160#1.base, main_#t~mem160#1.offset, main_#t~mem161#1, main_#t~mem162#1.base, main_#t~mem162#1.offset, main_#t~mem163#1.base, main_#t~mem163#1.offset, main_#t~mem164#1.base, main_#t~mem164#1.offset, main_#t~mem165#1.base, main_#t~mem165#1.offset, main_#t~mem166#1.base, main_#t~mem166#1.offset, main_#t~mem167#1, main_#t~mem168#1.base, main_#t~mem168#1.offset, main_#t~mem171#1, main_#t~mem169#1.base, main_#t~mem169#1.offset, main_#t~mem170#1, main_#t~mem172#1.base, main_#t~mem172#1.offset, main_#t~mem173#1.base, main_#t~mem173#1.offset, main_#t~mem174#1, main_#t~post175#1, 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.base, main_#t~mem181#1.offset, main_#t~mem182#1.base, main_#t~mem182#1.offset, main_#t~mem183#1.base, main_#t~mem183#1.offset, main_~_hd_head~0#1.base, main_~_hd_head~0#1.offset, main_#t~mem184#1.base, main_#t~mem184#1.offset, main_#t~mem185#1, main_#t~post186#1, main_~_hd_bkt~0#1, main_~_hd_hh_del~0#1.base, main_~_hd_hh_del~0#1.offset, main_#t~ite145#1.base, main_#t~ite145#1.offset, main_#t~mem144#1.base, main_#t~mem144#1.offset, main_~i~0#1, main_~user~0#1.base, main_~user~0#1.offset, main_~users~0#1.base, main_~users~0#1.offset, main_~temp~0#1.base, main_~temp~0#1.offset;havoc main_~i~0#1;havoc main_~user~0#1.base, main_~user~0#1.offset;main_~users~0#1.base, main_~users~0#1.offset := 0, 0;main_~i~0#1 := 0; {11680#true} is VALID [2022-02-21 03:21:09,495 INFO L290 TraceCheckUtils]: 0: Hoare triple {11680#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(21, 2);~count_int_int~0 := 0; {11680#true} is VALID [2022-02-21 03:21:09,496 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 10 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-02-21 03:21:09,496 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 03:21:09,496 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [117955533] [2022-02-21 03:21:09,496 WARN L317 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-02-21 03:21:09,496 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [266593589] [2022-02-21 03:21:09,496 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [266593589] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-21 03:21:09,496 INFO L191 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-02-21 03:21:09,496 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2022-02-21 03:21:09,498 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [840018874] [2022-02-21 03:21:09,498 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-02-21 03:21:09,499 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 9.875) internal successors, (79), 8 states have internal predecessors, (79), 1 states have call successors, (2), 1 states have call predecessors, (2), 3 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) Word has length 78 [2022-02-21 03:21:09,499 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-21 03:21:09,499 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 8 states, 8 states have (on average 9.875) internal successors, (79), 8 states have internal predecessors, (79), 1 states have call successors, (2), 1 states have call predecessors, (2), 3 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2022-02-21 03:21:09,564 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 84 edges. 84 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:21:09,564 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-02-21 03:21:09,565 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 03:21:09,565 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-02-21 03:21:09,565 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2022-02-21 03:21:09,565 INFO L87 Difference]: Start difference. First operand 334 states and 417 transitions. Second operand has 8 states, 8 states have (on average 9.875) internal successors, (79), 8 states have internal predecessors, (79), 1 states have call successors, (2), 1 states have call predecessors, (2), 3 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2022-02-21 03:21:11,277 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:21:11,277 INFO L93 Difference]: Finished difference Result 627 states and 806 transitions. [2022-02-21 03:21:11,277 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-02-21 03:21:11,277 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 9.875) internal successors, (79), 8 states have internal predecessors, (79), 1 states have call successors, (2), 1 states have call predecessors, (2), 3 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) Word has length 78 [2022-02-21 03:21:11,278 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-21 03:21:11,278 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 9.875) internal successors, (79), 8 states have internal predecessors, (79), 1 states have call successors, (2), 1 states have call predecessors, (2), 3 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2022-02-21 03:21:11,281 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 366 transitions. [2022-02-21 03:21:11,281 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 9.875) internal successors, (79), 8 states have internal predecessors, (79), 1 states have call successors, (2), 1 states have call predecessors, (2), 3 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2022-02-21 03:21:11,283 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 366 transitions. [2022-02-21 03:21:11,283 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 11 states and 366 transitions. [2022-02-21 03:21:11,594 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 366 edges. 366 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:21:11,601 INFO L225 Difference]: With dead ends: 627 [2022-02-21 03:21:11,601 INFO L226 Difference]: Without dead ends: 343 [2022-02-21 03:21:11,601 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 158 GetRequests, 148 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=53, Invalid=79, Unknown=0, NotChecked=0, Total=132 [2022-02-21 03:21:11,602 INFO L933 BasicCegarLoop]: 168 mSDtfsCounter, 16 mSDsluCounter, 820 mSDsCounter, 0 mSdLazyCounter, 47 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 988 SdHoareTripleChecker+Invalid, 57 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 47 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-21 03:21:11,602 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [16 Valid, 988 Invalid, 57 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 47 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-21 03:21:11,602 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 343 states. [2022-02-21 03:21:11,700 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 343 to 343. [2022-02-21 03:21:11,701 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 03:21:11,701 INFO L82 GeneralOperation]: Start isEquivalent. First operand 343 states. Second operand has 343 states, 316 states have (on average 1.2278481012658229) internal successors, (388), 330 states have internal predecessors, (388), 19 states have call successors, (19), 3 states have call predecessors, (19), 4 states have return successors, (25), 10 states have call predecessors, (25), 19 states have call successors, (25) [2022-02-21 03:21:11,702 INFO L74 IsIncluded]: Start isIncluded. First operand 343 states. Second operand has 343 states, 316 states have (on average 1.2278481012658229) internal successors, (388), 330 states have internal predecessors, (388), 19 states have call successors, (19), 3 states have call predecessors, (19), 4 states have return successors, (25), 10 states have call predecessors, (25), 19 states have call successors, (25) [2022-02-21 03:21:11,703 INFO L87 Difference]: Start difference. First operand 343 states. Second operand has 343 states, 316 states have (on average 1.2278481012658229) internal successors, (388), 330 states have internal predecessors, (388), 19 states have call successors, (19), 3 states have call predecessors, (19), 4 states have return successors, (25), 10 states have call predecessors, (25), 19 states have call successors, (25) [2022-02-21 03:21:11,712 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:21:11,713 INFO L93 Difference]: Finished difference Result 343 states and 432 transitions. [2022-02-21 03:21:11,713 INFO L276 IsEmpty]: Start isEmpty. Operand 343 states and 432 transitions. [2022-02-21 03:21:11,714 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:21:11,714 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:21:11,715 INFO L74 IsIncluded]: Start isIncluded. First operand has 343 states, 316 states have (on average 1.2278481012658229) internal successors, (388), 330 states have internal predecessors, (388), 19 states have call successors, (19), 3 states have call predecessors, (19), 4 states have return successors, (25), 10 states have call predecessors, (25), 19 states have call successors, (25) Second operand 343 states. [2022-02-21 03:21:11,715 INFO L87 Difference]: Start difference. First operand has 343 states, 316 states have (on average 1.2278481012658229) internal successors, (388), 330 states have internal predecessors, (388), 19 states have call successors, (19), 3 states have call predecessors, (19), 4 states have return successors, (25), 10 states have call predecessors, (25), 19 states have call successors, (25) Second operand 343 states. [2022-02-21 03:21:11,722 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:21:11,723 INFO L93 Difference]: Finished difference Result 343 states and 432 transitions. [2022-02-21 03:21:11,723 INFO L276 IsEmpty]: Start isEmpty. Operand 343 states and 432 transitions. [2022-02-21 03:21:11,723 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:21:11,724 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:21:11,724 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 03:21:11,724 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 03:21:11,724 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 343 states, 316 states have (on average 1.2278481012658229) internal successors, (388), 330 states have internal predecessors, (388), 19 states have call successors, (19), 3 states have call predecessors, (19), 4 states have return successors, (25), 10 states have call predecessors, (25), 19 states have call successors, (25) [2022-02-21 03:21:11,732 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 343 states to 343 states and 432 transitions. [2022-02-21 03:21:11,732 INFO L78 Accepts]: Start accepts. Automaton has 343 states and 432 transitions. Word has length 78 [2022-02-21 03:21:11,732 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-21 03:21:11,732 INFO L470 AbstractCegarLoop]: Abstraction has 343 states and 432 transitions. [2022-02-21 03:21:11,733 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 9.875) internal successors, (79), 8 states have internal predecessors, (79), 1 states have call successors, (2), 1 states have call predecessors, (2), 3 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2022-02-21 03:21:11,733 INFO L276 IsEmpty]: Start isEmpty. Operand 343 states and 432 transitions. [2022-02-21 03:21:11,733 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2022-02-21 03:21:11,733 INFO L506 BasicCegarLoop]: Found error trace [2022-02-21 03:21:11,734 INFO L514 BasicCegarLoop]: trace histogram [6, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-21 03:21:11,766 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2022-02-21 03:21:11,947 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable8 [2022-02-21 03:21:11,947 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2022-02-21 03:21:11,948 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:21:11,948 INFO L85 PathProgramCache]: Analyzing trace with hash 1475657579, now seen corresponding path program 2 times [2022-02-21 03:21:11,948 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:21:11,948 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [725982112] [2022-02-21 03:21:11,948 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:21:11,948 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:21:12,002 ERROR L252 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-02-21 03:21:12,002 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [913143878] [2022-02-21 03:21:12,002 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-02-21 03:21:12,003 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-21 03:21:12,003 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:21:12,004 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-02-21 03:21:12,035 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process