./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/uthash-2.0.2/uthash_SAX_test9-1.i --full-output -ea --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 03d7b7b3 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -ea -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/uthash-2.0.2/uthash_SAX_test9-1.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash e2cb3c9a8570b7ee66b623ed5fd2a1832f018e766f6bb5120cee7430951770d6 --- Real Ultimate output --- This is Ultimate 0.2.2-dev-03d7b7b [2022-02-20 23:33:00,661 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-02-20 23:33:00,663 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-02-20 23:33:00,689 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-02-20 23:33:00,691 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-02-20 23:33:00,693 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-02-20 23:33:00,695 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-02-20 23:33:00,699 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-02-20 23:33:00,701 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-02-20 23:33:00,704 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-02-20 23:33:00,704 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-02-20 23:33:00,705 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-02-20 23:33:00,706 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-02-20 23:33:00,707 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-02-20 23:33:00,708 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-02-20 23:33:00,710 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-02-20 23:33:00,710 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-02-20 23:33:00,711 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-02-20 23:33:00,714 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-02-20 23:33:00,719 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-02-20 23:33:00,720 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-02-20 23:33:00,722 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-02-20 23:33:00,723 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-02-20 23:33:00,724 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-02-20 23:33:00,730 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-02-20 23:33:00,730 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-02-20 23:33:00,730 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-02-20 23:33:00,732 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-02-20 23:33:00,732 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-02-20 23:33:00,733 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-02-20 23:33:00,733 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-02-20 23:33:00,734 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-02-20 23:33:00,735 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-02-20 23:33:00,736 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-02-20 23:33:00,737 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-02-20 23:33:00,738 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-02-20 23:33:00,738 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-02-20 23:33:00,738 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-02-20 23:33:00,739 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-02-20 23:33:00,739 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-02-20 23:33:00,740 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-02-20 23:33:00,741 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2022-02-20 23:33:00,771 INFO L113 SettingsManager]: Loading preferences was successful [2022-02-20 23:33:00,771 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-02-20 23:33:00,771 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-02-20 23:33:00,771 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-02-20 23:33:00,772 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-02-20 23:33:00,772 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-02-20 23:33:00,773 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-02-20 23:33:00,773 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-02-20 23:33:00,773 INFO L138 SettingsManager]: * Use SBE=true [2022-02-20 23:33:00,773 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-02-20 23:33:00,773 INFO L138 SettingsManager]: * sizeof long=4 [2022-02-20 23:33:00,773 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-02-20 23:33:00,773 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-02-20 23:33:00,774 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-02-20 23:33:00,774 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-02-20 23:33:00,774 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-02-20 23:33:00,774 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-02-20 23:33:00,774 INFO L138 SettingsManager]: * sizeof long double=12 [2022-02-20 23:33:00,774 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-02-20 23:33:00,774 INFO L138 SettingsManager]: * Use constant arrays=true [2022-02-20 23:33:00,774 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-02-20 23:33:00,775 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-02-20 23:33:00,775 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-02-20 23:33:00,775 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-02-20 23:33:00,775 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 23:33:00,775 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-02-20 23:33:00,775 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-02-20 23:33:00,775 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-02-20 23:33:00,776 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-02-20 23:33:00,776 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-02-20 23:33:00,776 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-02-20 23:33:00,776 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-02-20 23:33:00,776 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-02-20 23:33:00,776 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> e2cb3c9a8570b7ee66b623ed5fd2a1832f018e766f6bb5120cee7430951770d6 [2022-02-20 23:33:00,981 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-02-20 23:33:01,004 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-02-20 23:33:01,005 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-02-20 23:33:01,009 INFO L271 PluginConnector]: Initializing CDTParser... [2022-02-20 23:33:01,010 INFO L275 PluginConnector]: CDTParser initialized [2022-02-20 23:33:01,010 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/uthash-2.0.2/uthash_SAX_test9-1.i [2022-02-20 23:33:01,059 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b2455704c/47b8b0bbbea146ec85130bbeb7bb327b/FLAG10146897f [2022-02-20 23:33:01,509 INFO L306 CDTParser]: Found 1 translation units. [2022-02-20 23:33:01,510 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_SAX_test9-1.i [2022-02-20 23:33:01,529 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b2455704c/47b8b0bbbea146ec85130bbeb7bb327b/FLAG10146897f [2022-02-20 23:33:01,799 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b2455704c/47b8b0bbbea146ec85130bbeb7bb327b [2022-02-20 23:33:01,801 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-02-20 23:33:01,802 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-02-20 23:33:01,803 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-02-20 23:33:01,803 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-02-20 23:33:01,805 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-02-20 23:33:01,808 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 11:33:01" (1/1) ... [2022-02-20 23:33:01,809 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@308231ba and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:33:01, skipping insertion in model container [2022-02-20 23:33:01,812 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 11:33:01" (1/1) ... [2022-02-20 23:33:01,817 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-02-20 23:33:01,894 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-20 23:33:02,244 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_SAX_test9-1.i[33021,33034] [2022-02-20 23:33:02,458 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_SAX_test9-1.i[84583,84596] [2022-02-20 23:33:02,463 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 23:33:02,470 INFO L203 MainTranslator]: Completed pre-run [2022-02-20 23:33:02,495 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_SAX_test9-1.i[33021,33034] [2022-02-20 23:33:02,568 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_SAX_test9-1.i[84583,84596] [2022-02-20 23:33:02,569 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 23:33:02,594 INFO L208 MainTranslator]: Completed translation [2022-02-20 23:33:02,594 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:33:02 WrapperNode [2022-02-20 23:33:02,595 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-02-20 23:33:02,595 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-02-20 23:33:02,596 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-02-20 23:33:02,596 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-02-20 23:33:02,600 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:33:02" (1/1) ... [2022-02-20 23:33:02,661 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:33:02" (1/1) ... [2022-02-20 23:33:02,773 INFO L137 Inliner]: procedures = 177, calls = 730, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 2864 [2022-02-20 23:33:02,773 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-02-20 23:33:02,774 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-02-20 23:33:02,774 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-02-20 23:33:02,774 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-02-20 23:33:02,780 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:33:02" (1/1) ... [2022-02-20 23:33:02,781 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:33:02" (1/1) ... [2022-02-20 23:33:02,794 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:33:02" (1/1) ... [2022-02-20 23:33:02,795 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:33:02" (1/1) ... [2022-02-20 23:33:02,854 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:33:02" (1/1) ... [2022-02-20 23:33:02,882 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:33:02" (1/1) ... [2022-02-20 23:33:02,897 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:33:02" (1/1) ... [2022-02-20 23:33:02,914 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-02-20 23:33:02,916 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-02-20 23:33:02,916 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-02-20 23:33:02,916 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-02-20 23:33:02,917 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:33:02" (1/1) ... [2022-02-20 23:33:02,924 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 23:33:02,932 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 23:33:02,975 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-02-20 23:33:02,995 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-02-20 23:33:03,017 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-02-20 23:33:03,018 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-02-20 23:33:03,018 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-02-20 23:33:03,018 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-02-20 23:33:03,018 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset [2022-02-20 23:33:03,018 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset [2022-02-20 23:33:03,018 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-02-20 23:33:03,018 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-02-20 23:33:03,019 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-02-20 23:33:03,019 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-02-20 23:33:03,019 INFO L130 BoogieDeclarations]: Found specification of procedure memcmp [2022-02-20 23:33:03,019 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-02-20 23:33:03,019 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-02-20 23:33:03,019 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-02-20 23:33:03,019 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-02-20 23:33:03,020 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-02-20 23:33:03,233 INFO L234 CfgBuilder]: Building ICFG [2022-02-20 23:33:03,238 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-02-20 23:33:05,460 INFO L275 CfgBuilder]: Performing block encoding [2022-02-20 23:33:05,472 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-02-20 23:33:05,472 INFO L299 CfgBuilder]: Removed 54 assume(true) statements. [2022-02-20 23:33:05,474 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 11:33:05 BoogieIcfgContainer [2022-02-20 23:33:05,474 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-02-20 23:33:05,476 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-02-20 23:33:05,476 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-02-20 23:33:05,478 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-02-20 23:33:05,478 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.02 11:33:01" (1/3) ... [2022-02-20 23:33:05,479 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4b1371cd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 11:33:05, skipping insertion in model container [2022-02-20 23:33:05,479 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:33:02" (2/3) ... [2022-02-20 23:33:05,479 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4b1371cd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 11:33:05, skipping insertion in model container [2022-02-20 23:33:05,479 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 11:33:05" (3/3) ... [2022-02-20 23:33:05,480 INFO L111 eAbstractionObserver]: Analyzing ICFG uthash_SAX_test9-1.i [2022-02-20 23:33:05,483 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-02-20 23:33:05,484 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2022-02-20 23:33:05,516 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-02-20 23:33:05,520 INFO L339 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mLoopAccelerationTechnique=FAST_UPR [2022-02-20 23:33:05,520 INFO L340 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2022-02-20 23:33:05,565 INFO L276 IsEmpty]: Start isEmpty. Operand has 1167 states, 659 states have (on average 1.922610015174507) internal successors, (1267), 1161 states have internal predecessors, (1267), 503 states have call successors, (503), 2 states have call predecessors, (503), 2 states have return successors, (503), 4 states have call predecessors, (503), 503 states have call successors, (503) [2022-02-20 23:33:05,571 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2022-02-20 23:33:05,572 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:33:05,572 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 23:33:05,573 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 23:33:05,579 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:33:05,579 INFO L85 PathProgramCache]: Analyzing trace with hash -858764483, now seen corresponding path program 1 times [2022-02-20 23:33:05,585 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 23:33:05,586 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [706144641] [2022-02-20 23:33:05,586 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:33:05,587 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 23:33:05,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:33:05,759 INFO L290 TraceCheckUtils]: 0: Hoare triple {1170#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(21, 2);~count_int_int~0 := 0; {1170#true} is VALID [2022-02-20 23:33:05,761 INFO L290 TraceCheckUtils]: 1: Hoare triple {1170#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~mem5#1, main_#t~post6#1, main_#t~mem7#1, main_#t~mem147#1, main_#t~mem146#1, main_#t~mem148#1, main_#t~mem149#1, main_#t~mem151#1, main_#t~mem150#1, main_#t~mem152#1, main_#t~mem153#1, main_#t~mem155#1, main_#t~mem154#1, main_#t~mem156#1, main_#t~mem157#1, main_#t~switch158#1, main_#t~mem159#1, main_#t~mem160#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_~_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~mem170#1.base, main_#t~mem170#1.offset, main_#t~mem171#1, main_#t~mem172#1.base, main_#t~mem172#1.offset, main_#t~mem173#1.base, main_#t~mem173#1.offset, main_#t~mem174#1.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, main_#t~mem180#1, main_#t~mem181#1, main_#t~short182#1, main_#t~mem183#1.base, main_#t~mem183#1.offset, main_#t~ret184#1, main_#t~mem185#1.base, main_#t~mem185#1.offset, main_#t~mem186#1.base, main_#t~mem186#1.offset, main_#t~mem187#1.base, main_#t~mem187#1.offset, main_#t~mem188#1, main_~_hf_bkt~0#1, main_~_hf_hashv~0#1, main_#t~mem189#1, main_#t~mem190#1, main_#t~mem144#1, main_#t~mem145#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); {1170#true} is VALID [2022-02-20 23:33:05,763 INFO L290 TraceCheckUtils]: 2: Hoare triple {1170#true} assume !true; {1171#false} is VALID [2022-02-20 23:33:05,763 INFO L290 TraceCheckUtils]: 3: Hoare triple {1171#false} call write~int(0, main_~#i~0#1.base, main_~#i~0#1.offset, 4); {1171#false} is VALID [2022-02-20 23:33:05,763 INFO L290 TraceCheckUtils]: 4: Hoare triple {1171#false} call main_#t~mem145#1 := read~int(main_~#i~0#1.base, main_~#i~0#1.offset, 4); {1171#false} is VALID [2022-02-20 23:33:05,764 INFO L290 TraceCheckUtils]: 5: Hoare triple {1171#false} assume !!(main_#t~mem145#1 < 1000);havoc main_#t~mem145#1; {1171#false} is VALID [2022-02-20 23:33:05,764 INFO L290 TraceCheckUtils]: 6: Hoare triple {1171#false} assume !true; {1171#false} is VALID [2022-02-20 23:33:05,764 INFO L290 TraceCheckUtils]: 7: Hoare triple {1171#false} assume !(main_~tmp~0#1.base != 0 || main_~tmp~0#1.offset != 0); {1171#false} is VALID [2022-02-20 23:33:05,764 INFO L290 TraceCheckUtils]: 8: Hoare triple {1171#false} assume !false; {1171#false} is VALID [2022-02-20 23:33:05,765 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 23:33:05,766 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 23:33:05,766 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [706144641] [2022-02-20 23:33:05,766 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [706144641] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:33:05,767 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:33:05,767 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-02-20 23:33:05,769 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [845564587] [2022-02-20 23:33:05,770 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:33:05,773 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 4.5) internal successors, (9), 2 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2022-02-20 23:33:05,774 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:33:05,776 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 2 states, 2 states have (on average 4.5) internal successors, (9), 2 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:33:05,788 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 9 edges. 9 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:33:05,788 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-02-20 23:33:05,789 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 23:33:05,801 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-02-20 23:33:05,802 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-02-20 23:33:05,808 INFO L87 Difference]: Start difference. First operand has 1167 states, 659 states have (on average 1.922610015174507) internal successors, (1267), 1161 states have internal predecessors, (1267), 503 states have call successors, (503), 2 states have call predecessors, (503), 2 states have return successors, (503), 4 states have call predecessors, (503), 503 states have call successors, (503) Second operand has 2 states, 2 states have (on average 4.5) internal successors, (9), 2 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:33:08,094 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:33:08,094 INFO L93 Difference]: Finished difference Result 2332 states and 5044 transitions. [2022-02-20 23:33:08,094 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-02-20 23:33:08,095 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 4.5) internal successors, (9), 2 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2022-02-20 23:33:08,095 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:33:08,096 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2 states, 2 states have (on average 4.5) internal successors, (9), 2 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:33:08,580 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 5044 transitions. [2022-02-20 23:33:08,581 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2 states, 2 states have (on average 4.5) internal successors, (9), 2 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:33:09,022 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 5044 transitions. [2022-02-20 23:33:09,023 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states and 5044 transitions. [2022-02-20 23:33:12,721 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 5044 edges. 5044 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:33:12,906 INFO L225 Difference]: With dead ends: 2332 [2022-02-20 23:33:12,906 INFO L226 Difference]: Without dead ends: 1163 [2022-02-20 23:33:12,917 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-02-20 23:33:12,920 INFO L933 BasicCegarLoop]: 2213 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, 2213 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 23:33:12,921 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 2213 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 23:33:12,934 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1163 states. [2022-02-20 23:33:13,136 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1163 to 1163. [2022-02-20 23:33:13,136 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:33:13,142 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1163 states. Second operand has 1163 states, 656 states have (on average 1.833841463414634) internal successors, (1203), 1157 states have internal predecessors, (1203), 503 states have call successors, (503), 2 states have call predecessors, (503), 2 states have return successors, (503), 4 states have call predecessors, (503), 503 states have call successors, (503) [2022-02-20 23:33:13,146 INFO L74 IsIncluded]: Start isIncluded. First operand 1163 states. Second operand has 1163 states, 656 states have (on average 1.833841463414634) internal successors, (1203), 1157 states have internal predecessors, (1203), 503 states have call successors, (503), 2 states have call predecessors, (503), 2 states have return successors, (503), 4 states have call predecessors, (503), 503 states have call successors, (503) [2022-02-20 23:33:13,149 INFO L87 Difference]: Start difference. First operand 1163 states. Second operand has 1163 states, 656 states have (on average 1.833841463414634) internal successors, (1203), 1157 states have internal predecessors, (1203), 503 states have call successors, (503), 2 states have call predecessors, (503), 2 states have return successors, (503), 4 states have call predecessors, (503), 503 states have call successors, (503) [2022-02-20 23:33:13,363 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:33:13,364 INFO L93 Difference]: Finished difference Result 1163 states and 2209 transitions. [2022-02-20 23:33:13,364 INFO L276 IsEmpty]: Start isEmpty. Operand 1163 states and 2209 transitions. [2022-02-20 23:33:13,374 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:33:13,374 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:33:13,378 INFO L74 IsIncluded]: Start isIncluded. First operand has 1163 states, 656 states have (on average 1.833841463414634) internal successors, (1203), 1157 states have internal predecessors, (1203), 503 states have call successors, (503), 2 states have call predecessors, (503), 2 states have return successors, (503), 4 states have call predecessors, (503), 503 states have call successors, (503) Second operand 1163 states. [2022-02-20 23:33:13,381 INFO L87 Difference]: Start difference. First operand has 1163 states, 656 states have (on average 1.833841463414634) internal successors, (1203), 1157 states have internal predecessors, (1203), 503 states have call successors, (503), 2 states have call predecessors, (503), 2 states have return successors, (503), 4 states have call predecessors, (503), 503 states have call successors, (503) Second operand 1163 states. [2022-02-20 23:33:13,596 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:33:13,597 INFO L93 Difference]: Finished difference Result 1163 states and 2209 transitions. [2022-02-20 23:33:13,597 INFO L276 IsEmpty]: Start isEmpty. Operand 1163 states and 2209 transitions. [2022-02-20 23:33:13,603 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:33:13,604 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:33:13,604 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:33:13,604 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:33:13,608 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1163 states, 656 states have (on average 1.833841463414634) internal successors, (1203), 1157 states have internal predecessors, (1203), 503 states have call successors, (503), 2 states have call predecessors, (503), 2 states have return successors, (503), 4 states have call predecessors, (503), 503 states have call successors, (503) [2022-02-20 23:33:13,824 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1163 states to 1163 states and 2209 transitions. [2022-02-20 23:33:13,827 INFO L78 Accepts]: Start accepts. Automaton has 1163 states and 2209 transitions. Word has length 9 [2022-02-20 23:33:13,827 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:33:13,829 INFO L470 AbstractCegarLoop]: Abstraction has 1163 states and 2209 transitions. [2022-02-20 23:33:13,830 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 4.5) internal successors, (9), 2 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:33:13,830 INFO L276 IsEmpty]: Start isEmpty. Operand 1163 states and 2209 transitions. [2022-02-20 23:33:13,831 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2022-02-20 23:33:13,831 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:33:13,832 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 23:33:13,832 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-02-20 23:33:13,832 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 23:33:13,835 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:33:13,841 INFO L85 PathProgramCache]: Analyzing trace with hash -293931519, now seen corresponding path program 1 times [2022-02-20 23:33:13,841 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 23:33:13,841 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [851519254] [2022-02-20 23:33:13,841 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:33:13,842 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 23:33:13,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:33:13,965 INFO L290 TraceCheckUtils]: 0: Hoare triple {8593#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(21, 2);~count_int_int~0 := 0; {8593#true} is VALID [2022-02-20 23:33:13,967 INFO L290 TraceCheckUtils]: 1: Hoare triple {8593#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~mem5#1, main_#t~post6#1, main_#t~mem7#1, main_#t~mem147#1, main_#t~mem146#1, main_#t~mem148#1, main_#t~mem149#1, main_#t~mem151#1, main_#t~mem150#1, main_#t~mem152#1, main_#t~mem153#1, main_#t~mem155#1, main_#t~mem154#1, main_#t~mem156#1, main_#t~mem157#1, main_#t~switch158#1, main_#t~mem159#1, main_#t~mem160#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_~_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~mem170#1.base, main_#t~mem170#1.offset, main_#t~mem171#1, main_#t~mem172#1.base, main_#t~mem172#1.offset, main_#t~mem173#1.base, main_#t~mem173#1.offset, main_#t~mem174#1.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, main_#t~mem180#1, main_#t~mem181#1, main_#t~short182#1, main_#t~mem183#1.base, main_#t~mem183#1.offset, main_#t~ret184#1, main_#t~mem185#1.base, main_#t~mem185#1.offset, main_#t~mem186#1.base, main_#t~mem186#1.offset, main_#t~mem187#1.base, main_#t~mem187#1.offset, main_#t~mem188#1, main_~_hf_bkt~0#1, main_~_hf_hashv~0#1, main_#t~mem189#1, main_#t~mem190#1, main_#t~mem144#1, main_#t~mem145#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); {8595#(= (select (select |#memory_int| |ULTIMATE.start_main_~#i~0#1.base|) |ULTIMATE.start_main_~#i~0#1.offset|) 0)} is VALID [2022-02-20 23:33:13,969 INFO L290 TraceCheckUtils]: 2: Hoare triple {8595#(= (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); {8596#(= |ULTIMATE.start_main_#t~mem7#1| 0)} is VALID [2022-02-20 23:33:13,970 INFO L290 TraceCheckUtils]: 3: Hoare triple {8596#(= |ULTIMATE.start_main_#t~mem7#1| 0)} assume !(main_#t~mem7#1 < 1000);havoc main_#t~mem7#1; {8594#false} is VALID [2022-02-20 23:33:13,970 INFO L290 TraceCheckUtils]: 4: Hoare triple {8594#false} call write~int(0, main_~#i~0#1.base, main_~#i~0#1.offset, 4); {8594#false} is VALID [2022-02-20 23:33:13,970 INFO L290 TraceCheckUtils]: 5: Hoare triple {8594#false} call main_#t~mem145#1 := read~int(main_~#i~0#1.base, main_~#i~0#1.offset, 4); {8594#false} is VALID [2022-02-20 23:33:13,970 INFO L290 TraceCheckUtils]: 6: Hoare triple {8594#false} assume !!(main_#t~mem145#1 < 1000);havoc main_#t~mem145#1; {8594#false} is VALID [2022-02-20 23:33:13,971 INFO L290 TraceCheckUtils]: 7: Hoare triple {8594#false} havoc main_~_hf_hashv~0#1; {8594#false} is VALID [2022-02-20 23:33:13,971 INFO L290 TraceCheckUtils]: 8: Hoare triple {8594#false} goto; {8594#false} is VALID [2022-02-20 23:33:13,971 INFO L290 TraceCheckUtils]: 9: Hoare triple {8594#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; {8594#false} is VALID [2022-02-20 23:33:13,972 INFO L290 TraceCheckUtils]: 10: Hoare triple {8594#false} assume !(main_~_hj_k~1#1 % 4294967296 >= 12); {8594#false} is VALID [2022-02-20 23:33:13,972 INFO L290 TraceCheckUtils]: 11: Hoare triple {8594#false} main_~_hf_hashv~0#1 := 4 + main_~_hf_hashv~0#1;main_#t~switch158#1 := 11 == main_~_hj_k~1#1; {8594#false} is VALID [2022-02-20 23:33:13,972 INFO L290 TraceCheckUtils]: 12: Hoare triple {8594#false} assume !main_#t~switch158#1; {8594#false} is VALID [2022-02-20 23:33:13,972 INFO L290 TraceCheckUtils]: 13: Hoare triple {8594#false} main_#t~switch158#1 := main_#t~switch158#1 || 10 == main_~_hj_k~1#1; {8594#false} is VALID [2022-02-20 23:33:13,973 INFO L290 TraceCheckUtils]: 14: Hoare triple {8594#false} assume main_#t~switch158#1;call main_#t~mem160#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~mem160#1 % 256);havoc main_#t~mem160#1; {8594#false} is VALID [2022-02-20 23:33:13,973 INFO L290 TraceCheckUtils]: 15: Hoare triple {8594#false} main_#t~switch158#1 := main_#t~switch158#1 || 9 == main_~_hj_k~1#1; {8594#false} is VALID [2022-02-20 23:33:13,974 INFO L290 TraceCheckUtils]: 16: Hoare triple {8594#false} assume main_#t~switch158#1;call main_#t~mem161#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~mem161#1 % 256);havoc main_#t~mem161#1; {8594#false} is VALID [2022-02-20 23:33:13,974 INFO L290 TraceCheckUtils]: 17: Hoare triple {8594#false} main_#t~switch158#1 := main_#t~switch158#1 || 8 == main_~_hj_k~1#1; {8594#false} is VALID [2022-02-20 23:33:13,974 INFO L290 TraceCheckUtils]: 18: Hoare triple {8594#false} assume main_#t~switch158#1;call main_#t~mem162#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~mem162#1 % 256);havoc main_#t~mem162#1; {8594#false} is VALID [2022-02-20 23:33:13,974 INFO L290 TraceCheckUtils]: 19: Hoare triple {8594#false} main_#t~switch158#1 := main_#t~switch158#1 || 7 == main_~_hj_k~1#1; {8594#false} is VALID [2022-02-20 23:33:13,975 INFO L290 TraceCheckUtils]: 20: Hoare triple {8594#false} assume main_#t~switch158#1;call main_#t~mem163#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~mem163#1 % 256);havoc main_#t~mem163#1; {8594#false} is VALID [2022-02-20 23:33:13,975 INFO L290 TraceCheckUtils]: 21: Hoare triple {8594#false} main_#t~switch158#1 := main_#t~switch158#1 || 6 == main_~_hj_k~1#1; {8594#false} is VALID [2022-02-20 23:33:13,975 INFO L290 TraceCheckUtils]: 22: Hoare triple {8594#false} assume main_#t~switch158#1;call main_#t~mem164#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~mem164#1 % 256);havoc main_#t~mem164#1; {8594#false} is VALID [2022-02-20 23:33:13,975 INFO L290 TraceCheckUtils]: 23: Hoare triple {8594#false} main_#t~switch158#1 := main_#t~switch158#1 || 5 == main_~_hj_k~1#1; {8594#false} is VALID [2022-02-20 23:33:13,975 INFO L290 TraceCheckUtils]: 24: Hoare triple {8594#false} assume main_#t~switch158#1;call main_#t~mem165#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~mem165#1 % 256;havoc main_#t~mem165#1; {8594#false} is VALID [2022-02-20 23:33:13,976 INFO L290 TraceCheckUtils]: 25: Hoare triple {8594#false} main_#t~switch158#1 := main_#t~switch158#1 || 4 == main_~_hj_k~1#1; {8594#false} is VALID [2022-02-20 23:33:13,976 INFO L290 TraceCheckUtils]: 26: Hoare triple {8594#false} assume main_#t~switch158#1;call main_#t~mem166#1 := read~int(main_~_hj_key~1#1.base, 3 + main_~_hj_key~1#1.offset, 1);main_~_hj_i~1#1 := main_~_hj_i~1#1 + 16777216 * (main_#t~mem166#1 % 256);havoc main_#t~mem166#1; {8594#false} is VALID [2022-02-20 23:33:13,976 INFO L290 TraceCheckUtils]: 27: Hoare triple {8594#false} main_#t~switch158#1 := main_#t~switch158#1 || 3 == main_~_hj_k~1#1; {8594#false} is VALID [2022-02-20 23:33:13,976 INFO L290 TraceCheckUtils]: 28: Hoare triple {8594#false} assume main_#t~switch158#1;call main_#t~mem167#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~mem167#1 % 256);havoc main_#t~mem167#1; {8594#false} is VALID [2022-02-20 23:33:13,977 INFO L290 TraceCheckUtils]: 29: Hoare triple {8594#false} main_#t~switch158#1 := main_#t~switch158#1 || 2 == main_~_hj_k~1#1; {8594#false} is VALID [2022-02-20 23:33:13,977 INFO L290 TraceCheckUtils]: 30: Hoare triple {8594#false} assume !main_#t~switch158#1; {8594#false} is VALID [2022-02-20 23:33:13,977 INFO L290 TraceCheckUtils]: 31: Hoare triple {8594#false} main_#t~switch158#1 := main_#t~switch158#1 || 1 == main_~_hj_k~1#1; {8594#false} is VALID [2022-02-20 23:33:13,977 INFO L290 TraceCheckUtils]: 32: Hoare triple {8594#false} assume main_#t~switch158#1;call main_#t~mem169#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~mem169#1 % 256;havoc main_#t~mem169#1; {8594#false} is VALID [2022-02-20 23:33:13,977 INFO L290 TraceCheckUtils]: 33: Hoare triple {8594#false} havoc main_#t~switch158#1; {8594#false} is VALID [2022-02-20 23:33:13,978 INFO L290 TraceCheckUtils]: 34: Hoare triple {8594#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)))); {8594#false} is VALID [2022-02-20 23:33:13,981 INFO L290 TraceCheckUtils]: 35: Hoare triple {8594#false} goto; {8594#false} is VALID [2022-02-20 23:33:13,982 INFO L290 TraceCheckUtils]: 36: Hoare triple {8594#false} goto; {8594#false} is VALID [2022-02-20 23:33:13,982 INFO L290 TraceCheckUtils]: 37: Hoare triple {8594#false} goto; {8594#false} is VALID [2022-02-20 23:33:13,982 INFO L290 TraceCheckUtils]: 38: Hoare triple {8594#false} main_~tmp~0#1.base, main_~tmp~0#1.offset := 0, 0; {8594#false} is VALID [2022-02-20 23:33:13,982 INFO L290 TraceCheckUtils]: 39: Hoare triple {8594#false} assume !(main_~users~0#1.base != 0 || main_~users~0#1.offset != 0); {8594#false} is VALID [2022-02-20 23:33:13,983 INFO L290 TraceCheckUtils]: 40: Hoare triple {8594#false} goto; {8594#false} is VALID [2022-02-20 23:33:13,985 INFO L290 TraceCheckUtils]: 41: Hoare triple {8594#false} goto; {8594#false} is VALID [2022-02-20 23:33:13,985 INFO L290 TraceCheckUtils]: 42: Hoare triple {8594#false} assume !(main_~tmp~0#1.base != 0 || main_~tmp~0#1.offset != 0); {8594#false} is VALID [2022-02-20 23:33:13,986 INFO L290 TraceCheckUtils]: 43: Hoare triple {8594#false} assume !false; {8594#false} is VALID [2022-02-20 23:33:13,986 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 23:33:13,986 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 23:33:13,987 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [851519254] [2022-02-20 23:33:13,987 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [851519254] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:33:13,987 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:33:13,987 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-02-20 23:33:13,988 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [903308716] [2022-02-20 23:33:13,988 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:33:13,989 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.0) internal successors, (44), 4 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 44 [2022-02-20 23:33:13,989 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:33:13,990 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 11.0) internal successors, (44), 4 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:33:14,024 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 44 edges. 44 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:33:14,024 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-02-20 23:33:14,025 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 23:33:14,025 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-02-20 23:33:14,026 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-02-20 23:33:14,027 INFO L87 Difference]: Start difference. First operand 1163 states and 2209 transitions. Second operand has 4 states, 4 states have (on average 11.0) internal successors, (44), 4 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:33:23,338 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:33:23,338 INFO L93 Difference]: Finished difference Result 3333 states and 6429 transitions. [2022-02-20 23:33:23,338 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-02-20 23:33:23,338 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.0) internal successors, (44), 4 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 44 [2022-02-20 23:33:23,339 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:33:23,339 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 11.0) internal successors, (44), 4 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:33:23,773 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 6429 transitions. [2022-02-20 23:33:23,773 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 11.0) internal successors, (44), 4 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:33:24,257 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 6429 transitions. [2022-02-20 23:33:24,258 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 6429 transitions. [2022-02-20 23:33:27,728 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 6429 edges. 6429 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:33:28,075 INFO L225 Difference]: With dead ends: 3333 [2022-02-20 23:33:28,076 INFO L226 Difference]: Without dead ends: 2264 [2022-02-20 23:33:28,080 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-02-20 23:33:28,081 INFO L933 BasicCegarLoop]: 2672 mSDtfsCounter, 1128 mSDsluCounter, 4311 mSDsCounter, 0 mSdLazyCounter, 642 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1628 SdHoareTripleChecker+Valid, 6983 SdHoareTripleChecker+Invalid, 645 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 642 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-02-20 23:33:28,082 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1628 Valid, 6983 Invalid, 645 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [3 Valid, 642 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-02-20 23:33:28,084 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2264 states. [2022-02-20 23:33:28,305 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2264 to 1165. [2022-02-20 23:33:28,305 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:33:28,309 INFO L82 GeneralOperation]: Start isEquivalent. First operand 2264 states. Second operand has 1165 states, 658 states have (on average 1.831306990881459) internal successors, (1205), 1159 states have internal predecessors, (1205), 503 states have call successors, (503), 2 states have call predecessors, (503), 2 states have return successors, (503), 4 states have call predecessors, (503), 503 states have call successors, (503) [2022-02-20 23:33:28,313 INFO L74 IsIncluded]: Start isIncluded. First operand 2264 states. Second operand has 1165 states, 658 states have (on average 1.831306990881459) internal successors, (1205), 1159 states have internal predecessors, (1205), 503 states have call successors, (503), 2 states have call predecessors, (503), 2 states have return successors, (503), 4 states have call predecessors, (503), 503 states have call successors, (503) [2022-02-20 23:33:28,316 INFO L87 Difference]: Start difference. First operand 2264 states. Second operand has 1165 states, 658 states have (on average 1.831306990881459) internal successors, (1205), 1159 states have internal predecessors, (1205), 503 states have call successors, (503), 2 states have call predecessors, (503), 2 states have return successors, (503), 4 states have call predecessors, (503), 503 states have call successors, (503) [2022-02-20 23:33:29,118 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:33:29,118 INFO L93 Difference]: Finished difference Result 2264 states and 4341 transitions. [2022-02-20 23:33:29,118 INFO L276 IsEmpty]: Start isEmpty. Operand 2264 states and 4341 transitions. [2022-02-20 23:33:29,129 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:33:29,130 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:33:29,133 INFO L74 IsIncluded]: Start isIncluded. First operand has 1165 states, 658 states have (on average 1.831306990881459) internal successors, (1205), 1159 states have internal predecessors, (1205), 503 states have call successors, (503), 2 states have call predecessors, (503), 2 states have return successors, (503), 4 states have call predecessors, (503), 503 states have call successors, (503) Second operand 2264 states. [2022-02-20 23:33:29,137 INFO L87 Difference]: Start difference. First operand has 1165 states, 658 states have (on average 1.831306990881459) internal successors, (1205), 1159 states have internal predecessors, (1205), 503 states have call successors, (503), 2 states have call predecessors, (503), 2 states have return successors, (503), 4 states have call predecessors, (503), 503 states have call successors, (503) Second operand 2264 states. [2022-02-20 23:33:29,905 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:33:29,905 INFO L93 Difference]: Finished difference Result 2264 states and 4341 transitions. [2022-02-20 23:33:29,905 INFO L276 IsEmpty]: Start isEmpty. Operand 2264 states and 4341 transitions. [2022-02-20 23:33:29,915 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:33:29,916 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:33:29,916 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:33:29,916 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:33:29,920 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1165 states, 658 states have (on average 1.831306990881459) internal successors, (1205), 1159 states have internal predecessors, (1205), 503 states have call successors, (503), 2 states have call predecessors, (503), 2 states have return successors, (503), 4 states have call predecessors, (503), 503 states have call successors, (503) [2022-02-20 23:33:30,132 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1165 states to 1165 states and 2211 transitions. [2022-02-20 23:33:30,133 INFO L78 Accepts]: Start accepts. Automaton has 1165 states and 2211 transitions. Word has length 44 [2022-02-20 23:33:30,133 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:33:30,133 INFO L470 AbstractCegarLoop]: Abstraction has 1165 states and 2211 transitions. [2022-02-20 23:33:30,134 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.0) internal successors, (44), 4 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:33:30,134 INFO L276 IsEmpty]: Start isEmpty. Operand 1165 states and 2211 transitions. [2022-02-20 23:33:30,135 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2022-02-20 23:33:30,136 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:33:30,136 INFO L514 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 23:33:30,136 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-02-20 23:33:30,136 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 23:33:30,137 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:33:30,137 INFO L85 PathProgramCache]: Analyzing trace with hash 1509497837, now seen corresponding path program 1 times [2022-02-20 23:33:30,137 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 23:33:30,137 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [661185882] [2022-02-20 23:33:30,137 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:33:30,137 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 23:33:30,229 ERROR L252 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-02-20 23:33:30,233 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1562879249] [2022-02-20 23:33:30,233 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:33:30,233 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 23:33:30,233 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 23:33:30,235 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-02-20 23:33:30,288 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-02-20 23:33:30,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:33:30,691 INFO L263 TraceCheckSpWp]: Trace formula consists of 1649 conjuncts, 3 conjunts are in the unsatisfiable core [2022-02-20 23:33:30,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:33:30,730 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 23:33:30,927 INFO L290 TraceCheckUtils]: 0: Hoare triple {19724#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(21, 2);~count_int_int~0 := 0; {19724#true} is VALID [2022-02-20 23:33:30,927 INFO L290 TraceCheckUtils]: 1: Hoare triple {19724#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~mem5#1, main_#t~post6#1, main_#t~mem7#1, main_#t~mem147#1, main_#t~mem146#1, main_#t~mem148#1, main_#t~mem149#1, main_#t~mem151#1, main_#t~mem150#1, main_#t~mem152#1, main_#t~mem153#1, main_#t~mem155#1, main_#t~mem154#1, main_#t~mem156#1, main_#t~mem157#1, main_#t~switch158#1, main_#t~mem159#1, main_#t~mem160#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_~_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~mem170#1.base, main_#t~mem170#1.offset, main_#t~mem171#1, main_#t~mem172#1.base, main_#t~mem172#1.offset, main_#t~mem173#1.base, main_#t~mem173#1.offset, main_#t~mem174#1.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, main_#t~mem180#1, main_#t~mem181#1, main_#t~short182#1, main_#t~mem183#1.base, main_#t~mem183#1.offset, main_#t~ret184#1, main_#t~mem185#1.base, main_#t~mem185#1.offset, main_#t~mem186#1.base, main_#t~mem186#1.offset, main_#t~mem187#1.base, main_#t~mem187#1.offset, main_#t~mem188#1, main_~_hf_bkt~0#1, main_~_hf_hashv~0#1, main_#t~mem189#1, main_#t~mem190#1, main_#t~mem144#1, main_#t~mem145#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); {19724#true} is VALID [2022-02-20 23:33:30,929 INFO L290 TraceCheckUtils]: 2: Hoare triple {19724#true} call main_#t~mem7#1 := read~int(main_~#i~0#1.base, main_~#i~0#1.offset, 4); {19724#true} is VALID [2022-02-20 23:33:30,929 INFO L290 TraceCheckUtils]: 3: Hoare triple {19724#true} assume !!(main_#t~mem7#1 < 1000);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; {19724#true} is VALID [2022-02-20 23:33:30,929 INFO L290 TraceCheckUtils]: 4: Hoare triple {19724#true} assume !(main_~user~0#1.base == 0 && main_~user~0#1.offset == 0); {19724#true} is VALID [2022-02-20 23:33:30,930 INFO L290 TraceCheckUtils]: 5: Hoare triple {19724#true} call main_#t~mem9#1 := read~int(main_~#i~0#1.base, main_~#i~0#1.offset, 4);call write~int(main_#t~mem9#1, main_~user~0#1.base, main_~user~0#1.offset, 4);havoc main_#t~mem9#1;call main_#t~mem10#1 := read~int(main_~#i~0#1.base, main_~#i~0#1.offset, 4);call main_#t~mem11#1 := read~int(main_~#i~0#1.base, main_~#i~0#1.offset, 4);call write~int(main_#t~mem10#1 * main_#t~mem11#1, main_~user~0#1.base, 4 + main_~user~0#1.offset, 4);havoc main_#t~mem10#1;havoc main_#t~mem11#1; {19724#true} is VALID [2022-02-20 23:33:30,930 INFO L290 TraceCheckUtils]: 6: Hoare triple {19724#true} havoc main_~_ha_hashv~0#1; {19724#true} is VALID [2022-02-20 23:33:30,930 INFO L290 TraceCheckUtils]: 7: Hoare triple {19724#true} goto; {19724#true} is VALID [2022-02-20 23:33:30,930 INFO L290 TraceCheckUtils]: 8: Hoare triple {19724#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; {19724#true} is VALID [2022-02-20 23:33:30,930 INFO L290 TraceCheckUtils]: 9: Hoare triple {19724#true} assume !(main_~_hj_k~0#1 % 4294967296 >= 12); {19724#true} is VALID [2022-02-20 23:33:30,930 INFO L290 TraceCheckUtils]: 10: Hoare triple {19724#true} main_~_ha_hashv~0#1 := 4 + main_~_ha_hashv~0#1;main_#t~switch24#1 := 11 == main_~_hj_k~0#1; {19724#true} is VALID [2022-02-20 23:33:30,931 INFO L290 TraceCheckUtils]: 11: Hoare triple {19724#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; {19724#true} is VALID [2022-02-20 23:33:30,931 INFO L290 TraceCheckUtils]: 12: Hoare triple {19724#true} main_#t~switch24#1 := main_#t~switch24#1 || 10 == main_~_hj_k~0#1; {19724#true} is VALID [2022-02-20 23:33:30,931 INFO L290 TraceCheckUtils]: 13: Hoare triple {19724#true} assume main_#t~switch24#1;call main_#t~mem26#1 := read~int(main_~_hj_key~0#1.base, 9 + main_~_hj_key~0#1.offset, 1);main_~_ha_hashv~0#1 := main_~_ha_hashv~0#1 + 65536 * (main_#t~mem26#1 % 256);havoc main_#t~mem26#1; {19724#true} is VALID [2022-02-20 23:33:30,931 INFO L290 TraceCheckUtils]: 14: Hoare triple {19724#true} main_#t~switch24#1 := main_#t~switch24#1 || 9 == main_~_hj_k~0#1; {19724#true} is VALID [2022-02-20 23:33:30,931 INFO L290 TraceCheckUtils]: 15: Hoare triple {19724#true} 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; {19724#true} is VALID [2022-02-20 23:33:30,931 INFO L290 TraceCheckUtils]: 16: Hoare triple {19724#true} main_#t~switch24#1 := main_#t~switch24#1 || 8 == main_~_hj_k~0#1; {19724#true} is VALID [2022-02-20 23:33:30,932 INFO L290 TraceCheckUtils]: 17: Hoare triple {19724#true} 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; {19780#|ULTIMATE.start_main_#t~switch24#1|} is VALID [2022-02-20 23:33:30,933 INFO L290 TraceCheckUtils]: 18: Hoare triple {19780#|ULTIMATE.start_main_#t~switch24#1|} main_#t~switch24#1 := main_#t~switch24#1 || 7 == main_~_hj_k~0#1; {19780#|ULTIMATE.start_main_#t~switch24#1|} is VALID [2022-02-20 23:33:30,933 INFO L290 TraceCheckUtils]: 19: Hoare triple {19780#|ULTIMATE.start_main_#t~switch24#1|} assume !main_#t~switch24#1; {19725#false} is VALID [2022-02-20 23:33:30,933 INFO L290 TraceCheckUtils]: 20: Hoare triple {19725#false} main_#t~switch24#1 := main_#t~switch24#1 || 6 == main_~_hj_k~0#1; {19725#false} is VALID [2022-02-20 23:33:30,933 INFO L290 TraceCheckUtils]: 21: Hoare triple {19725#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; {19725#false} is VALID [2022-02-20 23:33:30,933 INFO L290 TraceCheckUtils]: 22: Hoare triple {19725#false} main_#t~switch24#1 := main_#t~switch24#1 || 5 == main_~_hj_k~0#1; {19725#false} is VALID [2022-02-20 23:33:30,934 INFO L290 TraceCheckUtils]: 23: Hoare triple {19725#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; {19725#false} is VALID [2022-02-20 23:33:30,934 INFO L290 TraceCheckUtils]: 24: Hoare triple {19725#false} main_#t~switch24#1 := main_#t~switch24#1 || 4 == main_~_hj_k~0#1; {19725#false} is VALID [2022-02-20 23:33:30,934 INFO L290 TraceCheckUtils]: 25: Hoare triple {19725#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; {19725#false} is VALID [2022-02-20 23:33:30,934 INFO L290 TraceCheckUtils]: 26: Hoare triple {19725#false} main_#t~switch24#1 := main_#t~switch24#1 || 3 == main_~_hj_k~0#1; {19725#false} is VALID [2022-02-20 23:33:30,934 INFO L290 TraceCheckUtils]: 27: Hoare triple {19725#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; {19725#false} is VALID [2022-02-20 23:33:30,934 INFO L290 TraceCheckUtils]: 28: Hoare triple {19725#false} main_#t~switch24#1 := main_#t~switch24#1 || 2 == main_~_hj_k~0#1; {19725#false} is VALID [2022-02-20 23:33:30,935 INFO L290 TraceCheckUtils]: 29: Hoare triple {19725#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; {19725#false} is VALID [2022-02-20 23:33:30,935 INFO L290 TraceCheckUtils]: 30: Hoare triple {19725#false} main_#t~switch24#1 := main_#t~switch24#1 || 1 == main_~_hj_k~0#1; {19725#false} is VALID [2022-02-20 23:33:30,935 INFO L290 TraceCheckUtils]: 31: Hoare triple {19725#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; {19725#false} is VALID [2022-02-20 23:33:30,935 INFO L290 TraceCheckUtils]: 32: Hoare triple {19725#false} havoc main_#t~switch24#1; {19725#false} is VALID [2022-02-20 23:33:30,936 INFO L290 TraceCheckUtils]: 33: Hoare triple {19725#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)))); {19725#false} is VALID [2022-02-20 23:33:30,936 INFO L290 TraceCheckUtils]: 34: Hoare triple {19725#false} goto; {19725#false} is VALID [2022-02-20 23:33:30,937 INFO L290 TraceCheckUtils]: 35: Hoare triple {19725#false} goto; {19725#false} is VALID [2022-02-20 23:33:30,937 INFO L290 TraceCheckUtils]: 36: Hoare triple {19725#false} goto; {19725#false} is VALID [2022-02-20 23:33:30,937 INFO L290 TraceCheckUtils]: 37: Hoare triple {19725#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); {19725#false} is VALID [2022-02-20 23:33:30,937 INFO L290 TraceCheckUtils]: 38: Hoare triple {19725#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; {19725#false} is VALID [2022-02-20 23:33:30,937 INFO L290 TraceCheckUtils]: 39: Hoare triple {19725#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; {19725#false} is VALID [2022-02-20 23:33:30,937 INFO L290 TraceCheckUtils]: 40: Hoare triple {19725#false} goto; {19725#false} is VALID [2022-02-20 23:33:30,938 INFO L290 TraceCheckUtils]: 41: Hoare triple {19725#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; {19725#false} is VALID [2022-02-20 23:33:30,938 INFO L290 TraceCheckUtils]: 42: Hoare triple {19725#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; {19725#false} is VALID [2022-02-20 23:33:30,939 INFO L290 TraceCheckUtils]: 43: Hoare triple {19725#false} goto; {19725#false} is VALID [2022-02-20 23:33:30,939 INFO L290 TraceCheckUtils]: 44: Hoare triple {19725#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); {19725#false} is VALID [2022-02-20 23:33:30,939 INFO L290 TraceCheckUtils]: 45: Hoare triple {19725#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; {19725#false} is VALID [2022-02-20 23:33:30,939 INFO L290 TraceCheckUtils]: 46: Hoare triple {19725#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; {19725#false} is VALID [2022-02-20 23:33:30,939 INFO L290 TraceCheckUtils]: 47: Hoare triple {19725#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; {19725#false} is VALID [2022-02-20 23:33:30,940 INFO L290 TraceCheckUtils]: 48: Hoare triple {19725#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; {19725#false} is VALID [2022-02-20 23:33:30,940 INFO L290 TraceCheckUtils]: 49: Hoare triple {19725#false} goto; {19725#false} is VALID [2022-02-20 23:33:30,940 INFO L290 TraceCheckUtils]: 50: Hoare triple {19725#false} goto; {19725#false} is VALID [2022-02-20 23:33:30,940 INFO L290 TraceCheckUtils]: 51: Hoare triple {19725#false} goto; {19725#false} is VALID [2022-02-20 23:33:30,942 INFO L290 TraceCheckUtils]: 52: Hoare triple {19725#false} goto; {19725#false} is VALID [2022-02-20 23:33:30,942 INFO L290 TraceCheckUtils]: 53: Hoare triple {19725#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;call write~int(1 + main_#t~post6#1, main_~#i~0#1.base, main_~#i~0#1.offset, 4);havoc main_#t~mem5#1;havoc main_#t~post6#1; {19725#false} is VALID [2022-02-20 23:33:30,942 INFO L290 TraceCheckUtils]: 54: Hoare triple {19725#false} call main_#t~mem7#1 := read~int(main_~#i~0#1.base, main_~#i~0#1.offset, 4); {19725#false} is VALID [2022-02-20 23:33:30,942 INFO L290 TraceCheckUtils]: 55: Hoare triple {19725#false} assume !(main_#t~mem7#1 < 1000);havoc main_#t~mem7#1; {19725#false} is VALID [2022-02-20 23:33:30,942 INFO L290 TraceCheckUtils]: 56: Hoare triple {19725#false} call write~int(0, main_~#i~0#1.base, main_~#i~0#1.offset, 4); {19725#false} is VALID [2022-02-20 23:33:30,942 INFO L290 TraceCheckUtils]: 57: Hoare triple {19725#false} call main_#t~mem145#1 := read~int(main_~#i~0#1.base, main_~#i~0#1.offset, 4); {19725#false} is VALID [2022-02-20 23:33:30,943 INFO L290 TraceCheckUtils]: 58: Hoare triple {19725#false} assume !!(main_#t~mem145#1 < 1000);havoc main_#t~mem145#1; {19725#false} is VALID [2022-02-20 23:33:30,943 INFO L290 TraceCheckUtils]: 59: Hoare triple {19725#false} havoc main_~_hf_hashv~0#1; {19725#false} is VALID [2022-02-20 23:33:30,943 INFO L290 TraceCheckUtils]: 60: Hoare triple {19725#false} goto; {19725#false} is VALID [2022-02-20 23:33:30,944 INFO L290 TraceCheckUtils]: 61: Hoare triple {19725#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; {19725#false} is VALID [2022-02-20 23:33:30,944 INFO L290 TraceCheckUtils]: 62: Hoare triple {19725#false} assume !(main_~_hj_k~1#1 % 4294967296 >= 12); {19725#false} is VALID [2022-02-20 23:33:30,944 INFO L290 TraceCheckUtils]: 63: Hoare triple {19725#false} main_~_hf_hashv~0#1 := 4 + main_~_hf_hashv~0#1;main_#t~switch158#1 := 11 == main_~_hj_k~1#1; {19725#false} is VALID [2022-02-20 23:33:30,945 INFO L290 TraceCheckUtils]: 64: Hoare triple {19725#false} assume !main_#t~switch158#1; {19725#false} is VALID [2022-02-20 23:33:30,945 INFO L290 TraceCheckUtils]: 65: Hoare triple {19725#false} main_#t~switch158#1 := main_#t~switch158#1 || 10 == main_~_hj_k~1#1; {19725#false} is VALID [2022-02-20 23:33:30,951 INFO L290 TraceCheckUtils]: 66: Hoare triple {19725#false} assume main_#t~switch158#1;call main_#t~mem160#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~mem160#1 % 256);havoc main_#t~mem160#1; {19725#false} is VALID [2022-02-20 23:33:30,953 INFO L290 TraceCheckUtils]: 67: Hoare triple {19725#false} main_#t~switch158#1 := main_#t~switch158#1 || 9 == main_~_hj_k~1#1; {19725#false} is VALID [2022-02-20 23:33:30,954 INFO L290 TraceCheckUtils]: 68: Hoare triple {19725#false} assume main_#t~switch158#1;call main_#t~mem161#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~mem161#1 % 256);havoc main_#t~mem161#1; {19725#false} is VALID [2022-02-20 23:33:30,954 INFO L290 TraceCheckUtils]: 69: Hoare triple {19725#false} main_#t~switch158#1 := main_#t~switch158#1 || 8 == main_~_hj_k~1#1; {19725#false} is VALID [2022-02-20 23:33:30,954 INFO L290 TraceCheckUtils]: 70: Hoare triple {19725#false} assume main_#t~switch158#1;call main_#t~mem162#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~mem162#1 % 256);havoc main_#t~mem162#1; {19725#false} is VALID [2022-02-20 23:33:30,954 INFO L290 TraceCheckUtils]: 71: Hoare triple {19725#false} main_#t~switch158#1 := main_#t~switch158#1 || 7 == main_~_hj_k~1#1; {19725#false} is VALID [2022-02-20 23:33:30,954 INFO L290 TraceCheckUtils]: 72: Hoare triple {19725#false} assume main_#t~switch158#1;call main_#t~mem163#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~mem163#1 % 256);havoc main_#t~mem163#1; {19725#false} is VALID [2022-02-20 23:33:30,955 INFO L290 TraceCheckUtils]: 73: Hoare triple {19725#false} main_#t~switch158#1 := main_#t~switch158#1 || 6 == main_~_hj_k~1#1; {19725#false} is VALID [2022-02-20 23:33:30,955 INFO L290 TraceCheckUtils]: 74: Hoare triple {19725#false} assume main_#t~switch158#1;call main_#t~mem164#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~mem164#1 % 256);havoc main_#t~mem164#1; {19725#false} is VALID [2022-02-20 23:33:30,955 INFO L290 TraceCheckUtils]: 75: Hoare triple {19725#false} main_#t~switch158#1 := main_#t~switch158#1 || 5 == main_~_hj_k~1#1; {19725#false} is VALID [2022-02-20 23:33:30,955 INFO L290 TraceCheckUtils]: 76: Hoare triple {19725#false} assume main_#t~switch158#1;call main_#t~mem165#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~mem165#1 % 256;havoc main_#t~mem165#1; {19725#false} is VALID [2022-02-20 23:33:30,956 INFO L290 TraceCheckUtils]: 77: Hoare triple {19725#false} main_#t~switch158#1 := main_#t~switch158#1 || 4 == main_~_hj_k~1#1; {19725#false} is VALID [2022-02-20 23:33:30,956 INFO L290 TraceCheckUtils]: 78: Hoare triple {19725#false} assume main_#t~switch158#1;call main_#t~mem166#1 := read~int(main_~_hj_key~1#1.base, 3 + main_~_hj_key~1#1.offset, 1);main_~_hj_i~1#1 := main_~_hj_i~1#1 + 16777216 * (main_#t~mem166#1 % 256);havoc main_#t~mem166#1; {19725#false} is VALID [2022-02-20 23:33:30,956 INFO L290 TraceCheckUtils]: 79: Hoare triple {19725#false} main_#t~switch158#1 := main_#t~switch158#1 || 3 == main_~_hj_k~1#1; {19725#false} is VALID [2022-02-20 23:33:30,956 INFO L290 TraceCheckUtils]: 80: Hoare triple {19725#false} assume main_#t~switch158#1;call main_#t~mem167#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~mem167#1 % 256);havoc main_#t~mem167#1; {19725#false} is VALID [2022-02-20 23:33:30,956 INFO L290 TraceCheckUtils]: 81: Hoare triple {19725#false} main_#t~switch158#1 := main_#t~switch158#1 || 2 == main_~_hj_k~1#1; {19725#false} is VALID [2022-02-20 23:33:30,956 INFO L290 TraceCheckUtils]: 82: Hoare triple {19725#false} assume !main_#t~switch158#1; {19725#false} is VALID [2022-02-20 23:33:30,956 INFO L290 TraceCheckUtils]: 83: Hoare triple {19725#false} main_#t~switch158#1 := main_#t~switch158#1 || 1 == main_~_hj_k~1#1; {19725#false} is VALID [2022-02-20 23:33:30,957 INFO L290 TraceCheckUtils]: 84: Hoare triple {19725#false} assume main_#t~switch158#1;call main_#t~mem169#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~mem169#1 % 256;havoc main_#t~mem169#1; {19725#false} is VALID [2022-02-20 23:33:30,957 INFO L290 TraceCheckUtils]: 85: Hoare triple {19725#false} havoc main_#t~switch158#1; {19725#false} is VALID [2022-02-20 23:33:30,957 INFO L290 TraceCheckUtils]: 86: Hoare triple {19725#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)))); {19725#false} is VALID [2022-02-20 23:33:30,957 INFO L290 TraceCheckUtils]: 87: Hoare triple {19725#false} goto; {19725#false} is VALID [2022-02-20 23:33:30,957 INFO L290 TraceCheckUtils]: 88: Hoare triple {19725#false} goto; {19725#false} is VALID [2022-02-20 23:33:30,957 INFO L290 TraceCheckUtils]: 89: Hoare triple {19725#false} goto; {19725#false} is VALID [2022-02-20 23:33:30,958 INFO L290 TraceCheckUtils]: 90: Hoare triple {19725#false} main_~tmp~0#1.base, main_~tmp~0#1.offset := 0, 0; {19725#false} is VALID [2022-02-20 23:33:30,958 INFO L290 TraceCheckUtils]: 91: Hoare triple {19725#false} assume !(main_~users~0#1.base != 0 || main_~users~0#1.offset != 0); {19725#false} is VALID [2022-02-20 23:33:30,958 INFO L290 TraceCheckUtils]: 92: Hoare triple {19725#false} goto; {19725#false} is VALID [2022-02-20 23:33:30,958 INFO L290 TraceCheckUtils]: 93: Hoare triple {19725#false} goto; {19725#false} is VALID [2022-02-20 23:33:30,958 INFO L290 TraceCheckUtils]: 94: Hoare triple {19725#false} assume !(main_~tmp~0#1.base != 0 || main_~tmp~0#1.offset != 0); {19725#false} is VALID [2022-02-20 23:33:30,958 INFO L290 TraceCheckUtils]: 95: Hoare triple {19725#false} assume !false; {19725#false} is VALID [2022-02-20 23:33:30,959 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 23:33:30,959 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 23:33:30,959 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 23:33:30,959 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [661185882] [2022-02-20 23:33:30,959 WARN L317 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-02-20 23:33:30,960 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1562879249] [2022-02-20 23:33:30,960 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1562879249] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:33:30,960 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:33:30,961 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 23:33:30,962 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1736181004] [2022-02-20 23:33:30,962 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:33:30,962 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 32.0) internal successors, (96), 3 states have internal predecessors, (96), 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 96 [2022-02-20 23:33:30,963 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:33:30,963 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 32.0) internal successors, (96), 3 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:33:31,021 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 96 edges. 96 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:33:31,021 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 23:33:31,022 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 23:33:31,022 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 23:33:31,022 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 23:33:31,022 INFO L87 Difference]: Start difference. First operand 1165 states and 2211 transitions. Second operand has 3 states, 3 states have (on average 32.0) internal successors, (96), 3 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:33:33,835 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:33:33,835 INFO L93 Difference]: Finished difference Result 2347 states and 4449 transitions. [2022-02-20 23:33:33,835 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 23:33:33,835 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 32.0) internal successors, (96), 3 states have internal predecessors, (96), 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 96 [2022-02-20 23:33:33,836 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:33:33,837 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 32.0) internal successors, (96), 3 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:33:34,090 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 4447 transitions. [2022-02-20 23:33:34,090 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 32.0) internal successors, (96), 3 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:33:34,266 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 4447 transitions. [2022-02-20 23:33:34,266 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 4447 transitions. [2022-02-20 23:33:37,133 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 4447 edges. 4447 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:33:37,199 INFO L225 Difference]: With dead ends: 2347 [2022-02-20 23:33:37,199 INFO L226 Difference]: Without dead ends: 1186 [2022-02-20 23:33:37,202 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 94 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 23:33:37,202 INFO L933 BasicCegarLoop]: 2189 mSDtfsCounter, 9 mSDsluCounter, 2174 mSDsCounter, 0 mSdLazyCounter, 44 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 4363 SdHoareTripleChecker+Invalid, 72 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 44 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 23:33:37,203 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [9 Valid, 4363 Invalid, 72 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 44 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 23:33:37,204 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1186 states. [2022-02-20 23:33:37,304 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1186 to 1185. [2022-02-20 23:33:37,305 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:33:37,307 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1186 states. Second operand has 1185 states, 678 states have (on average 1.8067846607669618) internal successors, (1225), 1179 states have internal predecessors, (1225), 503 states have call successors, (503), 2 states have call predecessors, (503), 2 states have return successors, (503), 4 states have call predecessors, (503), 503 states have call successors, (503) [2022-02-20 23:33:37,309 INFO L74 IsIncluded]: Start isIncluded. First operand 1186 states. Second operand has 1185 states, 678 states have (on average 1.8067846607669618) internal successors, (1225), 1179 states have internal predecessors, (1225), 503 states have call successors, (503), 2 states have call predecessors, (503), 2 states have return successors, (503), 4 states have call predecessors, (503), 503 states have call successors, (503) [2022-02-20 23:33:37,311 INFO L87 Difference]: Start difference. First operand 1186 states. Second operand has 1185 states, 678 states have (on average 1.8067846607669618) internal successors, (1225), 1179 states have internal predecessors, (1225), 503 states have call successors, (503), 2 states have call predecessors, (503), 2 states have return successors, (503), 4 states have call predecessors, (503), 503 states have call successors, (503) [2022-02-20 23:33:37,492 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:33:37,493 INFO L93 Difference]: Finished difference Result 1186 states and 2232 transitions. [2022-02-20 23:33:37,493 INFO L276 IsEmpty]: Start isEmpty. Operand 1186 states and 2232 transitions. [2022-02-20 23:33:37,498 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:33:37,498 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:33:37,500 INFO L74 IsIncluded]: Start isIncluded. First operand has 1185 states, 678 states have (on average 1.8067846607669618) internal successors, (1225), 1179 states have internal predecessors, (1225), 503 states have call successors, (503), 2 states have call predecessors, (503), 2 states have return successors, (503), 4 states have call predecessors, (503), 503 states have call successors, (503) Second operand 1186 states. [2022-02-20 23:33:37,502 INFO L87 Difference]: Start difference. First operand has 1185 states, 678 states have (on average 1.8067846607669618) internal successors, (1225), 1179 states have internal predecessors, (1225), 503 states have call successors, (503), 2 states have call predecessors, (503), 2 states have return successors, (503), 4 states have call predecessors, (503), 503 states have call successors, (503) Second operand 1186 states. [2022-02-20 23:33:37,682 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:33:37,682 INFO L93 Difference]: Finished difference Result 1186 states and 2232 transitions. [2022-02-20 23:33:37,682 INFO L276 IsEmpty]: Start isEmpty. Operand 1186 states and 2232 transitions. [2022-02-20 23:33:37,685 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:33:37,686 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:33:37,686 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:33:37,686 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:33:37,688 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1185 states, 678 states have (on average 1.8067846607669618) internal successors, (1225), 1179 states have internal predecessors, (1225), 503 states have call successors, (503), 2 states have call predecessors, (503), 2 states have return successors, (503), 4 states have call predecessors, (503), 503 states have call successors, (503) [2022-02-20 23:33:37,928 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1185 states to 1185 states and 2231 transitions. [2022-02-20 23:33:37,929 INFO L78 Accepts]: Start accepts. Automaton has 1185 states and 2231 transitions. Word has length 96 [2022-02-20 23:33:37,930 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:33:37,930 INFO L470 AbstractCegarLoop]: Abstraction has 1185 states and 2231 transitions. [2022-02-20 23:33:37,930 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 32.0) internal successors, (96), 3 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:33:37,931 INFO L276 IsEmpty]: Start isEmpty. Operand 1185 states and 2231 transitions. [2022-02-20 23:33:37,931 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2022-02-20 23:33:37,931 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:33:37,932 INFO L514 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 23:33:37,954 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-02-20 23:33:38,140 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 23:33:38,140 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 23:33:38,141 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:33:38,141 INFO L85 PathProgramCache]: Analyzing trace with hash 1482432235, now seen corresponding path program 1 times [2022-02-20 23:33:38,141 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 23:33:38,141 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2023784767] [2022-02-20 23:33:38,142 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:33:38,142 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 23:33:38,252 ERROR L252 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-02-20 23:33:38,253 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1614613833] [2022-02-20 23:33:38,253 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:33:38,253 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 23:33:38,253 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 23:33:38,254 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-02-20 23:33:38,265 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-02-20 23:33:38,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:33:38,778 INFO L263 TraceCheckSpWp]: Trace formula consists of 1651 conjuncts, 3 conjunts are in the unsatisfiable core [2022-02-20 23:33:38,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:33:38,830 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 23:33:39,084 INFO L290 TraceCheckUtils]: 0: Hoare triple {27516#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(21, 2);~count_int_int~0 := 0; {27516#true} is VALID [2022-02-20 23:33:39,085 INFO L290 TraceCheckUtils]: 1: Hoare triple {27516#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~mem5#1, main_#t~post6#1, main_#t~mem7#1, main_#t~mem147#1, main_#t~mem146#1, main_#t~mem148#1, main_#t~mem149#1, main_#t~mem151#1, main_#t~mem150#1, main_#t~mem152#1, main_#t~mem153#1, main_#t~mem155#1, main_#t~mem154#1, main_#t~mem156#1, main_#t~mem157#1, main_#t~switch158#1, main_#t~mem159#1, main_#t~mem160#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_~_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~mem170#1.base, main_#t~mem170#1.offset, main_#t~mem171#1, main_#t~mem172#1.base, main_#t~mem172#1.offset, main_#t~mem173#1.base, main_#t~mem173#1.offset, main_#t~mem174#1.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, main_#t~mem180#1, main_#t~mem181#1, main_#t~short182#1, main_#t~mem183#1.base, main_#t~mem183#1.offset, main_#t~ret184#1, main_#t~mem185#1.base, main_#t~mem185#1.offset, main_#t~mem186#1.base, main_#t~mem186#1.offset, main_#t~mem187#1.base, main_#t~mem187#1.offset, main_#t~mem188#1, main_~_hf_bkt~0#1, main_~_hf_hashv~0#1, main_#t~mem189#1, main_#t~mem190#1, main_#t~mem144#1, main_#t~mem145#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); {27516#true} is VALID [2022-02-20 23:33:39,085 INFO L290 TraceCheckUtils]: 2: Hoare triple {27516#true} call main_#t~mem7#1 := read~int(main_~#i~0#1.base, main_~#i~0#1.offset, 4); {27516#true} is VALID [2022-02-20 23:33:39,085 INFO L290 TraceCheckUtils]: 3: Hoare triple {27516#true} assume !!(main_#t~mem7#1 < 1000);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; {27516#true} is VALID [2022-02-20 23:33:39,085 INFO L290 TraceCheckUtils]: 4: Hoare triple {27516#true} assume !(main_~user~0#1.base == 0 && main_~user~0#1.offset == 0); {27516#true} is VALID [2022-02-20 23:33:39,085 INFO L290 TraceCheckUtils]: 5: Hoare triple {27516#true} call main_#t~mem9#1 := read~int(main_~#i~0#1.base, main_~#i~0#1.offset, 4);call write~int(main_#t~mem9#1, main_~user~0#1.base, main_~user~0#1.offset, 4);havoc main_#t~mem9#1;call main_#t~mem10#1 := read~int(main_~#i~0#1.base, main_~#i~0#1.offset, 4);call main_#t~mem11#1 := read~int(main_~#i~0#1.base, main_~#i~0#1.offset, 4);call write~int(main_#t~mem10#1 * main_#t~mem11#1, main_~user~0#1.base, 4 + main_~user~0#1.offset, 4);havoc main_#t~mem10#1;havoc main_#t~mem11#1; {27516#true} is VALID [2022-02-20 23:33:39,086 INFO L290 TraceCheckUtils]: 6: Hoare triple {27516#true} havoc main_~_ha_hashv~0#1; {27516#true} is VALID [2022-02-20 23:33:39,086 INFO L290 TraceCheckUtils]: 7: Hoare triple {27516#true} goto; {27516#true} is VALID [2022-02-20 23:33:39,086 INFO L290 TraceCheckUtils]: 8: Hoare triple {27516#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; {27516#true} is VALID [2022-02-20 23:33:39,086 INFO L290 TraceCheckUtils]: 9: Hoare triple {27516#true} assume !(main_~_hj_k~0#1 % 4294967296 >= 12); {27516#true} is VALID [2022-02-20 23:33:39,086 INFO L290 TraceCheckUtils]: 10: Hoare triple {27516#true} main_~_ha_hashv~0#1 := 4 + main_~_ha_hashv~0#1;main_#t~switch24#1 := 11 == main_~_hj_k~0#1; {27516#true} is VALID [2022-02-20 23:33:39,086 INFO L290 TraceCheckUtils]: 11: Hoare triple {27516#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; {27516#true} is VALID [2022-02-20 23:33:39,086 INFO L290 TraceCheckUtils]: 12: Hoare triple {27516#true} main_#t~switch24#1 := main_#t~switch24#1 || 10 == main_~_hj_k~0#1; {27516#true} is VALID [2022-02-20 23:33:39,087 INFO L290 TraceCheckUtils]: 13: Hoare triple {27516#true} assume main_#t~switch24#1;call main_#t~mem26#1 := read~int(main_~_hj_key~0#1.base, 9 + main_~_hj_key~0#1.offset, 1);main_~_ha_hashv~0#1 := main_~_ha_hashv~0#1 + 65536 * (main_#t~mem26#1 % 256);havoc main_#t~mem26#1; {27516#true} is VALID [2022-02-20 23:33:39,087 INFO L290 TraceCheckUtils]: 14: Hoare triple {27516#true} main_#t~switch24#1 := main_#t~switch24#1 || 9 == main_~_hj_k~0#1; {27516#true} is VALID [2022-02-20 23:33:39,087 INFO L290 TraceCheckUtils]: 15: Hoare triple {27516#true} 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; {27516#true} is VALID [2022-02-20 23:33:39,087 INFO L290 TraceCheckUtils]: 16: Hoare triple {27516#true} main_#t~switch24#1 := main_#t~switch24#1 || 8 == main_~_hj_k~0#1; {27516#true} is VALID [2022-02-20 23:33:39,087 INFO L290 TraceCheckUtils]: 17: Hoare triple {27516#true} 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; {27516#true} is VALID [2022-02-20 23:33:39,087 INFO L290 TraceCheckUtils]: 18: Hoare triple {27516#true} main_#t~switch24#1 := main_#t~switch24#1 || 7 == main_~_hj_k~0#1; {27516#true} is VALID [2022-02-20 23:33:39,087 INFO L290 TraceCheckUtils]: 19: Hoare triple {27516#true} 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; {27516#true} is VALID [2022-02-20 23:33:39,088 INFO L290 TraceCheckUtils]: 20: Hoare triple {27516#true} main_#t~switch24#1 := main_#t~switch24#1 || 6 == main_~_hj_k~0#1; {27516#true} is VALID [2022-02-20 23:33:39,088 INFO L290 TraceCheckUtils]: 21: Hoare triple {27516#true} 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; {27516#true} is VALID [2022-02-20 23:33:39,088 INFO L290 TraceCheckUtils]: 22: Hoare triple {27516#true} main_#t~switch24#1 := main_#t~switch24#1 || 5 == main_~_hj_k~0#1; {27516#true} is VALID [2022-02-20 23:33:39,088 INFO L290 TraceCheckUtils]: 23: Hoare triple {27516#true} 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; {27516#true} is VALID [2022-02-20 23:33:39,088 INFO L290 TraceCheckUtils]: 24: Hoare triple {27516#true} main_#t~switch24#1 := main_#t~switch24#1 || 4 == main_~_hj_k~0#1; {27516#true} is VALID [2022-02-20 23:33:39,088 INFO L290 TraceCheckUtils]: 25: Hoare triple {27516#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; {27516#true} is VALID [2022-02-20 23:33:39,088 INFO L290 TraceCheckUtils]: 26: Hoare triple {27516#true} main_#t~switch24#1 := main_#t~switch24#1 || 3 == main_~_hj_k~0#1; {27516#true} is VALID [2022-02-20 23:33:39,089 INFO L290 TraceCheckUtils]: 27: Hoare triple {27516#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; {27516#true} is VALID [2022-02-20 23:33:39,089 INFO L290 TraceCheckUtils]: 28: Hoare triple {27516#true} main_#t~switch24#1 := main_#t~switch24#1 || 2 == main_~_hj_k~0#1; {27516#true} is VALID [2022-02-20 23:33:39,089 INFO L290 TraceCheckUtils]: 29: Hoare triple {27516#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; {27516#true} is VALID [2022-02-20 23:33:39,089 INFO L290 TraceCheckUtils]: 30: Hoare triple {27516#true} main_#t~switch24#1 := main_#t~switch24#1 || 1 == main_~_hj_k~0#1; {27516#true} is VALID [2022-02-20 23:33:39,089 INFO L290 TraceCheckUtils]: 31: Hoare triple {27516#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; {27516#true} is VALID [2022-02-20 23:33:39,089 INFO L290 TraceCheckUtils]: 32: Hoare triple {27516#true} havoc main_#t~switch24#1; {27516#true} is VALID [2022-02-20 23:33:39,089 INFO L290 TraceCheckUtils]: 33: Hoare triple {27516#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)))); {27516#true} is VALID [2022-02-20 23:33:39,090 INFO L290 TraceCheckUtils]: 34: Hoare triple {27516#true} goto; {27516#true} is VALID [2022-02-20 23:33:39,090 INFO L290 TraceCheckUtils]: 35: Hoare triple {27516#true} goto; {27516#true} is VALID [2022-02-20 23:33:39,107 INFO L290 TraceCheckUtils]: 36: Hoare triple {27516#true} goto; {27516#true} is VALID [2022-02-20 23:33:39,107 INFO L290 TraceCheckUtils]: 37: Hoare triple {27516#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); {27516#true} is VALID [2022-02-20 23:33:39,108 INFO L290 TraceCheckUtils]: 38: Hoare triple {27516#true} 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; {27516#true} is VALID [2022-02-20 23:33:39,108 INFO L290 TraceCheckUtils]: 39: Hoare triple {27516#true} 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; {27516#true} is VALID [2022-02-20 23:33:39,108 INFO L290 TraceCheckUtils]: 40: Hoare triple {27516#true} goto; {27516#true} is VALID [2022-02-20 23:33:39,108 INFO L290 TraceCheckUtils]: 41: Hoare triple {27516#true} 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; {27516#true} is VALID [2022-02-20 23:33:39,108 INFO L290 TraceCheckUtils]: 42: Hoare triple {27516#true} 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; {27516#true} is VALID [2022-02-20 23:33:39,108 INFO L290 TraceCheckUtils]: 43: Hoare triple {27516#true} goto; {27516#true} is VALID [2022-02-20 23:33:39,108 INFO L290 TraceCheckUtils]: 44: Hoare triple {27516#true} 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); {27516#true} is VALID [2022-02-20 23:33:39,109 INFO L290 TraceCheckUtils]: 45: Hoare triple {27516#true} 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; {27516#true} is VALID [2022-02-20 23:33:39,109 INFO L290 TraceCheckUtils]: 46: Hoare triple {27516#true} 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; {27516#true} is VALID [2022-02-20 23:33:39,109 INFO L290 TraceCheckUtils]: 47: Hoare triple {27516#true} 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; {27516#true} is VALID [2022-02-20 23:33:39,109 INFO L290 TraceCheckUtils]: 48: Hoare triple {27516#true} 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; {27516#true} is VALID [2022-02-20 23:33:39,109 INFO L290 TraceCheckUtils]: 49: Hoare triple {27516#true} goto; {27516#true} is VALID [2022-02-20 23:33:39,110 INFO L290 TraceCheckUtils]: 50: Hoare triple {27516#true} goto; {27516#true} is VALID [2022-02-20 23:33:39,110 INFO L290 TraceCheckUtils]: 51: Hoare triple {27516#true} goto; {27516#true} is VALID [2022-02-20 23:33:39,110 INFO L290 TraceCheckUtils]: 52: Hoare triple {27516#true} goto; {27516#true} is VALID [2022-02-20 23:33:39,110 INFO L290 TraceCheckUtils]: 53: Hoare triple {27516#true} 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;call write~int(1 + main_#t~post6#1, main_~#i~0#1.base, main_~#i~0#1.offset, 4);havoc main_#t~mem5#1;havoc main_#t~post6#1; {27516#true} is VALID [2022-02-20 23:33:39,110 INFO L290 TraceCheckUtils]: 54: Hoare triple {27516#true} call main_#t~mem7#1 := read~int(main_~#i~0#1.base, main_~#i~0#1.offset, 4); {27516#true} is VALID [2022-02-20 23:33:39,110 INFO L290 TraceCheckUtils]: 55: Hoare triple {27516#true} assume !(main_#t~mem7#1 < 1000);havoc main_#t~mem7#1; {27516#true} is VALID [2022-02-20 23:33:39,111 INFO L290 TraceCheckUtils]: 56: Hoare triple {27516#true} call write~int(0, main_~#i~0#1.base, main_~#i~0#1.offset, 4); {27516#true} is VALID [2022-02-20 23:33:39,111 INFO L290 TraceCheckUtils]: 57: Hoare triple {27516#true} call main_#t~mem145#1 := read~int(main_~#i~0#1.base, main_~#i~0#1.offset, 4); {27516#true} is VALID [2022-02-20 23:33:39,111 INFO L290 TraceCheckUtils]: 58: Hoare triple {27516#true} assume !!(main_#t~mem145#1 < 1000);havoc main_#t~mem145#1; {27516#true} is VALID [2022-02-20 23:33:39,111 INFO L290 TraceCheckUtils]: 59: Hoare triple {27516#true} havoc main_~_hf_hashv~0#1; {27516#true} is VALID [2022-02-20 23:33:39,111 INFO L290 TraceCheckUtils]: 60: Hoare triple {27516#true} goto; {27516#true} is VALID [2022-02-20 23:33:39,111 INFO L290 TraceCheckUtils]: 61: Hoare triple {27516#true} 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; {27516#true} is VALID [2022-02-20 23:33:39,111 INFO L290 TraceCheckUtils]: 62: Hoare triple {27516#true} assume !(main_~_hj_k~1#1 % 4294967296 >= 12); {27516#true} is VALID [2022-02-20 23:33:39,112 INFO L290 TraceCheckUtils]: 63: Hoare triple {27516#true} main_~_hf_hashv~0#1 := 4 + main_~_hf_hashv~0#1;main_#t~switch158#1 := 11 == main_~_hj_k~1#1; {27516#true} is VALID [2022-02-20 23:33:39,112 INFO L290 TraceCheckUtils]: 64: Hoare triple {27516#true} assume !main_#t~switch158#1; {27516#true} is VALID [2022-02-20 23:33:39,112 INFO L290 TraceCheckUtils]: 65: Hoare triple {27516#true} main_#t~switch158#1 := main_#t~switch158#1 || 10 == main_~_hj_k~1#1; {27516#true} is VALID [2022-02-20 23:33:39,112 INFO L290 TraceCheckUtils]: 66: Hoare triple {27516#true} assume main_#t~switch158#1;call main_#t~mem160#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~mem160#1 % 256);havoc main_#t~mem160#1; {27516#true} is VALID [2022-02-20 23:33:39,112 INFO L290 TraceCheckUtils]: 67: Hoare triple {27516#true} main_#t~switch158#1 := main_#t~switch158#1 || 9 == main_~_hj_k~1#1; {27516#true} is VALID [2022-02-20 23:33:39,112 INFO L290 TraceCheckUtils]: 68: Hoare triple {27516#true} assume main_#t~switch158#1;call main_#t~mem161#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~mem161#1 % 256);havoc main_#t~mem161#1; {27516#true} is VALID [2022-02-20 23:33:39,112 INFO L290 TraceCheckUtils]: 69: Hoare triple {27516#true} main_#t~switch158#1 := main_#t~switch158#1 || 8 == main_~_hj_k~1#1; {27516#true} is VALID [2022-02-20 23:33:39,112 INFO L290 TraceCheckUtils]: 70: Hoare triple {27516#true} assume main_#t~switch158#1;call main_#t~mem162#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~mem162#1 % 256);havoc main_#t~mem162#1; {27516#true} is VALID [2022-02-20 23:33:39,113 INFO L290 TraceCheckUtils]: 71: Hoare triple {27516#true} main_#t~switch158#1 := main_#t~switch158#1 || 7 == main_~_hj_k~1#1; {27516#true} is VALID [2022-02-20 23:33:39,113 INFO L290 TraceCheckUtils]: 72: Hoare triple {27516#true} assume main_#t~switch158#1;call main_#t~mem163#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~mem163#1 % 256);havoc main_#t~mem163#1; {27516#true} is VALID [2022-02-20 23:33:39,113 INFO L290 TraceCheckUtils]: 73: Hoare triple {27516#true} main_#t~switch158#1 := main_#t~switch158#1 || 6 == main_~_hj_k~1#1; {27516#true} is VALID [2022-02-20 23:33:39,113 INFO L290 TraceCheckUtils]: 74: Hoare triple {27516#true} assume main_#t~switch158#1;call main_#t~mem164#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~mem164#1 % 256);havoc main_#t~mem164#1; {27516#true} is VALID [2022-02-20 23:33:39,113 INFO L290 TraceCheckUtils]: 75: Hoare triple {27516#true} main_#t~switch158#1 := main_#t~switch158#1 || 5 == main_~_hj_k~1#1; {27516#true} is VALID [2022-02-20 23:33:39,113 INFO L290 TraceCheckUtils]: 76: Hoare triple {27516#true} assume main_#t~switch158#1;call main_#t~mem165#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~mem165#1 % 256;havoc main_#t~mem165#1; {27516#true} is VALID [2022-02-20 23:33:39,113 INFO L290 TraceCheckUtils]: 77: Hoare triple {27516#true} main_#t~switch158#1 := main_#t~switch158#1 || 4 == main_~_hj_k~1#1; {27516#true} is VALID [2022-02-20 23:33:39,117 INFO L290 TraceCheckUtils]: 78: Hoare triple {27516#true} assume main_#t~switch158#1;call main_#t~mem166#1 := read~int(main_~_hj_key~1#1.base, 3 + main_~_hj_key~1#1.offset, 1);main_~_hj_i~1#1 := main_~_hj_i~1#1 + 16777216 * (main_#t~mem166#1 % 256);havoc main_#t~mem166#1; {27516#true} is VALID [2022-02-20 23:33:39,118 INFO L290 TraceCheckUtils]: 79: Hoare triple {27516#true} main_#t~switch158#1 := main_#t~switch158#1 || 3 == main_~_hj_k~1#1; {27516#true} is VALID [2022-02-20 23:33:39,119 INFO L290 TraceCheckUtils]: 80: Hoare triple {27516#true} assume main_#t~switch158#1;call main_#t~mem167#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~mem167#1 % 256);havoc main_#t~mem167#1; {27761#|ULTIMATE.start_main_#t~switch158#1|} is VALID [2022-02-20 23:33:39,119 INFO L290 TraceCheckUtils]: 81: Hoare triple {27761#|ULTIMATE.start_main_#t~switch158#1|} main_#t~switch158#1 := main_#t~switch158#1 || 2 == main_~_hj_k~1#1; {27761#|ULTIMATE.start_main_#t~switch158#1|} is VALID [2022-02-20 23:33:39,133 INFO L290 TraceCheckUtils]: 82: Hoare triple {27761#|ULTIMATE.start_main_#t~switch158#1|} assume !main_#t~switch158#1; {27517#false} is VALID [2022-02-20 23:33:39,134 INFO L290 TraceCheckUtils]: 83: Hoare triple {27517#false} main_#t~switch158#1 := main_#t~switch158#1 || 1 == main_~_hj_k~1#1; {27517#false} is VALID [2022-02-20 23:33:39,134 INFO L290 TraceCheckUtils]: 84: Hoare triple {27517#false} assume main_#t~switch158#1;call main_#t~mem169#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~mem169#1 % 256;havoc main_#t~mem169#1; {27517#false} is VALID [2022-02-20 23:33:39,134 INFO L290 TraceCheckUtils]: 85: Hoare triple {27517#false} havoc main_#t~switch158#1; {27517#false} is VALID [2022-02-20 23:33:39,134 INFO L290 TraceCheckUtils]: 86: Hoare triple {27517#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)))); {27517#false} is VALID [2022-02-20 23:33:39,134 INFO L290 TraceCheckUtils]: 87: Hoare triple {27517#false} goto; {27517#false} is VALID [2022-02-20 23:33:39,134 INFO L290 TraceCheckUtils]: 88: Hoare triple {27517#false} goto; {27517#false} is VALID [2022-02-20 23:33:39,135 INFO L290 TraceCheckUtils]: 89: Hoare triple {27517#false} goto; {27517#false} is VALID [2022-02-20 23:33:39,135 INFO L290 TraceCheckUtils]: 90: Hoare triple {27517#false} main_~tmp~0#1.base, main_~tmp~0#1.offset := 0, 0; {27517#false} is VALID [2022-02-20 23:33:39,135 INFO L290 TraceCheckUtils]: 91: Hoare triple {27517#false} assume !(main_~users~0#1.base != 0 || main_~users~0#1.offset != 0); {27517#false} is VALID [2022-02-20 23:33:39,135 INFO L290 TraceCheckUtils]: 92: Hoare triple {27517#false} goto; {27517#false} is VALID [2022-02-20 23:33:39,135 INFO L290 TraceCheckUtils]: 93: Hoare triple {27517#false} goto; {27517#false} is VALID [2022-02-20 23:33:39,135 INFO L290 TraceCheckUtils]: 94: Hoare triple {27517#false} assume !(main_~tmp~0#1.base != 0 || main_~tmp~0#1.offset != 0); {27517#false} is VALID [2022-02-20 23:33:39,135 INFO L290 TraceCheckUtils]: 95: Hoare triple {27517#false} assume !false; {27517#false} is VALID [2022-02-20 23:33:39,136 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-02-20 23:33:39,136 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 23:33:39,136 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 23:33:39,137 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2023784767] [2022-02-20 23:33:39,137 WARN L317 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-02-20 23:33:39,137 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1614613833] [2022-02-20 23:33:39,137 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1614613833] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:33:39,138 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:33:39,138 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 23:33:39,138 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [242007390] [2022-02-20 23:33:39,138 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:33:39,138 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 31.666666666666668) internal successors, (95), 3 states have internal predecessors, (95), 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 96 [2022-02-20 23:33:39,139 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:33:39,139 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 31.666666666666668) internal successors, (95), 3 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:33:39,212 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 95 edges. 95 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:33:39,213 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 23:33:39,213 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 23:33:39,214 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 23:33:39,214 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 23:33:39,214 INFO L87 Difference]: Start difference. First operand 1185 states and 2231 transitions. Second operand has 3 states, 3 states have (on average 31.666666666666668) internal successors, (95), 3 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:33:42,019 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:33:42,020 INFO L93 Difference]: Finished difference Result 2274 states and 4348 transitions. [2022-02-20 23:33:42,020 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 23:33:42,020 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 31.666666666666668) internal successors, (95), 3 states have internal predecessors, (95), 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 96 [2022-02-20 23:33:42,022 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:33:42,022 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 31.666666666666668) internal successors, (95), 3 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:33:42,187 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 4326 transitions. [2022-02-20 23:33:42,188 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 31.666666666666668) internal successors, (95), 3 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:33:42,412 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 4326 transitions. [2022-02-20 23:33:42,412 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 4326 transitions. [2022-02-20 23:33:45,107 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 4326 edges. 4326 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:33:45,175 INFO L225 Difference]: With dead ends: 2274 [2022-02-20 23:33:45,175 INFO L226 Difference]: Without dead ends: 1206 [2022-02-20 23:33:45,177 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 94 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 23:33:45,178 INFO L933 BasicCegarLoop]: 2191 mSDtfsCounter, 8 mSDsluCounter, 2174 mSDsCounter, 0 mSdLazyCounter, 44 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 4365 SdHoareTripleChecker+Invalid, 72 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 44 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-20 23:33:45,178 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [8 Valid, 4365 Invalid, 72 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 44 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-20 23:33:45,182 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1206 states. [2022-02-20 23:33:45,282 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1206 to 1205. [2022-02-20 23:33:45,282 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:33:45,284 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1206 states. Second operand has 1205 states, 698 states have (on average 1.7836676217765044) internal successors, (1245), 1199 states have internal predecessors, (1245), 503 states have call successors, (503), 2 states have call predecessors, (503), 2 states have return successors, (503), 4 states have call predecessors, (503), 503 states have call successors, (503) [2022-02-20 23:33:45,286 INFO L74 IsIncluded]: Start isIncluded. First operand 1206 states. Second operand has 1205 states, 698 states have (on average 1.7836676217765044) internal successors, (1245), 1199 states have internal predecessors, (1245), 503 states have call successors, (503), 2 states have call predecessors, (503), 2 states have return successors, (503), 4 states have call predecessors, (503), 503 states have call successors, (503) [2022-02-20 23:33:45,287 INFO L87 Difference]: Start difference. First operand 1206 states. Second operand has 1205 states, 698 states have (on average 1.7836676217765044) internal successors, (1245), 1199 states have internal predecessors, (1245), 503 states have call successors, (503), 2 states have call predecessors, (503), 2 states have return successors, (503), 4 states have call predecessors, (503), 503 states have call successors, (503) [2022-02-20 23:33:45,466 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:33:45,466 INFO L93 Difference]: Finished difference Result 1206 states and 2252 transitions. [2022-02-20 23:33:45,466 INFO L276 IsEmpty]: Start isEmpty. Operand 1206 states and 2252 transitions. [2022-02-20 23:33:45,470 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:33:45,470 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:33:45,473 INFO L74 IsIncluded]: Start isIncluded. First operand has 1205 states, 698 states have (on average 1.7836676217765044) internal successors, (1245), 1199 states have internal predecessors, (1245), 503 states have call successors, (503), 2 states have call predecessors, (503), 2 states have return successors, (503), 4 states have call predecessors, (503), 503 states have call successors, (503) Second operand 1206 states. [2022-02-20 23:33:45,474 INFO L87 Difference]: Start difference. First operand has 1205 states, 698 states have (on average 1.7836676217765044) internal successors, (1245), 1199 states have internal predecessors, (1245), 503 states have call successors, (503), 2 states have call predecessors, (503), 2 states have return successors, (503), 4 states have call predecessors, (503), 503 states have call successors, (503) Second operand 1206 states. [2022-02-20 23:33:45,708 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:33:45,709 INFO L93 Difference]: Finished difference Result 1206 states and 2252 transitions. [2022-02-20 23:33:45,709 INFO L276 IsEmpty]: Start isEmpty. Operand 1206 states and 2252 transitions. [2022-02-20 23:33:45,712 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:33:45,712 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:33:45,712 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:33:45,712 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:33:45,715 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1205 states, 698 states have (on average 1.7836676217765044) internal successors, (1245), 1199 states have internal predecessors, (1245), 503 states have call successors, (503), 2 states have call predecessors, (503), 2 states have return successors, (503), 4 states have call predecessors, (503), 503 states have call successors, (503) [2022-02-20 23:33:45,916 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1205 states to 1205 states and 2251 transitions. [2022-02-20 23:33:45,917 INFO L78 Accepts]: Start accepts. Automaton has 1205 states and 2251 transitions. Word has length 96 [2022-02-20 23:33:45,917 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:33:45,918 INFO L470 AbstractCegarLoop]: Abstraction has 1205 states and 2251 transitions. [2022-02-20 23:33:45,918 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 31.666666666666668) internal successors, (95), 3 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:33:45,918 INFO L276 IsEmpty]: Start isEmpty. Operand 1205 states and 2251 transitions. [2022-02-20 23:33:45,919 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2022-02-20 23:33:45,919 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:33:45,919 INFO L514 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 23:33:45,939 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2022-02-20 23:33:46,139 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable3 [2022-02-20 23:33:46,139 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 23:33:46,140 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:33:46,140 INFO L85 PathProgramCache]: Analyzing trace with hash -1801417811, now seen corresponding path program 1 times [2022-02-20 23:33:46,140 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 23:33:46,140 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1131338699] [2022-02-20 23:33:46,141 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:33:46,141 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 23:33:46,221 ERROR L252 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-02-20 23:33:46,222 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [493206285] [2022-02-20 23:33:46,222 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:33:46,222 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 23:33:46,223 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 23:33:46,223 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-02-20 23:33:46,244 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-02-20 23:33:46,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:33:46,775 INFO L263 TraceCheckSpWp]: Trace formula consists of 1653 conjuncts, 3 conjunts are in the unsatisfiable core [2022-02-20 23:33:46,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:33:46,831 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 23:33:47,026 INFO L290 TraceCheckUtils]: 0: Hoare triple {35276#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(21, 2);~count_int_int~0 := 0; {35276#true} is VALID [2022-02-20 23:33:47,027 INFO L290 TraceCheckUtils]: 1: Hoare triple {35276#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~mem5#1, main_#t~post6#1, main_#t~mem7#1, main_#t~mem147#1, main_#t~mem146#1, main_#t~mem148#1, main_#t~mem149#1, main_#t~mem151#1, main_#t~mem150#1, main_#t~mem152#1, main_#t~mem153#1, main_#t~mem155#1, main_#t~mem154#1, main_#t~mem156#1, main_#t~mem157#1, main_#t~switch158#1, main_#t~mem159#1, main_#t~mem160#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_~_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~mem170#1.base, main_#t~mem170#1.offset, main_#t~mem171#1, main_#t~mem172#1.base, main_#t~mem172#1.offset, main_#t~mem173#1.base, main_#t~mem173#1.offset, main_#t~mem174#1.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, main_#t~mem180#1, main_#t~mem181#1, main_#t~short182#1, main_#t~mem183#1.base, main_#t~mem183#1.offset, main_#t~ret184#1, main_#t~mem185#1.base, main_#t~mem185#1.offset, main_#t~mem186#1.base, main_#t~mem186#1.offset, main_#t~mem187#1.base, main_#t~mem187#1.offset, main_#t~mem188#1, main_~_hf_bkt~0#1, main_~_hf_hashv~0#1, main_#t~mem189#1, main_#t~mem190#1, main_#t~mem144#1, main_#t~mem145#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); {35276#true} is VALID [2022-02-20 23:33:47,027 INFO L290 TraceCheckUtils]: 2: Hoare triple {35276#true} call main_#t~mem7#1 := read~int(main_~#i~0#1.base, main_~#i~0#1.offset, 4); {35276#true} is VALID [2022-02-20 23:33:47,027 INFO L290 TraceCheckUtils]: 3: Hoare triple {35276#true} assume !!(main_#t~mem7#1 < 1000);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; {35276#true} is VALID [2022-02-20 23:33:47,028 INFO L290 TraceCheckUtils]: 4: Hoare triple {35276#true} assume !(main_~user~0#1.base == 0 && main_~user~0#1.offset == 0); {35276#true} is VALID [2022-02-20 23:33:47,028 INFO L290 TraceCheckUtils]: 5: Hoare triple {35276#true} call main_#t~mem9#1 := read~int(main_~#i~0#1.base, main_~#i~0#1.offset, 4);call write~int(main_#t~mem9#1, main_~user~0#1.base, main_~user~0#1.offset, 4);havoc main_#t~mem9#1;call main_#t~mem10#1 := read~int(main_~#i~0#1.base, main_~#i~0#1.offset, 4);call main_#t~mem11#1 := read~int(main_~#i~0#1.base, main_~#i~0#1.offset, 4);call write~int(main_#t~mem10#1 * main_#t~mem11#1, main_~user~0#1.base, 4 + main_~user~0#1.offset, 4);havoc main_#t~mem10#1;havoc main_#t~mem11#1; {35276#true} is VALID [2022-02-20 23:33:47,028 INFO L290 TraceCheckUtils]: 6: Hoare triple {35276#true} havoc main_~_ha_hashv~0#1; {35276#true} is VALID [2022-02-20 23:33:47,028 INFO L290 TraceCheckUtils]: 7: Hoare triple {35276#true} goto; {35276#true} is VALID [2022-02-20 23:33:47,029 INFO L290 TraceCheckUtils]: 8: Hoare triple {35276#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; {35305#(<= |ULTIMATE.start_main_~_hj_k~0#1| 4)} is VALID [2022-02-20 23:33:47,029 INFO L290 TraceCheckUtils]: 9: Hoare triple {35305#(<= |ULTIMATE.start_main_~_hj_k~0#1| 4)} assume !(main_~_hj_k~0#1 % 4294967296 >= 12); {35305#(<= |ULTIMATE.start_main_~_hj_k~0#1| 4)} is VALID [2022-02-20 23:33:47,039 INFO L290 TraceCheckUtils]: 10: Hoare triple {35305#(<= |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; {35312#(not |ULTIMATE.start_main_#t~switch24#1|)} is VALID [2022-02-20 23:33:47,040 INFO L290 TraceCheckUtils]: 11: Hoare triple {35312#(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; {35277#false} is VALID [2022-02-20 23:33:47,040 INFO L290 TraceCheckUtils]: 12: Hoare triple {35277#false} main_#t~switch24#1 := main_#t~switch24#1 || 10 == main_~_hj_k~0#1; {35277#false} is VALID [2022-02-20 23:33:47,040 INFO L290 TraceCheckUtils]: 13: Hoare triple {35277#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; {35277#false} is VALID [2022-02-20 23:33:47,040 INFO L290 TraceCheckUtils]: 14: Hoare triple {35277#false} main_#t~switch24#1 := main_#t~switch24#1 || 9 == main_~_hj_k~0#1; {35277#false} is VALID [2022-02-20 23:33:47,040 INFO L290 TraceCheckUtils]: 15: Hoare triple {35277#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; {35277#false} is VALID [2022-02-20 23:33:47,041 INFO L290 TraceCheckUtils]: 16: Hoare triple {35277#false} main_#t~switch24#1 := main_#t~switch24#1 || 8 == main_~_hj_k~0#1; {35277#false} is VALID [2022-02-20 23:33:47,041 INFO L290 TraceCheckUtils]: 17: Hoare triple {35277#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; {35277#false} is VALID [2022-02-20 23:33:47,041 INFO L290 TraceCheckUtils]: 18: Hoare triple {35277#false} main_#t~switch24#1 := main_#t~switch24#1 || 7 == main_~_hj_k~0#1; {35277#false} is VALID [2022-02-20 23:33:47,041 INFO L290 TraceCheckUtils]: 19: Hoare triple {35277#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; {35277#false} is VALID [2022-02-20 23:33:47,042 INFO L290 TraceCheckUtils]: 20: Hoare triple {35277#false} main_#t~switch24#1 := main_#t~switch24#1 || 6 == main_~_hj_k~0#1; {35277#false} is VALID [2022-02-20 23:33:47,042 INFO L290 TraceCheckUtils]: 21: Hoare triple {35277#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; {35277#false} is VALID [2022-02-20 23:33:47,042 INFO L290 TraceCheckUtils]: 22: Hoare triple {35277#false} main_#t~switch24#1 := main_#t~switch24#1 || 5 == main_~_hj_k~0#1; {35277#false} is VALID [2022-02-20 23:33:47,042 INFO L290 TraceCheckUtils]: 23: Hoare triple {35277#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; {35277#false} is VALID [2022-02-20 23:33:47,042 INFO L290 TraceCheckUtils]: 24: Hoare triple {35277#false} main_#t~switch24#1 := main_#t~switch24#1 || 4 == main_~_hj_k~0#1; {35277#false} is VALID [2022-02-20 23:33:47,042 INFO L290 TraceCheckUtils]: 25: Hoare triple {35277#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; {35277#false} is VALID [2022-02-20 23:33:47,042 INFO L290 TraceCheckUtils]: 26: Hoare triple {35277#false} main_#t~switch24#1 := main_#t~switch24#1 || 3 == main_~_hj_k~0#1; {35277#false} is VALID [2022-02-20 23:33:47,042 INFO L290 TraceCheckUtils]: 27: Hoare triple {35277#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; {35277#false} is VALID [2022-02-20 23:33:47,043 INFO L290 TraceCheckUtils]: 28: Hoare triple {35277#false} main_#t~switch24#1 := main_#t~switch24#1 || 2 == main_~_hj_k~0#1; {35277#false} is VALID [2022-02-20 23:33:47,043 INFO L290 TraceCheckUtils]: 29: Hoare triple {35277#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; {35277#false} is VALID [2022-02-20 23:33:47,043 INFO L290 TraceCheckUtils]: 30: Hoare triple {35277#false} main_#t~switch24#1 := main_#t~switch24#1 || 1 == main_~_hj_k~0#1; {35277#false} is VALID [2022-02-20 23:33:47,043 INFO L290 TraceCheckUtils]: 31: Hoare triple {35277#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; {35277#false} is VALID [2022-02-20 23:33:47,043 INFO L290 TraceCheckUtils]: 32: Hoare triple {35277#false} havoc main_#t~switch24#1; {35277#false} is VALID [2022-02-20 23:33:47,044 INFO L290 TraceCheckUtils]: 33: Hoare triple {35277#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)))); {35277#false} is VALID [2022-02-20 23:33:47,044 INFO L290 TraceCheckUtils]: 34: Hoare triple {35277#false} goto; {35277#false} is VALID [2022-02-20 23:33:47,045 INFO L290 TraceCheckUtils]: 35: Hoare triple {35277#false} goto; {35277#false} is VALID [2022-02-20 23:33:47,045 INFO L290 TraceCheckUtils]: 36: Hoare triple {35277#false} goto; {35277#false} is VALID [2022-02-20 23:33:47,045 INFO L290 TraceCheckUtils]: 37: Hoare triple {35277#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); {35277#false} is VALID [2022-02-20 23:33:47,045 INFO L290 TraceCheckUtils]: 38: Hoare triple {35277#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; {35277#false} is VALID [2022-02-20 23:33:47,045 INFO L290 TraceCheckUtils]: 39: Hoare triple {35277#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; {35277#false} is VALID [2022-02-20 23:33:47,045 INFO L290 TraceCheckUtils]: 40: Hoare triple {35277#false} goto; {35277#false} is VALID [2022-02-20 23:33:47,045 INFO L290 TraceCheckUtils]: 41: Hoare triple {35277#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; {35277#false} is VALID [2022-02-20 23:33:47,045 INFO L290 TraceCheckUtils]: 42: Hoare triple {35277#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; {35277#false} is VALID [2022-02-20 23:33:47,046 INFO L290 TraceCheckUtils]: 43: Hoare triple {35277#false} goto; {35277#false} is VALID [2022-02-20 23:33:47,046 INFO L290 TraceCheckUtils]: 44: Hoare triple {35277#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); {35277#false} is VALID [2022-02-20 23:33:47,046 INFO L290 TraceCheckUtils]: 45: Hoare triple {35277#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; {35277#false} is VALID [2022-02-20 23:33:47,046 INFO L290 TraceCheckUtils]: 46: Hoare triple {35277#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; {35277#false} is VALID [2022-02-20 23:33:47,046 INFO L290 TraceCheckUtils]: 47: Hoare triple {35277#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; {35277#false} is VALID [2022-02-20 23:33:47,046 INFO L290 TraceCheckUtils]: 48: Hoare triple {35277#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; {35277#false} is VALID [2022-02-20 23:33:47,046 INFO L290 TraceCheckUtils]: 49: Hoare triple {35277#false} goto; {35277#false} is VALID [2022-02-20 23:33:47,047 INFO L290 TraceCheckUtils]: 50: Hoare triple {35277#false} goto; {35277#false} is VALID [2022-02-20 23:33:47,047 INFO L290 TraceCheckUtils]: 51: Hoare triple {35277#false} goto; {35277#false} is VALID [2022-02-20 23:33:47,047 INFO L290 TraceCheckUtils]: 52: Hoare triple {35277#false} goto; {35277#false} is VALID [2022-02-20 23:33:47,047 INFO L290 TraceCheckUtils]: 53: Hoare triple {35277#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;call write~int(1 + main_#t~post6#1, main_~#i~0#1.base, main_~#i~0#1.offset, 4);havoc main_#t~mem5#1;havoc main_#t~post6#1; {35277#false} is VALID [2022-02-20 23:33:47,047 INFO L290 TraceCheckUtils]: 54: Hoare triple {35277#false} call main_#t~mem7#1 := read~int(main_~#i~0#1.base, main_~#i~0#1.offset, 4); {35277#false} is VALID [2022-02-20 23:33:47,047 INFO L290 TraceCheckUtils]: 55: Hoare triple {35277#false} assume !(main_#t~mem7#1 < 1000);havoc main_#t~mem7#1; {35277#false} is VALID [2022-02-20 23:33:47,047 INFO L290 TraceCheckUtils]: 56: Hoare triple {35277#false} call write~int(0, main_~#i~0#1.base, main_~#i~0#1.offset, 4); {35277#false} is VALID [2022-02-20 23:33:47,047 INFO L290 TraceCheckUtils]: 57: Hoare triple {35277#false} call main_#t~mem145#1 := read~int(main_~#i~0#1.base, main_~#i~0#1.offset, 4); {35277#false} is VALID [2022-02-20 23:33:47,048 INFO L290 TraceCheckUtils]: 58: Hoare triple {35277#false} assume !!(main_#t~mem145#1 < 1000);havoc main_#t~mem145#1; {35277#false} is VALID [2022-02-20 23:33:47,048 INFO L290 TraceCheckUtils]: 59: Hoare triple {35277#false} havoc main_~_hf_hashv~0#1; {35277#false} is VALID [2022-02-20 23:33:47,049 INFO L290 TraceCheckUtils]: 60: Hoare triple {35277#false} goto; {35277#false} is VALID [2022-02-20 23:33:47,049 INFO L290 TraceCheckUtils]: 61: Hoare triple {35277#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; {35277#false} is VALID [2022-02-20 23:33:47,049 INFO L290 TraceCheckUtils]: 62: Hoare triple {35277#false} assume !(main_~_hj_k~1#1 % 4294967296 >= 12); {35277#false} is VALID [2022-02-20 23:33:47,050 INFO L290 TraceCheckUtils]: 63: Hoare triple {35277#false} main_~_hf_hashv~0#1 := 4 + main_~_hf_hashv~0#1;main_#t~switch158#1 := 11 == main_~_hj_k~1#1; {35277#false} is VALID [2022-02-20 23:33:47,050 INFO L290 TraceCheckUtils]: 64: Hoare triple {35277#false} assume !main_#t~switch158#1; {35277#false} is VALID [2022-02-20 23:33:47,050 INFO L290 TraceCheckUtils]: 65: Hoare triple {35277#false} main_#t~switch158#1 := main_#t~switch158#1 || 10 == main_~_hj_k~1#1; {35277#false} is VALID [2022-02-20 23:33:47,050 INFO L290 TraceCheckUtils]: 66: Hoare triple {35277#false} assume main_#t~switch158#1;call main_#t~mem160#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~mem160#1 % 256);havoc main_#t~mem160#1; {35277#false} is VALID [2022-02-20 23:33:47,050 INFO L290 TraceCheckUtils]: 67: Hoare triple {35277#false} main_#t~switch158#1 := main_#t~switch158#1 || 9 == main_~_hj_k~1#1; {35277#false} is VALID [2022-02-20 23:33:47,051 INFO L290 TraceCheckUtils]: 68: Hoare triple {35277#false} assume main_#t~switch158#1;call main_#t~mem161#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~mem161#1 % 256);havoc main_#t~mem161#1; {35277#false} is VALID [2022-02-20 23:33:47,051 INFO L290 TraceCheckUtils]: 69: Hoare triple {35277#false} main_#t~switch158#1 := main_#t~switch158#1 || 8 == main_~_hj_k~1#1; {35277#false} is VALID [2022-02-20 23:33:47,051 INFO L290 TraceCheckUtils]: 70: Hoare triple {35277#false} assume main_#t~switch158#1;call main_#t~mem162#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~mem162#1 % 256);havoc main_#t~mem162#1; {35277#false} is VALID [2022-02-20 23:33:47,051 INFO L290 TraceCheckUtils]: 71: Hoare triple {35277#false} main_#t~switch158#1 := main_#t~switch158#1 || 7 == main_~_hj_k~1#1; {35277#false} is VALID [2022-02-20 23:33:47,051 INFO L290 TraceCheckUtils]: 72: Hoare triple {35277#false} assume main_#t~switch158#1;call main_#t~mem163#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~mem163#1 % 256);havoc main_#t~mem163#1; {35277#false} is VALID [2022-02-20 23:33:47,051 INFO L290 TraceCheckUtils]: 73: Hoare triple {35277#false} main_#t~switch158#1 := main_#t~switch158#1 || 6 == main_~_hj_k~1#1; {35277#false} is VALID [2022-02-20 23:33:47,051 INFO L290 TraceCheckUtils]: 74: Hoare triple {35277#false} assume main_#t~switch158#1;call main_#t~mem164#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~mem164#1 % 256);havoc main_#t~mem164#1; {35277#false} is VALID [2022-02-20 23:33:47,052 INFO L290 TraceCheckUtils]: 75: Hoare triple {35277#false} main_#t~switch158#1 := main_#t~switch158#1 || 5 == main_~_hj_k~1#1; {35277#false} is VALID [2022-02-20 23:33:47,052 INFO L290 TraceCheckUtils]: 76: Hoare triple {35277#false} assume main_#t~switch158#1;call main_#t~mem165#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~mem165#1 % 256;havoc main_#t~mem165#1; {35277#false} is VALID [2022-02-20 23:33:47,052 INFO L290 TraceCheckUtils]: 77: Hoare triple {35277#false} main_#t~switch158#1 := main_#t~switch158#1 || 4 == main_~_hj_k~1#1; {35277#false} is VALID [2022-02-20 23:33:47,052 INFO L290 TraceCheckUtils]: 78: Hoare triple {35277#false} assume main_#t~switch158#1;call main_#t~mem166#1 := read~int(main_~_hj_key~1#1.base, 3 + main_~_hj_key~1#1.offset, 1);main_~_hj_i~1#1 := main_~_hj_i~1#1 + 16777216 * (main_#t~mem166#1 % 256);havoc main_#t~mem166#1; {35277#false} is VALID [2022-02-20 23:33:47,052 INFO L290 TraceCheckUtils]: 79: Hoare triple {35277#false} main_#t~switch158#1 := main_#t~switch158#1 || 3 == main_~_hj_k~1#1; {35277#false} is VALID [2022-02-20 23:33:47,052 INFO L290 TraceCheckUtils]: 80: Hoare triple {35277#false} assume main_#t~switch158#1;call main_#t~mem167#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~mem167#1 % 256);havoc main_#t~mem167#1; {35277#false} is VALID [2022-02-20 23:33:47,052 INFO L290 TraceCheckUtils]: 81: Hoare triple {35277#false} main_#t~switch158#1 := main_#t~switch158#1 || 2 == main_~_hj_k~1#1; {35277#false} is VALID [2022-02-20 23:33:47,052 INFO L290 TraceCheckUtils]: 82: Hoare triple {35277#false} assume main_#t~switch158#1;call main_#t~mem168#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~mem168#1 % 256);havoc main_#t~mem168#1; {35277#false} is VALID [2022-02-20 23:33:47,053 INFO L290 TraceCheckUtils]: 83: Hoare triple {35277#false} main_#t~switch158#1 := main_#t~switch158#1 || 1 == main_~_hj_k~1#1; {35277#false} is VALID [2022-02-20 23:33:47,053 INFO L290 TraceCheckUtils]: 84: Hoare triple {35277#false} assume main_#t~switch158#1;call main_#t~mem169#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~mem169#1 % 256;havoc main_#t~mem169#1; {35277#false} is VALID [2022-02-20 23:33:47,053 INFO L290 TraceCheckUtils]: 85: Hoare triple {35277#false} havoc main_#t~switch158#1; {35277#false} is VALID [2022-02-20 23:33:47,053 INFO L290 TraceCheckUtils]: 86: Hoare triple {35277#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)))); {35277#false} is VALID [2022-02-20 23:33:47,053 INFO L290 TraceCheckUtils]: 87: Hoare triple {35277#false} goto; {35277#false} is VALID [2022-02-20 23:33:47,054 INFO L290 TraceCheckUtils]: 88: Hoare triple {35277#false} goto; {35277#false} is VALID [2022-02-20 23:33:47,054 INFO L290 TraceCheckUtils]: 89: Hoare triple {35277#false} goto; {35277#false} is VALID [2022-02-20 23:33:47,054 INFO L290 TraceCheckUtils]: 90: Hoare triple {35277#false} main_~tmp~0#1.base, main_~tmp~0#1.offset := 0, 0; {35277#false} is VALID [2022-02-20 23:33:47,054 INFO L290 TraceCheckUtils]: 91: Hoare triple {35277#false} assume !(main_~users~0#1.base != 0 || main_~users~0#1.offset != 0); {35277#false} is VALID [2022-02-20 23:33:47,055 INFO L290 TraceCheckUtils]: 92: Hoare triple {35277#false} goto; {35277#false} is VALID [2022-02-20 23:33:47,055 INFO L290 TraceCheckUtils]: 93: Hoare triple {35277#false} goto; {35277#false} is VALID [2022-02-20 23:33:47,055 INFO L290 TraceCheckUtils]: 94: Hoare triple {35277#false} assume !(main_~tmp~0#1.base != 0 || main_~tmp~0#1.offset != 0); {35277#false} is VALID [2022-02-20 23:33:47,059 INFO L290 TraceCheckUtils]: 95: Hoare triple {35277#false} assume !false; {35277#false} is VALID [2022-02-20 23:33:47,060 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 23:33:47,060 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 23:33:47,061 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 23:33:47,061 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1131338699] [2022-02-20 23:33:47,061 WARN L317 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-02-20 23:33:47,061 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [493206285] [2022-02-20 23:33:47,061 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [493206285] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:33:47,061 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:33:47,062 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-02-20 23:33:47,062 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [873403821] [2022-02-20 23:33:47,062 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:33:47,063 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 24.0) internal successors, (96), 4 states have internal predecessors, (96), 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 96 [2022-02-20 23:33:47,063 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:33:47,063 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 24.0) internal successors, (96), 4 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:33:47,129 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 96 edges. 96 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:33:47,129 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-02-20 23:33:47,129 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 23:33:47,129 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-02-20 23:33:47,130 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-02-20 23:33:47,132 INFO L87 Difference]: Start difference. First operand 1205 states and 2251 transitions. Second operand has 4 states, 4 states have (on average 24.0) internal successors, (96), 4 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:33:51,678 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:33:51,678 INFO L93 Difference]: Finished difference Result 2398 states and 4490 transitions. [2022-02-20 23:33:51,679 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-02-20 23:33:51,679 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 24.0) internal successors, (96), 4 states have internal predecessors, (96), 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 96 [2022-02-20 23:33:51,679 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:33:51,679 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 24.0) internal successors, (96), 4 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:33:51,919 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 4427 transitions. [2022-02-20 23:33:51,920 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 24.0) internal successors, (96), 4 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:33:52,125 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 4427 transitions. [2022-02-20 23:33:52,125 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 4427 transitions. [2022-02-20 23:33:54,316 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 4427 edges. 4427 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:33:54,388 INFO L225 Difference]: With dead ends: 2398 [2022-02-20 23:33:54,388 INFO L226 Difference]: Without dead ends: 1197 [2022-02-20 23:33:54,391 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 96 GetRequests, 93 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-02-20 23:33:54,392 INFO L933 BasicCegarLoop]: 2189 mSDtfsCounter, 1182 mSDsluCounter, 2697 mSDsCounter, 0 mSdLazyCounter, 42 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1685 SdHoareTripleChecker+Valid, 4886 SdHoareTripleChecker+Invalid, 66 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 42 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 23:33:54,392 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1685 Valid, 4886 Invalid, 66 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 42 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 23:33:54,394 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1197 states. [2022-02-20 23:33:54,707 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1197 to 1191. [2022-02-20 23:33:54,708 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:33:54,710 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1197 states. Second operand has 1191 states, 684 states have (on average 1.7894736842105263) internal successors, (1224), 1185 states have internal predecessors, (1224), 503 states have call successors, (503), 2 states have call predecessors, (503), 2 states have return successors, (503), 4 states have call predecessors, (503), 503 states have call successors, (503) [2022-02-20 23:33:54,713 INFO L74 IsIncluded]: Start isIncluded. First operand 1197 states. Second operand has 1191 states, 684 states have (on average 1.7894736842105263) internal successors, (1224), 1185 states have internal predecessors, (1224), 503 states have call successors, (503), 2 states have call predecessors, (503), 2 states have return successors, (503), 4 states have call predecessors, (503), 503 states have call successors, (503) [2022-02-20 23:33:54,715 INFO L87 Difference]: Start difference. First operand 1197 states. Second operand has 1191 states, 684 states have (on average 1.7894736842105263) internal successors, (1224), 1185 states have internal predecessors, (1224), 503 states have call successors, (503), 2 states have call predecessors, (503), 2 states have return successors, (503), 4 states have call predecessors, (503), 503 states have call successors, (503) [2022-02-20 23:33:54,955 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:33:54,955 INFO L93 Difference]: Finished difference Result 1197 states and 2236 transitions. [2022-02-20 23:33:54,955 INFO L276 IsEmpty]: Start isEmpty. Operand 1197 states and 2236 transitions. [2022-02-20 23:33:54,960 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:33:54,960 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:33:54,963 INFO L74 IsIncluded]: Start isIncluded. First operand has 1191 states, 684 states have (on average 1.7894736842105263) internal successors, (1224), 1185 states have internal predecessors, (1224), 503 states have call successors, (503), 2 states have call predecessors, (503), 2 states have return successors, (503), 4 states have call predecessors, (503), 503 states have call successors, (503) Second operand 1197 states. [2022-02-20 23:33:54,965 INFO L87 Difference]: Start difference. First operand has 1191 states, 684 states have (on average 1.7894736842105263) internal successors, (1224), 1185 states have internal predecessors, (1224), 503 states have call successors, (503), 2 states have call predecessors, (503), 2 states have return successors, (503), 4 states have call predecessors, (503), 503 states have call successors, (503) Second operand 1197 states. [2022-02-20 23:33:55,167 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:33:55,167 INFO L93 Difference]: Finished difference Result 1197 states and 2236 transitions. [2022-02-20 23:33:55,167 INFO L276 IsEmpty]: Start isEmpty. Operand 1197 states and 2236 transitions. [2022-02-20 23:33:55,171 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:33:55,172 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:33:55,172 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:33:55,172 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:33:55,174 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1191 states, 684 states have (on average 1.7894736842105263) internal successors, (1224), 1185 states have internal predecessors, (1224), 503 states have call successors, (503), 2 states have call predecessors, (503), 2 states have return successors, (503), 4 states have call predecessors, (503), 503 states have call successors, (503) [2022-02-20 23:33:55,384 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1191 states to 1191 states and 2230 transitions. [2022-02-20 23:33:55,384 INFO L78 Accepts]: Start accepts. Automaton has 1191 states and 2230 transitions. Word has length 96 [2022-02-20 23:33:55,384 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:33:55,385 INFO L470 AbstractCegarLoop]: Abstraction has 1191 states and 2230 transitions. [2022-02-20 23:33:55,385 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 24.0) internal successors, (96), 4 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:33:55,385 INFO L276 IsEmpty]: Start isEmpty. Operand 1191 states and 2230 transitions. [2022-02-20 23:33:55,387 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2022-02-20 23:33:55,388 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:33:55,388 INFO L514 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 23:33:55,425 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-02-20 23:33:55,609 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 23:33:55,609 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 23:33:55,610 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:33:55,610 INFO L85 PathProgramCache]: Analyzing trace with hash 432450363, now seen corresponding path program 1 times [2022-02-20 23:33:55,610 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 23:33:55,610 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1857993712] [2022-02-20 23:33:55,611 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:33:55,611 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 23:33:55,709 ERROR L252 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-02-20 23:33:55,710 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [807276296] [2022-02-20 23:33:55,711 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:33:55,711 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 23:33:55,711 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 23:33:55,728 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-02-20 23:33:55,729 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-02-20 23:33:56,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:33:56,357 INFO L263 TraceCheckSpWp]: Trace formula consists of 1639 conjuncts, 4 conjunts are in the unsatisfiable core [2022-02-20 23:33:56,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:33:56,389 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 23:33:56,591 INFO L290 TraceCheckUtils]: 0: Hoare triple {43153#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(21, 2);~count_int_int~0 := 0; {43153#true} is VALID [2022-02-20 23:33:56,591 INFO L290 TraceCheckUtils]: 1: Hoare triple {43153#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~mem5#1, main_#t~post6#1, main_#t~mem7#1, main_#t~mem147#1, main_#t~mem146#1, main_#t~mem148#1, main_#t~mem149#1, main_#t~mem151#1, main_#t~mem150#1, main_#t~mem152#1, main_#t~mem153#1, main_#t~mem155#1, main_#t~mem154#1, main_#t~mem156#1, main_#t~mem157#1, main_#t~switch158#1, main_#t~mem159#1, main_#t~mem160#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_~_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~mem170#1.base, main_#t~mem170#1.offset, main_#t~mem171#1, main_#t~mem172#1.base, main_#t~mem172#1.offset, main_#t~mem173#1.base, main_#t~mem173#1.offset, main_#t~mem174#1.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, main_#t~mem180#1, main_#t~mem181#1, main_#t~short182#1, main_#t~mem183#1.base, main_#t~mem183#1.offset, main_#t~ret184#1, main_#t~mem185#1.base, main_#t~mem185#1.offset, main_#t~mem186#1.base, main_#t~mem186#1.offset, main_#t~mem187#1.base, main_#t~mem187#1.offset, main_#t~mem188#1, main_~_hf_bkt~0#1, main_~_hf_hashv~0#1, main_#t~mem189#1, main_#t~mem190#1, main_#t~mem144#1, main_#t~mem145#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); {43153#true} is VALID [2022-02-20 23:33:56,592 INFO L290 TraceCheckUtils]: 2: Hoare triple {43153#true} call main_#t~mem7#1 := read~int(main_~#i~0#1.base, main_~#i~0#1.offset, 4); {43153#true} is VALID [2022-02-20 23:33:56,592 INFO L290 TraceCheckUtils]: 3: Hoare triple {43153#true} assume !!(main_#t~mem7#1 < 1000);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; {43153#true} is VALID [2022-02-20 23:33:56,592 INFO L290 TraceCheckUtils]: 4: Hoare triple {43153#true} assume !(main_~user~0#1.base == 0 && main_~user~0#1.offset == 0); {43153#true} is VALID [2022-02-20 23:33:56,592 INFO L290 TraceCheckUtils]: 5: Hoare triple {43153#true} call main_#t~mem9#1 := read~int(main_~#i~0#1.base, main_~#i~0#1.offset, 4);call write~int(main_#t~mem9#1, main_~user~0#1.base, main_~user~0#1.offset, 4);havoc main_#t~mem9#1;call main_#t~mem10#1 := read~int(main_~#i~0#1.base, main_~#i~0#1.offset, 4);call main_#t~mem11#1 := read~int(main_~#i~0#1.base, main_~#i~0#1.offset, 4);call write~int(main_#t~mem10#1 * main_#t~mem11#1, main_~user~0#1.base, 4 + main_~user~0#1.offset, 4);havoc main_#t~mem10#1;havoc main_#t~mem11#1; {43153#true} is VALID [2022-02-20 23:33:56,592 INFO L290 TraceCheckUtils]: 6: Hoare triple {43153#true} havoc main_~_ha_hashv~0#1; {43153#true} is VALID [2022-02-20 23:33:56,592 INFO L290 TraceCheckUtils]: 7: Hoare triple {43153#true} goto; {43153#true} is VALID [2022-02-20 23:33:56,593 INFO L290 TraceCheckUtils]: 8: Hoare triple {43153#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; {43153#true} is VALID [2022-02-20 23:33:56,593 INFO L290 TraceCheckUtils]: 9: Hoare triple {43153#true} assume !(main_~_hj_k~0#1 % 4294967296 >= 12); {43153#true} is VALID [2022-02-20 23:33:56,593 INFO L290 TraceCheckUtils]: 10: Hoare triple {43153#true} main_~_ha_hashv~0#1 := 4 + main_~_ha_hashv~0#1;main_#t~switch24#1 := 11 == main_~_hj_k~0#1; {43153#true} is VALID [2022-02-20 23:33:56,593 INFO L290 TraceCheckUtils]: 11: Hoare triple {43153#true} assume !main_#t~switch24#1; {43153#true} is VALID [2022-02-20 23:33:56,593 INFO L290 TraceCheckUtils]: 12: Hoare triple {43153#true} main_#t~switch24#1 := main_#t~switch24#1 || 10 == main_~_hj_k~0#1; {43153#true} is VALID [2022-02-20 23:33:56,593 INFO L290 TraceCheckUtils]: 13: Hoare triple {43153#true} assume !main_#t~switch24#1; {43153#true} is VALID [2022-02-20 23:33:56,593 INFO L290 TraceCheckUtils]: 14: Hoare triple {43153#true} main_#t~switch24#1 := main_#t~switch24#1 || 9 == main_~_hj_k~0#1; {43153#true} is VALID [2022-02-20 23:33:56,594 INFO L290 TraceCheckUtils]: 15: Hoare triple {43153#true} assume !main_#t~switch24#1; {43153#true} is VALID [2022-02-20 23:33:56,594 INFO L290 TraceCheckUtils]: 16: Hoare triple {43153#true} main_#t~switch24#1 := main_#t~switch24#1 || 8 == main_~_hj_k~0#1; {43153#true} is VALID [2022-02-20 23:33:56,594 INFO L290 TraceCheckUtils]: 17: Hoare triple {43153#true} assume !main_#t~switch24#1; {43153#true} is VALID [2022-02-20 23:33:56,594 INFO L290 TraceCheckUtils]: 18: Hoare triple {43153#true} main_#t~switch24#1 := main_#t~switch24#1 || 7 == main_~_hj_k~0#1; {43153#true} is VALID [2022-02-20 23:33:56,594 INFO L290 TraceCheckUtils]: 19: Hoare triple {43153#true} assume !main_#t~switch24#1; {43153#true} is VALID [2022-02-20 23:33:56,594 INFO L290 TraceCheckUtils]: 20: Hoare triple {43153#true} main_#t~switch24#1 := main_#t~switch24#1 || 6 == main_~_hj_k~0#1; {43153#true} is VALID [2022-02-20 23:33:56,594 INFO L290 TraceCheckUtils]: 21: Hoare triple {43153#true} assume !main_#t~switch24#1; {43153#true} is VALID [2022-02-20 23:33:56,594 INFO L290 TraceCheckUtils]: 22: Hoare triple {43153#true} main_#t~switch24#1 := main_#t~switch24#1 || 5 == main_~_hj_k~0#1; {43153#true} is VALID [2022-02-20 23:33:56,595 INFO L290 TraceCheckUtils]: 23: Hoare triple {43153#true} assume !main_#t~switch24#1; {43153#true} is VALID [2022-02-20 23:33:56,595 INFO L290 TraceCheckUtils]: 24: Hoare triple {43153#true} main_#t~switch24#1 := main_#t~switch24#1 || 4 == main_~_hj_k~0#1; {43153#true} is VALID [2022-02-20 23:33:56,595 INFO L290 TraceCheckUtils]: 25: Hoare triple {43153#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; {43153#true} is VALID [2022-02-20 23:33:56,595 INFO L290 TraceCheckUtils]: 26: Hoare triple {43153#true} main_#t~switch24#1 := main_#t~switch24#1 || 3 == main_~_hj_k~0#1; {43153#true} is VALID [2022-02-20 23:33:56,595 INFO L290 TraceCheckUtils]: 27: Hoare triple {43153#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; {43153#true} is VALID [2022-02-20 23:33:56,595 INFO L290 TraceCheckUtils]: 28: Hoare triple {43153#true} main_#t~switch24#1 := main_#t~switch24#1 || 2 == main_~_hj_k~0#1; {43153#true} is VALID [2022-02-20 23:33:56,595 INFO L290 TraceCheckUtils]: 29: Hoare triple {43153#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; {43153#true} is VALID [2022-02-20 23:33:56,596 INFO L290 TraceCheckUtils]: 30: Hoare triple {43153#true} main_#t~switch24#1 := main_#t~switch24#1 || 1 == main_~_hj_k~0#1; {43153#true} is VALID [2022-02-20 23:33:56,596 INFO L290 TraceCheckUtils]: 31: Hoare triple {43153#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; {43153#true} is VALID [2022-02-20 23:33:56,596 INFO L290 TraceCheckUtils]: 32: Hoare triple {43153#true} havoc main_#t~switch24#1; {43153#true} is VALID [2022-02-20 23:33:56,596 INFO L290 TraceCheckUtils]: 33: Hoare triple {43153#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)))); {43153#true} is VALID [2022-02-20 23:33:56,596 INFO L290 TraceCheckUtils]: 34: Hoare triple {43153#true} goto; {43153#true} is VALID [2022-02-20 23:33:56,596 INFO L290 TraceCheckUtils]: 35: Hoare triple {43153#true} goto; {43153#true} is VALID [2022-02-20 23:33:56,596 INFO L290 TraceCheckUtils]: 36: Hoare triple {43153#true} goto; {43153#true} is VALID [2022-02-20 23:33:56,597 INFO L290 TraceCheckUtils]: 37: Hoare triple {43153#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); {43153#true} is VALID [2022-02-20 23:33:56,597 INFO L290 TraceCheckUtils]: 38: Hoare triple {43153#true} 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; {43153#true} is VALID [2022-02-20 23:33:56,597 INFO L290 TraceCheckUtils]: 39: Hoare triple {43153#true} 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; {43153#true} is VALID [2022-02-20 23:33:56,597 INFO L290 TraceCheckUtils]: 40: Hoare triple {43153#true} goto; {43153#true} is VALID [2022-02-20 23:33:56,597 INFO L290 TraceCheckUtils]: 41: Hoare triple {43153#true} 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; {43153#true} is VALID [2022-02-20 23:33:56,597 INFO L290 TraceCheckUtils]: 42: Hoare triple {43153#true} 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; {43153#true} is VALID [2022-02-20 23:33:56,597 INFO L290 TraceCheckUtils]: 43: Hoare triple {43153#true} goto; {43153#true} is VALID [2022-02-20 23:33:56,598 INFO L290 TraceCheckUtils]: 44: Hoare triple {43153#true} 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); {43153#true} is VALID [2022-02-20 23:33:56,598 INFO L290 TraceCheckUtils]: 45: Hoare triple {43153#true} 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; {43153#true} is VALID [2022-02-20 23:33:56,598 INFO L290 TraceCheckUtils]: 46: Hoare triple {43153#true} 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; {43153#true} is VALID [2022-02-20 23:33:56,598 INFO L290 TraceCheckUtils]: 47: Hoare triple {43153#true} 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; {43153#true} is VALID [2022-02-20 23:33:56,598 INFO L290 TraceCheckUtils]: 48: Hoare triple {43153#true} 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; {43153#true} is VALID [2022-02-20 23:33:56,598 INFO L290 TraceCheckUtils]: 49: Hoare triple {43153#true} goto; {43153#true} is VALID [2022-02-20 23:33:56,598 INFO L290 TraceCheckUtils]: 50: Hoare triple {43153#true} goto; {43153#true} is VALID [2022-02-20 23:33:56,599 INFO L290 TraceCheckUtils]: 51: Hoare triple {43153#true} goto; {43153#true} is VALID [2022-02-20 23:33:56,599 INFO L290 TraceCheckUtils]: 52: Hoare triple {43153#true} goto; {43153#true} is VALID [2022-02-20 23:33:56,599 INFO L290 TraceCheckUtils]: 53: Hoare triple {43153#true} 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;call write~int(1 + main_#t~post6#1, main_~#i~0#1.base, main_~#i~0#1.offset, 4);havoc main_#t~mem5#1;havoc main_#t~post6#1; {43153#true} is VALID [2022-02-20 23:33:56,599 INFO L290 TraceCheckUtils]: 54: Hoare triple {43153#true} call main_#t~mem7#1 := read~int(main_~#i~0#1.base, main_~#i~0#1.offset, 4); {43153#true} is VALID [2022-02-20 23:33:56,599 INFO L290 TraceCheckUtils]: 55: Hoare triple {43153#true} assume !(main_#t~mem7#1 < 1000);havoc main_#t~mem7#1; {43153#true} is VALID [2022-02-20 23:33:56,599 INFO L290 TraceCheckUtils]: 56: Hoare triple {43153#true} call write~int(0, main_~#i~0#1.base, main_~#i~0#1.offset, 4); {43153#true} is VALID [2022-02-20 23:33:56,599 INFO L290 TraceCheckUtils]: 57: Hoare triple {43153#true} call main_#t~mem145#1 := read~int(main_~#i~0#1.base, main_~#i~0#1.offset, 4); {43153#true} is VALID [2022-02-20 23:33:56,599 INFO L290 TraceCheckUtils]: 58: Hoare triple {43153#true} assume !!(main_#t~mem145#1 < 1000);havoc main_#t~mem145#1; {43153#true} is VALID [2022-02-20 23:33:56,600 INFO L290 TraceCheckUtils]: 59: Hoare triple {43153#true} havoc main_~_hf_hashv~0#1; {43153#true} is VALID [2022-02-20 23:33:56,600 INFO L290 TraceCheckUtils]: 60: Hoare triple {43153#true} goto; {43153#true} is VALID [2022-02-20 23:33:56,600 INFO L290 TraceCheckUtils]: 61: Hoare triple {43153#true} 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; {43341#(<= |ULTIMATE.start_main_~_hj_k~1#1| 4)} is VALID [2022-02-20 23:33:56,601 INFO L290 TraceCheckUtils]: 62: Hoare triple {43341#(<= |ULTIMATE.start_main_~_hj_k~1#1| 4)} assume !(main_~_hj_k~1#1 % 4294967296 >= 12); {43341#(<= |ULTIMATE.start_main_~_hj_k~1#1| 4)} is VALID [2022-02-20 23:33:56,601 INFO L290 TraceCheckUtils]: 63: Hoare triple {43341#(<= |ULTIMATE.start_main_~_hj_k~1#1| 4)} main_~_hf_hashv~0#1 := 4 + main_~_hf_hashv~0#1;main_#t~switch158#1 := 11 == main_~_hj_k~1#1; {43341#(<= |ULTIMATE.start_main_~_hj_k~1#1| 4)} is VALID [2022-02-20 23:33:56,601 INFO L290 TraceCheckUtils]: 64: Hoare triple {43341#(<= |ULTIMATE.start_main_~_hj_k~1#1| 4)} assume !main_#t~switch158#1; {43351#(and (<= |ULTIMATE.start_main_~_hj_k~1#1| 4) (not |ULTIMATE.start_main_#t~switch158#1|))} is VALID [2022-02-20 23:33:56,602 INFO L290 TraceCheckUtils]: 65: Hoare triple {43351#(and (<= |ULTIMATE.start_main_~_hj_k~1#1| 4) (not |ULTIMATE.start_main_#t~switch158#1|))} main_#t~switch158#1 := main_#t~switch158#1 || 10 == main_~_hj_k~1#1; {43355#(not |ULTIMATE.start_main_#t~switch158#1|)} is VALID [2022-02-20 23:33:56,602 INFO L290 TraceCheckUtils]: 66: Hoare triple {43355#(not |ULTIMATE.start_main_#t~switch158#1|)} assume main_#t~switch158#1;call main_#t~mem160#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~mem160#1 % 256);havoc main_#t~mem160#1; {43154#false} is VALID [2022-02-20 23:33:56,602 INFO L290 TraceCheckUtils]: 67: Hoare triple {43154#false} main_#t~switch158#1 := main_#t~switch158#1 || 9 == main_~_hj_k~1#1; {43154#false} is VALID [2022-02-20 23:33:56,602 INFO L290 TraceCheckUtils]: 68: Hoare triple {43154#false} assume main_#t~switch158#1;call main_#t~mem161#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~mem161#1 % 256);havoc main_#t~mem161#1; {43154#false} is VALID [2022-02-20 23:33:56,602 INFO L290 TraceCheckUtils]: 69: Hoare triple {43154#false} main_#t~switch158#1 := main_#t~switch158#1 || 8 == main_~_hj_k~1#1; {43154#false} is VALID [2022-02-20 23:33:56,603 INFO L290 TraceCheckUtils]: 70: Hoare triple {43154#false} assume main_#t~switch158#1;call main_#t~mem162#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~mem162#1 % 256);havoc main_#t~mem162#1; {43154#false} is VALID [2022-02-20 23:33:56,603 INFO L290 TraceCheckUtils]: 71: Hoare triple {43154#false} main_#t~switch158#1 := main_#t~switch158#1 || 7 == main_~_hj_k~1#1; {43154#false} is VALID [2022-02-20 23:33:56,603 INFO L290 TraceCheckUtils]: 72: Hoare triple {43154#false} assume main_#t~switch158#1;call main_#t~mem163#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~mem163#1 % 256);havoc main_#t~mem163#1; {43154#false} is VALID [2022-02-20 23:33:56,603 INFO L290 TraceCheckUtils]: 73: Hoare triple {43154#false} main_#t~switch158#1 := main_#t~switch158#1 || 6 == main_~_hj_k~1#1; {43154#false} is VALID [2022-02-20 23:33:56,603 INFO L290 TraceCheckUtils]: 74: Hoare triple {43154#false} assume main_#t~switch158#1;call main_#t~mem164#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~mem164#1 % 256);havoc main_#t~mem164#1; {43154#false} is VALID [2022-02-20 23:33:56,603 INFO L290 TraceCheckUtils]: 75: Hoare triple {43154#false} main_#t~switch158#1 := main_#t~switch158#1 || 5 == main_~_hj_k~1#1; {43154#false} is VALID [2022-02-20 23:33:56,603 INFO L290 TraceCheckUtils]: 76: Hoare triple {43154#false} assume main_#t~switch158#1;call main_#t~mem165#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~mem165#1 % 256;havoc main_#t~mem165#1; {43154#false} is VALID [2022-02-20 23:33:56,604 INFO L290 TraceCheckUtils]: 77: Hoare triple {43154#false} main_#t~switch158#1 := main_#t~switch158#1 || 4 == main_~_hj_k~1#1; {43154#false} is VALID [2022-02-20 23:33:56,604 INFO L290 TraceCheckUtils]: 78: Hoare triple {43154#false} assume main_#t~switch158#1;call main_#t~mem166#1 := read~int(main_~_hj_key~1#1.base, 3 + main_~_hj_key~1#1.offset, 1);main_~_hj_i~1#1 := main_~_hj_i~1#1 + 16777216 * (main_#t~mem166#1 % 256);havoc main_#t~mem166#1; {43154#false} is VALID [2022-02-20 23:33:56,604 INFO L290 TraceCheckUtils]: 79: Hoare triple {43154#false} main_#t~switch158#1 := main_#t~switch158#1 || 3 == main_~_hj_k~1#1; {43154#false} is VALID [2022-02-20 23:33:56,604 INFO L290 TraceCheckUtils]: 80: Hoare triple {43154#false} assume main_#t~switch158#1;call main_#t~mem167#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~mem167#1 % 256);havoc main_#t~mem167#1; {43154#false} is VALID [2022-02-20 23:33:56,604 INFO L290 TraceCheckUtils]: 81: Hoare triple {43154#false} main_#t~switch158#1 := main_#t~switch158#1 || 2 == main_~_hj_k~1#1; {43154#false} is VALID [2022-02-20 23:33:56,604 INFO L290 TraceCheckUtils]: 82: Hoare triple {43154#false} assume main_#t~switch158#1;call main_#t~mem168#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~mem168#1 % 256);havoc main_#t~mem168#1; {43154#false} is VALID [2022-02-20 23:33:56,604 INFO L290 TraceCheckUtils]: 83: Hoare triple {43154#false} main_#t~switch158#1 := main_#t~switch158#1 || 1 == main_~_hj_k~1#1; {43154#false} is VALID [2022-02-20 23:33:56,604 INFO L290 TraceCheckUtils]: 84: Hoare triple {43154#false} assume main_#t~switch158#1;call main_#t~mem169#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~mem169#1 % 256;havoc main_#t~mem169#1; {43154#false} is VALID [2022-02-20 23:33:56,605 INFO L290 TraceCheckUtils]: 85: Hoare triple {43154#false} havoc main_#t~switch158#1; {43154#false} is VALID [2022-02-20 23:33:56,605 INFO L290 TraceCheckUtils]: 86: Hoare triple {43154#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)))); {43154#false} is VALID [2022-02-20 23:33:56,605 INFO L290 TraceCheckUtils]: 87: Hoare triple {43154#false} goto; {43154#false} is VALID [2022-02-20 23:33:56,605 INFO L290 TraceCheckUtils]: 88: Hoare triple {43154#false} goto; {43154#false} is VALID [2022-02-20 23:33:56,605 INFO L290 TraceCheckUtils]: 89: Hoare triple {43154#false} goto; {43154#false} is VALID [2022-02-20 23:33:56,605 INFO L290 TraceCheckUtils]: 90: Hoare triple {43154#false} main_~tmp~0#1.base, main_~tmp~0#1.offset := 0, 0; {43154#false} is VALID [2022-02-20 23:33:56,605 INFO L290 TraceCheckUtils]: 91: Hoare triple {43154#false} assume !(main_~users~0#1.base != 0 || main_~users~0#1.offset != 0); {43154#false} is VALID [2022-02-20 23:33:56,606 INFO L290 TraceCheckUtils]: 92: Hoare triple {43154#false} goto; {43154#false} is VALID [2022-02-20 23:33:56,606 INFO L290 TraceCheckUtils]: 93: Hoare triple {43154#false} goto; {43154#false} is VALID [2022-02-20 23:33:56,606 INFO L290 TraceCheckUtils]: 94: Hoare triple {43154#false} assume !(main_~tmp~0#1.base != 0 || main_~tmp~0#1.offset != 0); {43154#false} is VALID [2022-02-20 23:33:56,606 INFO L290 TraceCheckUtils]: 95: Hoare triple {43154#false} assume !false; {43154#false} is VALID [2022-02-20 23:33:56,606 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-02-20 23:33:56,606 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 23:33:56,607 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 23:33:56,607 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1857993712] [2022-02-20 23:33:56,607 WARN L317 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-02-20 23:33:56,607 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [807276296] [2022-02-20 23:33:56,607 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [807276296] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:33:56,607 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:33:56,607 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-02-20 23:33:56,607 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1234184885] [2022-02-20 23:33:56,608 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:33:56,608 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 19.0) internal successors, (95), 5 states have internal predecessors, (95), 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 96 [2022-02-20 23:33:56,608 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:33:56,608 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 19.0) internal successors, (95), 5 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:33:56,675 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 95 edges. 95 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:33:56,676 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-20 23:33:56,676 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 23:33:56,676 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-20 23:33:56,676 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-02-20 23:33:56,676 INFO L87 Difference]: Start difference. First operand 1191 states and 2230 transitions. Second operand has 5 states, 5 states have (on average 19.0) internal successors, (95), 5 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:34:03,290 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:34:03,291 INFO L93 Difference]: Finished difference Result 2271 states and 4328 transitions. [2022-02-20 23:34:03,291 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-02-20 23:34:03,291 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 19.0) internal successors, (95), 5 states have internal predecessors, (95), 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 96 [2022-02-20 23:34:03,291 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:34:03,291 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 19.0) internal successors, (95), 5 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:34:03,530 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 4297 transitions. [2022-02-20 23:34:03,530 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 19.0) internal successors, (95), 5 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:34:03,719 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 4297 transitions. [2022-02-20 23:34:03,720 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 4297 transitions.