./Ultimate.py --spec ../sv-benchmarks/c/properties/no-overflow.prp --file ../sv-benchmarks/c/uthash-2.0.2/uthash_OAT_test8-1.i --full-output -ea --architecture 32bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version 03d7b7b3 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -ea -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/uthash-2.0.2/uthash_OAT_test8-1.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! overflow) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 5eef0a1d7c251abc753eabb723fe850489bfd10ab147ced1a31e6821eaf88c98 --- Real Ultimate output --- This is Ultimate 0.2.2-dev-03d7b7b [2022-02-21 03:18:33,648 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-02-21 03:18:33,650 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-02-21 03:18:33,689 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-02-21 03:18:33,689 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-02-21 03:18:33,692 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-02-21 03:18:33,693 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-02-21 03:18:33,696 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-02-21 03:18:33,697 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-02-21 03:18:33,701 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-02-21 03:18:33,702 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-02-21 03:18:33,703 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-02-21 03:18:33,703 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-02-21 03:18:33,706 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-02-21 03:18:33,707 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-02-21 03:18:33,711 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-02-21 03:18:33,712 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-02-21 03:18:33,713 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-02-21 03:18:33,715 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-02-21 03:18:33,722 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-02-21 03:18:33,723 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-02-21 03:18:33,724 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-02-21 03:18:33,725 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-02-21 03:18:33,726 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-02-21 03:18:33,732 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-02-21 03:18:33,732 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-02-21 03:18:33,732 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-02-21 03:18:33,734 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-02-21 03:18:33,734 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-02-21 03:18:33,735 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-02-21 03:18:33,735 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-02-21 03:18:33,736 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-02-21 03:18:33,737 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-02-21 03:18:33,738 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-02-21 03:18:33,739 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-02-21 03:18:33,740 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-02-21 03:18:33,740 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-02-21 03:18:33,740 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-02-21 03:18:33,741 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-02-21 03:18:33,741 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-02-21 03:18:33,742 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-02-21 03:18:33,743 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:18:33,771 INFO L113 SettingsManager]: Loading preferences was successful [2022-02-21 03:18:33,771 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-02-21 03:18:33,772 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-02-21 03:18:33,772 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-02-21 03:18:33,773 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-02-21 03:18:33,773 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-02-21 03:18:33,773 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-02-21 03:18:33,774 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-02-21 03:18:33,774 INFO L138 SettingsManager]: * Use SBE=true [2022-02-21 03:18:33,774 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-02-21 03:18:33,775 INFO L138 SettingsManager]: * sizeof long=4 [2022-02-21 03:18:33,775 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-02-21 03:18:33,775 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-02-21 03:18:33,776 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-02-21 03:18:33,776 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-02-21 03:18:33,776 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-02-21 03:18:33,776 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-02-21 03:18:33,776 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-02-21 03:18:33,777 INFO L138 SettingsManager]: * Check absence of signed integer overflows=true [2022-02-21 03:18:33,777 INFO L138 SettingsManager]: * sizeof long double=12 [2022-02-21 03:18:33,777 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-02-21 03:18:33,777 INFO L138 SettingsManager]: * Use constant arrays=true [2022-02-21 03:18:33,777 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-02-21 03:18:33,778 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-02-21 03:18:33,778 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-02-21 03:18:33,778 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-02-21 03:18:33,778 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-21 03:18:33,779 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-02-21 03:18:33,779 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-02-21 03:18:33,779 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-02-21 03:18:33,779 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-02-21 03:18:33,779 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-02-21 03:18:33,780 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-02-21 03:18:33,780 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 -> 5eef0a1d7c251abc753eabb723fe850489bfd10ab147ced1a31e6821eaf88c98 [2022-02-21 03:18:34,022 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-02-21 03:18:34,041 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-02-21 03:18:34,043 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-02-21 03:18:34,043 INFO L271 PluginConnector]: Initializing CDTParser... [2022-02-21 03:18:34,044 INFO L275 PluginConnector]: CDTParser initialized [2022-02-21 03:18:34,045 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/uthash-2.0.2/uthash_OAT_test8-1.i [2022-02-21 03:18:34,103 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b09a2b18e/d40b86a1706048ce9582bed7f994bc8b/FLAG7f5856668 [2022-02-21 03:18:34,658 INFO L306 CDTParser]: Found 1 translation units. [2022-02-21 03:18:34,659 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_OAT_test8-1.i [2022-02-21 03:18:34,674 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b09a2b18e/d40b86a1706048ce9582bed7f994bc8b/FLAG7f5856668 [2022-02-21 03:18:35,121 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b09a2b18e/d40b86a1706048ce9582bed7f994bc8b [2022-02-21 03:18:35,125 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-02-21 03:18:35,127 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-02-21 03:18:35,130 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-02-21 03:18:35,131 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-02-21 03:18:35,133 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-02-21 03:18:35,134 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.02 03:18:35" (1/1) ... [2022-02-21 03:18:35,135 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4b1c9589 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:18:35, skipping insertion in model container [2022-02-21 03:18:35,135 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.02 03:18:35" (1/1) ... [2022-02-21 03:18:35,140 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-02-21 03:18:35,192 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-21 03:18:35,579 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_OAT_test8-1.i[33021,33034] [2022-02-21 03:18:35,731 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_OAT_test8-1.i[45234,45247] [2022-02-21 03:18:35,739 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-21 03:18:35,746 INFO L203 MainTranslator]: Completed pre-run [2022-02-21 03:18:35,768 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_OAT_test8-1.i[33021,33034] [2022-02-21 03:18:35,826 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_OAT_test8-1.i[45234,45247] [2022-02-21 03:18:35,829 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-21 03:18:35,860 INFO L208 MainTranslator]: Completed translation [2022-02-21 03:18:35,861 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:18:35 WrapperNode [2022-02-21 03:18:35,861 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-02-21 03:18:35,862 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-02-21 03:18:35,862 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-02-21 03:18:35,862 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-02-21 03:18:35,868 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:18:35" (1/1) ... [2022-02-21 03:18:35,916 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:18:35" (1/1) ... [2022-02-21 03:18:35,997 INFO L137 Inliner]: procedures = 177, calls = 297, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 1002 [2022-02-21 03:18:35,999 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-02-21 03:18:36,000 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-02-21 03:18:36,000 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-02-21 03:18:36,000 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-02-21 03:18:36,007 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:18:35" (1/1) ... [2022-02-21 03:18:36,008 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:18:35" (1/1) ... [2022-02-21 03:18:36,022 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:18:35" (1/1) ... [2022-02-21 03:18:36,023 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:18:35" (1/1) ... [2022-02-21 03:18:36,062 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:18:35" (1/1) ... [2022-02-21 03:18:36,073 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:18:35" (1/1) ... [2022-02-21 03:18:36,078 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:18:35" (1/1) ... [2022-02-21 03:18:36,087 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-02-21 03:18:36,088 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-02-21 03:18:36,088 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-02-21 03:18:36,088 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-02-21 03:18:36,089 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:18:35" (1/1) ... [2022-02-21 03:18:36,103 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-21 03:18:36,115 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:18:36,128 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:18:36,162 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-02-21 03:18:36,162 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:18:36,163 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-02-21 03:18:36,163 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-02-21 03:18:36,163 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-02-21 03:18:36,163 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset [2022-02-21 03:18:36,164 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset [2022-02-21 03:18:36,165 INFO L130 BoogieDeclarations]: Found specification of procedure test_int [2022-02-21 03:18:36,165 INFO L138 BoogieDeclarations]: Found implementation of procedure test_int [2022-02-21 03:18:36,165 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-02-21 03:18:36,165 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-02-21 03:18:36,166 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-02-21 03:18:36,166 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-02-21 03:18:36,166 INFO L130 BoogieDeclarations]: Found specification of procedure memcmp [2022-02-21 03:18:36,166 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-02-21 03:18:36,166 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-02-21 03:18:36,166 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-02-21 03:18:36,166 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-02-21 03:18:36,167 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-02-21 03:18:36,390 INFO L234 CfgBuilder]: Building ICFG [2022-02-21 03:18:36,392 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-02-21 03:18:38,393 INFO L275 CfgBuilder]: Performing block encoding [2022-02-21 03:18:38,402 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-02-21 03:18:38,402 INFO L299 CfgBuilder]: Removed 62 assume(true) statements. [2022-02-21 03:18:38,404 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.02 03:18:38 BoogieIcfgContainer [2022-02-21 03:18:38,404 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-02-21 03:18:38,406 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-02-21 03:18:38,406 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-02-21 03:18:38,408 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-02-21 03:18:38,408 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 21.02 03:18:35" (1/3) ... [2022-02-21 03:18:38,409 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2444cbc3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.02 03:18:38, skipping insertion in model container [2022-02-21 03:18:38,409 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:18:35" (2/3) ... [2022-02-21 03:18:38,409 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2444cbc3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.02 03:18:38, skipping insertion in model container [2022-02-21 03:18:38,409 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.02 03:18:38" (3/3) ... [2022-02-21 03:18:38,410 INFO L111 eAbstractionObserver]: Analyzing ICFG uthash_OAT_test8-1.i [2022-02-21 03:18:38,414 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-02-21 03:18:38,415 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 8 error locations. [2022-02-21 03:18:38,457 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-02-21 03:18:38,472 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:18:38,472 INFO L340 AbstractCegarLoop]: Starting to check reachability of 8 error locations. [2022-02-21 03:18:38,502 INFO L276 IsEmpty]: Start isEmpty. Operand has 238 states, 206 states have (on average 1.703883495145631) internal successors, (351), 229 states have internal predecessors, (351), 20 states have call successors, (20), 3 states have call predecessors, (20), 3 states have return successors, (20), 6 states have call predecessors, (20), 20 states have call successors, (20) [2022-02-21 03:18:38,505 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2022-02-21 03:18:38,505 INFO L506 BasicCegarLoop]: Found error trace [2022-02-21 03:18:38,509 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2022-02-21 03:18:38,511 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [test_intErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, test_intErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2022-02-21 03:18:38,518 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:18:38,518 INFO L85 PathProgramCache]: Analyzing trace with hash 232940209, now seen corresponding path program 1 times [2022-02-21 03:18:38,531 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:18:38,532 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [296089752] [2022-02-21 03:18:38,532 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:18:38,533 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:18:38,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:18:38,691 INFO L290 TraceCheckUtils]: 0: Hoare triple {241#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(21, 2);~count_int~0 := 0; {241#true} is VALID [2022-02-21 03:18:38,692 INFO L290 TraceCheckUtils]: 1: Hoare triple {241#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc8#1.base, main_#t~malloc8#1.offset, main_#t~mem9#1, main_#t~mem10#1, main_#t~mem11#1, main_#t~mem13#1, main_#t~mem12#1, main_#t~mem14#1, main_#t~mem15#1, main_#t~mem17#1, main_#t~mem16#1, main_#t~mem18#1, main_#t~mem19#1, main_#t~mem21#1, main_#t~mem20#1, main_#t~mem22#1, main_#t~mem23#1, main_#t~switch24#1, main_#t~mem25#1, main_#t~mem26#1, main_#t~mem27#1, main_#t~mem28#1, main_#t~mem29#1, main_#t~mem30#1, main_#t~mem31#1, main_#t~mem32#1, main_#t~mem33#1, main_#t~mem34#1, main_#t~mem35#1, main_~_hj_i~0#1, main_~_hj_j~0#1, main_~_hj_k~0#1, main_~_hj_key~0#1.base, main_~_hj_key~0#1.offset, main_#t~malloc36#1.base, main_#t~malloc36#1.offset, main_#t~mem37#1.base, main_#t~mem37#1.offset, main_#t~mem38#1.base, main_#t~mem38#1.offset, main_#t~memset~res39#1.base, main_#t~memset~res39#1.offset, main_#t~mem40#1.base, main_#t~mem40#1.offset, main_#t~mem41#1.base, main_#t~mem41#1.offset, main_#t~mem42#1.base, main_#t~mem42#1.offset, main_#t~mem43#1.base, main_#t~mem43#1.offset, main_#t~mem44#1.base, main_#t~mem44#1.offset, main_#t~malloc45#1.base, main_#t~malloc45#1.offset, main_#t~mem46#1.base, main_#t~mem46#1.offset, main_#t~mem47#1.base, main_#t~mem47#1.offset, main_#t~mem48#1.base, main_#t~mem48#1.offset, main_#t~mem49#1.base, main_#t~mem49#1.offset, main_#t~mem50#1.base, main_#t~mem50#1.offset, main_#t~mem51#1.base, main_#t~mem51#1.offset, main_#t~memset~res52#1.base, main_#t~memset~res52#1.offset, main_#t~mem53#1.base, main_#t~mem53#1.offset, main_#t~mem54#1.base, main_#t~mem54#1.offset, main_#t~mem55#1.base, main_#t~mem55#1.offset, main_#t~mem56#1.base, main_#t~mem56#1.offset, main_#t~mem57#1, main_#t~mem58#1.base, main_#t~mem58#1.offset, main_#t~mem59#1.base, main_#t~mem59#1.offset, main_#t~mem60#1.base, main_#t~mem60#1.offset, main_#t~mem61#1.base, main_#t~mem61#1.offset, main_#t~mem62#1, main_#t~post63#1, main_#t~mem64#1.base, main_#t~mem64#1.offset, main_#t~mem65#1, main_#t~mem66#1.base, main_#t~mem66#1.offset, main_#t~mem67#1.base, main_#t~mem67#1.offset, main_#t~mem68#1, main_#t~post69#1, main_#t~mem70#1.base, main_#t~mem70#1.offset, main_#t~mem71#1.base, main_#t~mem71#1.offset, main_#t~mem72#1.base, main_#t~mem72#1.offset, main_#t~mem74#1, main_#t~mem73#1, main_#t~mem75#1.base, main_#t~mem75#1.offset, main_#t~mem76#1, main_#t~short77#1, main_#t~mem78#1.base, main_#t~mem78#1.offset, main_#t~mem79#1, main_#t~malloc80#1.base, main_#t~malloc80#1.offset, main_#t~mem81#1.base, main_#t~mem81#1.offset, main_#t~mem82#1.base, main_#t~mem82#1.offset, main_#t~mem83#1.base, main_#t~mem83#1.offset, main_#t~mem84#1, main_#t~memset~res85#1.base, main_#t~memset~res85#1.offset, main_#t~mem86#1.base, main_#t~mem86#1.offset, main_#t~mem87#1.base, main_#t~mem87#1.offset, main_#t~mem90#1, main_#t~mem88#1.base, main_#t~mem88#1.offset, main_#t~mem89#1, main_#t~mem91#1.base, main_#t~mem91#1.offset, main_#t~mem94#1, main_#t~mem92#1.base, main_#t~mem92#1.offset, main_#t~mem93#1, main_#t~ite95#1, main_#t~mem96#1.base, main_#t~mem96#1.offset, main_#t~mem100#1.base, main_#t~mem100#1.offset, main_#t~mem101#1.base, main_#t~mem101#1.offset, main_#t~mem102#1.base, main_#t~mem102#1.offset, main_#t~mem103#1.base, main_#t~mem103#1.offset, main_#t~mem106#1, main_#t~mem104#1.base, main_#t~mem104#1.offset, main_#t~mem105#1, main_#t~mem107#1.base, main_#t~mem107#1.offset, main_#t~mem108#1, main_#t~pre109#1, main_#t~mem110#1.base, main_#t~mem110#1.offset, main_#t~mem111#1, main_#t~mem112#1.base, main_#t~mem112#1.offset, main_#t~mem113#1, main_#t~post114#1, main_#t~mem118#1, main_#t~mem116#1, main_#t~mem115#1.base, main_#t~mem115#1.offset, main_#t~mem117#1, main_#t~mem119#1, main_#t~post120#1, main_#t~mem121#1.base, main_#t~mem121#1.offset, main_#t~mem122#1.base, main_#t~mem122#1.offset, main_#t~mem123#1.base, main_#t~mem123#1.offset, main_#t~post97#1, main_#t~mem98#1.base, main_#t~mem98#1.offset, main_#t~mem99#1, main_#t~mem124#1.base, main_#t~mem124#1.offset, main_#t~mem125#1.base, main_#t~mem125#1.offset, main_#t~mem126#1.base, main_#t~mem126#1.offset, main_#t~mem127#1, main_#t~mem128#1.base, main_#t~mem128#1.offset, main_#t~mem129#1, main_#t~post130#1, main_#t~mem131#1.base, main_#t~mem131#1.offset, main_#t~mem132#1.base, main_#t~mem132#1.offset, main_#t~mem133#1.base, main_#t~mem133#1.offset, main_#t~mem134#1.base, main_#t~mem134#1.offset, main_#t~mem137#1, main_#t~mem135#1.base, main_#t~mem135#1.offset, main_#t~mem136#1, main_#t~ite140#1, main_#t~mem138#1.base, main_#t~mem138#1.offset, main_#t~mem139#1, main_#t~mem141#1.base, main_#t~mem141#1.offset, main_#t~mem142#1, main_#t~mem143#1.base, main_#t~mem143#1.offset, main_~_he_bkt~0#1, main_~_he_bkt_i~0#1, main_~_he_thh~0#1.base, main_~_he_thh~0#1.offset, main_~_he_hh_nxt~0#1.base, main_~_he_hh_nxt~0#1.offset, main_~#_he_new_buckets~0#1.base, main_~#_he_new_buckets~0#1.offset, main_~_he_newbkt~0#1.base, main_~_he_newbkt~0#1.offset, main_~_ha_head~0#1.base, main_~_ha_head~0#1.offset, main_~_ha_bkt~0#1, main_~_ha_hashv~0#1, main_#t~mem144#1.base, main_#t~mem144#1.offset, main_#t~mem145#1, main_#t~mem5#1, main_#t~post6#1, main_#t~mem7#1, main_#t~mem149#1, main_#t~mem148#1, main_#t~mem150#1, main_#t~mem151#1, main_#t~mem153#1, main_#t~mem152#1, main_#t~mem154#1, main_#t~mem155#1, main_#t~mem157#1, main_#t~mem156#1, main_#t~mem158#1, main_#t~mem159#1, main_#t~switch160#1, main_#t~mem161#1, main_#t~mem162#1, main_#t~mem163#1, main_#t~mem164#1, main_#t~mem165#1, main_#t~mem166#1, main_#t~mem167#1, main_#t~mem168#1, main_#t~mem169#1, main_#t~mem170#1, main_#t~mem171#1, main_~_hj_i~1#1, main_~_hj_j~1#1, main_~_hj_k~1#1, main_~_hj_key~1#1.base, main_~_hj_key~1#1.offset, main_#t~mem172#1.base, main_#t~mem172#1.offset, main_#t~mem173#1, main_#t~mem174#1.base, main_#t~mem174#1.offset, main_#t~mem175#1.base, main_#t~mem175#1.offset, main_#t~mem176#1.base, main_#t~mem176#1.offset, main_#t~mem177#1.base, main_#t~mem177#1.offset, main_#t~mem178#1.base, main_#t~mem178#1.offset, main_#t~mem179#1.base, main_#t~mem179#1.offset, main_#t~mem180#1.base, main_#t~mem180#1.offset, main_#t~mem181#1, main_#t~mem182#1, main_#t~mem183#1, main_#t~short184#1, main_#t~mem185#1.base, main_#t~mem185#1.offset, main_#t~ret186#1, main_#t~mem187#1.base, main_#t~mem187#1.offset, main_#t~mem188#1.base, main_#t~mem188#1.offset, main_#t~mem189#1.base, main_#t~mem189#1.offset, main_#t~mem190#1, main_~_hf_bkt~0#1, main_~_hf_hashv~0#1, main_#t~mem191#1.base, main_#t~mem191#1.offset, main_#t~mem192#1.base, main_#t~mem192#1.offset, main_#t~short193#1, main_#t~mem194#1.base, main_#t~mem194#1.offset, main_#t~mem195#1.base, main_#t~mem195#1.offset, main_#t~mem196#1.base, main_#t~mem196#1.offset, main_#t~mem197#1.base, main_#t~mem197#1.offset, main_#t~mem198#1.base, main_#t~mem198#1.offset, main_#t~mem199#1.base, main_#t~mem199#1.offset, main_#t~mem200#1.base, main_#t~mem200#1.offset, main_#t~mem201#1.base, main_#t~mem201#1.offset, main_#t~mem202#1, main_#t~mem203#1.base, main_#t~mem203#1.offset, main_#t~mem204#1.base, main_#t~mem204#1.offset, main_#t~mem205#1.base, main_#t~mem205#1.offset, main_#t~mem206#1, main_#t~mem207#1.base, main_#t~mem207#1.offset, main_#t~mem208#1.base, main_#t~mem208#1.offset, main_#t~mem209#1.base, main_#t~mem209#1.offset, main_#t~mem210#1.base, main_#t~mem210#1.offset, main_#t~mem211#1.base, main_#t~mem211#1.offset, main_#t~mem212#1, main_#t~mem213#1.base, main_#t~mem213#1.offset, main_#t~mem216#1, main_#t~mem214#1.base, main_#t~mem214#1.offset, main_#t~mem215#1, main_#t~mem217#1.base, main_#t~mem217#1.offset, main_#t~mem218#1.base, main_#t~mem218#1.offset, main_#t~mem219#1, main_#t~post220#1, main_#t~mem221#1.base, main_#t~mem221#1.offset, main_#t~mem222#1.base, main_#t~mem222#1.offset, main_#t~mem223#1.base, main_#t~mem223#1.offset, main_#t~mem224#1.base, main_#t~mem224#1.offset, main_#t~mem225#1.base, main_#t~mem225#1.offset, main_#t~mem226#1.base, main_#t~mem226#1.offset, main_#t~mem227#1.base, main_#t~mem227#1.offset, main_#t~mem228#1.base, main_#t~mem228#1.offset, main_~_hd_head~0#1.base, main_~_hd_head~0#1.offset, main_#t~mem229#1.base, main_#t~mem229#1.offset, main_#t~mem230#1, main_#t~post231#1, main_~_hd_bkt~0#1, main_~_hd_hh_del~0#1.base, main_~_hd_hh_del~0#1.offset, main_#t~mem232#1.base, main_#t~mem232#1.offset, main_#t~mem233#1, main_#t~mem146#1, main_#t~mem147#1, main_~#i~0#1.base, main_~#i~0#1.offset, main_~user~0#1.base, main_~user~0#1.offset, main_~tmp~0#1.base, main_~tmp~0#1.offset, main_~users~0#1.base, main_~users~0#1.offset;call main_~#i~0#1.base, main_~#i~0#1.offset := #Ultimate.allocOnStack(4);havoc main_~user~0#1.base, main_~user~0#1.offset;havoc main_~tmp~0#1.base, main_~tmp~0#1.offset;main_~users~0#1.base, main_~users~0#1.offset := 0, 0;call write~int(0, main_~#i~0#1.base, main_~#i~0#1.offset, 4); {241#true} is VALID [2022-02-21 03:18:38,692 INFO L290 TraceCheckUtils]: 2: Hoare triple {241#true} call main_#t~mem7#1 := read~int(main_~#i~0#1.base, main_~#i~0#1.offset, 4); {241#true} is VALID [2022-02-21 03:18:38,693 INFO L290 TraceCheckUtils]: 3: Hoare triple {241#true} assume !!(main_#t~mem7#1 < 10);havoc main_#t~mem7#1;call main_#t~malloc8#1.base, main_#t~malloc8#1.offset := #Ultimate.allocOnHeap(40);main_~user~0#1.base, main_~user~0#1.offset := main_#t~malloc8#1.base, main_#t~malloc8#1.offset;havoc main_#t~malloc8#1.base, main_#t~malloc8#1.offset; {241#true} is VALID [2022-02-21 03:18:38,695 INFO L290 TraceCheckUtils]: 4: Hoare triple {241#true} assume main_~user~0#1.base == 0 && main_~user~0#1.offset == 0;assume false; {242#false} is VALID [2022-02-21 03:18:38,695 INFO L290 TraceCheckUtils]: 5: Hoare triple {242#false} call main_#t~mem9#1 := read~int(main_~#i~0#1.base, main_~#i~0#1.offset, 4);call write~int(main_#t~mem9#1, main_~user~0#1.base, main_~user~0#1.offset, 4);havoc main_#t~mem9#1;call main_#t~mem10#1 := read~int(main_~#i~0#1.base, main_~#i~0#1.offset, 4);call main_#t~mem11#1 := read~int(main_~#i~0#1.base, main_~#i~0#1.offset, 4); {242#false} is VALID [2022-02-21 03:18:38,696 INFO L290 TraceCheckUtils]: 6: Hoare triple {242#false} assume !(main_#t~mem10#1 * main_#t~mem11#1 <= 2147483647); {242#false} is VALID [2022-02-21 03:18:38,697 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:18:38,697 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 03:18:38,697 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [296089752] [2022-02-21 03:18:38,698 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [296089752] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-21 03:18:38,698 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-21 03:18:38,698 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-02-21 03:18:38,700 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [27964622] [2022-02-21 03:18:38,700 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-21 03:18:38,704 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 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 7 [2022-02-21 03:18:38,705 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-21 03:18:38,708 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 2 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 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:18:38,727 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 7 edges. 7 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:18:38,728 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-02-21 03:18:38,728 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 03:18:38,770 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-02-21 03:18:38,771 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-02-21 03:18:38,778 INFO L87 Difference]: Start difference. First operand has 238 states, 206 states have (on average 1.703883495145631) internal successors, (351), 229 states have internal predecessors, (351), 20 states have call successors, (20), 3 states have call predecessors, (20), 3 states have return successors, (20), 6 states have call predecessors, (20), 20 states have call successors, (20) Second operand has 2 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 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:18:39,200 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:18:39,201 INFO L93 Difference]: Finished difference Result 474 states and 797 transitions. [2022-02-21 03:18:39,201 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-02-21 03:18:39,201 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 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 7 [2022-02-21 03:18:39,202 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-21 03:18:39,203 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 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:18:39,222 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 797 transitions. [2022-02-21 03:18:39,222 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 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:18:39,236 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 797 transitions. [2022-02-21 03:18:39,236 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states and 797 transitions. [2022-02-21 03:18:39,965 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 797 edges. 797 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:18:39,983 INFO L225 Difference]: With dead ends: 474 [2022-02-21 03:18:39,983 INFO L226 Difference]: Without dead ends: 234 [2022-02-21 03:18:39,988 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-02-21 03:18:39,991 INFO L933 BasicCegarLoop]: 323 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 323 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-21 03:18:39,992 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 323 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-21 03:18:40,008 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 234 states. [2022-02-21 03:18:40,034 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 234 to 234. [2022-02-21 03:18:40,035 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 03:18:40,037 INFO L82 GeneralOperation]: Start isEquivalent. First operand 234 states. Second operand has 234 states, 203 states have (on average 1.374384236453202) internal successors, (279), 225 states have internal predecessors, (279), 20 states have call successors, (20), 3 states have call predecessors, (20), 3 states have return successors, (20), 6 states have call predecessors, (20), 20 states have call successors, (20) [2022-02-21 03:18:40,038 INFO L74 IsIncluded]: Start isIncluded. First operand 234 states. Second operand has 234 states, 203 states have (on average 1.374384236453202) internal successors, (279), 225 states have internal predecessors, (279), 20 states have call successors, (20), 3 states have call predecessors, (20), 3 states have return successors, (20), 6 states have call predecessors, (20), 20 states have call successors, (20) [2022-02-21 03:18:40,039 INFO L87 Difference]: Start difference. First operand 234 states. Second operand has 234 states, 203 states have (on average 1.374384236453202) internal successors, (279), 225 states have internal predecessors, (279), 20 states have call successors, (20), 3 states have call predecessors, (20), 3 states have return successors, (20), 6 states have call predecessors, (20), 20 states have call successors, (20) [2022-02-21 03:18:40,051 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:18:40,052 INFO L93 Difference]: Finished difference Result 234 states and 319 transitions. [2022-02-21 03:18:40,052 INFO L276 IsEmpty]: Start isEmpty. Operand 234 states and 319 transitions. [2022-02-21 03:18:40,055 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:18:40,055 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:18:40,056 INFO L74 IsIncluded]: Start isIncluded. First operand has 234 states, 203 states have (on average 1.374384236453202) internal successors, (279), 225 states have internal predecessors, (279), 20 states have call successors, (20), 3 states have call predecessors, (20), 3 states have return successors, (20), 6 states have call predecessors, (20), 20 states have call successors, (20) Second operand 234 states. [2022-02-21 03:18:40,057 INFO L87 Difference]: Start difference. First operand has 234 states, 203 states have (on average 1.374384236453202) internal successors, (279), 225 states have internal predecessors, (279), 20 states have call successors, (20), 3 states have call predecessors, (20), 3 states have return successors, (20), 6 states have call predecessors, (20), 20 states have call successors, (20) Second operand 234 states. [2022-02-21 03:18:40,069 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:18:40,069 INFO L93 Difference]: Finished difference Result 234 states and 319 transitions. [2022-02-21 03:18:40,069 INFO L276 IsEmpty]: Start isEmpty. Operand 234 states and 319 transitions. [2022-02-21 03:18:40,071 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:18:40,072 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:18:40,072 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 03:18:40,072 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 03:18:40,073 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 234 states, 203 states have (on average 1.374384236453202) internal successors, (279), 225 states have internal predecessors, (279), 20 states have call successors, (20), 3 states have call predecessors, (20), 3 states have return successors, (20), 6 states have call predecessors, (20), 20 states have call successors, (20) [2022-02-21 03:18:40,084 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 234 states to 234 states and 319 transitions. [2022-02-21 03:18:40,086 INFO L78 Accepts]: Start accepts. Automaton has 234 states and 319 transitions. Word has length 7 [2022-02-21 03:18:40,086 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-21 03:18:40,086 INFO L470 AbstractCegarLoop]: Abstraction has 234 states and 319 transitions. [2022-02-21 03:18:40,087 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 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:18:40,087 INFO L276 IsEmpty]: Start isEmpty. Operand 234 states and 319 transitions. [2022-02-21 03:18:40,087 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2022-02-21 03:18:40,087 INFO L506 BasicCegarLoop]: Found error trace [2022-02-21 03:18:40,088 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2022-02-21 03:18:40,088 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-02-21 03:18:40,088 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [test_intErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, test_intErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2022-02-21 03:18:40,089 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:18:40,089 INFO L85 PathProgramCache]: Analyzing trace with hash 232942131, now seen corresponding path program 1 times [2022-02-21 03:18:40,089 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:18:40,089 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [506316374] [2022-02-21 03:18:40,090 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:18:40,090 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:18:40,130 ERROR L252 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-02-21 03:18:40,131 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1241716795] [2022-02-21 03:18:40,131 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:18:40,132 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-21 03:18:40,132 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:18:40,139 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:18:40,151 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:18:40,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:18:40,282 INFO L263 TraceCheckSpWp]: Trace formula consists of 84 conjuncts, 12 conjunts are in the unsatisfiable core [2022-02-21 03:18:40,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:18:40,344 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 03:18:40,426 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-02-21 03:18:40,640 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-21 03:18:40,645 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 10 [2022-02-21 03:18:40,667 INFO L290 TraceCheckUtils]: 0: Hoare triple {1579#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(21, 2);~count_int~0 := 0; {1579#true} is VALID [2022-02-21 03:18:40,669 INFO L290 TraceCheckUtils]: 1: Hoare triple {1579#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc8#1.base, main_#t~malloc8#1.offset, main_#t~mem9#1, main_#t~mem10#1, main_#t~mem11#1, main_#t~mem13#1, main_#t~mem12#1, main_#t~mem14#1, main_#t~mem15#1, main_#t~mem17#1, main_#t~mem16#1, main_#t~mem18#1, main_#t~mem19#1, main_#t~mem21#1, main_#t~mem20#1, main_#t~mem22#1, main_#t~mem23#1, main_#t~switch24#1, main_#t~mem25#1, main_#t~mem26#1, main_#t~mem27#1, main_#t~mem28#1, main_#t~mem29#1, main_#t~mem30#1, main_#t~mem31#1, main_#t~mem32#1, main_#t~mem33#1, main_#t~mem34#1, main_#t~mem35#1, main_~_hj_i~0#1, main_~_hj_j~0#1, main_~_hj_k~0#1, main_~_hj_key~0#1.base, main_~_hj_key~0#1.offset, main_#t~malloc36#1.base, main_#t~malloc36#1.offset, main_#t~mem37#1.base, main_#t~mem37#1.offset, main_#t~mem38#1.base, main_#t~mem38#1.offset, main_#t~memset~res39#1.base, main_#t~memset~res39#1.offset, main_#t~mem40#1.base, main_#t~mem40#1.offset, main_#t~mem41#1.base, main_#t~mem41#1.offset, main_#t~mem42#1.base, main_#t~mem42#1.offset, main_#t~mem43#1.base, main_#t~mem43#1.offset, main_#t~mem44#1.base, main_#t~mem44#1.offset, main_#t~malloc45#1.base, main_#t~malloc45#1.offset, main_#t~mem46#1.base, main_#t~mem46#1.offset, main_#t~mem47#1.base, main_#t~mem47#1.offset, main_#t~mem48#1.base, main_#t~mem48#1.offset, main_#t~mem49#1.base, main_#t~mem49#1.offset, main_#t~mem50#1.base, main_#t~mem50#1.offset, main_#t~mem51#1.base, main_#t~mem51#1.offset, main_#t~memset~res52#1.base, main_#t~memset~res52#1.offset, main_#t~mem53#1.base, main_#t~mem53#1.offset, main_#t~mem54#1.base, main_#t~mem54#1.offset, main_#t~mem55#1.base, main_#t~mem55#1.offset, main_#t~mem56#1.base, main_#t~mem56#1.offset, main_#t~mem57#1, main_#t~mem58#1.base, main_#t~mem58#1.offset, main_#t~mem59#1.base, main_#t~mem59#1.offset, main_#t~mem60#1.base, main_#t~mem60#1.offset, main_#t~mem61#1.base, main_#t~mem61#1.offset, main_#t~mem62#1, main_#t~post63#1, main_#t~mem64#1.base, main_#t~mem64#1.offset, main_#t~mem65#1, main_#t~mem66#1.base, main_#t~mem66#1.offset, main_#t~mem67#1.base, main_#t~mem67#1.offset, main_#t~mem68#1, main_#t~post69#1, main_#t~mem70#1.base, main_#t~mem70#1.offset, main_#t~mem71#1.base, main_#t~mem71#1.offset, main_#t~mem72#1.base, main_#t~mem72#1.offset, main_#t~mem74#1, main_#t~mem73#1, main_#t~mem75#1.base, main_#t~mem75#1.offset, main_#t~mem76#1, main_#t~short77#1, main_#t~mem78#1.base, main_#t~mem78#1.offset, main_#t~mem79#1, main_#t~malloc80#1.base, main_#t~malloc80#1.offset, main_#t~mem81#1.base, main_#t~mem81#1.offset, main_#t~mem82#1.base, main_#t~mem82#1.offset, main_#t~mem83#1.base, main_#t~mem83#1.offset, main_#t~mem84#1, main_#t~memset~res85#1.base, main_#t~memset~res85#1.offset, main_#t~mem86#1.base, main_#t~mem86#1.offset, main_#t~mem87#1.base, main_#t~mem87#1.offset, main_#t~mem90#1, main_#t~mem88#1.base, main_#t~mem88#1.offset, main_#t~mem89#1, main_#t~mem91#1.base, main_#t~mem91#1.offset, main_#t~mem94#1, main_#t~mem92#1.base, main_#t~mem92#1.offset, main_#t~mem93#1, main_#t~ite95#1, main_#t~mem96#1.base, main_#t~mem96#1.offset, main_#t~mem100#1.base, main_#t~mem100#1.offset, main_#t~mem101#1.base, main_#t~mem101#1.offset, main_#t~mem102#1.base, main_#t~mem102#1.offset, main_#t~mem103#1.base, main_#t~mem103#1.offset, main_#t~mem106#1, main_#t~mem104#1.base, main_#t~mem104#1.offset, main_#t~mem105#1, main_#t~mem107#1.base, main_#t~mem107#1.offset, main_#t~mem108#1, main_#t~pre109#1, main_#t~mem110#1.base, main_#t~mem110#1.offset, main_#t~mem111#1, main_#t~mem112#1.base, main_#t~mem112#1.offset, main_#t~mem113#1, main_#t~post114#1, main_#t~mem118#1, main_#t~mem116#1, main_#t~mem115#1.base, main_#t~mem115#1.offset, main_#t~mem117#1, main_#t~mem119#1, main_#t~post120#1, main_#t~mem121#1.base, main_#t~mem121#1.offset, main_#t~mem122#1.base, main_#t~mem122#1.offset, main_#t~mem123#1.base, main_#t~mem123#1.offset, main_#t~post97#1, main_#t~mem98#1.base, main_#t~mem98#1.offset, main_#t~mem99#1, main_#t~mem124#1.base, main_#t~mem124#1.offset, main_#t~mem125#1.base, main_#t~mem125#1.offset, main_#t~mem126#1.base, main_#t~mem126#1.offset, main_#t~mem127#1, main_#t~mem128#1.base, main_#t~mem128#1.offset, main_#t~mem129#1, main_#t~post130#1, main_#t~mem131#1.base, main_#t~mem131#1.offset, main_#t~mem132#1.base, main_#t~mem132#1.offset, main_#t~mem133#1.base, main_#t~mem133#1.offset, main_#t~mem134#1.base, main_#t~mem134#1.offset, main_#t~mem137#1, main_#t~mem135#1.base, main_#t~mem135#1.offset, main_#t~mem136#1, main_#t~ite140#1, main_#t~mem138#1.base, main_#t~mem138#1.offset, main_#t~mem139#1, main_#t~mem141#1.base, main_#t~mem141#1.offset, main_#t~mem142#1, main_#t~mem143#1.base, main_#t~mem143#1.offset, main_~_he_bkt~0#1, main_~_he_bkt_i~0#1, main_~_he_thh~0#1.base, main_~_he_thh~0#1.offset, main_~_he_hh_nxt~0#1.base, main_~_he_hh_nxt~0#1.offset, main_~#_he_new_buckets~0#1.base, main_~#_he_new_buckets~0#1.offset, main_~_he_newbkt~0#1.base, main_~_he_newbkt~0#1.offset, main_~_ha_head~0#1.base, main_~_ha_head~0#1.offset, main_~_ha_bkt~0#1, main_~_ha_hashv~0#1, main_#t~mem144#1.base, main_#t~mem144#1.offset, main_#t~mem145#1, main_#t~mem5#1, main_#t~post6#1, main_#t~mem7#1, main_#t~mem149#1, main_#t~mem148#1, main_#t~mem150#1, main_#t~mem151#1, main_#t~mem153#1, main_#t~mem152#1, main_#t~mem154#1, main_#t~mem155#1, main_#t~mem157#1, main_#t~mem156#1, main_#t~mem158#1, main_#t~mem159#1, main_#t~switch160#1, main_#t~mem161#1, main_#t~mem162#1, main_#t~mem163#1, main_#t~mem164#1, main_#t~mem165#1, main_#t~mem166#1, main_#t~mem167#1, main_#t~mem168#1, main_#t~mem169#1, main_#t~mem170#1, main_#t~mem171#1, main_~_hj_i~1#1, main_~_hj_j~1#1, main_~_hj_k~1#1, main_~_hj_key~1#1.base, main_~_hj_key~1#1.offset, main_#t~mem172#1.base, main_#t~mem172#1.offset, main_#t~mem173#1, main_#t~mem174#1.base, main_#t~mem174#1.offset, main_#t~mem175#1.base, main_#t~mem175#1.offset, main_#t~mem176#1.base, main_#t~mem176#1.offset, main_#t~mem177#1.base, main_#t~mem177#1.offset, main_#t~mem178#1.base, main_#t~mem178#1.offset, main_#t~mem179#1.base, main_#t~mem179#1.offset, main_#t~mem180#1.base, main_#t~mem180#1.offset, main_#t~mem181#1, main_#t~mem182#1, main_#t~mem183#1, main_#t~short184#1, main_#t~mem185#1.base, main_#t~mem185#1.offset, main_#t~ret186#1, main_#t~mem187#1.base, main_#t~mem187#1.offset, main_#t~mem188#1.base, main_#t~mem188#1.offset, main_#t~mem189#1.base, main_#t~mem189#1.offset, main_#t~mem190#1, main_~_hf_bkt~0#1, main_~_hf_hashv~0#1, main_#t~mem191#1.base, main_#t~mem191#1.offset, main_#t~mem192#1.base, main_#t~mem192#1.offset, main_#t~short193#1, main_#t~mem194#1.base, main_#t~mem194#1.offset, main_#t~mem195#1.base, main_#t~mem195#1.offset, main_#t~mem196#1.base, main_#t~mem196#1.offset, main_#t~mem197#1.base, main_#t~mem197#1.offset, main_#t~mem198#1.base, main_#t~mem198#1.offset, main_#t~mem199#1.base, main_#t~mem199#1.offset, main_#t~mem200#1.base, main_#t~mem200#1.offset, main_#t~mem201#1.base, main_#t~mem201#1.offset, main_#t~mem202#1, main_#t~mem203#1.base, main_#t~mem203#1.offset, main_#t~mem204#1.base, main_#t~mem204#1.offset, main_#t~mem205#1.base, main_#t~mem205#1.offset, main_#t~mem206#1, main_#t~mem207#1.base, main_#t~mem207#1.offset, main_#t~mem208#1.base, main_#t~mem208#1.offset, main_#t~mem209#1.base, main_#t~mem209#1.offset, main_#t~mem210#1.base, main_#t~mem210#1.offset, main_#t~mem211#1.base, main_#t~mem211#1.offset, main_#t~mem212#1, main_#t~mem213#1.base, main_#t~mem213#1.offset, main_#t~mem216#1, main_#t~mem214#1.base, main_#t~mem214#1.offset, main_#t~mem215#1, main_#t~mem217#1.base, main_#t~mem217#1.offset, main_#t~mem218#1.base, main_#t~mem218#1.offset, main_#t~mem219#1, main_#t~post220#1, main_#t~mem221#1.base, main_#t~mem221#1.offset, main_#t~mem222#1.base, main_#t~mem222#1.offset, main_#t~mem223#1.base, main_#t~mem223#1.offset, main_#t~mem224#1.base, main_#t~mem224#1.offset, main_#t~mem225#1.base, main_#t~mem225#1.offset, main_#t~mem226#1.base, main_#t~mem226#1.offset, main_#t~mem227#1.base, main_#t~mem227#1.offset, main_#t~mem228#1.base, main_#t~mem228#1.offset, main_~_hd_head~0#1.base, main_~_hd_head~0#1.offset, main_#t~mem229#1.base, main_#t~mem229#1.offset, main_#t~mem230#1, main_#t~post231#1, main_~_hd_bkt~0#1, main_~_hd_hh_del~0#1.base, main_~_hd_hh_del~0#1.offset, main_#t~mem232#1.base, main_#t~mem232#1.offset, main_#t~mem233#1, main_#t~mem146#1, main_#t~mem147#1, main_~#i~0#1.base, main_~#i~0#1.offset, main_~user~0#1.base, main_~user~0#1.offset, main_~tmp~0#1.base, main_~tmp~0#1.offset, main_~users~0#1.base, main_~users~0#1.offset;call main_~#i~0#1.base, main_~#i~0#1.offset := #Ultimate.allocOnStack(4);havoc main_~user~0#1.base, main_~user~0#1.offset;havoc main_~tmp~0#1.base, main_~tmp~0#1.offset;main_~users~0#1.base, main_~users~0#1.offset := 0, 0;call write~int(0, main_~#i~0#1.base, main_~#i~0#1.offset, 4); {1587#(and (= (select (select |#memory_int| |ULTIMATE.start_main_~#i~0#1.base|) |ULTIMATE.start_main_~#i~0#1.offset|) 0) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#i~0#1.base|))} is VALID [2022-02-21 03:18:40,670 INFO L290 TraceCheckUtils]: 2: Hoare triple {1587#(and (= (select (select |#memory_int| |ULTIMATE.start_main_~#i~0#1.base|) |ULTIMATE.start_main_~#i~0#1.offset|) 0) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#i~0#1.base|))} call main_#t~mem7#1 := read~int(main_~#i~0#1.base, main_~#i~0#1.offset, 4); {1587#(and (= (select (select |#memory_int| |ULTIMATE.start_main_~#i~0#1.base|) |ULTIMATE.start_main_~#i~0#1.offset|) 0) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#i~0#1.base|))} is VALID [2022-02-21 03:18:40,671 INFO L290 TraceCheckUtils]: 3: Hoare triple {1587#(and (= (select (select |#memory_int| |ULTIMATE.start_main_~#i~0#1.base|) |ULTIMATE.start_main_~#i~0#1.offset|) 0) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#i~0#1.base|))} assume !!(main_#t~mem7#1 < 10);havoc main_#t~mem7#1;call main_#t~malloc8#1.base, main_#t~malloc8#1.offset := #Ultimate.allocOnHeap(40);main_~user~0#1.base, main_~user~0#1.offset := main_#t~malloc8#1.base, main_#t~malloc8#1.offset;havoc main_#t~malloc8#1.base, main_#t~malloc8#1.offset; {1594#(and (= (select (select |#memory_int| |ULTIMATE.start_main_~#i~0#1.base|) |ULTIMATE.start_main_~#i~0#1.offset|) 0) (< (+ |ULTIMATE.start_main_~user~0#1.base| 1) |ULTIMATE.start_main_~#i~0#1.base|))} is VALID [2022-02-21 03:18:40,671 INFO L290 TraceCheckUtils]: 4: Hoare triple {1594#(and (= (select (select |#memory_int| |ULTIMATE.start_main_~#i~0#1.base|) |ULTIMATE.start_main_~#i~0#1.offset|) 0) (< (+ |ULTIMATE.start_main_~user~0#1.base| 1) |ULTIMATE.start_main_~#i~0#1.base|))} assume !(main_~user~0#1.base == 0 && main_~user~0#1.offset == 0); {1594#(and (= (select (select |#memory_int| |ULTIMATE.start_main_~#i~0#1.base|) |ULTIMATE.start_main_~#i~0#1.offset|) 0) (< (+ |ULTIMATE.start_main_~user~0#1.base| 1) |ULTIMATE.start_main_~#i~0#1.base|))} is VALID [2022-02-21 03:18:40,672 INFO L290 TraceCheckUtils]: 5: Hoare triple {1594#(and (= (select (select |#memory_int| |ULTIMATE.start_main_~#i~0#1.base|) |ULTIMATE.start_main_~#i~0#1.offset|) 0) (< (+ |ULTIMATE.start_main_~user~0#1.base| 1) |ULTIMATE.start_main_~#i~0#1.base|))} call main_#t~mem9#1 := read~int(main_~#i~0#1.base, main_~#i~0#1.offset, 4);call write~int(main_#t~mem9#1, main_~user~0#1.base, main_~user~0#1.offset, 4);havoc main_#t~mem9#1;call main_#t~mem10#1 := read~int(main_~#i~0#1.base, main_~#i~0#1.offset, 4);call main_#t~mem11#1 := read~int(main_~#i~0#1.base, main_~#i~0#1.offset, 4); {1601#(and (= |ULTIMATE.start_main_#t~mem10#1| |ULTIMATE.start_main_#t~mem11#1|) (= |ULTIMATE.start_main_#t~mem10#1| 0))} is VALID [2022-02-21 03:18:40,673 INFO L290 TraceCheckUtils]: 6: Hoare triple {1601#(and (= |ULTIMATE.start_main_#t~mem10#1| |ULTIMATE.start_main_#t~mem11#1|) (= |ULTIMATE.start_main_#t~mem10#1| 0))} assume !(main_#t~mem10#1 * main_#t~mem11#1 <= 2147483647); {1580#false} is VALID [2022-02-21 03:18:40,673 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:18:40,673 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-21 03:18:40,674 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 03:18:40,674 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [506316374] [2022-02-21 03:18:40,674 WARN L317 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-02-21 03:18:40,674 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1241716795] [2022-02-21 03:18:40,674 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1241716795] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-21 03:18:40,675 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-21 03:18:40,675 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-02-21 03:18:40,676 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1987555964] [2022-02-21 03:18:40,676 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-21 03:18:40,676 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 1.75) internal successors, (7), 5 states have internal predecessors, (7), 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 7 [2022-02-21 03:18:40,677 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-21 03:18:40,677 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 5 states, 4 states have (on average 1.75) internal successors, (7), 5 states have internal predecessors, (7), 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:18:40,684 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 7 edges. 7 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:18:40,684 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-21 03:18:40,685 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 03:18:40,685 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-21 03:18:40,685 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-02-21 03:18:40,686 INFO L87 Difference]: Start difference. First operand 234 states and 319 transitions. Second operand has 5 states, 4 states have (on average 1.75) internal successors, (7), 5 states have internal predecessors, (7), 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:18:42,793 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:18:42,794 INFO L93 Difference]: Finished difference Result 362 states and 487 transitions. [2022-02-21 03:18:42,794 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-02-21 03:18:42,794 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 1.75) internal successors, (7), 5 states have internal predecessors, (7), 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 7 [2022-02-21 03:18:42,794 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-21 03:18:42,794 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 4 states have (on average 1.75) internal successors, (7), 5 states have internal predecessors, (7), 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:18:42,800 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 487 transitions. [2022-02-21 03:18:42,800 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 4 states have (on average 1.75) internal successors, (7), 5 states have internal predecessors, (7), 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:18:42,806 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 487 transitions. [2022-02-21 03:18:42,806 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 487 transitions. [2022-02-21 03:18:43,206 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 487 edges. 487 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:18:43,217 INFO L225 Difference]: With dead ends: 362 [2022-02-21 03:18:43,217 INFO L226 Difference]: Without dead ends: 360 [2022-02-21 03:18:43,218 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-02-21 03:18:43,219 INFO L933 BasicCegarLoop]: 279 mSDtfsCounter, 197 mSDsluCounter, 747 mSDsCounter, 0 mSdLazyCounter, 292 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 198 SdHoareTripleChecker+Valid, 1026 SdHoareTripleChecker+Invalid, 306 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 292 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-02-21 03:18:43,219 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [198 Valid, 1026 Invalid, 306 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 292 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-02-21 03:18:43,220 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 360 states. [2022-02-21 03:18:43,232 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 360 to 240. [2022-02-21 03:18:43,232 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 03:18:43,233 INFO L82 GeneralOperation]: Start isEquivalent. First operand 360 states. Second operand has 240 states, 209 states have (on average 1.368421052631579) internal successors, (286), 231 states have internal predecessors, (286), 20 states have call successors, (20), 3 states have call predecessors, (20), 3 states have return successors, (20), 6 states have call predecessors, (20), 20 states have call successors, (20) [2022-02-21 03:18:43,233 INFO L74 IsIncluded]: Start isIncluded. First operand 360 states. Second operand has 240 states, 209 states have (on average 1.368421052631579) internal successors, (286), 231 states have internal predecessors, (286), 20 states have call successors, (20), 3 states have call predecessors, (20), 3 states have return successors, (20), 6 states have call predecessors, (20), 20 states have call successors, (20) [2022-02-21 03:18:43,235 INFO L87 Difference]: Start difference. First operand 360 states. Second operand has 240 states, 209 states have (on average 1.368421052631579) internal successors, (286), 231 states have internal predecessors, (286), 20 states have call successors, (20), 3 states have call predecessors, (20), 3 states have return successors, (20), 6 states have call predecessors, (20), 20 states have call successors, (20) [2022-02-21 03:18:43,257 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:18:43,258 INFO L93 Difference]: Finished difference Result 360 states and 485 transitions. [2022-02-21 03:18:43,258 INFO L276 IsEmpty]: Start isEmpty. Operand 360 states and 485 transitions. [2022-02-21 03:18:43,260 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:18:43,261 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:18:43,262 INFO L74 IsIncluded]: Start isIncluded. First operand has 240 states, 209 states have (on average 1.368421052631579) internal successors, (286), 231 states have internal predecessors, (286), 20 states have call successors, (20), 3 states have call predecessors, (20), 3 states have return successors, (20), 6 states have call predecessors, (20), 20 states have call successors, (20) Second operand 360 states. [2022-02-21 03:18:43,265 INFO L87 Difference]: Start difference. First operand has 240 states, 209 states have (on average 1.368421052631579) internal successors, (286), 231 states have internal predecessors, (286), 20 states have call successors, (20), 3 states have call predecessors, (20), 3 states have return successors, (20), 6 states have call predecessors, (20), 20 states have call successors, (20) Second operand 360 states. [2022-02-21 03:18:43,279 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:18:43,279 INFO L93 Difference]: Finished difference Result 360 states and 485 transitions. [2022-02-21 03:18:43,280 INFO L276 IsEmpty]: Start isEmpty. Operand 360 states and 485 transitions. [2022-02-21 03:18:43,281 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:18:43,281 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:18:43,281 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 03:18:43,281 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 03:18:43,282 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 240 states, 209 states have (on average 1.368421052631579) internal successors, (286), 231 states have internal predecessors, (286), 20 states have call successors, (20), 3 states have call predecessors, (20), 3 states have return successors, (20), 6 states have call predecessors, (20), 20 states have call successors, (20) [2022-02-21 03:18:43,291 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 240 states to 240 states and 326 transitions. [2022-02-21 03:18:43,291 INFO L78 Accepts]: Start accepts. Automaton has 240 states and 326 transitions. Word has length 7 [2022-02-21 03:18:43,291 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-21 03:18:43,291 INFO L470 AbstractCegarLoop]: Abstraction has 240 states and 326 transitions. [2022-02-21 03:18:43,292 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 1.75) internal successors, (7), 5 states have internal predecessors, (7), 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:18:43,293 INFO L276 IsEmpty]: Start isEmpty. Operand 240 states and 326 transitions. [2022-02-21 03:18:43,294 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2022-02-21 03:18:43,294 INFO L506 BasicCegarLoop]: Found error trace [2022-02-21 03:18:43,294 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] [2022-02-21 03:18:43,313 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-02-21 03:18:43,503 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:18:43,504 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting test_intErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [test_intErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, test_intErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2022-02-21 03:18:43,504 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:18:43,505 INFO L85 PathProgramCache]: Analyzing trace with hash 923887179, now seen corresponding path program 1 times [2022-02-21 03:18:43,505 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:18:43,505 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1688532164] [2022-02-21 03:18:43,505 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:18:43,505 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:18:43,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:18:43,609 INFO L290 TraceCheckUtils]: 0: Hoare triple {3059#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(21, 2);~count_int~0 := 0; {3059#true} is VALID [2022-02-21 03:18:43,610 INFO L290 TraceCheckUtils]: 1: Hoare triple {3059#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc8#1.base, main_#t~malloc8#1.offset, main_#t~mem9#1, main_#t~mem10#1, main_#t~mem11#1, main_#t~mem13#1, main_#t~mem12#1, main_#t~mem14#1, main_#t~mem15#1, main_#t~mem17#1, main_#t~mem16#1, main_#t~mem18#1, main_#t~mem19#1, main_#t~mem21#1, main_#t~mem20#1, main_#t~mem22#1, main_#t~mem23#1, main_#t~switch24#1, main_#t~mem25#1, main_#t~mem26#1, main_#t~mem27#1, main_#t~mem28#1, main_#t~mem29#1, main_#t~mem30#1, main_#t~mem31#1, main_#t~mem32#1, main_#t~mem33#1, main_#t~mem34#1, main_#t~mem35#1, main_~_hj_i~0#1, main_~_hj_j~0#1, main_~_hj_k~0#1, main_~_hj_key~0#1.base, main_~_hj_key~0#1.offset, main_#t~malloc36#1.base, main_#t~malloc36#1.offset, main_#t~mem37#1.base, main_#t~mem37#1.offset, main_#t~mem38#1.base, main_#t~mem38#1.offset, main_#t~memset~res39#1.base, main_#t~memset~res39#1.offset, main_#t~mem40#1.base, main_#t~mem40#1.offset, main_#t~mem41#1.base, main_#t~mem41#1.offset, main_#t~mem42#1.base, main_#t~mem42#1.offset, main_#t~mem43#1.base, main_#t~mem43#1.offset, main_#t~mem44#1.base, main_#t~mem44#1.offset, main_#t~malloc45#1.base, main_#t~malloc45#1.offset, main_#t~mem46#1.base, main_#t~mem46#1.offset, main_#t~mem47#1.base, main_#t~mem47#1.offset, main_#t~mem48#1.base, main_#t~mem48#1.offset, main_#t~mem49#1.base, main_#t~mem49#1.offset, main_#t~mem50#1.base, main_#t~mem50#1.offset, main_#t~mem51#1.base, main_#t~mem51#1.offset, main_#t~memset~res52#1.base, main_#t~memset~res52#1.offset, main_#t~mem53#1.base, main_#t~mem53#1.offset, main_#t~mem54#1.base, main_#t~mem54#1.offset, main_#t~mem55#1.base, main_#t~mem55#1.offset, main_#t~mem56#1.base, main_#t~mem56#1.offset, main_#t~mem57#1, main_#t~mem58#1.base, main_#t~mem58#1.offset, main_#t~mem59#1.base, main_#t~mem59#1.offset, main_#t~mem60#1.base, main_#t~mem60#1.offset, main_#t~mem61#1.base, main_#t~mem61#1.offset, main_#t~mem62#1, main_#t~post63#1, main_#t~mem64#1.base, main_#t~mem64#1.offset, main_#t~mem65#1, main_#t~mem66#1.base, main_#t~mem66#1.offset, main_#t~mem67#1.base, main_#t~mem67#1.offset, main_#t~mem68#1, main_#t~post69#1, main_#t~mem70#1.base, main_#t~mem70#1.offset, main_#t~mem71#1.base, main_#t~mem71#1.offset, main_#t~mem72#1.base, main_#t~mem72#1.offset, main_#t~mem74#1, main_#t~mem73#1, main_#t~mem75#1.base, main_#t~mem75#1.offset, main_#t~mem76#1, main_#t~short77#1, main_#t~mem78#1.base, main_#t~mem78#1.offset, main_#t~mem79#1, main_#t~malloc80#1.base, main_#t~malloc80#1.offset, main_#t~mem81#1.base, main_#t~mem81#1.offset, main_#t~mem82#1.base, main_#t~mem82#1.offset, main_#t~mem83#1.base, main_#t~mem83#1.offset, main_#t~mem84#1, main_#t~memset~res85#1.base, main_#t~memset~res85#1.offset, main_#t~mem86#1.base, main_#t~mem86#1.offset, main_#t~mem87#1.base, main_#t~mem87#1.offset, main_#t~mem90#1, main_#t~mem88#1.base, main_#t~mem88#1.offset, main_#t~mem89#1, main_#t~mem91#1.base, main_#t~mem91#1.offset, main_#t~mem94#1, main_#t~mem92#1.base, main_#t~mem92#1.offset, main_#t~mem93#1, main_#t~ite95#1, main_#t~mem96#1.base, main_#t~mem96#1.offset, main_#t~mem100#1.base, main_#t~mem100#1.offset, main_#t~mem101#1.base, main_#t~mem101#1.offset, main_#t~mem102#1.base, main_#t~mem102#1.offset, main_#t~mem103#1.base, main_#t~mem103#1.offset, main_#t~mem106#1, main_#t~mem104#1.base, main_#t~mem104#1.offset, main_#t~mem105#1, main_#t~mem107#1.base, main_#t~mem107#1.offset, main_#t~mem108#1, main_#t~pre109#1, main_#t~mem110#1.base, main_#t~mem110#1.offset, main_#t~mem111#1, main_#t~mem112#1.base, main_#t~mem112#1.offset, main_#t~mem113#1, main_#t~post114#1, main_#t~mem118#1, main_#t~mem116#1, main_#t~mem115#1.base, main_#t~mem115#1.offset, main_#t~mem117#1, main_#t~mem119#1, main_#t~post120#1, main_#t~mem121#1.base, main_#t~mem121#1.offset, main_#t~mem122#1.base, main_#t~mem122#1.offset, main_#t~mem123#1.base, main_#t~mem123#1.offset, main_#t~post97#1, main_#t~mem98#1.base, main_#t~mem98#1.offset, main_#t~mem99#1, main_#t~mem124#1.base, main_#t~mem124#1.offset, main_#t~mem125#1.base, main_#t~mem125#1.offset, main_#t~mem126#1.base, main_#t~mem126#1.offset, main_#t~mem127#1, main_#t~mem128#1.base, main_#t~mem128#1.offset, main_#t~mem129#1, main_#t~post130#1, main_#t~mem131#1.base, main_#t~mem131#1.offset, main_#t~mem132#1.base, main_#t~mem132#1.offset, main_#t~mem133#1.base, main_#t~mem133#1.offset, main_#t~mem134#1.base, main_#t~mem134#1.offset, main_#t~mem137#1, main_#t~mem135#1.base, main_#t~mem135#1.offset, main_#t~mem136#1, main_#t~ite140#1, main_#t~mem138#1.base, main_#t~mem138#1.offset, main_#t~mem139#1, main_#t~mem141#1.base, main_#t~mem141#1.offset, main_#t~mem142#1, main_#t~mem143#1.base, main_#t~mem143#1.offset, main_~_he_bkt~0#1, main_~_he_bkt_i~0#1, main_~_he_thh~0#1.base, main_~_he_thh~0#1.offset, main_~_he_hh_nxt~0#1.base, main_~_he_hh_nxt~0#1.offset, main_~#_he_new_buckets~0#1.base, main_~#_he_new_buckets~0#1.offset, main_~_he_newbkt~0#1.base, main_~_he_newbkt~0#1.offset, main_~_ha_head~0#1.base, main_~_ha_head~0#1.offset, main_~_ha_bkt~0#1, main_~_ha_hashv~0#1, main_#t~mem144#1.base, main_#t~mem144#1.offset, main_#t~mem145#1, main_#t~mem5#1, main_#t~post6#1, main_#t~mem7#1, main_#t~mem149#1, main_#t~mem148#1, main_#t~mem150#1, main_#t~mem151#1, main_#t~mem153#1, main_#t~mem152#1, main_#t~mem154#1, main_#t~mem155#1, main_#t~mem157#1, main_#t~mem156#1, main_#t~mem158#1, main_#t~mem159#1, main_#t~switch160#1, main_#t~mem161#1, main_#t~mem162#1, main_#t~mem163#1, main_#t~mem164#1, main_#t~mem165#1, main_#t~mem166#1, main_#t~mem167#1, main_#t~mem168#1, main_#t~mem169#1, main_#t~mem170#1, main_#t~mem171#1, main_~_hj_i~1#1, main_~_hj_j~1#1, main_~_hj_k~1#1, main_~_hj_key~1#1.base, main_~_hj_key~1#1.offset, main_#t~mem172#1.base, main_#t~mem172#1.offset, main_#t~mem173#1, main_#t~mem174#1.base, main_#t~mem174#1.offset, main_#t~mem175#1.base, main_#t~mem175#1.offset, main_#t~mem176#1.base, main_#t~mem176#1.offset, main_#t~mem177#1.base, main_#t~mem177#1.offset, main_#t~mem178#1.base, main_#t~mem178#1.offset, main_#t~mem179#1.base, main_#t~mem179#1.offset, main_#t~mem180#1.base, main_#t~mem180#1.offset, main_#t~mem181#1, main_#t~mem182#1, main_#t~mem183#1, main_#t~short184#1, main_#t~mem185#1.base, main_#t~mem185#1.offset, main_#t~ret186#1, main_#t~mem187#1.base, main_#t~mem187#1.offset, main_#t~mem188#1.base, main_#t~mem188#1.offset, main_#t~mem189#1.base, main_#t~mem189#1.offset, main_#t~mem190#1, main_~_hf_bkt~0#1, main_~_hf_hashv~0#1, main_#t~mem191#1.base, main_#t~mem191#1.offset, main_#t~mem192#1.base, main_#t~mem192#1.offset, main_#t~short193#1, main_#t~mem194#1.base, main_#t~mem194#1.offset, main_#t~mem195#1.base, main_#t~mem195#1.offset, main_#t~mem196#1.base, main_#t~mem196#1.offset, main_#t~mem197#1.base, main_#t~mem197#1.offset, main_#t~mem198#1.base, main_#t~mem198#1.offset, main_#t~mem199#1.base, main_#t~mem199#1.offset, main_#t~mem200#1.base, main_#t~mem200#1.offset, main_#t~mem201#1.base, main_#t~mem201#1.offset, main_#t~mem202#1, main_#t~mem203#1.base, main_#t~mem203#1.offset, main_#t~mem204#1.base, main_#t~mem204#1.offset, main_#t~mem205#1.base, main_#t~mem205#1.offset, main_#t~mem206#1, main_#t~mem207#1.base, main_#t~mem207#1.offset, main_#t~mem208#1.base, main_#t~mem208#1.offset, main_#t~mem209#1.base, main_#t~mem209#1.offset, main_#t~mem210#1.base, main_#t~mem210#1.offset, main_#t~mem211#1.base, main_#t~mem211#1.offset, main_#t~mem212#1, main_#t~mem213#1.base, main_#t~mem213#1.offset, main_#t~mem216#1, main_#t~mem214#1.base, main_#t~mem214#1.offset, main_#t~mem215#1, main_#t~mem217#1.base, main_#t~mem217#1.offset, main_#t~mem218#1.base, main_#t~mem218#1.offset, main_#t~mem219#1, main_#t~post220#1, main_#t~mem221#1.base, main_#t~mem221#1.offset, main_#t~mem222#1.base, main_#t~mem222#1.offset, main_#t~mem223#1.base, main_#t~mem223#1.offset, main_#t~mem224#1.base, main_#t~mem224#1.offset, main_#t~mem225#1.base, main_#t~mem225#1.offset, main_#t~mem226#1.base, main_#t~mem226#1.offset, main_#t~mem227#1.base, main_#t~mem227#1.offset, main_#t~mem228#1.base, main_#t~mem228#1.offset, main_~_hd_head~0#1.base, main_~_hd_head~0#1.offset, main_#t~mem229#1.base, main_#t~mem229#1.offset, main_#t~mem230#1, main_#t~post231#1, main_~_hd_bkt~0#1, main_~_hd_hh_del~0#1.base, main_~_hd_hh_del~0#1.offset, main_#t~mem232#1.base, main_#t~mem232#1.offset, main_#t~mem233#1, main_#t~mem146#1, main_#t~mem147#1, main_~#i~0#1.base, main_~#i~0#1.offset, main_~user~0#1.base, main_~user~0#1.offset, main_~tmp~0#1.base, main_~tmp~0#1.offset, main_~users~0#1.base, main_~users~0#1.offset;call main_~#i~0#1.base, main_~#i~0#1.offset := #Ultimate.allocOnStack(4);havoc main_~user~0#1.base, main_~user~0#1.offset;havoc main_~tmp~0#1.base, main_~tmp~0#1.offset;main_~users~0#1.base, main_~users~0#1.offset := 0, 0;call write~int(0, main_~#i~0#1.base, main_~#i~0#1.offset, 4); {3061#(= (select (select |#memory_int| |ULTIMATE.start_main_~#i~0#1.base|) |ULTIMATE.start_main_~#i~0#1.offset|) 0)} is VALID [2022-02-21 03:18:43,611 INFO L290 TraceCheckUtils]: 2: Hoare triple {3061#(= (select (select |#memory_int| |ULTIMATE.start_main_~#i~0#1.base|) |ULTIMATE.start_main_~#i~0#1.offset|) 0)} call main_#t~mem7#1 := read~int(main_~#i~0#1.base, main_~#i~0#1.offset, 4); {3062#(= |ULTIMATE.start_main_#t~mem7#1| 0)} is VALID [2022-02-21 03:18:43,612 INFO L290 TraceCheckUtils]: 3: Hoare triple {3062#(= |ULTIMATE.start_main_#t~mem7#1| 0)} assume !(main_#t~mem7#1 < 10);havoc main_#t~mem7#1; {3060#false} is VALID [2022-02-21 03:18:43,612 INFO L290 TraceCheckUtils]: 4: Hoare triple {3060#false} call write~int(0, main_~#i~0#1.base, main_~#i~0#1.offset, 4); {3060#false} is VALID [2022-02-21 03:18:43,612 INFO L290 TraceCheckUtils]: 5: Hoare triple {3060#false} call main_#t~mem147#1 := read~int(main_~#i~0#1.base, main_~#i~0#1.offset, 4); {3060#false} is VALID [2022-02-21 03:18:43,612 INFO L290 TraceCheckUtils]: 6: Hoare triple {3060#false} assume !!(main_#t~mem147#1 < 10);havoc main_#t~mem147#1; {3060#false} is VALID [2022-02-21 03:18:43,613 INFO L290 TraceCheckUtils]: 7: Hoare triple {3060#false} havoc main_~_hf_hashv~0#1; {3060#false} is VALID [2022-02-21 03:18:43,613 INFO L290 TraceCheckUtils]: 8: Hoare triple {3060#false} goto; {3060#false} is VALID [2022-02-21 03:18:43,613 INFO L290 TraceCheckUtils]: 9: Hoare triple {3060#false} havoc main_~_hj_i~1#1;havoc main_~_hj_j~1#1;havoc main_~_hj_k~1#1;main_~_hj_key~1#1.base, main_~_hj_key~1#1.offset := main_~#i~0#1.base, main_~#i~0#1.offset;main_~_hf_hashv~0#1 := 4276993775;main_~_hj_j~1#1 := 2654435769;main_~_hj_i~1#1 := main_~_hj_j~1#1;main_~_hj_k~1#1 := 4; {3060#false} is VALID [2022-02-21 03:18:43,613 INFO L290 TraceCheckUtils]: 10: Hoare triple {3060#false} assume !(main_~_hj_k~1#1 % 4294967296 >= 12); {3060#false} is VALID [2022-02-21 03:18:43,614 INFO L290 TraceCheckUtils]: 11: Hoare triple {3060#false} main_~_hf_hashv~0#1 := 4 + main_~_hf_hashv~0#1;main_#t~switch160#1 := 11 == main_~_hj_k~1#1; {3060#false} is VALID [2022-02-21 03:18:43,614 INFO L290 TraceCheckUtils]: 12: Hoare triple {3060#false} assume main_#t~switch160#1;call main_#t~mem161#1 := read~int(main_~_hj_key~1#1.base, 10 + main_~_hj_key~1#1.offset, 1);main_~_hf_hashv~0#1 := main_~_hf_hashv~0#1 + 16777216 * (main_#t~mem161#1 % 256);havoc main_#t~mem161#1; {3060#false} is VALID [2022-02-21 03:18:43,614 INFO L290 TraceCheckUtils]: 13: Hoare triple {3060#false} main_#t~switch160#1 := main_#t~switch160#1 || 10 == main_~_hj_k~1#1; {3060#false} is VALID [2022-02-21 03:18:43,614 INFO L290 TraceCheckUtils]: 14: Hoare triple {3060#false} assume main_#t~switch160#1;call main_#t~mem162#1 := read~int(main_~_hj_key~1#1.base, 9 + main_~_hj_key~1#1.offset, 1);main_~_hf_hashv~0#1 := main_~_hf_hashv~0#1 + 65536 * (main_#t~mem162#1 % 256);havoc main_#t~mem162#1; {3060#false} is VALID [2022-02-21 03:18:43,614 INFO L290 TraceCheckUtils]: 15: Hoare triple {3060#false} main_#t~switch160#1 := main_#t~switch160#1 || 9 == main_~_hj_k~1#1; {3060#false} is VALID [2022-02-21 03:18:43,615 INFO L290 TraceCheckUtils]: 16: Hoare triple {3060#false} assume main_#t~switch160#1;call main_#t~mem163#1 := read~int(main_~_hj_key~1#1.base, 8 + main_~_hj_key~1#1.offset, 1);main_~_hf_hashv~0#1 := main_~_hf_hashv~0#1 + 256 * (main_#t~mem163#1 % 256);havoc main_#t~mem163#1; {3060#false} is VALID [2022-02-21 03:18:43,615 INFO L290 TraceCheckUtils]: 17: Hoare triple {3060#false} main_#t~switch160#1 := main_#t~switch160#1 || 8 == main_~_hj_k~1#1; {3060#false} is VALID [2022-02-21 03:18:43,615 INFO L290 TraceCheckUtils]: 18: Hoare triple {3060#false} assume main_#t~switch160#1;call main_#t~mem164#1 := read~int(main_~_hj_key~1#1.base, 7 + main_~_hj_key~1#1.offset, 1);main_~_hj_j~1#1 := main_~_hj_j~1#1 + 16777216 * (main_#t~mem164#1 % 256);havoc main_#t~mem164#1; {3060#false} is VALID [2022-02-21 03:18:43,615 INFO L290 TraceCheckUtils]: 19: Hoare triple {3060#false} main_#t~switch160#1 := main_#t~switch160#1 || 7 == main_~_hj_k~1#1; {3060#false} is VALID [2022-02-21 03:18:43,616 INFO L290 TraceCheckUtils]: 20: Hoare triple {3060#false} assume main_#t~switch160#1;call main_#t~mem165#1 := read~int(main_~_hj_key~1#1.base, 6 + main_~_hj_key~1#1.offset, 1);main_~_hj_j~1#1 := main_~_hj_j~1#1 + 65536 * (main_#t~mem165#1 % 256);havoc main_#t~mem165#1; {3060#false} is VALID [2022-02-21 03:18:43,616 INFO L290 TraceCheckUtils]: 21: Hoare triple {3060#false} main_#t~switch160#1 := main_#t~switch160#1 || 6 == main_~_hj_k~1#1; {3060#false} is VALID [2022-02-21 03:18:43,616 INFO L290 TraceCheckUtils]: 22: Hoare triple {3060#false} assume main_#t~switch160#1;call main_#t~mem166#1 := read~int(main_~_hj_key~1#1.base, 5 + main_~_hj_key~1#1.offset, 1);main_~_hj_j~1#1 := main_~_hj_j~1#1 + 256 * (main_#t~mem166#1 % 256);havoc main_#t~mem166#1; {3060#false} is VALID [2022-02-21 03:18:43,616 INFO L290 TraceCheckUtils]: 23: Hoare triple {3060#false} main_#t~switch160#1 := main_#t~switch160#1 || 5 == main_~_hj_k~1#1; {3060#false} is VALID [2022-02-21 03:18:43,616 INFO L290 TraceCheckUtils]: 24: Hoare triple {3060#false} assume main_#t~switch160#1;call main_#t~mem167#1 := read~int(main_~_hj_key~1#1.base, 4 + main_~_hj_key~1#1.offset, 1);main_~_hj_j~1#1 := main_~_hj_j~1#1 + main_#t~mem167#1 % 256;havoc main_#t~mem167#1; {3060#false} is VALID [2022-02-21 03:18:43,616 INFO L290 TraceCheckUtils]: 25: Hoare triple {3060#false} main_#t~switch160#1 := main_#t~switch160#1 || 4 == main_~_hj_k~1#1; {3060#false} is VALID [2022-02-21 03:18:43,617 INFO L290 TraceCheckUtils]: 26: Hoare triple {3060#false} assume !main_#t~switch160#1; {3060#false} is VALID [2022-02-21 03:18:43,617 INFO L290 TraceCheckUtils]: 27: Hoare triple {3060#false} main_#t~switch160#1 := main_#t~switch160#1 || 3 == main_~_hj_k~1#1; {3060#false} is VALID [2022-02-21 03:18:43,617 INFO L290 TraceCheckUtils]: 28: Hoare triple {3060#false} assume main_#t~switch160#1;call main_#t~mem169#1 := read~int(main_~_hj_key~1#1.base, 2 + main_~_hj_key~1#1.offset, 1);main_~_hj_i~1#1 := main_~_hj_i~1#1 + 65536 * (main_#t~mem169#1 % 256);havoc main_#t~mem169#1; {3060#false} is VALID [2022-02-21 03:18:43,617 INFO L290 TraceCheckUtils]: 29: Hoare triple {3060#false} main_#t~switch160#1 := main_#t~switch160#1 || 2 == main_~_hj_k~1#1; {3060#false} is VALID [2022-02-21 03:18:43,617 INFO L290 TraceCheckUtils]: 30: Hoare triple {3060#false} assume main_#t~switch160#1;call main_#t~mem170#1 := read~int(main_~_hj_key~1#1.base, 1 + main_~_hj_key~1#1.offset, 1);main_~_hj_i~1#1 := main_~_hj_i~1#1 + 256 * (main_#t~mem170#1 % 256);havoc main_#t~mem170#1; {3060#false} is VALID [2022-02-21 03:18:43,617 INFO L290 TraceCheckUtils]: 31: Hoare triple {3060#false} main_#t~switch160#1 := main_#t~switch160#1 || 1 == main_~_hj_k~1#1; {3060#false} is VALID [2022-02-21 03:18:43,618 INFO L290 TraceCheckUtils]: 32: Hoare triple {3060#false} assume main_#t~switch160#1;call main_#t~mem171#1 := read~int(main_~_hj_key~1#1.base, main_~_hj_key~1#1.offset, 1);main_~_hj_i~1#1 := main_~_hj_i~1#1 + main_#t~mem171#1 % 256;havoc main_#t~mem171#1; {3060#false} is VALID [2022-02-21 03:18:43,618 INFO L290 TraceCheckUtils]: 33: Hoare triple {3060#false} havoc main_#t~switch160#1; {3060#false} is VALID [2022-02-21 03:18:43,619 INFO L290 TraceCheckUtils]: 34: Hoare triple {3060#false} main_~_hj_i~1#1 := main_~_hj_i~1#1 - main_~_hj_j~1#1;main_~_hj_i~1#1 := main_~_hj_i~1#1 - main_~_hf_hashv~0#1;main_~_hj_i~1#1 := (if (1 == main_~_hj_i~1#1 || 0 == main_~_hj_i~1#1) && (1 == main_~_hf_hashv~0#1 / 8192 || 0 == main_~_hf_hashv~0#1 / 8192) then (if main_~_hj_i~1#1 == main_~_hf_hashv~0#1 / 8192 then 0 else 1) else (if 0 == main_~_hj_i~1#1 then main_~_hf_hashv~0#1 / 8192 else (if 0 == main_~_hf_hashv~0#1 / 8192 then main_~_hj_i~1#1 else ~bitwiseXOr(main_~_hj_i~1#1, main_~_hf_hashv~0#1 / 8192))));main_~_hj_j~1#1 := main_~_hj_j~1#1 - main_~_hf_hashv~0#1;main_~_hj_j~1#1 := main_~_hj_j~1#1 - main_~_hj_i~1#1;main_~_hj_j~1#1 := (if (1 == main_~_hj_j~1#1 || 0 == main_~_hj_j~1#1) && (1 == 256 * main_~_hj_i~1#1 || 0 == 256 * main_~_hj_i~1#1) then (if main_~_hj_j~1#1 == 256 * main_~_hj_i~1#1 then 0 else 1) else (if 0 == main_~_hj_j~1#1 then 256 * main_~_hj_i~1#1 else (if 0 == 256 * main_~_hj_i~1#1 then main_~_hj_j~1#1 else ~bitwiseXOr(main_~_hj_j~1#1, 256 * main_~_hj_i~1#1))));main_~_hf_hashv~0#1 := main_~_hf_hashv~0#1 - main_~_hj_i~1#1;main_~_hf_hashv~0#1 := main_~_hf_hashv~0#1 - main_~_hj_j~1#1;main_~_hf_hashv~0#1 := (if (1 == main_~_hf_hashv~0#1 || 0 == main_~_hf_hashv~0#1) && (1 == main_~_hj_j~1#1 / 8192 || 0 == main_~_hj_j~1#1 / 8192) then (if main_~_hf_hashv~0#1 == main_~_hj_j~1#1 / 8192 then 0 else 1) else (if 0 == main_~_hf_hashv~0#1 then main_~_hj_j~1#1 / 8192 else (if 0 == main_~_hj_j~1#1 / 8192 then main_~_hf_hashv~0#1 else ~bitwiseXOr(main_~_hf_hashv~0#1, main_~_hj_j~1#1 / 8192))));main_~_hj_i~1#1 := main_~_hj_i~1#1 - main_~_hj_j~1#1;main_~_hj_i~1#1 := main_~_hj_i~1#1 - main_~_hf_hashv~0#1;main_~_hj_i~1#1 := (if (1 == main_~_hj_i~1#1 || 0 == main_~_hj_i~1#1) && (1 == main_~_hf_hashv~0#1 / 4096 || 0 == main_~_hf_hashv~0#1 / 4096) then (if main_~_hj_i~1#1 == main_~_hf_hashv~0#1 / 4096 then 0 else 1) else (if 0 == main_~_hj_i~1#1 then main_~_hf_hashv~0#1 / 4096 else (if 0 == main_~_hf_hashv~0#1 / 4096 then main_~_hj_i~1#1 else ~bitwiseXOr(main_~_hj_i~1#1, main_~_hf_hashv~0#1 / 4096))));main_~_hj_j~1#1 := main_~_hj_j~1#1 - main_~_hf_hashv~0#1;main_~_hj_j~1#1 := main_~_hj_j~1#1 - main_~_hj_i~1#1;main_~_hj_j~1#1 := (if (1 == main_~_hj_j~1#1 || 0 == main_~_hj_j~1#1) && (1 == 65536 * main_~_hj_i~1#1 || 0 == 65536 * main_~_hj_i~1#1) then (if main_~_hj_j~1#1 == 65536 * main_~_hj_i~1#1 then 0 else 1) else (if 0 == main_~_hj_j~1#1 then 65536 * main_~_hj_i~1#1 else (if 0 == 65536 * main_~_hj_i~1#1 then main_~_hj_j~1#1 else ~bitwiseXOr(main_~_hj_j~1#1, 65536 * main_~_hj_i~1#1))));main_~_hf_hashv~0#1 := main_~_hf_hashv~0#1 - main_~_hj_i~1#1;main_~_hf_hashv~0#1 := main_~_hf_hashv~0#1 - main_~_hj_j~1#1;main_~_hf_hashv~0#1 := (if (1 == main_~_hf_hashv~0#1 || 0 == main_~_hf_hashv~0#1) && (1 == main_~_hj_j~1#1 / 32 || 0 == main_~_hj_j~1#1 / 32) then (if main_~_hf_hashv~0#1 == main_~_hj_j~1#1 / 32 then 0 else 1) else (if 0 == main_~_hf_hashv~0#1 then main_~_hj_j~1#1 / 32 else (if 0 == main_~_hj_j~1#1 / 32 then main_~_hf_hashv~0#1 else ~bitwiseXOr(main_~_hf_hashv~0#1, main_~_hj_j~1#1 / 32))));main_~_hj_i~1#1 := main_~_hj_i~1#1 - main_~_hj_j~1#1;main_~_hj_i~1#1 := main_~_hj_i~1#1 - main_~_hf_hashv~0#1;main_~_hj_i~1#1 := (if (1 == main_~_hj_i~1#1 || 0 == main_~_hj_i~1#1) && (1 == main_~_hf_hashv~0#1 / 8 || 0 == main_~_hf_hashv~0#1 / 8) then (if main_~_hj_i~1#1 == main_~_hf_hashv~0#1 / 8 then 0 else 1) else (if 0 == main_~_hj_i~1#1 then main_~_hf_hashv~0#1 / 8 else (if 0 == main_~_hf_hashv~0#1 / 8 then main_~_hj_i~1#1 else ~bitwiseXOr(main_~_hj_i~1#1, main_~_hf_hashv~0#1 / 8))));main_~_hj_j~1#1 := main_~_hj_j~1#1 - main_~_hf_hashv~0#1;main_~_hj_j~1#1 := main_~_hj_j~1#1 - main_~_hj_i~1#1;main_~_hj_j~1#1 := (if (1 == main_~_hj_j~1#1 || 0 == main_~_hj_j~1#1) && (1 == 1024 * main_~_hj_i~1#1 || 0 == 1024 * main_~_hj_i~1#1) then (if main_~_hj_j~1#1 == 1024 * main_~_hj_i~1#1 then 0 else 1) else (if 0 == main_~_hj_j~1#1 then 1024 * main_~_hj_i~1#1 else (if 0 == 1024 * main_~_hj_i~1#1 then main_~_hj_j~1#1 else ~bitwiseXOr(main_~_hj_j~1#1, 1024 * main_~_hj_i~1#1))));main_~_hf_hashv~0#1 := main_~_hf_hashv~0#1 - main_~_hj_i~1#1;main_~_hf_hashv~0#1 := main_~_hf_hashv~0#1 - main_~_hj_j~1#1;main_~_hf_hashv~0#1 := (if (1 == main_~_hf_hashv~0#1 || 0 == main_~_hf_hashv~0#1) && (1 == main_~_hj_j~1#1 / 32768 || 0 == main_~_hj_j~1#1 / 32768) then (if main_~_hf_hashv~0#1 == main_~_hj_j~1#1 / 32768 then 0 else 1) else (if 0 == main_~_hf_hashv~0#1 then main_~_hj_j~1#1 / 32768 else (if 0 == main_~_hj_j~1#1 / 32768 then main_~_hf_hashv~0#1 else ~bitwiseXOr(main_~_hf_hashv~0#1, main_~_hj_j~1#1 / 32768)))); {3060#false} is VALID [2022-02-21 03:18:43,619 INFO L290 TraceCheckUtils]: 35: Hoare triple {3060#false} goto; {3060#false} is VALID [2022-02-21 03:18:43,619 INFO L290 TraceCheckUtils]: 36: Hoare triple {3060#false} goto; {3060#false} is VALID [2022-02-21 03:18:43,619 INFO L290 TraceCheckUtils]: 37: Hoare triple {3060#false} goto; {3060#false} is VALID [2022-02-21 03:18:43,620 INFO L290 TraceCheckUtils]: 38: Hoare triple {3060#false} main_~tmp~0#1.base, main_~tmp~0#1.offset := 0, 0; {3060#false} is VALID [2022-02-21 03:18:43,620 INFO L290 TraceCheckUtils]: 39: Hoare triple {3060#false} assume !(main_~users~0#1.base != 0 || main_~users~0#1.offset != 0); {3060#false} is VALID [2022-02-21 03:18:43,620 INFO L290 TraceCheckUtils]: 40: Hoare triple {3060#false} goto; {3060#false} is VALID [2022-02-21 03:18:43,620 INFO L290 TraceCheckUtils]: 41: Hoare triple {3060#false} goto; {3060#false} is VALID [2022-02-21 03:18:43,621 INFO L290 TraceCheckUtils]: 42: Hoare triple {3060#false} assume main_~tmp~0#1.base != 0 || main_~tmp~0#1.offset != 0; {3060#false} is VALID [2022-02-21 03:18:43,621 INFO L290 TraceCheckUtils]: 43: Hoare triple {3060#false} main_~_hd_hh_del~0#1.base, main_~_hd_hh_del~0#1.offset := main_~tmp~0#1.base, 8 + main_~tmp~0#1.offset;call main_#t~mem191#1.base, main_#t~mem191#1.offset := read~$Pointer$(main_~_hd_hh_del~0#1.base, 4 + main_~_hd_hh_del~0#1.offset, 4);main_#t~short193#1 := main_#t~mem191#1.base == 0 && main_#t~mem191#1.offset == 0; {3060#false} is VALID [2022-02-21 03:18:43,621 INFO L290 TraceCheckUtils]: 44: Hoare triple {3060#false} assume !main_#t~short193#1; {3060#false} is VALID [2022-02-21 03:18:43,621 INFO L290 TraceCheckUtils]: 45: Hoare triple {3060#false} assume main_#t~short193#1;havoc main_#t~mem191#1.base, main_#t~mem191#1.offset;havoc main_#t~mem192#1.base, main_#t~mem192#1.offset;havoc main_#t~short193#1;call main_#t~mem194#1.base, main_#t~mem194#1.offset := read~$Pointer$(main_~users~0#1.base, 8 + main_~users~0#1.offset, 4);call main_#t~mem195#1.base, main_#t~mem195#1.offset := read~$Pointer$(main_#t~mem194#1.base, main_#t~mem194#1.offset, 4);call ULTIMATE.dealloc(main_#t~mem195#1.base, main_#t~mem195#1.offset);havoc main_#t~mem194#1.base, main_#t~mem194#1.offset;havoc main_#t~mem195#1.base, main_#t~mem195#1.offset;call main_#t~mem196#1.base, main_#t~mem196#1.offset := read~$Pointer$(main_~users~0#1.base, 8 + main_~users~0#1.offset, 4);call ULTIMATE.dealloc(main_#t~mem196#1.base, main_#t~mem196#1.offset);havoc main_#t~mem196#1.base, main_#t~mem196#1.offset;main_~users~0#1.base, main_~users~0#1.offset := 0, 0; {3060#false} is VALID [2022-02-21 03:18:43,622 INFO L290 TraceCheckUtils]: 46: Hoare triple {3060#false} goto; {3060#false} is VALID [2022-02-21 03:18:43,622 INFO L290 TraceCheckUtils]: 47: Hoare triple {3060#false} call ULTIMATE.dealloc(main_~tmp~0#1.base, main_~tmp~0#1.offset);call main_#t~mem232#1.base, main_#t~mem232#1.offset := read~$Pointer$(main_~user~0#1.base, 8 + main_~user~0#1.offset, 4);call main_#t~mem233#1 := read~int(main_#t~mem232#1.base, 12 + main_#t~mem232#1.offset, 4); {3060#false} is VALID [2022-02-21 03:18:43,622 INFO L272 TraceCheckUtils]: 48: Hoare triple {3060#false} call test_int((if main_#t~mem233#1 % 4294967296 % 4294967296 <= 2147483647 then main_#t~mem233#1 % 4294967296 % 4294967296 else main_#t~mem233#1 % 4294967296 % 4294967296 - 4294967296)); {3060#false} is VALID [2022-02-21 03:18:43,622 INFO L290 TraceCheckUtils]: 49: Hoare triple {3060#false} ~a := #in~a;#t~post3 := ~count_int~0; {3060#false} is VALID [2022-02-21 03:18:43,623 INFO L290 TraceCheckUtils]: 50: Hoare triple {3060#false} assume !(1 + #t~post3 <= 2147483647); {3060#false} is VALID [2022-02-21 03:18:43,623 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:18:43,623 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 03:18:43,623 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1688532164] [2022-02-21 03:18:43,624 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1688532164] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-21 03:18:43,624 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-21 03:18:43,624 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-02-21 03:18:43,624 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1896598145] [2022-02-21 03:18:43,624 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-21 03:18:43,625 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.5) internal successors, (50), 4 states have internal predecessors, (50), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 51 [2022-02-21 03:18:43,625 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-21 03:18:43,626 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 12.5) internal successors, (50), 4 states have internal predecessors, (50), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:18:43,666 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 51 edges. 51 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:18:43,666 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-02-21 03:18:43,667 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 03:18:43,667 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-02-21 03:18:43,668 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-02-21 03:18:43,670 INFO L87 Difference]: Start difference. First operand 240 states and 326 transitions. Second operand has 4 states, 4 states have (on average 12.5) internal successors, (50), 4 states have internal predecessors, (50), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:18:44,840 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:18:44,840 INFO L93 Difference]: Finished difference Result 448 states and 615 transitions. [2022-02-21 03:18:44,840 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-02-21 03:18:44,841 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.5) internal successors, (50), 4 states have internal predecessors, (50), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 51 [2022-02-21 03:18:44,841 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-21 03:18:44,841 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 12.5) internal successors, (50), 4 states have internal predecessors, (50), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:18:44,849 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 615 transitions. [2022-02-21 03:18:44,849 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 12.5) internal successors, (50), 4 states have internal predecessors, (50), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:18:44,856 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 615 transitions. [2022-02-21 03:18:44,856 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 615 transitions. [2022-02-21 03:18:45,359 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 615 edges. 615 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:18:45,367 INFO L225 Difference]: With dead ends: 448 [2022-02-21 03:18:45,367 INFO L226 Difference]: Without dead ends: 319 [2022-02-21 03:18:45,368 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-02-21 03:18:45,369 INFO L933 BasicCegarLoop]: 300 mSDtfsCounter, 100 mSDsluCounter, 535 mSDsCounter, 0 mSdLazyCounter, 147 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 101 SdHoareTripleChecker+Valid, 835 SdHoareTripleChecker+Invalid, 150 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 147 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-02-21 03:18:45,369 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [101 Valid, 835 Invalid, 150 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 147 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-02-21 03:18:45,370 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 319 states. [2022-02-21 03:18:45,385 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 319 to 240. [2022-02-21 03:18:45,385 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 03:18:45,386 INFO L82 GeneralOperation]: Start isEquivalent. First operand 319 states. Second operand has 240 states, 209 states have (on average 1.3636363636363635) internal successors, (285), 231 states have internal predecessors, (285), 20 states have call successors, (20), 3 states have call predecessors, (20), 3 states have return successors, (20), 6 states have call predecessors, (20), 20 states have call successors, (20) [2022-02-21 03:18:45,387 INFO L74 IsIncluded]: Start isIncluded. First operand 319 states. Second operand has 240 states, 209 states have (on average 1.3636363636363635) internal successors, (285), 231 states have internal predecessors, (285), 20 states have call successors, (20), 3 states have call predecessors, (20), 3 states have return successors, (20), 6 states have call predecessors, (20), 20 states have call successors, (20) [2022-02-21 03:18:45,387 INFO L87 Difference]: Start difference. First operand 319 states. Second operand has 240 states, 209 states have (on average 1.3636363636363635) internal successors, (285), 231 states have internal predecessors, (285), 20 states have call successors, (20), 3 states have call predecessors, (20), 3 states have return successors, (20), 6 states have call predecessors, (20), 20 states have call successors, (20) [2022-02-21 03:18:45,399 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:18:45,399 INFO L93 Difference]: Finished difference Result 319 states and 429 transitions. [2022-02-21 03:18:45,399 INFO L276 IsEmpty]: Start isEmpty. Operand 319 states and 429 transitions. [2022-02-21 03:18:45,400 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:18:45,400 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:18:45,401 INFO L74 IsIncluded]: Start isIncluded. First operand has 240 states, 209 states have (on average 1.3636363636363635) internal successors, (285), 231 states have internal predecessors, (285), 20 states have call successors, (20), 3 states have call predecessors, (20), 3 states have return successors, (20), 6 states have call predecessors, (20), 20 states have call successors, (20) Second operand 319 states. [2022-02-21 03:18:45,402 INFO L87 Difference]: Start difference. First operand has 240 states, 209 states have (on average 1.3636363636363635) internal successors, (285), 231 states have internal predecessors, (285), 20 states have call successors, (20), 3 states have call predecessors, (20), 3 states have return successors, (20), 6 states have call predecessors, (20), 20 states have call successors, (20) Second operand 319 states. [2022-02-21 03:18:45,424 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:18:45,424 INFO L93 Difference]: Finished difference Result 319 states and 429 transitions. [2022-02-21 03:18:45,425 INFO L276 IsEmpty]: Start isEmpty. Operand 319 states and 429 transitions. [2022-02-21 03:18:45,425 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:18:45,425 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:18:45,426 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 03:18:45,426 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 03:18:45,428 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 240 states, 209 states have (on average 1.3636363636363635) internal successors, (285), 231 states have internal predecessors, (285), 20 states have call successors, (20), 3 states have call predecessors, (20), 3 states have return successors, (20), 6 states have call predecessors, (20), 20 states have call successors, (20) [2022-02-21 03:18:45,434 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 240 states to 240 states and 325 transitions. [2022-02-21 03:18:45,434 INFO L78 Accepts]: Start accepts. Automaton has 240 states and 325 transitions. Word has length 51 [2022-02-21 03:18:45,435 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-21 03:18:45,435 INFO L470 AbstractCegarLoop]: Abstraction has 240 states and 325 transitions. [2022-02-21 03:18:45,435 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.5) internal successors, (50), 4 states have internal predecessors, (50), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:18:45,435 INFO L276 IsEmpty]: Start isEmpty. Operand 240 states and 325 transitions. [2022-02-21 03:18:45,438 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2022-02-21 03:18:45,438 INFO L506 BasicCegarLoop]: Found error trace [2022-02-21 03:18:45,438 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] [2022-02-21 03:18:45,438 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-02-21 03:18:45,438 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting test_intErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [test_intErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, test_intErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2022-02-21 03:18:45,441 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:18:45,441 INFO L85 PathProgramCache]: Analyzing trace with hash 1684967237, now seen corresponding path program 1 times [2022-02-21 03:18:45,441 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:18:45,442 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1550736237] [2022-02-21 03:18:45,442 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:18:45,442 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:18:45,563 ERROR L252 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-02-21 03:18:45,563 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2104453320] [2022-02-21 03:18:45,563 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:18:45,563 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-21 03:18:45,564 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:18:45,565 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:18:45,603 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:18:46,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:18:46,042 INFO L263 TraceCheckSpWp]: Trace formula consists of 1557 conjuncts, 3 conjunts are in the unsatisfiable core [2022-02-21 03:18:46,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:18:46,086 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 03:18:46,224 INFO L290 TraceCheckUtils]: 0: Hoare triple {4545#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(21, 2);~count_int~0 := 0; {4545#true} is VALID [2022-02-21 03:18:46,224 INFO L290 TraceCheckUtils]: 1: Hoare triple {4545#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc8#1.base, main_#t~malloc8#1.offset, main_#t~mem9#1, main_#t~mem10#1, main_#t~mem11#1, main_#t~mem13#1, main_#t~mem12#1, main_#t~mem14#1, main_#t~mem15#1, main_#t~mem17#1, main_#t~mem16#1, main_#t~mem18#1, main_#t~mem19#1, main_#t~mem21#1, main_#t~mem20#1, main_#t~mem22#1, main_#t~mem23#1, main_#t~switch24#1, main_#t~mem25#1, main_#t~mem26#1, main_#t~mem27#1, main_#t~mem28#1, main_#t~mem29#1, main_#t~mem30#1, main_#t~mem31#1, main_#t~mem32#1, main_#t~mem33#1, main_#t~mem34#1, main_#t~mem35#1, main_~_hj_i~0#1, main_~_hj_j~0#1, main_~_hj_k~0#1, main_~_hj_key~0#1.base, main_~_hj_key~0#1.offset, main_#t~malloc36#1.base, main_#t~malloc36#1.offset, main_#t~mem37#1.base, main_#t~mem37#1.offset, main_#t~mem38#1.base, main_#t~mem38#1.offset, main_#t~memset~res39#1.base, main_#t~memset~res39#1.offset, main_#t~mem40#1.base, main_#t~mem40#1.offset, main_#t~mem41#1.base, main_#t~mem41#1.offset, main_#t~mem42#1.base, main_#t~mem42#1.offset, main_#t~mem43#1.base, main_#t~mem43#1.offset, main_#t~mem44#1.base, main_#t~mem44#1.offset, main_#t~malloc45#1.base, main_#t~malloc45#1.offset, main_#t~mem46#1.base, main_#t~mem46#1.offset, main_#t~mem47#1.base, main_#t~mem47#1.offset, main_#t~mem48#1.base, main_#t~mem48#1.offset, main_#t~mem49#1.base, main_#t~mem49#1.offset, main_#t~mem50#1.base, main_#t~mem50#1.offset, main_#t~mem51#1.base, main_#t~mem51#1.offset, main_#t~memset~res52#1.base, main_#t~memset~res52#1.offset, main_#t~mem53#1.base, main_#t~mem53#1.offset, main_#t~mem54#1.base, main_#t~mem54#1.offset, main_#t~mem55#1.base, main_#t~mem55#1.offset, main_#t~mem56#1.base, main_#t~mem56#1.offset, main_#t~mem57#1, main_#t~mem58#1.base, main_#t~mem58#1.offset, main_#t~mem59#1.base, main_#t~mem59#1.offset, main_#t~mem60#1.base, main_#t~mem60#1.offset, main_#t~mem61#1.base, main_#t~mem61#1.offset, main_#t~mem62#1, main_#t~post63#1, main_#t~mem64#1.base, main_#t~mem64#1.offset, main_#t~mem65#1, main_#t~mem66#1.base, main_#t~mem66#1.offset, main_#t~mem67#1.base, main_#t~mem67#1.offset, main_#t~mem68#1, main_#t~post69#1, main_#t~mem70#1.base, main_#t~mem70#1.offset, main_#t~mem71#1.base, main_#t~mem71#1.offset, main_#t~mem72#1.base, main_#t~mem72#1.offset, main_#t~mem74#1, main_#t~mem73#1, main_#t~mem75#1.base, main_#t~mem75#1.offset, main_#t~mem76#1, main_#t~short77#1, main_#t~mem78#1.base, main_#t~mem78#1.offset, main_#t~mem79#1, main_#t~malloc80#1.base, main_#t~malloc80#1.offset, main_#t~mem81#1.base, main_#t~mem81#1.offset, main_#t~mem82#1.base, main_#t~mem82#1.offset, main_#t~mem83#1.base, main_#t~mem83#1.offset, main_#t~mem84#1, main_#t~memset~res85#1.base, main_#t~memset~res85#1.offset, main_#t~mem86#1.base, main_#t~mem86#1.offset, main_#t~mem87#1.base, main_#t~mem87#1.offset, main_#t~mem90#1, main_#t~mem88#1.base, main_#t~mem88#1.offset, main_#t~mem89#1, main_#t~mem91#1.base, main_#t~mem91#1.offset, main_#t~mem94#1, main_#t~mem92#1.base, main_#t~mem92#1.offset, main_#t~mem93#1, main_#t~ite95#1, main_#t~mem96#1.base, main_#t~mem96#1.offset, main_#t~mem100#1.base, main_#t~mem100#1.offset, main_#t~mem101#1.base, main_#t~mem101#1.offset, main_#t~mem102#1.base, main_#t~mem102#1.offset, main_#t~mem103#1.base, main_#t~mem103#1.offset, main_#t~mem106#1, main_#t~mem104#1.base, main_#t~mem104#1.offset, main_#t~mem105#1, main_#t~mem107#1.base, main_#t~mem107#1.offset, main_#t~mem108#1, main_#t~pre109#1, main_#t~mem110#1.base, main_#t~mem110#1.offset, main_#t~mem111#1, main_#t~mem112#1.base, main_#t~mem112#1.offset, main_#t~mem113#1, main_#t~post114#1, main_#t~mem118#1, main_#t~mem116#1, main_#t~mem115#1.base, main_#t~mem115#1.offset, main_#t~mem117#1, main_#t~mem119#1, main_#t~post120#1, main_#t~mem121#1.base, main_#t~mem121#1.offset, main_#t~mem122#1.base, main_#t~mem122#1.offset, main_#t~mem123#1.base, main_#t~mem123#1.offset, main_#t~post97#1, main_#t~mem98#1.base, main_#t~mem98#1.offset, main_#t~mem99#1, main_#t~mem124#1.base, main_#t~mem124#1.offset, main_#t~mem125#1.base, main_#t~mem125#1.offset, main_#t~mem126#1.base, main_#t~mem126#1.offset, main_#t~mem127#1, main_#t~mem128#1.base, main_#t~mem128#1.offset, main_#t~mem129#1, main_#t~post130#1, main_#t~mem131#1.base, main_#t~mem131#1.offset, main_#t~mem132#1.base, main_#t~mem132#1.offset, main_#t~mem133#1.base, main_#t~mem133#1.offset, main_#t~mem134#1.base, main_#t~mem134#1.offset, main_#t~mem137#1, main_#t~mem135#1.base, main_#t~mem135#1.offset, main_#t~mem136#1, main_#t~ite140#1, main_#t~mem138#1.base, main_#t~mem138#1.offset, main_#t~mem139#1, main_#t~mem141#1.base, main_#t~mem141#1.offset, main_#t~mem142#1, main_#t~mem143#1.base, main_#t~mem143#1.offset, main_~_he_bkt~0#1, main_~_he_bkt_i~0#1, main_~_he_thh~0#1.base, main_~_he_thh~0#1.offset, main_~_he_hh_nxt~0#1.base, main_~_he_hh_nxt~0#1.offset, main_~#_he_new_buckets~0#1.base, main_~#_he_new_buckets~0#1.offset, main_~_he_newbkt~0#1.base, main_~_he_newbkt~0#1.offset, main_~_ha_head~0#1.base, main_~_ha_head~0#1.offset, main_~_ha_bkt~0#1, main_~_ha_hashv~0#1, main_#t~mem144#1.base, main_#t~mem144#1.offset, main_#t~mem145#1, main_#t~mem5#1, main_#t~post6#1, main_#t~mem7#1, main_#t~mem149#1, main_#t~mem148#1, main_#t~mem150#1, main_#t~mem151#1, main_#t~mem153#1, main_#t~mem152#1, main_#t~mem154#1, main_#t~mem155#1, main_#t~mem157#1, main_#t~mem156#1, main_#t~mem158#1, main_#t~mem159#1, main_#t~switch160#1, main_#t~mem161#1, main_#t~mem162#1, main_#t~mem163#1, main_#t~mem164#1, main_#t~mem165#1, main_#t~mem166#1, main_#t~mem167#1, main_#t~mem168#1, main_#t~mem169#1, main_#t~mem170#1, main_#t~mem171#1, main_~_hj_i~1#1, main_~_hj_j~1#1, main_~_hj_k~1#1, main_~_hj_key~1#1.base, main_~_hj_key~1#1.offset, main_#t~mem172#1.base, main_#t~mem172#1.offset, main_#t~mem173#1, main_#t~mem174#1.base, main_#t~mem174#1.offset, main_#t~mem175#1.base, main_#t~mem175#1.offset, main_#t~mem176#1.base, main_#t~mem176#1.offset, main_#t~mem177#1.base, main_#t~mem177#1.offset, main_#t~mem178#1.base, main_#t~mem178#1.offset, main_#t~mem179#1.base, main_#t~mem179#1.offset, main_#t~mem180#1.base, main_#t~mem180#1.offset, main_#t~mem181#1, main_#t~mem182#1, main_#t~mem183#1, main_#t~short184#1, main_#t~mem185#1.base, main_#t~mem185#1.offset, main_#t~ret186#1, main_#t~mem187#1.base, main_#t~mem187#1.offset, main_#t~mem188#1.base, main_#t~mem188#1.offset, main_#t~mem189#1.base, main_#t~mem189#1.offset, main_#t~mem190#1, main_~_hf_bkt~0#1, main_~_hf_hashv~0#1, main_#t~mem191#1.base, main_#t~mem191#1.offset, main_#t~mem192#1.base, main_#t~mem192#1.offset, main_#t~short193#1, main_#t~mem194#1.base, main_#t~mem194#1.offset, main_#t~mem195#1.base, main_#t~mem195#1.offset, main_#t~mem196#1.base, main_#t~mem196#1.offset, main_#t~mem197#1.base, main_#t~mem197#1.offset, main_#t~mem198#1.base, main_#t~mem198#1.offset, main_#t~mem199#1.base, main_#t~mem199#1.offset, main_#t~mem200#1.base, main_#t~mem200#1.offset, main_#t~mem201#1.base, main_#t~mem201#1.offset, main_#t~mem202#1, main_#t~mem203#1.base, main_#t~mem203#1.offset, main_#t~mem204#1.base, main_#t~mem204#1.offset, main_#t~mem205#1.base, main_#t~mem205#1.offset, main_#t~mem206#1, main_#t~mem207#1.base, main_#t~mem207#1.offset, main_#t~mem208#1.base, main_#t~mem208#1.offset, main_#t~mem209#1.base, main_#t~mem209#1.offset, main_#t~mem210#1.base, main_#t~mem210#1.offset, main_#t~mem211#1.base, main_#t~mem211#1.offset, main_#t~mem212#1, main_#t~mem213#1.base, main_#t~mem213#1.offset, main_#t~mem216#1, main_#t~mem214#1.base, main_#t~mem214#1.offset, main_#t~mem215#1, main_#t~mem217#1.base, main_#t~mem217#1.offset, main_#t~mem218#1.base, main_#t~mem218#1.offset, main_#t~mem219#1, main_#t~post220#1, main_#t~mem221#1.base, main_#t~mem221#1.offset, main_#t~mem222#1.base, main_#t~mem222#1.offset, main_#t~mem223#1.base, main_#t~mem223#1.offset, main_#t~mem224#1.base, main_#t~mem224#1.offset, main_#t~mem225#1.base, main_#t~mem225#1.offset, main_#t~mem226#1.base, main_#t~mem226#1.offset, main_#t~mem227#1.base, main_#t~mem227#1.offset, main_#t~mem228#1.base, main_#t~mem228#1.offset, main_~_hd_head~0#1.base, main_~_hd_head~0#1.offset, main_#t~mem229#1.base, main_#t~mem229#1.offset, main_#t~mem230#1, main_#t~post231#1, main_~_hd_bkt~0#1, main_~_hd_hh_del~0#1.base, main_~_hd_hh_del~0#1.offset, main_#t~mem232#1.base, main_#t~mem232#1.offset, main_#t~mem233#1, main_#t~mem146#1, main_#t~mem147#1, main_~#i~0#1.base, main_~#i~0#1.offset, main_~user~0#1.base, main_~user~0#1.offset, main_~tmp~0#1.base, main_~tmp~0#1.offset, main_~users~0#1.base, main_~users~0#1.offset;call main_~#i~0#1.base, main_~#i~0#1.offset := #Ultimate.allocOnStack(4);havoc main_~user~0#1.base, main_~user~0#1.offset;havoc main_~tmp~0#1.base, main_~tmp~0#1.offset;main_~users~0#1.base, main_~users~0#1.offset := 0, 0;call write~int(0, main_~#i~0#1.base, main_~#i~0#1.offset, 4); {4545#true} is VALID [2022-02-21 03:18:46,224 INFO L290 TraceCheckUtils]: 2: Hoare triple {4545#true} call main_#t~mem7#1 := read~int(main_~#i~0#1.base, main_~#i~0#1.offset, 4); {4545#true} is VALID [2022-02-21 03:18:46,225 INFO L290 TraceCheckUtils]: 3: Hoare triple {4545#true} assume !!(main_#t~mem7#1 < 10);havoc main_#t~mem7#1;call main_#t~malloc8#1.base, main_#t~malloc8#1.offset := #Ultimate.allocOnHeap(40);main_~user~0#1.base, main_~user~0#1.offset := main_#t~malloc8#1.base, main_#t~malloc8#1.offset;havoc main_#t~malloc8#1.base, main_#t~malloc8#1.offset; {4545#true} is VALID [2022-02-21 03:18:46,225 INFO L290 TraceCheckUtils]: 4: Hoare triple {4545#true} assume !(main_~user~0#1.base == 0 && main_~user~0#1.offset == 0); {4545#true} is VALID [2022-02-21 03:18:46,225 INFO L290 TraceCheckUtils]: 5: Hoare triple {4545#true} call main_#t~mem9#1 := read~int(main_~#i~0#1.base, main_~#i~0#1.offset, 4);call write~int(main_#t~mem9#1, main_~user~0#1.base, main_~user~0#1.offset, 4);havoc main_#t~mem9#1;call main_#t~mem10#1 := read~int(main_~#i~0#1.base, main_~#i~0#1.offset, 4);call main_#t~mem11#1 := read~int(main_~#i~0#1.base, main_~#i~0#1.offset, 4); {4545#true} is VALID [2022-02-21 03:18:46,225 INFO L290 TraceCheckUtils]: 6: Hoare triple {4545#true} assume main_#t~mem10#1 * main_#t~mem11#1 <= 2147483647; {4545#true} is VALID [2022-02-21 03:18:46,225 INFO L290 TraceCheckUtils]: 7: Hoare triple {4545#true} assume main_#t~mem10#1 * main_#t~mem11#1 >= -2147483648;call write~int(main_#t~mem10#1 * main_#t~mem11#1, main_~user~0#1.base, 4 + main_~user~0#1.offset, 4);havoc main_#t~mem10#1;havoc main_#t~mem11#1; {4545#true} is VALID [2022-02-21 03:18:46,226 INFO L290 TraceCheckUtils]: 8: Hoare triple {4545#true} havoc main_~_ha_hashv~0#1; {4545#true} is VALID [2022-02-21 03:18:46,226 INFO L290 TraceCheckUtils]: 9: Hoare triple {4545#true} goto; {4545#true} is VALID [2022-02-21 03:18:46,226 INFO L290 TraceCheckUtils]: 10: Hoare triple {4545#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; {4545#true} is VALID [2022-02-21 03:18:46,226 INFO L290 TraceCheckUtils]: 11: Hoare triple {4545#true} assume !(main_~_hj_k~0#1 % 4294967296 >= 12); {4545#true} is VALID [2022-02-21 03:18:46,226 INFO L290 TraceCheckUtils]: 12: Hoare triple {4545#true} main_~_ha_hashv~0#1 := 4 + main_~_ha_hashv~0#1;main_#t~switch24#1 := 11 == main_~_hj_k~0#1; {4545#true} is VALID [2022-02-21 03:18:46,231 INFO L290 TraceCheckUtils]: 13: Hoare triple {4545#true} assume main_#t~switch24#1;call main_#t~mem25#1 := read~int(main_~_hj_key~0#1.base, 10 + main_~_hj_key~0#1.offset, 1);main_~_ha_hashv~0#1 := main_~_ha_hashv~0#1 + 16777216 * (main_#t~mem25#1 % 256);havoc main_#t~mem25#1; {4589#|ULTIMATE.start_main_#t~switch24#1|} is VALID [2022-02-21 03:18:46,232 INFO L290 TraceCheckUtils]: 14: Hoare triple {4589#|ULTIMATE.start_main_#t~switch24#1|} main_#t~switch24#1 := main_#t~switch24#1 || 10 == main_~_hj_k~0#1; {4589#|ULTIMATE.start_main_#t~switch24#1|} is VALID [2022-02-21 03:18:46,232 INFO L290 TraceCheckUtils]: 15: Hoare triple {4589#|ULTIMATE.start_main_#t~switch24#1|} assume !main_#t~switch24#1; {4546#false} is VALID [2022-02-21 03:18:46,233 INFO L290 TraceCheckUtils]: 16: Hoare triple {4546#false} main_#t~switch24#1 := main_#t~switch24#1 || 9 == main_~_hj_k~0#1; {4546#false} is VALID [2022-02-21 03:18:46,233 INFO L290 TraceCheckUtils]: 17: Hoare triple {4546#false} assume main_#t~switch24#1;call main_#t~mem27#1 := read~int(main_~_hj_key~0#1.base, 8 + main_~_hj_key~0#1.offset, 1);main_~_ha_hashv~0#1 := main_~_ha_hashv~0#1 + 256 * (main_#t~mem27#1 % 256);havoc main_#t~mem27#1; {4546#false} is VALID [2022-02-21 03:18:46,233 INFO L290 TraceCheckUtils]: 18: Hoare triple {4546#false} main_#t~switch24#1 := main_#t~switch24#1 || 8 == main_~_hj_k~0#1; {4546#false} is VALID [2022-02-21 03:18:46,233 INFO L290 TraceCheckUtils]: 19: Hoare triple {4546#false} assume main_#t~switch24#1;call main_#t~mem28#1 := read~int(main_~_hj_key~0#1.base, 7 + main_~_hj_key~0#1.offset, 1);main_~_hj_j~0#1 := main_~_hj_j~0#1 + 16777216 * (main_#t~mem28#1 % 256);havoc main_#t~mem28#1; {4546#false} is VALID [2022-02-21 03:18:46,233 INFO L290 TraceCheckUtils]: 20: Hoare triple {4546#false} main_#t~switch24#1 := main_#t~switch24#1 || 7 == main_~_hj_k~0#1; {4546#false} is VALID [2022-02-21 03:18:46,234 INFO L290 TraceCheckUtils]: 21: Hoare triple {4546#false} assume main_#t~switch24#1;call main_#t~mem29#1 := read~int(main_~_hj_key~0#1.base, 6 + main_~_hj_key~0#1.offset, 1);main_~_hj_j~0#1 := main_~_hj_j~0#1 + 65536 * (main_#t~mem29#1 % 256);havoc main_#t~mem29#1; {4546#false} is VALID [2022-02-21 03:18:46,234 INFO L290 TraceCheckUtils]: 22: Hoare triple {4546#false} main_#t~switch24#1 := main_#t~switch24#1 || 6 == main_~_hj_k~0#1; {4546#false} is VALID [2022-02-21 03:18:46,234 INFO L290 TraceCheckUtils]: 23: Hoare triple {4546#false} assume main_#t~switch24#1;call main_#t~mem30#1 := read~int(main_~_hj_key~0#1.base, 5 + main_~_hj_key~0#1.offset, 1);main_~_hj_j~0#1 := main_~_hj_j~0#1 + 256 * (main_#t~mem30#1 % 256);havoc main_#t~mem30#1; {4546#false} is VALID [2022-02-21 03:18:46,234 INFO L290 TraceCheckUtils]: 24: Hoare triple {4546#false} main_#t~switch24#1 := main_#t~switch24#1 || 5 == main_~_hj_k~0#1; {4546#false} is VALID [2022-02-21 03:18:46,234 INFO L290 TraceCheckUtils]: 25: Hoare triple {4546#false} assume main_#t~switch24#1;call main_#t~mem31#1 := read~int(main_~_hj_key~0#1.base, 4 + main_~_hj_key~0#1.offset, 1);main_~_hj_j~0#1 := main_~_hj_j~0#1 + main_#t~mem31#1 % 256;havoc main_#t~mem31#1; {4546#false} is VALID [2022-02-21 03:18:46,235 INFO L290 TraceCheckUtils]: 26: Hoare triple {4546#false} main_#t~switch24#1 := main_#t~switch24#1 || 4 == main_~_hj_k~0#1; {4546#false} is VALID [2022-02-21 03:18:46,235 INFO L290 TraceCheckUtils]: 27: Hoare triple {4546#false} assume main_#t~switch24#1;call main_#t~mem32#1 := read~int(main_~_hj_key~0#1.base, 3 + main_~_hj_key~0#1.offset, 1);main_~_hj_i~0#1 := main_~_hj_i~0#1 + 16777216 * (main_#t~mem32#1 % 256);havoc main_#t~mem32#1; {4546#false} is VALID [2022-02-21 03:18:46,235 INFO L290 TraceCheckUtils]: 28: Hoare triple {4546#false} main_#t~switch24#1 := main_#t~switch24#1 || 3 == main_~_hj_k~0#1; {4546#false} is VALID [2022-02-21 03:18:46,235 INFO L290 TraceCheckUtils]: 29: Hoare triple {4546#false} assume main_#t~switch24#1;call main_#t~mem33#1 := read~int(main_~_hj_key~0#1.base, 2 + main_~_hj_key~0#1.offset, 1);main_~_hj_i~0#1 := main_~_hj_i~0#1 + 65536 * (main_#t~mem33#1 % 256);havoc main_#t~mem33#1; {4546#false} is VALID [2022-02-21 03:18:46,236 INFO L290 TraceCheckUtils]: 30: Hoare triple {4546#false} main_#t~switch24#1 := main_#t~switch24#1 || 2 == main_~_hj_k~0#1; {4546#false} is VALID [2022-02-21 03:18:46,236 INFO L290 TraceCheckUtils]: 31: Hoare triple {4546#false} assume main_#t~switch24#1;call main_#t~mem34#1 := read~int(main_~_hj_key~0#1.base, 1 + main_~_hj_key~0#1.offset, 1);main_~_hj_i~0#1 := main_~_hj_i~0#1 + 256 * (main_#t~mem34#1 % 256);havoc main_#t~mem34#1; {4546#false} is VALID [2022-02-21 03:18:46,236 INFO L290 TraceCheckUtils]: 32: Hoare triple {4546#false} main_#t~switch24#1 := main_#t~switch24#1 || 1 == main_~_hj_k~0#1; {4546#false} is VALID [2022-02-21 03:18:46,236 INFO L290 TraceCheckUtils]: 33: Hoare triple {4546#false} assume !main_#t~switch24#1; {4546#false} is VALID [2022-02-21 03:18:46,236 INFO L290 TraceCheckUtils]: 34: Hoare triple {4546#false} havoc main_#t~switch24#1; {4546#false} is VALID [2022-02-21 03:18:46,237 INFO L290 TraceCheckUtils]: 35: Hoare triple {4546#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)))); {4546#false} is VALID [2022-02-21 03:18:46,237 INFO L290 TraceCheckUtils]: 36: Hoare triple {4546#false} goto; {4546#false} is VALID [2022-02-21 03:18:46,237 INFO L290 TraceCheckUtils]: 37: Hoare triple {4546#false} goto; {4546#false} is VALID [2022-02-21 03:18:46,238 INFO L290 TraceCheckUtils]: 38: Hoare triple {4546#false} goto; {4546#false} is VALID [2022-02-21 03:18:46,238 INFO L290 TraceCheckUtils]: 39: Hoare triple {4546#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); {4546#false} is VALID [2022-02-21 03:18:46,238 INFO L290 TraceCheckUtils]: 40: Hoare triple {4546#false} assume !(main_~users~0#1.base == 0 && main_~users~0#1.offset == 0);call main_#t~mem53#1.base, main_#t~mem53#1.offset := read~$Pointer$(main_~users~0#1.base, 8 + main_~users~0#1.offset, 4);call write~$Pointer$(main_#t~mem53#1.base, main_#t~mem53#1.offset, main_~user~0#1.base, 8 + main_~user~0#1.offset, 4);havoc main_#t~mem53#1.base, main_#t~mem53#1.offset; {4546#false} is VALID [2022-02-21 03:18:46,238 INFO L290 TraceCheckUtils]: 41: Hoare triple {4546#false} call write~$Pointer$(0, 0, main_~user~0#1.base, 16 + main_~user~0#1.offset, 4);call main_#t~mem54#1.base, main_#t~mem54#1.offset := read~$Pointer$(main_~users~0#1.base, 8 + main_~users~0#1.offset, 4);call main_#t~mem55#1.base, main_#t~mem55#1.offset := read~$Pointer$(main_#t~mem54#1.base, 16 + main_#t~mem54#1.offset, 4);call main_#t~mem56#1.base, main_#t~mem56#1.offset := read~$Pointer$(main_~users~0#1.base, 8 + main_~users~0#1.offset, 4);call main_#t~mem57#1 := read~int(main_#t~mem56#1.base, 20 + main_#t~mem56#1.offset, 4);call write~$Pointer$(main_#t~mem55#1.base, main_#t~mem55#1.offset - main_#t~mem57#1, main_~user~0#1.base, 12 + main_~user~0#1.offset, 4);havoc main_#t~mem54#1.base, main_#t~mem54#1.offset;havoc main_#t~mem55#1.base, main_#t~mem55#1.offset;havoc main_#t~mem56#1.base, main_#t~mem56#1.offset;havoc main_#t~mem57#1;call main_#t~mem58#1.base, main_#t~mem58#1.offset := read~$Pointer$(main_~users~0#1.base, 8 + main_~users~0#1.offset, 4);call main_#t~mem59#1.base, main_#t~mem59#1.offset := read~$Pointer$(main_#t~mem58#1.base, 16 + main_#t~mem58#1.offset, 4);call write~$Pointer$(main_~user~0#1.base, main_~user~0#1.offset, main_#t~mem59#1.base, 8 + main_#t~mem59#1.offset, 4);havoc main_#t~mem58#1.base, main_#t~mem58#1.offset;havoc main_#t~mem59#1.base, main_#t~mem59#1.offset;call main_#t~mem60#1.base, main_#t~mem60#1.offset := read~$Pointer$(main_~users~0#1.base, 8 + main_~users~0#1.offset, 4);call write~$Pointer$(main_~user~0#1.base, 8 + main_~user~0#1.offset, main_#t~mem60#1.base, 16 + main_#t~mem60#1.offset, 4);havoc main_#t~mem60#1.base, main_#t~mem60#1.offset; {4546#false} is VALID [2022-02-21 03:18:46,239 INFO L290 TraceCheckUtils]: 42: Hoare triple {4546#false} goto; {4546#false} is VALID [2022-02-21 03:18:46,239 INFO L290 TraceCheckUtils]: 43: Hoare triple {4546#false} havoc main_~_ha_bkt~0#1;call main_#t~mem61#1.base, main_#t~mem61#1.offset := read~$Pointer$(main_~users~0#1.base, 8 + main_~users~0#1.offset, 4);call main_#t~mem62#1 := read~int(main_#t~mem61#1.base, 12 + main_#t~mem61#1.offset, 4);main_#t~post63#1 := main_#t~mem62#1;call write~int(1 + main_#t~post63#1, main_#t~mem61#1.base, 12 + main_#t~mem61#1.offset, 4);havoc main_#t~mem61#1.base, main_#t~mem61#1.offset;havoc main_#t~mem62#1;havoc main_#t~post63#1; {4546#false} is VALID [2022-02-21 03:18:46,239 INFO L290 TraceCheckUtils]: 44: Hoare triple {4546#false} call main_#t~mem64#1.base, main_#t~mem64#1.offset := read~$Pointer$(main_~users~0#1.base, 8 + main_~users~0#1.offset, 4);call main_#t~mem65#1 := read~int(main_#t~mem64#1.base, 4 + main_#t~mem64#1.offset, 4);main_~_ha_bkt~0#1 := (if 0 == main_~_ha_hashv~0#1 || 0 == main_#t~mem65#1 - 1 then 0 else (if 1 == main_#t~mem65#1 - 1 then (if 1 == main_~_ha_hashv~0#1 || 0 == main_~_ha_hashv~0#1 then main_~_ha_hashv~0#1 else (if main_~_ha_hashv~0#1 >= 0 then main_~_ha_hashv~0#1 % 2 else ~bitwiseAnd(main_~_ha_hashv~0#1, main_#t~mem65#1 - 1))) else (if 1 == main_~_ha_hashv~0#1 then (if 1 == main_#t~mem65#1 - 1 || 0 == main_#t~mem65#1 - 1 then main_#t~mem65#1 - 1 else (if main_#t~mem65#1 - 1 >= 0 then (main_#t~mem65#1 - 1) % 2 else ~bitwiseAnd(main_~_ha_hashv~0#1, main_#t~mem65#1 - 1))) else ~bitwiseAnd(main_~_ha_hashv~0#1, main_#t~mem65#1 - 1))));havoc main_#t~mem64#1.base, main_#t~mem64#1.offset;havoc main_#t~mem65#1; {4546#false} is VALID [2022-02-21 03:18:46,239 INFO L290 TraceCheckUtils]: 45: Hoare triple {4546#false} goto; {4546#false} is VALID [2022-02-21 03:18:46,240 INFO L290 TraceCheckUtils]: 46: Hoare triple {4546#false} call main_#t~mem66#1.base, main_#t~mem66#1.offset := read~$Pointer$(main_~users~0#1.base, 8 + main_~users~0#1.offset, 4);call main_#t~mem67#1.base, main_#t~mem67#1.offset := read~$Pointer$(main_#t~mem66#1.base, main_#t~mem66#1.offset, 4);main_~_ha_head~0#1.base, main_~_ha_head~0#1.offset := main_#t~mem67#1.base, main_#t~mem67#1.offset + 12 * (if main_~_ha_bkt~0#1 % 4294967296 % 4294967296 <= 2147483647 then main_~_ha_bkt~0#1 % 4294967296 % 4294967296 else main_~_ha_bkt~0#1 % 4294967296 % 4294967296 - 4294967296);havoc main_#t~mem66#1.base, main_#t~mem66#1.offset;havoc main_#t~mem67#1.base, main_#t~mem67#1.offset;call main_#t~mem68#1 := read~int(main_~_ha_head~0#1.base, 4 + main_~_ha_head~0#1.offset, 4);main_#t~post69#1 := main_#t~mem68#1;call write~int(1 + main_#t~post69#1, main_~_ha_head~0#1.base, 4 + main_~_ha_head~0#1.offset, 4);havoc main_#t~mem68#1;havoc main_#t~post69#1;call main_#t~mem70#1.base, main_#t~mem70#1.offset := read~$Pointer$(main_~_ha_head~0#1.base, main_~_ha_head~0#1.offset, 4);call write~$Pointer$(main_#t~mem70#1.base, main_#t~mem70#1.offset, main_~user~0#1.base, 24 + main_~user~0#1.offset, 4);havoc main_#t~mem70#1.base, main_#t~mem70#1.offset;call write~$Pointer$(0, 0, main_~user~0#1.base, 20 + main_~user~0#1.offset, 4);call main_#t~mem71#1.base, main_#t~mem71#1.offset := read~$Pointer$(main_~_ha_head~0#1.base, main_~_ha_head~0#1.offset, 4); {4546#false} is VALID [2022-02-21 03:18:46,240 INFO L290 TraceCheckUtils]: 47: Hoare triple {4546#false} assume main_#t~mem71#1.base != 0 || main_#t~mem71#1.offset != 0;havoc main_#t~mem71#1.base, main_#t~mem71#1.offset;call main_#t~mem72#1.base, main_#t~mem72#1.offset := read~$Pointer$(main_~_ha_head~0#1.base, main_~_ha_head~0#1.offset, 4);call write~$Pointer$(main_~user~0#1.base, 8 + main_~user~0#1.offset, main_#t~mem72#1.base, 12 + main_#t~mem72#1.offset, 4);havoc main_#t~mem72#1.base, main_#t~mem72#1.offset; {4546#false} is VALID [2022-02-21 03:18:46,240 INFO L290 TraceCheckUtils]: 48: Hoare triple {4546#false} call write~$Pointer$(main_~user~0#1.base, 8 + main_~user~0#1.offset, main_~_ha_head~0#1.base, main_~_ha_head~0#1.offset, 4);call main_#t~mem74#1 := read~int(main_~_ha_head~0#1.base, 4 + main_~_ha_head~0#1.offset, 4);call main_#t~mem73#1 := read~int(main_~_ha_head~0#1.base, 8 + main_~_ha_head~0#1.offset, 4);main_#t~short77#1 := main_#t~mem74#1 % 4294967296 >= 10 * (1 + main_#t~mem73#1) % 4294967296; {4546#false} is VALID [2022-02-21 03:18:46,240 INFO L290 TraceCheckUtils]: 49: Hoare triple {4546#false} assume main_#t~short77#1;call main_#t~mem75#1.base, main_#t~mem75#1.offset := read~$Pointer$(main_~user~0#1.base, 8 + main_~user~0#1.offset, 4);call main_#t~mem76#1 := read~int(main_#t~mem75#1.base, 36 + main_#t~mem75#1.offset, 4);main_#t~short77#1 := 0 == main_#t~mem76#1 % 4294967296; {4546#false} is VALID [2022-02-21 03:18:46,241 INFO L290 TraceCheckUtils]: 50: Hoare triple {4546#false} assume !main_#t~short77#1;havoc main_#t~mem74#1;havoc main_#t~mem73#1;havoc main_#t~mem75#1.base, main_#t~mem75#1.offset;havoc main_#t~mem76#1;havoc main_#t~short77#1; {4546#false} is VALID [2022-02-21 03:18:46,241 INFO L290 TraceCheckUtils]: 51: Hoare triple {4546#false} goto; {4546#false} is VALID [2022-02-21 03:18:46,241 INFO L290 TraceCheckUtils]: 52: Hoare triple {4546#false} goto; {4546#false} is VALID [2022-02-21 03:18:46,241 INFO L290 TraceCheckUtils]: 53: Hoare triple {4546#false} goto; {4546#false} is VALID [2022-02-21 03:18:46,241 INFO L290 TraceCheckUtils]: 54: Hoare triple {4546#false} goto; {4546#false} is VALID [2022-02-21 03:18:46,242 INFO L290 TraceCheckUtils]: 55: Hoare triple {4546#false} call main_#t~mem144#1.base, main_#t~mem144#1.offset := read~$Pointer$(main_~user~0#1.base, 8 + main_~user~0#1.offset, 4);call main_#t~mem145#1 := read~int(main_#t~mem144#1.base, 12 + main_#t~mem144#1.offset, 4); {4546#false} is VALID [2022-02-21 03:18:46,242 INFO L272 TraceCheckUtils]: 56: Hoare triple {4546#false} call test_int((if main_#t~mem145#1 % 4294967296 % 4294967296 <= 2147483647 then main_#t~mem145#1 % 4294967296 % 4294967296 else main_#t~mem145#1 % 4294967296 % 4294967296 - 4294967296)); {4546#false} is VALID [2022-02-21 03:18:46,242 INFO L290 TraceCheckUtils]: 57: Hoare triple {4546#false} ~a := #in~a;#t~post3 := ~count_int~0; {4546#false} is VALID [2022-02-21 03:18:46,242 INFO L290 TraceCheckUtils]: 58: Hoare triple {4546#false} assume !(1 + #t~post3 <= 2147483647); {4546#false} is VALID [2022-02-21 03:18:46,243 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:18:46,243 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-21 03:18:46,243 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 03:18:46,243 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1550736237] [2022-02-21 03:18:46,243 WARN L317 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-02-21 03:18:46,244 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2104453320] [2022-02-21 03:18:46,244 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2104453320] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-21 03:18:46,244 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-21 03:18:46,244 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-21 03:18:46,244 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [470007513] [2022-02-21 03:18:46,244 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-21 03:18:46,245 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 19.333333333333332) internal successors, (58), 3 states have internal predecessors, (58), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 59 [2022-02-21 03:18:46,245 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-21 03:18:46,246 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 19.333333333333332) internal successors, (58), 3 states have internal predecessors, (58), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:18:46,299 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 59 edges. 59 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:18:46,299 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-21 03:18:46,299 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 03:18:46,299 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-21 03:18:46,300 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-21 03:18:46,300 INFO L87 Difference]: Start difference. First operand 240 states and 325 transitions. Second operand has 3 states, 3 states have (on average 19.333333333333332) internal successors, (58), 3 states have internal predecessors, (58), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:18:46,933 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:18:46,933 INFO L93 Difference]: Finished difference Result 493 states and 673 transitions. [2022-02-21 03:18:46,933 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-21 03:18:46,934 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 19.333333333333332) internal successors, (58), 3 states have internal predecessors, (58), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 59 [2022-02-21 03:18:46,934 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-21 03:18:46,934 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 19.333333333333332) internal successors, (58), 3 states have internal predecessors, (58), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:18:46,940 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 667 transitions. [2022-02-21 03:18:46,940 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 19.333333333333332) internal successors, (58), 3 states have internal predecessors, (58), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:18:46,945 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 667 transitions. [2022-02-21 03:18:46,945 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 667 transitions. [2022-02-21 03:18:47,473 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 667 edges. 667 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:18:47,479 INFO L225 Difference]: With dead ends: 493 [2022-02-21 03:18:47,479 INFO L226 Difference]: Without dead ends: 261 [2022-02-21 03:18:47,480 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 57 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:18:47,481 INFO L933 BasicCegarLoop]: 299 mSDtfsCounter, 10 mSDsluCounter, 284 mSDsCounter, 0 mSdLazyCounter, 44 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 583 SdHoareTripleChecker+Invalid, 72 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 44 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-21 03:18:47,481 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [10 Valid, 583 Invalid, 72 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 44 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-21 03:18:47,482 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 261 states. [2022-02-21 03:18:47,497 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 261 to 260. [2022-02-21 03:18:47,497 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 03:18:47,498 INFO L82 GeneralOperation]: Start isEquivalent. First operand 261 states. Second operand has 260 states, 229 states have (on average 1.331877729257642) internal successors, (305), 251 states have internal predecessors, (305), 20 states have call successors, (20), 3 states have call predecessors, (20), 3 states have return successors, (20), 6 states have call predecessors, (20), 20 states have call successors, (20) [2022-02-21 03:18:47,499 INFO L74 IsIncluded]: Start isIncluded. First operand 261 states. Second operand has 260 states, 229 states have (on average 1.331877729257642) internal successors, (305), 251 states have internal predecessors, (305), 20 states have call successors, (20), 3 states have call predecessors, (20), 3 states have return successors, (20), 6 states have call predecessors, (20), 20 states have call successors, (20) [2022-02-21 03:18:47,499 INFO L87 Difference]: Start difference. First operand 261 states. Second operand has 260 states, 229 states have (on average 1.331877729257642) internal successors, (305), 251 states have internal predecessors, (305), 20 states have call successors, (20), 3 states have call predecessors, (20), 3 states have return successors, (20), 6 states have call predecessors, (20), 20 states have call successors, (20) [2022-02-21 03:18:47,507 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:18:47,507 INFO L93 Difference]: Finished difference Result 261 states and 346 transitions. [2022-02-21 03:18:47,507 INFO L276 IsEmpty]: Start isEmpty. Operand 261 states and 346 transitions. [2022-02-21 03:18:47,508 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:18:47,508 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:18:47,509 INFO L74 IsIncluded]: Start isIncluded. First operand has 260 states, 229 states have (on average 1.331877729257642) internal successors, (305), 251 states have internal predecessors, (305), 20 states have call successors, (20), 3 states have call predecessors, (20), 3 states have return successors, (20), 6 states have call predecessors, (20), 20 states have call successors, (20) Second operand 261 states. [2022-02-21 03:18:47,510 INFO L87 Difference]: Start difference. First operand has 260 states, 229 states have (on average 1.331877729257642) internal successors, (305), 251 states have internal predecessors, (305), 20 states have call successors, (20), 3 states have call predecessors, (20), 3 states have return successors, (20), 6 states have call predecessors, (20), 20 states have call successors, (20) Second operand 261 states. [2022-02-21 03:18:47,517 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:18:47,517 INFO L93 Difference]: Finished difference Result 261 states and 346 transitions. [2022-02-21 03:18:47,517 INFO L276 IsEmpty]: Start isEmpty. Operand 261 states and 346 transitions. [2022-02-21 03:18:47,518 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:18:47,518 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:18:47,518 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 03:18:47,518 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 03:18:47,519 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 260 states, 229 states have (on average 1.331877729257642) internal successors, (305), 251 states have internal predecessors, (305), 20 states have call successors, (20), 3 states have call predecessors, (20), 3 states have return successors, (20), 6 states have call predecessors, (20), 20 states have call successors, (20) [2022-02-21 03:18:47,526 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 260 states to 260 states and 345 transitions. [2022-02-21 03:18:47,526 INFO L78 Accepts]: Start accepts. Automaton has 260 states and 345 transitions. Word has length 59 [2022-02-21 03:18:47,526 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-21 03:18:47,527 INFO L470 AbstractCegarLoop]: Abstraction has 260 states and 345 transitions. [2022-02-21 03:18:47,527 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 19.333333333333332) internal successors, (58), 3 states have internal predecessors, (58), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:18:47,527 INFO L276 IsEmpty]: Start isEmpty. Operand 260 states and 345 transitions. [2022-02-21 03:18:47,528 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2022-02-21 03:18:47,528 INFO L506 BasicCegarLoop]: Found error trace [2022-02-21 03:18:47,528 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] [2022-02-21 03:18:47,559 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:18:47,751 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable3 [2022-02-21 03:18:47,752 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting test_intErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [test_intErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, test_intErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2022-02-21 03:18:47,752 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:18:47,753 INFO L85 PathProgramCache]: Analyzing trace with hash -622651831, now seen corresponding path program 1 times [2022-02-21 03:18:47,753 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:18:47,753 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1168128088] [2022-02-21 03:18:47,753 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:18:47,753 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:18:47,888 ERROR L252 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-02-21 03:18:47,890 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [458012750] [2022-02-21 03:18:47,890 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:18:47,893 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-21 03:18:47,894 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:18:47,896 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:18:47,898 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:18:48,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:18:48,430 INFO L263 TraceCheckSpWp]: Trace formula consists of 1561 conjuncts, 3 conjunts are in the unsatisfiable core [2022-02-21 03:18:48,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:18:48,485 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 03:18:48,636 INFO L290 TraceCheckUtils]: 0: Hoare triple {6157#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(21, 2);~count_int~0 := 0; {6157#true} is VALID [2022-02-21 03:18:48,639 INFO L290 TraceCheckUtils]: 1: Hoare triple {6157#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc8#1.base, main_#t~malloc8#1.offset, main_#t~mem9#1, main_#t~mem10#1, main_#t~mem11#1, main_#t~mem13#1, main_#t~mem12#1, main_#t~mem14#1, main_#t~mem15#1, main_#t~mem17#1, main_#t~mem16#1, main_#t~mem18#1, main_#t~mem19#1, main_#t~mem21#1, main_#t~mem20#1, main_#t~mem22#1, main_#t~mem23#1, main_#t~switch24#1, main_#t~mem25#1, main_#t~mem26#1, main_#t~mem27#1, main_#t~mem28#1, main_#t~mem29#1, main_#t~mem30#1, main_#t~mem31#1, main_#t~mem32#1, main_#t~mem33#1, main_#t~mem34#1, main_#t~mem35#1, main_~_hj_i~0#1, main_~_hj_j~0#1, main_~_hj_k~0#1, main_~_hj_key~0#1.base, main_~_hj_key~0#1.offset, main_#t~malloc36#1.base, main_#t~malloc36#1.offset, main_#t~mem37#1.base, main_#t~mem37#1.offset, main_#t~mem38#1.base, main_#t~mem38#1.offset, main_#t~memset~res39#1.base, main_#t~memset~res39#1.offset, main_#t~mem40#1.base, main_#t~mem40#1.offset, main_#t~mem41#1.base, main_#t~mem41#1.offset, main_#t~mem42#1.base, main_#t~mem42#1.offset, main_#t~mem43#1.base, main_#t~mem43#1.offset, main_#t~mem44#1.base, main_#t~mem44#1.offset, main_#t~malloc45#1.base, main_#t~malloc45#1.offset, main_#t~mem46#1.base, main_#t~mem46#1.offset, main_#t~mem47#1.base, main_#t~mem47#1.offset, main_#t~mem48#1.base, main_#t~mem48#1.offset, main_#t~mem49#1.base, main_#t~mem49#1.offset, main_#t~mem50#1.base, main_#t~mem50#1.offset, main_#t~mem51#1.base, main_#t~mem51#1.offset, main_#t~memset~res52#1.base, main_#t~memset~res52#1.offset, main_#t~mem53#1.base, main_#t~mem53#1.offset, main_#t~mem54#1.base, main_#t~mem54#1.offset, main_#t~mem55#1.base, main_#t~mem55#1.offset, main_#t~mem56#1.base, main_#t~mem56#1.offset, main_#t~mem57#1, main_#t~mem58#1.base, main_#t~mem58#1.offset, main_#t~mem59#1.base, main_#t~mem59#1.offset, main_#t~mem60#1.base, main_#t~mem60#1.offset, main_#t~mem61#1.base, main_#t~mem61#1.offset, main_#t~mem62#1, main_#t~post63#1, main_#t~mem64#1.base, main_#t~mem64#1.offset, main_#t~mem65#1, main_#t~mem66#1.base, main_#t~mem66#1.offset, main_#t~mem67#1.base, main_#t~mem67#1.offset, main_#t~mem68#1, main_#t~post69#1, main_#t~mem70#1.base, main_#t~mem70#1.offset, main_#t~mem71#1.base, main_#t~mem71#1.offset, main_#t~mem72#1.base, main_#t~mem72#1.offset, main_#t~mem74#1, main_#t~mem73#1, main_#t~mem75#1.base, main_#t~mem75#1.offset, main_#t~mem76#1, main_#t~short77#1, main_#t~mem78#1.base, main_#t~mem78#1.offset, main_#t~mem79#1, main_#t~malloc80#1.base, main_#t~malloc80#1.offset, main_#t~mem81#1.base, main_#t~mem81#1.offset, main_#t~mem82#1.base, main_#t~mem82#1.offset, main_#t~mem83#1.base, main_#t~mem83#1.offset, main_#t~mem84#1, main_#t~memset~res85#1.base, main_#t~memset~res85#1.offset, main_#t~mem86#1.base, main_#t~mem86#1.offset, main_#t~mem87#1.base, main_#t~mem87#1.offset, main_#t~mem90#1, main_#t~mem88#1.base, main_#t~mem88#1.offset, main_#t~mem89#1, main_#t~mem91#1.base, main_#t~mem91#1.offset, main_#t~mem94#1, main_#t~mem92#1.base, main_#t~mem92#1.offset, main_#t~mem93#1, main_#t~ite95#1, main_#t~mem96#1.base, main_#t~mem96#1.offset, main_#t~mem100#1.base, main_#t~mem100#1.offset, main_#t~mem101#1.base, main_#t~mem101#1.offset, main_#t~mem102#1.base, main_#t~mem102#1.offset, main_#t~mem103#1.base, main_#t~mem103#1.offset, main_#t~mem106#1, main_#t~mem104#1.base, main_#t~mem104#1.offset, main_#t~mem105#1, main_#t~mem107#1.base, main_#t~mem107#1.offset, main_#t~mem108#1, main_#t~pre109#1, main_#t~mem110#1.base, main_#t~mem110#1.offset, main_#t~mem111#1, main_#t~mem112#1.base, main_#t~mem112#1.offset, main_#t~mem113#1, main_#t~post114#1, main_#t~mem118#1, main_#t~mem116#1, main_#t~mem115#1.base, main_#t~mem115#1.offset, main_#t~mem117#1, main_#t~mem119#1, main_#t~post120#1, main_#t~mem121#1.base, main_#t~mem121#1.offset, main_#t~mem122#1.base, main_#t~mem122#1.offset, main_#t~mem123#1.base, main_#t~mem123#1.offset, main_#t~post97#1, main_#t~mem98#1.base, main_#t~mem98#1.offset, main_#t~mem99#1, main_#t~mem124#1.base, main_#t~mem124#1.offset, main_#t~mem125#1.base, main_#t~mem125#1.offset, main_#t~mem126#1.base, main_#t~mem126#1.offset, main_#t~mem127#1, main_#t~mem128#1.base, main_#t~mem128#1.offset, main_#t~mem129#1, main_#t~post130#1, main_#t~mem131#1.base, main_#t~mem131#1.offset, main_#t~mem132#1.base, main_#t~mem132#1.offset, main_#t~mem133#1.base, main_#t~mem133#1.offset, main_#t~mem134#1.base, main_#t~mem134#1.offset, main_#t~mem137#1, main_#t~mem135#1.base, main_#t~mem135#1.offset, main_#t~mem136#1, main_#t~ite140#1, main_#t~mem138#1.base, main_#t~mem138#1.offset, main_#t~mem139#1, main_#t~mem141#1.base, main_#t~mem141#1.offset, main_#t~mem142#1, main_#t~mem143#1.base, main_#t~mem143#1.offset, main_~_he_bkt~0#1, main_~_he_bkt_i~0#1, main_~_he_thh~0#1.base, main_~_he_thh~0#1.offset, main_~_he_hh_nxt~0#1.base, main_~_he_hh_nxt~0#1.offset, main_~#_he_new_buckets~0#1.base, main_~#_he_new_buckets~0#1.offset, main_~_he_newbkt~0#1.base, main_~_he_newbkt~0#1.offset, main_~_ha_head~0#1.base, main_~_ha_head~0#1.offset, main_~_ha_bkt~0#1, main_~_ha_hashv~0#1, main_#t~mem144#1.base, main_#t~mem144#1.offset, main_#t~mem145#1, main_#t~mem5#1, main_#t~post6#1, main_#t~mem7#1, main_#t~mem149#1, main_#t~mem148#1, main_#t~mem150#1, main_#t~mem151#1, main_#t~mem153#1, main_#t~mem152#1, main_#t~mem154#1, main_#t~mem155#1, main_#t~mem157#1, main_#t~mem156#1, main_#t~mem158#1, main_#t~mem159#1, main_#t~switch160#1, main_#t~mem161#1, main_#t~mem162#1, main_#t~mem163#1, main_#t~mem164#1, main_#t~mem165#1, main_#t~mem166#1, main_#t~mem167#1, main_#t~mem168#1, main_#t~mem169#1, main_#t~mem170#1, main_#t~mem171#1, main_~_hj_i~1#1, main_~_hj_j~1#1, main_~_hj_k~1#1, main_~_hj_key~1#1.base, main_~_hj_key~1#1.offset, main_#t~mem172#1.base, main_#t~mem172#1.offset, main_#t~mem173#1, main_#t~mem174#1.base, main_#t~mem174#1.offset, main_#t~mem175#1.base, main_#t~mem175#1.offset, main_#t~mem176#1.base, main_#t~mem176#1.offset, main_#t~mem177#1.base, main_#t~mem177#1.offset, main_#t~mem178#1.base, main_#t~mem178#1.offset, main_#t~mem179#1.base, main_#t~mem179#1.offset, main_#t~mem180#1.base, main_#t~mem180#1.offset, main_#t~mem181#1, main_#t~mem182#1, main_#t~mem183#1, main_#t~short184#1, main_#t~mem185#1.base, main_#t~mem185#1.offset, main_#t~ret186#1, main_#t~mem187#1.base, main_#t~mem187#1.offset, main_#t~mem188#1.base, main_#t~mem188#1.offset, main_#t~mem189#1.base, main_#t~mem189#1.offset, main_#t~mem190#1, main_~_hf_bkt~0#1, main_~_hf_hashv~0#1, main_#t~mem191#1.base, main_#t~mem191#1.offset, main_#t~mem192#1.base, main_#t~mem192#1.offset, main_#t~short193#1, main_#t~mem194#1.base, main_#t~mem194#1.offset, main_#t~mem195#1.base, main_#t~mem195#1.offset, main_#t~mem196#1.base, main_#t~mem196#1.offset, main_#t~mem197#1.base, main_#t~mem197#1.offset, main_#t~mem198#1.base, main_#t~mem198#1.offset, main_#t~mem199#1.base, main_#t~mem199#1.offset, main_#t~mem200#1.base, main_#t~mem200#1.offset, main_#t~mem201#1.base, main_#t~mem201#1.offset, main_#t~mem202#1, main_#t~mem203#1.base, main_#t~mem203#1.offset, main_#t~mem204#1.base, main_#t~mem204#1.offset, main_#t~mem205#1.base, main_#t~mem205#1.offset, main_#t~mem206#1, main_#t~mem207#1.base, main_#t~mem207#1.offset, main_#t~mem208#1.base, main_#t~mem208#1.offset, main_#t~mem209#1.base, main_#t~mem209#1.offset, main_#t~mem210#1.base, main_#t~mem210#1.offset, main_#t~mem211#1.base, main_#t~mem211#1.offset, main_#t~mem212#1, main_#t~mem213#1.base, main_#t~mem213#1.offset, main_#t~mem216#1, main_#t~mem214#1.base, main_#t~mem214#1.offset, main_#t~mem215#1, main_#t~mem217#1.base, main_#t~mem217#1.offset, main_#t~mem218#1.base, main_#t~mem218#1.offset, main_#t~mem219#1, main_#t~post220#1, main_#t~mem221#1.base, main_#t~mem221#1.offset, main_#t~mem222#1.base, main_#t~mem222#1.offset, main_#t~mem223#1.base, main_#t~mem223#1.offset, main_#t~mem224#1.base, main_#t~mem224#1.offset, main_#t~mem225#1.base, main_#t~mem225#1.offset, main_#t~mem226#1.base, main_#t~mem226#1.offset, main_#t~mem227#1.base, main_#t~mem227#1.offset, main_#t~mem228#1.base, main_#t~mem228#1.offset, main_~_hd_head~0#1.base, main_~_hd_head~0#1.offset, main_#t~mem229#1.base, main_#t~mem229#1.offset, main_#t~mem230#1, main_#t~post231#1, main_~_hd_bkt~0#1, main_~_hd_hh_del~0#1.base, main_~_hd_hh_del~0#1.offset, main_#t~mem232#1.base, main_#t~mem232#1.offset, main_#t~mem233#1, main_#t~mem146#1, main_#t~mem147#1, main_~#i~0#1.base, main_~#i~0#1.offset, main_~user~0#1.base, main_~user~0#1.offset, main_~tmp~0#1.base, main_~tmp~0#1.offset, main_~users~0#1.base, main_~users~0#1.offset;call main_~#i~0#1.base, main_~#i~0#1.offset := #Ultimate.allocOnStack(4);havoc main_~user~0#1.base, main_~user~0#1.offset;havoc main_~tmp~0#1.base, main_~tmp~0#1.offset;main_~users~0#1.base, main_~users~0#1.offset := 0, 0;call write~int(0, main_~#i~0#1.base, main_~#i~0#1.offset, 4); {6157#true} is VALID [2022-02-21 03:18:48,639 INFO L290 TraceCheckUtils]: 2: Hoare triple {6157#true} call main_#t~mem7#1 := read~int(main_~#i~0#1.base, main_~#i~0#1.offset, 4); {6157#true} is VALID [2022-02-21 03:18:48,639 INFO L290 TraceCheckUtils]: 3: Hoare triple {6157#true} assume !!(main_#t~mem7#1 < 10);havoc main_#t~mem7#1;call main_#t~malloc8#1.base, main_#t~malloc8#1.offset := #Ultimate.allocOnHeap(40);main_~user~0#1.base, main_~user~0#1.offset := main_#t~malloc8#1.base, main_#t~malloc8#1.offset;havoc main_#t~malloc8#1.base, main_#t~malloc8#1.offset; {6157#true} is VALID [2022-02-21 03:18:48,639 INFO L290 TraceCheckUtils]: 4: Hoare triple {6157#true} assume !(main_~user~0#1.base == 0 && main_~user~0#1.offset == 0); {6157#true} is VALID [2022-02-21 03:18:48,639 INFO L290 TraceCheckUtils]: 5: Hoare triple {6157#true} call main_#t~mem9#1 := read~int(main_~#i~0#1.base, main_~#i~0#1.offset, 4);call write~int(main_#t~mem9#1, main_~user~0#1.base, main_~user~0#1.offset, 4);havoc main_#t~mem9#1;call main_#t~mem10#1 := read~int(main_~#i~0#1.base, main_~#i~0#1.offset, 4);call main_#t~mem11#1 := read~int(main_~#i~0#1.base, main_~#i~0#1.offset, 4); {6157#true} is VALID [2022-02-21 03:18:48,640 INFO L290 TraceCheckUtils]: 6: Hoare triple {6157#true} assume main_#t~mem10#1 * main_#t~mem11#1 <= 2147483647; {6157#true} is VALID [2022-02-21 03:18:48,640 INFO L290 TraceCheckUtils]: 7: Hoare triple {6157#true} assume main_#t~mem10#1 * main_#t~mem11#1 >= -2147483648;call write~int(main_#t~mem10#1 * main_#t~mem11#1, main_~user~0#1.base, 4 + main_~user~0#1.offset, 4);havoc main_#t~mem10#1;havoc main_#t~mem11#1; {6157#true} is VALID [2022-02-21 03:18:48,640 INFO L290 TraceCheckUtils]: 8: Hoare triple {6157#true} havoc main_~_ha_hashv~0#1; {6157#true} is VALID [2022-02-21 03:18:48,640 INFO L290 TraceCheckUtils]: 9: Hoare triple {6157#true} goto; {6157#true} is VALID [2022-02-21 03:18:48,642 INFO L290 TraceCheckUtils]: 10: Hoare triple {6157#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; {6192#(<= |ULTIMATE.start_main_~_hj_k~0#1| 4)} is VALID [2022-02-21 03:18:48,643 INFO L290 TraceCheckUtils]: 11: Hoare triple {6192#(<= |ULTIMATE.start_main_~_hj_k~0#1| 4)} assume !(main_~_hj_k~0#1 % 4294967296 >= 12); {6192#(<= |ULTIMATE.start_main_~_hj_k~0#1| 4)} is VALID [2022-02-21 03:18:48,643 INFO L290 TraceCheckUtils]: 12: Hoare triple {6192#(<= |ULTIMATE.start_main_~_hj_k~0#1| 4)} main_~_ha_hashv~0#1 := 4 + main_~_ha_hashv~0#1;main_#t~switch24#1 := 11 == main_~_hj_k~0#1; {6199#(not |ULTIMATE.start_main_#t~switch24#1|)} is VALID [2022-02-21 03:18:48,644 INFO L290 TraceCheckUtils]: 13: Hoare triple {6199#(not |ULTIMATE.start_main_#t~switch24#1|)} assume main_#t~switch24#1;call main_#t~mem25#1 := read~int(main_~_hj_key~0#1.base, 10 + main_~_hj_key~0#1.offset, 1);main_~_ha_hashv~0#1 := main_~_ha_hashv~0#1 + 16777216 * (main_#t~mem25#1 % 256);havoc main_#t~mem25#1; {6158#false} is VALID [2022-02-21 03:18:48,644 INFO L290 TraceCheckUtils]: 14: Hoare triple {6158#false} main_#t~switch24#1 := main_#t~switch24#1 || 10 == main_~_hj_k~0#1; {6158#false} is VALID [2022-02-21 03:18:48,644 INFO L290 TraceCheckUtils]: 15: Hoare triple {6158#false} assume main_#t~switch24#1;call main_#t~mem26#1 := read~int(main_~_hj_key~0#1.base, 9 + main_~_hj_key~0#1.offset, 1);main_~_ha_hashv~0#1 := main_~_ha_hashv~0#1 + 65536 * (main_#t~mem26#1 % 256);havoc main_#t~mem26#1; {6158#false} is VALID [2022-02-21 03:18:48,644 INFO L290 TraceCheckUtils]: 16: Hoare triple {6158#false} main_#t~switch24#1 := main_#t~switch24#1 || 9 == main_~_hj_k~0#1; {6158#false} is VALID [2022-02-21 03:18:48,644 INFO L290 TraceCheckUtils]: 17: Hoare triple {6158#false} assume main_#t~switch24#1;call main_#t~mem27#1 := read~int(main_~_hj_key~0#1.base, 8 + main_~_hj_key~0#1.offset, 1);main_~_ha_hashv~0#1 := main_~_ha_hashv~0#1 + 256 * (main_#t~mem27#1 % 256);havoc main_#t~mem27#1; {6158#false} is VALID [2022-02-21 03:18:48,645 INFO L290 TraceCheckUtils]: 18: Hoare triple {6158#false} main_#t~switch24#1 := main_#t~switch24#1 || 8 == main_~_hj_k~0#1; {6158#false} is VALID [2022-02-21 03:18:48,645 INFO L290 TraceCheckUtils]: 19: Hoare triple {6158#false} assume main_#t~switch24#1;call main_#t~mem28#1 := read~int(main_~_hj_key~0#1.base, 7 + main_~_hj_key~0#1.offset, 1);main_~_hj_j~0#1 := main_~_hj_j~0#1 + 16777216 * (main_#t~mem28#1 % 256);havoc main_#t~mem28#1; {6158#false} is VALID [2022-02-21 03:18:48,645 INFO L290 TraceCheckUtils]: 20: Hoare triple {6158#false} main_#t~switch24#1 := main_#t~switch24#1 || 7 == main_~_hj_k~0#1; {6158#false} is VALID [2022-02-21 03:18:48,645 INFO L290 TraceCheckUtils]: 21: Hoare triple {6158#false} assume main_#t~switch24#1;call main_#t~mem29#1 := read~int(main_~_hj_key~0#1.base, 6 + main_~_hj_key~0#1.offset, 1);main_~_hj_j~0#1 := main_~_hj_j~0#1 + 65536 * (main_#t~mem29#1 % 256);havoc main_#t~mem29#1; {6158#false} is VALID [2022-02-21 03:18:48,645 INFO L290 TraceCheckUtils]: 22: Hoare triple {6158#false} main_#t~switch24#1 := main_#t~switch24#1 || 6 == main_~_hj_k~0#1; {6158#false} is VALID [2022-02-21 03:18:48,645 INFO L290 TraceCheckUtils]: 23: Hoare triple {6158#false} assume main_#t~switch24#1;call main_#t~mem30#1 := read~int(main_~_hj_key~0#1.base, 5 + main_~_hj_key~0#1.offset, 1);main_~_hj_j~0#1 := main_~_hj_j~0#1 + 256 * (main_#t~mem30#1 % 256);havoc main_#t~mem30#1; {6158#false} is VALID [2022-02-21 03:18:48,646 INFO L290 TraceCheckUtils]: 24: Hoare triple {6158#false} main_#t~switch24#1 := main_#t~switch24#1 || 5 == main_~_hj_k~0#1; {6158#false} is VALID [2022-02-21 03:18:48,646 INFO L290 TraceCheckUtils]: 25: Hoare triple {6158#false} assume main_#t~switch24#1;call main_#t~mem31#1 := read~int(main_~_hj_key~0#1.base, 4 + main_~_hj_key~0#1.offset, 1);main_~_hj_j~0#1 := main_~_hj_j~0#1 + main_#t~mem31#1 % 256;havoc main_#t~mem31#1; {6158#false} is VALID [2022-02-21 03:18:48,646 INFO L290 TraceCheckUtils]: 26: Hoare triple {6158#false} main_#t~switch24#1 := main_#t~switch24#1 || 4 == main_~_hj_k~0#1; {6158#false} is VALID [2022-02-21 03:18:48,646 INFO L290 TraceCheckUtils]: 27: Hoare triple {6158#false} assume main_#t~switch24#1;call main_#t~mem32#1 := read~int(main_~_hj_key~0#1.base, 3 + main_~_hj_key~0#1.offset, 1);main_~_hj_i~0#1 := main_~_hj_i~0#1 + 16777216 * (main_#t~mem32#1 % 256);havoc main_#t~mem32#1; {6158#false} is VALID [2022-02-21 03:18:48,646 INFO L290 TraceCheckUtils]: 28: Hoare triple {6158#false} main_#t~switch24#1 := main_#t~switch24#1 || 3 == main_~_hj_k~0#1; {6158#false} is VALID [2022-02-21 03:18:48,647 INFO L290 TraceCheckUtils]: 29: Hoare triple {6158#false} assume main_#t~switch24#1;call main_#t~mem33#1 := read~int(main_~_hj_key~0#1.base, 2 + main_~_hj_key~0#1.offset, 1);main_~_hj_i~0#1 := main_~_hj_i~0#1 + 65536 * (main_#t~mem33#1 % 256);havoc main_#t~mem33#1; {6158#false} is VALID [2022-02-21 03:18:48,647 INFO L290 TraceCheckUtils]: 30: Hoare triple {6158#false} main_#t~switch24#1 := main_#t~switch24#1 || 2 == main_~_hj_k~0#1; {6158#false} is VALID [2022-02-21 03:18:48,647 INFO L290 TraceCheckUtils]: 31: Hoare triple {6158#false} assume main_#t~switch24#1;call main_#t~mem34#1 := read~int(main_~_hj_key~0#1.base, 1 + main_~_hj_key~0#1.offset, 1);main_~_hj_i~0#1 := main_~_hj_i~0#1 + 256 * (main_#t~mem34#1 % 256);havoc main_#t~mem34#1; {6158#false} is VALID [2022-02-21 03:18:48,647 INFO L290 TraceCheckUtils]: 32: Hoare triple {6158#false} main_#t~switch24#1 := main_#t~switch24#1 || 1 == main_~_hj_k~0#1; {6158#false} is VALID [2022-02-21 03:18:48,647 INFO L290 TraceCheckUtils]: 33: Hoare triple {6158#false} assume main_#t~switch24#1;call main_#t~mem35#1 := read~int(main_~_hj_key~0#1.base, main_~_hj_key~0#1.offset, 1);main_~_hj_i~0#1 := main_~_hj_i~0#1 + main_#t~mem35#1 % 256;havoc main_#t~mem35#1; {6158#false} is VALID [2022-02-21 03:18:48,648 INFO L290 TraceCheckUtils]: 34: Hoare triple {6158#false} havoc main_#t~switch24#1; {6158#false} is VALID [2022-02-21 03:18:48,648 INFO L290 TraceCheckUtils]: 35: Hoare triple {6158#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)))); {6158#false} is VALID [2022-02-21 03:18:48,648 INFO L290 TraceCheckUtils]: 36: Hoare triple {6158#false} goto; {6158#false} is VALID [2022-02-21 03:18:48,648 INFO L290 TraceCheckUtils]: 37: Hoare triple {6158#false} goto; {6158#false} is VALID [2022-02-21 03:18:48,648 INFO L290 TraceCheckUtils]: 38: Hoare triple {6158#false} goto; {6158#false} is VALID [2022-02-21 03:18:48,649 INFO L290 TraceCheckUtils]: 39: Hoare triple {6158#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); {6158#false} is VALID [2022-02-21 03:18:48,649 INFO L290 TraceCheckUtils]: 40: Hoare triple {6158#false} assume !(main_~users~0#1.base == 0 && main_~users~0#1.offset == 0);call main_#t~mem53#1.base, main_#t~mem53#1.offset := read~$Pointer$(main_~users~0#1.base, 8 + main_~users~0#1.offset, 4);call write~$Pointer$(main_#t~mem53#1.base, main_#t~mem53#1.offset, main_~user~0#1.base, 8 + main_~user~0#1.offset, 4);havoc main_#t~mem53#1.base, main_#t~mem53#1.offset; {6158#false} is VALID [2022-02-21 03:18:48,649 INFO L290 TraceCheckUtils]: 41: Hoare triple {6158#false} call write~$Pointer$(0, 0, main_~user~0#1.base, 16 + main_~user~0#1.offset, 4);call main_#t~mem54#1.base, main_#t~mem54#1.offset := read~$Pointer$(main_~users~0#1.base, 8 + main_~users~0#1.offset, 4);call main_#t~mem55#1.base, main_#t~mem55#1.offset := read~$Pointer$(main_#t~mem54#1.base, 16 + main_#t~mem54#1.offset, 4);call main_#t~mem56#1.base, main_#t~mem56#1.offset := read~$Pointer$(main_~users~0#1.base, 8 + main_~users~0#1.offset, 4);call main_#t~mem57#1 := read~int(main_#t~mem56#1.base, 20 + main_#t~mem56#1.offset, 4);call write~$Pointer$(main_#t~mem55#1.base, main_#t~mem55#1.offset - main_#t~mem57#1, main_~user~0#1.base, 12 + main_~user~0#1.offset, 4);havoc main_#t~mem54#1.base, main_#t~mem54#1.offset;havoc main_#t~mem55#1.base, main_#t~mem55#1.offset;havoc main_#t~mem56#1.base, main_#t~mem56#1.offset;havoc main_#t~mem57#1;call main_#t~mem58#1.base, main_#t~mem58#1.offset := read~$Pointer$(main_~users~0#1.base, 8 + main_~users~0#1.offset, 4);call main_#t~mem59#1.base, main_#t~mem59#1.offset := read~$Pointer$(main_#t~mem58#1.base, 16 + main_#t~mem58#1.offset, 4);call write~$Pointer$(main_~user~0#1.base, main_~user~0#1.offset, main_#t~mem59#1.base, 8 + main_#t~mem59#1.offset, 4);havoc main_#t~mem58#1.base, main_#t~mem58#1.offset;havoc main_#t~mem59#1.base, main_#t~mem59#1.offset;call main_#t~mem60#1.base, main_#t~mem60#1.offset := read~$Pointer$(main_~users~0#1.base, 8 + main_~users~0#1.offset, 4);call write~$Pointer$(main_~user~0#1.base, 8 + main_~user~0#1.offset, main_#t~mem60#1.base, 16 + main_#t~mem60#1.offset, 4);havoc main_#t~mem60#1.base, main_#t~mem60#1.offset; {6158#false} is VALID [2022-02-21 03:18:48,649 INFO L290 TraceCheckUtils]: 42: Hoare triple {6158#false} goto; {6158#false} is VALID [2022-02-21 03:18:48,649 INFO L290 TraceCheckUtils]: 43: Hoare triple {6158#false} havoc main_~_ha_bkt~0#1;call main_#t~mem61#1.base, main_#t~mem61#1.offset := read~$Pointer$(main_~users~0#1.base, 8 + main_~users~0#1.offset, 4);call main_#t~mem62#1 := read~int(main_#t~mem61#1.base, 12 + main_#t~mem61#1.offset, 4);main_#t~post63#1 := main_#t~mem62#1;call write~int(1 + main_#t~post63#1, main_#t~mem61#1.base, 12 + main_#t~mem61#1.offset, 4);havoc main_#t~mem61#1.base, main_#t~mem61#1.offset;havoc main_#t~mem62#1;havoc main_#t~post63#1; {6158#false} is VALID [2022-02-21 03:18:48,650 INFO L290 TraceCheckUtils]: 44: Hoare triple {6158#false} call main_#t~mem64#1.base, main_#t~mem64#1.offset := read~$Pointer$(main_~users~0#1.base, 8 + main_~users~0#1.offset, 4);call main_#t~mem65#1 := read~int(main_#t~mem64#1.base, 4 + main_#t~mem64#1.offset, 4);main_~_ha_bkt~0#1 := (if 0 == main_~_ha_hashv~0#1 || 0 == main_#t~mem65#1 - 1 then 0 else (if 1 == main_#t~mem65#1 - 1 then (if 1 == main_~_ha_hashv~0#1 || 0 == main_~_ha_hashv~0#1 then main_~_ha_hashv~0#1 else (if main_~_ha_hashv~0#1 >= 0 then main_~_ha_hashv~0#1 % 2 else ~bitwiseAnd(main_~_ha_hashv~0#1, main_#t~mem65#1 - 1))) else (if 1 == main_~_ha_hashv~0#1 then (if 1 == main_#t~mem65#1 - 1 || 0 == main_#t~mem65#1 - 1 then main_#t~mem65#1 - 1 else (if main_#t~mem65#1 - 1 >= 0 then (main_#t~mem65#1 - 1) % 2 else ~bitwiseAnd(main_~_ha_hashv~0#1, main_#t~mem65#1 - 1))) else ~bitwiseAnd(main_~_ha_hashv~0#1, main_#t~mem65#1 - 1))));havoc main_#t~mem64#1.base, main_#t~mem64#1.offset;havoc main_#t~mem65#1; {6158#false} is VALID [2022-02-21 03:18:48,650 INFO L290 TraceCheckUtils]: 45: Hoare triple {6158#false} goto; {6158#false} is VALID [2022-02-21 03:18:48,650 INFO L290 TraceCheckUtils]: 46: Hoare triple {6158#false} call main_#t~mem66#1.base, main_#t~mem66#1.offset := read~$Pointer$(main_~users~0#1.base, 8 + main_~users~0#1.offset, 4);call main_#t~mem67#1.base, main_#t~mem67#1.offset := read~$Pointer$(main_#t~mem66#1.base, main_#t~mem66#1.offset, 4);main_~_ha_head~0#1.base, main_~_ha_head~0#1.offset := main_#t~mem67#1.base, main_#t~mem67#1.offset + 12 * (if main_~_ha_bkt~0#1 % 4294967296 % 4294967296 <= 2147483647 then main_~_ha_bkt~0#1 % 4294967296 % 4294967296 else main_~_ha_bkt~0#1 % 4294967296 % 4294967296 - 4294967296);havoc main_#t~mem66#1.base, main_#t~mem66#1.offset;havoc main_#t~mem67#1.base, main_#t~mem67#1.offset;call main_#t~mem68#1 := read~int(main_~_ha_head~0#1.base, 4 + main_~_ha_head~0#1.offset, 4);main_#t~post69#1 := main_#t~mem68#1;call write~int(1 + main_#t~post69#1, main_~_ha_head~0#1.base, 4 + main_~_ha_head~0#1.offset, 4);havoc main_#t~mem68#1;havoc main_#t~post69#1;call main_#t~mem70#1.base, main_#t~mem70#1.offset := read~$Pointer$(main_~_ha_head~0#1.base, main_~_ha_head~0#1.offset, 4);call write~$Pointer$(main_#t~mem70#1.base, main_#t~mem70#1.offset, main_~user~0#1.base, 24 + main_~user~0#1.offset, 4);havoc main_#t~mem70#1.base, main_#t~mem70#1.offset;call write~$Pointer$(0, 0, main_~user~0#1.base, 20 + main_~user~0#1.offset, 4);call main_#t~mem71#1.base, main_#t~mem71#1.offset := read~$Pointer$(main_~_ha_head~0#1.base, main_~_ha_head~0#1.offset, 4); {6158#false} is VALID [2022-02-21 03:18:48,650 INFO L290 TraceCheckUtils]: 47: Hoare triple {6158#false} assume main_#t~mem71#1.base != 0 || main_#t~mem71#1.offset != 0;havoc main_#t~mem71#1.base, main_#t~mem71#1.offset;call main_#t~mem72#1.base, main_#t~mem72#1.offset := read~$Pointer$(main_~_ha_head~0#1.base, main_~_ha_head~0#1.offset, 4);call write~$Pointer$(main_~user~0#1.base, 8 + main_~user~0#1.offset, main_#t~mem72#1.base, 12 + main_#t~mem72#1.offset, 4);havoc main_#t~mem72#1.base, main_#t~mem72#1.offset; {6158#false} is VALID [2022-02-21 03:18:48,650 INFO L290 TraceCheckUtils]: 48: Hoare triple {6158#false} call write~$Pointer$(main_~user~0#1.base, 8 + main_~user~0#1.offset, main_~_ha_head~0#1.base, main_~_ha_head~0#1.offset, 4);call main_#t~mem74#1 := read~int(main_~_ha_head~0#1.base, 4 + main_~_ha_head~0#1.offset, 4);call main_#t~mem73#1 := read~int(main_~_ha_head~0#1.base, 8 + main_~_ha_head~0#1.offset, 4);main_#t~short77#1 := main_#t~mem74#1 % 4294967296 >= 10 * (1 + main_#t~mem73#1) % 4294967296; {6158#false} is VALID [2022-02-21 03:18:48,651 INFO L290 TraceCheckUtils]: 49: Hoare triple {6158#false} assume main_#t~short77#1;call main_#t~mem75#1.base, main_#t~mem75#1.offset := read~$Pointer$(main_~user~0#1.base, 8 + main_~user~0#1.offset, 4);call main_#t~mem76#1 := read~int(main_#t~mem75#1.base, 36 + main_#t~mem75#1.offset, 4);main_#t~short77#1 := 0 == main_#t~mem76#1 % 4294967296; {6158#false} is VALID [2022-02-21 03:18:48,651 INFO L290 TraceCheckUtils]: 50: Hoare triple {6158#false} assume !main_#t~short77#1;havoc main_#t~mem74#1;havoc main_#t~mem73#1;havoc main_#t~mem75#1.base, main_#t~mem75#1.offset;havoc main_#t~mem76#1;havoc main_#t~short77#1; {6158#false} is VALID [2022-02-21 03:18:48,651 INFO L290 TraceCheckUtils]: 51: Hoare triple {6158#false} goto; {6158#false} is VALID [2022-02-21 03:18:48,651 INFO L290 TraceCheckUtils]: 52: Hoare triple {6158#false} goto; {6158#false} is VALID [2022-02-21 03:18:48,651 INFO L290 TraceCheckUtils]: 53: Hoare triple {6158#false} goto; {6158#false} is VALID [2022-02-21 03:18:48,651 INFO L290 TraceCheckUtils]: 54: Hoare triple {6158#false} goto; {6158#false} is VALID [2022-02-21 03:18:48,652 INFO L290 TraceCheckUtils]: 55: Hoare triple {6158#false} call main_#t~mem144#1.base, main_#t~mem144#1.offset := read~$Pointer$(main_~user~0#1.base, 8 + main_~user~0#1.offset, 4);call main_#t~mem145#1 := read~int(main_#t~mem144#1.base, 12 + main_#t~mem144#1.offset, 4); {6158#false} is VALID [2022-02-21 03:18:48,652 INFO L272 TraceCheckUtils]: 56: Hoare triple {6158#false} call test_int((if main_#t~mem145#1 % 4294967296 % 4294967296 <= 2147483647 then main_#t~mem145#1 % 4294967296 % 4294967296 else main_#t~mem145#1 % 4294967296 % 4294967296 - 4294967296)); {6158#false} is VALID [2022-02-21 03:18:48,652 INFO L290 TraceCheckUtils]: 57: Hoare triple {6158#false} ~a := #in~a;#t~post3 := ~count_int~0; {6158#false} is VALID [2022-02-21 03:18:48,652 INFO L290 TraceCheckUtils]: 58: Hoare triple {6158#false} assume !(1 + #t~post3 <= 2147483647); {6158#false} is VALID [2022-02-21 03:18:48,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:18:48,653 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-21 03:18:48,653 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 03:18:48,653 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1168128088] [2022-02-21 03:18:48,653 WARN L317 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-02-21 03:18:48,653 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [458012750] [2022-02-21 03:18:48,653 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [458012750] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-21 03:18:48,654 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-21 03:18:48,654 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-02-21 03:18:48,654 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1499726681] [2022-02-21 03:18:48,654 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-21 03:18:48,655 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 14.5) internal successors, (58), 4 states have internal predecessors, (58), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 59 [2022-02-21 03:18:48,655 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-21 03:18:48,655 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 14.5) internal successors, (58), 4 states have internal predecessors, (58), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:18:48,765 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 59 edges. 59 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:18:48,766 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-02-21 03:18:48,766 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 03:18:48,766 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-02-21 03:18:48,766 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-02-21 03:18:48,766 INFO L87 Difference]: Start difference. First operand 260 states and 345 transitions. Second operand has 4 states, 4 states have (on average 14.5) internal successors, (58), 4 states have internal predecessors, (58), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:18:49,780 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:18:49,780 INFO L93 Difference]: Finished difference Result 502 states and 672 transitions. [2022-02-21 03:18:49,780 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-02-21 03:18:49,780 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 14.5) internal successors, (58), 4 states have internal predecessors, (58), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 59 [2022-02-21 03:18:49,781 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-21 03:18:49,781 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 14.5) internal successors, (58), 4 states have internal predecessors, (58), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:18:49,786 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 649 transitions. [2022-02-21 03:18:49,786 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 14.5) internal successors, (58), 4 states have internal predecessors, (58), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:18:49,791 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 649 transitions. [2022-02-21 03:18:49,791 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 649 transitions. [2022-02-21 03:18:50,413 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 649 edges. 649 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:18:50,419 INFO L225 Difference]: With dead ends: 502 [2022-02-21 03:18:50,420 INFO L226 Difference]: Without dead ends: 250 [2022-02-21 03:18:50,420 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 56 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:18:50,421 INFO L933 BasicCegarLoop]: 301 mSDtfsCounter, 223 mSDsluCounter, 378 mSDsCounter, 0 mSdLazyCounter, 42 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 228 SdHoareTripleChecker+Valid, 679 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.1s IncrementalHoareTripleChecker+Time [2022-02-21 03:18:50,421 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [228 Valid, 679 Invalid, 66 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 42 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-21 03:18:50,422 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 250 states. [2022-02-21 03:18:50,459 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 250 to 246. [2022-02-21 03:18:50,460 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 03:18:50,460 INFO L82 GeneralOperation]: Start isEquivalent. First operand 250 states. Second operand has 246 states, 215 states have (on average 1.3209302325581396) internal successors, (284), 237 states have internal predecessors, (284), 20 states have call successors, (20), 3 states have call predecessors, (20), 3 states have return successors, (20), 6 states have call predecessors, (20), 20 states have call successors, (20) [2022-02-21 03:18:50,461 INFO L74 IsIncluded]: Start isIncluded. First operand 250 states. Second operand has 246 states, 215 states have (on average 1.3209302325581396) internal successors, (284), 237 states have internal predecessors, (284), 20 states have call successors, (20), 3 states have call predecessors, (20), 3 states have return successors, (20), 6 states have call predecessors, (20), 20 states have call successors, (20) [2022-02-21 03:18:50,462 INFO L87 Difference]: Start difference. First operand 250 states. Second operand has 246 states, 215 states have (on average 1.3209302325581396) internal successors, (284), 237 states have internal predecessors, (284), 20 states have call successors, (20), 3 states have call predecessors, (20), 3 states have return successors, (20), 6 states have call predecessors, (20), 20 states have call successors, (20) [2022-02-21 03:18:50,468 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:18:50,468 INFO L93 Difference]: Finished difference Result 250 states and 328 transitions. [2022-02-21 03:18:50,468 INFO L276 IsEmpty]: Start isEmpty. Operand 250 states and 328 transitions. [2022-02-21 03:18:50,469 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:18:50,469 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:18:50,470 INFO L74 IsIncluded]: Start isIncluded. First operand has 246 states, 215 states have (on average 1.3209302325581396) internal successors, (284), 237 states have internal predecessors, (284), 20 states have call successors, (20), 3 states have call predecessors, (20), 3 states have return successors, (20), 6 states have call predecessors, (20), 20 states have call successors, (20) Second operand 250 states. [2022-02-21 03:18:50,470 INFO L87 Difference]: Start difference. First operand has 246 states, 215 states have (on average 1.3209302325581396) internal successors, (284), 237 states have internal predecessors, (284), 20 states have call successors, (20), 3 states have call predecessors, (20), 3 states have return successors, (20), 6 states have call predecessors, (20), 20 states have call successors, (20) Second operand 250 states. [2022-02-21 03:18:50,477 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:18:50,477 INFO L93 Difference]: Finished difference Result 250 states and 328 transitions. [2022-02-21 03:18:50,477 INFO L276 IsEmpty]: Start isEmpty. Operand 250 states and 328 transitions. [2022-02-21 03:18:50,478 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:18:50,478 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:18:50,478 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 03:18:50,478 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 03:18:50,479 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 246 states, 215 states have (on average 1.3209302325581396) internal successors, (284), 237 states have internal predecessors, (284), 20 states have call successors, (20), 3 states have call predecessors, (20), 3 states have return successors, (20), 6 states have call predecessors, (20), 20 states have call successors, (20) [2022-02-21 03:18:50,484 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 246 states to 246 states and 324 transitions. [2022-02-21 03:18:50,485 INFO L78 Accepts]: Start accepts. Automaton has 246 states and 324 transitions. Word has length 59 [2022-02-21 03:18:50,485 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-21 03:18:50,485 INFO L470 AbstractCegarLoop]: Abstraction has 246 states and 324 transitions. [2022-02-21 03:18:50,485 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.5) internal successors, (58), 4 states have internal predecessors, (58), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:18:50,486 INFO L276 IsEmpty]: Start isEmpty. Operand 246 states and 324 transitions. [2022-02-21 03:18:50,487 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2022-02-21 03:18:50,487 INFO L506 BasicCegarLoop]: Found error trace [2022-02-21 03:18:50,487 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] [2022-02-21 03:18:50,521 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:18:50,711 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-21 03:18:50,712 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting test_intErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [test_intErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, test_intErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2022-02-21 03:18:50,712 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:18:50,712 INFO L85 PathProgramCache]: Analyzing trace with hash -1240169861, now seen corresponding path program 1 times [2022-02-21 03:18:50,712 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:18:50,712 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [279716656] [2022-02-21 03:18:50,712 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:18:50,713 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:18:50,817 ERROR L252 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-02-21 03:18:50,817 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [220109736] [2022-02-21 03:18:50,817 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:18:50,817 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-21 03:18:50,817 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:18:50,818 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:18:50,848 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:18:51,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:18:51,408 INFO L263 TraceCheckSpWp]: Trace formula consists of 1547 conjuncts, 5 conjunts are in the unsatisfiable core [2022-02-21 03:18:51,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:18:51,462 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 03:18:51,763 INFO L290 TraceCheckUtils]: 0: Hoare triple {7748#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(21, 2);~count_int~0 := 0; {7753#(<= ~count_int~0 0)} is VALID [2022-02-21 03:18:51,763 INFO L290 TraceCheckUtils]: 1: Hoare triple {7753#(<= ~count_int~0 0)} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc8#1.base, main_#t~malloc8#1.offset, main_#t~mem9#1, main_#t~mem10#1, main_#t~mem11#1, main_#t~mem13#1, main_#t~mem12#1, main_#t~mem14#1, main_#t~mem15#1, main_#t~mem17#1, main_#t~mem16#1, main_#t~mem18#1, main_#t~mem19#1, main_#t~mem21#1, main_#t~mem20#1, main_#t~mem22#1, main_#t~mem23#1, main_#t~switch24#1, main_#t~mem25#1, main_#t~mem26#1, main_#t~mem27#1, main_#t~mem28#1, main_#t~mem29#1, main_#t~mem30#1, main_#t~mem31#1, main_#t~mem32#1, main_#t~mem33#1, main_#t~mem34#1, main_#t~mem35#1, main_~_hj_i~0#1, main_~_hj_j~0#1, main_~_hj_k~0#1, main_~_hj_key~0#1.base, main_~_hj_key~0#1.offset, main_#t~malloc36#1.base, main_#t~malloc36#1.offset, main_#t~mem37#1.base, main_#t~mem37#1.offset, main_#t~mem38#1.base, main_#t~mem38#1.offset, main_#t~memset~res39#1.base, main_#t~memset~res39#1.offset, main_#t~mem40#1.base, main_#t~mem40#1.offset, main_#t~mem41#1.base, main_#t~mem41#1.offset, main_#t~mem42#1.base, main_#t~mem42#1.offset, main_#t~mem43#1.base, main_#t~mem43#1.offset, main_#t~mem44#1.base, main_#t~mem44#1.offset, main_#t~malloc45#1.base, main_#t~malloc45#1.offset, main_#t~mem46#1.base, main_#t~mem46#1.offset, main_#t~mem47#1.base, main_#t~mem47#1.offset, main_#t~mem48#1.base, main_#t~mem48#1.offset, main_#t~mem49#1.base, main_#t~mem49#1.offset, main_#t~mem50#1.base, main_#t~mem50#1.offset, main_#t~mem51#1.base, main_#t~mem51#1.offset, main_#t~memset~res52#1.base, main_#t~memset~res52#1.offset, main_#t~mem53#1.base, main_#t~mem53#1.offset, main_#t~mem54#1.base, main_#t~mem54#1.offset, main_#t~mem55#1.base, main_#t~mem55#1.offset, main_#t~mem56#1.base, main_#t~mem56#1.offset, main_#t~mem57#1, main_#t~mem58#1.base, main_#t~mem58#1.offset, main_#t~mem59#1.base, main_#t~mem59#1.offset, main_#t~mem60#1.base, main_#t~mem60#1.offset, main_#t~mem61#1.base, main_#t~mem61#1.offset, main_#t~mem62#1, main_#t~post63#1, main_#t~mem64#1.base, main_#t~mem64#1.offset, main_#t~mem65#1, main_#t~mem66#1.base, main_#t~mem66#1.offset, main_#t~mem67#1.base, main_#t~mem67#1.offset, main_#t~mem68#1, main_#t~post69#1, main_#t~mem70#1.base, main_#t~mem70#1.offset, main_#t~mem71#1.base, main_#t~mem71#1.offset, main_#t~mem72#1.base, main_#t~mem72#1.offset, main_#t~mem74#1, main_#t~mem73#1, main_#t~mem75#1.base, main_#t~mem75#1.offset, main_#t~mem76#1, main_#t~short77#1, main_#t~mem78#1.base, main_#t~mem78#1.offset, main_#t~mem79#1, main_#t~malloc80#1.base, main_#t~malloc80#1.offset, main_#t~mem81#1.base, main_#t~mem81#1.offset, main_#t~mem82#1.base, main_#t~mem82#1.offset, main_#t~mem83#1.base, main_#t~mem83#1.offset, main_#t~mem84#1, main_#t~memset~res85#1.base, main_#t~memset~res85#1.offset, main_#t~mem86#1.base, main_#t~mem86#1.offset, main_#t~mem87#1.base, main_#t~mem87#1.offset, main_#t~mem90#1, main_#t~mem88#1.base, main_#t~mem88#1.offset, main_#t~mem89#1, main_#t~mem91#1.base, main_#t~mem91#1.offset, main_#t~mem94#1, main_#t~mem92#1.base, main_#t~mem92#1.offset, main_#t~mem93#1, main_#t~ite95#1, main_#t~mem96#1.base, main_#t~mem96#1.offset, main_#t~mem100#1.base, main_#t~mem100#1.offset, main_#t~mem101#1.base, main_#t~mem101#1.offset, main_#t~mem102#1.base, main_#t~mem102#1.offset, main_#t~mem103#1.base, main_#t~mem103#1.offset, main_#t~mem106#1, main_#t~mem104#1.base, main_#t~mem104#1.offset, main_#t~mem105#1, main_#t~mem107#1.base, main_#t~mem107#1.offset, main_#t~mem108#1, main_#t~pre109#1, main_#t~mem110#1.base, main_#t~mem110#1.offset, main_#t~mem111#1, main_#t~mem112#1.base, main_#t~mem112#1.offset, main_#t~mem113#1, main_#t~post114#1, main_#t~mem118#1, main_#t~mem116#1, main_#t~mem115#1.base, main_#t~mem115#1.offset, main_#t~mem117#1, main_#t~mem119#1, main_#t~post120#1, main_#t~mem121#1.base, main_#t~mem121#1.offset, main_#t~mem122#1.base, main_#t~mem122#1.offset, main_#t~mem123#1.base, main_#t~mem123#1.offset, main_#t~post97#1, main_#t~mem98#1.base, main_#t~mem98#1.offset, main_#t~mem99#1, main_#t~mem124#1.base, main_#t~mem124#1.offset, main_#t~mem125#1.base, main_#t~mem125#1.offset, main_#t~mem126#1.base, main_#t~mem126#1.offset, main_#t~mem127#1, main_#t~mem128#1.base, main_#t~mem128#1.offset, main_#t~mem129#1, main_#t~post130#1, main_#t~mem131#1.base, main_#t~mem131#1.offset, main_#t~mem132#1.base, main_#t~mem132#1.offset, main_#t~mem133#1.base, main_#t~mem133#1.offset, main_#t~mem134#1.base, main_#t~mem134#1.offset, main_#t~mem137#1, main_#t~mem135#1.base, main_#t~mem135#1.offset, main_#t~mem136#1, main_#t~ite140#1, main_#t~mem138#1.base, main_#t~mem138#1.offset, main_#t~mem139#1, main_#t~mem141#1.base, main_#t~mem141#1.offset, main_#t~mem142#1, main_#t~mem143#1.base, main_#t~mem143#1.offset, main_~_he_bkt~0#1, main_~_he_bkt_i~0#1, main_~_he_thh~0#1.base, main_~_he_thh~0#1.offset, main_~_he_hh_nxt~0#1.base, main_~_he_hh_nxt~0#1.offset, main_~#_he_new_buckets~0#1.base, main_~#_he_new_buckets~0#1.offset, main_~_he_newbkt~0#1.base, main_~_he_newbkt~0#1.offset, main_~_ha_head~0#1.base, main_~_ha_head~0#1.offset, main_~_ha_bkt~0#1, main_~_ha_hashv~0#1, main_#t~mem144#1.base, main_#t~mem144#1.offset, main_#t~mem145#1, main_#t~mem5#1, main_#t~post6#1, main_#t~mem7#1, main_#t~mem149#1, main_#t~mem148#1, main_#t~mem150#1, main_#t~mem151#1, main_#t~mem153#1, main_#t~mem152#1, main_#t~mem154#1, main_#t~mem155#1, main_#t~mem157#1, main_#t~mem156#1, main_#t~mem158#1, main_#t~mem159#1, main_#t~switch160#1, main_#t~mem161#1, main_#t~mem162#1, main_#t~mem163#1, main_#t~mem164#1, main_#t~mem165#1, main_#t~mem166#1, main_#t~mem167#1, main_#t~mem168#1, main_#t~mem169#1, main_#t~mem170#1, main_#t~mem171#1, main_~_hj_i~1#1, main_~_hj_j~1#1, main_~_hj_k~1#1, main_~_hj_key~1#1.base, main_~_hj_key~1#1.offset, main_#t~mem172#1.base, main_#t~mem172#1.offset, main_#t~mem173#1, main_#t~mem174#1.base, main_#t~mem174#1.offset, main_#t~mem175#1.base, main_#t~mem175#1.offset, main_#t~mem176#1.base, main_#t~mem176#1.offset, main_#t~mem177#1.base, main_#t~mem177#1.offset, main_#t~mem178#1.base, main_#t~mem178#1.offset, main_#t~mem179#1.base, main_#t~mem179#1.offset, main_#t~mem180#1.base, main_#t~mem180#1.offset, main_#t~mem181#1, main_#t~mem182#1, main_#t~mem183#1, main_#t~short184#1, main_#t~mem185#1.base, main_#t~mem185#1.offset, main_#t~ret186#1, main_#t~mem187#1.base, main_#t~mem187#1.offset, main_#t~mem188#1.base, main_#t~mem188#1.offset, main_#t~mem189#1.base, main_#t~mem189#1.offset, main_#t~mem190#1, main_~_hf_bkt~0#1, main_~_hf_hashv~0#1, main_#t~mem191#1.base, main_#t~mem191#1.offset, main_#t~mem192#1.base, main_#t~mem192#1.offset, main_#t~short193#1, main_#t~mem194#1.base, main_#t~mem194#1.offset, main_#t~mem195#1.base, main_#t~mem195#1.offset, main_#t~mem196#1.base, main_#t~mem196#1.offset, main_#t~mem197#1.base, main_#t~mem197#1.offset, main_#t~mem198#1.base, main_#t~mem198#1.offset, main_#t~mem199#1.base, main_#t~mem199#1.offset, main_#t~mem200#1.base, main_#t~mem200#1.offset, main_#t~mem201#1.base, main_#t~mem201#1.offset, main_#t~mem202#1, main_#t~mem203#1.base, main_#t~mem203#1.offset, main_#t~mem204#1.base, main_#t~mem204#1.offset, main_#t~mem205#1.base, main_#t~mem205#1.offset, main_#t~mem206#1, main_#t~mem207#1.base, main_#t~mem207#1.offset, main_#t~mem208#1.base, main_#t~mem208#1.offset, main_#t~mem209#1.base, main_#t~mem209#1.offset, main_#t~mem210#1.base, main_#t~mem210#1.offset, main_#t~mem211#1.base, main_#t~mem211#1.offset, main_#t~mem212#1, main_#t~mem213#1.base, main_#t~mem213#1.offset, main_#t~mem216#1, main_#t~mem214#1.base, main_#t~mem214#1.offset, main_#t~mem215#1, main_#t~mem217#1.base, main_#t~mem217#1.offset, main_#t~mem218#1.base, main_#t~mem218#1.offset, main_#t~mem219#1, main_#t~post220#1, main_#t~mem221#1.base, main_#t~mem221#1.offset, main_#t~mem222#1.base, main_#t~mem222#1.offset, main_#t~mem223#1.base, main_#t~mem223#1.offset, main_#t~mem224#1.base, main_#t~mem224#1.offset, main_#t~mem225#1.base, main_#t~mem225#1.offset, main_#t~mem226#1.base, main_#t~mem226#1.offset, main_#t~mem227#1.base, main_#t~mem227#1.offset, main_#t~mem228#1.base, main_#t~mem228#1.offset, main_~_hd_head~0#1.base, main_~_hd_head~0#1.offset, main_#t~mem229#1.base, main_#t~mem229#1.offset, main_#t~mem230#1, main_#t~post231#1, main_~_hd_bkt~0#1, main_~_hd_hh_del~0#1.base, main_~_hd_hh_del~0#1.offset, main_#t~mem232#1.base, main_#t~mem232#1.offset, main_#t~mem233#1, main_#t~mem146#1, main_#t~mem147#1, main_~#i~0#1.base, main_~#i~0#1.offset, main_~user~0#1.base, main_~user~0#1.offset, main_~tmp~0#1.base, main_~tmp~0#1.offset, main_~users~0#1.base, main_~users~0#1.offset;call main_~#i~0#1.base, main_~#i~0#1.offset := #Ultimate.allocOnStack(4);havoc main_~user~0#1.base, main_~user~0#1.offset;havoc main_~tmp~0#1.base, main_~tmp~0#1.offset;main_~users~0#1.base, main_~users~0#1.offset := 0, 0;call write~int(0, main_~#i~0#1.base, main_~#i~0#1.offset, 4); {7753#(<= ~count_int~0 0)} is VALID [2022-02-21 03:18:51,764 INFO L290 TraceCheckUtils]: 2: Hoare triple {7753#(<= ~count_int~0 0)} call main_#t~mem7#1 := read~int(main_~#i~0#1.base, main_~#i~0#1.offset, 4); {7753#(<= ~count_int~0 0)} is VALID [2022-02-21 03:18:51,765 INFO L290 TraceCheckUtils]: 3: Hoare triple {7753#(<= ~count_int~0 0)} assume !!(main_#t~mem7#1 < 10);havoc main_#t~mem7#1;call main_#t~malloc8#1.base, main_#t~malloc8#1.offset := #Ultimate.allocOnHeap(40);main_~user~0#1.base, main_~user~0#1.offset := main_#t~malloc8#1.base, main_#t~malloc8#1.offset;havoc main_#t~malloc8#1.base, main_#t~malloc8#1.offset; {7753#(<= ~count_int~0 0)} is VALID [2022-02-21 03:18:51,765 INFO L290 TraceCheckUtils]: 4: Hoare triple {7753#(<= ~count_int~0 0)} assume !(main_~user~0#1.base == 0 && main_~user~0#1.offset == 0); {7753#(<= ~count_int~0 0)} is VALID [2022-02-21 03:18:51,765 INFO L290 TraceCheckUtils]: 5: Hoare triple {7753#(<= ~count_int~0 0)} call main_#t~mem9#1 := read~int(main_~#i~0#1.base, main_~#i~0#1.offset, 4);call write~int(main_#t~mem9#1, main_~user~0#1.base, main_~user~0#1.offset, 4);havoc main_#t~mem9#1;call main_#t~mem10#1 := read~int(main_~#i~0#1.base, main_~#i~0#1.offset, 4);call main_#t~mem11#1 := read~int(main_~#i~0#1.base, main_~#i~0#1.offset, 4); {7753#(<= ~count_int~0 0)} is VALID [2022-02-21 03:18:51,765 INFO L290 TraceCheckUtils]: 6: Hoare triple {7753#(<= ~count_int~0 0)} assume main_#t~mem10#1 * main_#t~mem11#1 <= 2147483647; {7753#(<= ~count_int~0 0)} is VALID [2022-02-21 03:18:51,766 INFO L290 TraceCheckUtils]: 7: Hoare triple {7753#(<= ~count_int~0 0)} assume main_#t~mem10#1 * main_#t~mem11#1 >= -2147483648;call write~int(main_#t~mem10#1 * main_#t~mem11#1, main_~user~0#1.base, 4 + main_~user~0#1.offset, 4);havoc main_#t~mem10#1;havoc main_#t~mem11#1; {7753#(<= ~count_int~0 0)} is VALID [2022-02-21 03:18:51,766 INFO L290 TraceCheckUtils]: 8: Hoare triple {7753#(<= ~count_int~0 0)} havoc main_~_ha_hashv~0#1; {7753#(<= ~count_int~0 0)} is VALID [2022-02-21 03:18:51,766 INFO L290 TraceCheckUtils]: 9: Hoare triple {7753#(<= ~count_int~0 0)} goto; {7753#(<= ~count_int~0 0)} is VALID [2022-02-21 03:18:51,767 INFO L290 TraceCheckUtils]: 10: Hoare triple {7753#(<= ~count_int~0 0)} havoc main_~_hj_i~0#1;havoc main_~_hj_j~0#1;havoc main_~_hj_k~0#1;main_~_hj_key~0#1.base, main_~_hj_key~0#1.offset := main_~user~0#1.base, main_~user~0#1.offset;main_~_ha_hashv~0#1 := 4276993775;main_~_hj_j~0#1 := 2654435769;main_~_hj_i~0#1 := main_~_hj_j~0#1;main_~_hj_k~0#1 := 4; {7753#(<= ~count_int~0 0)} is VALID [2022-02-21 03:18:51,767 INFO L290 TraceCheckUtils]: 11: Hoare triple {7753#(<= ~count_int~0 0)} assume !(main_~_hj_k~0#1 % 4294967296 >= 12); {7753#(<= ~count_int~0 0)} is VALID [2022-02-21 03:18:51,767 INFO L290 TraceCheckUtils]: 12: Hoare triple {7753#(<= ~count_int~0 0)} main_~_ha_hashv~0#1 := 4 + main_~_ha_hashv~0#1;main_#t~switch24#1 := 11 == main_~_hj_k~0#1; {7753#(<= ~count_int~0 0)} is VALID [2022-02-21 03:18:51,768 INFO L290 TraceCheckUtils]: 13: Hoare triple {7753#(<= ~count_int~0 0)} assume !main_#t~switch24#1; {7753#(<= ~count_int~0 0)} is VALID [2022-02-21 03:18:51,768 INFO L290 TraceCheckUtils]: 14: Hoare triple {7753#(<= ~count_int~0 0)} main_#t~switch24#1 := main_#t~switch24#1 || 10 == main_~_hj_k~0#1; {7753#(<= ~count_int~0 0)} is VALID [2022-02-21 03:18:51,768 INFO L290 TraceCheckUtils]: 15: Hoare triple {7753#(<= ~count_int~0 0)} assume !main_#t~switch24#1; {7753#(<= ~count_int~0 0)} is VALID [2022-02-21 03:18:51,769 INFO L290 TraceCheckUtils]: 16: Hoare triple {7753#(<= ~count_int~0 0)} main_#t~switch24#1 := main_#t~switch24#1 || 9 == main_~_hj_k~0#1; {7753#(<= ~count_int~0 0)} is VALID [2022-02-21 03:18:51,771 INFO L290 TraceCheckUtils]: 17: Hoare triple {7753#(<= ~count_int~0 0)} assume !main_#t~switch24#1; {7753#(<= ~count_int~0 0)} is VALID [2022-02-21 03:18:51,772 INFO L290 TraceCheckUtils]: 18: Hoare triple {7753#(<= ~count_int~0 0)} main_#t~switch24#1 := main_#t~switch24#1 || 8 == main_~_hj_k~0#1; {7753#(<= ~count_int~0 0)} is VALID [2022-02-21 03:18:51,772 INFO L290 TraceCheckUtils]: 19: Hoare triple {7753#(<= ~count_int~0 0)} assume !main_#t~switch24#1; {7753#(<= ~count_int~0 0)} is VALID [2022-02-21 03:18:51,772 INFO L290 TraceCheckUtils]: 20: Hoare triple {7753#(<= ~count_int~0 0)} main_#t~switch24#1 := main_#t~switch24#1 || 7 == main_~_hj_k~0#1; {7753#(<= ~count_int~0 0)} is VALID [2022-02-21 03:18:51,773 INFO L290 TraceCheckUtils]: 21: Hoare triple {7753#(<= ~count_int~0 0)} assume !main_#t~switch24#1; {7753#(<= ~count_int~0 0)} is VALID [2022-02-21 03:18:51,773 INFO L290 TraceCheckUtils]: 22: Hoare triple {7753#(<= ~count_int~0 0)} main_#t~switch24#1 := main_#t~switch24#1 || 6 == main_~_hj_k~0#1; {7753#(<= ~count_int~0 0)} is VALID [2022-02-21 03:18:51,774 INFO L290 TraceCheckUtils]: 23: Hoare triple {7753#(<= ~count_int~0 0)} assume !main_#t~switch24#1; {7753#(<= ~count_int~0 0)} is VALID [2022-02-21 03:18:51,774 INFO L290 TraceCheckUtils]: 24: Hoare triple {7753#(<= ~count_int~0 0)} main_#t~switch24#1 := main_#t~switch24#1 || 5 == main_~_hj_k~0#1; {7753#(<= ~count_int~0 0)} is VALID [2022-02-21 03:18:51,775 INFO L290 TraceCheckUtils]: 25: Hoare triple {7753#(<= ~count_int~0 0)} assume !main_#t~switch24#1; {7753#(<= ~count_int~0 0)} is VALID [2022-02-21 03:18:51,775 INFO L290 TraceCheckUtils]: 26: Hoare triple {7753#(<= ~count_int~0 0)} main_#t~switch24#1 := main_#t~switch24#1 || 4 == main_~_hj_k~0#1; {7753#(<= ~count_int~0 0)} is VALID [2022-02-21 03:18:51,776 INFO L290 TraceCheckUtils]: 27: Hoare triple {7753#(<= ~count_int~0 0)} assume main_#t~switch24#1;call main_#t~mem32#1 := read~int(main_~_hj_key~0#1.base, 3 + main_~_hj_key~0#1.offset, 1);main_~_hj_i~0#1 := main_~_hj_i~0#1 + 16777216 * (main_#t~mem32#1 % 256);havoc main_#t~mem32#1; {7753#(<= ~count_int~0 0)} is VALID [2022-02-21 03:18:51,776 INFO L290 TraceCheckUtils]: 28: Hoare triple {7753#(<= ~count_int~0 0)} main_#t~switch24#1 := main_#t~switch24#1 || 3 == main_~_hj_k~0#1; {7753#(<= ~count_int~0 0)} is VALID [2022-02-21 03:18:51,777 INFO L290 TraceCheckUtils]: 29: Hoare triple {7753#(<= ~count_int~0 0)} assume main_#t~switch24#1;call main_#t~mem33#1 := read~int(main_~_hj_key~0#1.base, 2 + main_~_hj_key~0#1.offset, 1);main_~_hj_i~0#1 := main_~_hj_i~0#1 + 65536 * (main_#t~mem33#1 % 256);havoc main_#t~mem33#1; {7753#(<= ~count_int~0 0)} is VALID [2022-02-21 03:18:51,777 INFO L290 TraceCheckUtils]: 30: Hoare triple {7753#(<= ~count_int~0 0)} main_#t~switch24#1 := main_#t~switch24#1 || 2 == main_~_hj_k~0#1; {7753#(<= ~count_int~0 0)} is VALID [2022-02-21 03:18:51,777 INFO L290 TraceCheckUtils]: 31: Hoare triple {7753#(<= ~count_int~0 0)} assume main_#t~switch24#1;call main_#t~mem34#1 := read~int(main_~_hj_key~0#1.base, 1 + main_~_hj_key~0#1.offset, 1);main_~_hj_i~0#1 := main_~_hj_i~0#1 + 256 * (main_#t~mem34#1 % 256);havoc main_#t~mem34#1; {7753#(<= ~count_int~0 0)} is VALID [2022-02-21 03:18:51,778 INFO L290 TraceCheckUtils]: 32: Hoare triple {7753#(<= ~count_int~0 0)} main_#t~switch24#1 := main_#t~switch24#1 || 1 == main_~_hj_k~0#1; {7753#(<= ~count_int~0 0)} is VALID [2022-02-21 03:18:51,778 INFO L290 TraceCheckUtils]: 33: Hoare triple {7753#(<= ~count_int~0 0)} assume main_#t~switch24#1;call main_#t~mem35#1 := read~int(main_~_hj_key~0#1.base, main_~_hj_key~0#1.offset, 1);main_~_hj_i~0#1 := main_~_hj_i~0#1 + main_#t~mem35#1 % 256;havoc main_#t~mem35#1; {7753#(<= ~count_int~0 0)} is VALID [2022-02-21 03:18:51,779 INFO L290 TraceCheckUtils]: 34: Hoare triple {7753#(<= ~count_int~0 0)} havoc main_#t~switch24#1; {7753#(<= ~count_int~0 0)} is VALID [2022-02-21 03:18:51,779 INFO L290 TraceCheckUtils]: 35: Hoare triple {7753#(<= ~count_int~0 0)} main_~_hj_i~0#1 := main_~_hj_i~0#1 - main_~_hj_j~0#1;main_~_hj_i~0#1 := main_~_hj_i~0#1 - main_~_ha_hashv~0#1;main_~_hj_i~0#1 := (if (1 == main_~_hj_i~0#1 || 0 == main_~_hj_i~0#1) && (1 == main_~_ha_hashv~0#1 / 8192 || 0 == main_~_ha_hashv~0#1 / 8192) then (if main_~_hj_i~0#1 == main_~_ha_hashv~0#1 / 8192 then 0 else 1) else (if 0 == main_~_hj_i~0#1 then main_~_ha_hashv~0#1 / 8192 else (if 0 == main_~_ha_hashv~0#1 / 8192 then main_~_hj_i~0#1 else ~bitwiseXOr(main_~_hj_i~0#1, main_~_ha_hashv~0#1 / 8192))));main_~_hj_j~0#1 := main_~_hj_j~0#1 - main_~_ha_hashv~0#1;main_~_hj_j~0#1 := main_~_hj_j~0#1 - main_~_hj_i~0#1;main_~_hj_j~0#1 := (if (1 == main_~_hj_j~0#1 || 0 == main_~_hj_j~0#1) && (1 == 256 * main_~_hj_i~0#1 || 0 == 256 * main_~_hj_i~0#1) then (if main_~_hj_j~0#1 == 256 * main_~_hj_i~0#1 then 0 else 1) else (if 0 == main_~_hj_j~0#1 then 256 * main_~_hj_i~0#1 else (if 0 == 256 * main_~_hj_i~0#1 then main_~_hj_j~0#1 else ~bitwiseXOr(main_~_hj_j~0#1, 256 * main_~_hj_i~0#1))));main_~_ha_hashv~0#1 := main_~_ha_hashv~0#1 - main_~_hj_i~0#1;main_~_ha_hashv~0#1 := main_~_ha_hashv~0#1 - main_~_hj_j~0#1;main_~_ha_hashv~0#1 := (if (1 == main_~_ha_hashv~0#1 || 0 == main_~_ha_hashv~0#1) && (1 == main_~_hj_j~0#1 / 8192 || 0 == main_~_hj_j~0#1 / 8192) then (if main_~_ha_hashv~0#1 == main_~_hj_j~0#1 / 8192 then 0 else 1) else (if 0 == main_~_ha_hashv~0#1 then main_~_hj_j~0#1 / 8192 else (if 0 == main_~_hj_j~0#1 / 8192 then main_~_ha_hashv~0#1 else ~bitwiseXOr(main_~_ha_hashv~0#1, main_~_hj_j~0#1 / 8192))));main_~_hj_i~0#1 := main_~_hj_i~0#1 - main_~_hj_j~0#1;main_~_hj_i~0#1 := main_~_hj_i~0#1 - main_~_ha_hashv~0#1;main_~_hj_i~0#1 := (if (1 == main_~_hj_i~0#1 || 0 == main_~_hj_i~0#1) && (1 == main_~_ha_hashv~0#1 / 4096 || 0 == main_~_ha_hashv~0#1 / 4096) then (if main_~_hj_i~0#1 == main_~_ha_hashv~0#1 / 4096 then 0 else 1) else (if 0 == main_~_hj_i~0#1 then main_~_ha_hashv~0#1 / 4096 else (if 0 == main_~_ha_hashv~0#1 / 4096 then main_~_hj_i~0#1 else ~bitwiseXOr(main_~_hj_i~0#1, main_~_ha_hashv~0#1 / 4096))));main_~_hj_j~0#1 := main_~_hj_j~0#1 - main_~_ha_hashv~0#1;main_~_hj_j~0#1 := main_~_hj_j~0#1 - main_~_hj_i~0#1;main_~_hj_j~0#1 := (if (1 == main_~_hj_j~0#1 || 0 == main_~_hj_j~0#1) && (1 == 65536 * main_~_hj_i~0#1 || 0 == 65536 * main_~_hj_i~0#1) then (if main_~_hj_j~0#1 == 65536 * main_~_hj_i~0#1 then 0 else 1) else (if 0 == main_~_hj_j~0#1 then 65536 * main_~_hj_i~0#1 else (if 0 == 65536 * main_~_hj_i~0#1 then main_~_hj_j~0#1 else ~bitwiseXOr(main_~_hj_j~0#1, 65536 * main_~_hj_i~0#1))));main_~_ha_hashv~0#1 := main_~_ha_hashv~0#1 - main_~_hj_i~0#1;main_~_ha_hashv~0#1 := main_~_ha_hashv~0#1 - main_~_hj_j~0#1;main_~_ha_hashv~0#1 := (if (1 == main_~_ha_hashv~0#1 || 0 == main_~_ha_hashv~0#1) && (1 == main_~_hj_j~0#1 / 32 || 0 == main_~_hj_j~0#1 / 32) then (if main_~_ha_hashv~0#1 == main_~_hj_j~0#1 / 32 then 0 else 1) else (if 0 == main_~_ha_hashv~0#1 then main_~_hj_j~0#1 / 32 else (if 0 == main_~_hj_j~0#1 / 32 then main_~_ha_hashv~0#1 else ~bitwiseXOr(main_~_ha_hashv~0#1, main_~_hj_j~0#1 / 32))));main_~_hj_i~0#1 := main_~_hj_i~0#1 - main_~_hj_j~0#1;main_~_hj_i~0#1 := main_~_hj_i~0#1 - main_~_ha_hashv~0#1;main_~_hj_i~0#1 := (if (1 == main_~_hj_i~0#1 || 0 == main_~_hj_i~0#1) && (1 == main_~_ha_hashv~0#1 / 8 || 0 == main_~_ha_hashv~0#1 / 8) then (if main_~_hj_i~0#1 == main_~_ha_hashv~0#1 / 8 then 0 else 1) else (if 0 == main_~_hj_i~0#1 then main_~_ha_hashv~0#1 / 8 else (if 0 == main_~_ha_hashv~0#1 / 8 then main_~_hj_i~0#1 else ~bitwiseXOr(main_~_hj_i~0#1, main_~_ha_hashv~0#1 / 8))));main_~_hj_j~0#1 := main_~_hj_j~0#1 - main_~_ha_hashv~0#1;main_~_hj_j~0#1 := main_~_hj_j~0#1 - main_~_hj_i~0#1;main_~_hj_j~0#1 := (if (1 == main_~_hj_j~0#1 || 0 == main_~_hj_j~0#1) && (1 == 1024 * main_~_hj_i~0#1 || 0 == 1024 * main_~_hj_i~0#1) then (if main_~_hj_j~0#1 == 1024 * main_~_hj_i~0#1 then 0 else 1) else (if 0 == main_~_hj_j~0#1 then 1024 * main_~_hj_i~0#1 else (if 0 == 1024 * main_~_hj_i~0#1 then main_~_hj_j~0#1 else ~bitwiseXOr(main_~_hj_j~0#1, 1024 * main_~_hj_i~0#1))));main_~_ha_hashv~0#1 := main_~_ha_hashv~0#1 - main_~_hj_i~0#1;main_~_ha_hashv~0#1 := main_~_ha_hashv~0#1 - main_~_hj_j~0#1;main_~_ha_hashv~0#1 := (if (1 == main_~_ha_hashv~0#1 || 0 == main_~_ha_hashv~0#1) && (1 == main_~_hj_j~0#1 / 32768 || 0 == main_~_hj_j~0#1 / 32768) then (if main_~_ha_hashv~0#1 == main_~_hj_j~0#1 / 32768 then 0 else 1) else (if 0 == main_~_ha_hashv~0#1 then main_~_hj_j~0#1 / 32768 else (if 0 == main_~_hj_j~0#1 / 32768 then main_~_ha_hashv~0#1 else ~bitwiseXOr(main_~_ha_hashv~0#1, main_~_hj_j~0#1 / 32768)))); {7753#(<= ~count_int~0 0)} is VALID [2022-02-21 03:18:51,779 INFO L290 TraceCheckUtils]: 36: Hoare triple {7753#(<= ~count_int~0 0)} goto; {7753#(<= ~count_int~0 0)} is VALID [2022-02-21 03:18:51,780 INFO L290 TraceCheckUtils]: 37: Hoare triple {7753#(<= ~count_int~0 0)} goto; {7753#(<= ~count_int~0 0)} is VALID [2022-02-21 03:18:51,781 INFO L290 TraceCheckUtils]: 38: Hoare triple {7753#(<= ~count_int~0 0)} goto; {7753#(<= ~count_int~0 0)} is VALID [2022-02-21 03:18:51,781 INFO L290 TraceCheckUtils]: 39: Hoare triple {7753#(<= ~count_int~0 0)} call write~int(main_~_ha_hashv~0#1, main_~user~0#1.base, 36 + main_~user~0#1.offset, 4);call write~$Pointer$(main_~user~0#1.base, main_~user~0#1.offset, main_~user~0#1.base, 28 + main_~user~0#1.offset, 4);call write~int(4, main_~user~0#1.base, 32 + main_~user~0#1.offset, 4); {7753#(<= ~count_int~0 0)} is VALID [2022-02-21 03:18:51,781 INFO L290 TraceCheckUtils]: 40: Hoare triple {7753#(<= ~count_int~0 0)} assume !(main_~users~0#1.base == 0 && main_~users~0#1.offset == 0);call main_#t~mem53#1.base, main_#t~mem53#1.offset := read~$Pointer$(main_~users~0#1.base, 8 + main_~users~0#1.offset, 4);call write~$Pointer$(main_#t~mem53#1.base, main_#t~mem53#1.offset, main_~user~0#1.base, 8 + main_~user~0#1.offset, 4);havoc main_#t~mem53#1.base, main_#t~mem53#1.offset; {7753#(<= ~count_int~0 0)} is VALID [2022-02-21 03:18:51,781 INFO L290 TraceCheckUtils]: 41: Hoare triple {7753#(<= ~count_int~0 0)} call write~$Pointer$(0, 0, main_~user~0#1.base, 16 + main_~user~0#1.offset, 4);call main_#t~mem54#1.base, main_#t~mem54#1.offset := read~$Pointer$(main_~users~0#1.base, 8 + main_~users~0#1.offset, 4);call main_#t~mem55#1.base, main_#t~mem55#1.offset := read~$Pointer$(main_#t~mem54#1.base, 16 + main_#t~mem54#1.offset, 4);call main_#t~mem56#1.base, main_#t~mem56#1.offset := read~$Pointer$(main_~users~0#1.base, 8 + main_~users~0#1.offset, 4);call main_#t~mem57#1 := read~int(main_#t~mem56#1.base, 20 + main_#t~mem56#1.offset, 4);call write~$Pointer$(main_#t~mem55#1.base, main_#t~mem55#1.offset - main_#t~mem57#1, main_~user~0#1.base, 12 + main_~user~0#1.offset, 4);havoc main_#t~mem54#1.base, main_#t~mem54#1.offset;havoc main_#t~mem55#1.base, main_#t~mem55#1.offset;havoc main_#t~mem56#1.base, main_#t~mem56#1.offset;havoc main_#t~mem57#1;call main_#t~mem58#1.base, main_#t~mem58#1.offset := read~$Pointer$(main_~users~0#1.base, 8 + main_~users~0#1.offset, 4);call main_#t~mem59#1.base, main_#t~mem59#1.offset := read~$Pointer$(main_#t~mem58#1.base, 16 + main_#t~mem58#1.offset, 4);call write~$Pointer$(main_~user~0#1.base, main_~user~0#1.offset, main_#t~mem59#1.base, 8 + main_#t~mem59#1.offset, 4);havoc main_#t~mem58#1.base, main_#t~mem58#1.offset;havoc main_#t~mem59#1.base, main_#t~mem59#1.offset;call main_#t~mem60#1.base, main_#t~mem60#1.offset := read~$Pointer$(main_~users~0#1.base, 8 + main_~users~0#1.offset, 4);call write~$Pointer$(main_~user~0#1.base, 8 + main_~user~0#1.offset, main_#t~mem60#1.base, 16 + main_#t~mem60#1.offset, 4);havoc main_#t~mem60#1.base, main_#t~mem60#1.offset; {7753#(<= ~count_int~0 0)} is VALID [2022-02-21 03:18:51,782 INFO L290 TraceCheckUtils]: 42: Hoare triple {7753#(<= ~count_int~0 0)} goto; {7753#(<= ~count_int~0 0)} is VALID [2022-02-21 03:18:51,782 INFO L290 TraceCheckUtils]: 43: Hoare triple {7753#(<= ~count_int~0 0)} havoc main_~_ha_bkt~0#1;call main_#t~mem61#1.base, main_#t~mem61#1.offset := read~$Pointer$(main_~users~0#1.base, 8 + main_~users~0#1.offset, 4);call main_#t~mem62#1 := read~int(main_#t~mem61#1.base, 12 + main_#t~mem61#1.offset, 4);main_#t~post63#1 := main_#t~mem62#1;call write~int(1 + main_#t~post63#1, main_#t~mem61#1.base, 12 + main_#t~mem61#1.offset, 4);havoc main_#t~mem61#1.base, main_#t~mem61#1.offset;havoc main_#t~mem62#1;havoc main_#t~post63#1; {7753#(<= ~count_int~0 0)} is VALID [2022-02-21 03:18:51,782 INFO L290 TraceCheckUtils]: 44: Hoare triple {7753#(<= ~count_int~0 0)} call main_#t~mem64#1.base, main_#t~mem64#1.offset := read~$Pointer$(main_~users~0#1.base, 8 + main_~users~0#1.offset, 4);call main_#t~mem65#1 := read~int(main_#t~mem64#1.base, 4 + main_#t~mem64#1.offset, 4);main_~_ha_bkt~0#1 := (if 0 == main_~_ha_hashv~0#1 || 0 == main_#t~mem65#1 - 1 then 0 else (if 1 == main_#t~mem65#1 - 1 then (if 1 == main_~_ha_hashv~0#1 || 0 == main_~_ha_hashv~0#1 then main_~_ha_hashv~0#1 else (if main_~_ha_hashv~0#1 >= 0 then main_~_ha_hashv~0#1 % 2 else ~bitwiseAnd(main_~_ha_hashv~0#1, main_#t~mem65#1 - 1))) else (if 1 == main_~_ha_hashv~0#1 then (if 1 == main_#t~mem65#1 - 1 || 0 == main_#t~mem65#1 - 1 then main_#t~mem65#1 - 1 else (if main_#t~mem65#1 - 1 >= 0 then (main_#t~mem65#1 - 1) % 2 else ~bitwiseAnd(main_~_ha_hashv~0#1, main_#t~mem65#1 - 1))) else ~bitwiseAnd(main_~_ha_hashv~0#1, main_#t~mem65#1 - 1))));havoc main_#t~mem64#1.base, main_#t~mem64#1.offset;havoc main_#t~mem65#1; {7753#(<= ~count_int~0 0)} is VALID [2022-02-21 03:18:51,783 INFO L290 TraceCheckUtils]: 45: Hoare triple {7753#(<= ~count_int~0 0)} goto; {7753#(<= ~count_int~0 0)} is VALID [2022-02-21 03:18:51,783 INFO L290 TraceCheckUtils]: 46: Hoare triple {7753#(<= ~count_int~0 0)} call main_#t~mem66#1.base, main_#t~mem66#1.offset := read~$Pointer$(main_~users~0#1.base, 8 + main_~users~0#1.offset, 4);call main_#t~mem67#1.base, main_#t~mem67#1.offset := read~$Pointer$(main_#t~mem66#1.base, main_#t~mem66#1.offset, 4);main_~_ha_head~0#1.base, main_~_ha_head~0#1.offset := main_#t~mem67#1.base, main_#t~mem67#1.offset + 12 * (if main_~_ha_bkt~0#1 % 4294967296 % 4294967296 <= 2147483647 then main_~_ha_bkt~0#1 % 4294967296 % 4294967296 else main_~_ha_bkt~0#1 % 4294967296 % 4294967296 - 4294967296);havoc main_#t~mem66#1.base, main_#t~mem66#1.offset;havoc main_#t~mem67#1.base, main_#t~mem67#1.offset;call main_#t~mem68#1 := read~int(main_~_ha_head~0#1.base, 4 + main_~_ha_head~0#1.offset, 4);main_#t~post69#1 := main_#t~mem68#1;call write~int(1 + main_#t~post69#1, main_~_ha_head~0#1.base, 4 + main_~_ha_head~0#1.offset, 4);havoc main_#t~mem68#1;havoc main_#t~post69#1;call main_#t~mem70#1.base, main_#t~mem70#1.offset := read~$Pointer$(main_~_ha_head~0#1.base, main_~_ha_head~0#1.offset, 4);call write~$Pointer$(main_#t~mem70#1.base, main_#t~mem70#1.offset, main_~user~0#1.base, 24 + main_~user~0#1.offset, 4);havoc main_#t~mem70#1.base, main_#t~mem70#1.offset;call write~$Pointer$(0, 0, main_~user~0#1.base, 20 + main_~user~0#1.offset, 4);call main_#t~mem71#1.base, main_#t~mem71#1.offset := read~$Pointer$(main_~_ha_head~0#1.base, main_~_ha_head~0#1.offset, 4); {7753#(<= ~count_int~0 0)} is VALID [2022-02-21 03:18:51,784 INFO L290 TraceCheckUtils]: 47: Hoare triple {7753#(<= ~count_int~0 0)} assume main_#t~mem71#1.base != 0 || main_#t~mem71#1.offset != 0;havoc main_#t~mem71#1.base, main_#t~mem71#1.offset;call main_#t~mem72#1.base, main_#t~mem72#1.offset := read~$Pointer$(main_~_ha_head~0#1.base, main_~_ha_head~0#1.offset, 4);call write~$Pointer$(main_~user~0#1.base, 8 + main_~user~0#1.offset, main_#t~mem72#1.base, 12 + main_#t~mem72#1.offset, 4);havoc main_#t~mem72#1.base, main_#t~mem72#1.offset; {7753#(<= ~count_int~0 0)} is VALID [2022-02-21 03:18:51,784 INFO L290 TraceCheckUtils]: 48: Hoare triple {7753#(<= ~count_int~0 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~mem74#1 := read~int(main_~_ha_head~0#1.base, 4 + main_~_ha_head~0#1.offset, 4);call main_#t~mem73#1 := read~int(main_~_ha_head~0#1.base, 8 + main_~_ha_head~0#1.offset, 4);main_#t~short77#1 := main_#t~mem74#1 % 4294967296 >= 10 * (1 + main_#t~mem73#1) % 4294967296; {7753#(<= ~count_int~0 0)} is VALID [2022-02-21 03:18:51,784 INFO L290 TraceCheckUtils]: 49: Hoare triple {7753#(<= ~count_int~0 0)} assume main_#t~short77#1;call main_#t~mem75#1.base, main_#t~mem75#1.offset := read~$Pointer$(main_~user~0#1.base, 8 + main_~user~0#1.offset, 4);call main_#t~mem76#1 := read~int(main_#t~mem75#1.base, 36 + main_#t~mem75#1.offset, 4);main_#t~short77#1 := 0 == main_#t~mem76#1 % 4294967296; {7753#(<= ~count_int~0 0)} is VALID [2022-02-21 03:18:51,784 INFO L290 TraceCheckUtils]: 50: Hoare triple {7753#(<= ~count_int~0 0)} assume !main_#t~short77#1;havoc main_#t~mem74#1;havoc main_#t~mem73#1;havoc main_#t~mem75#1.base, main_#t~mem75#1.offset;havoc main_#t~mem76#1;havoc main_#t~short77#1; {7753#(<= ~count_int~0 0)} is VALID [2022-02-21 03:18:51,785 INFO L290 TraceCheckUtils]: 51: Hoare triple {7753#(<= ~count_int~0 0)} goto; {7753#(<= ~count_int~0 0)} is VALID [2022-02-21 03:18:51,785 INFO L290 TraceCheckUtils]: 52: Hoare triple {7753#(<= ~count_int~0 0)} goto; {7753#(<= ~count_int~0 0)} is VALID [2022-02-21 03:18:51,785 INFO L290 TraceCheckUtils]: 53: Hoare triple {7753#(<= ~count_int~0 0)} goto; {7753#(<= ~count_int~0 0)} is VALID [2022-02-21 03:18:51,786 INFO L290 TraceCheckUtils]: 54: Hoare triple {7753#(<= ~count_int~0 0)} goto; {7753#(<= ~count_int~0 0)} is VALID [2022-02-21 03:18:51,786 INFO L290 TraceCheckUtils]: 55: Hoare triple {7753#(<= ~count_int~0 0)} call main_#t~mem144#1.base, main_#t~mem144#1.offset := read~$Pointer$(main_~user~0#1.base, 8 + main_~user~0#1.offset, 4);call main_#t~mem145#1 := read~int(main_#t~mem144#1.base, 12 + main_#t~mem144#1.offset, 4); {7753#(<= ~count_int~0 0)} is VALID [2022-02-21 03:18:51,787 INFO L272 TraceCheckUtils]: 56: Hoare triple {7753#(<= ~count_int~0 0)} call test_int((if main_#t~mem145#1 % 4294967296 % 4294967296 <= 2147483647 then main_#t~mem145#1 % 4294967296 % 4294967296 else main_#t~mem145#1 % 4294967296 % 4294967296 - 4294967296)); {7753#(<= ~count_int~0 0)} is VALID [2022-02-21 03:18:51,791 INFO L290 TraceCheckUtils]: 57: Hoare triple {7753#(<= ~count_int~0 0)} ~a := #in~a;#t~post3 := ~count_int~0; {7925#(<= |test_int_#t~post3| 0)} is VALID [2022-02-21 03:18:51,792 INFO L290 TraceCheckUtils]: 58: Hoare triple {7925#(<= |test_int_#t~post3| 0)} assume !(1 + #t~post3 <= 2147483647); {7749#false} is VALID [2022-02-21 03:18:51,792 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:18:51,792 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-21 03:18:51,793 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 03:18:51,793 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [279716656] [2022-02-21 03:18:51,793 WARN L317 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-02-21 03:18:51,793 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [220109736] [2022-02-21 03:18:51,793 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [220109736] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-21 03:18:51,793 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-21 03:18:51,793 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-02-21 03:18:51,793 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1613995546] [2022-02-21 03:18:51,793 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-21 03:18:51,794 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 19.333333333333332) internal successors, (58), 3 states have internal predecessors, (58), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 59 [2022-02-21 03:18:51,794 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-21 03:18:51,794 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 4 states, 3 states have (on average 19.333333333333332) internal successors, (58), 3 states have internal predecessors, (58), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:18:51,842 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 59 edges. 59 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:18:51,843 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-02-21 03:18:51,843 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 03:18:51,843 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-02-21 03:18:51,843 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-02-21 03:18:51,844 INFO L87 Difference]: Start difference. First operand 246 states and 324 transitions. Second operand has 4 states, 3 states have (on average 19.333333333333332) internal successors, (58), 3 states have internal predecessors, (58), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:18:52,904 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:18:52,904 INFO L93 Difference]: Finished difference Result 377 states and 506 transitions. [2022-02-21 03:18:52,904 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-02-21 03:18:52,904 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 19.333333333333332) internal successors, (58), 3 states have internal predecessors, (58), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 59 [2022-02-21 03:18:52,905 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-21 03:18:52,905 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 3 states have (on average 19.333333333333332) internal successors, (58), 3 states have internal predecessors, (58), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:18:52,909 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 494 transitions. [2022-02-21 03:18:52,909 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 3 states have (on average 19.333333333333332) internal successors, (58), 3 states have internal predecessors, (58), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:18:52,915 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 494 transitions. [2022-02-21 03:18:52,915 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 494 transitions. [2022-02-21 03:18:53,377 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 494 edges. 494 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:18:53,387 INFO L225 Difference]: With dead ends: 377 [2022-02-21 03:18:53,387 INFO L226 Difference]: Without dead ends: 376 [2022-02-21 03:18:53,387 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 56 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:18:53,388 INFO L933 BasicCegarLoop]: 313 mSDtfsCounter, 95 mSDsluCounter, 606 mSDsCounter, 0 mSdLazyCounter, 53 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 110 SdHoareTripleChecker+Valid, 919 SdHoareTripleChecker+Invalid, 55 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 53 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-21 03:18:53,389 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [110 Valid, 919 Invalid, 55 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 53 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-21 03:18:53,389 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 376 states. [2022-02-21 03:18:53,441 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 376 to 343. [2022-02-21 03:18:53,441 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 03:18:53,442 INFO L82 GeneralOperation]: Start isEquivalent. First operand 376 states. Second operand has 343 states, 307 states have (on average 1.283387622149837) internal successors, (394), 329 states have internal predecessors, (394), 24 states have call successors, (24), 5 states have call predecessors, (24), 4 states have return successors, (24), 9 states have call predecessors, (24), 24 states have call successors, (24) [2022-02-21 03:18:53,443 INFO L74 IsIncluded]: Start isIncluded. First operand 376 states. Second operand has 343 states, 307 states have (on average 1.283387622149837) internal successors, (394), 329 states have internal predecessors, (394), 24 states have call successors, (24), 5 states have call predecessors, (24), 4 states have return successors, (24), 9 states have call predecessors, (24), 24 states have call successors, (24) [2022-02-21 03:18:53,444 INFO L87 Difference]: Start difference. First operand 376 states. Second operand has 343 states, 307 states have (on average 1.283387622149837) internal successors, (394), 329 states have internal predecessors, (394), 24 states have call successors, (24), 5 states have call predecessors, (24), 4 states have return successors, (24), 9 states have call predecessors, (24), 24 states have call successors, (24) [2022-02-21 03:18:53,454 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:18:53,454 INFO L93 Difference]: Finished difference Result 376 states and 505 transitions. [2022-02-21 03:18:53,454 INFO L276 IsEmpty]: Start isEmpty. Operand 376 states and 505 transitions. [2022-02-21 03:18:53,455 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:18:53,455 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:18:53,456 INFO L74 IsIncluded]: Start isIncluded. First operand has 343 states, 307 states have (on average 1.283387622149837) internal successors, (394), 329 states have internal predecessors, (394), 24 states have call successors, (24), 5 states have call predecessors, (24), 4 states have return successors, (24), 9 states have call predecessors, (24), 24 states have call successors, (24) Second operand 376 states. [2022-02-21 03:18:53,457 INFO L87 Difference]: Start difference. First operand has 343 states, 307 states have (on average 1.283387622149837) internal successors, (394), 329 states have internal predecessors, (394), 24 states have call successors, (24), 5 states have call predecessors, (24), 4 states have return successors, (24), 9 states have call predecessors, (24), 24 states have call successors, (24) Second operand 376 states. [2022-02-21 03:18:53,467 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:18:53,467 INFO L93 Difference]: Finished difference Result 376 states and 505 transitions. [2022-02-21 03:18:53,467 INFO L276 IsEmpty]: Start isEmpty. Operand 376 states and 505 transitions. [2022-02-21 03:18:53,468 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:18:53,468 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:18:53,468 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 03:18:53,468 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 03:18:53,469 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 343 states, 307 states have (on average 1.283387622149837) internal successors, (394), 329 states have internal predecessors, (394), 24 states have call successors, (24), 5 states have call predecessors, (24), 4 states have return successors, (24), 9 states have call predecessors, (24), 24 states have call successors, (24) [2022-02-21 03:18:53,477 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 343 states to 343 states and 442 transitions. [2022-02-21 03:18:53,478 INFO L78 Accepts]: Start accepts. Automaton has 343 states and 442 transitions. Word has length 59 [2022-02-21 03:18:53,478 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-21 03:18:53,478 INFO L470 AbstractCegarLoop]: Abstraction has 343 states and 442 transitions. [2022-02-21 03:18:53,478 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 19.333333333333332) internal successors, (58), 3 states have internal predecessors, (58), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:18:53,478 INFO L276 IsEmpty]: Start isEmpty. Operand 343 states and 442 transitions. [2022-02-21 03:18:53,478 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2022-02-21 03:18:53,479 INFO L506 BasicCegarLoop]: Found error trace [2022-02-21 03:18:53,479 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] [2022-02-21 03:18:53,510 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-02-21 03:18:53,706 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-21 03:18:53,706 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting test_intErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [test_intErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, test_intErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2022-02-21 03:18:53,706 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:18:53,706 INFO L85 PathProgramCache]: Analyzing trace with hash 209440015, now seen corresponding path program 1 times [2022-02-21 03:18:53,707 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:18:53,707 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1722004605] [2022-02-21 03:18:53,707 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:18:53,707 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:18:53,815 ERROR L252 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-02-21 03:18:53,815 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [518707566] [2022-02-21 03:18:53,815 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:18:53,815 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-21 03:18:53,816 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:18:53,817 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:18:53,818 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:18:54,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:18:54,527 INFO L263 TraceCheckSpWp]: Trace formula consists of 1548 conjuncts, 5 conjunts are in the unsatisfiable core [2022-02-21 03:18:54,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:18:54,566 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 03:18:54,833 INFO L290 TraceCheckUtils]: 0: Hoare triple {9564#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(21, 2);~count_int~0 := 0; {9569#(<= 0 ~count_int~0)} is VALID [2022-02-21 03:18:54,835 INFO L290 TraceCheckUtils]: 1: Hoare triple {9569#(<= 0 ~count_int~0)} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc8#1.base, main_#t~malloc8#1.offset, main_#t~mem9#1, main_#t~mem10#1, main_#t~mem11#1, main_#t~mem13#1, main_#t~mem12#1, main_#t~mem14#1, main_#t~mem15#1, main_#t~mem17#1, main_#t~mem16#1, main_#t~mem18#1, main_#t~mem19#1, main_#t~mem21#1, main_#t~mem20#1, main_#t~mem22#1, main_#t~mem23#1, main_#t~switch24#1, main_#t~mem25#1, main_#t~mem26#1, main_#t~mem27#1, main_#t~mem28#1, main_#t~mem29#1, main_#t~mem30#1, main_#t~mem31#1, main_#t~mem32#1, main_#t~mem33#1, main_#t~mem34#1, main_#t~mem35#1, main_~_hj_i~0#1, main_~_hj_j~0#1, main_~_hj_k~0#1, main_~_hj_key~0#1.base, main_~_hj_key~0#1.offset, main_#t~malloc36#1.base, main_#t~malloc36#1.offset, main_#t~mem37#1.base, main_#t~mem37#1.offset, main_#t~mem38#1.base, main_#t~mem38#1.offset, main_#t~memset~res39#1.base, main_#t~memset~res39#1.offset, main_#t~mem40#1.base, main_#t~mem40#1.offset, main_#t~mem41#1.base, main_#t~mem41#1.offset, main_#t~mem42#1.base, main_#t~mem42#1.offset, main_#t~mem43#1.base, main_#t~mem43#1.offset, main_#t~mem44#1.base, main_#t~mem44#1.offset, main_#t~malloc45#1.base, main_#t~malloc45#1.offset, main_#t~mem46#1.base, main_#t~mem46#1.offset, main_#t~mem47#1.base, main_#t~mem47#1.offset, main_#t~mem48#1.base, main_#t~mem48#1.offset, main_#t~mem49#1.base, main_#t~mem49#1.offset, main_#t~mem50#1.base, main_#t~mem50#1.offset, main_#t~mem51#1.base, main_#t~mem51#1.offset, main_#t~memset~res52#1.base, main_#t~memset~res52#1.offset, main_#t~mem53#1.base, main_#t~mem53#1.offset, main_#t~mem54#1.base, main_#t~mem54#1.offset, main_#t~mem55#1.base, main_#t~mem55#1.offset, main_#t~mem56#1.base, main_#t~mem56#1.offset, main_#t~mem57#1, main_#t~mem58#1.base, main_#t~mem58#1.offset, main_#t~mem59#1.base, main_#t~mem59#1.offset, main_#t~mem60#1.base, main_#t~mem60#1.offset, main_#t~mem61#1.base, main_#t~mem61#1.offset, main_#t~mem62#1, main_#t~post63#1, main_#t~mem64#1.base, main_#t~mem64#1.offset, main_#t~mem65#1, main_#t~mem66#1.base, main_#t~mem66#1.offset, main_#t~mem67#1.base, main_#t~mem67#1.offset, main_#t~mem68#1, main_#t~post69#1, main_#t~mem70#1.base, main_#t~mem70#1.offset, main_#t~mem71#1.base, main_#t~mem71#1.offset, main_#t~mem72#1.base, main_#t~mem72#1.offset, main_#t~mem74#1, main_#t~mem73#1, main_#t~mem75#1.base, main_#t~mem75#1.offset, main_#t~mem76#1, main_#t~short77#1, main_#t~mem78#1.base, main_#t~mem78#1.offset, main_#t~mem79#1, main_#t~malloc80#1.base, main_#t~malloc80#1.offset, main_#t~mem81#1.base, main_#t~mem81#1.offset, main_#t~mem82#1.base, main_#t~mem82#1.offset, main_#t~mem83#1.base, main_#t~mem83#1.offset, main_#t~mem84#1, main_#t~memset~res85#1.base, main_#t~memset~res85#1.offset, main_#t~mem86#1.base, main_#t~mem86#1.offset, main_#t~mem87#1.base, main_#t~mem87#1.offset, main_#t~mem90#1, main_#t~mem88#1.base, main_#t~mem88#1.offset, main_#t~mem89#1, main_#t~mem91#1.base, main_#t~mem91#1.offset, main_#t~mem94#1, main_#t~mem92#1.base, main_#t~mem92#1.offset, main_#t~mem93#1, main_#t~ite95#1, main_#t~mem96#1.base, main_#t~mem96#1.offset, main_#t~mem100#1.base, main_#t~mem100#1.offset, main_#t~mem101#1.base, main_#t~mem101#1.offset, main_#t~mem102#1.base, main_#t~mem102#1.offset, main_#t~mem103#1.base, main_#t~mem103#1.offset, main_#t~mem106#1, main_#t~mem104#1.base, main_#t~mem104#1.offset, main_#t~mem105#1, main_#t~mem107#1.base, main_#t~mem107#1.offset, main_#t~mem108#1, main_#t~pre109#1, main_#t~mem110#1.base, main_#t~mem110#1.offset, main_#t~mem111#1, main_#t~mem112#1.base, main_#t~mem112#1.offset, main_#t~mem113#1, main_#t~post114#1, main_#t~mem118#1, main_#t~mem116#1, main_#t~mem115#1.base, main_#t~mem115#1.offset, main_#t~mem117#1, main_#t~mem119#1, main_#t~post120#1, main_#t~mem121#1.base, main_#t~mem121#1.offset, main_#t~mem122#1.base, main_#t~mem122#1.offset, main_#t~mem123#1.base, main_#t~mem123#1.offset, main_#t~post97#1, main_#t~mem98#1.base, main_#t~mem98#1.offset, main_#t~mem99#1, main_#t~mem124#1.base, main_#t~mem124#1.offset, main_#t~mem125#1.base, main_#t~mem125#1.offset, main_#t~mem126#1.base, main_#t~mem126#1.offset, main_#t~mem127#1, main_#t~mem128#1.base, main_#t~mem128#1.offset, main_#t~mem129#1, main_#t~post130#1, main_#t~mem131#1.base, main_#t~mem131#1.offset, main_#t~mem132#1.base, main_#t~mem132#1.offset, main_#t~mem133#1.base, main_#t~mem133#1.offset, main_#t~mem134#1.base, main_#t~mem134#1.offset, main_#t~mem137#1, main_#t~mem135#1.base, main_#t~mem135#1.offset, main_#t~mem136#1, main_#t~ite140#1, main_#t~mem138#1.base, main_#t~mem138#1.offset, main_#t~mem139#1, main_#t~mem141#1.base, main_#t~mem141#1.offset, main_#t~mem142#1, main_#t~mem143#1.base, main_#t~mem143#1.offset, main_~_he_bkt~0#1, main_~_he_bkt_i~0#1, main_~_he_thh~0#1.base, main_~_he_thh~0#1.offset, main_~_he_hh_nxt~0#1.base, main_~_he_hh_nxt~0#1.offset, main_~#_he_new_buckets~0#1.base, main_~#_he_new_buckets~0#1.offset, main_~_he_newbkt~0#1.base, main_~_he_newbkt~0#1.offset, main_~_ha_head~0#1.base, main_~_ha_head~0#1.offset, main_~_ha_bkt~0#1, main_~_ha_hashv~0#1, main_#t~mem144#1.base, main_#t~mem144#1.offset, main_#t~mem145#1, main_#t~mem5#1, main_#t~post6#1, main_#t~mem7#1, main_#t~mem149#1, main_#t~mem148#1, main_#t~mem150#1, main_#t~mem151#1, main_#t~mem153#1, main_#t~mem152#1, main_#t~mem154#1, main_#t~mem155#1, main_#t~mem157#1, main_#t~mem156#1, main_#t~mem158#1, main_#t~mem159#1, main_#t~switch160#1, main_#t~mem161#1, main_#t~mem162#1, main_#t~mem163#1, main_#t~mem164#1, main_#t~mem165#1, main_#t~mem166#1, main_#t~mem167#1, main_#t~mem168#1, main_#t~mem169#1, main_#t~mem170#1, main_#t~mem171#1, main_~_hj_i~1#1, main_~_hj_j~1#1, main_~_hj_k~1#1, main_~_hj_key~1#1.base, main_~_hj_key~1#1.offset, main_#t~mem172#1.base, main_#t~mem172#1.offset, main_#t~mem173#1, main_#t~mem174#1.base, main_#t~mem174#1.offset, main_#t~mem175#1.base, main_#t~mem175#1.offset, main_#t~mem176#1.base, main_#t~mem176#1.offset, main_#t~mem177#1.base, main_#t~mem177#1.offset, main_#t~mem178#1.base, main_#t~mem178#1.offset, main_#t~mem179#1.base, main_#t~mem179#1.offset, main_#t~mem180#1.base, main_#t~mem180#1.offset, main_#t~mem181#1, main_#t~mem182#1, main_#t~mem183#1, main_#t~short184#1, main_#t~mem185#1.base, main_#t~mem185#1.offset, main_#t~ret186#1, main_#t~mem187#1.base, main_#t~mem187#1.offset, main_#t~mem188#1.base, main_#t~mem188#1.offset, main_#t~mem189#1.base, main_#t~mem189#1.offset, main_#t~mem190#1, main_~_hf_bkt~0#1, main_~_hf_hashv~0#1, main_#t~mem191#1.base, main_#t~mem191#1.offset, main_#t~mem192#1.base, main_#t~mem192#1.offset, main_#t~short193#1, main_#t~mem194#1.base, main_#t~mem194#1.offset, main_#t~mem195#1.base, main_#t~mem195#1.offset, main_#t~mem196#1.base, main_#t~mem196#1.offset, main_#t~mem197#1.base, main_#t~mem197#1.offset, main_#t~mem198#1.base, main_#t~mem198#1.offset, main_#t~mem199#1.base, main_#t~mem199#1.offset, main_#t~mem200#1.base, main_#t~mem200#1.offset, main_#t~mem201#1.base, main_#t~mem201#1.offset, main_#t~mem202#1, main_#t~mem203#1.base, main_#t~mem203#1.offset, main_#t~mem204#1.base, main_#t~mem204#1.offset, main_#t~mem205#1.base, main_#t~mem205#1.offset, main_#t~mem206#1, main_#t~mem207#1.base, main_#t~mem207#1.offset, main_#t~mem208#1.base, main_#t~mem208#1.offset, main_#t~mem209#1.base, main_#t~mem209#1.offset, main_#t~mem210#1.base, main_#t~mem210#1.offset, main_#t~mem211#1.base, main_#t~mem211#1.offset, main_#t~mem212#1, main_#t~mem213#1.base, main_#t~mem213#1.offset, main_#t~mem216#1, main_#t~mem214#1.base, main_#t~mem214#1.offset, main_#t~mem215#1, main_#t~mem217#1.base, main_#t~mem217#1.offset, main_#t~mem218#1.base, main_#t~mem218#1.offset, main_#t~mem219#1, main_#t~post220#1, main_#t~mem221#1.base, main_#t~mem221#1.offset, main_#t~mem222#1.base, main_#t~mem222#1.offset, main_#t~mem223#1.base, main_#t~mem223#1.offset, main_#t~mem224#1.base, main_#t~mem224#1.offset, main_#t~mem225#1.base, main_#t~mem225#1.offset, main_#t~mem226#1.base, main_#t~mem226#1.offset, main_#t~mem227#1.base, main_#t~mem227#1.offset, main_#t~mem228#1.base, main_#t~mem228#1.offset, main_~_hd_head~0#1.base, main_~_hd_head~0#1.offset, main_#t~mem229#1.base, main_#t~mem229#1.offset, main_#t~mem230#1, main_#t~post231#1, main_~_hd_bkt~0#1, main_~_hd_hh_del~0#1.base, main_~_hd_hh_del~0#1.offset, main_#t~mem232#1.base, main_#t~mem232#1.offset, main_#t~mem233#1, main_#t~mem146#1, main_#t~mem147#1, main_~#i~0#1.base, main_~#i~0#1.offset, main_~user~0#1.base, main_~user~0#1.offset, main_~tmp~0#1.base, main_~tmp~0#1.offset, main_~users~0#1.base, main_~users~0#1.offset;call main_~#i~0#1.base, main_~#i~0#1.offset := #Ultimate.allocOnStack(4);havoc main_~user~0#1.base, main_~user~0#1.offset;havoc main_~tmp~0#1.base, main_~tmp~0#1.offset;main_~users~0#1.base, main_~users~0#1.offset := 0, 0;call write~int(0, main_~#i~0#1.base, main_~#i~0#1.offset, 4); {9569#(<= 0 ~count_int~0)} is VALID [2022-02-21 03:18:54,836 INFO L290 TraceCheckUtils]: 2: Hoare triple {9569#(<= 0 ~count_int~0)} call main_#t~mem7#1 := read~int(main_~#i~0#1.base, main_~#i~0#1.offset, 4); {9569#(<= 0 ~count_int~0)} is VALID [2022-02-21 03:18:54,838 INFO L290 TraceCheckUtils]: 3: Hoare triple {9569#(<= 0 ~count_int~0)} assume !!(main_#t~mem7#1 < 10);havoc main_#t~mem7#1;call main_#t~malloc8#1.base, main_#t~malloc8#1.offset := #Ultimate.allocOnHeap(40);main_~user~0#1.base, main_~user~0#1.offset := main_#t~malloc8#1.base, main_#t~malloc8#1.offset;havoc main_#t~malloc8#1.base, main_#t~malloc8#1.offset; {9569#(<= 0 ~count_int~0)} is VALID [2022-02-21 03:18:54,839 INFO L290 TraceCheckUtils]: 4: Hoare triple {9569#(<= 0 ~count_int~0)} assume !(main_~user~0#1.base == 0 && main_~user~0#1.offset == 0); {9569#(<= 0 ~count_int~0)} is VALID [2022-02-21 03:18:54,840 INFO L290 TraceCheckUtils]: 5: Hoare triple {9569#(<= 0 ~count_int~0)} call main_#t~mem9#1 := read~int(main_~#i~0#1.base, main_~#i~0#1.offset, 4);call write~int(main_#t~mem9#1, main_~user~0#1.base, main_~user~0#1.offset, 4);havoc main_#t~mem9#1;call main_#t~mem10#1 := read~int(main_~#i~0#1.base, main_~#i~0#1.offset, 4);call main_#t~mem11#1 := read~int(main_~#i~0#1.base, main_~#i~0#1.offset, 4); {9569#(<= 0 ~count_int~0)} is VALID [2022-02-21 03:18:54,840 INFO L290 TraceCheckUtils]: 6: Hoare triple {9569#(<= 0 ~count_int~0)} assume main_#t~mem10#1 * main_#t~mem11#1 <= 2147483647; {9569#(<= 0 ~count_int~0)} is VALID [2022-02-21 03:18:54,840 INFO L290 TraceCheckUtils]: 7: Hoare triple {9569#(<= 0 ~count_int~0)} assume main_#t~mem10#1 * main_#t~mem11#1 >= -2147483648;call write~int(main_#t~mem10#1 * main_#t~mem11#1, main_~user~0#1.base, 4 + main_~user~0#1.offset, 4);havoc main_#t~mem10#1;havoc main_#t~mem11#1; {9569#(<= 0 ~count_int~0)} is VALID [2022-02-21 03:18:54,841 INFO L290 TraceCheckUtils]: 8: Hoare triple {9569#(<= 0 ~count_int~0)} havoc main_~_ha_hashv~0#1; {9569#(<= 0 ~count_int~0)} is VALID [2022-02-21 03:18:54,841 INFO L290 TraceCheckUtils]: 9: Hoare triple {9569#(<= 0 ~count_int~0)} goto; {9569#(<= 0 ~count_int~0)} is VALID [2022-02-21 03:18:54,842 INFO L290 TraceCheckUtils]: 10: Hoare triple {9569#(<= 0 ~count_int~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; {9569#(<= 0 ~count_int~0)} is VALID [2022-02-21 03:18:54,842 INFO L290 TraceCheckUtils]: 11: Hoare triple {9569#(<= 0 ~count_int~0)} assume !(main_~_hj_k~0#1 % 4294967296 >= 12); {9569#(<= 0 ~count_int~0)} is VALID [2022-02-21 03:18:54,842 INFO L290 TraceCheckUtils]: 12: Hoare triple {9569#(<= 0 ~count_int~0)} main_~_ha_hashv~0#1 := 4 + main_~_ha_hashv~0#1;main_#t~switch24#1 := 11 == main_~_hj_k~0#1; {9569#(<= 0 ~count_int~0)} is VALID [2022-02-21 03:18:54,843 INFO L290 TraceCheckUtils]: 13: Hoare triple {9569#(<= 0 ~count_int~0)} assume !main_#t~switch24#1; {9569#(<= 0 ~count_int~0)} is VALID [2022-02-21 03:18:54,843 INFO L290 TraceCheckUtils]: 14: Hoare triple {9569#(<= 0 ~count_int~0)} main_#t~switch24#1 := main_#t~switch24#1 || 10 == main_~_hj_k~0#1; {9569#(<= 0 ~count_int~0)} is VALID [2022-02-21 03:18:54,844 INFO L290 TraceCheckUtils]: 15: Hoare triple {9569#(<= 0 ~count_int~0)} assume !main_#t~switch24#1; {9569#(<= 0 ~count_int~0)} is VALID [2022-02-21 03:18:54,844 INFO L290 TraceCheckUtils]: 16: Hoare triple {9569#(<= 0 ~count_int~0)} main_#t~switch24#1 := main_#t~switch24#1 || 9 == main_~_hj_k~0#1; {9569#(<= 0 ~count_int~0)} is VALID [2022-02-21 03:18:54,845 INFO L290 TraceCheckUtils]: 17: Hoare triple {9569#(<= 0 ~count_int~0)} assume !main_#t~switch24#1; {9569#(<= 0 ~count_int~0)} is VALID [2022-02-21 03:18:54,845 INFO L290 TraceCheckUtils]: 18: Hoare triple {9569#(<= 0 ~count_int~0)} main_#t~switch24#1 := main_#t~switch24#1 || 8 == main_~_hj_k~0#1; {9569#(<= 0 ~count_int~0)} is VALID [2022-02-21 03:18:54,845 INFO L290 TraceCheckUtils]: 19: Hoare triple {9569#(<= 0 ~count_int~0)} assume !main_#t~switch24#1; {9569#(<= 0 ~count_int~0)} is VALID [2022-02-21 03:18:54,846 INFO L290 TraceCheckUtils]: 20: Hoare triple {9569#(<= 0 ~count_int~0)} main_#t~switch24#1 := main_#t~switch24#1 || 7 == main_~_hj_k~0#1; {9569#(<= 0 ~count_int~0)} is VALID [2022-02-21 03:18:54,846 INFO L290 TraceCheckUtils]: 21: Hoare triple {9569#(<= 0 ~count_int~0)} assume !main_#t~switch24#1; {9569#(<= 0 ~count_int~0)} is VALID [2022-02-21 03:18:54,846 INFO L290 TraceCheckUtils]: 22: Hoare triple {9569#(<= 0 ~count_int~0)} main_#t~switch24#1 := main_#t~switch24#1 || 6 == main_~_hj_k~0#1; {9569#(<= 0 ~count_int~0)} is VALID [2022-02-21 03:18:54,847 INFO L290 TraceCheckUtils]: 23: Hoare triple {9569#(<= 0 ~count_int~0)} assume !main_#t~switch24#1; {9569#(<= 0 ~count_int~0)} is VALID [2022-02-21 03:18:54,847 INFO L290 TraceCheckUtils]: 24: Hoare triple {9569#(<= 0 ~count_int~0)} main_#t~switch24#1 := main_#t~switch24#1 || 5 == main_~_hj_k~0#1; {9569#(<= 0 ~count_int~0)} is VALID [2022-02-21 03:18:54,847 INFO L290 TraceCheckUtils]: 25: Hoare triple {9569#(<= 0 ~count_int~0)} assume !main_#t~switch24#1; {9569#(<= 0 ~count_int~0)} is VALID [2022-02-21 03:18:54,848 INFO L290 TraceCheckUtils]: 26: Hoare triple {9569#(<= 0 ~count_int~0)} main_#t~switch24#1 := main_#t~switch24#1 || 4 == main_~_hj_k~0#1; {9569#(<= 0 ~count_int~0)} is VALID [2022-02-21 03:18:54,848 INFO L290 TraceCheckUtils]: 27: Hoare triple {9569#(<= 0 ~count_int~0)} assume main_#t~switch24#1;call main_#t~mem32#1 := read~int(main_~_hj_key~0#1.base, 3 + main_~_hj_key~0#1.offset, 1);main_~_hj_i~0#1 := main_~_hj_i~0#1 + 16777216 * (main_#t~mem32#1 % 256);havoc main_#t~mem32#1; {9569#(<= 0 ~count_int~0)} is VALID [2022-02-21 03:18:54,849 INFO L290 TraceCheckUtils]: 28: Hoare triple {9569#(<= 0 ~count_int~0)} main_#t~switch24#1 := main_#t~switch24#1 || 3 == main_~_hj_k~0#1; {9569#(<= 0 ~count_int~0)} is VALID [2022-02-21 03:18:54,849 INFO L290 TraceCheckUtils]: 29: Hoare triple {9569#(<= 0 ~count_int~0)} assume main_#t~switch24#1;call main_#t~mem33#1 := read~int(main_~_hj_key~0#1.base, 2 + main_~_hj_key~0#1.offset, 1);main_~_hj_i~0#1 := main_~_hj_i~0#1 + 65536 * (main_#t~mem33#1 % 256);havoc main_#t~mem33#1; {9569#(<= 0 ~count_int~0)} is VALID [2022-02-21 03:18:54,849 INFO L290 TraceCheckUtils]: 30: Hoare triple {9569#(<= 0 ~count_int~0)} main_#t~switch24#1 := main_#t~switch24#1 || 2 == main_~_hj_k~0#1; {9569#(<= 0 ~count_int~0)} is VALID [2022-02-21 03:18:54,849 INFO L290 TraceCheckUtils]: 31: Hoare triple {9569#(<= 0 ~count_int~0)} assume main_#t~switch24#1;call main_#t~mem34#1 := read~int(main_~_hj_key~0#1.base, 1 + main_~_hj_key~0#1.offset, 1);main_~_hj_i~0#1 := main_~_hj_i~0#1 + 256 * (main_#t~mem34#1 % 256);havoc main_#t~mem34#1; {9569#(<= 0 ~count_int~0)} is VALID [2022-02-21 03:18:54,850 INFO L290 TraceCheckUtils]: 32: Hoare triple {9569#(<= 0 ~count_int~0)} main_#t~switch24#1 := main_#t~switch24#1 || 1 == main_~_hj_k~0#1; {9569#(<= 0 ~count_int~0)} is VALID [2022-02-21 03:18:54,850 INFO L290 TraceCheckUtils]: 33: Hoare triple {9569#(<= 0 ~count_int~0)} assume main_#t~switch24#1;call main_#t~mem35#1 := read~int(main_~_hj_key~0#1.base, main_~_hj_key~0#1.offset, 1);main_~_hj_i~0#1 := main_~_hj_i~0#1 + main_#t~mem35#1 % 256;havoc main_#t~mem35#1; {9569#(<= 0 ~count_int~0)} is VALID [2022-02-21 03:18:54,850 INFO L290 TraceCheckUtils]: 34: Hoare triple {9569#(<= 0 ~count_int~0)} havoc main_#t~switch24#1; {9569#(<= 0 ~count_int~0)} is VALID [2022-02-21 03:18:54,851 INFO L290 TraceCheckUtils]: 35: Hoare triple {9569#(<= 0 ~count_int~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)))); {9569#(<= 0 ~count_int~0)} is VALID [2022-02-21 03:18:54,851 INFO L290 TraceCheckUtils]: 36: Hoare triple {9569#(<= 0 ~count_int~0)} goto; {9569#(<= 0 ~count_int~0)} is VALID [2022-02-21 03:18:54,851 INFO L290 TraceCheckUtils]: 37: Hoare triple {9569#(<= 0 ~count_int~0)} goto; {9569#(<= 0 ~count_int~0)} is VALID [2022-02-21 03:18:54,852 INFO L290 TraceCheckUtils]: 38: Hoare triple {9569#(<= 0 ~count_int~0)} goto; {9569#(<= 0 ~count_int~0)} is VALID [2022-02-21 03:18:54,852 INFO L290 TraceCheckUtils]: 39: Hoare triple {9569#(<= 0 ~count_int~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); {9569#(<= 0 ~count_int~0)} is VALID [2022-02-21 03:18:54,852 INFO L290 TraceCheckUtils]: 40: Hoare triple {9569#(<= 0 ~count_int~0)} assume !(main_~users~0#1.base == 0 && main_~users~0#1.offset == 0);call main_#t~mem53#1.base, main_#t~mem53#1.offset := read~$Pointer$(main_~users~0#1.base, 8 + main_~users~0#1.offset, 4);call write~$Pointer$(main_#t~mem53#1.base, main_#t~mem53#1.offset, main_~user~0#1.base, 8 + main_~user~0#1.offset, 4);havoc main_#t~mem53#1.base, main_#t~mem53#1.offset; {9569#(<= 0 ~count_int~0)} is VALID [2022-02-21 03:18:54,853 INFO L290 TraceCheckUtils]: 41: Hoare triple {9569#(<= 0 ~count_int~0)} call write~$Pointer$(0, 0, main_~user~0#1.base, 16 + main_~user~0#1.offset, 4);call main_#t~mem54#1.base, main_#t~mem54#1.offset := read~$Pointer$(main_~users~0#1.base, 8 + main_~users~0#1.offset, 4);call main_#t~mem55#1.base, main_#t~mem55#1.offset := read~$Pointer$(main_#t~mem54#1.base, 16 + main_#t~mem54#1.offset, 4);call main_#t~mem56#1.base, main_#t~mem56#1.offset := read~$Pointer$(main_~users~0#1.base, 8 + main_~users~0#1.offset, 4);call main_#t~mem57#1 := read~int(main_#t~mem56#1.base, 20 + main_#t~mem56#1.offset, 4);call write~$Pointer$(main_#t~mem55#1.base, main_#t~mem55#1.offset - main_#t~mem57#1, main_~user~0#1.base, 12 + main_~user~0#1.offset, 4);havoc main_#t~mem54#1.base, main_#t~mem54#1.offset;havoc main_#t~mem55#1.base, main_#t~mem55#1.offset;havoc main_#t~mem56#1.base, main_#t~mem56#1.offset;havoc main_#t~mem57#1;call main_#t~mem58#1.base, main_#t~mem58#1.offset := read~$Pointer$(main_~users~0#1.base, 8 + main_~users~0#1.offset, 4);call main_#t~mem59#1.base, main_#t~mem59#1.offset := read~$Pointer$(main_#t~mem58#1.base, 16 + main_#t~mem58#1.offset, 4);call write~$Pointer$(main_~user~0#1.base, main_~user~0#1.offset, main_#t~mem59#1.base, 8 + main_#t~mem59#1.offset, 4);havoc main_#t~mem58#1.base, main_#t~mem58#1.offset;havoc main_#t~mem59#1.base, main_#t~mem59#1.offset;call main_#t~mem60#1.base, main_#t~mem60#1.offset := read~$Pointer$(main_~users~0#1.base, 8 + main_~users~0#1.offset, 4);call write~$Pointer$(main_~user~0#1.base, 8 + main_~user~0#1.offset, main_#t~mem60#1.base, 16 + main_#t~mem60#1.offset, 4);havoc main_#t~mem60#1.base, main_#t~mem60#1.offset; {9569#(<= 0 ~count_int~0)} is VALID [2022-02-21 03:18:54,853 INFO L290 TraceCheckUtils]: 42: Hoare triple {9569#(<= 0 ~count_int~0)} goto; {9569#(<= 0 ~count_int~0)} is VALID [2022-02-21 03:18:54,853 INFO L290 TraceCheckUtils]: 43: Hoare triple {9569#(<= 0 ~count_int~0)} havoc main_~_ha_bkt~0#1;call main_#t~mem61#1.base, main_#t~mem61#1.offset := read~$Pointer$(main_~users~0#1.base, 8 + main_~users~0#1.offset, 4);call main_#t~mem62#1 := read~int(main_#t~mem61#1.base, 12 + main_#t~mem61#1.offset, 4);main_#t~post63#1 := main_#t~mem62#1;call write~int(1 + main_#t~post63#1, main_#t~mem61#1.base, 12 + main_#t~mem61#1.offset, 4);havoc main_#t~mem61#1.base, main_#t~mem61#1.offset;havoc main_#t~mem62#1;havoc main_#t~post63#1; {9569#(<= 0 ~count_int~0)} is VALID [2022-02-21 03:18:54,854 INFO L290 TraceCheckUtils]: 44: Hoare triple {9569#(<= 0 ~count_int~0)} call main_#t~mem64#1.base, main_#t~mem64#1.offset := read~$Pointer$(main_~users~0#1.base, 8 + main_~users~0#1.offset, 4);call main_#t~mem65#1 := read~int(main_#t~mem64#1.base, 4 + main_#t~mem64#1.offset, 4);main_~_ha_bkt~0#1 := (if 0 == main_~_ha_hashv~0#1 || 0 == main_#t~mem65#1 - 1 then 0 else (if 1 == main_#t~mem65#1 - 1 then (if 1 == main_~_ha_hashv~0#1 || 0 == main_~_ha_hashv~0#1 then main_~_ha_hashv~0#1 else (if main_~_ha_hashv~0#1 >= 0 then main_~_ha_hashv~0#1 % 2 else ~bitwiseAnd(main_~_ha_hashv~0#1, main_#t~mem65#1 - 1))) else (if 1 == main_~_ha_hashv~0#1 then (if 1 == main_#t~mem65#1 - 1 || 0 == main_#t~mem65#1 - 1 then main_#t~mem65#1 - 1 else (if main_#t~mem65#1 - 1 >= 0 then (main_#t~mem65#1 - 1) % 2 else ~bitwiseAnd(main_~_ha_hashv~0#1, main_#t~mem65#1 - 1))) else ~bitwiseAnd(main_~_ha_hashv~0#1, main_#t~mem65#1 - 1))));havoc main_#t~mem64#1.base, main_#t~mem64#1.offset;havoc main_#t~mem65#1; {9569#(<= 0 ~count_int~0)} is VALID [2022-02-21 03:18:54,854 INFO L290 TraceCheckUtils]: 45: Hoare triple {9569#(<= 0 ~count_int~0)} goto; {9569#(<= 0 ~count_int~0)} is VALID [2022-02-21 03:18:54,854 INFO L290 TraceCheckUtils]: 46: Hoare triple {9569#(<= 0 ~count_int~0)} call main_#t~mem66#1.base, main_#t~mem66#1.offset := read~$Pointer$(main_~users~0#1.base, 8 + main_~users~0#1.offset, 4);call main_#t~mem67#1.base, main_#t~mem67#1.offset := read~$Pointer$(main_#t~mem66#1.base, main_#t~mem66#1.offset, 4);main_~_ha_head~0#1.base, main_~_ha_head~0#1.offset := main_#t~mem67#1.base, main_#t~mem67#1.offset + 12 * (if main_~_ha_bkt~0#1 % 4294967296 % 4294967296 <= 2147483647 then main_~_ha_bkt~0#1 % 4294967296 % 4294967296 else main_~_ha_bkt~0#1 % 4294967296 % 4294967296 - 4294967296);havoc main_#t~mem66#1.base, main_#t~mem66#1.offset;havoc main_#t~mem67#1.base, main_#t~mem67#1.offset;call main_#t~mem68#1 := read~int(main_~_ha_head~0#1.base, 4 + main_~_ha_head~0#1.offset, 4);main_#t~post69#1 := main_#t~mem68#1;call write~int(1 + main_#t~post69#1, main_~_ha_head~0#1.base, 4 + main_~_ha_head~0#1.offset, 4);havoc main_#t~mem68#1;havoc main_#t~post69#1;call main_#t~mem70#1.base, main_#t~mem70#1.offset := read~$Pointer$(main_~_ha_head~0#1.base, main_~_ha_head~0#1.offset, 4);call write~$Pointer$(main_#t~mem70#1.base, main_#t~mem70#1.offset, main_~user~0#1.base, 24 + main_~user~0#1.offset, 4);havoc main_#t~mem70#1.base, main_#t~mem70#1.offset;call write~$Pointer$(0, 0, main_~user~0#1.base, 20 + main_~user~0#1.offset, 4);call main_#t~mem71#1.base, main_#t~mem71#1.offset := read~$Pointer$(main_~_ha_head~0#1.base, main_~_ha_head~0#1.offset, 4); {9569#(<= 0 ~count_int~0)} is VALID [2022-02-21 03:18:54,855 INFO L290 TraceCheckUtils]: 47: Hoare triple {9569#(<= 0 ~count_int~0)} assume main_#t~mem71#1.base != 0 || main_#t~mem71#1.offset != 0;havoc main_#t~mem71#1.base, main_#t~mem71#1.offset;call main_#t~mem72#1.base, main_#t~mem72#1.offset := read~$Pointer$(main_~_ha_head~0#1.base, main_~_ha_head~0#1.offset, 4);call write~$Pointer$(main_~user~0#1.base, 8 + main_~user~0#1.offset, main_#t~mem72#1.base, 12 + main_#t~mem72#1.offset, 4);havoc main_#t~mem72#1.base, main_#t~mem72#1.offset; {9569#(<= 0 ~count_int~0)} is VALID [2022-02-21 03:18:54,855 INFO L290 TraceCheckUtils]: 48: Hoare triple {9569#(<= 0 ~count_int~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~mem74#1 := read~int(main_~_ha_head~0#1.base, 4 + main_~_ha_head~0#1.offset, 4);call main_#t~mem73#1 := read~int(main_~_ha_head~0#1.base, 8 + main_~_ha_head~0#1.offset, 4);main_#t~short77#1 := main_#t~mem74#1 % 4294967296 >= 10 * (1 + main_#t~mem73#1) % 4294967296; {9569#(<= 0 ~count_int~0)} is VALID [2022-02-21 03:18:54,855 INFO L290 TraceCheckUtils]: 49: Hoare triple {9569#(<= 0 ~count_int~0)} assume main_#t~short77#1;call main_#t~mem75#1.base, main_#t~mem75#1.offset := read~$Pointer$(main_~user~0#1.base, 8 + main_~user~0#1.offset, 4);call main_#t~mem76#1 := read~int(main_#t~mem75#1.base, 36 + main_#t~mem75#1.offset, 4);main_#t~short77#1 := 0 == main_#t~mem76#1 % 4294967296; {9569#(<= 0 ~count_int~0)} is VALID [2022-02-21 03:18:54,855 INFO L290 TraceCheckUtils]: 50: Hoare triple {9569#(<= 0 ~count_int~0)} assume !main_#t~short77#1;havoc main_#t~mem74#1;havoc main_#t~mem73#1;havoc main_#t~mem75#1.base, main_#t~mem75#1.offset;havoc main_#t~mem76#1;havoc main_#t~short77#1; {9569#(<= 0 ~count_int~0)} is VALID [2022-02-21 03:18:54,856 INFO L290 TraceCheckUtils]: 51: Hoare triple {9569#(<= 0 ~count_int~0)} goto; {9569#(<= 0 ~count_int~0)} is VALID [2022-02-21 03:18:54,856 INFO L290 TraceCheckUtils]: 52: Hoare triple {9569#(<= 0 ~count_int~0)} goto; {9569#(<= 0 ~count_int~0)} is VALID [2022-02-21 03:18:54,856 INFO L290 TraceCheckUtils]: 53: Hoare triple {9569#(<= 0 ~count_int~0)} goto; {9569#(<= 0 ~count_int~0)} is VALID [2022-02-21 03:18:54,857 INFO L290 TraceCheckUtils]: 54: Hoare triple {9569#(<= 0 ~count_int~0)} goto; {9569#(<= 0 ~count_int~0)} is VALID [2022-02-21 03:18:54,857 INFO L290 TraceCheckUtils]: 55: Hoare triple {9569#(<= 0 ~count_int~0)} call main_#t~mem144#1.base, main_#t~mem144#1.offset := read~$Pointer$(main_~user~0#1.base, 8 + main_~user~0#1.offset, 4);call main_#t~mem145#1 := read~int(main_#t~mem144#1.base, 12 + main_#t~mem144#1.offset, 4); {9569#(<= 0 ~count_int~0)} is VALID [2022-02-21 03:18:54,858 INFO L272 TraceCheckUtils]: 56: Hoare triple {9569#(<= 0 ~count_int~0)} call test_int((if main_#t~mem145#1 % 4294967296 % 4294967296 <= 2147483647 then main_#t~mem145#1 % 4294967296 % 4294967296 else main_#t~mem145#1 % 4294967296 % 4294967296 - 4294967296)); {9569#(<= 0 ~count_int~0)} is VALID [2022-02-21 03:18:54,858 INFO L290 TraceCheckUtils]: 57: Hoare triple {9569#(<= 0 ~count_int~0)} ~a := #in~a;#t~post3 := ~count_int~0; {9741#(<= 0 |test_int_#t~post3|)} is VALID [2022-02-21 03:18:54,858 INFO L290 TraceCheckUtils]: 58: Hoare triple {9741#(<= 0 |test_int_#t~post3|)} assume 1 + #t~post3 <= 2147483647; {9741#(<= 0 |test_int_#t~post3|)} is VALID [2022-02-21 03:18:54,859 INFO L290 TraceCheckUtils]: 59: Hoare triple {9741#(<= 0 |test_int_#t~post3|)} assume !(1 + #t~post3 >= -2147483648); {9565#false} is VALID [2022-02-21 03:18:54,861 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:18:54,861 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-21 03:18:54,862 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 03:18:54,862 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1722004605] [2022-02-21 03:18:54,862 WARN L317 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-02-21 03:18:54,862 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [518707566] [2022-02-21 03:18:54,862 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [518707566] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-21 03:18:54,862 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-21 03:18:54,862 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-02-21 03:18:54,862 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1066799178] [2022-02-21 03:18:54,862 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-21 03:18:54,864 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 19.666666666666668) internal successors, (59), 3 states have internal predecessors, (59), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 60 [2022-02-21 03:18:54,864 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-21 03:18:54,864 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 4 states, 3 states have (on average 19.666666666666668) internal successors, (59), 3 states have internal predecessors, (59), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:18:54,924 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 60 edges. 60 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:18:54,925 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-02-21 03:18:54,925 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 03:18:54,925 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-02-21 03:18:54,925 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-02-21 03:18:54,925 INFO L87 Difference]: Start difference. First operand 343 states and 442 transitions. Second operand has 4 states, 3 states have (on average 19.666666666666668) internal successors, (59), 3 states have internal predecessors, (59), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:18:55,900 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:18:55,900 INFO L93 Difference]: Finished difference Result 343 states and 442 transitions. [2022-02-21 03:18:55,900 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-02-21 03:18:55,900 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 19.666666666666668) internal successors, (59), 3 states have internal predecessors, (59), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 60 [2022-02-21 03:18:55,901 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-21 03:18:55,901 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 3 states have (on average 19.666666666666668) internal successors, (59), 3 states have internal predecessors, (59), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:18:55,905 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 312 transitions. [2022-02-21 03:18:55,905 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 3 states have (on average 19.666666666666668) internal successors, (59), 3 states have internal predecessors, (59), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:18:55,908 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 312 transitions. [2022-02-21 03:18:55,908 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 312 transitions. [2022-02-21 03:18:56,214 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 312 edges. 312 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:18:56,222 INFO L225 Difference]: With dead ends: 343 [2022-02-21 03:18:56,222 INFO L226 Difference]: Without dead ends: 342 [2022-02-21 03:18:56,223 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 57 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:18:56,225 INFO L933 BasicCegarLoop]: 278 mSDtfsCounter, 269 mSDsluCounter, 261 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 269 SdHoareTripleChecker+Valid, 539 SdHoareTripleChecker+Invalid, 66 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-21 03:18:56,226 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [269 Valid, 539 Invalid, 66 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-21 03:18:56,228 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 342 states. [2022-02-21 03:18:56,348 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 342 to 342. [2022-02-21 03:18:56,348 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 03:18:56,349 INFO L82 GeneralOperation]: Start isEquivalent. First operand 342 states. Second operand has 342 states, 307 states have (on average 1.280130293159609) internal successors, (393), 328 states have internal predecessors, (393), 24 states have call successors, (24), 5 states have call predecessors, (24), 4 states have return successors, (24), 9 states have call predecessors, (24), 24 states have call successors, (24) [2022-02-21 03:18:56,351 INFO L74 IsIncluded]: Start isIncluded. First operand 342 states. Second operand has 342 states, 307 states have (on average 1.280130293159609) internal successors, (393), 328 states have internal predecessors, (393), 24 states have call successors, (24), 5 states have call predecessors, (24), 4 states have return successors, (24), 9 states have call predecessors, (24), 24 states have call successors, (24) [2022-02-21 03:18:56,352 INFO L87 Difference]: Start difference. First operand 342 states. Second operand has 342 states, 307 states have (on average 1.280130293159609) internal successors, (393), 328 states have internal predecessors, (393), 24 states have call successors, (24), 5 states have call predecessors, (24), 4 states have return successors, (24), 9 states have call predecessors, (24), 24 states have call successors, (24) [2022-02-21 03:18:56,361 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:18:56,361 INFO L93 Difference]: Finished difference Result 342 states and 441 transitions. [2022-02-21 03:18:56,361 INFO L276 IsEmpty]: Start isEmpty. Operand 342 states and 441 transitions. [2022-02-21 03:18:56,362 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:18:56,363 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:18:56,363 INFO L74 IsIncluded]: Start isIncluded. First operand has 342 states, 307 states have (on average 1.280130293159609) internal successors, (393), 328 states have internal predecessors, (393), 24 states have call successors, (24), 5 states have call predecessors, (24), 4 states have return successors, (24), 9 states have call predecessors, (24), 24 states have call successors, (24) Second operand 342 states. [2022-02-21 03:18:56,364 INFO L87 Difference]: Start difference. First operand has 342 states, 307 states have (on average 1.280130293159609) internal successors, (393), 328 states have internal predecessors, (393), 24 states have call successors, (24), 5 states have call predecessors, (24), 4 states have return successors, (24), 9 states have call predecessors, (24), 24 states have call successors, (24) Second operand 342 states. [2022-02-21 03:18:56,373 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:18:56,373 INFO L93 Difference]: Finished difference Result 342 states and 441 transitions. [2022-02-21 03:18:56,373 INFO L276 IsEmpty]: Start isEmpty. Operand 342 states and 441 transitions. [2022-02-21 03:18:56,374 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:18:56,374 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:18:56,374 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 03:18:56,374 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 03:18:56,375 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 342 states, 307 states have (on average 1.280130293159609) internal successors, (393), 328 states have internal predecessors, (393), 24 states have call successors, (24), 5 states have call predecessors, (24), 4 states have return successors, (24), 9 states have call predecessors, (24), 24 states have call successors, (24) [2022-02-21 03:18:56,385 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 342 states to 342 states and 441 transitions. [2022-02-21 03:18:56,385 INFO L78 Accepts]: Start accepts. Automaton has 342 states and 441 transitions. Word has length 60 [2022-02-21 03:18:56,386 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-21 03:18:56,386 INFO L470 AbstractCegarLoop]: Abstraction has 342 states and 441 transitions. [2022-02-21 03:18:56,386 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 19.666666666666668) internal successors, (59), 3 states have internal predecessors, (59), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:18:56,386 INFO L276 IsEmpty]: Start isEmpty. Operand 342 states and 441 transitions. [2022-02-21 03:18:56,389 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2022-02-21 03:18:56,389 INFO L506 BasicCegarLoop]: Found error trace [2022-02-21 03:18:56,389 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-21 03:18:56,421 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:18:56,615 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-21 03:18:56,616 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [test_intErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, test_intErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2022-02-21 03:18:56,616 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:18:56,616 INFO L85 PathProgramCache]: Analyzing trace with hash -258241977, now seen corresponding path program 1 times [2022-02-21 03:18:56,616 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:18:56,616 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [163669185] [2022-02-21 03:18:56,617 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:18:56,617 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:18:56,719 ERROR L252 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-02-21 03:18:56,719 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2129788298] [2022-02-21 03:18:56,719 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:18:56,720 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-21 03:18:56,720 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:18:56,726 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:18:56,728 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:18:57,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:18:57,436 INFO L263 TraceCheckSpWp]: Trace formula consists of 1570 conjuncts, 5 conjunts are in the unsatisfiable core [2022-02-21 03:18:57,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:18:57,496 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 03:18:57,865 INFO L290 TraceCheckUtils]: 0: Hoare triple {11264#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(21, 2);~count_int~0 := 0; {11264#true} is VALID [2022-02-21 03:18:57,866 INFO L290 TraceCheckUtils]: 1: Hoare triple {11264#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc8#1.base, main_#t~malloc8#1.offset, main_#t~mem9#1, main_#t~mem10#1, main_#t~mem11#1, main_#t~mem13#1, main_#t~mem12#1, main_#t~mem14#1, main_#t~mem15#1, main_#t~mem17#1, main_#t~mem16#1, main_#t~mem18#1, main_#t~mem19#1, main_#t~mem21#1, main_#t~mem20#1, main_#t~mem22#1, main_#t~mem23#1, main_#t~switch24#1, main_#t~mem25#1, main_#t~mem26#1, main_#t~mem27#1, main_#t~mem28#1, main_#t~mem29#1, main_#t~mem30#1, main_#t~mem31#1, main_#t~mem32#1, main_#t~mem33#1, main_#t~mem34#1, main_#t~mem35#1, main_~_hj_i~0#1, main_~_hj_j~0#1, main_~_hj_k~0#1, main_~_hj_key~0#1.base, main_~_hj_key~0#1.offset, main_#t~malloc36#1.base, main_#t~malloc36#1.offset, main_#t~mem37#1.base, main_#t~mem37#1.offset, main_#t~mem38#1.base, main_#t~mem38#1.offset, main_#t~memset~res39#1.base, main_#t~memset~res39#1.offset, main_#t~mem40#1.base, main_#t~mem40#1.offset, main_#t~mem41#1.base, main_#t~mem41#1.offset, main_#t~mem42#1.base, main_#t~mem42#1.offset, main_#t~mem43#1.base, main_#t~mem43#1.offset, main_#t~mem44#1.base, main_#t~mem44#1.offset, main_#t~malloc45#1.base, main_#t~malloc45#1.offset, main_#t~mem46#1.base, main_#t~mem46#1.offset, main_#t~mem47#1.base, main_#t~mem47#1.offset, main_#t~mem48#1.base, main_#t~mem48#1.offset, main_#t~mem49#1.base, main_#t~mem49#1.offset, main_#t~mem50#1.base, main_#t~mem50#1.offset, main_#t~mem51#1.base, main_#t~mem51#1.offset, main_#t~memset~res52#1.base, main_#t~memset~res52#1.offset, main_#t~mem53#1.base, main_#t~mem53#1.offset, main_#t~mem54#1.base, main_#t~mem54#1.offset, main_#t~mem55#1.base, main_#t~mem55#1.offset, main_#t~mem56#1.base, main_#t~mem56#1.offset, main_#t~mem57#1, main_#t~mem58#1.base, main_#t~mem58#1.offset, main_#t~mem59#1.base, main_#t~mem59#1.offset, main_#t~mem60#1.base, main_#t~mem60#1.offset, main_#t~mem61#1.base, main_#t~mem61#1.offset, main_#t~mem62#1, main_#t~post63#1, main_#t~mem64#1.base, main_#t~mem64#1.offset, main_#t~mem65#1, main_#t~mem66#1.base, main_#t~mem66#1.offset, main_#t~mem67#1.base, main_#t~mem67#1.offset, main_#t~mem68#1, main_#t~post69#1, main_#t~mem70#1.base, main_#t~mem70#1.offset, main_#t~mem71#1.base, main_#t~mem71#1.offset, main_#t~mem72#1.base, main_#t~mem72#1.offset, main_#t~mem74#1, main_#t~mem73#1, main_#t~mem75#1.base, main_#t~mem75#1.offset, main_#t~mem76#1, main_#t~short77#1, main_#t~mem78#1.base, main_#t~mem78#1.offset, main_#t~mem79#1, main_#t~malloc80#1.base, main_#t~malloc80#1.offset, main_#t~mem81#1.base, main_#t~mem81#1.offset, main_#t~mem82#1.base, main_#t~mem82#1.offset, main_#t~mem83#1.base, main_#t~mem83#1.offset, main_#t~mem84#1, main_#t~memset~res85#1.base, main_#t~memset~res85#1.offset, main_#t~mem86#1.base, main_#t~mem86#1.offset, main_#t~mem87#1.base, main_#t~mem87#1.offset, main_#t~mem90#1, main_#t~mem88#1.base, main_#t~mem88#1.offset, main_#t~mem89#1, main_#t~mem91#1.base, main_#t~mem91#1.offset, main_#t~mem94#1, main_#t~mem92#1.base, main_#t~mem92#1.offset, main_#t~mem93#1, main_#t~ite95#1, main_#t~mem96#1.base, main_#t~mem96#1.offset, main_#t~mem100#1.base, main_#t~mem100#1.offset, main_#t~mem101#1.base, main_#t~mem101#1.offset, main_#t~mem102#1.base, main_#t~mem102#1.offset, main_#t~mem103#1.base, main_#t~mem103#1.offset, main_#t~mem106#1, main_#t~mem104#1.base, main_#t~mem104#1.offset, main_#t~mem105#1, main_#t~mem107#1.base, main_#t~mem107#1.offset, main_#t~mem108#1, main_#t~pre109#1, main_#t~mem110#1.base, main_#t~mem110#1.offset, main_#t~mem111#1, main_#t~mem112#1.base, main_#t~mem112#1.offset, main_#t~mem113#1, main_#t~post114#1, main_#t~mem118#1, main_#t~mem116#1, main_#t~mem115#1.base, main_#t~mem115#1.offset, main_#t~mem117#1, main_#t~mem119#1, main_#t~post120#1, main_#t~mem121#1.base, main_#t~mem121#1.offset, main_#t~mem122#1.base, main_#t~mem122#1.offset, main_#t~mem123#1.base, main_#t~mem123#1.offset, main_#t~post97#1, main_#t~mem98#1.base, main_#t~mem98#1.offset, main_#t~mem99#1, main_#t~mem124#1.base, main_#t~mem124#1.offset, main_#t~mem125#1.base, main_#t~mem125#1.offset, main_#t~mem126#1.base, main_#t~mem126#1.offset, main_#t~mem127#1, main_#t~mem128#1.base, main_#t~mem128#1.offset, main_#t~mem129#1, main_#t~post130#1, main_#t~mem131#1.base, main_#t~mem131#1.offset, main_#t~mem132#1.base, main_#t~mem132#1.offset, main_#t~mem133#1.base, main_#t~mem133#1.offset, main_#t~mem134#1.base, main_#t~mem134#1.offset, main_#t~mem137#1, main_#t~mem135#1.base, main_#t~mem135#1.offset, main_#t~mem136#1, main_#t~ite140#1, main_#t~mem138#1.base, main_#t~mem138#1.offset, main_#t~mem139#1, main_#t~mem141#1.base, main_#t~mem141#1.offset, main_#t~mem142#1, main_#t~mem143#1.base, main_#t~mem143#1.offset, main_~_he_bkt~0#1, main_~_he_bkt_i~0#1, main_~_he_thh~0#1.base, main_~_he_thh~0#1.offset, main_~_he_hh_nxt~0#1.base, main_~_he_hh_nxt~0#1.offset, main_~#_he_new_buckets~0#1.base, main_~#_he_new_buckets~0#1.offset, main_~_he_newbkt~0#1.base, main_~_he_newbkt~0#1.offset, main_~_ha_head~0#1.base, main_~_ha_head~0#1.offset, main_~_ha_bkt~0#1, main_~_ha_hashv~0#1, main_#t~mem144#1.base, main_#t~mem144#1.offset, main_#t~mem145#1, main_#t~mem5#1, main_#t~post6#1, main_#t~mem7#1, main_#t~mem149#1, main_#t~mem148#1, main_#t~mem150#1, main_#t~mem151#1, main_#t~mem153#1, main_#t~mem152#1, main_#t~mem154#1, main_#t~mem155#1, main_#t~mem157#1, main_#t~mem156#1, main_#t~mem158#1, main_#t~mem159#1, main_#t~switch160#1, main_#t~mem161#1, main_#t~mem162#1, main_#t~mem163#1, main_#t~mem164#1, main_#t~mem165#1, main_#t~mem166#1, main_#t~mem167#1, main_#t~mem168#1, main_#t~mem169#1, main_#t~mem170#1, main_#t~mem171#1, main_~_hj_i~1#1, main_~_hj_j~1#1, main_~_hj_k~1#1, main_~_hj_key~1#1.base, main_~_hj_key~1#1.offset, main_#t~mem172#1.base, main_#t~mem172#1.offset, main_#t~mem173#1, main_#t~mem174#1.base, main_#t~mem174#1.offset, main_#t~mem175#1.base, main_#t~mem175#1.offset, main_#t~mem176#1.base, main_#t~mem176#1.offset, main_#t~mem177#1.base, main_#t~mem177#1.offset, main_#t~mem178#1.base, main_#t~mem178#1.offset, main_#t~mem179#1.base, main_#t~mem179#1.offset, main_#t~mem180#1.base, main_#t~mem180#1.offset, main_#t~mem181#1, main_#t~mem182#1, main_#t~mem183#1, main_#t~short184#1, main_#t~mem185#1.base, main_#t~mem185#1.offset, main_#t~ret186#1, main_#t~mem187#1.base, main_#t~mem187#1.offset, main_#t~mem188#1.base, main_#t~mem188#1.offset, main_#t~mem189#1.base, main_#t~mem189#1.offset, main_#t~mem190#1, main_~_hf_bkt~0#1, main_~_hf_hashv~0#1, main_#t~mem191#1.base, main_#t~mem191#1.offset, main_#t~mem192#1.base, main_#t~mem192#1.offset, main_#t~short193#1, main_#t~mem194#1.base, main_#t~mem194#1.offset, main_#t~mem195#1.base, main_#t~mem195#1.offset, main_#t~mem196#1.base, main_#t~mem196#1.offset, main_#t~mem197#1.base, main_#t~mem197#1.offset, main_#t~mem198#1.base, main_#t~mem198#1.offset, main_#t~mem199#1.base, main_#t~mem199#1.offset, main_#t~mem200#1.base, main_#t~mem200#1.offset, main_#t~mem201#1.base, main_#t~mem201#1.offset, main_#t~mem202#1, main_#t~mem203#1.base, main_#t~mem203#1.offset, main_#t~mem204#1.base, main_#t~mem204#1.offset, main_#t~mem205#1.base, main_#t~mem205#1.offset, main_#t~mem206#1, main_#t~mem207#1.base, main_#t~mem207#1.offset, main_#t~mem208#1.base, main_#t~mem208#1.offset, main_#t~mem209#1.base, main_#t~mem209#1.offset, main_#t~mem210#1.base, main_#t~mem210#1.offset, main_#t~mem211#1.base, main_#t~mem211#1.offset, main_#t~mem212#1, main_#t~mem213#1.base, main_#t~mem213#1.offset, main_#t~mem216#1, main_#t~mem214#1.base, main_#t~mem214#1.offset, main_#t~mem215#1, main_#t~mem217#1.base, main_#t~mem217#1.offset, main_#t~mem218#1.base, main_#t~mem218#1.offset, main_#t~mem219#1, main_#t~post220#1, main_#t~mem221#1.base, main_#t~mem221#1.offset, main_#t~mem222#1.base, main_#t~mem222#1.offset, main_#t~mem223#1.base, main_#t~mem223#1.offset, main_#t~mem224#1.base, main_#t~mem224#1.offset, main_#t~mem225#1.base, main_#t~mem225#1.offset, main_#t~mem226#1.base, main_#t~mem226#1.offset, main_#t~mem227#1.base, main_#t~mem227#1.offset, main_#t~mem228#1.base, main_#t~mem228#1.offset, main_~_hd_head~0#1.base, main_~_hd_head~0#1.offset, main_#t~mem229#1.base, main_#t~mem229#1.offset, main_#t~mem230#1, main_#t~post231#1, main_~_hd_bkt~0#1, main_~_hd_hh_del~0#1.base, main_~_hd_hh_del~0#1.offset, main_#t~mem232#1.base, main_#t~mem232#1.offset, main_#t~mem233#1, main_#t~mem146#1, main_#t~mem147#1, main_~#i~0#1.base, main_~#i~0#1.offset, main_~user~0#1.base, main_~user~0#1.offset, main_~tmp~0#1.base, main_~tmp~0#1.offset, main_~users~0#1.base, main_~users~0#1.offset;call main_~#i~0#1.base, main_~#i~0#1.offset := #Ultimate.allocOnStack(4);havoc main_~user~0#1.base, main_~user~0#1.offset;havoc main_~tmp~0#1.base, main_~tmp~0#1.offset;main_~users~0#1.base, main_~users~0#1.offset := 0, 0;call write~int(0, main_~#i~0#1.base, main_~#i~0#1.offset, 4); {11272#(and (= |ULTIMATE.start_main_~users~0#1.offset| 0) (= |ULTIMATE.start_main_~users~0#1.base| 0))} is VALID [2022-02-21 03:18:57,866 INFO L290 TraceCheckUtils]: 2: Hoare triple {11272#(and (= |ULTIMATE.start_main_~users~0#1.offset| 0) (= |ULTIMATE.start_main_~users~0#1.base| 0))} call main_#t~mem7#1 := read~int(main_~#i~0#1.base, main_~#i~0#1.offset, 4); {11272#(and (= |ULTIMATE.start_main_~users~0#1.offset| 0) (= |ULTIMATE.start_main_~users~0#1.base| 0))} is VALID [2022-02-21 03:18:57,867 INFO L290 TraceCheckUtils]: 3: Hoare triple {11272#(and (= |ULTIMATE.start_main_~users~0#1.offset| 0) (= |ULTIMATE.start_main_~users~0#1.base| 0))} assume !!(main_#t~mem7#1 < 10);havoc main_#t~mem7#1;call main_#t~malloc8#1.base, main_#t~malloc8#1.offset := #Ultimate.allocOnHeap(40);main_~user~0#1.base, main_~user~0#1.offset := main_#t~malloc8#1.base, main_#t~malloc8#1.offset;havoc main_#t~malloc8#1.base, main_#t~malloc8#1.offset; {11272#(and (= |ULTIMATE.start_main_~users~0#1.offset| 0) (= |ULTIMATE.start_main_~users~0#1.base| 0))} is VALID [2022-02-21 03:18:57,867 INFO L290 TraceCheckUtils]: 4: Hoare triple {11272#(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); {11272#(and (= |ULTIMATE.start_main_~users~0#1.offset| 0) (= |ULTIMATE.start_main_~users~0#1.base| 0))} is VALID [2022-02-21 03:18:57,868 INFO L290 TraceCheckUtils]: 5: Hoare triple {11272#(and (= |ULTIMATE.start_main_~users~0#1.offset| 0) (= |ULTIMATE.start_main_~users~0#1.base| 0))} call main_#t~mem9#1 := read~int(main_~#i~0#1.base, main_~#i~0#1.offset, 4);call write~int(main_#t~mem9#1, main_~user~0#1.base, main_~user~0#1.offset, 4);havoc main_#t~mem9#1;call main_#t~mem10#1 := read~int(main_~#i~0#1.base, main_~#i~0#1.offset, 4);call main_#t~mem11#1 := read~int(main_~#i~0#1.base, main_~#i~0#1.offset, 4); {11272#(and (= |ULTIMATE.start_main_~users~0#1.offset| 0) (= |ULTIMATE.start_main_~users~0#1.base| 0))} is VALID [2022-02-21 03:18:57,869 INFO L290 TraceCheckUtils]: 6: Hoare triple {11272#(and (= |ULTIMATE.start_main_~users~0#1.offset| 0) (= |ULTIMATE.start_main_~users~0#1.base| 0))} assume main_#t~mem10#1 * main_#t~mem11#1 <= 2147483647; {11272#(and (= |ULTIMATE.start_main_~users~0#1.offset| 0) (= |ULTIMATE.start_main_~users~0#1.base| 0))} is VALID [2022-02-21 03:18:57,869 INFO L290 TraceCheckUtils]: 7: Hoare triple {11272#(and (= |ULTIMATE.start_main_~users~0#1.offset| 0) (= |ULTIMATE.start_main_~users~0#1.base| 0))} assume main_#t~mem10#1 * main_#t~mem11#1 >= -2147483648;call write~int(main_#t~mem10#1 * main_#t~mem11#1, main_~user~0#1.base, 4 + main_~user~0#1.offset, 4);havoc main_#t~mem10#1;havoc main_#t~mem11#1; {11272#(and (= |ULTIMATE.start_main_~users~0#1.offset| 0) (= |ULTIMATE.start_main_~users~0#1.base| 0))} is VALID [2022-02-21 03:18:57,870 INFO L290 TraceCheckUtils]: 8: Hoare triple {11272#(and (= |ULTIMATE.start_main_~users~0#1.offset| 0) (= |ULTIMATE.start_main_~users~0#1.base| 0))} havoc main_~_ha_hashv~0#1; {11272#(and (= |ULTIMATE.start_main_~users~0#1.offset| 0) (= |ULTIMATE.start_main_~users~0#1.base| 0))} is VALID [2022-02-21 03:18:57,872 INFO L290 TraceCheckUtils]: 9: Hoare triple {11272#(and (= |ULTIMATE.start_main_~users~0#1.offset| 0) (= |ULTIMATE.start_main_~users~0#1.base| 0))} goto; {11272#(and (= |ULTIMATE.start_main_~users~0#1.offset| 0) (= |ULTIMATE.start_main_~users~0#1.base| 0))} is VALID [2022-02-21 03:18:57,872 INFO L290 TraceCheckUtils]: 10: Hoare triple {11272#(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; {11272#(and (= |ULTIMATE.start_main_~users~0#1.offset| 0) (= |ULTIMATE.start_main_~users~0#1.base| 0))} is VALID [2022-02-21 03:18:57,873 INFO L290 TraceCheckUtils]: 11: Hoare triple {11272#(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); {11272#(and (= |ULTIMATE.start_main_~users~0#1.offset| 0) (= |ULTIMATE.start_main_~users~0#1.base| 0))} is VALID [2022-02-21 03:18:57,873 INFO L290 TraceCheckUtils]: 12: Hoare triple {11272#(and (= |ULTIMATE.start_main_~users~0#1.offset| 0) (= |ULTIMATE.start_main_~users~0#1.base| 0))} main_~_ha_hashv~0#1 := 4 + main_~_ha_hashv~0#1;main_#t~switch24#1 := 11 == main_~_hj_k~0#1; {11272#(and (= |ULTIMATE.start_main_~users~0#1.offset| 0) (= |ULTIMATE.start_main_~users~0#1.base| 0))} is VALID [2022-02-21 03:18:57,875 INFO L290 TraceCheckUtils]: 13: Hoare triple {11272#(and (= |ULTIMATE.start_main_~users~0#1.offset| 0) (= |ULTIMATE.start_main_~users~0#1.base| 0))} assume !main_#t~switch24#1; {11272#(and (= |ULTIMATE.start_main_~users~0#1.offset| 0) (= |ULTIMATE.start_main_~users~0#1.base| 0))} is VALID [2022-02-21 03:18:57,876 INFO L290 TraceCheckUtils]: 14: Hoare triple {11272#(and (= |ULTIMATE.start_main_~users~0#1.offset| 0) (= |ULTIMATE.start_main_~users~0#1.base| 0))} main_#t~switch24#1 := main_#t~switch24#1 || 10 == main_~_hj_k~0#1; {11272#(and (= |ULTIMATE.start_main_~users~0#1.offset| 0) (= |ULTIMATE.start_main_~users~0#1.base| 0))} is VALID [2022-02-21 03:18:57,876 INFO L290 TraceCheckUtils]: 15: Hoare triple {11272#(and (= |ULTIMATE.start_main_~users~0#1.offset| 0) (= |ULTIMATE.start_main_~users~0#1.base| 0))} assume !main_#t~switch24#1; {11272#(and (= |ULTIMATE.start_main_~users~0#1.offset| 0) (= |ULTIMATE.start_main_~users~0#1.base| 0))} is VALID [2022-02-21 03:18:57,877 INFO L290 TraceCheckUtils]: 16: Hoare triple {11272#(and (= |ULTIMATE.start_main_~users~0#1.offset| 0) (= |ULTIMATE.start_main_~users~0#1.base| 0))} main_#t~switch24#1 := main_#t~switch24#1 || 9 == main_~_hj_k~0#1; {11272#(and (= |ULTIMATE.start_main_~users~0#1.offset| 0) (= |ULTIMATE.start_main_~users~0#1.base| 0))} is VALID [2022-02-21 03:18:57,878 INFO L290 TraceCheckUtils]: 17: Hoare triple {11272#(and (= |ULTIMATE.start_main_~users~0#1.offset| 0) (= |ULTIMATE.start_main_~users~0#1.base| 0))} assume !main_#t~switch24#1; {11272#(and (= |ULTIMATE.start_main_~users~0#1.offset| 0) (= |ULTIMATE.start_main_~users~0#1.base| 0))} is VALID [2022-02-21 03:18:57,878 INFO L290 TraceCheckUtils]: 18: Hoare triple {11272#(and (= |ULTIMATE.start_main_~users~0#1.offset| 0) (= |ULTIMATE.start_main_~users~0#1.base| 0))} main_#t~switch24#1 := main_#t~switch24#1 || 8 == main_~_hj_k~0#1; {11272#(and (= |ULTIMATE.start_main_~users~0#1.offset| 0) (= |ULTIMATE.start_main_~users~0#1.base| 0))} is VALID [2022-02-21 03:18:57,879 INFO L290 TraceCheckUtils]: 19: Hoare triple {11272#(and (= |ULTIMATE.start_main_~users~0#1.offset| 0) (= |ULTIMATE.start_main_~users~0#1.base| 0))} assume !main_#t~switch24#1; {11272#(and (= |ULTIMATE.start_main_~users~0#1.offset| 0) (= |ULTIMATE.start_main_~users~0#1.base| 0))} is VALID [2022-02-21 03:18:57,879 INFO L290 TraceCheckUtils]: 20: Hoare triple {11272#(and (= |ULTIMATE.start_main_~users~0#1.offset| 0) (= |ULTIMATE.start_main_~users~0#1.base| 0))} main_#t~switch24#1 := main_#t~switch24#1 || 7 == main_~_hj_k~0#1; {11272#(and (= |ULTIMATE.start_main_~users~0#1.offset| 0) (= |ULTIMATE.start_main_~users~0#1.base| 0))} is VALID [2022-02-21 03:18:57,880 INFO L290 TraceCheckUtils]: 21: Hoare triple {11272#(and (= |ULTIMATE.start_main_~users~0#1.offset| 0) (= |ULTIMATE.start_main_~users~0#1.base| 0))} assume !main_#t~switch24#1; {11272#(and (= |ULTIMATE.start_main_~users~0#1.offset| 0) (= |ULTIMATE.start_main_~users~0#1.base| 0))} is VALID [2022-02-21 03:18:57,881 INFO L290 TraceCheckUtils]: 22: Hoare triple {11272#(and (= |ULTIMATE.start_main_~users~0#1.offset| 0) (= |ULTIMATE.start_main_~users~0#1.base| 0))} main_#t~switch24#1 := main_#t~switch24#1 || 6 == main_~_hj_k~0#1; {11272#(and (= |ULTIMATE.start_main_~users~0#1.offset| 0) (= |ULTIMATE.start_main_~users~0#1.base| 0))} is VALID [2022-02-21 03:18:57,881 INFO L290 TraceCheckUtils]: 23: Hoare triple {11272#(and (= |ULTIMATE.start_main_~users~0#1.offset| 0) (= |ULTIMATE.start_main_~users~0#1.base| 0))} assume !main_#t~switch24#1; {11272#(and (= |ULTIMATE.start_main_~users~0#1.offset| 0) (= |ULTIMATE.start_main_~users~0#1.base| 0))} is VALID [2022-02-21 03:18:57,882 INFO L290 TraceCheckUtils]: 24: Hoare triple {11272#(and (= |ULTIMATE.start_main_~users~0#1.offset| 0) (= |ULTIMATE.start_main_~users~0#1.base| 0))} main_#t~switch24#1 := main_#t~switch24#1 || 5 == main_~_hj_k~0#1; {11272#(and (= |ULTIMATE.start_main_~users~0#1.offset| 0) (= |ULTIMATE.start_main_~users~0#1.base| 0))} is VALID [2022-02-21 03:18:57,882 INFO L290 TraceCheckUtils]: 25: Hoare triple {11272#(and (= |ULTIMATE.start_main_~users~0#1.offset| 0) (= |ULTIMATE.start_main_~users~0#1.base| 0))} assume !main_#t~switch24#1; {11272#(and (= |ULTIMATE.start_main_~users~0#1.offset| 0) (= |ULTIMATE.start_main_~users~0#1.base| 0))} is VALID [2022-02-21 03:18:57,883 INFO L290 TraceCheckUtils]: 26: Hoare triple {11272#(and (= |ULTIMATE.start_main_~users~0#1.offset| 0) (= |ULTIMATE.start_main_~users~0#1.base| 0))} main_#t~switch24#1 := main_#t~switch24#1 || 4 == main_~_hj_k~0#1; {11272#(and (= |ULTIMATE.start_main_~users~0#1.offset| 0) (= |ULTIMATE.start_main_~users~0#1.base| 0))} is VALID [2022-02-21 03:18:57,884 INFO L290 TraceCheckUtils]: 27: Hoare triple {11272#(and (= |ULTIMATE.start_main_~users~0#1.offset| 0) (= |ULTIMATE.start_main_~users~0#1.base| 0))} assume main_#t~switch24#1;call main_#t~mem32#1 := read~int(main_~_hj_key~0#1.base, 3 + main_~_hj_key~0#1.offset, 1);main_~_hj_i~0#1 := main_~_hj_i~0#1 + 16777216 * (main_#t~mem32#1 % 256);havoc main_#t~mem32#1; {11272#(and (= |ULTIMATE.start_main_~users~0#1.offset| 0) (= |ULTIMATE.start_main_~users~0#1.base| 0))} is VALID [2022-02-21 03:18:57,884 INFO L290 TraceCheckUtils]: 28: Hoare triple {11272#(and (= |ULTIMATE.start_main_~users~0#1.offset| 0) (= |ULTIMATE.start_main_~users~0#1.base| 0))} main_#t~switch24#1 := main_#t~switch24#1 || 3 == main_~_hj_k~0#1; {11272#(and (= |ULTIMATE.start_main_~users~0#1.offset| 0) (= |ULTIMATE.start_main_~users~0#1.base| 0))} is VALID [2022-02-21 03:18:57,885 INFO L290 TraceCheckUtils]: 29: Hoare triple {11272#(and (= |ULTIMATE.start_main_~users~0#1.offset| 0) (= |ULTIMATE.start_main_~users~0#1.base| 0))} assume main_#t~switch24#1;call main_#t~mem33#1 := read~int(main_~_hj_key~0#1.base, 2 + main_~_hj_key~0#1.offset, 1);main_~_hj_i~0#1 := main_~_hj_i~0#1 + 65536 * (main_#t~mem33#1 % 256);havoc main_#t~mem33#1; {11272#(and (= |ULTIMATE.start_main_~users~0#1.offset| 0) (= |ULTIMATE.start_main_~users~0#1.base| 0))} is VALID [2022-02-21 03:18:57,885 INFO L290 TraceCheckUtils]: 30: Hoare triple {11272#(and (= |ULTIMATE.start_main_~users~0#1.offset| 0) (= |ULTIMATE.start_main_~users~0#1.base| 0))} main_#t~switch24#1 := main_#t~switch24#1 || 2 == main_~_hj_k~0#1; {11272#(and (= |ULTIMATE.start_main_~users~0#1.offset| 0) (= |ULTIMATE.start_main_~users~0#1.base| 0))} is VALID [2022-02-21 03:18:57,885 INFO L290 TraceCheckUtils]: 31: Hoare triple {11272#(and (= |ULTIMATE.start_main_~users~0#1.offset| 0) (= |ULTIMATE.start_main_~users~0#1.base| 0))} assume main_#t~switch24#1;call main_#t~mem34#1 := read~int(main_~_hj_key~0#1.base, 1 + main_~_hj_key~0#1.offset, 1);main_~_hj_i~0#1 := main_~_hj_i~0#1 + 256 * (main_#t~mem34#1 % 256);havoc main_#t~mem34#1; {11272#(and (= |ULTIMATE.start_main_~users~0#1.offset| 0) (= |ULTIMATE.start_main_~users~0#1.base| 0))} is VALID [2022-02-21 03:18:57,887 INFO L290 TraceCheckUtils]: 32: Hoare triple {11272#(and (= |ULTIMATE.start_main_~users~0#1.offset| 0) (= |ULTIMATE.start_main_~users~0#1.base| 0))} main_#t~switch24#1 := main_#t~switch24#1 || 1 == main_~_hj_k~0#1; {11272#(and (= |ULTIMATE.start_main_~users~0#1.offset| 0) (= |ULTIMATE.start_main_~users~0#1.base| 0))} is VALID [2022-02-21 03:18:57,887 INFO L290 TraceCheckUtils]: 33: Hoare triple {11272#(and (= |ULTIMATE.start_main_~users~0#1.offset| 0) (= |ULTIMATE.start_main_~users~0#1.base| 0))} assume main_#t~switch24#1;call main_#t~mem35#1 := read~int(main_~_hj_key~0#1.base, main_~_hj_key~0#1.offset, 1);main_~_hj_i~0#1 := main_~_hj_i~0#1 + main_#t~mem35#1 % 256;havoc main_#t~mem35#1; {11272#(and (= |ULTIMATE.start_main_~users~0#1.offset| 0) (= |ULTIMATE.start_main_~users~0#1.base| 0))} is VALID [2022-02-21 03:18:57,887 INFO L290 TraceCheckUtils]: 34: Hoare triple {11272#(and (= |ULTIMATE.start_main_~users~0#1.offset| 0) (= |ULTIMATE.start_main_~users~0#1.base| 0))} havoc main_#t~switch24#1; {11272#(and (= |ULTIMATE.start_main_~users~0#1.offset| 0) (= |ULTIMATE.start_main_~users~0#1.base| 0))} is VALID [2022-02-21 03:18:57,889 INFO L290 TraceCheckUtils]: 35: Hoare triple {11272#(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)))); {11272#(and (= |ULTIMATE.start_main_~users~0#1.offset| 0) (= |ULTIMATE.start_main_~users~0#1.base| 0))} is VALID [2022-02-21 03:18:57,889 INFO L290 TraceCheckUtils]: 36: Hoare triple {11272#(and (= |ULTIMATE.start_main_~users~0#1.offset| 0) (= |ULTIMATE.start_main_~users~0#1.base| 0))} goto; {11272#(and (= |ULTIMATE.start_main_~users~0#1.offset| 0) (= |ULTIMATE.start_main_~users~0#1.base| 0))} is VALID [2022-02-21 03:18:57,890 INFO L290 TraceCheckUtils]: 37: Hoare triple {11272#(and (= |ULTIMATE.start_main_~users~0#1.offset| 0) (= |ULTIMATE.start_main_~users~0#1.base| 0))} goto; {11272#(and (= |ULTIMATE.start_main_~users~0#1.offset| 0) (= |ULTIMATE.start_main_~users~0#1.base| 0))} is VALID [2022-02-21 03:18:57,890 INFO L290 TraceCheckUtils]: 38: Hoare triple {11272#(and (= |ULTIMATE.start_main_~users~0#1.offset| 0) (= |ULTIMATE.start_main_~users~0#1.base| 0))} goto; {11272#(and (= |ULTIMATE.start_main_~users~0#1.offset| 0) (= |ULTIMATE.start_main_~users~0#1.base| 0))} is VALID [2022-02-21 03:18:57,891 INFO L290 TraceCheckUtils]: 39: Hoare triple {11272#(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); {11272#(and (= |ULTIMATE.start_main_~users~0#1.offset| 0) (= |ULTIMATE.start_main_~users~0#1.base| 0))} is VALID [2022-02-21 03:18:57,891 INFO L290 TraceCheckUtils]: 40: Hoare triple {11272#(and (= |ULTIMATE.start_main_~users~0#1.offset| 0) (= |ULTIMATE.start_main_~users~0#1.base| 0))} assume !(main_~users~0#1.base == 0 && main_~users~0#1.offset == 0);call main_#t~mem53#1.base, main_#t~mem53#1.offset := read~$Pointer$(main_~users~0#1.base, 8 + main_~users~0#1.offset, 4);call write~$Pointer$(main_#t~mem53#1.base, main_#t~mem53#1.offset, main_~user~0#1.base, 8 + main_~user~0#1.offset, 4);havoc main_#t~mem53#1.base, main_#t~mem53#1.offset; {11265#false} is VALID [2022-02-21 03:18:57,892 INFO L290 TraceCheckUtils]: 41: Hoare triple {11265#false} call write~$Pointer$(0, 0, main_~user~0#1.base, 16 + main_~user~0#1.offset, 4);call main_#t~mem54#1.base, main_#t~mem54#1.offset := read~$Pointer$(main_~users~0#1.base, 8 + main_~users~0#1.offset, 4);call main_#t~mem55#1.base, main_#t~mem55#1.offset := read~$Pointer$(main_#t~mem54#1.base, 16 + main_#t~mem54#1.offset, 4);call main_#t~mem56#1.base, main_#t~mem56#1.offset := read~$Pointer$(main_~users~0#1.base, 8 + main_~users~0#1.offset, 4);call main_#t~mem57#1 := read~int(main_#t~mem56#1.base, 20 + main_#t~mem56#1.offset, 4);call write~$Pointer$(main_#t~mem55#1.base, main_#t~mem55#1.offset - main_#t~mem57#1, main_~user~0#1.base, 12 + main_~user~0#1.offset, 4);havoc main_#t~mem54#1.base, main_#t~mem54#1.offset;havoc main_#t~mem55#1.base, main_#t~mem55#1.offset;havoc main_#t~mem56#1.base, main_#t~mem56#1.offset;havoc main_#t~mem57#1;call main_#t~mem58#1.base, main_#t~mem58#1.offset := read~$Pointer$(main_~users~0#1.base, 8 + main_~users~0#1.offset, 4);call main_#t~mem59#1.base, main_#t~mem59#1.offset := read~$Pointer$(main_#t~mem58#1.base, 16 + main_#t~mem58#1.offset, 4);call write~$Pointer$(main_~user~0#1.base, main_~user~0#1.offset, main_#t~mem59#1.base, 8 + main_#t~mem59#1.offset, 4);havoc main_#t~mem58#1.base, main_#t~mem58#1.offset;havoc main_#t~mem59#1.base, main_#t~mem59#1.offset;call main_#t~mem60#1.base, main_#t~mem60#1.offset := read~$Pointer$(main_~users~0#1.base, 8 + main_~users~0#1.offset, 4);call write~$Pointer$(main_~user~0#1.base, 8 + main_~user~0#1.offset, main_#t~mem60#1.base, 16 + main_#t~mem60#1.offset, 4);havoc main_#t~mem60#1.base, main_#t~mem60#1.offset; {11265#false} is VALID [2022-02-21 03:18:57,892 INFO L290 TraceCheckUtils]: 42: Hoare triple {11265#false} goto; {11265#false} is VALID [2022-02-21 03:18:57,892 INFO L290 TraceCheckUtils]: 43: Hoare triple {11265#false} havoc main_~_ha_bkt~0#1;call main_#t~mem61#1.base, main_#t~mem61#1.offset := read~$Pointer$(main_~users~0#1.base, 8 + main_~users~0#1.offset, 4);call main_#t~mem62#1 := read~int(main_#t~mem61#1.base, 12 + main_#t~mem61#1.offset, 4);main_#t~post63#1 := main_#t~mem62#1;call write~int(1 + main_#t~post63#1, main_#t~mem61#1.base, 12 + main_#t~mem61#1.offset, 4);havoc main_#t~mem61#1.base, main_#t~mem61#1.offset;havoc main_#t~mem62#1;havoc main_#t~post63#1; {11265#false} is VALID [2022-02-21 03:18:57,892 INFO L290 TraceCheckUtils]: 44: Hoare triple {11265#false} call main_#t~mem64#1.base, main_#t~mem64#1.offset := read~$Pointer$(main_~users~0#1.base, 8 + main_~users~0#1.offset, 4);call main_#t~mem65#1 := read~int(main_#t~mem64#1.base, 4 + main_#t~mem64#1.offset, 4);main_~_ha_bkt~0#1 := (if 0 == main_~_ha_hashv~0#1 || 0 == main_#t~mem65#1 - 1 then 0 else (if 1 == main_#t~mem65#1 - 1 then (if 1 == main_~_ha_hashv~0#1 || 0 == main_~_ha_hashv~0#1 then main_~_ha_hashv~0#1 else (if main_~_ha_hashv~0#1 >= 0 then main_~_ha_hashv~0#1 % 2 else ~bitwiseAnd(main_~_ha_hashv~0#1, main_#t~mem65#1 - 1))) else (if 1 == main_~_ha_hashv~0#1 then (if 1 == main_#t~mem65#1 - 1 || 0 == main_#t~mem65#1 - 1 then main_#t~mem65#1 - 1 else (if main_#t~mem65#1 - 1 >= 0 then (main_#t~mem65#1 - 1) % 2 else ~bitwiseAnd(main_~_ha_hashv~0#1, main_#t~mem65#1 - 1))) else ~bitwiseAnd(main_~_ha_hashv~0#1, main_#t~mem65#1 - 1))));havoc main_#t~mem64#1.base, main_#t~mem64#1.offset;havoc main_#t~mem65#1; {11265#false} is VALID [2022-02-21 03:18:57,892 INFO L290 TraceCheckUtils]: 45: Hoare triple {11265#false} goto; {11265#false} is VALID [2022-02-21 03:18:57,892 INFO L290 TraceCheckUtils]: 46: Hoare triple {11265#false} call main_#t~mem66#1.base, main_#t~mem66#1.offset := read~$Pointer$(main_~users~0#1.base, 8 + main_~users~0#1.offset, 4);call main_#t~mem67#1.base, main_#t~mem67#1.offset := read~$Pointer$(main_#t~mem66#1.base, main_#t~mem66#1.offset, 4);main_~_ha_head~0#1.base, main_~_ha_head~0#1.offset := main_#t~mem67#1.base, main_#t~mem67#1.offset + 12 * (if main_~_ha_bkt~0#1 % 4294967296 % 4294967296 <= 2147483647 then main_~_ha_bkt~0#1 % 4294967296 % 4294967296 else main_~_ha_bkt~0#1 % 4294967296 % 4294967296 - 4294967296);havoc main_#t~mem66#1.base, main_#t~mem66#1.offset;havoc main_#t~mem67#1.base, main_#t~mem67#1.offset;call main_#t~mem68#1 := read~int(main_~_ha_head~0#1.base, 4 + main_~_ha_head~0#1.offset, 4);main_#t~post69#1 := main_#t~mem68#1;call write~int(1 + main_#t~post69#1, main_~_ha_head~0#1.base, 4 + main_~_ha_head~0#1.offset, 4);havoc main_#t~mem68#1;havoc main_#t~post69#1;call main_#t~mem70#1.base, main_#t~mem70#1.offset := read~$Pointer$(main_~_ha_head~0#1.base, main_~_ha_head~0#1.offset, 4);call write~$Pointer$(main_#t~mem70#1.base, main_#t~mem70#1.offset, main_~user~0#1.base, 24 + main_~user~0#1.offset, 4);havoc main_#t~mem70#1.base, main_#t~mem70#1.offset;call write~$Pointer$(0, 0, main_~user~0#1.base, 20 + main_~user~0#1.offset, 4);call main_#t~mem71#1.base, main_#t~mem71#1.offset := read~$Pointer$(main_~_ha_head~0#1.base, main_~_ha_head~0#1.offset, 4); {11265#false} is VALID [2022-02-21 03:18:57,892 INFO L290 TraceCheckUtils]: 47: Hoare triple {11265#false} assume main_#t~mem71#1.base != 0 || main_#t~mem71#1.offset != 0;havoc main_#t~mem71#1.base, main_#t~mem71#1.offset;call main_#t~mem72#1.base, main_#t~mem72#1.offset := read~$Pointer$(main_~_ha_head~0#1.base, main_~_ha_head~0#1.offset, 4);call write~$Pointer$(main_~user~0#1.base, 8 + main_~user~0#1.offset, main_#t~mem72#1.base, 12 + main_#t~mem72#1.offset, 4);havoc main_#t~mem72#1.base, main_#t~mem72#1.offset; {11265#false} is VALID [2022-02-21 03:18:57,892 INFO L290 TraceCheckUtils]: 48: Hoare triple {11265#false} call write~$Pointer$(main_~user~0#1.base, 8 + main_~user~0#1.offset, main_~_ha_head~0#1.base, main_~_ha_head~0#1.offset, 4);call main_#t~mem74#1 := read~int(main_~_ha_head~0#1.base, 4 + main_~_ha_head~0#1.offset, 4);call main_#t~mem73#1 := read~int(main_~_ha_head~0#1.base, 8 + main_~_ha_head~0#1.offset, 4);main_#t~short77#1 := main_#t~mem74#1 % 4294967296 >= 10 * (1 + main_#t~mem73#1) % 4294967296; {11265#false} is VALID [2022-02-21 03:18:57,892 INFO L290 TraceCheckUtils]: 49: Hoare triple {11265#false} assume main_#t~short77#1;call main_#t~mem75#1.base, main_#t~mem75#1.offset := read~$Pointer$(main_~user~0#1.base, 8 + main_~user~0#1.offset, 4);call main_#t~mem76#1 := read~int(main_#t~mem75#1.base, 36 + main_#t~mem75#1.offset, 4);main_#t~short77#1 := 0 == main_#t~mem76#1 % 4294967296; {11265#false} is VALID [2022-02-21 03:18:57,892 INFO L290 TraceCheckUtils]: 50: Hoare triple {11265#false} assume !main_#t~short77#1;havoc main_#t~mem74#1;havoc main_#t~mem73#1;havoc main_#t~mem75#1.base, main_#t~mem75#1.offset;havoc main_#t~mem76#1;havoc main_#t~short77#1; {11265#false} is VALID [2022-02-21 03:18:57,892 INFO L290 TraceCheckUtils]: 51: Hoare triple {11265#false} goto; {11265#false} is VALID [2022-02-21 03:18:57,893 INFO L290 TraceCheckUtils]: 52: Hoare triple {11265#false} goto; {11265#false} is VALID [2022-02-21 03:18:57,893 INFO L290 TraceCheckUtils]: 53: Hoare triple {11265#false} goto; {11265#false} is VALID [2022-02-21 03:18:57,893 INFO L290 TraceCheckUtils]: 54: Hoare triple {11265#false} goto; {11265#false} is VALID [2022-02-21 03:18:57,893 INFO L290 TraceCheckUtils]: 55: Hoare triple {11265#false} call main_#t~mem144#1.base, main_#t~mem144#1.offset := read~$Pointer$(main_~user~0#1.base, 8 + main_~user~0#1.offset, 4);call main_#t~mem145#1 := read~int(main_#t~mem144#1.base, 12 + main_#t~mem144#1.offset, 4); {11265#false} is VALID [2022-02-21 03:18:57,893 INFO L272 TraceCheckUtils]: 56: Hoare triple {11265#false} call test_int((if main_#t~mem145#1 % 4294967296 % 4294967296 <= 2147483647 then main_#t~mem145#1 % 4294967296 % 4294967296 else main_#t~mem145#1 % 4294967296 % 4294967296 - 4294967296)); {11265#false} is VALID [2022-02-21 03:18:57,893 INFO L290 TraceCheckUtils]: 57: Hoare triple {11265#false} ~a := #in~a;#t~post3 := ~count_int~0; {11265#false} is VALID [2022-02-21 03:18:57,893 INFO L290 TraceCheckUtils]: 58: Hoare triple {11265#false} assume 1 + #t~post3 <= 2147483647; {11265#false} is VALID [2022-02-21 03:18:57,893 INFO L290 TraceCheckUtils]: 59: Hoare triple {11265#false} assume 1 + #t~post3 >= -2147483648;~count_int~0 := 1 + #t~post3;#t~switch4 := 0 == #t~post3; {11265#false} is VALID [2022-02-21 03:18:57,893 INFO L290 TraceCheckUtils]: 60: Hoare triple {11265#false} assume #t~switch4; {11265#false} is VALID [2022-02-21 03:18:57,893 INFO L272 TraceCheckUtils]: 61: Hoare triple {11265#false} call __VERIFIER_assert((if 1 == ~a then 1 else 0)); {11265#false} is VALID [2022-02-21 03:18:57,894 INFO L290 TraceCheckUtils]: 62: Hoare triple {11265#false} ~cond := #in~cond; {11265#false} is VALID [2022-02-21 03:18:57,894 INFO L290 TraceCheckUtils]: 63: Hoare triple {11265#false} assume !(0 == ~cond); {11265#false} is VALID [2022-02-21 03:18:57,894 INFO L290 TraceCheckUtils]: 64: Hoare triple {11265#false} assume true; {11265#false} is VALID [2022-02-21 03:18:57,895 INFO L284 TraceCheckUtils]: 65: Hoare quadruple {11265#false} {11265#false} #884#return; {11265#false} is VALID [2022-02-21 03:18:57,895 INFO L290 TraceCheckUtils]: 66: Hoare triple {11265#false} havoc #t~post3;havoc #t~switch4; {11265#false} is VALID [2022-02-21 03:18:57,896 INFO L290 TraceCheckUtils]: 67: Hoare triple {11265#false} assume true; {11265#false} is VALID [2022-02-21 03:18:57,896 INFO L284 TraceCheckUtils]: 68: Hoare quadruple {11265#false} {11265#false} #920#return; {11265#false} is VALID [2022-02-21 03:18:57,896 INFO L290 TraceCheckUtils]: 69: Hoare triple {11265#false} havoc main_#t~mem144#1.base, main_#t~mem144#1.offset;havoc main_#t~mem145#1; {11265#false} is VALID [2022-02-21 03:18:57,896 INFO L290 TraceCheckUtils]: 70: Hoare triple {11265#false} call main_#t~mem5#1 := read~int(main_~#i~0#1.base, main_~#i~0#1.offset, 4);main_#t~post6#1 := main_#t~mem5#1; {11265#false} is VALID [2022-02-21 03:18:57,896 INFO L290 TraceCheckUtils]: 71: Hoare triple {11265#false} assume !(1 + main_#t~post6#1 <= 2147483647); {11265#false} is VALID [2022-02-21 03:18:57,897 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:18:57,897 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-21 03:18:57,897 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 03:18:57,897 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [163669185] [2022-02-21 03:18:57,897 WARN L317 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-02-21 03:18:57,897 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2129788298] [2022-02-21 03:18:57,898 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2129788298] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-21 03:18:57,898 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-21 03:18:57,898 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-21 03:18:57,898 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1504190396] [2022-02-21 03:18:57,898 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-21 03:18:57,899 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 22.666666666666668) internal successors, (68), 3 states have internal predecessors, (68), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 72 [2022-02-21 03:18:57,899 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-21 03:18:57,899 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 22.666666666666668) internal successors, (68), 3 states have internal predecessors, (68), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-02-21 03:18:57,955 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 72 edges. 72 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:18:57,956 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-21 03:18:57,956 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 03:18:57,956 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-21 03:18:57,956 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-21 03:18:57,957 INFO L87 Difference]: Start difference. First operand 342 states and 441 transitions. Second operand has 3 states, 3 states have (on average 22.666666666666668) internal successors, (68), 3 states have internal predecessors, (68), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-02-21 03:18:58,676 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:18:58,676 INFO L93 Difference]: Finished difference Result 692 states and 904 transitions. [2022-02-21 03:18:58,676 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-21 03:18:58,677 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 22.666666666666668) internal successors, (68), 3 states have internal predecessors, (68), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 72 [2022-02-21 03:18:58,677 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-21 03:18:58,677 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 22.666666666666668) internal successors, (68), 3 states have internal predecessors, (68), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-02-21 03:18:58,688 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 759 transitions. [2022-02-21 03:18:58,689 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 22.666666666666668) internal successors, (68), 3 states have internal predecessors, (68), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-02-21 03:18:58,695 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 759 transitions. [2022-02-21 03:18:58,696 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 759 transitions. [2022-02-21 03:18:59,381 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 759 edges. 759 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:18:59,393 INFO L225 Difference]: With dead ends: 692 [2022-02-21 03:18:59,393 INFO L226 Difference]: Without dead ends: 409 [2022-02-21 03:18:59,394 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 70 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:18:59,394 INFO L933 BasicCegarLoop]: 352 mSDtfsCounter, 100 mSDsluCounter, 280 mSDsCounter, 0 mSdLazyCounter, 29 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 103 SdHoareTripleChecker+Valid, 632 SdHoareTripleChecker+Invalid, 34 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 29 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-21 03:18:59,395 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [103 Valid, 632 Invalid, 34 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 29 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-21 03:18:59,396 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 409 states. [2022-02-21 03:18:59,484 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 409 to 406. [2022-02-21 03:18:59,484 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 03:18:59,485 INFO L82 GeneralOperation]: Start isEquivalent. First operand 409 states. Second operand has 406 states, 370 states have (on average 1.2891891891891891) internal successors, (477), 391 states have internal predecessors, (477), 25 states have call successors, (25), 5 states have call predecessors, (25), 4 states have return successors, (25), 10 states have call predecessors, (25), 25 states have call successors, (25) [2022-02-21 03:18:59,486 INFO L74 IsIncluded]: Start isIncluded. First operand 409 states. Second operand has 406 states, 370 states have (on average 1.2891891891891891) internal successors, (477), 391 states have internal predecessors, (477), 25 states have call successors, (25), 5 states have call predecessors, (25), 4 states have return successors, (25), 10 states have call predecessors, (25), 25 states have call successors, (25) [2022-02-21 03:18:59,487 INFO L87 Difference]: Start difference. First operand 409 states. Second operand has 406 states, 370 states have (on average 1.2891891891891891) internal successors, (477), 391 states have internal predecessors, (477), 25 states have call successors, (25), 5 states have call predecessors, (25), 4 states have return successors, (25), 10 states have call predecessors, (25), 25 states have call successors, (25) [2022-02-21 03:18:59,499 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:18:59,499 INFO L93 Difference]: Finished difference Result 409 states and 528 transitions. [2022-02-21 03:18:59,499 INFO L276 IsEmpty]: Start isEmpty. Operand 409 states and 528 transitions. [2022-02-21 03:18:59,500 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:18:59,500 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:18:59,502 INFO L74 IsIncluded]: Start isIncluded. First operand has 406 states, 370 states have (on average 1.2891891891891891) internal successors, (477), 391 states have internal predecessors, (477), 25 states have call successors, (25), 5 states have call predecessors, (25), 4 states have return successors, (25), 10 states have call predecessors, (25), 25 states have call successors, (25) Second operand 409 states. [2022-02-21 03:18:59,503 INFO L87 Difference]: Start difference. First operand has 406 states, 370 states have (on average 1.2891891891891891) internal successors, (477), 391 states have internal predecessors, (477), 25 states have call successors, (25), 5 states have call predecessors, (25), 4 states have return successors, (25), 10 states have call predecessors, (25), 25 states have call successors, (25) Second operand 409 states. [2022-02-21 03:18:59,515 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:18:59,515 INFO L93 Difference]: Finished difference Result 409 states and 528 transitions. [2022-02-21 03:18:59,516 INFO L276 IsEmpty]: Start isEmpty. Operand 409 states and 528 transitions. [2022-02-21 03:18:59,517 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:18:59,517 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:18:59,517 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 03:18:59,517 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 03:18:59,518 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 406 states, 370 states have (on average 1.2891891891891891) internal successors, (477), 391 states have internal predecessors, (477), 25 states have call successors, (25), 5 states have call predecessors, (25), 4 states have return successors, (25), 10 states have call predecessors, (25), 25 states have call successors, (25) [2022-02-21 03:18:59,531 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 406 states to 406 states and 527 transitions. [2022-02-21 03:18:59,532 INFO L78 Accepts]: Start accepts. Automaton has 406 states and 527 transitions. Word has length 72 [2022-02-21 03:18:59,532 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-21 03:18:59,532 INFO L470 AbstractCegarLoop]: Abstraction has 406 states and 527 transitions. [2022-02-21 03:18:59,533 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 22.666666666666668) internal successors, (68), 3 states have internal predecessors, (68), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-02-21 03:18:59,533 INFO L276 IsEmpty]: Start isEmpty. Operand 406 states and 527 transitions. [2022-02-21 03:18:59,533 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2022-02-21 03:18:59,534 INFO L506 BasicCegarLoop]: Found error trace [2022-02-21 03:18:59,534 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-21 03:18:59,566 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:18:59,755 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-21 03:18:59,755 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [test_intErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, test_intErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2022-02-21 03:18:59,756 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:18:59,756 INFO L85 PathProgramCache]: Analyzing trace with hash -146069929, now seen corresponding path program 1 times [2022-02-21 03:18:59,756 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:18:59,756 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [830405342] [2022-02-21 03:18:59,756 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:18:59,756 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:18:59,821 ERROR L252 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-02-21 03:18:59,821 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1355104740] [2022-02-21 03:18:59,821 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:18:59,822 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-21 03:18:59,822 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:18:59,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:18:59,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:19:00,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:19:00,805 INFO L263 TraceCheckSpWp]: Trace formula consists of 707 conjuncts, 7 conjunts are in the unsatisfiable core [2022-02-21 03:19:00,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:19:00,845 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 03:19:01,020 INFO L290 TraceCheckUtils]: 0: Hoare triple {13624#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(21, 2);~count_int~0 := 0; {13624#true} is VALID [2022-02-21 03:19:01,020 INFO L290 TraceCheckUtils]: 1: Hoare triple {13624#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc8#1.base, main_#t~malloc8#1.offset, main_#t~mem9#1, main_#t~mem10#1, main_#t~mem11#1, main_#t~mem13#1, main_#t~mem12#1, main_#t~mem14#1, main_#t~mem15#1, main_#t~mem17#1, main_#t~mem16#1, main_#t~mem18#1, main_#t~mem19#1, main_#t~mem21#1, main_#t~mem20#1, main_#t~mem22#1, main_#t~mem23#1, main_#t~switch24#1, main_#t~mem25#1, main_#t~mem26#1, main_#t~mem27#1, main_#t~mem28#1, main_#t~mem29#1, main_#t~mem30#1, main_#t~mem31#1, main_#t~mem32#1, main_#t~mem33#1, main_#t~mem34#1, main_#t~mem35#1, main_~_hj_i~0#1, main_~_hj_j~0#1, main_~_hj_k~0#1, main_~_hj_key~0#1.base, main_~_hj_key~0#1.offset, main_#t~malloc36#1.base, main_#t~malloc36#1.offset, main_#t~mem37#1.base, main_#t~mem37#1.offset, main_#t~mem38#1.base, main_#t~mem38#1.offset, main_#t~memset~res39#1.base, main_#t~memset~res39#1.offset, main_#t~mem40#1.base, main_#t~mem40#1.offset, main_#t~mem41#1.base, main_#t~mem41#1.offset, main_#t~mem42#1.base, main_#t~mem42#1.offset, main_#t~mem43#1.base, main_#t~mem43#1.offset, main_#t~mem44#1.base, main_#t~mem44#1.offset, main_#t~malloc45#1.base, main_#t~malloc45#1.offset, main_#t~mem46#1.base, main_#t~mem46#1.offset, main_#t~mem47#1.base, main_#t~mem47#1.offset, main_#t~mem48#1.base, main_#t~mem48#1.offset, main_#t~mem49#1.base, main_#t~mem49#1.offset, main_#t~mem50#1.base, main_#t~mem50#1.offset, main_#t~mem51#1.base, main_#t~mem51#1.offset, main_#t~memset~res52#1.base, main_#t~memset~res52#1.offset, main_#t~mem53#1.base, main_#t~mem53#1.offset, main_#t~mem54#1.base, main_#t~mem54#1.offset, main_#t~mem55#1.base, main_#t~mem55#1.offset, main_#t~mem56#1.base, main_#t~mem56#1.offset, main_#t~mem57#1, main_#t~mem58#1.base, main_#t~mem58#1.offset, main_#t~mem59#1.base, main_#t~mem59#1.offset, main_#t~mem60#1.base, main_#t~mem60#1.offset, main_#t~mem61#1.base, main_#t~mem61#1.offset, main_#t~mem62#1, main_#t~post63#1, main_#t~mem64#1.base, main_#t~mem64#1.offset, main_#t~mem65#1, main_#t~mem66#1.base, main_#t~mem66#1.offset, main_#t~mem67#1.base, main_#t~mem67#1.offset, main_#t~mem68#1, main_#t~post69#1, main_#t~mem70#1.base, main_#t~mem70#1.offset, main_#t~mem71#1.base, main_#t~mem71#1.offset, main_#t~mem72#1.base, main_#t~mem72#1.offset, main_#t~mem74#1, main_#t~mem73#1, main_#t~mem75#1.base, main_#t~mem75#1.offset, main_#t~mem76#1, main_#t~short77#1, main_#t~mem78#1.base, main_#t~mem78#1.offset, main_#t~mem79#1, main_#t~malloc80#1.base, main_#t~malloc80#1.offset, main_#t~mem81#1.base, main_#t~mem81#1.offset, main_#t~mem82#1.base, main_#t~mem82#1.offset, main_#t~mem83#1.base, main_#t~mem83#1.offset, main_#t~mem84#1, main_#t~memset~res85#1.base, main_#t~memset~res85#1.offset, main_#t~mem86#1.base, main_#t~mem86#1.offset, main_#t~mem87#1.base, main_#t~mem87#1.offset, main_#t~mem90#1, main_#t~mem88#1.base, main_#t~mem88#1.offset, main_#t~mem89#1, main_#t~mem91#1.base, main_#t~mem91#1.offset, main_#t~mem94#1, main_#t~mem92#1.base, main_#t~mem92#1.offset, main_#t~mem93#1, main_#t~ite95#1, main_#t~mem96#1.base, main_#t~mem96#1.offset, main_#t~mem100#1.base, main_#t~mem100#1.offset, main_#t~mem101#1.base, main_#t~mem101#1.offset, main_#t~mem102#1.base, main_#t~mem102#1.offset, main_#t~mem103#1.base, main_#t~mem103#1.offset, main_#t~mem106#1, main_#t~mem104#1.base, main_#t~mem104#1.offset, main_#t~mem105#1, main_#t~mem107#1.base, main_#t~mem107#1.offset, main_#t~mem108#1, main_#t~pre109#1, main_#t~mem110#1.base, main_#t~mem110#1.offset, main_#t~mem111#1, main_#t~mem112#1.base, main_#t~mem112#1.offset, main_#t~mem113#1, main_#t~post114#1, main_#t~mem118#1, main_#t~mem116#1, main_#t~mem115#1.base, main_#t~mem115#1.offset, main_#t~mem117#1, main_#t~mem119#1, main_#t~post120#1, main_#t~mem121#1.base, main_#t~mem121#1.offset, main_#t~mem122#1.base, main_#t~mem122#1.offset, main_#t~mem123#1.base, main_#t~mem123#1.offset, main_#t~post97#1, main_#t~mem98#1.base, main_#t~mem98#1.offset, main_#t~mem99#1, main_#t~mem124#1.base, main_#t~mem124#1.offset, main_#t~mem125#1.base, main_#t~mem125#1.offset, main_#t~mem126#1.base, main_#t~mem126#1.offset, main_#t~mem127#1, main_#t~mem128#1.base, main_#t~mem128#1.offset, main_#t~mem129#1, main_#t~post130#1, main_#t~mem131#1.base, main_#t~mem131#1.offset, main_#t~mem132#1.base, main_#t~mem132#1.offset, main_#t~mem133#1.base, main_#t~mem133#1.offset, main_#t~mem134#1.base, main_#t~mem134#1.offset, main_#t~mem137#1, main_#t~mem135#1.base, main_#t~mem135#1.offset, main_#t~mem136#1, main_#t~ite140#1, main_#t~mem138#1.base, main_#t~mem138#1.offset, main_#t~mem139#1, main_#t~mem141#1.base, main_#t~mem141#1.offset, main_#t~mem142#1, main_#t~mem143#1.base, main_#t~mem143#1.offset, main_~_he_bkt~0#1, main_~_he_bkt_i~0#1, main_~_he_thh~0#1.base, main_~_he_thh~0#1.offset, main_~_he_hh_nxt~0#1.base, main_~_he_hh_nxt~0#1.offset, main_~#_he_new_buckets~0#1.base, main_~#_he_new_buckets~0#1.offset, main_~_he_newbkt~0#1.base, main_~_he_newbkt~0#1.offset, main_~_ha_head~0#1.base, main_~_ha_head~0#1.offset, main_~_ha_bkt~0#1, main_~_ha_hashv~0#1, main_#t~mem144#1.base, main_#t~mem144#1.offset, main_#t~mem145#1, main_#t~mem5#1, main_#t~post6#1, main_#t~mem7#1, main_#t~mem149#1, main_#t~mem148#1, main_#t~mem150#1, main_#t~mem151#1, main_#t~mem153#1, main_#t~mem152#1, main_#t~mem154#1, main_#t~mem155#1, main_#t~mem157#1, main_#t~mem156#1, main_#t~mem158#1, main_#t~mem159#1, main_#t~switch160#1, main_#t~mem161#1, main_#t~mem162#1, main_#t~mem163#1, main_#t~mem164#1, main_#t~mem165#1, main_#t~mem166#1, main_#t~mem167#1, main_#t~mem168#1, main_#t~mem169#1, main_#t~mem170#1, main_#t~mem171#1, main_~_hj_i~1#1, main_~_hj_j~1#1, main_~_hj_k~1#1, main_~_hj_key~1#1.base, main_~_hj_key~1#1.offset, main_#t~mem172#1.base, main_#t~mem172#1.offset, main_#t~mem173#1, main_#t~mem174#1.base, main_#t~mem174#1.offset, main_#t~mem175#1.base, main_#t~mem175#1.offset, main_#t~mem176#1.base, main_#t~mem176#1.offset, main_#t~mem177#1.base, main_#t~mem177#1.offset, main_#t~mem178#1.base, main_#t~mem178#1.offset, main_#t~mem179#1.base, main_#t~mem179#1.offset, main_#t~mem180#1.base, main_#t~mem180#1.offset, main_#t~mem181#1, main_#t~mem182#1, main_#t~mem183#1, main_#t~short184#1, main_#t~mem185#1.base, main_#t~mem185#1.offset, main_#t~ret186#1, main_#t~mem187#1.base, main_#t~mem187#1.offset, main_#t~mem188#1.base, main_#t~mem188#1.offset, main_#t~mem189#1.base, main_#t~mem189#1.offset, main_#t~mem190#1, main_~_hf_bkt~0#1, main_~_hf_hashv~0#1, main_#t~mem191#1.base, main_#t~mem191#1.offset, main_#t~mem192#1.base, main_#t~mem192#1.offset, main_#t~short193#1, main_#t~mem194#1.base, main_#t~mem194#1.offset, main_#t~mem195#1.base, main_#t~mem195#1.offset, main_#t~mem196#1.base, main_#t~mem196#1.offset, main_#t~mem197#1.base, main_#t~mem197#1.offset, main_#t~mem198#1.base, main_#t~mem198#1.offset, main_#t~mem199#1.base, main_#t~mem199#1.offset, main_#t~mem200#1.base, main_#t~mem200#1.offset, main_#t~mem201#1.base, main_#t~mem201#1.offset, main_#t~mem202#1, main_#t~mem203#1.base, main_#t~mem203#1.offset, main_#t~mem204#1.base, main_#t~mem204#1.offset, main_#t~mem205#1.base, main_#t~mem205#1.offset, main_#t~mem206#1, main_#t~mem207#1.base, main_#t~mem207#1.offset, main_#t~mem208#1.base, main_#t~mem208#1.offset, main_#t~mem209#1.base, main_#t~mem209#1.offset, main_#t~mem210#1.base, main_#t~mem210#1.offset, main_#t~mem211#1.base, main_#t~mem211#1.offset, main_#t~mem212#1, main_#t~mem213#1.base, main_#t~mem213#1.offset, main_#t~mem216#1, main_#t~mem214#1.base, main_#t~mem214#1.offset, main_#t~mem215#1, main_#t~mem217#1.base, main_#t~mem217#1.offset, main_#t~mem218#1.base, main_#t~mem218#1.offset, main_#t~mem219#1, main_#t~post220#1, main_#t~mem221#1.base, main_#t~mem221#1.offset, main_#t~mem222#1.base, main_#t~mem222#1.offset, main_#t~mem223#1.base, main_#t~mem223#1.offset, main_#t~mem224#1.base, main_#t~mem224#1.offset, main_#t~mem225#1.base, main_#t~mem225#1.offset, main_#t~mem226#1.base, main_#t~mem226#1.offset, main_#t~mem227#1.base, main_#t~mem227#1.offset, main_#t~mem228#1.base, main_#t~mem228#1.offset, main_~_hd_head~0#1.base, main_~_hd_head~0#1.offset, main_#t~mem229#1.base, main_#t~mem229#1.offset, main_#t~mem230#1, main_#t~post231#1, main_~_hd_bkt~0#1, main_~_hd_hh_del~0#1.base, main_~_hd_hh_del~0#1.offset, main_#t~mem232#1.base, main_#t~mem232#1.offset, main_#t~mem233#1, main_#t~mem146#1, main_#t~mem147#1, main_~#i~0#1.base, main_~#i~0#1.offset, main_~user~0#1.base, main_~user~0#1.offset, main_~tmp~0#1.base, main_~tmp~0#1.offset, main_~users~0#1.base, main_~users~0#1.offset;call main_~#i~0#1.base, main_~#i~0#1.offset := #Ultimate.allocOnStack(4);havoc main_~user~0#1.base, main_~user~0#1.offset;havoc main_~tmp~0#1.base, main_~tmp~0#1.offset;main_~users~0#1.base, main_~users~0#1.offset := 0, 0;call write~int(0, main_~#i~0#1.base, main_~#i~0#1.offset, 4); {13624#true} is VALID [2022-02-21 03:19:01,020 INFO L290 TraceCheckUtils]: 2: Hoare triple {13624#true} call main_#t~mem7#1 := read~int(main_~#i~0#1.base, main_~#i~0#1.offset, 4); {13624#true} is VALID [2022-02-21 03:19:01,021 INFO L290 TraceCheckUtils]: 3: Hoare triple {13624#true} assume !!(main_#t~mem7#1 < 10);havoc main_#t~mem7#1;call main_#t~malloc8#1.base, main_#t~malloc8#1.offset := #Ultimate.allocOnHeap(40);main_~user~0#1.base, main_~user~0#1.offset := main_#t~malloc8#1.base, main_#t~malloc8#1.offset;havoc main_#t~malloc8#1.base, main_#t~malloc8#1.offset; {13624#true} is VALID [2022-02-21 03:19:01,021 INFO L290 TraceCheckUtils]: 4: Hoare triple {13624#true} assume !(main_~user~0#1.base == 0 && main_~user~0#1.offset == 0); {13624#true} is VALID [2022-02-21 03:19:01,021 INFO L290 TraceCheckUtils]: 5: Hoare triple {13624#true} call main_#t~mem9#1 := read~int(main_~#i~0#1.base, main_~#i~0#1.offset, 4);call write~int(main_#t~mem9#1, main_~user~0#1.base, main_~user~0#1.offset, 4);havoc main_#t~mem9#1;call main_#t~mem10#1 := read~int(main_~#i~0#1.base, main_~#i~0#1.offset, 4);call main_#t~mem11#1 := read~int(main_~#i~0#1.base, main_~#i~0#1.offset, 4); {13624#true} is VALID [2022-02-21 03:19:01,021 INFO L290 TraceCheckUtils]: 6: Hoare triple {13624#true} assume main_#t~mem10#1 * main_#t~mem11#1 <= 2147483647; {13624#true} is VALID [2022-02-21 03:19:01,021 INFO L290 TraceCheckUtils]: 7: Hoare triple {13624#true} assume main_#t~mem10#1 * main_#t~mem11#1 >= -2147483648;call write~int(main_#t~mem10#1 * main_#t~mem11#1, main_~user~0#1.base, 4 + main_~user~0#1.offset, 4);havoc main_#t~mem10#1;havoc main_#t~mem11#1; {13624#true} is VALID [2022-02-21 03:19:01,022 INFO L290 TraceCheckUtils]: 8: Hoare triple {13624#true} havoc main_~_ha_hashv~0#1; {13624#true} is VALID [2022-02-21 03:19:01,022 INFO L290 TraceCheckUtils]: 9: Hoare triple {13624#true} goto; {13624#true} is VALID [2022-02-21 03:19:01,022 INFO L290 TraceCheckUtils]: 10: Hoare triple {13624#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; {13624#true} is VALID [2022-02-21 03:19:01,022 INFO L290 TraceCheckUtils]: 11: Hoare triple {13624#true} assume !(main_~_hj_k~0#1 % 4294967296 >= 12); {13624#true} is VALID [2022-02-21 03:19:01,022 INFO L290 TraceCheckUtils]: 12: Hoare triple {13624#true} main_~_ha_hashv~0#1 := 4 + main_~_ha_hashv~0#1;main_#t~switch24#1 := 11 == main_~_hj_k~0#1; {13624#true} is VALID [2022-02-21 03:19:01,022 INFO L290 TraceCheckUtils]: 13: Hoare triple {13624#true} assume !main_#t~switch24#1; {13624#true} is VALID [2022-02-21 03:19:01,022 INFO L290 TraceCheckUtils]: 14: Hoare triple {13624#true} main_#t~switch24#1 := main_#t~switch24#1 || 10 == main_~_hj_k~0#1; {13624#true} is VALID [2022-02-21 03:19:01,023 INFO L290 TraceCheckUtils]: 15: Hoare triple {13624#true} assume !main_#t~switch24#1; {13624#true} is VALID [2022-02-21 03:19:01,023 INFO L290 TraceCheckUtils]: 16: Hoare triple {13624#true} main_#t~switch24#1 := main_#t~switch24#1 || 9 == main_~_hj_k~0#1; {13624#true} is VALID [2022-02-21 03:19:01,023 INFO L290 TraceCheckUtils]: 17: Hoare triple {13624#true} assume !main_#t~switch24#1; {13624#true} is VALID [2022-02-21 03:19:01,023 INFO L290 TraceCheckUtils]: 18: Hoare triple {13624#true} main_#t~switch24#1 := main_#t~switch24#1 || 8 == main_~_hj_k~0#1; {13624#true} is VALID [2022-02-21 03:19:01,023 INFO L290 TraceCheckUtils]: 19: Hoare triple {13624#true} assume !main_#t~switch24#1; {13624#true} is VALID [2022-02-21 03:19:01,023 INFO L290 TraceCheckUtils]: 20: Hoare triple {13624#true} main_#t~switch24#1 := main_#t~switch24#1 || 7 == main_~_hj_k~0#1; {13624#true} is VALID [2022-02-21 03:19:01,023 INFO L290 TraceCheckUtils]: 21: Hoare triple {13624#true} assume !main_#t~switch24#1; {13624#true} is VALID [2022-02-21 03:19:01,023 INFO L290 TraceCheckUtils]: 22: Hoare triple {13624#true} main_#t~switch24#1 := main_#t~switch24#1 || 6 == main_~_hj_k~0#1; {13624#true} is VALID [2022-02-21 03:19:01,024 INFO L290 TraceCheckUtils]: 23: Hoare triple {13624#true} assume !main_#t~switch24#1; {13624#true} is VALID [2022-02-21 03:19:01,024 INFO L290 TraceCheckUtils]: 24: Hoare triple {13624#true} main_#t~switch24#1 := main_#t~switch24#1 || 5 == main_~_hj_k~0#1; {13624#true} is VALID [2022-02-21 03:19:01,024 INFO L290 TraceCheckUtils]: 25: Hoare triple {13624#true} assume !main_#t~switch24#1; {13624#true} is VALID [2022-02-21 03:19:01,024 INFO L290 TraceCheckUtils]: 26: Hoare triple {13624#true} main_#t~switch24#1 := main_#t~switch24#1 || 4 == main_~_hj_k~0#1; {13624#true} is VALID [2022-02-21 03:19:01,024 INFO L290 TraceCheckUtils]: 27: Hoare triple {13624#true} assume main_#t~switch24#1;call main_#t~mem32#1 := read~int(main_~_hj_key~0#1.base, 3 + main_~_hj_key~0#1.offset, 1);main_~_hj_i~0#1 := main_~_hj_i~0#1 + 16777216 * (main_#t~mem32#1 % 256);havoc main_#t~mem32#1; {13624#true} is VALID [2022-02-21 03:19:01,024 INFO L290 TraceCheckUtils]: 28: Hoare triple {13624#true} main_#t~switch24#1 := main_#t~switch24#1 || 3 == main_~_hj_k~0#1; {13624#true} is VALID [2022-02-21 03:19:01,024 INFO L290 TraceCheckUtils]: 29: Hoare triple {13624#true} assume main_#t~switch24#1;call main_#t~mem33#1 := read~int(main_~_hj_key~0#1.base, 2 + main_~_hj_key~0#1.offset, 1);main_~_hj_i~0#1 := main_~_hj_i~0#1 + 65536 * (main_#t~mem33#1 % 256);havoc main_#t~mem33#1; {13624#true} is VALID [2022-02-21 03:19:01,025 INFO L290 TraceCheckUtils]: 30: Hoare triple {13624#true} main_#t~switch24#1 := main_#t~switch24#1 || 2 == main_~_hj_k~0#1; {13624#true} is VALID [2022-02-21 03:19:01,025 INFO L290 TraceCheckUtils]: 31: Hoare triple {13624#true} assume main_#t~switch24#1;call main_#t~mem34#1 := read~int(main_~_hj_key~0#1.base, 1 + main_~_hj_key~0#1.offset, 1);main_~_hj_i~0#1 := main_~_hj_i~0#1 + 256 * (main_#t~mem34#1 % 256);havoc main_#t~mem34#1; {13624#true} is VALID [2022-02-21 03:19:01,025 INFO L290 TraceCheckUtils]: 32: Hoare triple {13624#true} main_#t~switch24#1 := main_#t~switch24#1 || 1 == main_~_hj_k~0#1; {13624#true} is VALID [2022-02-21 03:19:01,025 INFO L290 TraceCheckUtils]: 33: Hoare triple {13624#true} assume main_#t~switch24#1;call main_#t~mem35#1 := read~int(main_~_hj_key~0#1.base, main_~_hj_key~0#1.offset, 1);main_~_hj_i~0#1 := main_~_hj_i~0#1 + main_#t~mem35#1 % 256;havoc main_#t~mem35#1; {13624#true} is VALID [2022-02-21 03:19:01,025 INFO L290 TraceCheckUtils]: 34: Hoare triple {13624#true} havoc main_#t~switch24#1; {13624#true} is VALID [2022-02-21 03:19:01,025 INFO L290 TraceCheckUtils]: 35: Hoare triple {13624#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)))); {13624#true} is VALID [2022-02-21 03:19:01,025 INFO L290 TraceCheckUtils]: 36: Hoare triple {13624#true} goto; {13624#true} is VALID [2022-02-21 03:19:01,026 INFO L290 TraceCheckUtils]: 37: Hoare triple {13624#true} goto; {13624#true} is VALID [2022-02-21 03:19:01,026 INFO L290 TraceCheckUtils]: 38: Hoare triple {13624#true} goto; {13624#true} is VALID [2022-02-21 03:19:01,026 INFO L290 TraceCheckUtils]: 39: Hoare triple {13624#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); {13624#true} is VALID [2022-02-21 03:19:01,026 INFO L290 TraceCheckUtils]: 40: Hoare triple {13624#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); {13624#true} is VALID [2022-02-21 03:19:01,026 INFO L290 TraceCheckUtils]: 41: Hoare triple {13624#true} call main_#t~malloc36#1.base, main_#t~malloc36#1.offset := #Ultimate.allocOnHeap(44);call write~$Pointer$(main_#t~malloc36#1.base, main_#t~malloc36#1.offset, main_~user~0#1.base, 8 + main_~user~0#1.offset, 4);havoc main_#t~malloc36#1.base, main_#t~malloc36#1.offset;call main_#t~mem37#1.base, main_#t~mem37#1.offset := read~$Pointer$(main_~user~0#1.base, 8 + main_~user~0#1.offset, 4); {13624#true} is VALID [2022-02-21 03:19:01,026 INFO L290 TraceCheckUtils]: 42: Hoare triple {13624#true} assume !(main_#t~mem37#1.base == 0 && main_#t~mem37#1.offset == 0);havoc main_#t~mem37#1.base, main_#t~mem37#1.offset;call main_#t~mem38#1.base, main_#t~mem38#1.offset := read~$Pointer$(main_~user~0#1.base, 8 + main_~user~0#1.offset, 4); {13624#true} is VALID [2022-02-21 03:19:01,027 INFO L272 TraceCheckUtils]: 43: Hoare triple {13624#true} call main_#t~memset~res39#1.base, main_#t~memset~res39#1.offset := #Ultimate.C_memset(main_#t~mem38#1.base, main_#t~mem38#1.offset, 0, 44); {13624#true} is VALID [2022-02-21 03:19:01,027 INFO L290 TraceCheckUtils]: 44: Hoare triple {13624#true} #t~loopctr235 := 0; {13624#true} is VALID [2022-02-21 03:19:01,027 INFO L290 TraceCheckUtils]: 45: Hoare triple {13624#true} assume !(#t~loopctr235 % 4294967296 < #amount % 4294967296); {13624#true} is VALID [2022-02-21 03:19:01,027 INFO L290 TraceCheckUtils]: 46: Hoare triple {13624#true} assume #res.base == #ptr.base && #res.offset == #ptr.offset; {13624#true} is VALID [2022-02-21 03:19:01,027 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {13624#true} {13624#true} #914#return; {13624#true} is VALID [2022-02-21 03:19:01,029 INFO L290 TraceCheckUtils]: 48: Hoare triple {13624#true} havoc main_#t~mem38#1.base, main_#t~mem38#1.offset;havoc main_#t~memset~res39#1.base, main_#t~memset~res39#1.offset;call main_#t~mem40#1.base, main_#t~mem40#1.offset := read~$Pointer$(main_~user~0#1.base, 8 + main_~user~0#1.offset, 4);call write~$Pointer$(main_~user~0#1.base, 8 + main_~user~0#1.offset, main_#t~mem40#1.base, 16 + main_#t~mem40#1.offset, 4);havoc main_#t~mem40#1.base, main_#t~mem40#1.offset;call main_#t~mem41#1.base, main_#t~mem41#1.offset := read~$Pointer$(main_~user~0#1.base, 8 + main_~user~0#1.offset, 4);call write~int(32, main_#t~mem41#1.base, 4 + main_#t~mem41#1.offset, 4);havoc main_#t~mem41#1.base, main_#t~mem41#1.offset;call main_#t~mem42#1.base, main_#t~mem42#1.offset := read~$Pointer$(main_~user~0#1.base, 8 + main_~user~0#1.offset, 4);call write~int(5, main_#t~mem42#1.base, 8 + main_#t~mem42#1.offset, 4);havoc main_#t~mem42#1.base, main_#t~mem42#1.offset;call main_#t~mem43#1.base, main_#t~mem43#1.offset := read~$Pointer$(main_~user~0#1.base, 8 + main_~user~0#1.offset, 4);call write~int((if 8 + main_~user~0#1.offset - main_~user~0#1.offset < 0 && 0 != (8 + main_~user~0#1.offset - main_~user~0#1.offset) % 1 then 1 + (8 + main_~user~0#1.offset - main_~user~0#1.offset) / 1 else (8 + main_~user~0#1.offset - main_~user~0#1.offset) / 1), main_#t~mem43#1.base, 20 + main_#t~mem43#1.offset, 4);havoc main_#t~mem43#1.base, main_#t~mem43#1.offset;call main_#t~mem44#1.base, main_#t~mem44#1.offset := read~$Pointer$(main_~user~0#1.base, 8 + main_~user~0#1.offset, 4);call main_#t~malloc45#1.base, main_#t~malloc45#1.offset := #Ultimate.allocOnHeap(384);call write~$Pointer$(main_#t~malloc45#1.base, main_#t~malloc45#1.offset, main_#t~mem44#1.base, main_#t~mem44#1.offset, 4);havoc main_#t~mem44#1.base, main_#t~mem44#1.offset;havoc main_#t~malloc45#1.base, main_#t~malloc45#1.offset;call main_#t~mem46#1.base, main_#t~mem46#1.offset := read~$Pointer$(main_~user~0#1.base, 8 + main_~user~0#1.offset, 4);call write~int(2685476833, main_#t~mem46#1.base, 40 + main_#t~mem46#1.offset, 4);havoc main_#t~mem46#1.base, main_#t~mem46#1.offset;call main_#t~mem47#1.base, main_#t~mem47#1.offset := read~$Pointer$(main_~user~0#1.base, 8 + main_~user~0#1.offset, 4);call main_#t~mem48#1.base, main_#t~mem48#1.offset := read~$Pointer$(main_#t~mem47#1.base, main_#t~mem47#1.offset, 4); {13624#true} is VALID [2022-02-21 03:19:01,029 INFO L290 TraceCheckUtils]: 49: Hoare triple {13624#true} assume !(main_#t~mem48#1.base == 0 && main_#t~mem48#1.offset == 0);havoc main_#t~mem47#1.base, main_#t~mem47#1.offset;havoc main_#t~mem48#1.base, main_#t~mem48#1.offset;call main_#t~mem50#1.base, main_#t~mem50#1.offset := read~$Pointer$(main_~user~0#1.base, 8 + main_~user~0#1.offset, 4);call main_#t~mem51#1.base, main_#t~mem51#1.offset := read~$Pointer$(main_#t~mem50#1.base, main_#t~mem50#1.offset, 4); {13624#true} is VALID [2022-02-21 03:19:01,029 INFO L272 TraceCheckUtils]: 50: Hoare triple {13624#true} call main_#t~memset~res52#1.base, main_#t~memset~res52#1.offset := #Ultimate.C_memset(main_#t~mem51#1.base, main_#t~mem51#1.offset, 0, 384); {13624#true} is VALID [2022-02-21 03:19:01,029 INFO L290 TraceCheckUtils]: 51: Hoare triple {13624#true} #t~loopctr235 := 0; {13782#(= |#Ultimate.C_memset_#t~loopctr235| 0)} is VALID [2022-02-21 03:19:01,030 INFO L290 TraceCheckUtils]: 52: Hoare triple {13782#(= |#Ultimate.C_memset_#t~loopctr235| 0)} assume !(#t~loopctr235 % 4294967296 < #amount % 4294967296); {13786#(not (< 0 (mod |#Ultimate.C_memset_#amount| 4294967296)))} is VALID [2022-02-21 03:19:01,030 INFO L290 TraceCheckUtils]: 53: Hoare triple {13786#(not (< 0 (mod |#Ultimate.C_memset_#amount| 4294967296)))} assume #res.base == #ptr.base && #res.offset == #ptr.offset; {13786#(not (< 0 (mod |#Ultimate.C_memset_#amount| 4294967296)))} is VALID [2022-02-21 03:19:01,032 INFO L284 TraceCheckUtils]: 54: Hoare quadruple {13786#(not (< 0 (mod |#Ultimate.C_memset_#amount| 4294967296)))} {13624#true} #916#return; {13625#false} is VALID [2022-02-21 03:19:01,032 INFO L290 TraceCheckUtils]: 55: Hoare triple {13625#false} havoc main_#t~mem50#1.base, main_#t~mem50#1.offset;havoc main_#t~mem51#1.base, main_#t~mem51#1.offset;havoc main_#t~memset~res52#1.base, main_#t~memset~res52#1.offset; {13625#false} is VALID [2022-02-21 03:19:01,032 INFO L290 TraceCheckUtils]: 56: Hoare triple {13625#false} goto; {13625#false} is VALID [2022-02-21 03:19:01,032 INFO L290 TraceCheckUtils]: 57: Hoare triple {13625#false} main_~users~0#1.base, main_~users~0#1.offset := main_~user~0#1.base, main_~user~0#1.offset; {13625#false} is VALID [2022-02-21 03:19:01,032 INFO L290 TraceCheckUtils]: 58: Hoare triple {13625#false} havoc main_~_ha_bkt~0#1;call main_#t~mem61#1.base, main_#t~mem61#1.offset := read~$Pointer$(main_~users~0#1.base, 8 + main_~users~0#1.offset, 4);call main_#t~mem62#1 := read~int(main_#t~mem61#1.base, 12 + main_#t~mem61#1.offset, 4);main_#t~post63#1 := main_#t~mem62#1;call write~int(1 + main_#t~post63#1, main_#t~mem61#1.base, 12 + main_#t~mem61#1.offset, 4);havoc main_#t~mem61#1.base, main_#t~mem61#1.offset;havoc main_#t~mem62#1;havoc main_#t~post63#1; {13625#false} is VALID [2022-02-21 03:19:01,032 INFO L290 TraceCheckUtils]: 59: Hoare triple {13625#false} call main_#t~mem64#1.base, main_#t~mem64#1.offset := read~$Pointer$(main_~users~0#1.base, 8 + main_~users~0#1.offset, 4);call main_#t~mem65#1 := read~int(main_#t~mem64#1.base, 4 + main_#t~mem64#1.offset, 4);main_~_ha_bkt~0#1 := (if 0 == main_~_ha_hashv~0#1 || 0 == main_#t~mem65#1 - 1 then 0 else (if 1 == main_#t~mem65#1 - 1 then (if 1 == main_~_ha_hashv~0#1 || 0 == main_~_ha_hashv~0#1 then main_~_ha_hashv~0#1 else (if main_~_ha_hashv~0#1 >= 0 then main_~_ha_hashv~0#1 % 2 else ~bitwiseAnd(main_~_ha_hashv~0#1, main_#t~mem65#1 - 1))) else (if 1 == main_~_ha_hashv~0#1 then (if 1 == main_#t~mem65#1 - 1 || 0 == main_#t~mem65#1 - 1 then main_#t~mem65#1 - 1 else (if main_#t~mem65#1 - 1 >= 0 then (main_#t~mem65#1 - 1) % 2 else ~bitwiseAnd(main_~_ha_hashv~0#1, main_#t~mem65#1 - 1))) else ~bitwiseAnd(main_~_ha_hashv~0#1, main_#t~mem65#1 - 1))));havoc main_#t~mem64#1.base, main_#t~mem64#1.offset;havoc main_#t~mem65#1; {13625#false} is VALID [2022-02-21 03:19:01,033 INFO L290 TraceCheckUtils]: 60: Hoare triple {13625#false} goto; {13625#false} is VALID [2022-02-21 03:19:01,033 INFO L290 TraceCheckUtils]: 61: Hoare triple {13625#false} call main_#t~mem66#1.base, main_#t~mem66#1.offset := read~$Pointer$(main_~users~0#1.base, 8 + main_~users~0#1.offset, 4);call main_#t~mem67#1.base, main_#t~mem67#1.offset := read~$Pointer$(main_#t~mem66#1.base, main_#t~mem66#1.offset, 4);main_~_ha_head~0#1.base, main_~_ha_head~0#1.offset := main_#t~mem67#1.base, main_#t~mem67#1.offset + 12 * (if main_~_ha_bkt~0#1 % 4294967296 % 4294967296 <= 2147483647 then main_~_ha_bkt~0#1 % 4294967296 % 4294967296 else main_~_ha_bkt~0#1 % 4294967296 % 4294967296 - 4294967296);havoc main_#t~mem66#1.base, main_#t~mem66#1.offset;havoc main_#t~mem67#1.base, main_#t~mem67#1.offset;call main_#t~mem68#1 := read~int(main_~_ha_head~0#1.base, 4 + main_~_ha_head~0#1.offset, 4);main_#t~post69#1 := main_#t~mem68#1;call write~int(1 + main_#t~post69#1, main_~_ha_head~0#1.base, 4 + main_~_ha_head~0#1.offset, 4);havoc main_#t~mem68#1;havoc main_#t~post69#1;call main_#t~mem70#1.base, main_#t~mem70#1.offset := read~$Pointer$(main_~_ha_head~0#1.base, main_~_ha_head~0#1.offset, 4);call write~$Pointer$(main_#t~mem70#1.base, main_#t~mem70#1.offset, main_~user~0#1.base, 24 + main_~user~0#1.offset, 4);havoc main_#t~mem70#1.base, main_#t~mem70#1.offset;call write~$Pointer$(0, 0, main_~user~0#1.base, 20 + main_~user~0#1.offset, 4);call main_#t~mem71#1.base, main_#t~mem71#1.offset := read~$Pointer$(main_~_ha_head~0#1.base, main_~_ha_head~0#1.offset, 4); {13625#false} is VALID [2022-02-21 03:19:01,033 INFO L290 TraceCheckUtils]: 62: Hoare triple {13625#false} assume main_#t~mem71#1.base != 0 || main_#t~mem71#1.offset != 0;havoc main_#t~mem71#1.base, main_#t~mem71#1.offset;call main_#t~mem72#1.base, main_#t~mem72#1.offset := read~$Pointer$(main_~_ha_head~0#1.base, main_~_ha_head~0#1.offset, 4);call write~$Pointer$(main_~user~0#1.base, 8 + main_~user~0#1.offset, main_#t~mem72#1.base, 12 + main_#t~mem72#1.offset, 4);havoc main_#t~mem72#1.base, main_#t~mem72#1.offset; {13625#false} is VALID [2022-02-21 03:19:01,033 INFO L290 TraceCheckUtils]: 63: Hoare triple {13625#false} call write~$Pointer$(main_~user~0#1.base, 8 + main_~user~0#1.offset, main_~_ha_head~0#1.base, main_~_ha_head~0#1.offset, 4);call main_#t~mem74#1 := read~int(main_~_ha_head~0#1.base, 4 + main_~_ha_head~0#1.offset, 4);call main_#t~mem73#1 := read~int(main_~_ha_head~0#1.base, 8 + main_~_ha_head~0#1.offset, 4);main_#t~short77#1 := main_#t~mem74#1 % 4294967296 >= 10 * (1 + main_#t~mem73#1) % 4294967296; {13625#false} is VALID [2022-02-21 03:19:01,033 INFO L290 TraceCheckUtils]: 64: Hoare triple {13625#false} assume main_#t~short77#1;call main_#t~mem75#1.base, main_#t~mem75#1.offset := read~$Pointer$(main_~user~0#1.base, 8 + main_~user~0#1.offset, 4);call main_#t~mem76#1 := read~int(main_#t~mem75#1.base, 36 + main_#t~mem75#1.offset, 4);main_#t~short77#1 := 0 == main_#t~mem76#1 % 4294967296; {13625#false} is VALID [2022-02-21 03:19:01,033 INFO L290 TraceCheckUtils]: 65: Hoare triple {13625#false} assume !main_#t~short77#1;havoc main_#t~mem74#1;havoc main_#t~mem73#1;havoc main_#t~mem75#1.base, main_#t~mem75#1.offset;havoc main_#t~mem76#1;havoc main_#t~short77#1; {13625#false} is VALID [2022-02-21 03:19:01,033 INFO L290 TraceCheckUtils]: 66: Hoare triple {13625#false} goto; {13625#false} is VALID [2022-02-21 03:19:01,034 INFO L290 TraceCheckUtils]: 67: Hoare triple {13625#false} goto; {13625#false} is VALID [2022-02-21 03:19:01,034 INFO L290 TraceCheckUtils]: 68: Hoare triple {13625#false} goto; {13625#false} is VALID [2022-02-21 03:19:01,034 INFO L290 TraceCheckUtils]: 69: Hoare triple {13625#false} goto; {13625#false} is VALID [2022-02-21 03:19:01,034 INFO L290 TraceCheckUtils]: 70: Hoare triple {13625#false} call main_#t~mem144#1.base, main_#t~mem144#1.offset := read~$Pointer$(main_~user~0#1.base, 8 + main_~user~0#1.offset, 4);call main_#t~mem145#1 := read~int(main_#t~mem144#1.base, 12 + main_#t~mem144#1.offset, 4); {13625#false} is VALID [2022-02-21 03:19:01,034 INFO L272 TraceCheckUtils]: 71: Hoare triple {13625#false} call test_int((if main_#t~mem145#1 % 4294967296 % 4294967296 <= 2147483647 then main_#t~mem145#1 % 4294967296 % 4294967296 else main_#t~mem145#1 % 4294967296 % 4294967296 - 4294967296)); {13625#false} is VALID [2022-02-21 03:19:01,034 INFO L290 TraceCheckUtils]: 72: Hoare triple {13625#false} ~a := #in~a;#t~post3 := ~count_int~0; {13625#false} is VALID [2022-02-21 03:19:01,034 INFO L290 TraceCheckUtils]: 73: Hoare triple {13625#false} assume 1 + #t~post3 <= 2147483647; {13625#false} is VALID [2022-02-21 03:19:01,034 INFO L290 TraceCheckUtils]: 74: Hoare triple {13625#false} assume 1 + #t~post3 >= -2147483648;~count_int~0 := 1 + #t~post3;#t~switch4 := 0 == #t~post3; {13625#false} is VALID [2022-02-21 03:19:01,035 INFO L290 TraceCheckUtils]: 75: Hoare triple {13625#false} assume #t~switch4; {13625#false} is VALID [2022-02-21 03:19:01,035 INFO L272 TraceCheckUtils]: 76: Hoare triple {13625#false} call __VERIFIER_assert((if 1 == ~a then 1 else 0)); {13625#false} is VALID [2022-02-21 03:19:01,035 INFO L290 TraceCheckUtils]: 77: Hoare triple {13625#false} ~cond := #in~cond; {13625#false} is VALID [2022-02-21 03:19:01,035 INFO L290 TraceCheckUtils]: 78: Hoare triple {13625#false} assume !(0 == ~cond); {13625#false} is VALID [2022-02-21 03:19:01,035 INFO L290 TraceCheckUtils]: 79: Hoare triple {13625#false} assume true; {13625#false} is VALID [2022-02-21 03:19:01,035 INFO L284 TraceCheckUtils]: 80: Hoare quadruple {13625#false} {13625#false} #884#return; {13625#false} is VALID [2022-02-21 03:19:01,035 INFO L290 TraceCheckUtils]: 81: Hoare triple {13625#false} havoc #t~post3;havoc #t~switch4; {13625#false} is VALID [2022-02-21 03:19:01,036 INFO L290 TraceCheckUtils]: 82: Hoare triple {13625#false} assume true; {13625#false} is VALID [2022-02-21 03:19:01,036 INFO L284 TraceCheckUtils]: 83: Hoare quadruple {13625#false} {13625#false} #920#return; {13625#false} is VALID [2022-02-21 03:19:01,036 INFO L290 TraceCheckUtils]: 84: Hoare triple {13625#false} havoc main_#t~mem144#1.base, main_#t~mem144#1.offset;havoc main_#t~mem145#1; {13625#false} is VALID [2022-02-21 03:19:01,036 INFO L290 TraceCheckUtils]: 85: Hoare triple {13625#false} call main_#t~mem5#1 := read~int(main_~#i~0#1.base, main_~#i~0#1.offset, 4);main_#t~post6#1 := main_#t~mem5#1; {13625#false} is VALID [2022-02-21 03:19:01,036 INFO L290 TraceCheckUtils]: 86: Hoare triple {13625#false} assume !(1 + main_#t~post6#1 <= 2147483647); {13625#false} is VALID [2022-02-21 03:19:01,037 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-02-21 03:19:01,037 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-21 03:19:01,037 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 03:19:01,037 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [830405342] [2022-02-21 03:19:01,037 WARN L317 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-02-21 03:19:01,037 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1355104740] [2022-02-21 03:19:01,037 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1355104740] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-21 03:19:01,037 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-21 03:19:01,038 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-02-21 03:19:01,038 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1113346445] [2022-02-21 03:19:01,038 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-21 03:19:01,040 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 19.75) internal successors, (79), 4 states have internal predecessors, (79), 2 states have call successors, (4), 2 states have call predecessors, (4), 3 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 87 [2022-02-21 03:19:01,040 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-21 03:19:01,040 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 19.75) internal successors, (79), 4 states have internal predecessors, (79), 2 states have call successors, (4), 2 states have call predecessors, (4), 3 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-02-21 03:19:01,121 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 87 edges. 87 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:19:01,121 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-02-21 03:19:01,122 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 03:19:01,122 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-02-21 03:19:01,122 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-02-21 03:19:01,123 INFO L87 Difference]: Start difference. First operand 406 states and 527 transitions. Second operand has 4 states, 4 states have (on average 19.75) internal successors, (79), 4 states have internal predecessors, (79), 2 states have call successors, (4), 2 states have call predecessors, (4), 3 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-02-21 03:19:02,332 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:19:02,333 INFO L93 Difference]: Finished difference Result 765 states and 1007 transitions. [2022-02-21 03:19:02,333 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-02-21 03:19:02,333 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 19.75) internal successors, (79), 4 states have internal predecessors, (79), 2 states have call successors, (4), 2 states have call predecessors, (4), 3 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 87 [2022-02-21 03:19:02,333 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-21 03:19:02,333 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 19.75) internal successors, (79), 4 states have internal predecessors, (79), 2 states have call successors, (4), 2 states have call predecessors, (4), 3 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-02-21 03:19:02,338 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 626 transitions. [2022-02-21 03:19:02,338 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 19.75) internal successors, (79), 4 states have internal predecessors, (79), 2 states have call successors, (4), 2 states have call predecessors, (4), 3 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-02-21 03:19:02,342 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 626 transitions. [2022-02-21 03:19:02,342 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 626 transitions. [2022-02-21 03:19:02,886 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 626 edges. 626 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:19:02,912 INFO L225 Difference]: With dead ends: 765 [2022-02-21 03:19:02,913 INFO L226 Difference]: Without dead ends: 412 [2022-02-21 03:19:02,914 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 84 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:19:02,914 INFO L933 BasicCegarLoop]: 308 mSDtfsCounter, 2 mSDsluCounter, 612 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 920 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:19:02,915 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2 Valid, 920 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-21 03:19:02,915 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 412 states. [2022-02-21 03:19:03,000 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 412 to 412. [2022-02-21 03:19:03,000 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 03:19:03,002 INFO L82 GeneralOperation]: Start isEquivalent. First operand 412 states. Second operand has 412 states, 374 states have (on average 1.2914438502673797) internal successors, (483), 397 states have internal predecessors, (483), 25 states have call successors, (25), 5 states have call predecessors, (25), 6 states have return successors, (27), 10 states have call predecessors, (27), 25 states have call successors, (27) [2022-02-21 03:19:03,003 INFO L74 IsIncluded]: Start isIncluded. First operand 412 states. Second operand has 412 states, 374 states have (on average 1.2914438502673797) internal successors, (483), 397 states have internal predecessors, (483), 25 states have call successors, (25), 5 states have call predecessors, (25), 6 states have return successors, (27), 10 states have call predecessors, (27), 25 states have call successors, (27) [2022-02-21 03:19:03,004 INFO L87 Difference]: Start difference. First operand 412 states. Second operand has 412 states, 374 states have (on average 1.2914438502673797) internal successors, (483), 397 states have internal predecessors, (483), 25 states have call successors, (25), 5 states have call predecessors, (25), 6 states have return successors, (27), 10 states have call predecessors, (27), 25 states have call successors, (27) [2022-02-21 03:19:03,019 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:19:03,019 INFO L93 Difference]: Finished difference Result 412 states and 535 transitions. [2022-02-21 03:19:03,019 INFO L276 IsEmpty]: Start isEmpty. Operand 412 states and 535 transitions. [2022-02-21 03:19:03,021 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:19:03,021 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:19:03,023 INFO L74 IsIncluded]: Start isIncluded. First operand has 412 states, 374 states have (on average 1.2914438502673797) internal successors, (483), 397 states have internal predecessors, (483), 25 states have call successors, (25), 5 states have call predecessors, (25), 6 states have return successors, (27), 10 states have call predecessors, (27), 25 states have call successors, (27) Second operand 412 states. [2022-02-21 03:19:03,024 INFO L87 Difference]: Start difference. First operand has 412 states, 374 states have (on average 1.2914438502673797) internal successors, (483), 397 states have internal predecessors, (483), 25 states have call successors, (25), 5 states have call predecessors, (25), 6 states have return successors, (27), 10 states have call predecessors, (27), 25 states have call successors, (27) Second operand 412 states. [2022-02-21 03:19:03,038 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:19:03,039 INFO L93 Difference]: Finished difference Result 412 states and 535 transitions. [2022-02-21 03:19:03,039 INFO L276 IsEmpty]: Start isEmpty. Operand 412 states and 535 transitions. [2022-02-21 03:19:03,040 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:19:03,040 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:19:03,040 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 03:19:03,040 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 03:19:03,041 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 412 states, 374 states have (on average 1.2914438502673797) internal successors, (483), 397 states have internal predecessors, (483), 25 states have call successors, (25), 5 states have call predecessors, (25), 6 states have return successors, (27), 10 states have call predecessors, (27), 25 states have call successors, (27) [2022-02-21 03:19:03,056 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 412 states to 412 states and 535 transitions. [2022-02-21 03:19:03,056 INFO L78 Accepts]: Start accepts. Automaton has 412 states and 535 transitions. Word has length 87 [2022-02-21 03:19:03,057 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-21 03:19:03,057 INFO L470 AbstractCegarLoop]: Abstraction has 412 states and 535 transitions. [2022-02-21 03:19:03,057 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 19.75) internal successors, (79), 4 states have internal predecessors, (79), 2 states have call successors, (4), 2 states have call predecessors, (4), 3 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-02-21 03:19:03,057 INFO L276 IsEmpty]: Start isEmpty. Operand 412 states and 535 transitions. [2022-02-21 03:19:03,062 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2022-02-21 03:19:03,062 INFO L506 BasicCegarLoop]: Found error trace [2022-02-21 03:19:03,063 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-21 03:19:03,097 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:19:03,275 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-21 03:19:03,275 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [test_intErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, test_intErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2022-02-21 03:19:03,276 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:19:03,276 INFO L85 PathProgramCache]: Analyzing trace with hash 104636021, now seen corresponding path program 1 times [2022-02-21 03:19:03,276 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:19:03,276 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1907994848] [2022-02-21 03:19:03,276 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:19:03,276 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:19:03,333 ERROR L252 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-02-21 03:19:03,334 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1820148554] [2022-02-21 03:19:03,334 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:19:03,334 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-21 03:19:03,334 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:19:03,335 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:19:03,343 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:19:05,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:19:05,828 INFO L263 TraceCheckSpWp]: Trace formula consists of 737 conjuncts, 11 conjunts are in the unsatisfiable core [2022-02-21 03:19:05,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:19:05,867 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 03:19:06,068 INFO L290 TraceCheckUtils]: 0: Hoare triple {16129#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(21, 2);~count_int~0 := 0; {16129#true} is VALID [2022-02-21 03:19:06,068 INFO L290 TraceCheckUtils]: 1: Hoare triple {16129#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc8#1.base, main_#t~malloc8#1.offset, main_#t~mem9#1, main_#t~mem10#1, main_#t~mem11#1, main_#t~mem13#1, main_#t~mem12#1, main_#t~mem14#1, main_#t~mem15#1, main_#t~mem17#1, main_#t~mem16#1, main_#t~mem18#1, main_#t~mem19#1, main_#t~mem21#1, main_#t~mem20#1, main_#t~mem22#1, main_#t~mem23#1, main_#t~switch24#1, main_#t~mem25#1, main_#t~mem26#1, main_#t~mem27#1, main_#t~mem28#1, main_#t~mem29#1, main_#t~mem30#1, main_#t~mem31#1, main_#t~mem32#1, main_#t~mem33#1, main_#t~mem34#1, main_#t~mem35#1, main_~_hj_i~0#1, main_~_hj_j~0#1, main_~_hj_k~0#1, main_~_hj_key~0#1.base, main_~_hj_key~0#1.offset, main_#t~malloc36#1.base, main_#t~malloc36#1.offset, main_#t~mem37#1.base, main_#t~mem37#1.offset, main_#t~mem38#1.base, main_#t~mem38#1.offset, main_#t~memset~res39#1.base, main_#t~memset~res39#1.offset, main_#t~mem40#1.base, main_#t~mem40#1.offset, main_#t~mem41#1.base, main_#t~mem41#1.offset, main_#t~mem42#1.base, main_#t~mem42#1.offset, main_#t~mem43#1.base, main_#t~mem43#1.offset, main_#t~mem44#1.base, main_#t~mem44#1.offset, main_#t~malloc45#1.base, main_#t~malloc45#1.offset, main_#t~mem46#1.base, main_#t~mem46#1.offset, main_#t~mem47#1.base, main_#t~mem47#1.offset, main_#t~mem48#1.base, main_#t~mem48#1.offset, main_#t~mem49#1.base, main_#t~mem49#1.offset, main_#t~mem50#1.base, main_#t~mem50#1.offset, main_#t~mem51#1.base, main_#t~mem51#1.offset, main_#t~memset~res52#1.base, main_#t~memset~res52#1.offset, main_#t~mem53#1.base, main_#t~mem53#1.offset, main_#t~mem54#1.base, main_#t~mem54#1.offset, main_#t~mem55#1.base, main_#t~mem55#1.offset, main_#t~mem56#1.base, main_#t~mem56#1.offset, main_#t~mem57#1, main_#t~mem58#1.base, main_#t~mem58#1.offset, main_#t~mem59#1.base, main_#t~mem59#1.offset, main_#t~mem60#1.base, main_#t~mem60#1.offset, main_#t~mem61#1.base, main_#t~mem61#1.offset, main_#t~mem62#1, main_#t~post63#1, main_#t~mem64#1.base, main_#t~mem64#1.offset, main_#t~mem65#1, main_#t~mem66#1.base, main_#t~mem66#1.offset, main_#t~mem67#1.base, main_#t~mem67#1.offset, main_#t~mem68#1, main_#t~post69#1, main_#t~mem70#1.base, main_#t~mem70#1.offset, main_#t~mem71#1.base, main_#t~mem71#1.offset, main_#t~mem72#1.base, main_#t~mem72#1.offset, main_#t~mem74#1, main_#t~mem73#1, main_#t~mem75#1.base, main_#t~mem75#1.offset, main_#t~mem76#1, main_#t~short77#1, main_#t~mem78#1.base, main_#t~mem78#1.offset, main_#t~mem79#1, main_#t~malloc80#1.base, main_#t~malloc80#1.offset, main_#t~mem81#1.base, main_#t~mem81#1.offset, main_#t~mem82#1.base, main_#t~mem82#1.offset, main_#t~mem83#1.base, main_#t~mem83#1.offset, main_#t~mem84#1, main_#t~memset~res85#1.base, main_#t~memset~res85#1.offset, main_#t~mem86#1.base, main_#t~mem86#1.offset, main_#t~mem87#1.base, main_#t~mem87#1.offset, main_#t~mem90#1, main_#t~mem88#1.base, main_#t~mem88#1.offset, main_#t~mem89#1, main_#t~mem91#1.base, main_#t~mem91#1.offset, main_#t~mem94#1, main_#t~mem92#1.base, main_#t~mem92#1.offset, main_#t~mem93#1, main_#t~ite95#1, main_#t~mem96#1.base, main_#t~mem96#1.offset, main_#t~mem100#1.base, main_#t~mem100#1.offset, main_#t~mem101#1.base, main_#t~mem101#1.offset, main_#t~mem102#1.base, main_#t~mem102#1.offset, main_#t~mem103#1.base, main_#t~mem103#1.offset, main_#t~mem106#1, main_#t~mem104#1.base, main_#t~mem104#1.offset, main_#t~mem105#1, main_#t~mem107#1.base, main_#t~mem107#1.offset, main_#t~mem108#1, main_#t~pre109#1, main_#t~mem110#1.base, main_#t~mem110#1.offset, main_#t~mem111#1, main_#t~mem112#1.base, main_#t~mem112#1.offset, main_#t~mem113#1, main_#t~post114#1, main_#t~mem118#1, main_#t~mem116#1, main_#t~mem115#1.base, main_#t~mem115#1.offset, main_#t~mem117#1, main_#t~mem119#1, main_#t~post120#1, main_#t~mem121#1.base, main_#t~mem121#1.offset, main_#t~mem122#1.base, main_#t~mem122#1.offset, main_#t~mem123#1.base, main_#t~mem123#1.offset, main_#t~post97#1, main_#t~mem98#1.base, main_#t~mem98#1.offset, main_#t~mem99#1, main_#t~mem124#1.base, main_#t~mem124#1.offset, main_#t~mem125#1.base, main_#t~mem125#1.offset, main_#t~mem126#1.base, main_#t~mem126#1.offset, main_#t~mem127#1, main_#t~mem128#1.base, main_#t~mem128#1.offset, main_#t~mem129#1, main_#t~post130#1, main_#t~mem131#1.base, main_#t~mem131#1.offset, main_#t~mem132#1.base, main_#t~mem132#1.offset, main_#t~mem133#1.base, main_#t~mem133#1.offset, main_#t~mem134#1.base, main_#t~mem134#1.offset, main_#t~mem137#1, main_#t~mem135#1.base, main_#t~mem135#1.offset, main_#t~mem136#1, main_#t~ite140#1, main_#t~mem138#1.base, main_#t~mem138#1.offset, main_#t~mem139#1, main_#t~mem141#1.base, main_#t~mem141#1.offset, main_#t~mem142#1, main_#t~mem143#1.base, main_#t~mem143#1.offset, main_~_he_bkt~0#1, main_~_he_bkt_i~0#1, main_~_he_thh~0#1.base, main_~_he_thh~0#1.offset, main_~_he_hh_nxt~0#1.base, main_~_he_hh_nxt~0#1.offset, main_~#_he_new_buckets~0#1.base, main_~#_he_new_buckets~0#1.offset, main_~_he_newbkt~0#1.base, main_~_he_newbkt~0#1.offset, main_~_ha_head~0#1.base, main_~_ha_head~0#1.offset, main_~_ha_bkt~0#1, main_~_ha_hashv~0#1, main_#t~mem144#1.base, main_#t~mem144#1.offset, main_#t~mem145#1, main_#t~mem5#1, main_#t~post6#1, main_#t~mem7#1, main_#t~mem149#1, main_#t~mem148#1, main_#t~mem150#1, main_#t~mem151#1, main_#t~mem153#1, main_#t~mem152#1, main_#t~mem154#1, main_#t~mem155#1, main_#t~mem157#1, main_#t~mem156#1, main_#t~mem158#1, main_#t~mem159#1, main_#t~switch160#1, main_#t~mem161#1, main_#t~mem162#1, main_#t~mem163#1, main_#t~mem164#1, main_#t~mem165#1, main_#t~mem166#1, main_#t~mem167#1, main_#t~mem168#1, main_#t~mem169#1, main_#t~mem170#1, main_#t~mem171#1, main_~_hj_i~1#1, main_~_hj_j~1#1, main_~_hj_k~1#1, main_~_hj_key~1#1.base, main_~_hj_key~1#1.offset, main_#t~mem172#1.base, main_#t~mem172#1.offset, main_#t~mem173#1, main_#t~mem174#1.base, main_#t~mem174#1.offset, main_#t~mem175#1.base, main_#t~mem175#1.offset, main_#t~mem176#1.base, main_#t~mem176#1.offset, main_#t~mem177#1.base, main_#t~mem177#1.offset, main_#t~mem178#1.base, main_#t~mem178#1.offset, main_#t~mem179#1.base, main_#t~mem179#1.offset, main_#t~mem180#1.base, main_#t~mem180#1.offset, main_#t~mem181#1, main_#t~mem182#1, main_#t~mem183#1, main_#t~short184#1, main_#t~mem185#1.base, main_#t~mem185#1.offset, main_#t~ret186#1, main_#t~mem187#1.base, main_#t~mem187#1.offset, main_#t~mem188#1.base, main_#t~mem188#1.offset, main_#t~mem189#1.base, main_#t~mem189#1.offset, main_#t~mem190#1, main_~_hf_bkt~0#1, main_~_hf_hashv~0#1, main_#t~mem191#1.base, main_#t~mem191#1.offset, main_#t~mem192#1.base, main_#t~mem192#1.offset, main_#t~short193#1, main_#t~mem194#1.base, main_#t~mem194#1.offset, main_#t~mem195#1.base, main_#t~mem195#1.offset, main_#t~mem196#1.base, main_#t~mem196#1.offset, main_#t~mem197#1.base, main_#t~mem197#1.offset, main_#t~mem198#1.base, main_#t~mem198#1.offset, main_#t~mem199#1.base, main_#t~mem199#1.offset, main_#t~mem200#1.base, main_#t~mem200#1.offset, main_#t~mem201#1.base, main_#t~mem201#1.offset, main_#t~mem202#1, main_#t~mem203#1.base, main_#t~mem203#1.offset, main_#t~mem204#1.base, main_#t~mem204#1.offset, main_#t~mem205#1.base, main_#t~mem205#1.offset, main_#t~mem206#1, main_#t~mem207#1.base, main_#t~mem207#1.offset, main_#t~mem208#1.base, main_#t~mem208#1.offset, main_#t~mem209#1.base, main_#t~mem209#1.offset, main_#t~mem210#1.base, main_#t~mem210#1.offset, main_#t~mem211#1.base, main_#t~mem211#1.offset, main_#t~mem212#1, main_#t~mem213#1.base, main_#t~mem213#1.offset, main_#t~mem216#1, main_#t~mem214#1.base, main_#t~mem214#1.offset, main_#t~mem215#1, main_#t~mem217#1.base, main_#t~mem217#1.offset, main_#t~mem218#1.base, main_#t~mem218#1.offset, main_#t~mem219#1, main_#t~post220#1, main_#t~mem221#1.base, main_#t~mem221#1.offset, main_#t~mem222#1.base, main_#t~mem222#1.offset, main_#t~mem223#1.base, main_#t~mem223#1.offset, main_#t~mem224#1.base, main_#t~mem224#1.offset, main_#t~mem225#1.base, main_#t~mem225#1.offset, main_#t~mem226#1.base, main_#t~mem226#1.offset, main_#t~mem227#1.base, main_#t~mem227#1.offset, main_#t~mem228#1.base, main_#t~mem228#1.offset, main_~_hd_head~0#1.base, main_~_hd_head~0#1.offset, main_#t~mem229#1.base, main_#t~mem229#1.offset, main_#t~mem230#1, main_#t~post231#1, main_~_hd_bkt~0#1, main_~_hd_hh_del~0#1.base, main_~_hd_hh_del~0#1.offset, main_#t~mem232#1.base, main_#t~mem232#1.offset, main_#t~mem233#1, main_#t~mem146#1, main_#t~mem147#1, main_~#i~0#1.base, main_~#i~0#1.offset, main_~user~0#1.base, main_~user~0#1.offset, main_~tmp~0#1.base, main_~tmp~0#1.offset, main_~users~0#1.base, main_~users~0#1.offset;call main_~#i~0#1.base, main_~#i~0#1.offset := #Ultimate.allocOnStack(4);havoc main_~user~0#1.base, main_~user~0#1.offset;havoc main_~tmp~0#1.base, main_~tmp~0#1.offset;main_~users~0#1.base, main_~users~0#1.offset := 0, 0;call write~int(0, main_~#i~0#1.base, main_~#i~0#1.offset, 4); {16129#true} is VALID [2022-02-21 03:19:06,069 INFO L290 TraceCheckUtils]: 2: Hoare triple {16129#true} call main_#t~mem7#1 := read~int(main_~#i~0#1.base, main_~#i~0#1.offset, 4); {16129#true} is VALID [2022-02-21 03:19:06,069 INFO L290 TraceCheckUtils]: 3: Hoare triple {16129#true} assume !!(main_#t~mem7#1 < 10);havoc main_#t~mem7#1;call main_#t~malloc8#1.base, main_#t~malloc8#1.offset := #Ultimate.allocOnHeap(40);main_~user~0#1.base, main_~user~0#1.offset := main_#t~malloc8#1.base, main_#t~malloc8#1.offset;havoc main_#t~malloc8#1.base, main_#t~malloc8#1.offset; {16129#true} is VALID [2022-02-21 03:19:06,069 INFO L290 TraceCheckUtils]: 4: Hoare triple {16129#true} assume !(main_~user~0#1.base == 0 && main_~user~0#1.offset == 0); {16129#true} is VALID [2022-02-21 03:19:06,069 INFO L290 TraceCheckUtils]: 5: Hoare triple {16129#true} call main_#t~mem9#1 := read~int(main_~#i~0#1.base, main_~#i~0#1.offset, 4);call write~int(main_#t~mem9#1, main_~user~0#1.base, main_~user~0#1.offset, 4);havoc main_#t~mem9#1;call main_#t~mem10#1 := read~int(main_~#i~0#1.base, main_~#i~0#1.offset, 4);call main_#t~mem11#1 := read~int(main_~#i~0#1.base, main_~#i~0#1.offset, 4); {16129#true} is VALID [2022-02-21 03:19:06,069 INFO L290 TraceCheckUtils]: 6: Hoare triple {16129#true} assume main_#t~mem10#1 * main_#t~mem11#1 <= 2147483647; {16129#true} is VALID [2022-02-21 03:19:06,069 INFO L290 TraceCheckUtils]: 7: Hoare triple {16129#true} assume main_#t~mem10#1 * main_#t~mem11#1 >= -2147483648;call write~int(main_#t~mem10#1 * main_#t~mem11#1, main_~user~0#1.base, 4 + main_~user~0#1.offset, 4);havoc main_#t~mem10#1;havoc main_#t~mem11#1; {16129#true} is VALID [2022-02-21 03:19:06,070 INFO L290 TraceCheckUtils]: 8: Hoare triple {16129#true} havoc main_~_ha_hashv~0#1; {16129#true} is VALID [2022-02-21 03:19:06,070 INFO L290 TraceCheckUtils]: 9: Hoare triple {16129#true} goto; {16129#true} is VALID [2022-02-21 03:19:06,070 INFO L290 TraceCheckUtils]: 10: Hoare triple {16129#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; {16129#true} is VALID [2022-02-21 03:19:06,070 INFO L290 TraceCheckUtils]: 11: Hoare triple {16129#true} assume !(main_~_hj_k~0#1 % 4294967296 >= 12); {16129#true} is VALID [2022-02-21 03:19:06,070 INFO L290 TraceCheckUtils]: 12: Hoare triple {16129#true} main_~_ha_hashv~0#1 := 4 + main_~_ha_hashv~0#1;main_#t~switch24#1 := 11 == main_~_hj_k~0#1; {16129#true} is VALID [2022-02-21 03:19:06,070 INFO L290 TraceCheckUtils]: 13: Hoare triple {16129#true} assume !main_#t~switch24#1; {16129#true} is VALID [2022-02-21 03:19:06,071 INFO L290 TraceCheckUtils]: 14: Hoare triple {16129#true} main_#t~switch24#1 := main_#t~switch24#1 || 10 == main_~_hj_k~0#1; {16129#true} is VALID [2022-02-21 03:19:06,071 INFO L290 TraceCheckUtils]: 15: Hoare triple {16129#true} assume !main_#t~switch24#1; {16129#true} is VALID [2022-02-21 03:19:06,071 INFO L290 TraceCheckUtils]: 16: Hoare triple {16129#true} main_#t~switch24#1 := main_#t~switch24#1 || 9 == main_~_hj_k~0#1; {16129#true} is VALID [2022-02-21 03:19:06,071 INFO L290 TraceCheckUtils]: 17: Hoare triple {16129#true} assume !main_#t~switch24#1; {16129#true} is VALID [2022-02-21 03:19:06,071 INFO L290 TraceCheckUtils]: 18: Hoare triple {16129#true} main_#t~switch24#1 := main_#t~switch24#1 || 8 == main_~_hj_k~0#1; {16129#true} is VALID [2022-02-21 03:19:06,071 INFO L290 TraceCheckUtils]: 19: Hoare triple {16129#true} assume !main_#t~switch24#1; {16129#true} is VALID [2022-02-21 03:19:06,071 INFO L290 TraceCheckUtils]: 20: Hoare triple {16129#true} main_#t~switch24#1 := main_#t~switch24#1 || 7 == main_~_hj_k~0#1; {16129#true} is VALID [2022-02-21 03:19:06,072 INFO L290 TraceCheckUtils]: 21: Hoare triple {16129#true} assume !main_#t~switch24#1; {16129#true} is VALID [2022-02-21 03:19:06,072 INFO L290 TraceCheckUtils]: 22: Hoare triple {16129#true} main_#t~switch24#1 := main_#t~switch24#1 || 6 == main_~_hj_k~0#1; {16129#true} is VALID [2022-02-21 03:19:06,072 INFO L290 TraceCheckUtils]: 23: Hoare triple {16129#true} assume !main_#t~switch24#1; {16129#true} is VALID [2022-02-21 03:19:06,072 INFO L290 TraceCheckUtils]: 24: Hoare triple {16129#true} main_#t~switch24#1 := main_#t~switch24#1 || 5 == main_~_hj_k~0#1; {16129#true} is VALID [2022-02-21 03:19:06,072 INFO L290 TraceCheckUtils]: 25: Hoare triple {16129#true} assume !main_#t~switch24#1; {16129#true} is VALID [2022-02-21 03:19:06,072 INFO L290 TraceCheckUtils]: 26: Hoare triple {16129#true} main_#t~switch24#1 := main_#t~switch24#1 || 4 == main_~_hj_k~0#1; {16129#true} is VALID [2022-02-21 03:19:06,072 INFO L290 TraceCheckUtils]: 27: Hoare triple {16129#true} assume main_#t~switch24#1;call main_#t~mem32#1 := read~int(main_~_hj_key~0#1.base, 3 + main_~_hj_key~0#1.offset, 1);main_~_hj_i~0#1 := main_~_hj_i~0#1 + 16777216 * (main_#t~mem32#1 % 256);havoc main_#t~mem32#1; {16129#true} is VALID [2022-02-21 03:19:06,073 INFO L290 TraceCheckUtils]: 28: Hoare triple {16129#true} main_#t~switch24#1 := main_#t~switch24#1 || 3 == main_~_hj_k~0#1; {16129#true} is VALID [2022-02-21 03:19:06,073 INFO L290 TraceCheckUtils]: 29: Hoare triple {16129#true} assume main_#t~switch24#1;call main_#t~mem33#1 := read~int(main_~_hj_key~0#1.base, 2 + main_~_hj_key~0#1.offset, 1);main_~_hj_i~0#1 := main_~_hj_i~0#1 + 65536 * (main_#t~mem33#1 % 256);havoc main_#t~mem33#1; {16129#true} is VALID [2022-02-21 03:19:06,073 INFO L290 TraceCheckUtils]: 30: Hoare triple {16129#true} main_#t~switch24#1 := main_#t~switch24#1 || 2 == main_~_hj_k~0#1; {16129#true} is VALID [2022-02-21 03:19:06,073 INFO L290 TraceCheckUtils]: 31: Hoare triple {16129#true} assume main_#t~switch24#1;call main_#t~mem34#1 := read~int(main_~_hj_key~0#1.base, 1 + main_~_hj_key~0#1.offset, 1);main_~_hj_i~0#1 := main_~_hj_i~0#1 + 256 * (main_#t~mem34#1 % 256);havoc main_#t~mem34#1; {16129#true} is VALID [2022-02-21 03:19:06,073 INFO L290 TraceCheckUtils]: 32: Hoare triple {16129#true} main_#t~switch24#1 := main_#t~switch24#1 || 1 == main_~_hj_k~0#1; {16129#true} is VALID [2022-02-21 03:19:06,073 INFO L290 TraceCheckUtils]: 33: Hoare triple {16129#true} assume main_#t~switch24#1;call main_#t~mem35#1 := read~int(main_~_hj_key~0#1.base, main_~_hj_key~0#1.offset, 1);main_~_hj_i~0#1 := main_~_hj_i~0#1 + main_#t~mem35#1 % 256;havoc main_#t~mem35#1; {16129#true} is VALID [2022-02-21 03:19:06,073 INFO L290 TraceCheckUtils]: 34: Hoare triple {16129#true} havoc main_#t~switch24#1; {16129#true} is VALID [2022-02-21 03:19:06,074 INFO L290 TraceCheckUtils]: 35: Hoare triple {16129#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)))); {16129#true} is VALID [2022-02-21 03:19:06,074 INFO L290 TraceCheckUtils]: 36: Hoare triple {16129#true} goto; {16129#true} is VALID [2022-02-21 03:19:06,074 INFO L290 TraceCheckUtils]: 37: Hoare triple {16129#true} goto; {16129#true} is VALID [2022-02-21 03:19:06,074 INFO L290 TraceCheckUtils]: 38: Hoare triple {16129#true} goto; {16129#true} is VALID [2022-02-21 03:19:06,074 INFO L290 TraceCheckUtils]: 39: Hoare triple {16129#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); {16129#true} is VALID [2022-02-21 03:19:06,074 INFO L290 TraceCheckUtils]: 40: Hoare triple {16129#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); {16129#true} is VALID [2022-02-21 03:19:06,074 INFO L290 TraceCheckUtils]: 41: Hoare triple {16129#true} call main_#t~malloc36#1.base, main_#t~malloc36#1.offset := #Ultimate.allocOnHeap(44);call write~$Pointer$(main_#t~malloc36#1.base, main_#t~malloc36#1.offset, main_~user~0#1.base, 8 + main_~user~0#1.offset, 4);havoc main_#t~malloc36#1.base, main_#t~malloc36#1.offset;call main_#t~mem37#1.base, main_#t~mem37#1.offset := read~$Pointer$(main_~user~0#1.base, 8 + main_~user~0#1.offset, 4); {16129#true} is VALID [2022-02-21 03:19:06,075 INFO L290 TraceCheckUtils]: 42: Hoare triple {16129#true} assume !(main_#t~mem37#1.base == 0 && main_#t~mem37#1.offset == 0);havoc main_#t~mem37#1.base, main_#t~mem37#1.offset;call main_#t~mem38#1.base, main_#t~mem38#1.offset := read~$Pointer$(main_~user~0#1.base, 8 + main_~user~0#1.offset, 4); {16129#true} is VALID [2022-02-21 03:19:06,075 INFO L272 TraceCheckUtils]: 43: Hoare triple {16129#true} call main_#t~memset~res39#1.base, main_#t~memset~res39#1.offset := #Ultimate.C_memset(main_#t~mem38#1.base, main_#t~mem38#1.offset, 0, 44); {16129#true} is VALID [2022-02-21 03:19:06,075 INFO L290 TraceCheckUtils]: 44: Hoare triple {16129#true} #t~loopctr235 := 0; {16266#(= |#Ultimate.C_memset_#t~loopctr235| 0)} is VALID [2022-02-21 03:19:06,075 INFO L290 TraceCheckUtils]: 45: Hoare triple {16266#(= |#Ultimate.C_memset_#t~loopctr235| 0)} assume #t~loopctr235 % 4294967296 < #amount % 4294967296;#memory_int := #memory_int[#ptr.base,#ptr.offset + #t~loopctr235 := #value];#memory_$Pointer$.base, #memory_$Pointer$.offset := #memory_$Pointer$.base[#ptr.base,#ptr.offset + #t~loopctr235 := 0], #memory_$Pointer$.offset[#ptr.base,#ptr.offset + #t~loopctr235 := #value % 256];#t~loopctr235 := 1 + #t~loopctr235; {16129#true} is VALID [2022-02-21 03:19:06,076 INFO L290 TraceCheckUtils]: 46: Hoare triple {16129#true} assume !(#t~loopctr235 % 4294967296 < #amount % 4294967296); {16129#true} is VALID [2022-02-21 03:19:06,076 INFO L290 TraceCheckUtils]: 47: Hoare triple {16129#true} assume #res.base == #ptr.base && #res.offset == #ptr.offset; {16129#true} is VALID [2022-02-21 03:19:06,076 INFO L284 TraceCheckUtils]: 48: Hoare quadruple {16129#true} {16129#true} #914#return; {16129#true} is VALID [2022-02-21 03:19:06,076 INFO L290 TraceCheckUtils]: 49: Hoare triple {16129#true} havoc main_#t~mem38#1.base, main_#t~mem38#1.offset;havoc main_#t~memset~res39#1.base, main_#t~memset~res39#1.offset;call main_#t~mem40#1.base, main_#t~mem40#1.offset := read~$Pointer$(main_~user~0#1.base, 8 + main_~user~0#1.offset, 4);call write~$Pointer$(main_~user~0#1.base, 8 + main_~user~0#1.offset, main_#t~mem40#1.base, 16 + main_#t~mem40#1.offset, 4);havoc main_#t~mem40#1.base, main_#t~mem40#1.offset;call main_#t~mem41#1.base, main_#t~mem41#1.offset := read~$Pointer$(main_~user~0#1.base, 8 + main_~user~0#1.offset, 4);call write~int(32, main_#t~mem41#1.base, 4 + main_#t~mem41#1.offset, 4);havoc main_#t~mem41#1.base, main_#t~mem41#1.offset;call main_#t~mem42#1.base, main_#t~mem42#1.offset := read~$Pointer$(main_~user~0#1.base, 8 + main_~user~0#1.offset, 4);call write~int(5, main_#t~mem42#1.base, 8 + main_#t~mem42#1.offset, 4);havoc main_#t~mem42#1.base, main_#t~mem42#1.offset;call main_#t~mem43#1.base, main_#t~mem43#1.offset := read~$Pointer$(main_~user~0#1.base, 8 + main_~user~0#1.offset, 4);call write~int((if 8 + main_~user~0#1.offset - main_~user~0#1.offset < 0 && 0 != (8 + main_~user~0#1.offset - main_~user~0#1.offset) % 1 then 1 + (8 + main_~user~0#1.offset - main_~user~0#1.offset) / 1 else (8 + main_~user~0#1.offset - main_~user~0#1.offset) / 1), main_#t~mem43#1.base, 20 + main_#t~mem43#1.offset, 4);havoc main_#t~mem43#1.base, main_#t~mem43#1.offset;call main_#t~mem44#1.base, main_#t~mem44#1.offset := read~$Pointer$(main_~user~0#1.base, 8 + main_~user~0#1.offset, 4);call main_#t~malloc45#1.base, main_#t~malloc45#1.offset := #Ultimate.allocOnHeap(384);call write~$Pointer$(main_#t~malloc45#1.base, main_#t~malloc45#1.offset, main_#t~mem44#1.base, main_#t~mem44#1.offset, 4);havoc main_#t~mem44#1.base, main_#t~mem44#1.offset;havoc main_#t~malloc45#1.base, main_#t~malloc45#1.offset;call main_#t~mem46#1.base, main_#t~mem46#1.offset := read~$Pointer$(main_~user~0#1.base, 8 + main_~user~0#1.offset, 4);call write~int(2685476833, main_#t~mem46#1.base, 40 + main_#t~mem46#1.offset, 4);havoc main_#t~mem46#1.base, main_#t~mem46#1.offset;call main_#t~mem47#1.base, main_#t~mem47#1.offset := read~$Pointer$(main_~user~0#1.base, 8 + main_~user~0#1.offset, 4);call main_#t~mem48#1.base, main_#t~mem48#1.offset := read~$Pointer$(main_#t~mem47#1.base, main_#t~mem47#1.offset, 4); {16129#true} is VALID [2022-02-21 03:19:06,076 INFO L290 TraceCheckUtils]: 50: Hoare triple {16129#true} assume !(main_#t~mem48#1.base == 0 && main_#t~mem48#1.offset == 0);havoc main_#t~mem47#1.base, main_#t~mem47#1.offset;havoc main_#t~mem48#1.base, main_#t~mem48#1.offset;call main_#t~mem50#1.base, main_#t~mem50#1.offset := read~$Pointer$(main_~user~0#1.base, 8 + main_~user~0#1.offset, 4);call main_#t~mem51#1.base, main_#t~mem51#1.offset := read~$Pointer$(main_#t~mem50#1.base, main_#t~mem50#1.offset, 4); {16129#true} is VALID [2022-02-21 03:19:06,076 INFO L272 TraceCheckUtils]: 51: Hoare triple {16129#true} call main_#t~memset~res52#1.base, main_#t~memset~res52#1.offset := #Ultimate.C_memset(main_#t~mem51#1.base, main_#t~mem51#1.offset, 0, 384); {16129#true} is VALID [2022-02-21 03:19:06,077 INFO L290 TraceCheckUtils]: 52: Hoare triple {16129#true} #t~loopctr235 := 0; {16266#(= |#Ultimate.C_memset_#t~loopctr235| 0)} is VALID [2022-02-21 03:19:06,077 INFO L290 TraceCheckUtils]: 53: Hoare triple {16266#(= |#Ultimate.C_memset_#t~loopctr235| 0)} assume #t~loopctr235 % 4294967296 < #amount % 4294967296;#memory_int := #memory_int[#ptr.base,#ptr.offset + #t~loopctr235 := #value];#memory_$Pointer$.base, #memory_$Pointer$.offset := #memory_$Pointer$.base[#ptr.base,#ptr.offset + #t~loopctr235 := 0], #memory_$Pointer$.offset[#ptr.base,#ptr.offset + #t~loopctr235 := #value % 256];#t~loopctr235 := 1 + #t~loopctr235; {16294#(= (+ (- 1) |#Ultimate.C_memset_#t~loopctr235|) 0)} is VALID [2022-02-21 03:19:06,078 INFO L290 TraceCheckUtils]: 54: Hoare triple {16294#(= (+ (- 1) |#Ultimate.C_memset_#t~loopctr235|) 0)} assume !(#t~loopctr235 % 4294967296 < #amount % 4294967296); {16298#(not (< 1 (mod |#Ultimate.C_memset_#amount| 4294967296)))} is VALID [2022-02-21 03:19:06,078 INFO L290 TraceCheckUtils]: 55: Hoare triple {16298#(not (< 1 (mod |#Ultimate.C_memset_#amount| 4294967296)))} assume #res.base == #ptr.base && #res.offset == #ptr.offset; {16298#(not (< 1 (mod |#Ultimate.C_memset_#amount| 4294967296)))} is VALID [2022-02-21 03:19:06,079 INFO L284 TraceCheckUtils]: 56: Hoare quadruple {16298#(not (< 1 (mod |#Ultimate.C_memset_#amount| 4294967296)))} {16129#true} #916#return; {16130#false} is VALID [2022-02-21 03:19:06,079 INFO L290 TraceCheckUtils]: 57: Hoare triple {16130#false} havoc main_#t~mem50#1.base, main_#t~mem50#1.offset;havoc main_#t~mem51#1.base, main_#t~mem51#1.offset;havoc main_#t~memset~res52#1.base, main_#t~memset~res52#1.offset; {16130#false} is VALID [2022-02-21 03:19:06,079 INFO L290 TraceCheckUtils]: 58: Hoare triple {16130#false} goto; {16130#false} is VALID [2022-02-21 03:19:06,080 INFO L290 TraceCheckUtils]: 59: Hoare triple {16130#false} main_~users~0#1.base, main_~users~0#1.offset := main_~user~0#1.base, main_~user~0#1.offset; {16130#false} is VALID [2022-02-21 03:19:06,080 INFO L290 TraceCheckUtils]: 60: Hoare triple {16130#false} havoc main_~_ha_bkt~0#1;call main_#t~mem61#1.base, main_#t~mem61#1.offset := read~$Pointer$(main_~users~0#1.base, 8 + main_~users~0#1.offset, 4);call main_#t~mem62#1 := read~int(main_#t~mem61#1.base, 12 + main_#t~mem61#1.offset, 4);main_#t~post63#1 := main_#t~mem62#1;call write~int(1 + main_#t~post63#1, main_#t~mem61#1.base, 12 + main_#t~mem61#1.offset, 4);havoc main_#t~mem61#1.base, main_#t~mem61#1.offset;havoc main_#t~mem62#1;havoc main_#t~post63#1; {16130#false} is VALID [2022-02-21 03:19:06,080 INFO L290 TraceCheckUtils]: 61: Hoare triple {16130#false} call main_#t~mem64#1.base, main_#t~mem64#1.offset := read~$Pointer$(main_~users~0#1.base, 8 + main_~users~0#1.offset, 4);call main_#t~mem65#1 := read~int(main_#t~mem64#1.base, 4 + main_#t~mem64#1.offset, 4);main_~_ha_bkt~0#1 := (if 0 == main_~_ha_hashv~0#1 || 0 == main_#t~mem65#1 - 1 then 0 else (if 1 == main_#t~mem65#1 - 1 then (if 1 == main_~_ha_hashv~0#1 || 0 == main_~_ha_hashv~0#1 then main_~_ha_hashv~0#1 else (if main_~_ha_hashv~0#1 >= 0 then main_~_ha_hashv~0#1 % 2 else ~bitwiseAnd(main_~_ha_hashv~0#1, main_#t~mem65#1 - 1))) else (if 1 == main_~_ha_hashv~0#1 then (if 1 == main_#t~mem65#1 - 1 || 0 == main_#t~mem65#1 - 1 then main_#t~mem65#1 - 1 else (if main_#t~mem65#1 - 1 >= 0 then (main_#t~mem65#1 - 1) % 2 else ~bitwiseAnd(main_~_ha_hashv~0#1, main_#t~mem65#1 - 1))) else ~bitwiseAnd(main_~_ha_hashv~0#1, main_#t~mem65#1 - 1))));havoc main_#t~mem64#1.base, main_#t~mem64#1.offset;havoc main_#t~mem65#1; {16130#false} is VALID [2022-02-21 03:19:06,080 INFO L290 TraceCheckUtils]: 62: Hoare triple {16130#false} goto; {16130#false} is VALID [2022-02-21 03:19:06,080 INFO L290 TraceCheckUtils]: 63: Hoare triple {16130#false} call main_#t~mem66#1.base, main_#t~mem66#1.offset := read~$Pointer$(main_~users~0#1.base, 8 + main_~users~0#1.offset, 4);call main_#t~mem67#1.base, main_#t~mem67#1.offset := read~$Pointer$(main_#t~mem66#1.base, main_#t~mem66#1.offset, 4);main_~_ha_head~0#1.base, main_~_ha_head~0#1.offset := main_#t~mem67#1.base, main_#t~mem67#1.offset + 12 * (if main_~_ha_bkt~0#1 % 4294967296 % 4294967296 <= 2147483647 then main_~_ha_bkt~0#1 % 4294967296 % 4294967296 else main_~_ha_bkt~0#1 % 4294967296 % 4294967296 - 4294967296);havoc main_#t~mem66#1.base, main_#t~mem66#1.offset;havoc main_#t~mem67#1.base, main_#t~mem67#1.offset;call main_#t~mem68#1 := read~int(main_~_ha_head~0#1.base, 4 + main_~_ha_head~0#1.offset, 4);main_#t~post69#1 := main_#t~mem68#1;call write~int(1 + main_#t~post69#1, main_~_ha_head~0#1.base, 4 + main_~_ha_head~0#1.offset, 4);havoc main_#t~mem68#1;havoc main_#t~post69#1;call main_#t~mem70#1.base, main_#t~mem70#1.offset := read~$Pointer$(main_~_ha_head~0#1.base, main_~_ha_head~0#1.offset, 4);call write~$Pointer$(main_#t~mem70#1.base, main_#t~mem70#1.offset, main_~user~0#1.base, 24 + main_~user~0#1.offset, 4);havoc main_#t~mem70#1.base, main_#t~mem70#1.offset;call write~$Pointer$(0, 0, main_~user~0#1.base, 20 + main_~user~0#1.offset, 4);call main_#t~mem71#1.base, main_#t~mem71#1.offset := read~$Pointer$(main_~_ha_head~0#1.base, main_~_ha_head~0#1.offset, 4); {16130#false} is VALID [2022-02-21 03:19:06,080 INFO L290 TraceCheckUtils]: 64: Hoare triple {16130#false} assume main_#t~mem71#1.base != 0 || main_#t~mem71#1.offset != 0;havoc main_#t~mem71#1.base, main_#t~mem71#1.offset;call main_#t~mem72#1.base, main_#t~mem72#1.offset := read~$Pointer$(main_~_ha_head~0#1.base, main_~_ha_head~0#1.offset, 4);call write~$Pointer$(main_~user~0#1.base, 8 + main_~user~0#1.offset, main_#t~mem72#1.base, 12 + main_#t~mem72#1.offset, 4);havoc main_#t~mem72#1.base, main_#t~mem72#1.offset; {16130#false} is VALID [2022-02-21 03:19:06,081 INFO L290 TraceCheckUtils]: 65: Hoare triple {16130#false} call write~$Pointer$(main_~user~0#1.base, 8 + main_~user~0#1.offset, main_~_ha_head~0#1.base, main_~_ha_head~0#1.offset, 4);call main_#t~mem74#1 := read~int(main_~_ha_head~0#1.base, 4 + main_~_ha_head~0#1.offset, 4);call main_#t~mem73#1 := read~int(main_~_ha_head~0#1.base, 8 + main_~_ha_head~0#1.offset, 4);main_#t~short77#1 := main_#t~mem74#1 % 4294967296 >= 10 * (1 + main_#t~mem73#1) % 4294967296; {16130#false} is VALID [2022-02-21 03:19:06,081 INFO L290 TraceCheckUtils]: 66: Hoare triple {16130#false} assume main_#t~short77#1;call main_#t~mem75#1.base, main_#t~mem75#1.offset := read~$Pointer$(main_~user~0#1.base, 8 + main_~user~0#1.offset, 4);call main_#t~mem76#1 := read~int(main_#t~mem75#1.base, 36 + main_#t~mem75#1.offset, 4);main_#t~short77#1 := 0 == main_#t~mem76#1 % 4294967296; {16130#false} is VALID [2022-02-21 03:19:06,081 INFO L290 TraceCheckUtils]: 67: Hoare triple {16130#false} assume !main_#t~short77#1;havoc main_#t~mem74#1;havoc main_#t~mem73#1;havoc main_#t~mem75#1.base, main_#t~mem75#1.offset;havoc main_#t~mem76#1;havoc main_#t~short77#1; {16130#false} is VALID [2022-02-21 03:19:06,081 INFO L290 TraceCheckUtils]: 68: Hoare triple {16130#false} goto; {16130#false} is VALID [2022-02-21 03:19:06,081 INFO L290 TraceCheckUtils]: 69: Hoare triple {16130#false} goto; {16130#false} is VALID [2022-02-21 03:19:06,081 INFO L290 TraceCheckUtils]: 70: Hoare triple {16130#false} goto; {16130#false} is VALID [2022-02-21 03:19:06,081 INFO L290 TraceCheckUtils]: 71: Hoare triple {16130#false} goto; {16130#false} is VALID [2022-02-21 03:19:06,081 INFO L290 TraceCheckUtils]: 72: Hoare triple {16130#false} call main_#t~mem144#1.base, main_#t~mem144#1.offset := read~$Pointer$(main_~user~0#1.base, 8 + main_~user~0#1.offset, 4);call main_#t~mem145#1 := read~int(main_#t~mem144#1.base, 12 + main_#t~mem144#1.offset, 4); {16130#false} is VALID [2022-02-21 03:19:06,082 INFO L272 TraceCheckUtils]: 73: Hoare triple {16130#false} call test_int((if main_#t~mem145#1 % 4294967296 % 4294967296 <= 2147483647 then main_#t~mem145#1 % 4294967296 % 4294967296 else main_#t~mem145#1 % 4294967296 % 4294967296 - 4294967296)); {16130#false} is VALID [2022-02-21 03:19:06,082 INFO L290 TraceCheckUtils]: 74: Hoare triple {16130#false} ~a := #in~a;#t~post3 := ~count_int~0; {16130#false} is VALID [2022-02-21 03:19:06,082 INFO L290 TraceCheckUtils]: 75: Hoare triple {16130#false} assume 1 + #t~post3 <= 2147483647; {16130#false} is VALID [2022-02-21 03:19:06,082 INFO L290 TraceCheckUtils]: 76: Hoare triple {16130#false} assume 1 + #t~post3 >= -2147483648;~count_int~0 := 1 + #t~post3;#t~switch4 := 0 == #t~post3; {16130#false} is VALID [2022-02-21 03:19:06,082 INFO L290 TraceCheckUtils]: 77: Hoare triple {16130#false} assume #t~switch4; {16130#false} is VALID [2022-02-21 03:19:06,082 INFO L272 TraceCheckUtils]: 78: Hoare triple {16130#false} call __VERIFIER_assert((if 1 == ~a then 1 else 0)); {16130#false} is VALID [2022-02-21 03:19:06,082 INFO L290 TraceCheckUtils]: 79: Hoare triple {16130#false} ~cond := #in~cond; {16130#false} is VALID [2022-02-21 03:19:06,083 INFO L290 TraceCheckUtils]: 80: Hoare triple {16130#false} assume !(0 == ~cond); {16130#false} is VALID [2022-02-21 03:19:06,083 INFO L290 TraceCheckUtils]: 81: Hoare triple {16130#false} assume true; {16130#false} is VALID [2022-02-21 03:19:06,083 INFO L284 TraceCheckUtils]: 82: Hoare quadruple {16130#false} {16130#false} #884#return; {16130#false} is VALID [2022-02-21 03:19:06,083 INFO L290 TraceCheckUtils]: 83: Hoare triple {16130#false} havoc #t~post3;havoc #t~switch4; {16130#false} is VALID [2022-02-21 03:19:06,083 INFO L290 TraceCheckUtils]: 84: Hoare triple {16130#false} assume true; {16130#false} is VALID [2022-02-21 03:19:06,085 INFO L284 TraceCheckUtils]: 85: Hoare quadruple {16130#false} {16130#false} #920#return; {16130#false} is VALID [2022-02-21 03:19:06,085 INFO L290 TraceCheckUtils]: 86: Hoare triple {16130#false} havoc main_#t~mem144#1.base, main_#t~mem144#1.offset;havoc main_#t~mem145#1; {16130#false} is VALID [2022-02-21 03:19:06,085 INFO L290 TraceCheckUtils]: 87: Hoare triple {16130#false} call main_#t~mem5#1 := read~int(main_~#i~0#1.base, main_~#i~0#1.offset, 4);main_#t~post6#1 := main_#t~mem5#1; {16130#false} is VALID [2022-02-21 03:19:06,085 INFO L290 TraceCheckUtils]: 88: Hoare triple {16130#false} assume !(1 + main_#t~post6#1 <= 2147483647); {16130#false} is VALID [2022-02-21 03:19:06,085 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 4 proven. 3 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-02-21 03:19:06,085 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-21 03:19:06,380 INFO L290 TraceCheckUtils]: 88: Hoare triple {16130#false} assume !(1 + main_#t~post6#1 <= 2147483647); {16130#false} is VALID [2022-02-21 03:19:06,381 INFO L290 TraceCheckUtils]: 87: Hoare triple {16130#false} call main_#t~mem5#1 := read~int(main_~#i~0#1.base, main_~#i~0#1.offset, 4);main_#t~post6#1 := main_#t~mem5#1; {16130#false} is VALID [2022-02-21 03:19:06,381 INFO L290 TraceCheckUtils]: 86: Hoare triple {16130#false} havoc main_#t~mem144#1.base, main_#t~mem144#1.offset;havoc main_#t~mem145#1; {16130#false} is VALID [2022-02-21 03:19:06,381 INFO L284 TraceCheckUtils]: 85: Hoare quadruple {16129#true} {16130#false} #920#return; {16130#false} is VALID [2022-02-21 03:19:06,381 INFO L290 TraceCheckUtils]: 84: Hoare triple {16129#true} assume true; {16129#true} is VALID [2022-02-21 03:19:06,381 INFO L290 TraceCheckUtils]: 83: Hoare triple {16129#true} havoc #t~post3;havoc #t~switch4; {16129#true} is VALID [2022-02-21 03:19:06,381 INFO L284 TraceCheckUtils]: 82: Hoare quadruple {16129#true} {16129#true} #884#return; {16129#true} is VALID [2022-02-21 03:19:06,382 INFO L290 TraceCheckUtils]: 81: Hoare triple {16129#true} assume true; {16129#true} is VALID [2022-02-21 03:19:06,382 INFO L290 TraceCheckUtils]: 80: Hoare triple {16129#true} assume !(0 == ~cond); {16129#true} is VALID [2022-02-21 03:19:06,382 INFO L290 TraceCheckUtils]: 79: Hoare triple {16129#true} ~cond := #in~cond; {16129#true} is VALID [2022-02-21 03:19:06,382 INFO L272 TraceCheckUtils]: 78: Hoare triple {16129#true} call __VERIFIER_assert((if 1 == ~a then 1 else 0)); {16129#true} is VALID [2022-02-21 03:19:06,382 INFO L290 TraceCheckUtils]: 77: Hoare triple {16129#true} assume #t~switch4; {16129#true} is VALID [2022-02-21 03:19:06,382 INFO L290 TraceCheckUtils]: 76: Hoare triple {16129#true} assume 1 + #t~post3 >= -2147483648;~count_int~0 := 1 + #t~post3;#t~switch4 := 0 == #t~post3; {16129#true} is VALID [2022-02-21 03:19:06,382 INFO L290 TraceCheckUtils]: 75: Hoare triple {16129#true} assume 1 + #t~post3 <= 2147483647; {16129#true} is VALID [2022-02-21 03:19:06,383 INFO L290 TraceCheckUtils]: 74: Hoare triple {16129#true} ~a := #in~a;#t~post3 := ~count_int~0; {16129#true} is VALID [2022-02-21 03:19:06,383 INFO L272 TraceCheckUtils]: 73: Hoare triple {16130#false} call test_int((if main_#t~mem145#1 % 4294967296 % 4294967296 <= 2147483647 then main_#t~mem145#1 % 4294967296 % 4294967296 else main_#t~mem145#1 % 4294967296 % 4294967296 - 4294967296)); {16129#true} is VALID [2022-02-21 03:19:06,383 INFO L290 TraceCheckUtils]: 72: Hoare triple {16130#false} call main_#t~mem144#1.base, main_#t~mem144#1.offset := read~$Pointer$(main_~user~0#1.base, 8 + main_~user~0#1.offset, 4);call main_#t~mem145#1 := read~int(main_#t~mem144#1.base, 12 + main_#t~mem144#1.offset, 4); {16130#false} is VALID [2022-02-21 03:19:06,383 INFO L290 TraceCheckUtils]: 71: Hoare triple {16130#false} goto; {16130#false} is VALID [2022-02-21 03:19:06,383 INFO L290 TraceCheckUtils]: 70: Hoare triple {16130#false} goto; {16130#false} is VALID [2022-02-21 03:19:06,383 INFO L290 TraceCheckUtils]: 69: Hoare triple {16130#false} goto; {16130#false} is VALID [2022-02-21 03:19:06,383 INFO L290 TraceCheckUtils]: 68: Hoare triple {16130#false} goto; {16130#false} is VALID [2022-02-21 03:19:06,383 INFO L290 TraceCheckUtils]: 67: Hoare triple {16130#false} assume !main_#t~short77#1;havoc main_#t~mem74#1;havoc main_#t~mem73#1;havoc main_#t~mem75#1.base, main_#t~mem75#1.offset;havoc main_#t~mem76#1;havoc main_#t~short77#1; {16130#false} is VALID [2022-02-21 03:19:06,384 INFO L290 TraceCheckUtils]: 66: Hoare triple {16130#false} assume main_#t~short77#1;call main_#t~mem75#1.base, main_#t~mem75#1.offset := read~$Pointer$(main_~user~0#1.base, 8 + main_~user~0#1.offset, 4);call main_#t~mem76#1 := read~int(main_#t~mem75#1.base, 36 + main_#t~mem75#1.offset, 4);main_#t~short77#1 := 0 == main_#t~mem76#1 % 4294967296; {16130#false} is VALID [2022-02-21 03:19:06,384 INFO L290 TraceCheckUtils]: 65: Hoare triple {16130#false} call write~$Pointer$(main_~user~0#1.base, 8 + main_~user~0#1.offset, main_~_ha_head~0#1.base, main_~_ha_head~0#1.offset, 4);call main_#t~mem74#1 := read~int(main_~_ha_head~0#1.base, 4 + main_~_ha_head~0#1.offset, 4);call main_#t~mem73#1 := read~int(main_~_ha_head~0#1.base, 8 + main_~_ha_head~0#1.offset, 4);main_#t~short77#1 := main_#t~mem74#1 % 4294967296 >= 10 * (1 + main_#t~mem73#1) % 4294967296; {16130#false} is VALID [2022-02-21 03:19:06,384 INFO L290 TraceCheckUtils]: 64: Hoare triple {16130#false} assume main_#t~mem71#1.base != 0 || main_#t~mem71#1.offset != 0;havoc main_#t~mem71#1.base, main_#t~mem71#1.offset;call main_#t~mem72#1.base, main_#t~mem72#1.offset := read~$Pointer$(main_~_ha_head~0#1.base, main_~_ha_head~0#1.offset, 4);call write~$Pointer$(main_~user~0#1.base, 8 + main_~user~0#1.offset, main_#t~mem72#1.base, 12 + main_#t~mem72#1.offset, 4);havoc main_#t~mem72#1.base, main_#t~mem72#1.offset; {16130#false} is VALID [2022-02-21 03:19:06,384 INFO L290 TraceCheckUtils]: 63: Hoare triple {16130#false} call main_#t~mem66#1.base, main_#t~mem66#1.offset := read~$Pointer$(main_~users~0#1.base, 8 + main_~users~0#1.offset, 4);call main_#t~mem67#1.base, main_#t~mem67#1.offset := read~$Pointer$(main_#t~mem66#1.base, main_#t~mem66#1.offset, 4);main_~_ha_head~0#1.base, main_~_ha_head~0#1.offset := main_#t~mem67#1.base, main_#t~mem67#1.offset + 12 * (if main_~_ha_bkt~0#1 % 4294967296 % 4294967296 <= 2147483647 then main_~_ha_bkt~0#1 % 4294967296 % 4294967296 else main_~_ha_bkt~0#1 % 4294967296 % 4294967296 - 4294967296);havoc main_#t~mem66#1.base, main_#t~mem66#1.offset;havoc main_#t~mem67#1.base, main_#t~mem67#1.offset;call main_#t~mem68#1 := read~int(main_~_ha_head~0#1.base, 4 + main_~_ha_head~0#1.offset, 4);main_#t~post69#1 := main_#t~mem68#1;call write~int(1 + main_#t~post69#1, main_~_ha_head~0#1.base, 4 + main_~_ha_head~0#1.offset, 4);havoc main_#t~mem68#1;havoc main_#t~post69#1;call main_#t~mem70#1.base, main_#t~mem70#1.offset := read~$Pointer$(main_~_ha_head~0#1.base, main_~_ha_head~0#1.offset, 4);call write~$Pointer$(main_#t~mem70#1.base, main_#t~mem70#1.offset, main_~user~0#1.base, 24 + main_~user~0#1.offset, 4);havoc main_#t~mem70#1.base, main_#t~mem70#1.offset;call write~$Pointer$(0, 0, main_~user~0#1.base, 20 + main_~user~0#1.offset, 4);call main_#t~mem71#1.base, main_#t~mem71#1.offset := read~$Pointer$(main_~_ha_head~0#1.base, main_~_ha_head~0#1.offset, 4); {16130#false} is VALID [2022-02-21 03:19:06,384 INFO L290 TraceCheckUtils]: 62: Hoare triple {16130#false} goto; {16130#false} is VALID [2022-02-21 03:19:06,384 INFO L290 TraceCheckUtils]: 61: Hoare triple {16130#false} call main_#t~mem64#1.base, main_#t~mem64#1.offset := read~$Pointer$(main_~users~0#1.base, 8 + main_~users~0#1.offset, 4);call main_#t~mem65#1 := read~int(main_#t~mem64#1.base, 4 + main_#t~mem64#1.offset, 4);main_~_ha_bkt~0#1 := (if 0 == main_~_ha_hashv~0#1 || 0 == main_#t~mem65#1 - 1 then 0 else (if 1 == main_#t~mem65#1 - 1 then (if 1 == main_~_ha_hashv~0#1 || 0 == main_~_ha_hashv~0#1 then main_~_ha_hashv~0#1 else (if main_~_ha_hashv~0#1 >= 0 then main_~_ha_hashv~0#1 % 2 else ~bitwiseAnd(main_~_ha_hashv~0#1, main_#t~mem65#1 - 1))) else (if 1 == main_~_ha_hashv~0#1 then (if 1 == main_#t~mem65#1 - 1 || 0 == main_#t~mem65#1 - 1 then main_#t~mem65#1 - 1 else (if main_#t~mem65#1 - 1 >= 0 then (main_#t~mem65#1 - 1) % 2 else ~bitwiseAnd(main_~_ha_hashv~0#1, main_#t~mem65#1 - 1))) else ~bitwiseAnd(main_~_ha_hashv~0#1, main_#t~mem65#1 - 1))));havoc main_#t~mem64#1.base, main_#t~mem64#1.offset;havoc main_#t~mem65#1; {16130#false} is VALID [2022-02-21 03:19:06,385 INFO L290 TraceCheckUtils]: 60: Hoare triple {16130#false} havoc main_~_ha_bkt~0#1;call main_#t~mem61#1.base, main_#t~mem61#1.offset := read~$Pointer$(main_~users~0#1.base, 8 + main_~users~0#1.offset, 4);call main_#t~mem62#1 := read~int(main_#t~mem61#1.base, 12 + main_#t~mem61#1.offset, 4);main_#t~post63#1 := main_#t~mem62#1;call write~int(1 + main_#t~post63#1, main_#t~mem61#1.base, 12 + main_#t~mem61#1.offset, 4);havoc main_#t~mem61#1.base, main_#t~mem61#1.offset;havoc main_#t~mem62#1;havoc main_#t~post63#1; {16130#false} is VALID [2022-02-21 03:19:06,385 INFO L290 TraceCheckUtils]: 59: Hoare triple {16130#false} main_~users~0#1.base, main_~users~0#1.offset := main_~user~0#1.base, main_~user~0#1.offset; {16130#false} is VALID [2022-02-21 03:19:06,385 INFO L290 TraceCheckUtils]: 58: Hoare triple {16130#false} goto; {16130#false} is VALID [2022-02-21 03:19:06,385 INFO L290 TraceCheckUtils]: 57: Hoare triple {16130#false} havoc main_#t~mem50#1.base, main_#t~mem50#1.offset;havoc main_#t~mem51#1.base, main_#t~mem51#1.offset;havoc main_#t~memset~res52#1.base, main_#t~memset~res52#1.offset; {16130#false} is VALID [2022-02-21 03:19:06,386 INFO L284 TraceCheckUtils]: 56: Hoare quadruple {16500#(not (= 384 |#Ultimate.C_memset_#amount|))} {16129#true} #916#return; {16130#false} is VALID [2022-02-21 03:19:06,386 INFO L290 TraceCheckUtils]: 55: Hoare triple {16500#(not (= 384 |#Ultimate.C_memset_#amount|))} assume #res.base == #ptr.base && #res.offset == #ptr.offset; {16500#(not (= 384 |#Ultimate.C_memset_#amount|))} is VALID [2022-02-21 03:19:06,387 INFO L290 TraceCheckUtils]: 54: Hoare triple {16507#(or (not (= 384 |#Ultimate.C_memset_#amount|)) (< (mod |#Ultimate.C_memset_#t~loopctr235| 4294967296) (mod |#Ultimate.C_memset_#amount| 4294967296)))} assume !(#t~loopctr235 % 4294967296 < #amount % 4294967296); {16500#(not (= 384 |#Ultimate.C_memset_#amount|))} is VALID [2022-02-21 03:19:06,389 INFO L290 TraceCheckUtils]: 53: Hoare triple {16511#(or (not (= 384 |#Ultimate.C_memset_#amount|)) (< (mod (+ |#Ultimate.C_memset_#t~loopctr235| 1) 4294967296) (mod |#Ultimate.C_memset_#amount| 4294967296)))} assume #t~loopctr235 % 4294967296 < #amount % 4294967296;#memory_int := #memory_int[#ptr.base,#ptr.offset + #t~loopctr235 := #value];#memory_$Pointer$.base, #memory_$Pointer$.offset := #memory_$Pointer$.base[#ptr.base,#ptr.offset + #t~loopctr235 := 0], #memory_$Pointer$.offset[#ptr.base,#ptr.offset + #t~loopctr235 := #value % 256];#t~loopctr235 := 1 + #t~loopctr235; {16507#(or (not (= 384 |#Ultimate.C_memset_#amount|)) (< (mod |#Ultimate.C_memset_#t~loopctr235| 4294967296) (mod |#Ultimate.C_memset_#amount| 4294967296)))} is VALID [2022-02-21 03:19:06,389 INFO L290 TraceCheckUtils]: 52: Hoare triple {16129#true} #t~loopctr235 := 0; {16511#(or (not (= 384 |#Ultimate.C_memset_#amount|)) (< (mod (+ |#Ultimate.C_memset_#t~loopctr235| 1) 4294967296) (mod |#Ultimate.C_memset_#amount| 4294967296)))} is VALID [2022-02-21 03:19:06,389 INFO L272 TraceCheckUtils]: 51: Hoare triple {16129#true} call main_#t~memset~res52#1.base, main_#t~memset~res52#1.offset := #Ultimate.C_memset(main_#t~mem51#1.base, main_#t~mem51#1.offset, 0, 384); {16129#true} is VALID [2022-02-21 03:19:06,389 INFO L290 TraceCheckUtils]: 50: Hoare triple {16129#true} assume !(main_#t~mem48#1.base == 0 && main_#t~mem48#1.offset == 0);havoc main_#t~mem47#1.base, main_#t~mem47#1.offset;havoc main_#t~mem48#1.base, main_#t~mem48#1.offset;call main_#t~mem50#1.base, main_#t~mem50#1.offset := read~$Pointer$(main_~user~0#1.base, 8 + main_~user~0#1.offset, 4);call main_#t~mem51#1.base, main_#t~mem51#1.offset := read~$Pointer$(main_#t~mem50#1.base, main_#t~mem50#1.offset, 4); {16129#true} is VALID [2022-02-21 03:19:06,390 INFO L290 TraceCheckUtils]: 49: Hoare triple {16129#true} havoc main_#t~mem38#1.base, main_#t~mem38#1.offset;havoc main_#t~memset~res39#1.base, main_#t~memset~res39#1.offset;call main_#t~mem40#1.base, main_#t~mem40#1.offset := read~$Pointer$(main_~user~0#1.base, 8 + main_~user~0#1.offset, 4);call write~$Pointer$(main_~user~0#1.base, 8 + main_~user~0#1.offset, main_#t~mem40#1.base, 16 + main_#t~mem40#1.offset, 4);havoc main_#t~mem40#1.base, main_#t~mem40#1.offset;call main_#t~mem41#1.base, main_#t~mem41#1.offset := read~$Pointer$(main_~user~0#1.base, 8 + main_~user~0#1.offset, 4);call write~int(32, main_#t~mem41#1.base, 4 + main_#t~mem41#1.offset, 4);havoc main_#t~mem41#1.base, main_#t~mem41#1.offset;call main_#t~mem42#1.base, main_#t~mem42#1.offset := read~$Pointer$(main_~user~0#1.base, 8 + main_~user~0#1.offset, 4);call write~int(5, main_#t~mem42#1.base, 8 + main_#t~mem42#1.offset, 4);havoc main_#t~mem42#1.base, main_#t~mem42#1.offset;call main_#t~mem43#1.base, main_#t~mem43#1.offset := read~$Pointer$(main_~user~0#1.base, 8 + main_~user~0#1.offset, 4);call write~int((if 8 + main_~user~0#1.offset - main_~user~0#1.offset < 0 && 0 != (8 + main_~user~0#1.offset - main_~user~0#1.offset) % 1 then 1 + (8 + main_~user~0#1.offset - main_~user~0#1.offset) / 1 else (8 + main_~user~0#1.offset - main_~user~0#1.offset) / 1), main_#t~mem43#1.base, 20 + main_#t~mem43#1.offset, 4);havoc main_#t~mem43#1.base, main_#t~mem43#1.offset;call main_#t~mem44#1.base, main_#t~mem44#1.offset := read~$Pointer$(main_~user~0#1.base, 8 + main_~user~0#1.offset, 4);call main_#t~malloc45#1.base, main_#t~malloc45#1.offset := #Ultimate.allocOnHeap(384);call write~$Pointer$(main_#t~malloc45#1.base, main_#t~malloc45#1.offset, main_#t~mem44#1.base, main_#t~mem44#1.offset, 4);havoc main_#t~mem44#1.base, main_#t~mem44#1.offset;havoc main_#t~malloc45#1.base, main_#t~malloc45#1.offset;call main_#t~mem46#1.base, main_#t~mem46#1.offset := read~$Pointer$(main_~user~0#1.base, 8 + main_~user~0#1.offset, 4);call write~int(2685476833, main_#t~mem46#1.base, 40 + main_#t~mem46#1.offset, 4);havoc main_#t~mem46#1.base, main_#t~mem46#1.offset;call main_#t~mem47#1.base, main_#t~mem47#1.offset := read~$Pointer$(main_~user~0#1.base, 8 + main_~user~0#1.offset, 4);call main_#t~mem48#1.base, main_#t~mem48#1.offset := read~$Pointer$(main_#t~mem47#1.base, main_#t~mem47#1.offset, 4); {16129#true} is VALID [2022-02-21 03:19:06,390 INFO L284 TraceCheckUtils]: 48: Hoare quadruple {16129#true} {16129#true} #914#return; {16129#true} is VALID [2022-02-21 03:19:06,390 INFO L290 TraceCheckUtils]: 47: Hoare triple {16129#true} assume #res.base == #ptr.base && #res.offset == #ptr.offset; {16129#true} is VALID [2022-02-21 03:19:06,390 INFO L290 TraceCheckUtils]: 46: Hoare triple {16129#true} assume !(#t~loopctr235 % 4294967296 < #amount % 4294967296); {16129#true} is VALID [2022-02-21 03:19:06,390 INFO L290 TraceCheckUtils]: 45: Hoare triple {16129#true} assume #t~loopctr235 % 4294967296 < #amount % 4294967296;#memory_int := #memory_int[#ptr.base,#ptr.offset + #t~loopctr235 := #value];#memory_$Pointer$.base, #memory_$Pointer$.offset := #memory_$Pointer$.base[#ptr.base,#ptr.offset + #t~loopctr235 := 0], #memory_$Pointer$.offset[#ptr.base,#ptr.offset + #t~loopctr235 := #value % 256];#t~loopctr235 := 1 + #t~loopctr235; {16129#true} is VALID [2022-02-21 03:19:06,390 INFO L290 TraceCheckUtils]: 44: Hoare triple {16129#true} #t~loopctr235 := 0; {16129#true} is VALID [2022-02-21 03:19:06,391 INFO L272 TraceCheckUtils]: 43: Hoare triple {16129#true} call main_#t~memset~res39#1.base, main_#t~memset~res39#1.offset := #Ultimate.C_memset(main_#t~mem38#1.base, main_#t~mem38#1.offset, 0, 44); {16129#true} is VALID [2022-02-21 03:19:06,391 INFO L290 TraceCheckUtils]: 42: Hoare triple {16129#true} assume !(main_#t~mem37#1.base == 0 && main_#t~mem37#1.offset == 0);havoc main_#t~mem37#1.base, main_#t~mem37#1.offset;call main_#t~mem38#1.base, main_#t~mem38#1.offset := read~$Pointer$(main_~user~0#1.base, 8 + main_~user~0#1.offset, 4); {16129#true} is VALID [2022-02-21 03:19:06,391 INFO L290 TraceCheckUtils]: 41: Hoare triple {16129#true} call main_#t~malloc36#1.base, main_#t~malloc36#1.offset := #Ultimate.allocOnHeap(44);call write~$Pointer$(main_#t~malloc36#1.base, main_#t~malloc36#1.offset, main_~user~0#1.base, 8 + main_~user~0#1.offset, 4);havoc main_#t~malloc36#1.base, main_#t~malloc36#1.offset;call main_#t~mem37#1.base, main_#t~mem37#1.offset := read~$Pointer$(main_~user~0#1.base, 8 + main_~user~0#1.offset, 4); {16129#true} is VALID [2022-02-21 03:19:06,391 INFO L290 TraceCheckUtils]: 40: Hoare triple {16129#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); {16129#true} is VALID [2022-02-21 03:19:06,391 INFO L290 TraceCheckUtils]: 39: Hoare triple {16129#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); {16129#true} is VALID [2022-02-21 03:19:06,391 INFO L290 TraceCheckUtils]: 38: Hoare triple {16129#true} goto; {16129#true} is VALID [2022-02-21 03:19:06,391 INFO L290 TraceCheckUtils]: 37: Hoare triple {16129#true} goto; {16129#true} is VALID [2022-02-21 03:19:06,392 INFO L290 TraceCheckUtils]: 36: Hoare triple {16129#true} goto; {16129#true} is VALID [2022-02-21 03:19:06,392 INFO L290 TraceCheckUtils]: 35: Hoare triple {16129#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)))); {16129#true} is VALID [2022-02-21 03:19:06,392 INFO L290 TraceCheckUtils]: 34: Hoare triple {16129#true} havoc main_#t~switch24#1; {16129#true} is VALID [2022-02-21 03:19:06,392 INFO L290 TraceCheckUtils]: 33: Hoare triple {16129#true} assume main_#t~switch24#1;call main_#t~mem35#1 := read~int(main_~_hj_key~0#1.base, main_~_hj_key~0#1.offset, 1);main_~_hj_i~0#1 := main_~_hj_i~0#1 + main_#t~mem35#1 % 256;havoc main_#t~mem35#1; {16129#true} is VALID [2022-02-21 03:19:06,392 INFO L290 TraceCheckUtils]: 32: Hoare triple {16129#true} main_#t~switch24#1 := main_#t~switch24#1 || 1 == main_~_hj_k~0#1; {16129#true} is VALID [2022-02-21 03:19:06,392 INFO L290 TraceCheckUtils]: 31: Hoare triple {16129#true} assume main_#t~switch24#1;call main_#t~mem34#1 := read~int(main_~_hj_key~0#1.base, 1 + main_~_hj_key~0#1.offset, 1);main_~_hj_i~0#1 := main_~_hj_i~0#1 + 256 * (main_#t~mem34#1 % 256);havoc main_#t~mem34#1; {16129#true} is VALID [2022-02-21 03:19:06,393 INFO L290 TraceCheckUtils]: 30: Hoare triple {16129#true} main_#t~switch24#1 := main_#t~switch24#1 || 2 == main_~_hj_k~0#1; {16129#true} is VALID [2022-02-21 03:19:06,393 INFO L290 TraceCheckUtils]: 29: Hoare triple {16129#true} assume main_#t~switch24#1;call main_#t~mem33#1 := read~int(main_~_hj_key~0#1.base, 2 + main_~_hj_key~0#1.offset, 1);main_~_hj_i~0#1 := main_~_hj_i~0#1 + 65536 * (main_#t~mem33#1 % 256);havoc main_#t~mem33#1; {16129#true} is VALID [2022-02-21 03:19:06,393 INFO L290 TraceCheckUtils]: 28: Hoare triple {16129#true} main_#t~switch24#1 := main_#t~switch24#1 || 3 == main_~_hj_k~0#1; {16129#true} is VALID [2022-02-21 03:19:06,393 INFO L290 TraceCheckUtils]: 27: Hoare triple {16129#true} assume main_#t~switch24#1;call main_#t~mem32#1 := read~int(main_~_hj_key~0#1.base, 3 + main_~_hj_key~0#1.offset, 1);main_~_hj_i~0#1 := main_~_hj_i~0#1 + 16777216 * (main_#t~mem32#1 % 256);havoc main_#t~mem32#1; {16129#true} is VALID [2022-02-21 03:19:06,393 INFO L290 TraceCheckUtils]: 26: Hoare triple {16129#true} main_#t~switch24#1 := main_#t~switch24#1 || 4 == main_~_hj_k~0#1; {16129#true} is VALID [2022-02-21 03:19:06,393 INFO L290 TraceCheckUtils]: 25: Hoare triple {16129#true} assume !main_#t~switch24#1; {16129#true} is VALID [2022-02-21 03:19:06,393 INFO L290 TraceCheckUtils]: 24: Hoare triple {16129#true} main_#t~switch24#1 := main_#t~switch24#1 || 5 == main_~_hj_k~0#1; {16129#true} is VALID [2022-02-21 03:19:06,393 INFO L290 TraceCheckUtils]: 23: Hoare triple {16129#true} assume !main_#t~switch24#1; {16129#true} is VALID [2022-02-21 03:19:06,394 INFO L290 TraceCheckUtils]: 22: Hoare triple {16129#true} main_#t~switch24#1 := main_#t~switch24#1 || 6 == main_~_hj_k~0#1; {16129#true} is VALID [2022-02-21 03:19:06,394 INFO L290 TraceCheckUtils]: 21: Hoare triple {16129#true} assume !main_#t~switch24#1; {16129#true} is VALID [2022-02-21 03:19:06,394 INFO L290 TraceCheckUtils]: 20: Hoare triple {16129#true} main_#t~switch24#1 := main_#t~switch24#1 || 7 == main_~_hj_k~0#1; {16129#true} is VALID [2022-02-21 03:19:06,394 INFO L290 TraceCheckUtils]: 19: Hoare triple {16129#true} assume !main_#t~switch24#1; {16129#true} is VALID [2022-02-21 03:19:06,394 INFO L290 TraceCheckUtils]: 18: Hoare triple {16129#true} main_#t~switch24#1 := main_#t~switch24#1 || 8 == main_~_hj_k~0#1; {16129#true} is VALID [2022-02-21 03:19:06,394 INFO L290 TraceCheckUtils]: 17: Hoare triple {16129#true} assume !main_#t~switch24#1; {16129#true} is VALID [2022-02-21 03:19:06,394 INFO L290 TraceCheckUtils]: 16: Hoare triple {16129#true} main_#t~switch24#1 := main_#t~switch24#1 || 9 == main_~_hj_k~0#1; {16129#true} is VALID [2022-02-21 03:19:06,395 INFO L290 TraceCheckUtils]: 15: Hoare triple {16129#true} assume !main_#t~switch24#1; {16129#true} is VALID [2022-02-21 03:19:06,395 INFO L290 TraceCheckUtils]: 14: Hoare triple {16129#true} main_#t~switch24#1 := main_#t~switch24#1 || 10 == main_~_hj_k~0#1; {16129#true} is VALID [2022-02-21 03:19:06,395 INFO L290 TraceCheckUtils]: 13: Hoare triple {16129#true} assume !main_#t~switch24#1; {16129#true} is VALID [2022-02-21 03:19:06,395 INFO L290 TraceCheckUtils]: 12: Hoare triple {16129#true} main_~_ha_hashv~0#1 := 4 + main_~_ha_hashv~0#1;main_#t~switch24#1 := 11 == main_~_hj_k~0#1; {16129#true} is VALID [2022-02-21 03:19:06,395 INFO L290 TraceCheckUtils]: 11: Hoare triple {16129#true} assume !(main_~_hj_k~0#1 % 4294967296 >= 12); {16129#true} is VALID [2022-02-21 03:19:06,395 INFO L290 TraceCheckUtils]: 10: Hoare triple {16129#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; {16129#true} is VALID [2022-02-21 03:19:06,395 INFO L290 TraceCheckUtils]: 9: Hoare triple {16129#true} goto; {16129#true} is VALID [2022-02-21 03:19:06,396 INFO L290 TraceCheckUtils]: 8: Hoare triple {16129#true} havoc main_~_ha_hashv~0#1; {16129#true} is VALID [2022-02-21 03:19:06,396 INFO L290 TraceCheckUtils]: 7: Hoare triple {16129#true} assume main_#t~mem10#1 * main_#t~mem11#1 >= -2147483648;call write~int(main_#t~mem10#1 * main_#t~mem11#1, main_~user~0#1.base, 4 + main_~user~0#1.offset, 4);havoc main_#t~mem10#1;havoc main_#t~mem11#1; {16129#true} is VALID [2022-02-21 03:19:06,396 INFO L290 TraceCheckUtils]: 6: Hoare triple {16129#true} assume main_#t~mem10#1 * main_#t~mem11#1 <= 2147483647; {16129#true} is VALID [2022-02-21 03:19:06,396 INFO L290 TraceCheckUtils]: 5: Hoare triple {16129#true} call main_#t~mem9#1 := read~int(main_~#i~0#1.base, main_~#i~0#1.offset, 4);call write~int(main_#t~mem9#1, main_~user~0#1.base, main_~user~0#1.offset, 4);havoc main_#t~mem9#1;call main_#t~mem10#1 := read~int(main_~#i~0#1.base, main_~#i~0#1.offset, 4);call main_#t~mem11#1 := read~int(main_~#i~0#1.base, main_~#i~0#1.offset, 4); {16129#true} is VALID [2022-02-21 03:19:06,396 INFO L290 TraceCheckUtils]: 4: Hoare triple {16129#true} assume !(main_~user~0#1.base == 0 && main_~user~0#1.offset == 0); {16129#true} is VALID [2022-02-21 03:19:06,396 INFO L290 TraceCheckUtils]: 3: Hoare triple {16129#true} assume !!(main_#t~mem7#1 < 10);havoc main_#t~mem7#1;call main_#t~malloc8#1.base, main_#t~malloc8#1.offset := #Ultimate.allocOnHeap(40);main_~user~0#1.base, main_~user~0#1.offset := main_#t~malloc8#1.base, main_#t~malloc8#1.offset;havoc main_#t~malloc8#1.base, main_#t~malloc8#1.offset; {16129#true} is VALID [2022-02-21 03:19:06,396 INFO L290 TraceCheckUtils]: 2: Hoare triple {16129#true} call main_#t~mem7#1 := read~int(main_~#i~0#1.base, main_~#i~0#1.offset, 4); {16129#true} is VALID [2022-02-21 03:19:06,397 INFO L290 TraceCheckUtils]: 1: Hoare triple {16129#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc8#1.base, main_#t~malloc8#1.offset, main_#t~mem9#1, main_#t~mem10#1, main_#t~mem11#1, main_#t~mem13#1, main_#t~mem12#1, main_#t~mem14#1, main_#t~mem15#1, main_#t~mem17#1, main_#t~mem16#1, main_#t~mem18#1, main_#t~mem19#1, main_#t~mem21#1, main_#t~mem20#1, main_#t~mem22#1, main_#t~mem23#1, main_#t~switch24#1, main_#t~mem25#1, main_#t~mem26#1, main_#t~mem27#1, main_#t~mem28#1, main_#t~mem29#1, main_#t~mem30#1, main_#t~mem31#1, main_#t~mem32#1, main_#t~mem33#1, main_#t~mem34#1, main_#t~mem35#1, main_~_hj_i~0#1, main_~_hj_j~0#1, main_~_hj_k~0#1, main_~_hj_key~0#1.base, main_~_hj_key~0#1.offset, main_#t~malloc36#1.base, main_#t~malloc36#1.offset, main_#t~mem37#1.base, main_#t~mem37#1.offset, main_#t~mem38#1.base, main_#t~mem38#1.offset, main_#t~memset~res39#1.base, main_#t~memset~res39#1.offset, main_#t~mem40#1.base, main_#t~mem40#1.offset, main_#t~mem41#1.base, main_#t~mem41#1.offset, main_#t~mem42#1.base, main_#t~mem42#1.offset, main_#t~mem43#1.base, main_#t~mem43#1.offset, main_#t~mem44#1.base, main_#t~mem44#1.offset, main_#t~malloc45#1.base, main_#t~malloc45#1.offset, main_#t~mem46#1.base, main_#t~mem46#1.offset, main_#t~mem47#1.base, main_#t~mem47#1.offset, main_#t~mem48#1.base, main_#t~mem48#1.offset, main_#t~mem49#1.base, main_#t~mem49#1.offset, main_#t~mem50#1.base, main_#t~mem50#1.offset, main_#t~mem51#1.base, main_#t~mem51#1.offset, main_#t~memset~res52#1.base, main_#t~memset~res52#1.offset, main_#t~mem53#1.base, main_#t~mem53#1.offset, main_#t~mem54#1.base, main_#t~mem54#1.offset, main_#t~mem55#1.base, main_#t~mem55#1.offset, main_#t~mem56#1.base, main_#t~mem56#1.offset, main_#t~mem57#1, main_#t~mem58#1.base, main_#t~mem58#1.offset, main_#t~mem59#1.base, main_#t~mem59#1.offset, main_#t~mem60#1.base, main_#t~mem60#1.offset, main_#t~mem61#1.base, main_#t~mem61#1.offset, main_#t~mem62#1, main_#t~post63#1, main_#t~mem64#1.base, main_#t~mem64#1.offset, main_#t~mem65#1, main_#t~mem66#1.base, main_#t~mem66#1.offset, main_#t~mem67#1.base, main_#t~mem67#1.offset, main_#t~mem68#1, main_#t~post69#1, main_#t~mem70#1.base, main_#t~mem70#1.offset, main_#t~mem71#1.base, main_#t~mem71#1.offset, main_#t~mem72#1.base, main_#t~mem72#1.offset, main_#t~mem74#1, main_#t~mem73#1, main_#t~mem75#1.base, main_#t~mem75#1.offset, main_#t~mem76#1, main_#t~short77#1, main_#t~mem78#1.base, main_#t~mem78#1.offset, main_#t~mem79#1, main_#t~malloc80#1.base, main_#t~malloc80#1.offset, main_#t~mem81#1.base, main_#t~mem81#1.offset, main_#t~mem82#1.base, main_#t~mem82#1.offset, main_#t~mem83#1.base, main_#t~mem83#1.offset, main_#t~mem84#1, main_#t~memset~res85#1.base, main_#t~memset~res85#1.offset, main_#t~mem86#1.base, main_#t~mem86#1.offset, main_#t~mem87#1.base, main_#t~mem87#1.offset, main_#t~mem90#1, main_#t~mem88#1.base, main_#t~mem88#1.offset, main_#t~mem89#1, main_#t~mem91#1.base, main_#t~mem91#1.offset, main_#t~mem94#1, main_#t~mem92#1.base, main_#t~mem92#1.offset, main_#t~mem93#1, main_#t~ite95#1, main_#t~mem96#1.base, main_#t~mem96#1.offset, main_#t~mem100#1.base, main_#t~mem100#1.offset, main_#t~mem101#1.base, main_#t~mem101#1.offset, main_#t~mem102#1.base, main_#t~mem102#1.offset, main_#t~mem103#1.base, main_#t~mem103#1.offset, main_#t~mem106#1, main_#t~mem104#1.base, main_#t~mem104#1.offset, main_#t~mem105#1, main_#t~mem107#1.base, main_#t~mem107#1.offset, main_#t~mem108#1, main_#t~pre109#1, main_#t~mem110#1.base, main_#t~mem110#1.offset, main_#t~mem111#1, main_#t~mem112#1.base, main_#t~mem112#1.offset, main_#t~mem113#1, main_#t~post114#1, main_#t~mem118#1, main_#t~mem116#1, main_#t~mem115#1.base, main_#t~mem115#1.offset, main_#t~mem117#1, main_#t~mem119#1, main_#t~post120#1, main_#t~mem121#1.base, main_#t~mem121#1.offset, main_#t~mem122#1.base, main_#t~mem122#1.offset, main_#t~mem123#1.base, main_#t~mem123#1.offset, main_#t~post97#1, main_#t~mem98#1.base, main_#t~mem98#1.offset, main_#t~mem99#1, main_#t~mem124#1.base, main_#t~mem124#1.offset, main_#t~mem125#1.base, main_#t~mem125#1.offset, main_#t~mem126#1.base, main_#t~mem126#1.offset, main_#t~mem127#1, main_#t~mem128#1.base, main_#t~mem128#1.offset, main_#t~mem129#1, main_#t~post130#1, main_#t~mem131#1.base, main_#t~mem131#1.offset, main_#t~mem132#1.base, main_#t~mem132#1.offset, main_#t~mem133#1.base, main_#t~mem133#1.offset, main_#t~mem134#1.base, main_#t~mem134#1.offset, main_#t~mem137#1, main_#t~mem135#1.base, main_#t~mem135#1.offset, main_#t~mem136#1, main_#t~ite140#1, main_#t~mem138#1.base, main_#t~mem138#1.offset, main_#t~mem139#1, main_#t~mem141#1.base, main_#t~mem141#1.offset, main_#t~mem142#1, main_#t~mem143#1.base, main_#t~mem143#1.offset, main_~_he_bkt~0#1, main_~_he_bkt_i~0#1, main_~_he_thh~0#1.base, main_~_he_thh~0#1.offset, main_~_he_hh_nxt~0#1.base, main_~_he_hh_nxt~0#1.offset, main_~#_he_new_buckets~0#1.base, main_~#_he_new_buckets~0#1.offset, main_~_he_newbkt~0#1.base, main_~_he_newbkt~0#1.offset, main_~_ha_head~0#1.base, main_~_ha_head~0#1.offset, main_~_ha_bkt~0#1, main_~_ha_hashv~0#1, main_#t~mem144#1.base, main_#t~mem144#1.offset, main_#t~mem145#1, main_#t~mem5#1, main_#t~post6#1, main_#t~mem7#1, main_#t~mem149#1, main_#t~mem148#1, main_#t~mem150#1, main_#t~mem151#1, main_#t~mem153#1, main_#t~mem152#1, main_#t~mem154#1, main_#t~mem155#1, main_#t~mem157#1, main_#t~mem156#1, main_#t~mem158#1, main_#t~mem159#1, main_#t~switch160#1, main_#t~mem161#1, main_#t~mem162#1, main_#t~mem163#1, main_#t~mem164#1, main_#t~mem165#1, main_#t~mem166#1, main_#t~mem167#1, main_#t~mem168#1, main_#t~mem169#1, main_#t~mem170#1, main_#t~mem171#1, main_~_hj_i~1#1, main_~_hj_j~1#1, main_~_hj_k~1#1, main_~_hj_key~1#1.base, main_~_hj_key~1#1.offset, main_#t~mem172#1.base, main_#t~mem172#1.offset, main_#t~mem173#1, main_#t~mem174#1.base, main_#t~mem174#1.offset, main_#t~mem175#1.base, main_#t~mem175#1.offset, main_#t~mem176#1.base, main_#t~mem176#1.offset, main_#t~mem177#1.base, main_#t~mem177#1.offset, main_#t~mem178#1.base, main_#t~mem178#1.offset, main_#t~mem179#1.base, main_#t~mem179#1.offset, main_#t~mem180#1.base, main_#t~mem180#1.offset, main_#t~mem181#1, main_#t~mem182#1, main_#t~mem183#1, main_#t~short184#1, main_#t~mem185#1.base, main_#t~mem185#1.offset, main_#t~ret186#1, main_#t~mem187#1.base, main_#t~mem187#1.offset, main_#t~mem188#1.base, main_#t~mem188#1.offset, main_#t~mem189#1.base, main_#t~mem189#1.offset, main_#t~mem190#1, main_~_hf_bkt~0#1, main_~_hf_hashv~0#1, main_#t~mem191#1.base, main_#t~mem191#1.offset, main_#t~mem192#1.base, main_#t~mem192#1.offset, main_#t~short193#1, main_#t~mem194#1.base, main_#t~mem194#1.offset, main_#t~mem195#1.base, main_#t~mem195#1.offset, main_#t~mem196#1.base, main_#t~mem196#1.offset, main_#t~mem197#1.base, main_#t~mem197#1.offset, main_#t~mem198#1.base, main_#t~mem198#1.offset, main_#t~mem199#1.base, main_#t~mem199#1.offset, main_#t~mem200#1.base, main_#t~mem200#1.offset, main_#t~mem201#1.base, main_#t~mem201#1.offset, main_#t~mem202#1, main_#t~mem203#1.base, main_#t~mem203#1.offset, main_#t~mem204#1.base, main_#t~mem204#1.offset, main_#t~mem205#1.base, main_#t~mem205#1.offset, main_#t~mem206#1, main_#t~mem207#1.base, main_#t~mem207#1.offset, main_#t~mem208#1.base, main_#t~mem208#1.offset, main_#t~mem209#1.base, main_#t~mem209#1.offset, main_#t~mem210#1.base, main_#t~mem210#1.offset, main_#t~mem211#1.base, main_#t~mem211#1.offset, main_#t~mem212#1, main_#t~mem213#1.base, main_#t~mem213#1.offset, main_#t~mem216#1, main_#t~mem214#1.base, main_#t~mem214#1.offset, main_#t~mem215#1, main_#t~mem217#1.base, main_#t~mem217#1.offset, main_#t~mem218#1.base, main_#t~mem218#1.offset, main_#t~mem219#1, main_#t~post220#1, main_#t~mem221#1.base, main_#t~mem221#1.offset, main_#t~mem222#1.base, main_#t~mem222#1.offset, main_#t~mem223#1.base, main_#t~mem223#1.offset, main_#t~mem224#1.base, main_#t~mem224#1.offset, main_#t~mem225#1.base, main_#t~mem225#1.offset, main_#t~mem226#1.base, main_#t~mem226#1.offset, main_#t~mem227#1.base, main_#t~mem227#1.offset, main_#t~mem228#1.base, main_#t~mem228#1.offset, main_~_hd_head~0#1.base, main_~_hd_head~0#1.offset, main_#t~mem229#1.base, main_#t~mem229#1.offset, main_#t~mem230#1, main_#t~post231#1, main_~_hd_bkt~0#1, main_~_hd_hh_del~0#1.base, main_~_hd_hh_del~0#1.offset, main_#t~mem232#1.base, main_#t~mem232#1.offset, main_#t~mem233#1, main_#t~mem146#1, main_#t~mem147#1, main_~#i~0#1.base, main_~#i~0#1.offset, main_~user~0#1.base, main_~user~0#1.offset, main_~tmp~0#1.base, main_~tmp~0#1.offset, main_~users~0#1.base, main_~users~0#1.offset;call main_~#i~0#1.base, main_~#i~0#1.offset := #Ultimate.allocOnStack(4);havoc main_~user~0#1.base, main_~user~0#1.offset;havoc main_~tmp~0#1.base, main_~tmp~0#1.offset;main_~users~0#1.base, main_~users~0#1.offset := 0, 0;call write~int(0, main_~#i~0#1.base, main_~#i~0#1.offset, 4); {16129#true} is VALID [2022-02-21 03:19:06,397 INFO L290 TraceCheckUtils]: 0: Hoare triple {16129#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(21, 2);~count_int~0 := 0; {16129#true} is VALID [2022-02-21 03:19:06,397 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 6 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-02-21 03:19:06,397 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 03:19:06,397 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1907994848] [2022-02-21 03:19:06,398 WARN L317 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-02-21 03:19:06,398 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1820148554] [2022-02-21 03:19:06,398 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1820148554] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-21 03:19:06,398 INFO L191 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-02-21 03:19:06,398 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2022-02-21 03:19:06,401 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [729048290] [2022-02-21 03:19:06,401 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-02-21 03:19:06,401 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 11.875) internal successors, (95), 8 states have internal predecessors, (95), 2 states have call successors, (6), 2 states have call predecessors, (6), 4 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 89 [2022-02-21 03:19:06,402 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-21 03:19:06,402 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 8 states, 8 states have (on average 11.875) internal successors, (95), 8 states have internal predecessors, (95), 2 states have call successors, (6), 2 states have call predecessors, (6), 4 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2022-02-21 03:19:06,501 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 108 edges. 108 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:19:06,501 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-02-21 03:19:06,501 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 03:19:06,501 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-02-21 03:19:06,502 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2022-02-21 03:19:06,502 INFO L87 Difference]: Start difference. First operand 412 states and 535 transitions. Second operand has 8 states, 8 states have (on average 11.875) internal successors, (95), 8 states have internal predecessors, (95), 2 states have call successors, (6), 2 states have call predecessors, (6), 4 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2022-02-21 03:19:08,462 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:19:08,463 INFO L93 Difference]: Finished difference Result 793 states and 1051 transitions. [2022-02-21 03:19:08,463 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-02-21 03:19:08,463 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 11.875) internal successors, (95), 8 states have internal predecessors, (95), 2 states have call successors, (6), 2 states have call predecessors, (6), 4 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 89 [2022-02-21 03:19:08,463 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-21 03:19:08,464 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 11.875) internal successors, (95), 8 states have internal predecessors, (95), 2 states have call successors, (6), 2 states have call predecessors, (6), 4 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2022-02-21 03:19:08,469 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 644 transitions. [2022-02-21 03:19:08,470 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 11.875) internal successors, (95), 8 states have internal predecessors, (95), 2 states have call successors, (6), 2 states have call predecessors, (6), 4 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2022-02-21 03:19:08,474 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 644 transitions. [2022-02-21 03:19:08,474 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 11 states and 644 transitions. [2022-02-21 03:19:09,012 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 644 edges. 644 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:19:09,026 INFO L225 Difference]: With dead ends: 793 [2022-02-21 03:19:09,026 INFO L226 Difference]: Without dead ends: 434 [2022-02-21 03:19:09,027 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 181 GetRequests, 170 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=62, Invalid=94, Unknown=0, NotChecked=0, Total=156 [2022-02-21 03:19:09,027 INFO L933 BasicCegarLoop]: 308 mSDtfsCounter, 17 mSDsluCounter, 1523 mSDsCounter, 0 mSdLazyCounter, 44 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 1831 SdHoareTripleChecker+Invalid, 58 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 44 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-21 03:19:09,028 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [17 Valid, 1831 Invalid, 58 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 44 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-21 03:19:09,028 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 434 states. [2022-02-21 03:19:09,153 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 434 to 430. [2022-02-21 03:19:09,153 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 03:19:09,154 INFO L82 GeneralOperation]: Start isEquivalent. First operand 434 states. Second operand has 430 states, 390 states have (on average 1.3102564102564103) internal successors, (511), 413 states have internal predecessors, (511), 25 states have call successors, (25), 7 states have call predecessors, (25), 8 states have return successors, (29), 10 states have call predecessors, (29), 25 states have call successors, (29) [2022-02-21 03:19:09,155 INFO L74 IsIncluded]: Start isIncluded. First operand 434 states. Second operand has 430 states, 390 states have (on average 1.3102564102564103) internal successors, (511), 413 states have internal predecessors, (511), 25 states have call successors, (25), 7 states have call predecessors, (25), 8 states have return successors, (29), 10 states have call predecessors, (29), 25 states have call successors, (29) [2022-02-21 03:19:09,156 INFO L87 Difference]: Start difference. First operand 434 states. Second operand has 430 states, 390 states have (on average 1.3102564102564103) internal successors, (511), 413 states have internal predecessors, (511), 25 states have call successors, (25), 7 states have call predecessors, (25), 8 states have return successors, (29), 10 states have call predecessors, (29), 25 states have call successors, (29) [2022-02-21 03:19:09,168 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:19:09,168 INFO L93 Difference]: Finished difference Result 434 states and 569 transitions. [2022-02-21 03:19:09,169 INFO L276 IsEmpty]: Start isEmpty. Operand 434 states and 569 transitions. [2022-02-21 03:19:09,170 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:19:09,170 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:19:09,171 INFO L74 IsIncluded]: Start isIncluded. First operand has 430 states, 390 states have (on average 1.3102564102564103) internal successors, (511), 413 states have internal predecessors, (511), 25 states have call successors, (25), 7 states have call predecessors, (25), 8 states have return successors, (29), 10 states have call predecessors, (29), 25 states have call successors, (29) Second operand 434 states. [2022-02-21 03:19:09,171 INFO L87 Difference]: Start difference. First operand has 430 states, 390 states have (on average 1.3102564102564103) internal successors, (511), 413 states have internal predecessors, (511), 25 states have call successors, (25), 7 states have call predecessors, (25), 8 states have return successors, (29), 10 states have call predecessors, (29), 25 states have call successors, (29) Second operand 434 states. [2022-02-21 03:19:09,183 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:19:09,184 INFO L93 Difference]: Finished difference Result 434 states and 569 transitions. [2022-02-21 03:19:09,184 INFO L276 IsEmpty]: Start isEmpty. Operand 434 states and 569 transitions. [2022-02-21 03:19:09,185 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:19:09,185 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:19:09,185 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 03:19:09,185 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 03:19:09,187 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 430 states, 390 states have (on average 1.3102564102564103) internal successors, (511), 413 states have internal predecessors, (511), 25 states have call successors, (25), 7 states have call predecessors, (25), 8 states have return successors, (29), 10 states have call predecessors, (29), 25 states have call successors, (29) [2022-02-21 03:19:09,199 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 430 states to 430 states and 565 transitions. [2022-02-21 03:19:09,200 INFO L78 Accepts]: Start accepts. Automaton has 430 states and 565 transitions. Word has length 89 [2022-02-21 03:19:09,200 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-21 03:19:09,200 INFO L470 AbstractCegarLoop]: Abstraction has 430 states and 565 transitions. [2022-02-21 03:19:09,200 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 11.875) internal successors, (95), 8 states have internal predecessors, (95), 2 states have call successors, (6), 2 states have call predecessors, (6), 4 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2022-02-21 03:19:09,200 INFO L276 IsEmpty]: Start isEmpty. Operand 430 states and 565 transitions. [2022-02-21 03:19:09,201 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2022-02-21 03:19:09,201 INFO L506 BasicCegarLoop]: Found error trace [2022-02-21 03:19:09,202 INFO L514 BasicCegarLoop]: trace histogram [6, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-21 03:19:09,241 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2022-02-21 03:19:09,419 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2022-02-21 03:19:09,420 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [test_intErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, test_intErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2022-02-21 03:19:09,420 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:19:09,420 INFO L85 PathProgramCache]: Analyzing trace with hash -1339525929, now seen corresponding path program 2 times [2022-02-21 03:19:09,420 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:19:09,420 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1590845415] [2022-02-21 03:19:09,420 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:19:09,421 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:19:09,496 ERROR L252 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-02-21 03:19:09,496 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1436515224] [2022-02-21 03:19:09,496 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-02-21 03:19:09,496 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-21 03:19:09,497 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:19:09,500 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:19:09,507 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process