./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/uthash-2.0.2/uthash_FNV_test7-2.i --full-output -ea --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 03d7b7b3 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -ea -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/uthash-2.0.2/uthash_FNV_test7-2.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash ef232f94cb2adf03185aed5adfaef3f0eb9593ee06bfb5b3fbb6e4bc1dd6d041 --- Real Ultimate output --- This is Ultimate 0.2.2-dev-03d7b7b [2022-02-20 23:27:06,056 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-02-20 23:27:06,058 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-02-20 23:27:06,088 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-02-20 23:27:06,089 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-02-20 23:27:06,092 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-02-20 23:27:06,094 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-02-20 23:27:06,099 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-02-20 23:27:06,100 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-02-20 23:27:06,101 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-02-20 23:27:06,102 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-02-20 23:27:06,104 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-02-20 23:27:06,105 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-02-20 23:27:06,110 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-02-20 23:27:06,111 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-02-20 23:27:06,112 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-02-20 23:27:06,112 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-02-20 23:27:06,113 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-02-20 23:27:06,114 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-02-20 23:27:06,115 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-02-20 23:27:06,116 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-02-20 23:27:06,117 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-02-20 23:27:06,118 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-02-20 23:27:06,119 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-02-20 23:27:06,121 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-02-20 23:27:06,121 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-02-20 23:27:06,121 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-02-20 23:27:06,122 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-02-20 23:27:06,127 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-02-20 23:27:06,128 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-02-20 23:27:06,128 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-02-20 23:27:06,129 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-02-20 23:27:06,129 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-02-20 23:27:06,130 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-02-20 23:27:06,131 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-02-20 23:27:06,131 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-02-20 23:27:06,132 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-02-20 23:27:06,132 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-02-20 23:27:06,133 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-02-20 23:27:06,133 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-02-20 23:27:06,135 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-02-20 23:27:06,136 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:27:06,158 INFO L113 SettingsManager]: Loading preferences was successful [2022-02-20 23:27:06,165 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-02-20 23:27:06,166 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-02-20 23:27:06,166 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-02-20 23:27:06,167 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-02-20 23:27:06,167 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-02-20 23:27:06,168 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-02-20 23:27:06,168 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-02-20 23:27:06,168 INFO L138 SettingsManager]: * Use SBE=true [2022-02-20 23:27:06,168 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-02-20 23:27:06,169 INFO L138 SettingsManager]: * sizeof long=4 [2022-02-20 23:27:06,169 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-02-20 23:27:06,170 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-02-20 23:27:06,170 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-02-20 23:27:06,170 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-02-20 23:27:06,170 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-02-20 23:27:06,170 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-02-20 23:27:06,170 INFO L138 SettingsManager]: * sizeof long double=12 [2022-02-20 23:27:06,171 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-02-20 23:27:06,171 INFO L138 SettingsManager]: * Use constant arrays=true [2022-02-20 23:27:06,171 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-02-20 23:27:06,171 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-02-20 23:27:06,171 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-02-20 23:27:06,172 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-02-20 23:27:06,172 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 23:27:06,172 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-02-20 23:27:06,172 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-02-20 23:27:06,173 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-02-20 23:27:06,174 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-02-20 23:27:06,174 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-02-20 23:27:06,174 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-02-20 23:27:06,174 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-02-20 23:27:06,175 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-02-20 23:27:06,175 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 -> ef232f94cb2adf03185aed5adfaef3f0eb9593ee06bfb5b3fbb6e4bc1dd6d041 [2022-02-20 23:27:06,407 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-02-20 23:27:06,428 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-02-20 23:27:06,430 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-02-20 23:27:06,431 INFO L271 PluginConnector]: Initializing CDTParser... [2022-02-20 23:27:06,431 INFO L275 PluginConnector]: CDTParser initialized [2022-02-20 23:27:06,432 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/uthash-2.0.2/uthash_FNV_test7-2.i [2022-02-20 23:27:06,484 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c67984549/0205500895cd4e2db1dae9b124784a46/FLAG7cc7c734b [2022-02-20 23:27:06,922 INFO L306 CDTParser]: Found 1 translation units. [2022-02-20 23:27:06,923 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_FNV_test7-2.i [2022-02-20 23:27:06,939 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c67984549/0205500895cd4e2db1dae9b124784a46/FLAG7cc7c734b [2022-02-20 23:27:06,953 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c67984549/0205500895cd4e2db1dae9b124784a46 [2022-02-20 23:27:06,955 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-02-20 23:27:06,957 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-02-20 23:27:06,959 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-02-20 23:27:06,959 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-02-20 23:27:06,962 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-02-20 23:27:06,963 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 11:27:06" (1/1) ... [2022-02-20 23:27:06,964 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@31e9d9cf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:27:06, skipping insertion in model container [2022-02-20 23:27:06,964 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 11:27:06" (1/1) ... [2022-02-20 23:27:06,970 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-02-20 23:27:07,014 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-20 23:27:07,294 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_FNV_test7-2.i[33021,33034] [2022-02-20 23:27:07,442 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_FNV_test7-2.i[44124,44137] [2022-02-20 23:27:07,443 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_FNV_test7-2.i[44245,44258] [2022-02-20 23:27:07,474 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 23:27:07,483 INFO L203 MainTranslator]: Completed pre-run [2022-02-20 23:27:07,525 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_FNV_test7-2.i[33021,33034] [2022-02-20 23:27:07,593 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_FNV_test7-2.i[44124,44137] [2022-02-20 23:27:07,600 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_FNV_test7-2.i[44245,44258] [2022-02-20 23:27:07,614 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 23:27:07,657 INFO L208 MainTranslator]: Completed translation [2022-02-20 23:27:07,658 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:27:07 WrapperNode [2022-02-20 23:27:07,658 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-02-20 23:27:07,659 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-02-20 23:27:07,660 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-02-20 23:27:07,660 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-02-20 23:27:07,665 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:27:07" (1/1) ... [2022-02-20 23:27:07,716 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:27:07" (1/1) ... [2022-02-20 23:27:07,806 INFO L137 Inliner]: procedures = 176, calls = 328, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 1151 [2022-02-20 23:27:07,807 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-02-20 23:27:07,807 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-02-20 23:27:07,807 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-02-20 23:27:07,808 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-02-20 23:27:07,815 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:27:07" (1/1) ... [2022-02-20 23:27:07,823 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:27:07" (1/1) ... [2022-02-20 23:27:07,836 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:27:07" (1/1) ... [2022-02-20 23:27:07,846 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:27:07" (1/1) ... [2022-02-20 23:27:07,909 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:27:07" (1/1) ... [2022-02-20 23:27:07,926 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:27:07" (1/1) ... [2022-02-20 23:27:07,946 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:27:07" (1/1) ... [2022-02-20 23:27:07,955 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-02-20 23:27:07,961 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-02-20 23:27:07,962 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-02-20 23:27:07,963 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-02-20 23:27:07,964 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:27:07" (1/1) ... [2022-02-20 23:27:07,972 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 23:27:07,980 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 23:27:07,997 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:27:08,016 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:27:08,035 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-02-20 23:27:08,035 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-02-20 23:27:08,035 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset [2022-02-20 23:27:08,036 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset [2022-02-20 23:27:08,036 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-02-20 23:27:08,036 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-02-20 23:27:08,037 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-02-20 23:27:08,037 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-02-20 23:27:08,037 INFO L130 BoogieDeclarations]: Found specification of procedure memcmp [2022-02-20 23:27:08,037 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-02-20 23:27:08,037 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-02-20 23:27:08,037 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-02-20 23:27:08,038 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-02-20 23:27:08,038 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-02-20 23:27:08,252 INFO L234 CfgBuilder]: Building ICFG [2022-02-20 23:27:08,253 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-02-20 23:27:10,363 INFO L275 CfgBuilder]: Performing block encoding [2022-02-20 23:27:10,381 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-02-20 23:27:10,381 INFO L299 CfgBuilder]: Removed 72 assume(true) statements. [2022-02-20 23:27:10,383 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 11:27:10 BoogieIcfgContainer [2022-02-20 23:27:10,384 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-02-20 23:27:10,385 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-02-20 23:27:10,385 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-02-20 23:27:10,388 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-02-20 23:27:10,388 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.02 11:27:06" (1/3) ... [2022-02-20 23:27:10,389 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2a1f03a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 11:27:10, skipping insertion in model container [2022-02-20 23:27:10,389 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:27:07" (2/3) ... [2022-02-20 23:27:10,390 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2a1f03a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 11:27:10, skipping insertion in model container [2022-02-20 23:27:10,390 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 11:27:10" (3/3) ... [2022-02-20 23:27:10,391 INFO L111 eAbstractionObserver]: Analyzing ICFG uthash_FNV_test7-2.i [2022-02-20 23:27:10,395 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-02-20 23:27:10,395 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2022-02-20 23:27:10,433 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-02-20 23:27:10,443 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:27:10,443 INFO L340 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2022-02-20 23:27:10,465 INFO L276 IsEmpty]: Start isEmpty. Operand has 215 states, 208 states have (on average 1.6971153846153846) internal successors, (353), 210 states have internal predecessors, (353), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-02-20 23:27:10,468 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2022-02-20 23:27:10,468 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:27:10,469 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 23:27:10,469 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 23:27:10,473 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:27:10,474 INFO L85 PathProgramCache]: Analyzing trace with hash -2094566776, now seen corresponding path program 1 times [2022-02-20 23:27:10,482 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 23:27:10,482 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2143460643] [2022-02-20 23:27:10,482 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:27:10,483 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 23:27:10,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:27:10,616 INFO L290 TraceCheckUtils]: 0: Hoare triple {218#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); {218#true} is VALID [2022-02-20 23:27:10,617 INFO L290 TraceCheckUtils]: 1: Hoare triple {218#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc6#1.base, main_#t~malloc6#1.offset, main_#t~mem7#1, main_#t~mem8#1, main_#t~mem9#1, main_#t~mem11#1, main_#t~mem10#1, main_#t~mem12#1, main_#t~mem13#1, main_#t~mem15#1, main_#t~mem14#1, main_#t~mem16#1, main_#t~mem17#1, main_#t~mem19#1, main_#t~mem18#1, main_#t~mem20#1, main_#t~mem21#1, main_#t~switch22#1, main_#t~mem23#1, main_#t~mem24#1, main_#t~mem25#1, main_#t~mem26#1, main_#t~mem27#1, main_#t~mem28#1, main_#t~mem29#1, main_#t~mem30#1, main_#t~mem31#1, main_#t~mem32#1, main_#t~mem33#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~malloc34#1.base, main_#t~malloc34#1.offset, main_#t~mem35#1.base, main_#t~mem35#1.offset, main_#t~mem36#1.base, main_#t~mem36#1.offset, main_#t~memset~res37#1.base, main_#t~memset~res37#1.offset, main_#t~mem38#1.base, main_#t~mem38#1.offset, main_#t~mem39#1.base, main_#t~mem39#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~malloc43#1.base, main_#t~malloc43#1.offset, main_#t~mem44#1.base, main_#t~mem44#1.offset, main_#t~mem45#1.base, main_#t~mem45#1.offset, main_#t~mem46#1.base, main_#t~mem46#1.offset, main_#t~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~memset~res50#1.base, main_#t~memset~res50#1.offset, main_#t~mem51#1.base, main_#t~mem51#1.offset, main_#t~mem52#1.base, main_#t~mem52#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, main_#t~mem56#1.base, main_#t~mem56#1.offset, main_#t~mem57#1.base, main_#t~mem57#1.offset, main_#t~mem58#1.base, main_#t~mem58#1.offset, main_#t~mem59#1.base, main_#t~mem59#1.offset, main_#t~mem60#1, main_#t~post61#1, main_#t~mem62#1.base, main_#t~mem62#1.offset, main_#t~mem63#1, main_#t~mem64#1.base, main_#t~mem64#1.offset, main_#t~mem65#1.base, main_#t~mem65#1.offset, main_#t~mem66#1, main_#t~post67#1, main_#t~mem68#1.base, main_#t~mem68#1.offset, main_#t~mem69#1.base, main_#t~mem69#1.offset, main_#t~mem70#1.base, main_#t~mem70#1.offset, main_#t~mem72#1, main_#t~mem71#1, main_#t~mem73#1.base, main_#t~mem73#1.offset, main_#t~mem74#1, main_#t~short75#1, main_#t~mem76#1.base, main_#t~mem76#1.offset, main_#t~mem77#1, main_#t~malloc78#1.base, main_#t~malloc78#1.offset, main_#t~mem79#1.base, main_#t~mem79#1.offset, main_#t~mem80#1.base, main_#t~mem80#1.offset, main_#t~mem81#1.base, main_#t~mem81#1.offset, main_#t~mem82#1, main_#t~memset~res83#1.base, main_#t~memset~res83#1.offset, main_#t~mem84#1.base, main_#t~mem84#1.offset, main_#t~mem85#1.base, main_#t~mem85#1.offset, main_#t~mem88#1, main_#t~mem86#1.base, main_#t~mem86#1.offset, main_#t~mem87#1, main_#t~mem89#1.base, main_#t~mem89#1.offset, main_#t~mem92#1, main_#t~mem90#1.base, main_#t~mem90#1.offset, main_#t~mem91#1, main_#t~ite93#1, main_#t~mem94#1.base, main_#t~mem94#1.offset, main_#t~mem98#1.base, main_#t~mem98#1.offset, main_#t~mem99#1.base, main_#t~mem99#1.offset, main_#t~mem100#1.base, main_#t~mem100#1.offset, main_#t~mem101#1.base, main_#t~mem101#1.offset, main_#t~mem104#1, main_#t~mem102#1.base, main_#t~mem102#1.offset, main_#t~mem103#1, main_#t~mem105#1.base, main_#t~mem105#1.offset, main_#t~mem106#1, main_#t~pre107#1, main_#t~mem108#1.base, main_#t~mem108#1.offset, main_#t~mem109#1, main_#t~mem110#1.base, main_#t~mem110#1.offset, main_#t~mem111#1, main_#t~post112#1, main_#t~mem116#1, main_#t~mem114#1, main_#t~mem113#1.base, main_#t~mem113#1.offset, main_#t~mem115#1, main_#t~mem117#1, main_#t~post118#1, main_#t~mem119#1.base, main_#t~mem119#1.offset, main_#t~mem120#1.base, main_#t~mem120#1.offset, main_#t~mem121#1.base, main_#t~mem121#1.offset, main_#t~post95#1, main_#t~mem96#1.base, main_#t~mem96#1.offset, main_#t~mem97#1, main_#t~mem122#1.base, main_#t~mem122#1.offset, main_#t~mem123#1.base, main_#t~mem123#1.offset, main_#t~mem124#1.base, main_#t~mem124#1.offset, main_#t~mem125#1, main_#t~mem126#1.base, main_#t~mem126#1.offset, main_#t~mem127#1, main_#t~post128#1, main_#t~mem129#1.base, main_#t~mem129#1.offset, main_#t~mem130#1.base, main_#t~mem130#1.offset, main_#t~mem131#1.base, main_#t~mem131#1.offset, main_#t~mem132#1.base, main_#t~mem132#1.offset, main_#t~mem135#1, main_#t~mem133#1.base, main_#t~mem133#1.offset, main_#t~mem134#1, main_#t~ite138#1, main_#t~mem136#1.base, main_#t~mem136#1.offset, main_#t~mem137#1, main_#t~mem139#1.base, main_#t~mem139#1.offset, main_#t~mem140#1, main_#t~mem141#1.base, main_#t~mem141#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~mem3#1, main_#t~post4#1, main_#t~mem5#1, main_#t~mem146#1, main_#t~mem145#1, main_#t~mem147#1, main_#t~mem148#1, main_#t~mem150#1, main_#t~mem149#1, main_#t~mem151#1, main_#t~mem152#1, main_#t~mem154#1, main_#t~mem153#1, main_#t~mem155#1, main_#t~mem156#1, main_#t~switch157#1, main_#t~mem158#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_~_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~mem169#1.base, main_#t~mem169#1.offset, main_#t~mem170#1, main_#t~mem171#1.base, main_#t~mem171#1.offset, 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, main_#t~mem179#1, main_#t~mem180#1, main_#t~short181#1, main_#t~mem182#1.base, main_#t~mem182#1.offset, main_#t~ret183#1, main_#t~mem184#1.base, main_#t~mem184#1.offset, main_#t~mem185#1.base, main_#t~mem185#1.offset, main_#t~mem186#1.base, main_#t~mem186#1.offset, main_#t~mem187#1, main_~_hf_bkt~0#1, main_~_hf_hashv~0#1, main_#t~mem188#1.base, main_#t~mem188#1.offset, main_#t~mem189#1.base, main_#t~mem189#1.offset, main_#t~short190#1, main_#t~mem191#1.base, main_#t~mem191#1.offset, main_#t~mem192#1.base, main_#t~mem192#1.offset, main_#t~mem193#1.base, main_#t~mem193#1.offset, main_#t~mem194#1.base, main_#t~mem194#1.offset, main_#t~mem195#1.base, main_#t~mem195#1.offset, main_#t~mem196#1.base, main_#t~mem196#1.offset, main_#t~mem197#1.base, main_#t~mem197#1.offset, main_#t~mem198#1.base, main_#t~mem198#1.offset, main_#t~mem199#1, main_#t~mem200#1.base, main_#t~mem200#1.offset, main_#t~mem201#1.base, main_#t~mem201#1.offset, main_#t~mem202#1.base, main_#t~mem202#1.offset, main_#t~mem203#1, main_#t~mem204#1.base, main_#t~mem204#1.offset, main_#t~mem205#1.base, main_#t~mem205#1.offset, main_#t~mem206#1.base, main_#t~mem206#1.offset, main_#t~mem207#1.base, main_#t~mem207#1.offset, main_#t~mem208#1.base, main_#t~mem208#1.offset, main_#t~mem209#1, main_#t~mem210#1.base, main_#t~mem210#1.offset, main_#t~mem213#1, main_#t~mem211#1.base, main_#t~mem211#1.offset, main_#t~mem212#1, main_#t~mem214#1.base, main_#t~mem214#1.offset, main_#t~mem215#1.base, main_#t~mem215#1.offset, main_#t~mem216#1, main_#t~post217#1, main_#t~mem218#1.base, main_#t~mem218#1.offset, main_#t~mem219#1.base, main_#t~mem219#1.offset, main_#t~mem220#1.base, main_#t~mem220#1.offset, main_#t~mem221#1.base, main_#t~mem221#1.offset, main_#t~mem222#1.base, main_#t~mem222#1.offset, main_#t~mem223#1.base, main_#t~mem223#1.offset, main_#t~mem224#1.base, main_#t~mem224#1.offset, main_#t~mem225#1.base, main_#t~mem225#1.offset, main_~_hd_head~0#1.base, main_~_hd_head~0#1.offset, main_#t~mem226#1.base, main_#t~mem226#1.offset, main_#t~mem227#1, main_#t~post228#1, main_~_hd_bkt~0#1, main_~_hd_hh_del~0#1.base, main_~_hd_hh_del~0#1.offset, main_#t~mem142#1, main_#t~post143#1, main_#t~mem144#1, main_#t~mem229#1.base, main_#t~mem229#1.offset, main_#t~ite231#1.base, main_#t~ite231#1.offset, main_#t~mem230#1.base, main_#t~mem230#1.offset, main_#t~mem234#1.base, main_#t~mem234#1.offset, main_#t~mem235#1.base, main_#t~mem235#1.offset, main_#t~short236#1, main_#t~mem237#1.base, main_#t~mem237#1.offset, main_#t~mem238#1.base, main_#t~mem238#1.offset, main_#t~mem239#1.base, main_#t~mem239#1.offset, main_#t~mem240#1.base, main_#t~mem240#1.offset, main_#t~mem241#1.base, main_#t~mem241#1.offset, main_#t~mem242#1.base, main_#t~mem242#1.offset, main_#t~mem243#1.base, main_#t~mem243#1.offset, main_#t~mem244#1.base, main_#t~mem244#1.offset, main_#t~mem245#1, main_#t~mem246#1.base, main_#t~mem246#1.offset, main_#t~mem247#1.base, main_#t~mem247#1.offset, main_#t~mem248#1.base, main_#t~mem248#1.offset, main_#t~mem249#1, main_#t~mem250#1.base, main_#t~mem250#1.offset, main_#t~mem251#1.base, main_#t~mem251#1.offset, main_#t~mem252#1.base, main_#t~mem252#1.offset, main_#t~mem253#1.base, main_#t~mem253#1.offset, main_#t~mem254#1.base, main_#t~mem254#1.offset, main_#t~mem255#1, main_#t~mem256#1.base, main_#t~mem256#1.offset, main_#t~mem259#1, main_#t~mem257#1.base, main_#t~mem257#1.offset, main_#t~mem258#1, main_#t~mem260#1.base, main_#t~mem260#1.offset, main_#t~mem261#1.base, main_#t~mem261#1.offset, main_#t~mem262#1, main_#t~post263#1, main_#t~mem264#1.base, main_#t~mem264#1.offset, main_#t~mem265#1.base, main_#t~mem265#1.offset, main_#t~mem266#1.base, main_#t~mem266#1.offset, main_#t~mem267#1.base, main_#t~mem267#1.offset, main_#t~mem268#1.base, main_#t~mem268#1.offset, main_#t~mem269#1.base, main_#t~mem269#1.offset, main_#t~mem270#1.base, main_#t~mem270#1.offset, main_#t~mem271#1.base, main_#t~mem271#1.offset, main_~_hd_head~1#1.base, main_~_hd_head~1#1.offset, main_#t~mem272#1.base, main_#t~mem272#1.offset, main_#t~mem273#1, main_#t~post274#1, main_~_hd_bkt~1#1, main_~_hd_hh_del~1#1.base, main_~_hd_hh_del~1#1.offset, main_#t~ite233#1.base, main_#t~ite233#1.offset, main_#t~mem232#1.base, main_#t~mem232#1.offset, main_~#i~0#1.base, main_~#i~0#1.offset, main_~user~0#1.base, main_~user~0#1.offset, main_~tmp~0#1.base, main_~tmp~0#1.offset, main_~users~0#1.base, main_~users~0#1.offset, main_~temp~0#1.base, main_~temp~0#1.offset;call main_~#i~0#1.base, main_~#i~0#1.offset := #Ultimate.allocOnStack(4);havoc main_~user~0#1.base, main_~user~0#1.offset;havoc main_~tmp~0#1.base, main_~tmp~0#1.offset;main_~users~0#1.base, main_~users~0#1.offset := 0, 0;call write~int(0, main_~#i~0#1.base, main_~#i~0#1.offset, 4); {218#true} is VALID [2022-02-20 23:27:10,618 INFO L290 TraceCheckUtils]: 2: Hoare triple {218#true} assume !true; {219#false} is VALID [2022-02-20 23:27:10,618 INFO L290 TraceCheckUtils]: 3: Hoare triple {219#false} call write~int(0, main_~#i~0#1.base, main_~#i~0#1.offset, 4); {219#false} is VALID [2022-02-20 23:27:10,618 INFO L290 TraceCheckUtils]: 4: Hoare triple {219#false} assume !true; {219#false} is VALID [2022-02-20 23:27:10,618 INFO L290 TraceCheckUtils]: 5: Hoare triple {219#false} main_~user~0#1.base, main_~user~0#1.offset := main_~users~0#1.base, main_~users~0#1.offset; {219#false} is VALID [2022-02-20 23:27:10,619 INFO L290 TraceCheckUtils]: 6: Hoare triple {219#false} assume !!(main_~user~0#1.base != 0 || main_~user~0#1.offset != 0); {219#false} is VALID [2022-02-20 23:27:10,619 INFO L290 TraceCheckUtils]: 7: Hoare triple {219#false} assume !false; {219#false} is VALID [2022-02-20 23:27:10,620 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:27:10,620 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 23:27:10,621 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2143460643] [2022-02-20 23:27:10,621 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2143460643] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:27:10,621 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:27:10,622 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-02-20 23:27:10,623 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1020808468] [2022-02-20 23:27:10,624 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:27:10,627 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 4.0) internal successors, (8), 2 states have internal predecessors, (8), 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 8 [2022-02-20 23:27:10,628 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:27:10,630 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 2 states, 2 states have (on average 4.0) internal successors, (8), 2 states have internal predecessors, (8), 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:27:10,640 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 8 edges. 8 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:27:10,640 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-02-20 23:27:10,641 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 23:27:10,657 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-02-20 23:27:10,658 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-02-20 23:27:10,662 INFO L87 Difference]: Start difference. First operand has 215 states, 208 states have (on average 1.6971153846153846) internal successors, (353), 210 states have internal predecessors, (353), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand has 2 states, 2 states have (on average 4.0) internal successors, (8), 2 states have internal predecessors, (8), 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:27:11,351 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:27:11,351 INFO L93 Difference]: Finished difference Result 427 states and 715 transitions. [2022-02-20 23:27:11,351 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-02-20 23:27:11,352 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 4.0) internal successors, (8), 2 states have internal predecessors, (8), 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 8 [2022-02-20 23:27:11,352 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:27:11,353 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2 states, 2 states have (on average 4.0) internal successors, (8), 2 states have internal predecessors, (8), 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:27:11,366 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 715 transitions. [2022-02-20 23:27:11,366 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2 states, 2 states have (on average 4.0) internal successors, (8), 2 states have internal predecessors, (8), 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:27:11,375 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 715 transitions. [2022-02-20 23:27:11,376 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states and 715 transitions. [2022-02-20 23:27:12,015 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 715 edges. 715 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:27:12,027 INFO L225 Difference]: With dead ends: 427 [2022-02-20 23:27:12,028 INFO L226 Difference]: Without dead ends: 181 [2022-02-20 23:27:12,031 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:27:12,033 INFO L933 BasicCegarLoop]: 280 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, 280 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:27:12,034 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 280 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 23:27:12,048 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 181 states. [2022-02-20 23:27:12,065 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 181 to 181. [2022-02-20 23:27:12,065 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:27:12,067 INFO L82 GeneralOperation]: Start isEquivalent. First operand 181 states. Second operand has 181 states, 175 states have (on average 1.3142857142857143) internal successors, (230), 176 states have internal predecessors, (230), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-02-20 23:27:12,068 INFO L74 IsIncluded]: Start isIncluded. First operand 181 states. Second operand has 181 states, 175 states have (on average 1.3142857142857143) internal successors, (230), 176 states have internal predecessors, (230), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-02-20 23:27:12,068 INFO L87 Difference]: Start difference. First operand 181 states. Second operand has 181 states, 175 states have (on average 1.3142857142857143) internal successors, (230), 176 states have internal predecessors, (230), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-02-20 23:27:12,076 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:27:12,076 INFO L93 Difference]: Finished difference Result 181 states and 236 transitions. [2022-02-20 23:27:12,077 INFO L276 IsEmpty]: Start isEmpty. Operand 181 states and 236 transitions. [2022-02-20 23:27:12,078 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:27:12,078 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:27:12,079 INFO L74 IsIncluded]: Start isIncluded. First operand has 181 states, 175 states have (on average 1.3142857142857143) internal successors, (230), 176 states have internal predecessors, (230), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand 181 states. [2022-02-20 23:27:12,079 INFO L87 Difference]: Start difference. First operand has 181 states, 175 states have (on average 1.3142857142857143) internal successors, (230), 176 states have internal predecessors, (230), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand 181 states. [2022-02-20 23:27:12,086 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:27:12,087 INFO L93 Difference]: Finished difference Result 181 states and 236 transitions. [2022-02-20 23:27:12,087 INFO L276 IsEmpty]: Start isEmpty. Operand 181 states and 236 transitions. [2022-02-20 23:27:12,088 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:27:12,089 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:27:12,089 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:27:12,089 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:27:12,090 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 181 states, 175 states have (on average 1.3142857142857143) internal successors, (230), 176 states have internal predecessors, (230), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-02-20 23:27:12,096 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 181 states to 181 states and 236 transitions. [2022-02-20 23:27:12,098 INFO L78 Accepts]: Start accepts. Automaton has 181 states and 236 transitions. Word has length 8 [2022-02-20 23:27:12,098 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:27:12,098 INFO L470 AbstractCegarLoop]: Abstraction has 181 states and 236 transitions. [2022-02-20 23:27:12,098 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 4.0) internal successors, (8), 2 states have internal predecessors, (8), 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:27:12,099 INFO L276 IsEmpty]: Start isEmpty. Operand 181 states and 236 transitions. [2022-02-20 23:27:12,099 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2022-02-20 23:27:12,099 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:27:12,100 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 23:27:12,100 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-02-20 23:27:12,100 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 23:27:12,101 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:27:12,101 INFO L85 PathProgramCache]: Analyzing trace with hash -716312389, now seen corresponding path program 1 times [2022-02-20 23:27:12,101 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 23:27:12,101 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1763028511] [2022-02-20 23:27:12,102 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:27:12,102 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 23:27:12,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:27:12,156 INFO L290 TraceCheckUtils]: 0: Hoare triple {1299#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); {1299#true} is VALID [2022-02-20 23:27:12,158 INFO L290 TraceCheckUtils]: 1: Hoare triple {1299#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc6#1.base, main_#t~malloc6#1.offset, main_#t~mem7#1, main_#t~mem8#1, main_#t~mem9#1, main_#t~mem11#1, main_#t~mem10#1, main_#t~mem12#1, main_#t~mem13#1, main_#t~mem15#1, main_#t~mem14#1, main_#t~mem16#1, main_#t~mem17#1, main_#t~mem19#1, main_#t~mem18#1, main_#t~mem20#1, main_#t~mem21#1, main_#t~switch22#1, main_#t~mem23#1, main_#t~mem24#1, main_#t~mem25#1, main_#t~mem26#1, main_#t~mem27#1, main_#t~mem28#1, main_#t~mem29#1, main_#t~mem30#1, main_#t~mem31#1, main_#t~mem32#1, main_#t~mem33#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~malloc34#1.base, main_#t~malloc34#1.offset, main_#t~mem35#1.base, main_#t~mem35#1.offset, main_#t~mem36#1.base, main_#t~mem36#1.offset, main_#t~memset~res37#1.base, main_#t~memset~res37#1.offset, main_#t~mem38#1.base, main_#t~mem38#1.offset, main_#t~mem39#1.base, main_#t~mem39#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~malloc43#1.base, main_#t~malloc43#1.offset, main_#t~mem44#1.base, main_#t~mem44#1.offset, main_#t~mem45#1.base, main_#t~mem45#1.offset, main_#t~mem46#1.base, main_#t~mem46#1.offset, main_#t~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~memset~res50#1.base, main_#t~memset~res50#1.offset, main_#t~mem51#1.base, main_#t~mem51#1.offset, main_#t~mem52#1.base, main_#t~mem52#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, main_#t~mem56#1.base, main_#t~mem56#1.offset, main_#t~mem57#1.base, main_#t~mem57#1.offset, main_#t~mem58#1.base, main_#t~mem58#1.offset, main_#t~mem59#1.base, main_#t~mem59#1.offset, main_#t~mem60#1, main_#t~post61#1, main_#t~mem62#1.base, main_#t~mem62#1.offset, main_#t~mem63#1, main_#t~mem64#1.base, main_#t~mem64#1.offset, main_#t~mem65#1.base, main_#t~mem65#1.offset, main_#t~mem66#1, main_#t~post67#1, main_#t~mem68#1.base, main_#t~mem68#1.offset, main_#t~mem69#1.base, main_#t~mem69#1.offset, main_#t~mem70#1.base, main_#t~mem70#1.offset, main_#t~mem72#1, main_#t~mem71#1, main_#t~mem73#1.base, main_#t~mem73#1.offset, main_#t~mem74#1, main_#t~short75#1, main_#t~mem76#1.base, main_#t~mem76#1.offset, main_#t~mem77#1, main_#t~malloc78#1.base, main_#t~malloc78#1.offset, main_#t~mem79#1.base, main_#t~mem79#1.offset, main_#t~mem80#1.base, main_#t~mem80#1.offset, main_#t~mem81#1.base, main_#t~mem81#1.offset, main_#t~mem82#1, main_#t~memset~res83#1.base, main_#t~memset~res83#1.offset, main_#t~mem84#1.base, main_#t~mem84#1.offset, main_#t~mem85#1.base, main_#t~mem85#1.offset, main_#t~mem88#1, main_#t~mem86#1.base, main_#t~mem86#1.offset, main_#t~mem87#1, main_#t~mem89#1.base, main_#t~mem89#1.offset, main_#t~mem92#1, main_#t~mem90#1.base, main_#t~mem90#1.offset, main_#t~mem91#1, main_#t~ite93#1, main_#t~mem94#1.base, main_#t~mem94#1.offset, main_#t~mem98#1.base, main_#t~mem98#1.offset, main_#t~mem99#1.base, main_#t~mem99#1.offset, main_#t~mem100#1.base, main_#t~mem100#1.offset, main_#t~mem101#1.base, main_#t~mem101#1.offset, main_#t~mem104#1, main_#t~mem102#1.base, main_#t~mem102#1.offset, main_#t~mem103#1, main_#t~mem105#1.base, main_#t~mem105#1.offset, main_#t~mem106#1, main_#t~pre107#1, main_#t~mem108#1.base, main_#t~mem108#1.offset, main_#t~mem109#1, main_#t~mem110#1.base, main_#t~mem110#1.offset, main_#t~mem111#1, main_#t~post112#1, main_#t~mem116#1, main_#t~mem114#1, main_#t~mem113#1.base, main_#t~mem113#1.offset, main_#t~mem115#1, main_#t~mem117#1, main_#t~post118#1, main_#t~mem119#1.base, main_#t~mem119#1.offset, main_#t~mem120#1.base, main_#t~mem120#1.offset, main_#t~mem121#1.base, main_#t~mem121#1.offset, main_#t~post95#1, main_#t~mem96#1.base, main_#t~mem96#1.offset, main_#t~mem97#1, main_#t~mem122#1.base, main_#t~mem122#1.offset, main_#t~mem123#1.base, main_#t~mem123#1.offset, main_#t~mem124#1.base, main_#t~mem124#1.offset, main_#t~mem125#1, main_#t~mem126#1.base, main_#t~mem126#1.offset, main_#t~mem127#1, main_#t~post128#1, main_#t~mem129#1.base, main_#t~mem129#1.offset, main_#t~mem130#1.base, main_#t~mem130#1.offset, main_#t~mem131#1.base, main_#t~mem131#1.offset, main_#t~mem132#1.base, main_#t~mem132#1.offset, main_#t~mem135#1, main_#t~mem133#1.base, main_#t~mem133#1.offset, main_#t~mem134#1, main_#t~ite138#1, main_#t~mem136#1.base, main_#t~mem136#1.offset, main_#t~mem137#1, main_#t~mem139#1.base, main_#t~mem139#1.offset, main_#t~mem140#1, main_#t~mem141#1.base, main_#t~mem141#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~mem3#1, main_#t~post4#1, main_#t~mem5#1, main_#t~mem146#1, main_#t~mem145#1, main_#t~mem147#1, main_#t~mem148#1, main_#t~mem150#1, main_#t~mem149#1, main_#t~mem151#1, main_#t~mem152#1, main_#t~mem154#1, main_#t~mem153#1, main_#t~mem155#1, main_#t~mem156#1, main_#t~switch157#1, main_#t~mem158#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_~_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~mem169#1.base, main_#t~mem169#1.offset, main_#t~mem170#1, main_#t~mem171#1.base, main_#t~mem171#1.offset, 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, main_#t~mem179#1, main_#t~mem180#1, main_#t~short181#1, main_#t~mem182#1.base, main_#t~mem182#1.offset, main_#t~ret183#1, main_#t~mem184#1.base, main_#t~mem184#1.offset, main_#t~mem185#1.base, main_#t~mem185#1.offset, main_#t~mem186#1.base, main_#t~mem186#1.offset, main_#t~mem187#1, main_~_hf_bkt~0#1, main_~_hf_hashv~0#1, main_#t~mem188#1.base, main_#t~mem188#1.offset, main_#t~mem189#1.base, main_#t~mem189#1.offset, main_#t~short190#1, main_#t~mem191#1.base, main_#t~mem191#1.offset, main_#t~mem192#1.base, main_#t~mem192#1.offset, main_#t~mem193#1.base, main_#t~mem193#1.offset, main_#t~mem194#1.base, main_#t~mem194#1.offset, main_#t~mem195#1.base, main_#t~mem195#1.offset, main_#t~mem196#1.base, main_#t~mem196#1.offset, main_#t~mem197#1.base, main_#t~mem197#1.offset, main_#t~mem198#1.base, main_#t~mem198#1.offset, main_#t~mem199#1, main_#t~mem200#1.base, main_#t~mem200#1.offset, main_#t~mem201#1.base, main_#t~mem201#1.offset, main_#t~mem202#1.base, main_#t~mem202#1.offset, main_#t~mem203#1, main_#t~mem204#1.base, main_#t~mem204#1.offset, main_#t~mem205#1.base, main_#t~mem205#1.offset, main_#t~mem206#1.base, main_#t~mem206#1.offset, main_#t~mem207#1.base, main_#t~mem207#1.offset, main_#t~mem208#1.base, main_#t~mem208#1.offset, main_#t~mem209#1, main_#t~mem210#1.base, main_#t~mem210#1.offset, main_#t~mem213#1, main_#t~mem211#1.base, main_#t~mem211#1.offset, main_#t~mem212#1, main_#t~mem214#1.base, main_#t~mem214#1.offset, main_#t~mem215#1.base, main_#t~mem215#1.offset, main_#t~mem216#1, main_#t~post217#1, main_#t~mem218#1.base, main_#t~mem218#1.offset, main_#t~mem219#1.base, main_#t~mem219#1.offset, main_#t~mem220#1.base, main_#t~mem220#1.offset, main_#t~mem221#1.base, main_#t~mem221#1.offset, main_#t~mem222#1.base, main_#t~mem222#1.offset, main_#t~mem223#1.base, main_#t~mem223#1.offset, main_#t~mem224#1.base, main_#t~mem224#1.offset, main_#t~mem225#1.base, main_#t~mem225#1.offset, main_~_hd_head~0#1.base, main_~_hd_head~0#1.offset, main_#t~mem226#1.base, main_#t~mem226#1.offset, main_#t~mem227#1, main_#t~post228#1, main_~_hd_bkt~0#1, main_~_hd_hh_del~0#1.base, main_~_hd_hh_del~0#1.offset, main_#t~mem142#1, main_#t~post143#1, main_#t~mem144#1, main_#t~mem229#1.base, main_#t~mem229#1.offset, main_#t~ite231#1.base, main_#t~ite231#1.offset, main_#t~mem230#1.base, main_#t~mem230#1.offset, main_#t~mem234#1.base, main_#t~mem234#1.offset, main_#t~mem235#1.base, main_#t~mem235#1.offset, main_#t~short236#1, main_#t~mem237#1.base, main_#t~mem237#1.offset, main_#t~mem238#1.base, main_#t~mem238#1.offset, main_#t~mem239#1.base, main_#t~mem239#1.offset, main_#t~mem240#1.base, main_#t~mem240#1.offset, main_#t~mem241#1.base, main_#t~mem241#1.offset, main_#t~mem242#1.base, main_#t~mem242#1.offset, main_#t~mem243#1.base, main_#t~mem243#1.offset, main_#t~mem244#1.base, main_#t~mem244#1.offset, main_#t~mem245#1, main_#t~mem246#1.base, main_#t~mem246#1.offset, main_#t~mem247#1.base, main_#t~mem247#1.offset, main_#t~mem248#1.base, main_#t~mem248#1.offset, main_#t~mem249#1, main_#t~mem250#1.base, main_#t~mem250#1.offset, main_#t~mem251#1.base, main_#t~mem251#1.offset, main_#t~mem252#1.base, main_#t~mem252#1.offset, main_#t~mem253#1.base, main_#t~mem253#1.offset, main_#t~mem254#1.base, main_#t~mem254#1.offset, main_#t~mem255#1, main_#t~mem256#1.base, main_#t~mem256#1.offset, main_#t~mem259#1, main_#t~mem257#1.base, main_#t~mem257#1.offset, main_#t~mem258#1, main_#t~mem260#1.base, main_#t~mem260#1.offset, main_#t~mem261#1.base, main_#t~mem261#1.offset, main_#t~mem262#1, main_#t~post263#1, main_#t~mem264#1.base, main_#t~mem264#1.offset, main_#t~mem265#1.base, main_#t~mem265#1.offset, main_#t~mem266#1.base, main_#t~mem266#1.offset, main_#t~mem267#1.base, main_#t~mem267#1.offset, main_#t~mem268#1.base, main_#t~mem268#1.offset, main_#t~mem269#1.base, main_#t~mem269#1.offset, main_#t~mem270#1.base, main_#t~mem270#1.offset, main_#t~mem271#1.base, main_#t~mem271#1.offset, main_~_hd_head~1#1.base, main_~_hd_head~1#1.offset, main_#t~mem272#1.base, main_#t~mem272#1.offset, main_#t~mem273#1, main_#t~post274#1, main_~_hd_bkt~1#1, main_~_hd_hh_del~1#1.base, main_~_hd_hh_del~1#1.offset, main_#t~ite233#1.base, main_#t~ite233#1.offset, main_#t~mem232#1.base, main_#t~mem232#1.offset, main_~#i~0#1.base, main_~#i~0#1.offset, main_~user~0#1.base, main_~user~0#1.offset, main_~tmp~0#1.base, main_~tmp~0#1.offset, main_~users~0#1.base, main_~users~0#1.offset, main_~temp~0#1.base, main_~temp~0#1.offset;call main_~#i~0#1.base, main_~#i~0#1.offset := #Ultimate.allocOnStack(4);havoc main_~user~0#1.base, main_~user~0#1.offset;havoc main_~tmp~0#1.base, main_~tmp~0#1.offset;main_~users~0#1.base, main_~users~0#1.offset := 0, 0;call write~int(0, main_~#i~0#1.base, main_~#i~0#1.offset, 4); {1301#(= (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:27:12,163 INFO L290 TraceCheckUtils]: 2: Hoare triple {1301#(= (select (select |#memory_int| |ULTIMATE.start_main_~#i~0#1.base|) |ULTIMATE.start_main_~#i~0#1.offset|) 0)} call main_#t~mem5#1 := read~int(main_~#i~0#1.base, main_~#i~0#1.offset, 4); {1302#(= |ULTIMATE.start_main_#t~mem5#1| 0)} is VALID [2022-02-20 23:27:12,164 INFO L290 TraceCheckUtils]: 3: Hoare triple {1302#(= |ULTIMATE.start_main_#t~mem5#1| 0)} assume !(main_#t~mem5#1 < 1000);havoc main_#t~mem5#1; {1300#false} is VALID [2022-02-20 23:27:12,164 INFO L290 TraceCheckUtils]: 4: Hoare triple {1300#false} call write~int(0, main_~#i~0#1.base, main_~#i~0#1.offset, 4); {1300#false} is VALID [2022-02-20 23:27:12,164 INFO L290 TraceCheckUtils]: 5: Hoare triple {1300#false} call main_#t~mem144#1 := read~int(main_~#i~0#1.base, main_~#i~0#1.offset, 4); {1300#false} is VALID [2022-02-20 23:27:12,164 INFO L290 TraceCheckUtils]: 6: Hoare triple {1300#false} assume !(main_#t~mem144#1 < 1000);havoc main_#t~mem144#1; {1300#false} is VALID [2022-02-20 23:27:12,165 INFO L290 TraceCheckUtils]: 7: Hoare triple {1300#false} main_~user~0#1.base, main_~user~0#1.offset := main_~users~0#1.base, main_~users~0#1.offset; {1300#false} is VALID [2022-02-20 23:27:12,165 INFO L290 TraceCheckUtils]: 8: Hoare triple {1300#false} assume !!(main_~user~0#1.base != 0 || main_~user~0#1.offset != 0); {1300#false} is VALID [2022-02-20 23:27:12,165 INFO L290 TraceCheckUtils]: 9: Hoare triple {1300#false} assume !false; {1300#false} is VALID [2022-02-20 23:27:12,165 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:27:12,166 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 23:27:12,166 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1763028511] [2022-02-20 23:27:12,166 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1763028511] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:27:12,166 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:27:12,167 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-02-20 23:27:12,167 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [777065993] [2022-02-20 23:27:12,167 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:27:12,168 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 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 10 [2022-02-20 23:27:12,168 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:27:12,169 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 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:27:12,176 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 10 edges. 10 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:27:12,177 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-02-20 23:27:12,177 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 23:27:12,178 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-02-20 23:27:12,178 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-02-20 23:27:12,178 INFO L87 Difference]: Start difference. First operand 181 states and 236 transitions. Second operand has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 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:27:13,256 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:27:13,257 INFO L93 Difference]: Finished difference Result 386 states and 505 transitions. [2022-02-20 23:27:13,257 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-02-20 23:27:13,257 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 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 10 [2022-02-20 23:27:13,258 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:27:13,258 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 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:27:13,263 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 505 transitions. [2022-02-20 23:27:13,263 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 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:27:13,268 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 505 transitions. [2022-02-20 23:27:13,269 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 505 transitions. [2022-02-20 23:27:13,663 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 505 edges. 505 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:27:13,671 INFO L225 Difference]: With dead ends: 386 [2022-02-20 23:27:13,671 INFO L226 Difference]: Without dead ends: 299 [2022-02-20 23:27:13,672 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:27:13,673 INFO L933 BasicCegarLoop]: 206 mSDtfsCounter, 146 mSDsluCounter, 364 mSDsCounter, 0 mSdLazyCounter, 161 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 146 SdHoareTripleChecker+Valid, 570 SdHoareTripleChecker+Invalid, 164 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 161 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-02-20 23:27:13,673 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [146 Valid, 570 Invalid, 164 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 161 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-02-20 23:27:13,674 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 299 states. [2022-02-20 23:27:13,683 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 299 to 183. [2022-02-20 23:27:13,683 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:27:13,684 INFO L82 GeneralOperation]: Start isEquivalent. First operand 299 states. Second operand has 183 states, 177 states have (on average 1.310734463276836) internal successors, (232), 178 states have internal predecessors, (232), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-02-20 23:27:13,684 INFO L74 IsIncluded]: Start isIncluded. First operand 299 states. Second operand has 183 states, 177 states have (on average 1.310734463276836) internal successors, (232), 178 states have internal predecessors, (232), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-02-20 23:27:13,685 INFO L87 Difference]: Start difference. First operand 299 states. Second operand has 183 states, 177 states have (on average 1.310734463276836) internal successors, (232), 178 states have internal predecessors, (232), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-02-20 23:27:13,694 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:27:13,694 INFO L93 Difference]: Finished difference Result 299 states and 390 transitions. [2022-02-20 23:27:13,694 INFO L276 IsEmpty]: Start isEmpty. Operand 299 states and 390 transitions. [2022-02-20 23:27:13,696 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:27:13,696 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:27:13,697 INFO L74 IsIncluded]: Start isIncluded. First operand has 183 states, 177 states have (on average 1.310734463276836) internal successors, (232), 178 states have internal predecessors, (232), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand 299 states. [2022-02-20 23:27:13,697 INFO L87 Difference]: Start difference. First operand has 183 states, 177 states have (on average 1.310734463276836) internal successors, (232), 178 states have internal predecessors, (232), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand 299 states. [2022-02-20 23:27:13,706 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:27:13,707 INFO L93 Difference]: Finished difference Result 299 states and 390 transitions. [2022-02-20 23:27:13,707 INFO L276 IsEmpty]: Start isEmpty. Operand 299 states and 390 transitions. [2022-02-20 23:27:13,708 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:27:13,708 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:27:13,708 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:27:13,708 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:27:13,709 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 183 states, 177 states have (on average 1.310734463276836) internal successors, (232), 178 states have internal predecessors, (232), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-02-20 23:27:13,714 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 183 states to 183 states and 238 transitions. [2022-02-20 23:27:13,714 INFO L78 Accepts]: Start accepts. Automaton has 183 states and 238 transitions. Word has length 10 [2022-02-20 23:27:13,714 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:27:13,714 INFO L470 AbstractCegarLoop]: Abstraction has 183 states and 238 transitions. [2022-02-20 23:27:13,715 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 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:27:13,715 INFO L276 IsEmpty]: Start isEmpty. Operand 183 states and 238 transitions. [2022-02-20 23:27:13,716 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2022-02-20 23:27:13,716 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:27:13,716 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] [2022-02-20 23:27:13,717 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-02-20 23:27:13,717 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 23:27:13,724 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:27:13,724 INFO L85 PathProgramCache]: Analyzing trace with hash -1437380185, now seen corresponding path program 1 times [2022-02-20 23:27:13,725 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 23:27:13,725 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1532964272] [2022-02-20 23:27:13,725 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:27:13,725 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 23:27:13,832 ERROR L252 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-02-20 23:27:13,833 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1298074922] [2022-02-20 23:27:13,833 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:27:13,833 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 23:27:13,833 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 23:27:13,835 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:27:13,850 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:27:14,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:27:14,362 INFO L263 TraceCheckSpWp]: Trace formula consists of 1571 conjuncts, 3 conjunts are in the unsatisfiable core [2022-02-20 23:27:14,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:27:14,412 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 23:27:14,552 INFO L290 TraceCheckUtils]: 0: Hoare triple {2576#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); {2576#true} is VALID [2022-02-20 23:27:14,553 INFO L290 TraceCheckUtils]: 1: Hoare triple {2576#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc6#1.base, main_#t~malloc6#1.offset, main_#t~mem7#1, main_#t~mem8#1, main_#t~mem9#1, main_#t~mem11#1, main_#t~mem10#1, main_#t~mem12#1, main_#t~mem13#1, main_#t~mem15#1, main_#t~mem14#1, main_#t~mem16#1, main_#t~mem17#1, main_#t~mem19#1, main_#t~mem18#1, main_#t~mem20#1, main_#t~mem21#1, main_#t~switch22#1, main_#t~mem23#1, main_#t~mem24#1, main_#t~mem25#1, main_#t~mem26#1, main_#t~mem27#1, main_#t~mem28#1, main_#t~mem29#1, main_#t~mem30#1, main_#t~mem31#1, main_#t~mem32#1, main_#t~mem33#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~malloc34#1.base, main_#t~malloc34#1.offset, main_#t~mem35#1.base, main_#t~mem35#1.offset, main_#t~mem36#1.base, main_#t~mem36#1.offset, main_#t~memset~res37#1.base, main_#t~memset~res37#1.offset, main_#t~mem38#1.base, main_#t~mem38#1.offset, main_#t~mem39#1.base, main_#t~mem39#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~malloc43#1.base, main_#t~malloc43#1.offset, main_#t~mem44#1.base, main_#t~mem44#1.offset, main_#t~mem45#1.base, main_#t~mem45#1.offset, main_#t~mem46#1.base, main_#t~mem46#1.offset, main_#t~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~memset~res50#1.base, main_#t~memset~res50#1.offset, main_#t~mem51#1.base, main_#t~mem51#1.offset, main_#t~mem52#1.base, main_#t~mem52#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, main_#t~mem56#1.base, main_#t~mem56#1.offset, main_#t~mem57#1.base, main_#t~mem57#1.offset, main_#t~mem58#1.base, main_#t~mem58#1.offset, main_#t~mem59#1.base, main_#t~mem59#1.offset, main_#t~mem60#1, main_#t~post61#1, main_#t~mem62#1.base, main_#t~mem62#1.offset, main_#t~mem63#1, main_#t~mem64#1.base, main_#t~mem64#1.offset, main_#t~mem65#1.base, main_#t~mem65#1.offset, main_#t~mem66#1, main_#t~post67#1, main_#t~mem68#1.base, main_#t~mem68#1.offset, main_#t~mem69#1.base, main_#t~mem69#1.offset, main_#t~mem70#1.base, main_#t~mem70#1.offset, main_#t~mem72#1, main_#t~mem71#1, main_#t~mem73#1.base, main_#t~mem73#1.offset, main_#t~mem74#1, main_#t~short75#1, main_#t~mem76#1.base, main_#t~mem76#1.offset, main_#t~mem77#1, main_#t~malloc78#1.base, main_#t~malloc78#1.offset, main_#t~mem79#1.base, main_#t~mem79#1.offset, main_#t~mem80#1.base, main_#t~mem80#1.offset, main_#t~mem81#1.base, main_#t~mem81#1.offset, main_#t~mem82#1, main_#t~memset~res83#1.base, main_#t~memset~res83#1.offset, main_#t~mem84#1.base, main_#t~mem84#1.offset, main_#t~mem85#1.base, main_#t~mem85#1.offset, main_#t~mem88#1, main_#t~mem86#1.base, main_#t~mem86#1.offset, main_#t~mem87#1, main_#t~mem89#1.base, main_#t~mem89#1.offset, main_#t~mem92#1, main_#t~mem90#1.base, main_#t~mem90#1.offset, main_#t~mem91#1, main_#t~ite93#1, main_#t~mem94#1.base, main_#t~mem94#1.offset, main_#t~mem98#1.base, main_#t~mem98#1.offset, main_#t~mem99#1.base, main_#t~mem99#1.offset, main_#t~mem100#1.base, main_#t~mem100#1.offset, main_#t~mem101#1.base, main_#t~mem101#1.offset, main_#t~mem104#1, main_#t~mem102#1.base, main_#t~mem102#1.offset, main_#t~mem103#1, main_#t~mem105#1.base, main_#t~mem105#1.offset, main_#t~mem106#1, main_#t~pre107#1, main_#t~mem108#1.base, main_#t~mem108#1.offset, main_#t~mem109#1, main_#t~mem110#1.base, main_#t~mem110#1.offset, main_#t~mem111#1, main_#t~post112#1, main_#t~mem116#1, main_#t~mem114#1, main_#t~mem113#1.base, main_#t~mem113#1.offset, main_#t~mem115#1, main_#t~mem117#1, main_#t~post118#1, main_#t~mem119#1.base, main_#t~mem119#1.offset, main_#t~mem120#1.base, main_#t~mem120#1.offset, main_#t~mem121#1.base, main_#t~mem121#1.offset, main_#t~post95#1, main_#t~mem96#1.base, main_#t~mem96#1.offset, main_#t~mem97#1, main_#t~mem122#1.base, main_#t~mem122#1.offset, main_#t~mem123#1.base, main_#t~mem123#1.offset, main_#t~mem124#1.base, main_#t~mem124#1.offset, main_#t~mem125#1, main_#t~mem126#1.base, main_#t~mem126#1.offset, main_#t~mem127#1, main_#t~post128#1, main_#t~mem129#1.base, main_#t~mem129#1.offset, main_#t~mem130#1.base, main_#t~mem130#1.offset, main_#t~mem131#1.base, main_#t~mem131#1.offset, main_#t~mem132#1.base, main_#t~mem132#1.offset, main_#t~mem135#1, main_#t~mem133#1.base, main_#t~mem133#1.offset, main_#t~mem134#1, main_#t~ite138#1, main_#t~mem136#1.base, main_#t~mem136#1.offset, main_#t~mem137#1, main_#t~mem139#1.base, main_#t~mem139#1.offset, main_#t~mem140#1, main_#t~mem141#1.base, main_#t~mem141#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~mem3#1, main_#t~post4#1, main_#t~mem5#1, main_#t~mem146#1, main_#t~mem145#1, main_#t~mem147#1, main_#t~mem148#1, main_#t~mem150#1, main_#t~mem149#1, main_#t~mem151#1, main_#t~mem152#1, main_#t~mem154#1, main_#t~mem153#1, main_#t~mem155#1, main_#t~mem156#1, main_#t~switch157#1, main_#t~mem158#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_~_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~mem169#1.base, main_#t~mem169#1.offset, main_#t~mem170#1, main_#t~mem171#1.base, main_#t~mem171#1.offset, 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, main_#t~mem179#1, main_#t~mem180#1, main_#t~short181#1, main_#t~mem182#1.base, main_#t~mem182#1.offset, main_#t~ret183#1, main_#t~mem184#1.base, main_#t~mem184#1.offset, main_#t~mem185#1.base, main_#t~mem185#1.offset, main_#t~mem186#1.base, main_#t~mem186#1.offset, main_#t~mem187#1, main_~_hf_bkt~0#1, main_~_hf_hashv~0#1, main_#t~mem188#1.base, main_#t~mem188#1.offset, main_#t~mem189#1.base, main_#t~mem189#1.offset, main_#t~short190#1, main_#t~mem191#1.base, main_#t~mem191#1.offset, main_#t~mem192#1.base, main_#t~mem192#1.offset, main_#t~mem193#1.base, main_#t~mem193#1.offset, main_#t~mem194#1.base, main_#t~mem194#1.offset, main_#t~mem195#1.base, main_#t~mem195#1.offset, main_#t~mem196#1.base, main_#t~mem196#1.offset, main_#t~mem197#1.base, main_#t~mem197#1.offset, main_#t~mem198#1.base, main_#t~mem198#1.offset, main_#t~mem199#1, main_#t~mem200#1.base, main_#t~mem200#1.offset, main_#t~mem201#1.base, main_#t~mem201#1.offset, main_#t~mem202#1.base, main_#t~mem202#1.offset, main_#t~mem203#1, main_#t~mem204#1.base, main_#t~mem204#1.offset, main_#t~mem205#1.base, main_#t~mem205#1.offset, main_#t~mem206#1.base, main_#t~mem206#1.offset, main_#t~mem207#1.base, main_#t~mem207#1.offset, main_#t~mem208#1.base, main_#t~mem208#1.offset, main_#t~mem209#1, main_#t~mem210#1.base, main_#t~mem210#1.offset, main_#t~mem213#1, main_#t~mem211#1.base, main_#t~mem211#1.offset, main_#t~mem212#1, main_#t~mem214#1.base, main_#t~mem214#1.offset, main_#t~mem215#1.base, main_#t~mem215#1.offset, main_#t~mem216#1, main_#t~post217#1, main_#t~mem218#1.base, main_#t~mem218#1.offset, main_#t~mem219#1.base, main_#t~mem219#1.offset, main_#t~mem220#1.base, main_#t~mem220#1.offset, main_#t~mem221#1.base, main_#t~mem221#1.offset, main_#t~mem222#1.base, main_#t~mem222#1.offset, main_#t~mem223#1.base, main_#t~mem223#1.offset, main_#t~mem224#1.base, main_#t~mem224#1.offset, main_#t~mem225#1.base, main_#t~mem225#1.offset, main_~_hd_head~0#1.base, main_~_hd_head~0#1.offset, main_#t~mem226#1.base, main_#t~mem226#1.offset, main_#t~mem227#1, main_#t~post228#1, main_~_hd_bkt~0#1, main_~_hd_hh_del~0#1.base, main_~_hd_hh_del~0#1.offset, main_#t~mem142#1, main_#t~post143#1, main_#t~mem144#1, main_#t~mem229#1.base, main_#t~mem229#1.offset, main_#t~ite231#1.base, main_#t~ite231#1.offset, main_#t~mem230#1.base, main_#t~mem230#1.offset, main_#t~mem234#1.base, main_#t~mem234#1.offset, main_#t~mem235#1.base, main_#t~mem235#1.offset, main_#t~short236#1, main_#t~mem237#1.base, main_#t~mem237#1.offset, main_#t~mem238#1.base, main_#t~mem238#1.offset, main_#t~mem239#1.base, main_#t~mem239#1.offset, main_#t~mem240#1.base, main_#t~mem240#1.offset, main_#t~mem241#1.base, main_#t~mem241#1.offset, main_#t~mem242#1.base, main_#t~mem242#1.offset, main_#t~mem243#1.base, main_#t~mem243#1.offset, main_#t~mem244#1.base, main_#t~mem244#1.offset, main_#t~mem245#1, main_#t~mem246#1.base, main_#t~mem246#1.offset, main_#t~mem247#1.base, main_#t~mem247#1.offset, main_#t~mem248#1.base, main_#t~mem248#1.offset, main_#t~mem249#1, main_#t~mem250#1.base, main_#t~mem250#1.offset, main_#t~mem251#1.base, main_#t~mem251#1.offset, main_#t~mem252#1.base, main_#t~mem252#1.offset, main_#t~mem253#1.base, main_#t~mem253#1.offset, main_#t~mem254#1.base, main_#t~mem254#1.offset, main_#t~mem255#1, main_#t~mem256#1.base, main_#t~mem256#1.offset, main_#t~mem259#1, main_#t~mem257#1.base, main_#t~mem257#1.offset, main_#t~mem258#1, main_#t~mem260#1.base, main_#t~mem260#1.offset, main_#t~mem261#1.base, main_#t~mem261#1.offset, main_#t~mem262#1, main_#t~post263#1, main_#t~mem264#1.base, main_#t~mem264#1.offset, main_#t~mem265#1.base, main_#t~mem265#1.offset, main_#t~mem266#1.base, main_#t~mem266#1.offset, main_#t~mem267#1.base, main_#t~mem267#1.offset, main_#t~mem268#1.base, main_#t~mem268#1.offset, main_#t~mem269#1.base, main_#t~mem269#1.offset, main_#t~mem270#1.base, main_#t~mem270#1.offset, main_#t~mem271#1.base, main_#t~mem271#1.offset, main_~_hd_head~1#1.base, main_~_hd_head~1#1.offset, main_#t~mem272#1.base, main_#t~mem272#1.offset, main_#t~mem273#1, main_#t~post274#1, main_~_hd_bkt~1#1, main_~_hd_hh_del~1#1.base, main_~_hd_hh_del~1#1.offset, main_#t~ite233#1.base, main_#t~ite233#1.offset, main_#t~mem232#1.base, main_#t~mem232#1.offset, main_~#i~0#1.base, main_~#i~0#1.offset, main_~user~0#1.base, main_~user~0#1.offset, main_~tmp~0#1.base, main_~tmp~0#1.offset, main_~users~0#1.base, main_~users~0#1.offset, main_~temp~0#1.base, main_~temp~0#1.offset;call main_~#i~0#1.base, main_~#i~0#1.offset := #Ultimate.allocOnStack(4);havoc main_~user~0#1.base, main_~user~0#1.offset;havoc main_~tmp~0#1.base, main_~tmp~0#1.offset;main_~users~0#1.base, main_~users~0#1.offset := 0, 0;call write~int(0, main_~#i~0#1.base, main_~#i~0#1.offset, 4); {2576#true} is VALID [2022-02-20 23:27:14,553 INFO L290 TraceCheckUtils]: 2: Hoare triple {2576#true} call main_#t~mem5#1 := read~int(main_~#i~0#1.base, main_~#i~0#1.offset, 4); {2576#true} is VALID [2022-02-20 23:27:14,553 INFO L290 TraceCheckUtils]: 3: Hoare triple {2576#true} assume !!(main_#t~mem5#1 < 1000);havoc main_#t~mem5#1;call main_#t~malloc6#1.base, main_#t~malloc6#1.offset := #Ultimate.allocOnHeap(40);main_~user~0#1.base, main_~user~0#1.offset := main_#t~malloc6#1.base, main_#t~malloc6#1.offset;havoc main_#t~malloc6#1.base, main_#t~malloc6#1.offset; {2576#true} is VALID [2022-02-20 23:27:14,554 INFO L290 TraceCheckUtils]: 4: Hoare triple {2576#true} assume !(main_~user~0#1.base == 0 && main_~user~0#1.offset == 0); {2576#true} is VALID [2022-02-20 23:27:14,554 INFO L290 TraceCheckUtils]: 5: Hoare triple {2576#true} call main_#t~mem7#1 := read~int(main_~#i~0#1.base, main_~#i~0#1.offset, 4);call write~int(main_#t~mem7#1, main_~user~0#1.base, main_~user~0#1.offset, 4);havoc main_#t~mem7#1;call main_#t~mem8#1 := read~int(main_~#i~0#1.base, main_~#i~0#1.offset, 4);call main_#t~mem9#1 := read~int(main_~#i~0#1.base, main_~#i~0#1.offset, 4);call write~int(main_#t~mem8#1 * main_#t~mem9#1, main_~user~0#1.base, 4 + main_~user~0#1.offset, 4);havoc main_#t~mem8#1;havoc main_#t~mem9#1; {2576#true} is VALID [2022-02-20 23:27:14,554 INFO L290 TraceCheckUtils]: 6: Hoare triple {2576#true} havoc main_~_ha_hashv~0#1; {2576#true} is VALID [2022-02-20 23:27:14,554 INFO L290 TraceCheckUtils]: 7: Hoare triple {2576#true} goto; {2576#true} is VALID [2022-02-20 23:27:14,555 INFO L290 TraceCheckUtils]: 8: Hoare triple {2576#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; {2576#true} is VALID [2022-02-20 23:27:14,555 INFO L290 TraceCheckUtils]: 9: Hoare triple {2576#true} assume !(main_~_hj_k~0#1 % 4294967296 >= 12); {2576#true} is VALID [2022-02-20 23:27:14,555 INFO L290 TraceCheckUtils]: 10: Hoare triple {2576#true} main_~_ha_hashv~0#1 := 4 + main_~_ha_hashv~0#1;main_#t~switch22#1 := 11 == main_~_hj_k~0#1; {2576#true} is VALID [2022-02-20 23:27:14,555 INFO L290 TraceCheckUtils]: 11: Hoare triple {2576#true} assume main_#t~switch22#1;call main_#t~mem23#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~mem23#1 % 256);havoc main_#t~mem23#1; {2576#true} is VALID [2022-02-20 23:27:14,556 INFO L290 TraceCheckUtils]: 12: Hoare triple {2576#true} main_#t~switch22#1 := main_#t~switch22#1 || 10 == main_~_hj_k~0#1; {2576#true} is VALID [2022-02-20 23:27:14,556 INFO L290 TraceCheckUtils]: 13: Hoare triple {2576#true} assume main_#t~switch22#1;call main_#t~mem24#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~mem24#1 % 256);havoc main_#t~mem24#1; {2576#true} is VALID [2022-02-20 23:27:14,556 INFO L290 TraceCheckUtils]: 14: Hoare triple {2576#true} main_#t~switch22#1 := main_#t~switch22#1 || 9 == main_~_hj_k~0#1; {2576#true} is VALID [2022-02-20 23:27:14,556 INFO L290 TraceCheckUtils]: 15: Hoare triple {2576#true} assume main_#t~switch22#1;call main_#t~mem25#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~mem25#1 % 256);havoc main_#t~mem25#1; {2576#true} is VALID [2022-02-20 23:27:14,557 INFO L290 TraceCheckUtils]: 16: Hoare triple {2576#true} main_#t~switch22#1 := main_#t~switch22#1 || 8 == main_~_hj_k~0#1; {2576#true} is VALID [2022-02-20 23:27:14,557 INFO L290 TraceCheckUtils]: 17: Hoare triple {2576#true} assume main_#t~switch22#1;call main_#t~mem26#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~mem26#1 % 256);havoc main_#t~mem26#1; {2632#|ULTIMATE.start_main_#t~switch22#1|} is VALID [2022-02-20 23:27:14,558 INFO L290 TraceCheckUtils]: 18: Hoare triple {2632#|ULTIMATE.start_main_#t~switch22#1|} main_#t~switch22#1 := main_#t~switch22#1 || 7 == main_~_hj_k~0#1; {2632#|ULTIMATE.start_main_#t~switch22#1|} is VALID [2022-02-20 23:27:14,558 INFO L290 TraceCheckUtils]: 19: Hoare triple {2632#|ULTIMATE.start_main_#t~switch22#1|} assume !main_#t~switch22#1; {2577#false} is VALID [2022-02-20 23:27:14,558 INFO L290 TraceCheckUtils]: 20: Hoare triple {2577#false} main_#t~switch22#1 := main_#t~switch22#1 || 6 == main_~_hj_k~0#1; {2577#false} is VALID [2022-02-20 23:27:14,559 INFO L290 TraceCheckUtils]: 21: Hoare triple {2577#false} assume main_#t~switch22#1;call main_#t~mem28#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~mem28#1 % 256);havoc main_#t~mem28#1; {2577#false} is VALID [2022-02-20 23:27:14,559 INFO L290 TraceCheckUtils]: 22: Hoare triple {2577#false} main_#t~switch22#1 := main_#t~switch22#1 || 5 == main_~_hj_k~0#1; {2577#false} is VALID [2022-02-20 23:27:14,559 INFO L290 TraceCheckUtils]: 23: Hoare triple {2577#false} assume main_#t~switch22#1;call main_#t~mem29#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~mem29#1 % 256;havoc main_#t~mem29#1; {2577#false} is VALID [2022-02-20 23:27:14,559 INFO L290 TraceCheckUtils]: 24: Hoare triple {2577#false} main_#t~switch22#1 := main_#t~switch22#1 || 4 == main_~_hj_k~0#1; {2577#false} is VALID [2022-02-20 23:27:14,560 INFO L290 TraceCheckUtils]: 25: Hoare triple {2577#false} assume main_#t~switch22#1;call main_#t~mem30#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~mem30#1 % 256);havoc main_#t~mem30#1; {2577#false} is VALID [2022-02-20 23:27:14,560 INFO L290 TraceCheckUtils]: 26: Hoare triple {2577#false} main_#t~switch22#1 := main_#t~switch22#1 || 3 == main_~_hj_k~0#1; {2577#false} is VALID [2022-02-20 23:27:14,560 INFO L290 TraceCheckUtils]: 27: Hoare triple {2577#false} assume main_#t~switch22#1;call main_#t~mem31#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~mem31#1 % 256);havoc main_#t~mem31#1; {2577#false} is VALID [2022-02-20 23:27:14,560 INFO L290 TraceCheckUtils]: 28: Hoare triple {2577#false} main_#t~switch22#1 := main_#t~switch22#1 || 2 == main_~_hj_k~0#1; {2577#false} is VALID [2022-02-20 23:27:14,561 INFO L290 TraceCheckUtils]: 29: Hoare triple {2577#false} assume main_#t~switch22#1;call main_#t~mem32#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~mem32#1 % 256);havoc main_#t~mem32#1; {2577#false} is VALID [2022-02-20 23:27:14,561 INFO L290 TraceCheckUtils]: 30: Hoare triple {2577#false} main_#t~switch22#1 := main_#t~switch22#1 || 1 == main_~_hj_k~0#1; {2577#false} is VALID [2022-02-20 23:27:14,561 INFO L290 TraceCheckUtils]: 31: Hoare triple {2577#false} assume main_#t~switch22#1;call main_#t~mem33#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~mem33#1 % 256;havoc main_#t~mem33#1; {2577#false} is VALID [2022-02-20 23:27:14,561 INFO L290 TraceCheckUtils]: 32: Hoare triple {2577#false} havoc main_#t~switch22#1; {2577#false} is VALID [2022-02-20 23:27:14,562 INFO L290 TraceCheckUtils]: 33: Hoare triple {2577#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)))); {2577#false} is VALID [2022-02-20 23:27:14,562 INFO L290 TraceCheckUtils]: 34: Hoare triple {2577#false} goto; {2577#false} is VALID [2022-02-20 23:27:14,562 INFO L290 TraceCheckUtils]: 35: Hoare triple {2577#false} goto; {2577#false} is VALID [2022-02-20 23:27:14,563 INFO L290 TraceCheckUtils]: 36: Hoare triple {2577#false} goto; {2577#false} is VALID [2022-02-20 23:27:14,563 INFO L290 TraceCheckUtils]: 37: Hoare triple {2577#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); {2577#false} is VALID [2022-02-20 23:27:14,563 INFO L290 TraceCheckUtils]: 38: Hoare triple {2577#false} assume !(main_~users~0#1.base == 0 && main_~users~0#1.offset == 0);call main_#t~mem51#1.base, main_#t~mem51#1.offset := read~$Pointer$(main_~users~0#1.base, 8 + main_~users~0#1.offset, 4);call write~$Pointer$(main_#t~mem51#1.base, main_#t~mem51#1.offset, main_~user~0#1.base, 8 + main_~user~0#1.offset, 4);havoc main_#t~mem51#1.base, main_#t~mem51#1.offset; {2577#false} is VALID [2022-02-20 23:27:14,563 INFO L290 TraceCheckUtils]: 39: Hoare triple {2577#false} call write~$Pointer$(0, 0, main_~user~0#1.base, 16 + main_~user~0#1.offset, 4);call main_#t~mem52#1.base, main_#t~mem52#1.offset := read~$Pointer$(main_~users~0#1.base, 8 + main_~users~0#1.offset, 4);call main_#t~mem53#1.base, main_#t~mem53#1.offset := read~$Pointer$(main_#t~mem52#1.base, 16 + main_#t~mem52#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 := read~int(main_#t~mem54#1.base, 20 + main_#t~mem54#1.offset, 4);call write~$Pointer$(main_#t~mem53#1.base, main_#t~mem53#1.offset - main_#t~mem55#1, main_~user~0#1.base, 12 + main_~user~0#1.offset, 4);havoc main_#t~mem52#1.base, main_#t~mem52#1.offset;havoc main_#t~mem53#1.base, main_#t~mem53#1.offset;havoc main_#t~mem54#1.base, main_#t~mem54#1.offset;havoc main_#t~mem55#1;call main_#t~mem56#1.base, main_#t~mem56#1.offset := read~$Pointer$(main_~users~0#1.base, 8 + main_~users~0#1.offset, 4);call main_#t~mem57#1.base, main_#t~mem57#1.offset := read~$Pointer$(main_#t~mem56#1.base, 16 + main_#t~mem56#1.offset, 4);call write~$Pointer$(main_~user~0#1.base, main_~user~0#1.offset, main_#t~mem57#1.base, 8 + main_#t~mem57#1.offset, 4);havoc main_#t~mem56#1.base, main_#t~mem56#1.offset;havoc main_#t~mem57#1.base, main_#t~mem57#1.offset;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 write~$Pointer$(main_~user~0#1.base, 8 + main_~user~0#1.offset, main_#t~mem58#1.base, 16 + main_#t~mem58#1.offset, 4);havoc main_#t~mem58#1.base, main_#t~mem58#1.offset; {2577#false} is VALID [2022-02-20 23:27:14,564 INFO L290 TraceCheckUtils]: 40: Hoare triple {2577#false} goto; {2577#false} is VALID [2022-02-20 23:27:14,564 INFO L290 TraceCheckUtils]: 41: Hoare triple {2577#false} havoc main_~_ha_bkt~0#1;call main_#t~mem59#1.base, main_#t~mem59#1.offset := read~$Pointer$(main_~users~0#1.base, 8 + main_~users~0#1.offset, 4);call main_#t~mem60#1 := read~int(main_#t~mem59#1.base, 12 + main_#t~mem59#1.offset, 4);main_#t~post61#1 := main_#t~mem60#1;call write~int(1 + main_#t~post61#1, main_#t~mem59#1.base, 12 + main_#t~mem59#1.offset, 4);havoc main_#t~mem59#1.base, main_#t~mem59#1.offset;havoc main_#t~mem60#1;havoc main_#t~post61#1; {2577#false} is VALID [2022-02-20 23:27:14,564 INFO L290 TraceCheckUtils]: 42: Hoare triple {2577#false} call main_#t~mem62#1.base, main_#t~mem62#1.offset := read~$Pointer$(main_~users~0#1.base, 8 + main_~users~0#1.offset, 4);call main_#t~mem63#1 := read~int(main_#t~mem62#1.base, 4 + main_#t~mem62#1.offset, 4);main_~_ha_bkt~0#1 := (if 0 == main_~_ha_hashv~0#1 || 0 == main_#t~mem63#1 - 1 then 0 else (if 1 == main_#t~mem63#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~mem63#1 - 1))) else (if 1 == main_~_ha_hashv~0#1 then (if 1 == main_#t~mem63#1 - 1 || 0 == main_#t~mem63#1 - 1 then main_#t~mem63#1 - 1 else (if main_#t~mem63#1 - 1 >= 0 then (main_#t~mem63#1 - 1) % 2 else ~bitwiseAnd(main_~_ha_hashv~0#1, main_#t~mem63#1 - 1))) else ~bitwiseAnd(main_~_ha_hashv~0#1, main_#t~mem63#1 - 1))));havoc main_#t~mem62#1.base, main_#t~mem62#1.offset;havoc main_#t~mem63#1; {2577#false} is VALID [2022-02-20 23:27:14,564 INFO L290 TraceCheckUtils]: 43: Hoare triple {2577#false} goto; {2577#false} is VALID [2022-02-20 23:27:14,565 INFO L290 TraceCheckUtils]: 44: Hoare triple {2577#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.base, main_#t~mem65#1.offset := read~$Pointer$(main_#t~mem64#1.base, main_#t~mem64#1.offset, 4);main_~_ha_head~0#1.base, main_~_ha_head~0#1.offset := main_#t~mem65#1.base, main_#t~mem65#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~mem64#1.base, main_#t~mem64#1.offset;havoc main_#t~mem65#1.base, main_#t~mem65#1.offset;call main_#t~mem66#1 := read~int(main_~_ha_head~0#1.base, 4 + main_~_ha_head~0#1.offset, 4);main_#t~post67#1 := main_#t~mem66#1;call write~int(1 + main_#t~post67#1, main_~_ha_head~0#1.base, 4 + main_~_ha_head~0#1.offset, 4);havoc main_#t~mem66#1;havoc main_#t~post67#1;call main_#t~mem68#1.base, main_#t~mem68#1.offset := read~$Pointer$(main_~_ha_head~0#1.base, main_~_ha_head~0#1.offset, 4);call write~$Pointer$(main_#t~mem68#1.base, main_#t~mem68#1.offset, main_~user~0#1.base, 24 + main_~user~0#1.offset, 4);havoc main_#t~mem68#1.base, main_#t~mem68#1.offset;call write~$Pointer$(0, 0, main_~user~0#1.base, 20 + main_~user~0#1.offset, 4);call main_#t~mem69#1.base, main_#t~mem69#1.offset := read~$Pointer$(main_~_ha_head~0#1.base, main_~_ha_head~0#1.offset, 4); {2577#false} is VALID [2022-02-20 23:27:14,565 INFO L290 TraceCheckUtils]: 45: Hoare triple {2577#false} assume main_#t~mem69#1.base != 0 || main_#t~mem69#1.offset != 0;havoc main_#t~mem69#1.base, main_#t~mem69#1.offset;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_~user~0#1.base, 8 + main_~user~0#1.offset, main_#t~mem70#1.base, 12 + main_#t~mem70#1.offset, 4);havoc main_#t~mem70#1.base, main_#t~mem70#1.offset; {2577#false} is VALID [2022-02-20 23:27:14,565 INFO L290 TraceCheckUtils]: 46: Hoare triple {2577#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~mem72#1 := read~int(main_~_ha_head~0#1.base, 4 + main_~_ha_head~0#1.offset, 4);call main_#t~mem71#1 := read~int(main_~_ha_head~0#1.base, 8 + main_~_ha_head~0#1.offset, 4);main_#t~short75#1 := main_#t~mem72#1 % 4294967296 >= 10 * (1 + main_#t~mem71#1) % 4294967296; {2577#false} is VALID [2022-02-20 23:27:14,566 INFO L290 TraceCheckUtils]: 47: Hoare triple {2577#false} assume main_#t~short75#1;call main_#t~mem73#1.base, main_#t~mem73#1.offset := read~$Pointer$(main_~user~0#1.base, 8 + main_~user~0#1.offset, 4);call main_#t~mem74#1 := read~int(main_#t~mem73#1.base, 36 + main_#t~mem73#1.offset, 4);main_#t~short75#1 := 0 == main_#t~mem74#1 % 4294967296; {2577#false} is VALID [2022-02-20 23:27:14,566 INFO L290 TraceCheckUtils]: 48: Hoare triple {2577#false} assume !main_#t~short75#1;havoc main_#t~mem72#1;havoc main_#t~mem71#1;havoc main_#t~mem73#1.base, main_#t~mem73#1.offset;havoc main_#t~mem74#1;havoc main_#t~short75#1; {2577#false} is VALID [2022-02-20 23:27:14,566 INFO L290 TraceCheckUtils]: 49: Hoare triple {2577#false} goto; {2577#false} is VALID [2022-02-20 23:27:14,566 INFO L290 TraceCheckUtils]: 50: Hoare triple {2577#false} goto; {2577#false} is VALID [2022-02-20 23:27:14,567 INFO L290 TraceCheckUtils]: 51: Hoare triple {2577#false} goto; {2577#false} is VALID [2022-02-20 23:27:14,567 INFO L290 TraceCheckUtils]: 52: Hoare triple {2577#false} goto; {2577#false} is VALID [2022-02-20 23:27:14,567 INFO L290 TraceCheckUtils]: 53: Hoare triple {2577#false} call main_#t~mem3#1 := read~int(main_~#i~0#1.base, main_~#i~0#1.offset, 4);main_#t~post4#1 := main_#t~mem3#1;call write~int(1 + main_#t~post4#1, main_~#i~0#1.base, main_~#i~0#1.offset, 4);havoc main_#t~mem3#1;havoc main_#t~post4#1; {2577#false} is VALID [2022-02-20 23:27:14,567 INFO L290 TraceCheckUtils]: 54: Hoare triple {2577#false} call main_#t~mem5#1 := read~int(main_~#i~0#1.base, main_~#i~0#1.offset, 4); {2577#false} is VALID [2022-02-20 23:27:14,568 INFO L290 TraceCheckUtils]: 55: Hoare triple {2577#false} assume !(main_#t~mem5#1 < 1000);havoc main_#t~mem5#1; {2577#false} is VALID [2022-02-20 23:27:14,568 INFO L290 TraceCheckUtils]: 56: Hoare triple {2577#false} call write~int(0, main_~#i~0#1.base, main_~#i~0#1.offset, 4); {2577#false} is VALID [2022-02-20 23:27:14,568 INFO L290 TraceCheckUtils]: 57: Hoare triple {2577#false} call main_#t~mem144#1 := read~int(main_~#i~0#1.base, main_~#i~0#1.offset, 4); {2577#false} is VALID [2022-02-20 23:27:14,568 INFO L290 TraceCheckUtils]: 58: Hoare triple {2577#false} assume !(main_#t~mem144#1 < 1000);havoc main_#t~mem144#1; {2577#false} is VALID [2022-02-20 23:27:14,568 INFO L290 TraceCheckUtils]: 59: Hoare triple {2577#false} main_~user~0#1.base, main_~user~0#1.offset := main_~users~0#1.base, main_~users~0#1.offset; {2577#false} is VALID [2022-02-20 23:27:14,569 INFO L290 TraceCheckUtils]: 60: Hoare triple {2577#false} assume !!(main_~user~0#1.base != 0 || main_~user~0#1.offset != 0); {2577#false} is VALID [2022-02-20 23:27:14,569 INFO L290 TraceCheckUtils]: 61: Hoare triple {2577#false} assume !false; {2577#false} is VALID [2022-02-20 23:27:14,569 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:27:14,570 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 23:27:14,570 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 23:27:14,570 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1532964272] [2022-02-20 23:27:14,570 WARN L317 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-02-20 23:27:14,571 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1298074922] [2022-02-20 23:27:14,571 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1298074922] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:27:14,571 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:27:14,571 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 23:27:14,572 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [287602065] [2022-02-20 23:27:14,572 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:27:14,572 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 20.666666666666668) internal successors, (62), 3 states have internal predecessors, (62), 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 62 [2022-02-20 23:27:14,573 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:27:14,573 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 20.666666666666668) internal successors, (62), 3 states have internal predecessors, (62), 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:27:14,631 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 62 edges. 62 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:27:14,631 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 23:27:14,631 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 23:27:14,632 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 23:27:14,632 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 23:27:14,632 INFO L87 Difference]: Start difference. First operand 183 states and 238 transitions. Second operand has 3 states, 3 states have (on average 20.666666666666668) internal successors, (62), 3 states have internal predecessors, (62), 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:27:15,958 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:27:15,959 INFO L93 Difference]: Finished difference Result 383 states and 503 transitions. [2022-02-20 23:27:15,959 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 23:27:15,959 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 20.666666666666668) internal successors, (62), 3 states have internal predecessors, (62), 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 62 [2022-02-20 23:27:15,959 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:27:15,960 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 20.666666666666668) internal successors, (62), 3 states have internal predecessors, (62), 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:27:15,965 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 501 transitions. [2022-02-20 23:27:15,965 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 20.666666666666668) internal successors, (62), 3 states have internal predecessors, (62), 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:27:15,970 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 501 transitions. [2022-02-20 23:27:15,970 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 501 transitions. [2022-02-20 23:27:16,387 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 501 edges. 501 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:27:16,390 INFO L225 Difference]: With dead ends: 383 [2022-02-20 23:27:16,390 INFO L226 Difference]: Without dead ends: 204 [2022-02-20 23:27:16,391 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 60 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:27:16,392 INFO L933 BasicCegarLoop]: 216 mSDtfsCounter, 9 mSDsluCounter, 201 mSDsCounter, 0 mSdLazyCounter, 44 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 417 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:27:16,393 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [9 Valid, 417 Invalid, 72 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 44 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 23:27:16,399 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 204 states. [2022-02-20 23:27:16,413 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 204 to 203. [2022-02-20 23:27:16,413 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:27:16,417 INFO L82 GeneralOperation]: Start isEquivalent. First operand 204 states. Second operand has 203 states, 197 states have (on average 1.2791878172588833) internal successors, (252), 198 states have internal predecessors, (252), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-02-20 23:27:16,418 INFO L74 IsIncluded]: Start isIncluded. First operand 204 states. Second operand has 203 states, 197 states have (on average 1.2791878172588833) internal successors, (252), 198 states have internal predecessors, (252), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-02-20 23:27:16,419 INFO L87 Difference]: Start difference. First operand 204 states. Second operand has 203 states, 197 states have (on average 1.2791878172588833) internal successors, (252), 198 states have internal predecessors, (252), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-02-20 23:27:16,424 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:27:16,424 INFO L93 Difference]: Finished difference Result 204 states and 259 transitions. [2022-02-20 23:27:16,425 INFO L276 IsEmpty]: Start isEmpty. Operand 204 states and 259 transitions. [2022-02-20 23:27:16,425 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:27:16,425 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:27:16,426 INFO L74 IsIncluded]: Start isIncluded. First operand has 203 states, 197 states have (on average 1.2791878172588833) internal successors, (252), 198 states have internal predecessors, (252), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand 204 states. [2022-02-20 23:27:16,426 INFO L87 Difference]: Start difference. First operand has 203 states, 197 states have (on average 1.2791878172588833) internal successors, (252), 198 states have internal predecessors, (252), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand 204 states. [2022-02-20 23:27:16,432 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:27:16,432 INFO L93 Difference]: Finished difference Result 204 states and 259 transitions. [2022-02-20 23:27:16,432 INFO L276 IsEmpty]: Start isEmpty. Operand 204 states and 259 transitions. [2022-02-20 23:27:16,433 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:27:16,433 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:27:16,433 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:27:16,433 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:27:16,434 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 203 states, 197 states have (on average 1.2791878172588833) internal successors, (252), 198 states have internal predecessors, (252), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-02-20 23:27:16,439 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 203 states to 203 states and 258 transitions. [2022-02-20 23:27:16,439 INFO L78 Accepts]: Start accepts. Automaton has 203 states and 258 transitions. Word has length 62 [2022-02-20 23:27:16,440 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:27:16,440 INFO L470 AbstractCegarLoop]: Abstraction has 203 states and 258 transitions. [2022-02-20 23:27:16,440 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 20.666666666666668) internal successors, (62), 3 states have internal predecessors, (62), 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:27:16,440 INFO L276 IsEmpty]: Start isEmpty. Operand 203 states and 258 transitions. [2022-02-20 23:27:16,441 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2022-02-20 23:27:16,441 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:27:16,442 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] [2022-02-20 23:27:16,477 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:27:16,667 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:27:16,668 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 23:27:16,668 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:27:16,668 INFO L85 PathProgramCache]: Analyzing trace with hash -539986907, now seen corresponding path program 1 times [2022-02-20 23:27:16,668 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 23:27:16,668 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1507906231] [2022-02-20 23:27:16,669 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:27:16,669 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 23:27:16,804 ERROR L252 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-02-20 23:27:16,809 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [220290750] [2022-02-20 23:27:16,809 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:27:16,809 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 23:27:16,809 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 23:27:16,812 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:27:16,839 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:27:17,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:27:17,418 INFO L263 TraceCheckSpWp]: Trace formula consists of 1573 conjuncts, 3 conjunts are in the unsatisfiable core [2022-02-20 23:27:17,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:27:17,465 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 23:27:17,644 INFO L290 TraceCheckUtils]: 0: Hoare triple {3859#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); {3859#true} is VALID [2022-02-20 23:27:17,645 INFO L290 TraceCheckUtils]: 1: Hoare triple {3859#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc6#1.base, main_#t~malloc6#1.offset, main_#t~mem7#1, main_#t~mem8#1, main_#t~mem9#1, main_#t~mem11#1, main_#t~mem10#1, main_#t~mem12#1, main_#t~mem13#1, main_#t~mem15#1, main_#t~mem14#1, main_#t~mem16#1, main_#t~mem17#1, main_#t~mem19#1, main_#t~mem18#1, main_#t~mem20#1, main_#t~mem21#1, main_#t~switch22#1, main_#t~mem23#1, main_#t~mem24#1, main_#t~mem25#1, main_#t~mem26#1, main_#t~mem27#1, main_#t~mem28#1, main_#t~mem29#1, main_#t~mem30#1, main_#t~mem31#1, main_#t~mem32#1, main_#t~mem33#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~malloc34#1.base, main_#t~malloc34#1.offset, main_#t~mem35#1.base, main_#t~mem35#1.offset, main_#t~mem36#1.base, main_#t~mem36#1.offset, main_#t~memset~res37#1.base, main_#t~memset~res37#1.offset, main_#t~mem38#1.base, main_#t~mem38#1.offset, main_#t~mem39#1.base, main_#t~mem39#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~malloc43#1.base, main_#t~malloc43#1.offset, main_#t~mem44#1.base, main_#t~mem44#1.offset, main_#t~mem45#1.base, main_#t~mem45#1.offset, main_#t~mem46#1.base, main_#t~mem46#1.offset, main_#t~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~memset~res50#1.base, main_#t~memset~res50#1.offset, main_#t~mem51#1.base, main_#t~mem51#1.offset, main_#t~mem52#1.base, main_#t~mem52#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, main_#t~mem56#1.base, main_#t~mem56#1.offset, main_#t~mem57#1.base, main_#t~mem57#1.offset, main_#t~mem58#1.base, main_#t~mem58#1.offset, main_#t~mem59#1.base, main_#t~mem59#1.offset, main_#t~mem60#1, main_#t~post61#1, main_#t~mem62#1.base, main_#t~mem62#1.offset, main_#t~mem63#1, main_#t~mem64#1.base, main_#t~mem64#1.offset, main_#t~mem65#1.base, main_#t~mem65#1.offset, main_#t~mem66#1, main_#t~post67#1, main_#t~mem68#1.base, main_#t~mem68#1.offset, main_#t~mem69#1.base, main_#t~mem69#1.offset, main_#t~mem70#1.base, main_#t~mem70#1.offset, main_#t~mem72#1, main_#t~mem71#1, main_#t~mem73#1.base, main_#t~mem73#1.offset, main_#t~mem74#1, main_#t~short75#1, main_#t~mem76#1.base, main_#t~mem76#1.offset, main_#t~mem77#1, main_#t~malloc78#1.base, main_#t~malloc78#1.offset, main_#t~mem79#1.base, main_#t~mem79#1.offset, main_#t~mem80#1.base, main_#t~mem80#1.offset, main_#t~mem81#1.base, main_#t~mem81#1.offset, main_#t~mem82#1, main_#t~memset~res83#1.base, main_#t~memset~res83#1.offset, main_#t~mem84#1.base, main_#t~mem84#1.offset, main_#t~mem85#1.base, main_#t~mem85#1.offset, main_#t~mem88#1, main_#t~mem86#1.base, main_#t~mem86#1.offset, main_#t~mem87#1, main_#t~mem89#1.base, main_#t~mem89#1.offset, main_#t~mem92#1, main_#t~mem90#1.base, main_#t~mem90#1.offset, main_#t~mem91#1, main_#t~ite93#1, main_#t~mem94#1.base, main_#t~mem94#1.offset, main_#t~mem98#1.base, main_#t~mem98#1.offset, main_#t~mem99#1.base, main_#t~mem99#1.offset, main_#t~mem100#1.base, main_#t~mem100#1.offset, main_#t~mem101#1.base, main_#t~mem101#1.offset, main_#t~mem104#1, main_#t~mem102#1.base, main_#t~mem102#1.offset, main_#t~mem103#1, main_#t~mem105#1.base, main_#t~mem105#1.offset, main_#t~mem106#1, main_#t~pre107#1, main_#t~mem108#1.base, main_#t~mem108#1.offset, main_#t~mem109#1, main_#t~mem110#1.base, main_#t~mem110#1.offset, main_#t~mem111#1, main_#t~post112#1, main_#t~mem116#1, main_#t~mem114#1, main_#t~mem113#1.base, main_#t~mem113#1.offset, main_#t~mem115#1, main_#t~mem117#1, main_#t~post118#1, main_#t~mem119#1.base, main_#t~mem119#1.offset, main_#t~mem120#1.base, main_#t~mem120#1.offset, main_#t~mem121#1.base, main_#t~mem121#1.offset, main_#t~post95#1, main_#t~mem96#1.base, main_#t~mem96#1.offset, main_#t~mem97#1, main_#t~mem122#1.base, main_#t~mem122#1.offset, main_#t~mem123#1.base, main_#t~mem123#1.offset, main_#t~mem124#1.base, main_#t~mem124#1.offset, main_#t~mem125#1, main_#t~mem126#1.base, main_#t~mem126#1.offset, main_#t~mem127#1, main_#t~post128#1, main_#t~mem129#1.base, main_#t~mem129#1.offset, main_#t~mem130#1.base, main_#t~mem130#1.offset, main_#t~mem131#1.base, main_#t~mem131#1.offset, main_#t~mem132#1.base, main_#t~mem132#1.offset, main_#t~mem135#1, main_#t~mem133#1.base, main_#t~mem133#1.offset, main_#t~mem134#1, main_#t~ite138#1, main_#t~mem136#1.base, main_#t~mem136#1.offset, main_#t~mem137#1, main_#t~mem139#1.base, main_#t~mem139#1.offset, main_#t~mem140#1, main_#t~mem141#1.base, main_#t~mem141#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~mem3#1, main_#t~post4#1, main_#t~mem5#1, main_#t~mem146#1, main_#t~mem145#1, main_#t~mem147#1, main_#t~mem148#1, main_#t~mem150#1, main_#t~mem149#1, main_#t~mem151#1, main_#t~mem152#1, main_#t~mem154#1, main_#t~mem153#1, main_#t~mem155#1, main_#t~mem156#1, main_#t~switch157#1, main_#t~mem158#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_~_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~mem169#1.base, main_#t~mem169#1.offset, main_#t~mem170#1, main_#t~mem171#1.base, main_#t~mem171#1.offset, 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, main_#t~mem179#1, main_#t~mem180#1, main_#t~short181#1, main_#t~mem182#1.base, main_#t~mem182#1.offset, main_#t~ret183#1, main_#t~mem184#1.base, main_#t~mem184#1.offset, main_#t~mem185#1.base, main_#t~mem185#1.offset, main_#t~mem186#1.base, main_#t~mem186#1.offset, main_#t~mem187#1, main_~_hf_bkt~0#1, main_~_hf_hashv~0#1, main_#t~mem188#1.base, main_#t~mem188#1.offset, main_#t~mem189#1.base, main_#t~mem189#1.offset, main_#t~short190#1, main_#t~mem191#1.base, main_#t~mem191#1.offset, main_#t~mem192#1.base, main_#t~mem192#1.offset, main_#t~mem193#1.base, main_#t~mem193#1.offset, main_#t~mem194#1.base, main_#t~mem194#1.offset, main_#t~mem195#1.base, main_#t~mem195#1.offset, main_#t~mem196#1.base, main_#t~mem196#1.offset, main_#t~mem197#1.base, main_#t~mem197#1.offset, main_#t~mem198#1.base, main_#t~mem198#1.offset, main_#t~mem199#1, main_#t~mem200#1.base, main_#t~mem200#1.offset, main_#t~mem201#1.base, main_#t~mem201#1.offset, main_#t~mem202#1.base, main_#t~mem202#1.offset, main_#t~mem203#1, main_#t~mem204#1.base, main_#t~mem204#1.offset, main_#t~mem205#1.base, main_#t~mem205#1.offset, main_#t~mem206#1.base, main_#t~mem206#1.offset, main_#t~mem207#1.base, main_#t~mem207#1.offset, main_#t~mem208#1.base, main_#t~mem208#1.offset, main_#t~mem209#1, main_#t~mem210#1.base, main_#t~mem210#1.offset, main_#t~mem213#1, main_#t~mem211#1.base, main_#t~mem211#1.offset, main_#t~mem212#1, main_#t~mem214#1.base, main_#t~mem214#1.offset, main_#t~mem215#1.base, main_#t~mem215#1.offset, main_#t~mem216#1, main_#t~post217#1, main_#t~mem218#1.base, main_#t~mem218#1.offset, main_#t~mem219#1.base, main_#t~mem219#1.offset, main_#t~mem220#1.base, main_#t~mem220#1.offset, main_#t~mem221#1.base, main_#t~mem221#1.offset, main_#t~mem222#1.base, main_#t~mem222#1.offset, main_#t~mem223#1.base, main_#t~mem223#1.offset, main_#t~mem224#1.base, main_#t~mem224#1.offset, main_#t~mem225#1.base, main_#t~mem225#1.offset, main_~_hd_head~0#1.base, main_~_hd_head~0#1.offset, main_#t~mem226#1.base, main_#t~mem226#1.offset, main_#t~mem227#1, main_#t~post228#1, main_~_hd_bkt~0#1, main_~_hd_hh_del~0#1.base, main_~_hd_hh_del~0#1.offset, main_#t~mem142#1, main_#t~post143#1, main_#t~mem144#1, main_#t~mem229#1.base, main_#t~mem229#1.offset, main_#t~ite231#1.base, main_#t~ite231#1.offset, main_#t~mem230#1.base, main_#t~mem230#1.offset, main_#t~mem234#1.base, main_#t~mem234#1.offset, main_#t~mem235#1.base, main_#t~mem235#1.offset, main_#t~short236#1, main_#t~mem237#1.base, main_#t~mem237#1.offset, main_#t~mem238#1.base, main_#t~mem238#1.offset, main_#t~mem239#1.base, main_#t~mem239#1.offset, main_#t~mem240#1.base, main_#t~mem240#1.offset, main_#t~mem241#1.base, main_#t~mem241#1.offset, main_#t~mem242#1.base, main_#t~mem242#1.offset, main_#t~mem243#1.base, main_#t~mem243#1.offset, main_#t~mem244#1.base, main_#t~mem244#1.offset, main_#t~mem245#1, main_#t~mem246#1.base, main_#t~mem246#1.offset, main_#t~mem247#1.base, main_#t~mem247#1.offset, main_#t~mem248#1.base, main_#t~mem248#1.offset, main_#t~mem249#1, main_#t~mem250#1.base, main_#t~mem250#1.offset, main_#t~mem251#1.base, main_#t~mem251#1.offset, main_#t~mem252#1.base, main_#t~mem252#1.offset, main_#t~mem253#1.base, main_#t~mem253#1.offset, main_#t~mem254#1.base, main_#t~mem254#1.offset, main_#t~mem255#1, main_#t~mem256#1.base, main_#t~mem256#1.offset, main_#t~mem259#1, main_#t~mem257#1.base, main_#t~mem257#1.offset, main_#t~mem258#1, main_#t~mem260#1.base, main_#t~mem260#1.offset, main_#t~mem261#1.base, main_#t~mem261#1.offset, main_#t~mem262#1, main_#t~post263#1, main_#t~mem264#1.base, main_#t~mem264#1.offset, main_#t~mem265#1.base, main_#t~mem265#1.offset, main_#t~mem266#1.base, main_#t~mem266#1.offset, main_#t~mem267#1.base, main_#t~mem267#1.offset, main_#t~mem268#1.base, main_#t~mem268#1.offset, main_#t~mem269#1.base, main_#t~mem269#1.offset, main_#t~mem270#1.base, main_#t~mem270#1.offset, main_#t~mem271#1.base, main_#t~mem271#1.offset, main_~_hd_head~1#1.base, main_~_hd_head~1#1.offset, main_#t~mem272#1.base, main_#t~mem272#1.offset, main_#t~mem273#1, main_#t~post274#1, main_~_hd_bkt~1#1, main_~_hd_hh_del~1#1.base, main_~_hd_hh_del~1#1.offset, main_#t~ite233#1.base, main_#t~ite233#1.offset, main_#t~mem232#1.base, main_#t~mem232#1.offset, main_~#i~0#1.base, main_~#i~0#1.offset, main_~user~0#1.base, main_~user~0#1.offset, main_~tmp~0#1.base, main_~tmp~0#1.offset, main_~users~0#1.base, main_~users~0#1.offset, main_~temp~0#1.base, main_~temp~0#1.offset;call main_~#i~0#1.base, main_~#i~0#1.offset := #Ultimate.allocOnStack(4);havoc main_~user~0#1.base, main_~user~0#1.offset;havoc main_~tmp~0#1.base, main_~tmp~0#1.offset;main_~users~0#1.base, main_~users~0#1.offset := 0, 0;call write~int(0, main_~#i~0#1.base, main_~#i~0#1.offset, 4); {3859#true} is VALID [2022-02-20 23:27:17,647 INFO L290 TraceCheckUtils]: 2: Hoare triple {3859#true} call main_#t~mem5#1 := read~int(main_~#i~0#1.base, main_~#i~0#1.offset, 4); {3859#true} is VALID [2022-02-20 23:27:17,648 INFO L290 TraceCheckUtils]: 3: Hoare triple {3859#true} assume !!(main_#t~mem5#1 < 1000);havoc main_#t~mem5#1;call main_#t~malloc6#1.base, main_#t~malloc6#1.offset := #Ultimate.allocOnHeap(40);main_~user~0#1.base, main_~user~0#1.offset := main_#t~malloc6#1.base, main_#t~malloc6#1.offset;havoc main_#t~malloc6#1.base, main_#t~malloc6#1.offset; {3859#true} is VALID [2022-02-20 23:27:17,650 INFO L290 TraceCheckUtils]: 4: Hoare triple {3859#true} assume !(main_~user~0#1.base == 0 && main_~user~0#1.offset == 0); {3859#true} is VALID [2022-02-20 23:27:17,650 INFO L290 TraceCheckUtils]: 5: Hoare triple {3859#true} call main_#t~mem7#1 := read~int(main_~#i~0#1.base, main_~#i~0#1.offset, 4);call write~int(main_#t~mem7#1, main_~user~0#1.base, main_~user~0#1.offset, 4);havoc main_#t~mem7#1;call main_#t~mem8#1 := read~int(main_~#i~0#1.base, main_~#i~0#1.offset, 4);call main_#t~mem9#1 := read~int(main_~#i~0#1.base, main_~#i~0#1.offset, 4);call write~int(main_#t~mem8#1 * main_#t~mem9#1, main_~user~0#1.base, 4 + main_~user~0#1.offset, 4);havoc main_#t~mem8#1;havoc main_#t~mem9#1; {3859#true} is VALID [2022-02-20 23:27:17,650 INFO L290 TraceCheckUtils]: 6: Hoare triple {3859#true} havoc main_~_ha_hashv~0#1; {3859#true} is VALID [2022-02-20 23:27:17,651 INFO L290 TraceCheckUtils]: 7: Hoare triple {3859#true} goto; {3859#true} is VALID [2022-02-20 23:27:17,651 INFO L290 TraceCheckUtils]: 8: Hoare triple {3859#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; {3888#(<= |ULTIMATE.start_main_~_hj_k~0#1| 4)} is VALID [2022-02-20 23:27:17,652 INFO L290 TraceCheckUtils]: 9: Hoare triple {3888#(<= |ULTIMATE.start_main_~_hj_k~0#1| 4)} assume !(main_~_hj_k~0#1 % 4294967296 >= 12); {3888#(<= |ULTIMATE.start_main_~_hj_k~0#1| 4)} is VALID [2022-02-20 23:27:17,652 INFO L290 TraceCheckUtils]: 10: Hoare triple {3888#(<= |ULTIMATE.start_main_~_hj_k~0#1| 4)} main_~_ha_hashv~0#1 := 4 + main_~_ha_hashv~0#1;main_#t~switch22#1 := 11 == main_~_hj_k~0#1; {3895#(not |ULTIMATE.start_main_#t~switch22#1|)} is VALID [2022-02-20 23:27:17,658 INFO L290 TraceCheckUtils]: 11: Hoare triple {3895#(not |ULTIMATE.start_main_#t~switch22#1|)} assume main_#t~switch22#1;call main_#t~mem23#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~mem23#1 % 256);havoc main_#t~mem23#1; {3860#false} is VALID [2022-02-20 23:27:17,658 INFO L290 TraceCheckUtils]: 12: Hoare triple {3860#false} main_#t~switch22#1 := main_#t~switch22#1 || 10 == main_~_hj_k~0#1; {3860#false} is VALID [2022-02-20 23:27:17,659 INFO L290 TraceCheckUtils]: 13: Hoare triple {3860#false} assume main_#t~switch22#1;call main_#t~mem24#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~mem24#1 % 256);havoc main_#t~mem24#1; {3860#false} is VALID [2022-02-20 23:27:17,659 INFO L290 TraceCheckUtils]: 14: Hoare triple {3860#false} main_#t~switch22#1 := main_#t~switch22#1 || 9 == main_~_hj_k~0#1; {3860#false} is VALID [2022-02-20 23:27:17,659 INFO L290 TraceCheckUtils]: 15: Hoare triple {3860#false} assume main_#t~switch22#1;call main_#t~mem25#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~mem25#1 % 256);havoc main_#t~mem25#1; {3860#false} is VALID [2022-02-20 23:27:17,659 INFO L290 TraceCheckUtils]: 16: Hoare triple {3860#false} main_#t~switch22#1 := main_#t~switch22#1 || 8 == main_~_hj_k~0#1; {3860#false} is VALID [2022-02-20 23:27:17,660 INFO L290 TraceCheckUtils]: 17: Hoare triple {3860#false} assume main_#t~switch22#1;call main_#t~mem26#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~mem26#1 % 256);havoc main_#t~mem26#1; {3860#false} is VALID [2022-02-20 23:27:17,660 INFO L290 TraceCheckUtils]: 18: Hoare triple {3860#false} main_#t~switch22#1 := main_#t~switch22#1 || 7 == main_~_hj_k~0#1; {3860#false} is VALID [2022-02-20 23:27:17,660 INFO L290 TraceCheckUtils]: 19: Hoare triple {3860#false} assume main_#t~switch22#1;call main_#t~mem27#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~mem27#1 % 256);havoc main_#t~mem27#1; {3860#false} is VALID [2022-02-20 23:27:17,660 INFO L290 TraceCheckUtils]: 20: Hoare triple {3860#false} main_#t~switch22#1 := main_#t~switch22#1 || 6 == main_~_hj_k~0#1; {3860#false} is VALID [2022-02-20 23:27:17,664 INFO L290 TraceCheckUtils]: 21: Hoare triple {3860#false} assume main_#t~switch22#1;call main_#t~mem28#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~mem28#1 % 256);havoc main_#t~mem28#1; {3860#false} is VALID [2022-02-20 23:27:17,664 INFO L290 TraceCheckUtils]: 22: Hoare triple {3860#false} main_#t~switch22#1 := main_#t~switch22#1 || 5 == main_~_hj_k~0#1; {3860#false} is VALID [2022-02-20 23:27:17,664 INFO L290 TraceCheckUtils]: 23: Hoare triple {3860#false} assume main_#t~switch22#1;call main_#t~mem29#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~mem29#1 % 256;havoc main_#t~mem29#1; {3860#false} is VALID [2022-02-20 23:27:17,666 INFO L290 TraceCheckUtils]: 24: Hoare triple {3860#false} main_#t~switch22#1 := main_#t~switch22#1 || 4 == main_~_hj_k~0#1; {3860#false} is VALID [2022-02-20 23:27:17,667 INFO L290 TraceCheckUtils]: 25: Hoare triple {3860#false} assume main_#t~switch22#1;call main_#t~mem30#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~mem30#1 % 256);havoc main_#t~mem30#1; {3860#false} is VALID [2022-02-20 23:27:17,669 INFO L290 TraceCheckUtils]: 26: Hoare triple {3860#false} main_#t~switch22#1 := main_#t~switch22#1 || 3 == main_~_hj_k~0#1; {3860#false} is VALID [2022-02-20 23:27:17,669 INFO L290 TraceCheckUtils]: 27: Hoare triple {3860#false} assume main_#t~switch22#1;call main_#t~mem31#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~mem31#1 % 256);havoc main_#t~mem31#1; {3860#false} is VALID [2022-02-20 23:27:17,669 INFO L290 TraceCheckUtils]: 28: Hoare triple {3860#false} main_#t~switch22#1 := main_#t~switch22#1 || 2 == main_~_hj_k~0#1; {3860#false} is VALID [2022-02-20 23:27:17,669 INFO L290 TraceCheckUtils]: 29: Hoare triple {3860#false} assume main_#t~switch22#1;call main_#t~mem32#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~mem32#1 % 256);havoc main_#t~mem32#1; {3860#false} is VALID [2022-02-20 23:27:17,669 INFO L290 TraceCheckUtils]: 30: Hoare triple {3860#false} main_#t~switch22#1 := main_#t~switch22#1 || 1 == main_~_hj_k~0#1; {3860#false} is VALID [2022-02-20 23:27:17,670 INFO L290 TraceCheckUtils]: 31: Hoare triple {3860#false} assume main_#t~switch22#1;call main_#t~mem33#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~mem33#1 % 256;havoc main_#t~mem33#1; {3860#false} is VALID [2022-02-20 23:27:17,670 INFO L290 TraceCheckUtils]: 32: Hoare triple {3860#false} havoc main_#t~switch22#1; {3860#false} is VALID [2022-02-20 23:27:17,670 INFO L290 TraceCheckUtils]: 33: Hoare triple {3860#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)))); {3860#false} is VALID [2022-02-20 23:27:17,670 INFO L290 TraceCheckUtils]: 34: Hoare triple {3860#false} goto; {3860#false} is VALID [2022-02-20 23:27:17,670 INFO L290 TraceCheckUtils]: 35: Hoare triple {3860#false} goto; {3860#false} is VALID [2022-02-20 23:27:17,670 INFO L290 TraceCheckUtils]: 36: Hoare triple {3860#false} goto; {3860#false} is VALID [2022-02-20 23:27:17,671 INFO L290 TraceCheckUtils]: 37: Hoare triple {3860#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); {3860#false} is VALID [2022-02-20 23:27:17,671 INFO L290 TraceCheckUtils]: 38: Hoare triple {3860#false} assume !(main_~users~0#1.base == 0 && main_~users~0#1.offset == 0);call main_#t~mem51#1.base, main_#t~mem51#1.offset := read~$Pointer$(main_~users~0#1.base, 8 + main_~users~0#1.offset, 4);call write~$Pointer$(main_#t~mem51#1.base, main_#t~mem51#1.offset, main_~user~0#1.base, 8 + main_~user~0#1.offset, 4);havoc main_#t~mem51#1.base, main_#t~mem51#1.offset; {3860#false} is VALID [2022-02-20 23:27:17,671 INFO L290 TraceCheckUtils]: 39: Hoare triple {3860#false} call write~$Pointer$(0, 0, main_~user~0#1.base, 16 + main_~user~0#1.offset, 4);call main_#t~mem52#1.base, main_#t~mem52#1.offset := read~$Pointer$(main_~users~0#1.base, 8 + main_~users~0#1.offset, 4);call main_#t~mem53#1.base, main_#t~mem53#1.offset := read~$Pointer$(main_#t~mem52#1.base, 16 + main_#t~mem52#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 := read~int(main_#t~mem54#1.base, 20 + main_#t~mem54#1.offset, 4);call write~$Pointer$(main_#t~mem53#1.base, main_#t~mem53#1.offset - main_#t~mem55#1, main_~user~0#1.base, 12 + main_~user~0#1.offset, 4);havoc main_#t~mem52#1.base, main_#t~mem52#1.offset;havoc main_#t~mem53#1.base, main_#t~mem53#1.offset;havoc main_#t~mem54#1.base, main_#t~mem54#1.offset;havoc main_#t~mem55#1;call main_#t~mem56#1.base, main_#t~mem56#1.offset := read~$Pointer$(main_~users~0#1.base, 8 + main_~users~0#1.offset, 4);call main_#t~mem57#1.base, main_#t~mem57#1.offset := read~$Pointer$(main_#t~mem56#1.base, 16 + main_#t~mem56#1.offset, 4);call write~$Pointer$(main_~user~0#1.base, main_~user~0#1.offset, main_#t~mem57#1.base, 8 + main_#t~mem57#1.offset, 4);havoc main_#t~mem56#1.base, main_#t~mem56#1.offset;havoc main_#t~mem57#1.base, main_#t~mem57#1.offset;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 write~$Pointer$(main_~user~0#1.base, 8 + main_~user~0#1.offset, main_#t~mem58#1.base, 16 + main_#t~mem58#1.offset, 4);havoc main_#t~mem58#1.base, main_#t~mem58#1.offset; {3860#false} is VALID [2022-02-20 23:27:17,671 INFO L290 TraceCheckUtils]: 40: Hoare triple {3860#false} goto; {3860#false} is VALID [2022-02-20 23:27:17,671 INFO L290 TraceCheckUtils]: 41: Hoare triple {3860#false} havoc main_~_ha_bkt~0#1;call main_#t~mem59#1.base, main_#t~mem59#1.offset := read~$Pointer$(main_~users~0#1.base, 8 + main_~users~0#1.offset, 4);call main_#t~mem60#1 := read~int(main_#t~mem59#1.base, 12 + main_#t~mem59#1.offset, 4);main_#t~post61#1 := main_#t~mem60#1;call write~int(1 + main_#t~post61#1, main_#t~mem59#1.base, 12 + main_#t~mem59#1.offset, 4);havoc main_#t~mem59#1.base, main_#t~mem59#1.offset;havoc main_#t~mem60#1;havoc main_#t~post61#1; {3860#false} is VALID [2022-02-20 23:27:17,672 INFO L290 TraceCheckUtils]: 42: Hoare triple {3860#false} call main_#t~mem62#1.base, main_#t~mem62#1.offset := read~$Pointer$(main_~users~0#1.base, 8 + main_~users~0#1.offset, 4);call main_#t~mem63#1 := read~int(main_#t~mem62#1.base, 4 + main_#t~mem62#1.offset, 4);main_~_ha_bkt~0#1 := (if 0 == main_~_ha_hashv~0#1 || 0 == main_#t~mem63#1 - 1 then 0 else (if 1 == main_#t~mem63#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~mem63#1 - 1))) else (if 1 == main_~_ha_hashv~0#1 then (if 1 == main_#t~mem63#1 - 1 || 0 == main_#t~mem63#1 - 1 then main_#t~mem63#1 - 1 else (if main_#t~mem63#1 - 1 >= 0 then (main_#t~mem63#1 - 1) % 2 else ~bitwiseAnd(main_~_ha_hashv~0#1, main_#t~mem63#1 - 1))) else ~bitwiseAnd(main_~_ha_hashv~0#1, main_#t~mem63#1 - 1))));havoc main_#t~mem62#1.base, main_#t~mem62#1.offset;havoc main_#t~mem63#1; {3860#false} is VALID [2022-02-20 23:27:17,672 INFO L290 TraceCheckUtils]: 43: Hoare triple {3860#false} goto; {3860#false} is VALID [2022-02-20 23:27:17,672 INFO L290 TraceCheckUtils]: 44: Hoare triple {3860#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.base, main_#t~mem65#1.offset := read~$Pointer$(main_#t~mem64#1.base, main_#t~mem64#1.offset, 4);main_~_ha_head~0#1.base, main_~_ha_head~0#1.offset := main_#t~mem65#1.base, main_#t~mem65#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~mem64#1.base, main_#t~mem64#1.offset;havoc main_#t~mem65#1.base, main_#t~mem65#1.offset;call main_#t~mem66#1 := read~int(main_~_ha_head~0#1.base, 4 + main_~_ha_head~0#1.offset, 4);main_#t~post67#1 := main_#t~mem66#1;call write~int(1 + main_#t~post67#1, main_~_ha_head~0#1.base, 4 + main_~_ha_head~0#1.offset, 4);havoc main_#t~mem66#1;havoc main_#t~post67#1;call main_#t~mem68#1.base, main_#t~mem68#1.offset := read~$Pointer$(main_~_ha_head~0#1.base, main_~_ha_head~0#1.offset, 4);call write~$Pointer$(main_#t~mem68#1.base, main_#t~mem68#1.offset, main_~user~0#1.base, 24 + main_~user~0#1.offset, 4);havoc main_#t~mem68#1.base, main_#t~mem68#1.offset;call write~$Pointer$(0, 0, main_~user~0#1.base, 20 + main_~user~0#1.offset, 4);call main_#t~mem69#1.base, main_#t~mem69#1.offset := read~$Pointer$(main_~_ha_head~0#1.base, main_~_ha_head~0#1.offset, 4); {3860#false} is VALID [2022-02-20 23:27:17,672 INFO L290 TraceCheckUtils]: 45: Hoare triple {3860#false} assume main_#t~mem69#1.base != 0 || main_#t~mem69#1.offset != 0;havoc main_#t~mem69#1.base, main_#t~mem69#1.offset;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_~user~0#1.base, 8 + main_~user~0#1.offset, main_#t~mem70#1.base, 12 + main_#t~mem70#1.offset, 4);havoc main_#t~mem70#1.base, main_#t~mem70#1.offset; {3860#false} is VALID [2022-02-20 23:27:17,672 INFO L290 TraceCheckUtils]: 46: Hoare triple {3860#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~mem72#1 := read~int(main_~_ha_head~0#1.base, 4 + main_~_ha_head~0#1.offset, 4);call main_#t~mem71#1 := read~int(main_~_ha_head~0#1.base, 8 + main_~_ha_head~0#1.offset, 4);main_#t~short75#1 := main_#t~mem72#1 % 4294967296 >= 10 * (1 + main_#t~mem71#1) % 4294967296; {3860#false} is VALID [2022-02-20 23:27:17,673 INFO L290 TraceCheckUtils]: 47: Hoare triple {3860#false} assume main_#t~short75#1;call main_#t~mem73#1.base, main_#t~mem73#1.offset := read~$Pointer$(main_~user~0#1.base, 8 + main_~user~0#1.offset, 4);call main_#t~mem74#1 := read~int(main_#t~mem73#1.base, 36 + main_#t~mem73#1.offset, 4);main_#t~short75#1 := 0 == main_#t~mem74#1 % 4294967296; {3860#false} is VALID [2022-02-20 23:27:17,673 INFO L290 TraceCheckUtils]: 48: Hoare triple {3860#false} assume !main_#t~short75#1;havoc main_#t~mem72#1;havoc main_#t~mem71#1;havoc main_#t~mem73#1.base, main_#t~mem73#1.offset;havoc main_#t~mem74#1;havoc main_#t~short75#1; {3860#false} is VALID [2022-02-20 23:27:17,673 INFO L290 TraceCheckUtils]: 49: Hoare triple {3860#false} goto; {3860#false} is VALID [2022-02-20 23:27:17,673 INFO L290 TraceCheckUtils]: 50: Hoare triple {3860#false} goto; {3860#false} is VALID [2022-02-20 23:27:17,673 INFO L290 TraceCheckUtils]: 51: Hoare triple {3860#false} goto; {3860#false} is VALID [2022-02-20 23:27:17,674 INFO L290 TraceCheckUtils]: 52: Hoare triple {3860#false} goto; {3860#false} is VALID [2022-02-20 23:27:17,674 INFO L290 TraceCheckUtils]: 53: Hoare triple {3860#false} call main_#t~mem3#1 := read~int(main_~#i~0#1.base, main_~#i~0#1.offset, 4);main_#t~post4#1 := main_#t~mem3#1;call write~int(1 + main_#t~post4#1, main_~#i~0#1.base, main_~#i~0#1.offset, 4);havoc main_#t~mem3#1;havoc main_#t~post4#1; {3860#false} is VALID [2022-02-20 23:27:17,674 INFO L290 TraceCheckUtils]: 54: Hoare triple {3860#false} call main_#t~mem5#1 := read~int(main_~#i~0#1.base, main_~#i~0#1.offset, 4); {3860#false} is VALID [2022-02-20 23:27:17,674 INFO L290 TraceCheckUtils]: 55: Hoare triple {3860#false} assume !(main_#t~mem5#1 < 1000);havoc main_#t~mem5#1; {3860#false} is VALID [2022-02-20 23:27:17,674 INFO L290 TraceCheckUtils]: 56: Hoare triple {3860#false} call write~int(0, main_~#i~0#1.base, main_~#i~0#1.offset, 4); {3860#false} is VALID [2022-02-20 23:27:17,675 INFO L290 TraceCheckUtils]: 57: Hoare triple {3860#false} call main_#t~mem144#1 := read~int(main_~#i~0#1.base, main_~#i~0#1.offset, 4); {3860#false} is VALID [2022-02-20 23:27:17,675 INFO L290 TraceCheckUtils]: 58: Hoare triple {3860#false} assume !(main_#t~mem144#1 < 1000);havoc main_#t~mem144#1; {3860#false} is VALID [2022-02-20 23:27:17,675 INFO L290 TraceCheckUtils]: 59: Hoare triple {3860#false} main_~user~0#1.base, main_~user~0#1.offset := main_~users~0#1.base, main_~users~0#1.offset; {3860#false} is VALID [2022-02-20 23:27:17,675 INFO L290 TraceCheckUtils]: 60: Hoare triple {3860#false} assume !!(main_~user~0#1.base != 0 || main_~user~0#1.offset != 0); {3860#false} is VALID [2022-02-20 23:27:17,675 INFO L290 TraceCheckUtils]: 61: Hoare triple {3860#false} assume !false; {3860#false} is VALID [2022-02-20 23:27:17,676 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:27:17,676 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 23:27:17,676 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 23:27:17,676 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1507906231] [2022-02-20 23:27:17,676 WARN L317 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-02-20 23:27:17,677 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [220290750] [2022-02-20 23:27:17,677 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [220290750] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:27:17,677 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:27:17,677 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-02-20 23:27:17,677 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [219304095] [2022-02-20 23:27:17,677 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:27:17,678 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.5) internal successors, (62), 4 states have internal predecessors, (62), 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 62 [2022-02-20 23:27:17,678 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:27:17,678 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 15.5) internal successors, (62), 4 states have internal predecessors, (62), 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:27:17,742 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 62 edges. 62 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:27:17,743 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-02-20 23:27:17,743 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 23:27:17,744 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-02-20 23:27:17,744 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-02-20 23:27:17,744 INFO L87 Difference]: Start difference. First operand 203 states and 258 transitions. Second operand has 4 states, 4 states have (on average 15.5) internal successors, (62), 4 states have internal predecessors, (62), 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:27:18,362 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:27:18,362 INFO L93 Difference]: Finished difference Result 394 states and 504 transitions. [2022-02-20 23:27:18,362 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-02-20 23:27:18,363 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.5) internal successors, (62), 4 states have internal predecessors, (62), 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 62 [2022-02-20 23:27:18,363 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:27:18,363 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 15.5) internal successors, (62), 4 states have internal predecessors, (62), 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:27:18,367 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 481 transitions. [2022-02-20 23:27:18,368 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 15.5) internal successors, (62), 4 states have internal predecessors, (62), 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:27:18,371 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 481 transitions. [2022-02-20 23:27:18,371 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 481 transitions. [2022-02-20 23:27:18,797 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 481 edges. 481 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:27:18,805 INFO L225 Difference]: With dead ends: 394 [2022-02-20 23:27:18,805 INFO L226 Difference]: Without dead ends: 195 [2022-02-20 23:27:18,806 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 59 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:27:18,811 INFO L933 BasicCegarLoop]: 216 mSDtfsCounter, 214 mSDsluCounter, 219 mSDsCounter, 0 mSdLazyCounter, 42 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 217 SdHoareTripleChecker+Valid, 435 SdHoareTripleChecker+Invalid, 66 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 42 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-20 23:27:18,812 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [217 Valid, 435 Invalid, 66 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 42 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-20 23:27:18,815 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 195 states. [2022-02-20 23:27:18,844 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 195 to 189. [2022-02-20 23:27:18,844 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:27:18,845 INFO L82 GeneralOperation]: Start isEquivalent. First operand 195 states. Second operand has 189 states, 183 states have (on average 1.2622950819672132) internal successors, (231), 184 states have internal predecessors, (231), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-02-20 23:27:18,848 INFO L74 IsIncluded]: Start isIncluded. First operand 195 states. Second operand has 189 states, 183 states have (on average 1.2622950819672132) internal successors, (231), 184 states have internal predecessors, (231), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-02-20 23:27:18,849 INFO L87 Difference]: Start difference. First operand 195 states. Second operand has 189 states, 183 states have (on average 1.2622950819672132) internal successors, (231), 184 states have internal predecessors, (231), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-02-20 23:27:18,854 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:27:18,854 INFO L93 Difference]: Finished difference Result 195 states and 243 transitions. [2022-02-20 23:27:18,854 INFO L276 IsEmpty]: Start isEmpty. Operand 195 states and 243 transitions. [2022-02-20 23:27:18,855 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:27:18,855 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:27:18,855 INFO L74 IsIncluded]: Start isIncluded. First operand has 189 states, 183 states have (on average 1.2622950819672132) internal successors, (231), 184 states have internal predecessors, (231), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand 195 states. [2022-02-20 23:27:18,856 INFO L87 Difference]: Start difference. First operand has 189 states, 183 states have (on average 1.2622950819672132) internal successors, (231), 184 states have internal predecessors, (231), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand 195 states. [2022-02-20 23:27:18,860 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:27:18,860 INFO L93 Difference]: Finished difference Result 195 states and 243 transitions. [2022-02-20 23:27:18,860 INFO L276 IsEmpty]: Start isEmpty. Operand 195 states and 243 transitions. [2022-02-20 23:27:18,860 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:27:18,861 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:27:18,861 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:27:18,861 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:27:18,861 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 189 states, 183 states have (on average 1.2622950819672132) internal successors, (231), 184 states have internal predecessors, (231), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-02-20 23:27:18,865 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 189 states to 189 states and 237 transitions. [2022-02-20 23:27:18,865 INFO L78 Accepts]: Start accepts. Automaton has 189 states and 237 transitions. Word has length 62 [2022-02-20 23:27:18,866 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:27:18,866 INFO L470 AbstractCegarLoop]: Abstraction has 189 states and 237 transitions. [2022-02-20 23:27:18,866 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.5) internal successors, (62), 4 states have internal predecessors, (62), 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:27:18,866 INFO L276 IsEmpty]: Start isEmpty. Operand 189 states and 237 transitions. [2022-02-20 23:27:18,867 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2022-02-20 23:27:18,867 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:27:18,868 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] [2022-02-20 23:27:18,894 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-02-20 23:27:19,087 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:27:19,088 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 23:27:19,088 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:27:19,088 INFO L85 PathProgramCache]: Analyzing trace with hash -67840205, now seen corresponding path program 1 times [2022-02-20 23:27:19,088 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 23:27:19,089 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1232887434] [2022-02-20 23:27:19,089 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:27:19,089 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 23:27:19,186 ERROR L252 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-02-20 23:27:19,186 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1991654719] [2022-02-20 23:27:19,186 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:27:19,187 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 23:27:19,187 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 23:27:19,188 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:27:19,215 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:27:19,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:27:19,891 INFO L263 TraceCheckSpWp]: Trace formula consists of 1559 conjuncts, 5 conjunts are in the unsatisfiable core [2022-02-20 23:27:19,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:27:19,936 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 23:27:20,284 INFO L290 TraceCheckUtils]: 0: Hoare triple {5127#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); {5127#true} is VALID [2022-02-20 23:27:20,285 INFO L290 TraceCheckUtils]: 1: Hoare triple {5127#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc6#1.base, main_#t~malloc6#1.offset, main_#t~mem7#1, main_#t~mem8#1, main_#t~mem9#1, main_#t~mem11#1, main_#t~mem10#1, main_#t~mem12#1, main_#t~mem13#1, main_#t~mem15#1, main_#t~mem14#1, main_#t~mem16#1, main_#t~mem17#1, main_#t~mem19#1, main_#t~mem18#1, main_#t~mem20#1, main_#t~mem21#1, main_#t~switch22#1, main_#t~mem23#1, main_#t~mem24#1, main_#t~mem25#1, main_#t~mem26#1, main_#t~mem27#1, main_#t~mem28#1, main_#t~mem29#1, main_#t~mem30#1, main_#t~mem31#1, main_#t~mem32#1, main_#t~mem33#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~malloc34#1.base, main_#t~malloc34#1.offset, main_#t~mem35#1.base, main_#t~mem35#1.offset, main_#t~mem36#1.base, main_#t~mem36#1.offset, main_#t~memset~res37#1.base, main_#t~memset~res37#1.offset, main_#t~mem38#1.base, main_#t~mem38#1.offset, main_#t~mem39#1.base, main_#t~mem39#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~malloc43#1.base, main_#t~malloc43#1.offset, main_#t~mem44#1.base, main_#t~mem44#1.offset, main_#t~mem45#1.base, main_#t~mem45#1.offset, main_#t~mem46#1.base, main_#t~mem46#1.offset, main_#t~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~memset~res50#1.base, main_#t~memset~res50#1.offset, main_#t~mem51#1.base, main_#t~mem51#1.offset, main_#t~mem52#1.base, main_#t~mem52#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, main_#t~mem56#1.base, main_#t~mem56#1.offset, main_#t~mem57#1.base, main_#t~mem57#1.offset, main_#t~mem58#1.base, main_#t~mem58#1.offset, main_#t~mem59#1.base, main_#t~mem59#1.offset, main_#t~mem60#1, main_#t~post61#1, main_#t~mem62#1.base, main_#t~mem62#1.offset, main_#t~mem63#1, main_#t~mem64#1.base, main_#t~mem64#1.offset, main_#t~mem65#1.base, main_#t~mem65#1.offset, main_#t~mem66#1, main_#t~post67#1, main_#t~mem68#1.base, main_#t~mem68#1.offset, main_#t~mem69#1.base, main_#t~mem69#1.offset, main_#t~mem70#1.base, main_#t~mem70#1.offset, main_#t~mem72#1, main_#t~mem71#1, main_#t~mem73#1.base, main_#t~mem73#1.offset, main_#t~mem74#1, main_#t~short75#1, main_#t~mem76#1.base, main_#t~mem76#1.offset, main_#t~mem77#1, main_#t~malloc78#1.base, main_#t~malloc78#1.offset, main_#t~mem79#1.base, main_#t~mem79#1.offset, main_#t~mem80#1.base, main_#t~mem80#1.offset, main_#t~mem81#1.base, main_#t~mem81#1.offset, main_#t~mem82#1, main_#t~memset~res83#1.base, main_#t~memset~res83#1.offset, main_#t~mem84#1.base, main_#t~mem84#1.offset, main_#t~mem85#1.base, main_#t~mem85#1.offset, main_#t~mem88#1, main_#t~mem86#1.base, main_#t~mem86#1.offset, main_#t~mem87#1, main_#t~mem89#1.base, main_#t~mem89#1.offset, main_#t~mem92#1, main_#t~mem90#1.base, main_#t~mem90#1.offset, main_#t~mem91#1, main_#t~ite93#1, main_#t~mem94#1.base, main_#t~mem94#1.offset, main_#t~mem98#1.base, main_#t~mem98#1.offset, main_#t~mem99#1.base, main_#t~mem99#1.offset, main_#t~mem100#1.base, main_#t~mem100#1.offset, main_#t~mem101#1.base, main_#t~mem101#1.offset, main_#t~mem104#1, main_#t~mem102#1.base, main_#t~mem102#1.offset, main_#t~mem103#1, main_#t~mem105#1.base, main_#t~mem105#1.offset, main_#t~mem106#1, main_#t~pre107#1, main_#t~mem108#1.base, main_#t~mem108#1.offset, main_#t~mem109#1, main_#t~mem110#1.base, main_#t~mem110#1.offset, main_#t~mem111#1, main_#t~post112#1, main_#t~mem116#1, main_#t~mem114#1, main_#t~mem113#1.base, main_#t~mem113#1.offset, main_#t~mem115#1, main_#t~mem117#1, main_#t~post118#1, main_#t~mem119#1.base, main_#t~mem119#1.offset, main_#t~mem120#1.base, main_#t~mem120#1.offset, main_#t~mem121#1.base, main_#t~mem121#1.offset, main_#t~post95#1, main_#t~mem96#1.base, main_#t~mem96#1.offset, main_#t~mem97#1, main_#t~mem122#1.base, main_#t~mem122#1.offset, main_#t~mem123#1.base, main_#t~mem123#1.offset, main_#t~mem124#1.base, main_#t~mem124#1.offset, main_#t~mem125#1, main_#t~mem126#1.base, main_#t~mem126#1.offset, main_#t~mem127#1, main_#t~post128#1, main_#t~mem129#1.base, main_#t~mem129#1.offset, main_#t~mem130#1.base, main_#t~mem130#1.offset, main_#t~mem131#1.base, main_#t~mem131#1.offset, main_#t~mem132#1.base, main_#t~mem132#1.offset, main_#t~mem135#1, main_#t~mem133#1.base, main_#t~mem133#1.offset, main_#t~mem134#1, main_#t~ite138#1, main_#t~mem136#1.base, main_#t~mem136#1.offset, main_#t~mem137#1, main_#t~mem139#1.base, main_#t~mem139#1.offset, main_#t~mem140#1, main_#t~mem141#1.base, main_#t~mem141#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~mem3#1, main_#t~post4#1, main_#t~mem5#1, main_#t~mem146#1, main_#t~mem145#1, main_#t~mem147#1, main_#t~mem148#1, main_#t~mem150#1, main_#t~mem149#1, main_#t~mem151#1, main_#t~mem152#1, main_#t~mem154#1, main_#t~mem153#1, main_#t~mem155#1, main_#t~mem156#1, main_#t~switch157#1, main_#t~mem158#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_~_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~mem169#1.base, main_#t~mem169#1.offset, main_#t~mem170#1, main_#t~mem171#1.base, main_#t~mem171#1.offset, 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, main_#t~mem179#1, main_#t~mem180#1, main_#t~short181#1, main_#t~mem182#1.base, main_#t~mem182#1.offset, main_#t~ret183#1, main_#t~mem184#1.base, main_#t~mem184#1.offset, main_#t~mem185#1.base, main_#t~mem185#1.offset, main_#t~mem186#1.base, main_#t~mem186#1.offset, main_#t~mem187#1, main_~_hf_bkt~0#1, main_~_hf_hashv~0#1, main_#t~mem188#1.base, main_#t~mem188#1.offset, main_#t~mem189#1.base, main_#t~mem189#1.offset, main_#t~short190#1, main_#t~mem191#1.base, main_#t~mem191#1.offset, main_#t~mem192#1.base, main_#t~mem192#1.offset, main_#t~mem193#1.base, main_#t~mem193#1.offset, main_#t~mem194#1.base, main_#t~mem194#1.offset, main_#t~mem195#1.base, main_#t~mem195#1.offset, main_#t~mem196#1.base, main_#t~mem196#1.offset, main_#t~mem197#1.base, main_#t~mem197#1.offset, main_#t~mem198#1.base, main_#t~mem198#1.offset, main_#t~mem199#1, main_#t~mem200#1.base, main_#t~mem200#1.offset, main_#t~mem201#1.base, main_#t~mem201#1.offset, main_#t~mem202#1.base, main_#t~mem202#1.offset, main_#t~mem203#1, main_#t~mem204#1.base, main_#t~mem204#1.offset, main_#t~mem205#1.base, main_#t~mem205#1.offset, main_#t~mem206#1.base, main_#t~mem206#1.offset, main_#t~mem207#1.base, main_#t~mem207#1.offset, main_#t~mem208#1.base, main_#t~mem208#1.offset, main_#t~mem209#1, main_#t~mem210#1.base, main_#t~mem210#1.offset, main_#t~mem213#1, main_#t~mem211#1.base, main_#t~mem211#1.offset, main_#t~mem212#1, main_#t~mem214#1.base, main_#t~mem214#1.offset, main_#t~mem215#1.base, main_#t~mem215#1.offset, main_#t~mem216#1, main_#t~post217#1, main_#t~mem218#1.base, main_#t~mem218#1.offset, main_#t~mem219#1.base, main_#t~mem219#1.offset, main_#t~mem220#1.base, main_#t~mem220#1.offset, main_#t~mem221#1.base, main_#t~mem221#1.offset, main_#t~mem222#1.base, main_#t~mem222#1.offset, main_#t~mem223#1.base, main_#t~mem223#1.offset, main_#t~mem224#1.base, main_#t~mem224#1.offset, main_#t~mem225#1.base, main_#t~mem225#1.offset, main_~_hd_head~0#1.base, main_~_hd_head~0#1.offset, main_#t~mem226#1.base, main_#t~mem226#1.offset, main_#t~mem227#1, main_#t~post228#1, main_~_hd_bkt~0#1, main_~_hd_hh_del~0#1.base, main_~_hd_hh_del~0#1.offset, main_#t~mem142#1, main_#t~post143#1, main_#t~mem144#1, main_#t~mem229#1.base, main_#t~mem229#1.offset, main_#t~ite231#1.base, main_#t~ite231#1.offset, main_#t~mem230#1.base, main_#t~mem230#1.offset, main_#t~mem234#1.base, main_#t~mem234#1.offset, main_#t~mem235#1.base, main_#t~mem235#1.offset, main_#t~short236#1, main_#t~mem237#1.base, main_#t~mem237#1.offset, main_#t~mem238#1.base, main_#t~mem238#1.offset, main_#t~mem239#1.base, main_#t~mem239#1.offset, main_#t~mem240#1.base, main_#t~mem240#1.offset, main_#t~mem241#1.base, main_#t~mem241#1.offset, main_#t~mem242#1.base, main_#t~mem242#1.offset, main_#t~mem243#1.base, main_#t~mem243#1.offset, main_#t~mem244#1.base, main_#t~mem244#1.offset, main_#t~mem245#1, main_#t~mem246#1.base, main_#t~mem246#1.offset, main_#t~mem247#1.base, main_#t~mem247#1.offset, main_#t~mem248#1.base, main_#t~mem248#1.offset, main_#t~mem249#1, main_#t~mem250#1.base, main_#t~mem250#1.offset, main_#t~mem251#1.base, main_#t~mem251#1.offset, main_#t~mem252#1.base, main_#t~mem252#1.offset, main_#t~mem253#1.base, main_#t~mem253#1.offset, main_#t~mem254#1.base, main_#t~mem254#1.offset, main_#t~mem255#1, main_#t~mem256#1.base, main_#t~mem256#1.offset, main_#t~mem259#1, main_#t~mem257#1.base, main_#t~mem257#1.offset, main_#t~mem258#1, main_#t~mem260#1.base, main_#t~mem260#1.offset, main_#t~mem261#1.base, main_#t~mem261#1.offset, main_#t~mem262#1, main_#t~post263#1, main_#t~mem264#1.base, main_#t~mem264#1.offset, main_#t~mem265#1.base, main_#t~mem265#1.offset, main_#t~mem266#1.base, main_#t~mem266#1.offset, main_#t~mem267#1.base, main_#t~mem267#1.offset, main_#t~mem268#1.base, main_#t~mem268#1.offset, main_#t~mem269#1.base, main_#t~mem269#1.offset, main_#t~mem270#1.base, main_#t~mem270#1.offset, main_#t~mem271#1.base, main_#t~mem271#1.offset, main_~_hd_head~1#1.base, main_~_hd_head~1#1.offset, main_#t~mem272#1.base, main_#t~mem272#1.offset, main_#t~mem273#1, main_#t~post274#1, main_~_hd_bkt~1#1, main_~_hd_hh_del~1#1.base, main_~_hd_hh_del~1#1.offset, main_#t~ite233#1.base, main_#t~ite233#1.offset, main_#t~mem232#1.base, main_#t~mem232#1.offset, main_~#i~0#1.base, main_~#i~0#1.offset, main_~user~0#1.base, main_~user~0#1.offset, main_~tmp~0#1.base, main_~tmp~0#1.offset, main_~users~0#1.base, main_~users~0#1.offset, main_~temp~0#1.base, main_~temp~0#1.offset;call main_~#i~0#1.base, main_~#i~0#1.offset := #Ultimate.allocOnStack(4);havoc main_~user~0#1.base, main_~user~0#1.offset;havoc main_~tmp~0#1.base, main_~tmp~0#1.offset;main_~users~0#1.base, main_~users~0#1.offset := 0, 0;call write~int(0, main_~#i~0#1.base, main_~#i~0#1.offset, 4); {5135#(and (= |ULTIMATE.start_main_~users~0#1.offset| 0) (= |ULTIMATE.start_main_~users~0#1.base| 0))} is VALID [2022-02-20 23:27:20,286 INFO L290 TraceCheckUtils]: 2: Hoare triple {5135#(and (= |ULTIMATE.start_main_~users~0#1.offset| 0) (= |ULTIMATE.start_main_~users~0#1.base| 0))} call main_#t~mem5#1 := read~int(main_~#i~0#1.base, main_~#i~0#1.offset, 4); {5135#(and (= |ULTIMATE.start_main_~users~0#1.offset| 0) (= |ULTIMATE.start_main_~users~0#1.base| 0))} is VALID [2022-02-20 23:27:20,287 INFO L290 TraceCheckUtils]: 3: Hoare triple {5135#(and (= |ULTIMATE.start_main_~users~0#1.offset| 0) (= |ULTIMATE.start_main_~users~0#1.base| 0))} assume !!(main_#t~mem5#1 < 1000);havoc main_#t~mem5#1;call main_#t~malloc6#1.base, main_#t~malloc6#1.offset := #Ultimate.allocOnHeap(40);main_~user~0#1.base, main_~user~0#1.offset := main_#t~malloc6#1.base, main_#t~malloc6#1.offset;havoc main_#t~malloc6#1.base, main_#t~malloc6#1.offset; {5135#(and (= |ULTIMATE.start_main_~users~0#1.offset| 0) (= |ULTIMATE.start_main_~users~0#1.base| 0))} is VALID [2022-02-20 23:27:20,288 INFO L290 TraceCheckUtils]: 4: Hoare triple {5135#(and (= |ULTIMATE.start_main_~users~0#1.offset| 0) (= |ULTIMATE.start_main_~users~0#1.base| 0))} assume !(main_~user~0#1.base == 0 && main_~user~0#1.offset == 0); {5135#(and (= |ULTIMATE.start_main_~users~0#1.offset| 0) (= |ULTIMATE.start_main_~users~0#1.base| 0))} is VALID [2022-02-20 23:27:20,289 INFO L290 TraceCheckUtils]: 5: Hoare triple {5135#(and (= |ULTIMATE.start_main_~users~0#1.offset| 0) (= |ULTIMATE.start_main_~users~0#1.base| 0))} call main_#t~mem7#1 := read~int(main_~#i~0#1.base, main_~#i~0#1.offset, 4);call write~int(main_#t~mem7#1, main_~user~0#1.base, main_~user~0#1.offset, 4);havoc main_#t~mem7#1;call main_#t~mem8#1 := read~int(main_~#i~0#1.base, main_~#i~0#1.offset, 4);call main_#t~mem9#1 := read~int(main_~#i~0#1.base, main_~#i~0#1.offset, 4);call write~int(main_#t~mem8#1 * main_#t~mem9#1, main_~user~0#1.base, 4 + main_~user~0#1.offset, 4);havoc main_#t~mem8#1;havoc main_#t~mem9#1; {5135#(and (= |ULTIMATE.start_main_~users~0#1.offset| 0) (= |ULTIMATE.start_main_~users~0#1.base| 0))} is VALID [2022-02-20 23:27:20,289 INFO L290 TraceCheckUtils]: 6: Hoare triple {5135#(and (= |ULTIMATE.start_main_~users~0#1.offset| 0) (= |ULTIMATE.start_main_~users~0#1.base| 0))} havoc main_~_ha_hashv~0#1; {5135#(and (= |ULTIMATE.start_main_~users~0#1.offset| 0) (= |ULTIMATE.start_main_~users~0#1.base| 0))} is VALID [2022-02-20 23:27:20,290 INFO L290 TraceCheckUtils]: 7: Hoare triple {5135#(and (= |ULTIMATE.start_main_~users~0#1.offset| 0) (= |ULTIMATE.start_main_~users~0#1.base| 0))} goto; {5135#(and (= |ULTIMATE.start_main_~users~0#1.offset| 0) (= |ULTIMATE.start_main_~users~0#1.base| 0))} is VALID [2022-02-20 23:27:20,291 INFO L290 TraceCheckUtils]: 8: Hoare triple {5135#(and (= |ULTIMATE.start_main_~users~0#1.offset| 0) (= |ULTIMATE.start_main_~users~0#1.base| 0))} havoc main_~_hj_i~0#1;havoc main_~_hj_j~0#1;havoc main_~_hj_k~0#1;main_~_hj_key~0#1.base, main_~_hj_key~0#1.offset := main_~user~0#1.base, main_~user~0#1.offset;main_~_ha_hashv~0#1 := 4276993775;main_~_hj_j~0#1 := 2654435769;main_~_hj_i~0#1 := main_~_hj_j~0#1;main_~_hj_k~0#1 := 4; {5135#(and (= |ULTIMATE.start_main_~users~0#1.offset| 0) (= |ULTIMATE.start_main_~users~0#1.base| 0))} is VALID [2022-02-20 23:27:20,291 INFO L290 TraceCheckUtils]: 9: Hoare triple {5135#(and (= |ULTIMATE.start_main_~users~0#1.offset| 0) (= |ULTIMATE.start_main_~users~0#1.base| 0))} assume !(main_~_hj_k~0#1 % 4294967296 >= 12); {5135#(and (= |ULTIMATE.start_main_~users~0#1.offset| 0) (= |ULTIMATE.start_main_~users~0#1.base| 0))} is VALID [2022-02-20 23:27:20,292 INFO L290 TraceCheckUtils]: 10: Hoare triple {5135#(and (= |ULTIMATE.start_main_~users~0#1.offset| 0) (= |ULTIMATE.start_main_~users~0#1.base| 0))} main_~_ha_hashv~0#1 := 4 + main_~_ha_hashv~0#1;main_#t~switch22#1 := 11 == main_~_hj_k~0#1; {5135#(and (= |ULTIMATE.start_main_~users~0#1.offset| 0) (= |ULTIMATE.start_main_~users~0#1.base| 0))} is VALID [2022-02-20 23:27:20,292 INFO L290 TraceCheckUtils]: 11: Hoare triple {5135#(and (= |ULTIMATE.start_main_~users~0#1.offset| 0) (= |ULTIMATE.start_main_~users~0#1.base| 0))} assume !main_#t~switch22#1; {5135#(and (= |ULTIMATE.start_main_~users~0#1.offset| 0) (= |ULTIMATE.start_main_~users~0#1.base| 0))} is VALID [2022-02-20 23:27:20,293 INFO L290 TraceCheckUtils]: 12: Hoare triple {5135#(and (= |ULTIMATE.start_main_~users~0#1.offset| 0) (= |ULTIMATE.start_main_~users~0#1.base| 0))} main_#t~switch22#1 := main_#t~switch22#1 || 10 == main_~_hj_k~0#1; {5135#(and (= |ULTIMATE.start_main_~users~0#1.offset| 0) (= |ULTIMATE.start_main_~users~0#1.base| 0))} is VALID [2022-02-20 23:27:20,294 INFO L290 TraceCheckUtils]: 13: Hoare triple {5135#(and (= |ULTIMATE.start_main_~users~0#1.offset| 0) (= |ULTIMATE.start_main_~users~0#1.base| 0))} assume !main_#t~switch22#1; {5135#(and (= |ULTIMATE.start_main_~users~0#1.offset| 0) (= |ULTIMATE.start_main_~users~0#1.base| 0))} is VALID [2022-02-20 23:27:20,294 INFO L290 TraceCheckUtils]: 14: Hoare triple {5135#(and (= |ULTIMATE.start_main_~users~0#1.offset| 0) (= |ULTIMATE.start_main_~users~0#1.base| 0))} main_#t~switch22#1 := main_#t~switch22#1 || 9 == main_~_hj_k~0#1; {5135#(and (= |ULTIMATE.start_main_~users~0#1.offset| 0) (= |ULTIMATE.start_main_~users~0#1.base| 0))} is VALID [2022-02-20 23:27:20,295 INFO L290 TraceCheckUtils]: 15: Hoare triple {5135#(and (= |ULTIMATE.start_main_~users~0#1.offset| 0) (= |ULTIMATE.start_main_~users~0#1.base| 0))} assume !main_#t~switch22#1; {5135#(and (= |ULTIMATE.start_main_~users~0#1.offset| 0) (= |ULTIMATE.start_main_~users~0#1.base| 0))} is VALID [2022-02-20 23:27:20,295 INFO L290 TraceCheckUtils]: 16: Hoare triple {5135#(and (= |ULTIMATE.start_main_~users~0#1.offset| 0) (= |ULTIMATE.start_main_~users~0#1.base| 0))} main_#t~switch22#1 := main_#t~switch22#1 || 8 == main_~_hj_k~0#1; {5135#(and (= |ULTIMATE.start_main_~users~0#1.offset| 0) (= |ULTIMATE.start_main_~users~0#1.base| 0))} is VALID [2022-02-20 23:27:20,296 INFO L290 TraceCheckUtils]: 17: Hoare triple {5135#(and (= |ULTIMATE.start_main_~users~0#1.offset| 0) (= |ULTIMATE.start_main_~users~0#1.base| 0))} assume !main_#t~switch22#1; {5135#(and (= |ULTIMATE.start_main_~users~0#1.offset| 0) (= |ULTIMATE.start_main_~users~0#1.base| 0))} is VALID [2022-02-20 23:27:20,297 INFO L290 TraceCheckUtils]: 18: Hoare triple {5135#(and (= |ULTIMATE.start_main_~users~0#1.offset| 0) (= |ULTIMATE.start_main_~users~0#1.base| 0))} main_#t~switch22#1 := main_#t~switch22#1 || 7 == main_~_hj_k~0#1; {5135#(and (= |ULTIMATE.start_main_~users~0#1.offset| 0) (= |ULTIMATE.start_main_~users~0#1.base| 0))} is VALID [2022-02-20 23:27:20,297 INFO L290 TraceCheckUtils]: 19: Hoare triple {5135#(and (= |ULTIMATE.start_main_~users~0#1.offset| 0) (= |ULTIMATE.start_main_~users~0#1.base| 0))} assume !main_#t~switch22#1; {5135#(and (= |ULTIMATE.start_main_~users~0#1.offset| 0) (= |ULTIMATE.start_main_~users~0#1.base| 0))} is VALID [2022-02-20 23:27:20,298 INFO L290 TraceCheckUtils]: 20: Hoare triple {5135#(and (= |ULTIMATE.start_main_~users~0#1.offset| 0) (= |ULTIMATE.start_main_~users~0#1.base| 0))} main_#t~switch22#1 := main_#t~switch22#1 || 6 == main_~_hj_k~0#1; {5135#(and (= |ULTIMATE.start_main_~users~0#1.offset| 0) (= |ULTIMATE.start_main_~users~0#1.base| 0))} is VALID [2022-02-20 23:27:20,298 INFO L290 TraceCheckUtils]: 21: Hoare triple {5135#(and (= |ULTIMATE.start_main_~users~0#1.offset| 0) (= |ULTIMATE.start_main_~users~0#1.base| 0))} assume !main_#t~switch22#1; {5135#(and (= |ULTIMATE.start_main_~users~0#1.offset| 0) (= |ULTIMATE.start_main_~users~0#1.base| 0))} is VALID [2022-02-20 23:27:20,303 INFO L290 TraceCheckUtils]: 22: Hoare triple {5135#(and (= |ULTIMATE.start_main_~users~0#1.offset| 0) (= |ULTIMATE.start_main_~users~0#1.base| 0))} main_#t~switch22#1 := main_#t~switch22#1 || 5 == main_~_hj_k~0#1; {5135#(and (= |ULTIMATE.start_main_~users~0#1.offset| 0) (= |ULTIMATE.start_main_~users~0#1.base| 0))} is VALID [2022-02-20 23:27:20,303 INFO L290 TraceCheckUtils]: 23: Hoare triple {5135#(and (= |ULTIMATE.start_main_~users~0#1.offset| 0) (= |ULTIMATE.start_main_~users~0#1.base| 0))} assume !main_#t~switch22#1; {5135#(and (= |ULTIMATE.start_main_~users~0#1.offset| 0) (= |ULTIMATE.start_main_~users~0#1.base| 0))} is VALID [2022-02-20 23:27:20,304 INFO L290 TraceCheckUtils]: 24: Hoare triple {5135#(and (= |ULTIMATE.start_main_~users~0#1.offset| 0) (= |ULTIMATE.start_main_~users~0#1.base| 0))} main_#t~switch22#1 := main_#t~switch22#1 || 4 == main_~_hj_k~0#1; {5135#(and (= |ULTIMATE.start_main_~users~0#1.offset| 0) (= |ULTIMATE.start_main_~users~0#1.base| 0))} is VALID [2022-02-20 23:27:20,304 INFO L290 TraceCheckUtils]: 25: Hoare triple {5135#(and (= |ULTIMATE.start_main_~users~0#1.offset| 0) (= |ULTIMATE.start_main_~users~0#1.base| 0))} assume main_#t~switch22#1;call main_#t~mem30#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~mem30#1 % 256);havoc main_#t~mem30#1; {5135#(and (= |ULTIMATE.start_main_~users~0#1.offset| 0) (= |ULTIMATE.start_main_~users~0#1.base| 0))} is VALID [2022-02-20 23:27:20,305 INFO L290 TraceCheckUtils]: 26: Hoare triple {5135#(and (= |ULTIMATE.start_main_~users~0#1.offset| 0) (= |ULTIMATE.start_main_~users~0#1.base| 0))} main_#t~switch22#1 := main_#t~switch22#1 || 3 == main_~_hj_k~0#1; {5135#(and (= |ULTIMATE.start_main_~users~0#1.offset| 0) (= |ULTIMATE.start_main_~users~0#1.base| 0))} is VALID [2022-02-20 23:27:20,305 INFO L290 TraceCheckUtils]: 27: Hoare triple {5135#(and (= |ULTIMATE.start_main_~users~0#1.offset| 0) (= |ULTIMATE.start_main_~users~0#1.base| 0))} assume main_#t~switch22#1;call main_#t~mem31#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~mem31#1 % 256);havoc main_#t~mem31#1; {5135#(and (= |ULTIMATE.start_main_~users~0#1.offset| 0) (= |ULTIMATE.start_main_~users~0#1.base| 0))} is VALID [2022-02-20 23:27:20,306 INFO L290 TraceCheckUtils]: 28: Hoare triple {5135#(and (= |ULTIMATE.start_main_~users~0#1.offset| 0) (= |ULTIMATE.start_main_~users~0#1.base| 0))} main_#t~switch22#1 := main_#t~switch22#1 || 2 == main_~_hj_k~0#1; {5135#(and (= |ULTIMATE.start_main_~users~0#1.offset| 0) (= |ULTIMATE.start_main_~users~0#1.base| 0))} is VALID [2022-02-20 23:27:20,306 INFO L290 TraceCheckUtils]: 29: Hoare triple {5135#(and (= |ULTIMATE.start_main_~users~0#1.offset| 0) (= |ULTIMATE.start_main_~users~0#1.base| 0))} assume main_#t~switch22#1;call main_#t~mem32#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~mem32#1 % 256);havoc main_#t~mem32#1; {5135#(and (= |ULTIMATE.start_main_~users~0#1.offset| 0) (= |ULTIMATE.start_main_~users~0#1.base| 0))} is VALID [2022-02-20 23:27:20,307 INFO L290 TraceCheckUtils]: 30: Hoare triple {5135#(and (= |ULTIMATE.start_main_~users~0#1.offset| 0) (= |ULTIMATE.start_main_~users~0#1.base| 0))} main_#t~switch22#1 := main_#t~switch22#1 || 1 == main_~_hj_k~0#1; {5135#(and (= |ULTIMATE.start_main_~users~0#1.offset| 0) (= |ULTIMATE.start_main_~users~0#1.base| 0))} is VALID [2022-02-20 23:27:20,307 INFO L290 TraceCheckUtils]: 31: Hoare triple {5135#(and (= |ULTIMATE.start_main_~users~0#1.offset| 0) (= |ULTIMATE.start_main_~users~0#1.base| 0))} assume main_#t~switch22#1;call main_#t~mem33#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~mem33#1 % 256;havoc main_#t~mem33#1; {5135#(and (= |ULTIMATE.start_main_~users~0#1.offset| 0) (= |ULTIMATE.start_main_~users~0#1.base| 0))} is VALID [2022-02-20 23:27:20,308 INFO L290 TraceCheckUtils]: 32: Hoare triple {5135#(and (= |ULTIMATE.start_main_~users~0#1.offset| 0) (= |ULTIMATE.start_main_~users~0#1.base| 0))} havoc main_#t~switch22#1; {5135#(and (= |ULTIMATE.start_main_~users~0#1.offset| 0) (= |ULTIMATE.start_main_~users~0#1.base| 0))} is VALID [2022-02-20 23:27:20,309 INFO L290 TraceCheckUtils]: 33: Hoare triple {5135#(and (= |ULTIMATE.start_main_~users~0#1.offset| 0) (= |ULTIMATE.start_main_~users~0#1.base| 0))} main_~_hj_i~0#1 := main_~_hj_i~0#1 - main_~_hj_j~0#1;main_~_hj_i~0#1 := main_~_hj_i~0#1 - main_~_ha_hashv~0#1;main_~_hj_i~0#1 := (if (1 == main_~_hj_i~0#1 || 0 == main_~_hj_i~0#1) && (1 == main_~_ha_hashv~0#1 / 8192 || 0 == main_~_ha_hashv~0#1 / 8192) then (if main_~_hj_i~0#1 == main_~_ha_hashv~0#1 / 8192 then 0 else 1) else (if 0 == main_~_hj_i~0#1 then main_~_ha_hashv~0#1 / 8192 else (if 0 == main_~_ha_hashv~0#1 / 8192 then main_~_hj_i~0#1 else ~bitwiseXOr(main_~_hj_i~0#1, main_~_ha_hashv~0#1 / 8192))));main_~_hj_j~0#1 := main_~_hj_j~0#1 - main_~_ha_hashv~0#1;main_~_hj_j~0#1 := main_~_hj_j~0#1 - main_~_hj_i~0#1;main_~_hj_j~0#1 := (if (1 == main_~_hj_j~0#1 || 0 == main_~_hj_j~0#1) && (1 == 256 * main_~_hj_i~0#1 || 0 == 256 * main_~_hj_i~0#1) then (if main_~_hj_j~0#1 == 256 * main_~_hj_i~0#1 then 0 else 1) else (if 0 == main_~_hj_j~0#1 then 256 * main_~_hj_i~0#1 else (if 0 == 256 * main_~_hj_i~0#1 then main_~_hj_j~0#1 else ~bitwiseXOr(main_~_hj_j~0#1, 256 * main_~_hj_i~0#1))));main_~_ha_hashv~0#1 := main_~_ha_hashv~0#1 - main_~_hj_i~0#1;main_~_ha_hashv~0#1 := main_~_ha_hashv~0#1 - main_~_hj_j~0#1;main_~_ha_hashv~0#1 := (if (1 == main_~_ha_hashv~0#1 || 0 == main_~_ha_hashv~0#1) && (1 == main_~_hj_j~0#1 / 8192 || 0 == main_~_hj_j~0#1 / 8192) then (if main_~_ha_hashv~0#1 == main_~_hj_j~0#1 / 8192 then 0 else 1) else (if 0 == main_~_ha_hashv~0#1 then main_~_hj_j~0#1 / 8192 else (if 0 == main_~_hj_j~0#1 / 8192 then main_~_ha_hashv~0#1 else ~bitwiseXOr(main_~_ha_hashv~0#1, main_~_hj_j~0#1 / 8192))));main_~_hj_i~0#1 := main_~_hj_i~0#1 - main_~_hj_j~0#1;main_~_hj_i~0#1 := main_~_hj_i~0#1 - main_~_ha_hashv~0#1;main_~_hj_i~0#1 := (if (1 == main_~_hj_i~0#1 || 0 == main_~_hj_i~0#1) && (1 == main_~_ha_hashv~0#1 / 4096 || 0 == main_~_ha_hashv~0#1 / 4096) then (if main_~_hj_i~0#1 == main_~_ha_hashv~0#1 / 4096 then 0 else 1) else (if 0 == main_~_hj_i~0#1 then main_~_ha_hashv~0#1 / 4096 else (if 0 == main_~_ha_hashv~0#1 / 4096 then main_~_hj_i~0#1 else ~bitwiseXOr(main_~_hj_i~0#1, main_~_ha_hashv~0#1 / 4096))));main_~_hj_j~0#1 := main_~_hj_j~0#1 - main_~_ha_hashv~0#1;main_~_hj_j~0#1 := main_~_hj_j~0#1 - main_~_hj_i~0#1;main_~_hj_j~0#1 := (if (1 == main_~_hj_j~0#1 || 0 == main_~_hj_j~0#1) && (1 == 65536 * main_~_hj_i~0#1 || 0 == 65536 * main_~_hj_i~0#1) then (if main_~_hj_j~0#1 == 65536 * main_~_hj_i~0#1 then 0 else 1) else (if 0 == main_~_hj_j~0#1 then 65536 * main_~_hj_i~0#1 else (if 0 == 65536 * main_~_hj_i~0#1 then main_~_hj_j~0#1 else ~bitwiseXOr(main_~_hj_j~0#1, 65536 * main_~_hj_i~0#1))));main_~_ha_hashv~0#1 := main_~_ha_hashv~0#1 - main_~_hj_i~0#1;main_~_ha_hashv~0#1 := main_~_ha_hashv~0#1 - main_~_hj_j~0#1;main_~_ha_hashv~0#1 := (if (1 == main_~_ha_hashv~0#1 || 0 == main_~_ha_hashv~0#1) && (1 == main_~_hj_j~0#1 / 32 || 0 == main_~_hj_j~0#1 / 32) then (if main_~_ha_hashv~0#1 == main_~_hj_j~0#1 / 32 then 0 else 1) else (if 0 == main_~_ha_hashv~0#1 then main_~_hj_j~0#1 / 32 else (if 0 == main_~_hj_j~0#1 / 32 then main_~_ha_hashv~0#1 else ~bitwiseXOr(main_~_ha_hashv~0#1, main_~_hj_j~0#1 / 32))));main_~_hj_i~0#1 := main_~_hj_i~0#1 - main_~_hj_j~0#1;main_~_hj_i~0#1 := main_~_hj_i~0#1 - main_~_ha_hashv~0#1;main_~_hj_i~0#1 := (if (1 == main_~_hj_i~0#1 || 0 == main_~_hj_i~0#1) && (1 == main_~_ha_hashv~0#1 / 8 || 0 == main_~_ha_hashv~0#1 / 8) then (if main_~_hj_i~0#1 == main_~_ha_hashv~0#1 / 8 then 0 else 1) else (if 0 == main_~_hj_i~0#1 then main_~_ha_hashv~0#1 / 8 else (if 0 == main_~_ha_hashv~0#1 / 8 then main_~_hj_i~0#1 else ~bitwiseXOr(main_~_hj_i~0#1, main_~_ha_hashv~0#1 / 8))));main_~_hj_j~0#1 := main_~_hj_j~0#1 - main_~_ha_hashv~0#1;main_~_hj_j~0#1 := main_~_hj_j~0#1 - main_~_hj_i~0#1;main_~_hj_j~0#1 := (if (1 == main_~_hj_j~0#1 || 0 == main_~_hj_j~0#1) && (1 == 1024 * main_~_hj_i~0#1 || 0 == 1024 * main_~_hj_i~0#1) then (if main_~_hj_j~0#1 == 1024 * main_~_hj_i~0#1 then 0 else 1) else (if 0 == main_~_hj_j~0#1 then 1024 * main_~_hj_i~0#1 else (if 0 == 1024 * main_~_hj_i~0#1 then main_~_hj_j~0#1 else ~bitwiseXOr(main_~_hj_j~0#1, 1024 * main_~_hj_i~0#1))));main_~_ha_hashv~0#1 := main_~_ha_hashv~0#1 - main_~_hj_i~0#1;main_~_ha_hashv~0#1 := main_~_ha_hashv~0#1 - main_~_hj_j~0#1;main_~_ha_hashv~0#1 := (if (1 == main_~_ha_hashv~0#1 || 0 == main_~_ha_hashv~0#1) && (1 == main_~_hj_j~0#1 / 32768 || 0 == main_~_hj_j~0#1 / 32768) then (if main_~_ha_hashv~0#1 == main_~_hj_j~0#1 / 32768 then 0 else 1) else (if 0 == main_~_ha_hashv~0#1 then main_~_hj_j~0#1 / 32768 else (if 0 == main_~_hj_j~0#1 / 32768 then main_~_ha_hashv~0#1 else ~bitwiseXOr(main_~_ha_hashv~0#1, main_~_hj_j~0#1 / 32768)))); {5135#(and (= |ULTIMATE.start_main_~users~0#1.offset| 0) (= |ULTIMATE.start_main_~users~0#1.base| 0))} is VALID [2022-02-20 23:27:20,310 INFO L290 TraceCheckUtils]: 34: Hoare triple {5135#(and (= |ULTIMATE.start_main_~users~0#1.offset| 0) (= |ULTIMATE.start_main_~users~0#1.base| 0))} goto; {5135#(and (= |ULTIMATE.start_main_~users~0#1.offset| 0) (= |ULTIMATE.start_main_~users~0#1.base| 0))} is VALID [2022-02-20 23:27:20,311 INFO L290 TraceCheckUtils]: 35: Hoare triple {5135#(and (= |ULTIMATE.start_main_~users~0#1.offset| 0) (= |ULTIMATE.start_main_~users~0#1.base| 0))} goto; {5135#(and (= |ULTIMATE.start_main_~users~0#1.offset| 0) (= |ULTIMATE.start_main_~users~0#1.base| 0))} is VALID [2022-02-20 23:27:20,311 INFO L290 TraceCheckUtils]: 36: Hoare triple {5135#(and (= |ULTIMATE.start_main_~users~0#1.offset| 0) (= |ULTIMATE.start_main_~users~0#1.base| 0))} goto; {5135#(and (= |ULTIMATE.start_main_~users~0#1.offset| 0) (= |ULTIMATE.start_main_~users~0#1.base| 0))} is VALID [2022-02-20 23:27:20,312 INFO L290 TraceCheckUtils]: 37: Hoare triple {5135#(and (= |ULTIMATE.start_main_~users~0#1.offset| 0) (= |ULTIMATE.start_main_~users~0#1.base| 0))} call write~int(main_~_ha_hashv~0#1, main_~user~0#1.base, 36 + main_~user~0#1.offset, 4);call write~$Pointer$(main_~user~0#1.base, main_~user~0#1.offset, main_~user~0#1.base, 28 + main_~user~0#1.offset, 4);call write~int(4, main_~user~0#1.base, 32 + main_~user~0#1.offset, 4); {5135#(and (= |ULTIMATE.start_main_~users~0#1.offset| 0) (= |ULTIMATE.start_main_~users~0#1.base| 0))} is VALID [2022-02-20 23:27:20,312 INFO L290 TraceCheckUtils]: 38: Hoare triple {5135#(and (= |ULTIMATE.start_main_~users~0#1.offset| 0) (= |ULTIMATE.start_main_~users~0#1.base| 0))} assume !(main_~users~0#1.base == 0 && main_~users~0#1.offset == 0);call main_#t~mem51#1.base, main_#t~mem51#1.offset := read~$Pointer$(main_~users~0#1.base, 8 + main_~users~0#1.offset, 4);call write~$Pointer$(main_#t~mem51#1.base, main_#t~mem51#1.offset, main_~user~0#1.base, 8 + main_~user~0#1.offset, 4);havoc main_#t~mem51#1.base, main_#t~mem51#1.offset; {5128#false} is VALID [2022-02-20 23:27:20,312 INFO L290 TraceCheckUtils]: 39: Hoare triple {5128#false} call write~$Pointer$(0, 0, main_~user~0#1.base, 16 + main_~user~0#1.offset, 4);call main_#t~mem52#1.base, main_#t~mem52#1.offset := read~$Pointer$(main_~users~0#1.base, 8 + main_~users~0#1.offset, 4);call main_#t~mem53#1.base, main_#t~mem53#1.offset := read~$Pointer$(main_#t~mem52#1.base, 16 + main_#t~mem52#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 := read~int(main_#t~mem54#1.base, 20 + main_#t~mem54#1.offset, 4);call write~$Pointer$(main_#t~mem53#1.base, main_#t~mem53#1.offset - main_#t~mem55#1, main_~user~0#1.base, 12 + main_~user~0#1.offset, 4);havoc main_#t~mem52#1.base, main_#t~mem52#1.offset;havoc main_#t~mem53#1.base, main_#t~mem53#1.offset;havoc main_#t~mem54#1.base, main_#t~mem54#1.offset;havoc main_#t~mem55#1;call main_#t~mem56#1.base, main_#t~mem56#1.offset := read~$Pointer$(main_~users~0#1.base, 8 + main_~users~0#1.offset, 4);call main_#t~mem57#1.base, main_#t~mem57#1.offset := read~$Pointer$(main_#t~mem56#1.base, 16 + main_#t~mem56#1.offset, 4);call write~$Pointer$(main_~user~0#1.base, main_~user~0#1.offset, main_#t~mem57#1.base, 8 + main_#t~mem57#1.offset, 4);havoc main_#t~mem56#1.base, main_#t~mem56#1.offset;havoc main_#t~mem57#1.base, main_#t~mem57#1.offset;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 write~$Pointer$(main_~user~0#1.base, 8 + main_~user~0#1.offset, main_#t~mem58#1.base, 16 + main_#t~mem58#1.offset, 4);havoc main_#t~mem58#1.base, main_#t~mem58#1.offset; {5128#false} is VALID [2022-02-20 23:27:20,313 INFO L290 TraceCheckUtils]: 40: Hoare triple {5128#false} goto; {5128#false} is VALID [2022-02-20 23:27:20,313 INFO L290 TraceCheckUtils]: 41: Hoare triple {5128#false} havoc main_~_ha_bkt~0#1;call main_#t~mem59#1.base, main_#t~mem59#1.offset := read~$Pointer$(main_~users~0#1.base, 8 + main_~users~0#1.offset, 4);call main_#t~mem60#1 := read~int(main_#t~mem59#1.base, 12 + main_#t~mem59#1.offset, 4);main_#t~post61#1 := main_#t~mem60#1;call write~int(1 + main_#t~post61#1, main_#t~mem59#1.base, 12 + main_#t~mem59#1.offset, 4);havoc main_#t~mem59#1.base, main_#t~mem59#1.offset;havoc main_#t~mem60#1;havoc main_#t~post61#1; {5128#false} is VALID [2022-02-20 23:27:20,313 INFO L290 TraceCheckUtils]: 42: Hoare triple {5128#false} call main_#t~mem62#1.base, main_#t~mem62#1.offset := read~$Pointer$(main_~users~0#1.base, 8 + main_~users~0#1.offset, 4);call main_#t~mem63#1 := read~int(main_#t~mem62#1.base, 4 + main_#t~mem62#1.offset, 4);main_~_ha_bkt~0#1 := (if 0 == main_~_ha_hashv~0#1 || 0 == main_#t~mem63#1 - 1 then 0 else (if 1 == main_#t~mem63#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~mem63#1 - 1))) else (if 1 == main_~_ha_hashv~0#1 then (if 1 == main_#t~mem63#1 - 1 || 0 == main_#t~mem63#1 - 1 then main_#t~mem63#1 - 1 else (if main_#t~mem63#1 - 1 >= 0 then (main_#t~mem63#1 - 1) % 2 else ~bitwiseAnd(main_~_ha_hashv~0#1, main_#t~mem63#1 - 1))) else ~bitwiseAnd(main_~_ha_hashv~0#1, main_#t~mem63#1 - 1))));havoc main_#t~mem62#1.base, main_#t~mem62#1.offset;havoc main_#t~mem63#1; {5128#false} is VALID [2022-02-20 23:27:20,313 INFO L290 TraceCheckUtils]: 43: Hoare triple {5128#false} goto; {5128#false} is VALID [2022-02-20 23:27:20,313 INFO L290 TraceCheckUtils]: 44: Hoare triple {5128#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.base, main_#t~mem65#1.offset := read~$Pointer$(main_#t~mem64#1.base, main_#t~mem64#1.offset, 4);main_~_ha_head~0#1.base, main_~_ha_head~0#1.offset := main_#t~mem65#1.base, main_#t~mem65#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~mem64#1.base, main_#t~mem64#1.offset;havoc main_#t~mem65#1.base, main_#t~mem65#1.offset;call main_#t~mem66#1 := read~int(main_~_ha_head~0#1.base, 4 + main_~_ha_head~0#1.offset, 4);main_#t~post67#1 := main_#t~mem66#1;call write~int(1 + main_#t~post67#1, main_~_ha_head~0#1.base, 4 + main_~_ha_head~0#1.offset, 4);havoc main_#t~mem66#1;havoc main_#t~post67#1;call main_#t~mem68#1.base, main_#t~mem68#1.offset := read~$Pointer$(main_~_ha_head~0#1.base, main_~_ha_head~0#1.offset, 4);call write~$Pointer$(main_#t~mem68#1.base, main_#t~mem68#1.offset, main_~user~0#1.base, 24 + main_~user~0#1.offset, 4);havoc main_#t~mem68#1.base, main_#t~mem68#1.offset;call write~$Pointer$(0, 0, main_~user~0#1.base, 20 + main_~user~0#1.offset, 4);call main_#t~mem69#1.base, main_#t~mem69#1.offset := read~$Pointer$(main_~_ha_head~0#1.base, main_~_ha_head~0#1.offset, 4); {5128#false} is VALID [2022-02-20 23:27:20,314 INFO L290 TraceCheckUtils]: 45: Hoare triple {5128#false} assume main_#t~mem69#1.base != 0 || main_#t~mem69#1.offset != 0;havoc main_#t~mem69#1.base, main_#t~mem69#1.offset;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_~user~0#1.base, 8 + main_~user~0#1.offset, main_#t~mem70#1.base, 12 + main_#t~mem70#1.offset, 4);havoc main_#t~mem70#1.base, main_#t~mem70#1.offset; {5128#false} is VALID [2022-02-20 23:27:20,314 INFO L290 TraceCheckUtils]: 46: Hoare triple {5128#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~mem72#1 := read~int(main_~_ha_head~0#1.base, 4 + main_~_ha_head~0#1.offset, 4);call main_#t~mem71#1 := read~int(main_~_ha_head~0#1.base, 8 + main_~_ha_head~0#1.offset, 4);main_#t~short75#1 := main_#t~mem72#1 % 4294967296 >= 10 * (1 + main_#t~mem71#1) % 4294967296; {5128#false} is VALID [2022-02-20 23:27:20,314 INFO L290 TraceCheckUtils]: 47: Hoare triple {5128#false} assume main_#t~short75#1;call main_#t~mem73#1.base, main_#t~mem73#1.offset := read~$Pointer$(main_~user~0#1.base, 8 + main_~user~0#1.offset, 4);call main_#t~mem74#1 := read~int(main_#t~mem73#1.base, 36 + main_#t~mem73#1.offset, 4);main_#t~short75#1 := 0 == main_#t~mem74#1 % 4294967296; {5128#false} is VALID [2022-02-20 23:27:20,314 INFO L290 TraceCheckUtils]: 48: Hoare triple {5128#false} assume !main_#t~short75#1;havoc main_#t~mem72#1;havoc main_#t~mem71#1;havoc main_#t~mem73#1.base, main_#t~mem73#1.offset;havoc main_#t~mem74#1;havoc main_#t~short75#1; {5128#false} is VALID [2022-02-20 23:27:20,314 INFO L290 TraceCheckUtils]: 49: Hoare triple {5128#false} goto; {5128#false} is VALID [2022-02-20 23:27:20,315 INFO L290 TraceCheckUtils]: 50: Hoare triple {5128#false} goto; {5128#false} is VALID [2022-02-20 23:27:20,315 INFO L290 TraceCheckUtils]: 51: Hoare triple {5128#false} goto; {5128#false} is VALID [2022-02-20 23:27:20,315 INFO L290 TraceCheckUtils]: 52: Hoare triple {5128#false} goto; {5128#false} is VALID [2022-02-20 23:27:20,315 INFO L290 TraceCheckUtils]: 53: Hoare triple {5128#false} call main_#t~mem3#1 := read~int(main_~#i~0#1.base, main_~#i~0#1.offset, 4);main_#t~post4#1 := main_#t~mem3#1;call write~int(1 + main_#t~post4#1, main_~#i~0#1.base, main_~#i~0#1.offset, 4);havoc main_#t~mem3#1;havoc main_#t~post4#1; {5128#false} is VALID [2022-02-20 23:27:20,315 INFO L290 TraceCheckUtils]: 54: Hoare triple {5128#false} call main_#t~mem5#1 := read~int(main_~#i~0#1.base, main_~#i~0#1.offset, 4); {5128#false} is VALID [2022-02-20 23:27:20,315 INFO L290 TraceCheckUtils]: 55: Hoare triple {5128#false} assume !(main_#t~mem5#1 < 1000);havoc main_#t~mem5#1; {5128#false} is VALID [2022-02-20 23:27:20,316 INFO L290 TraceCheckUtils]: 56: Hoare triple {5128#false} call write~int(0, main_~#i~0#1.base, main_~#i~0#1.offset, 4); {5128#false} is VALID [2022-02-20 23:27:20,316 INFO L290 TraceCheckUtils]: 57: Hoare triple {5128#false} call main_#t~mem144#1 := read~int(main_~#i~0#1.base, main_~#i~0#1.offset, 4); {5128#false} is VALID [2022-02-20 23:27:20,316 INFO L290 TraceCheckUtils]: 58: Hoare triple {5128#false} assume !(main_#t~mem144#1 < 1000);havoc main_#t~mem144#1; {5128#false} is VALID [2022-02-20 23:27:20,316 INFO L290 TraceCheckUtils]: 59: Hoare triple {5128#false} main_~user~0#1.base, main_~user~0#1.offset := main_~users~0#1.base, main_~users~0#1.offset; {5128#false} is VALID [2022-02-20 23:27:20,316 INFO L290 TraceCheckUtils]: 60: Hoare triple {5128#false} assume !!(main_~user~0#1.base != 0 || main_~user~0#1.offset != 0); {5128#false} is VALID [2022-02-20 23:27:20,316 INFO L290 TraceCheckUtils]: 61: Hoare triple {5128#false} assume !false; {5128#false} is VALID [2022-02-20 23:27:20,317 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:27:20,317 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 23:27:20,317 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 23:27:20,318 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1232887434] [2022-02-20 23:27:20,318 WARN L317 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-02-20 23:27:20,318 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1991654719] [2022-02-20 23:27:20,318 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1991654719] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:27:20,318 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:27:20,318 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 23:27:20,319 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [811958070] [2022-02-20 23:27:20,319 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:27:20,319 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 20.666666666666668) internal successors, (62), 3 states have internal predecessors, (62), 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 62 [2022-02-20 23:27:20,319 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:27:20,320 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 20.666666666666668) internal successors, (62), 3 states have internal predecessors, (62), 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:27:20,371 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 62 edges. 62 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:27:20,371 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 23:27:20,371 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 23:27:20,371 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 23:27:20,371 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 23:27:20,372 INFO L87 Difference]: Start difference. First operand 189 states and 237 transitions. Second operand has 3 states, 3 states have (on average 20.666666666666668) internal successors, (62), 3 states have internal predecessors, (62), 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:27:21,024 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:27:21,024 INFO L93 Difference]: Finished difference Result 487 states and 610 transitions. [2022-02-20 23:27:21,024 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 23:27:21,025 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 20.666666666666668) internal successors, (62), 3 states have internal predecessors, (62), 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 62 [2022-02-20 23:27:21,025 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:27:21,025 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 20.666666666666668) internal successors, (62), 3 states have internal predecessors, (62), 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:27:21,030 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 592 transitions. [2022-02-20 23:27:21,030 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 20.666666666666668) internal successors, (62), 3 states have internal predecessors, (62), 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:27:21,034 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 592 transitions. [2022-02-20 23:27:21,034 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 592 transitions. [2022-02-20 23:27:21,521 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 592 edges. 592 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:27:21,527 INFO L225 Difference]: With dead ends: 487 [2022-02-20 23:27:21,527 INFO L226 Difference]: Without dead ends: 302 [2022-02-20 23:27:21,527 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 60 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:27:21,528 INFO L933 BasicCegarLoop]: 272 mSDtfsCounter, 101 mSDsluCounter, 197 mSDsCounter, 0 mSdLazyCounter, 31 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 103 SdHoareTripleChecker+Valid, 469 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 31 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 23:27:21,528 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [103 Valid, 469 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 31 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 23:27:21,529 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 302 states. [2022-02-20 23:27:21,559 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 302 to 295. [2022-02-20 23:27:21,560 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:27:21,561 INFO L82 GeneralOperation]: Start isEquivalent. First operand 302 states. Second operand has 295 states, 289 states have (on average 1.259515570934256) internal successors, (364), 290 states have internal predecessors, (364), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-02-20 23:27:21,561 INFO L74 IsIncluded]: Start isIncluded. First operand 302 states. Second operand has 295 states, 289 states have (on average 1.259515570934256) internal successors, (364), 290 states have internal predecessors, (364), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-02-20 23:27:21,562 INFO L87 Difference]: Start difference. First operand 302 states. Second operand has 295 states, 289 states have (on average 1.259515570934256) internal successors, (364), 290 states have internal predecessors, (364), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-02-20 23:27:21,569 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:27:21,569 INFO L93 Difference]: Finished difference Result 302 states and 375 transitions. [2022-02-20 23:27:21,569 INFO L276 IsEmpty]: Start isEmpty. Operand 302 states and 375 transitions. [2022-02-20 23:27:21,570 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:27:21,570 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:27:21,570 INFO L74 IsIncluded]: Start isIncluded. First operand has 295 states, 289 states have (on average 1.259515570934256) internal successors, (364), 290 states have internal predecessors, (364), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand 302 states. [2022-02-20 23:27:21,571 INFO L87 Difference]: Start difference. First operand has 295 states, 289 states have (on average 1.259515570934256) internal successors, (364), 290 states have internal predecessors, (364), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand 302 states. [2022-02-20 23:27:21,578 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:27:21,578 INFO L93 Difference]: Finished difference Result 302 states and 375 transitions. [2022-02-20 23:27:21,578 INFO L276 IsEmpty]: Start isEmpty. Operand 302 states and 375 transitions. [2022-02-20 23:27:21,579 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:27:21,579 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:27:21,579 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:27:21,579 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:27:21,580 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 295 states, 289 states have (on average 1.259515570934256) internal successors, (364), 290 states have internal predecessors, (364), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-02-20 23:27:21,586 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 295 states to 295 states and 370 transitions. [2022-02-20 23:27:21,587 INFO L78 Accepts]: Start accepts. Automaton has 295 states and 370 transitions. Word has length 62 [2022-02-20 23:27:21,587 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:27:21,587 INFO L470 AbstractCegarLoop]: Abstraction has 295 states and 370 transitions. [2022-02-20 23:27:21,587 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 20.666666666666668) internal successors, (62), 3 states have internal predecessors, (62), 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:27:21,588 INFO L276 IsEmpty]: Start isEmpty. Operand 295 states and 370 transitions. [2022-02-20 23:27:21,588 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2022-02-20 23:27:21,588 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:27:21,589 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 23:27:21,614 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:27:21,807 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:27:21,808 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 23:27:21,808 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:27:21,808 INFO L85 PathProgramCache]: Analyzing trace with hash -781422495, now seen corresponding path program 1 times [2022-02-20 23:27:21,808 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 23:27:21,808 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1257624705] [2022-02-20 23:27:21,808 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:27:21,808 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 23:27:21,859 ERROR L252 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-02-20 23:27:21,859 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [779553105] [2022-02-20 23:27:21,859 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:27:21,860 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 23:27:21,860 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 23:27:21,861 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:27:21,879 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:27:22,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:27:22,321 INFO L263 TraceCheckSpWp]: Trace formula consists of 696 conjuncts, 5 conjunts are in the unsatisfiable core [2022-02-20 23:27:22,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:27:22,381 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 23:27:22,610 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-02-20 23:27:22,652 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-02-20 23:27:22,673 INFO L290 TraceCheckUtils]: 0: Hoare triple {6832#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); {6832#true} is VALID [2022-02-20 23:27:22,673 INFO L290 TraceCheckUtils]: 1: Hoare triple {6832#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc6#1.base, main_#t~malloc6#1.offset, main_#t~mem7#1, main_#t~mem8#1, main_#t~mem9#1, main_#t~mem11#1, main_#t~mem10#1, main_#t~mem12#1, main_#t~mem13#1, main_#t~mem15#1, main_#t~mem14#1, main_#t~mem16#1, main_#t~mem17#1, main_#t~mem19#1, main_#t~mem18#1, main_#t~mem20#1, main_#t~mem21#1, main_#t~switch22#1, main_#t~mem23#1, main_#t~mem24#1, main_#t~mem25#1, main_#t~mem26#1, main_#t~mem27#1, main_#t~mem28#1, main_#t~mem29#1, main_#t~mem30#1, main_#t~mem31#1, main_#t~mem32#1, main_#t~mem33#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~malloc34#1.base, main_#t~malloc34#1.offset, main_#t~mem35#1.base, main_#t~mem35#1.offset, main_#t~mem36#1.base, main_#t~mem36#1.offset, main_#t~memset~res37#1.base, main_#t~memset~res37#1.offset, main_#t~mem38#1.base, main_#t~mem38#1.offset, main_#t~mem39#1.base, main_#t~mem39#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~malloc43#1.base, main_#t~malloc43#1.offset, main_#t~mem44#1.base, main_#t~mem44#1.offset, main_#t~mem45#1.base, main_#t~mem45#1.offset, main_#t~mem46#1.base, main_#t~mem46#1.offset, main_#t~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~memset~res50#1.base, main_#t~memset~res50#1.offset, main_#t~mem51#1.base, main_#t~mem51#1.offset, main_#t~mem52#1.base, main_#t~mem52#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, main_#t~mem56#1.base, main_#t~mem56#1.offset, main_#t~mem57#1.base, main_#t~mem57#1.offset, main_#t~mem58#1.base, main_#t~mem58#1.offset, main_#t~mem59#1.base, main_#t~mem59#1.offset, main_#t~mem60#1, main_#t~post61#1, main_#t~mem62#1.base, main_#t~mem62#1.offset, main_#t~mem63#1, main_#t~mem64#1.base, main_#t~mem64#1.offset, main_#t~mem65#1.base, main_#t~mem65#1.offset, main_#t~mem66#1, main_#t~post67#1, main_#t~mem68#1.base, main_#t~mem68#1.offset, main_#t~mem69#1.base, main_#t~mem69#1.offset, main_#t~mem70#1.base, main_#t~mem70#1.offset, main_#t~mem72#1, main_#t~mem71#1, main_#t~mem73#1.base, main_#t~mem73#1.offset, main_#t~mem74#1, main_#t~short75#1, main_#t~mem76#1.base, main_#t~mem76#1.offset, main_#t~mem77#1, main_#t~malloc78#1.base, main_#t~malloc78#1.offset, main_#t~mem79#1.base, main_#t~mem79#1.offset, main_#t~mem80#1.base, main_#t~mem80#1.offset, main_#t~mem81#1.base, main_#t~mem81#1.offset, main_#t~mem82#1, main_#t~memset~res83#1.base, main_#t~memset~res83#1.offset, main_#t~mem84#1.base, main_#t~mem84#1.offset, main_#t~mem85#1.base, main_#t~mem85#1.offset, main_#t~mem88#1, main_#t~mem86#1.base, main_#t~mem86#1.offset, main_#t~mem87#1, main_#t~mem89#1.base, main_#t~mem89#1.offset, main_#t~mem92#1, main_#t~mem90#1.base, main_#t~mem90#1.offset, main_#t~mem91#1, main_#t~ite93#1, main_#t~mem94#1.base, main_#t~mem94#1.offset, main_#t~mem98#1.base, main_#t~mem98#1.offset, main_#t~mem99#1.base, main_#t~mem99#1.offset, main_#t~mem100#1.base, main_#t~mem100#1.offset, main_#t~mem101#1.base, main_#t~mem101#1.offset, main_#t~mem104#1, main_#t~mem102#1.base, main_#t~mem102#1.offset, main_#t~mem103#1, main_#t~mem105#1.base, main_#t~mem105#1.offset, main_#t~mem106#1, main_#t~pre107#1, main_#t~mem108#1.base, main_#t~mem108#1.offset, main_#t~mem109#1, main_#t~mem110#1.base, main_#t~mem110#1.offset, main_#t~mem111#1, main_#t~post112#1, main_#t~mem116#1, main_#t~mem114#1, main_#t~mem113#1.base, main_#t~mem113#1.offset, main_#t~mem115#1, main_#t~mem117#1, main_#t~post118#1, main_#t~mem119#1.base, main_#t~mem119#1.offset, main_#t~mem120#1.base, main_#t~mem120#1.offset, main_#t~mem121#1.base, main_#t~mem121#1.offset, main_#t~post95#1, main_#t~mem96#1.base, main_#t~mem96#1.offset, main_#t~mem97#1, main_#t~mem122#1.base, main_#t~mem122#1.offset, main_#t~mem123#1.base, main_#t~mem123#1.offset, main_#t~mem124#1.base, main_#t~mem124#1.offset, main_#t~mem125#1, main_#t~mem126#1.base, main_#t~mem126#1.offset, main_#t~mem127#1, main_#t~post128#1, main_#t~mem129#1.base, main_#t~mem129#1.offset, main_#t~mem130#1.base, main_#t~mem130#1.offset, main_#t~mem131#1.base, main_#t~mem131#1.offset, main_#t~mem132#1.base, main_#t~mem132#1.offset, main_#t~mem135#1, main_#t~mem133#1.base, main_#t~mem133#1.offset, main_#t~mem134#1, main_#t~ite138#1, main_#t~mem136#1.base, main_#t~mem136#1.offset, main_#t~mem137#1, main_#t~mem139#1.base, main_#t~mem139#1.offset, main_#t~mem140#1, main_#t~mem141#1.base, main_#t~mem141#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~mem3#1, main_#t~post4#1, main_#t~mem5#1, main_#t~mem146#1, main_#t~mem145#1, main_#t~mem147#1, main_#t~mem148#1, main_#t~mem150#1, main_#t~mem149#1, main_#t~mem151#1, main_#t~mem152#1, main_#t~mem154#1, main_#t~mem153#1, main_#t~mem155#1, main_#t~mem156#1, main_#t~switch157#1, main_#t~mem158#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_~_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~mem169#1.base, main_#t~mem169#1.offset, main_#t~mem170#1, main_#t~mem171#1.base, main_#t~mem171#1.offset, 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, main_#t~mem179#1, main_#t~mem180#1, main_#t~short181#1, main_#t~mem182#1.base, main_#t~mem182#1.offset, main_#t~ret183#1, main_#t~mem184#1.base, main_#t~mem184#1.offset, main_#t~mem185#1.base, main_#t~mem185#1.offset, main_#t~mem186#1.base, main_#t~mem186#1.offset, main_#t~mem187#1, main_~_hf_bkt~0#1, main_~_hf_hashv~0#1, main_#t~mem188#1.base, main_#t~mem188#1.offset, main_#t~mem189#1.base, main_#t~mem189#1.offset, main_#t~short190#1, main_#t~mem191#1.base, main_#t~mem191#1.offset, main_#t~mem192#1.base, main_#t~mem192#1.offset, main_#t~mem193#1.base, main_#t~mem193#1.offset, main_#t~mem194#1.base, main_#t~mem194#1.offset, main_#t~mem195#1.base, main_#t~mem195#1.offset, main_#t~mem196#1.base, main_#t~mem196#1.offset, main_#t~mem197#1.base, main_#t~mem197#1.offset, main_#t~mem198#1.base, main_#t~mem198#1.offset, main_#t~mem199#1, main_#t~mem200#1.base, main_#t~mem200#1.offset, main_#t~mem201#1.base, main_#t~mem201#1.offset, main_#t~mem202#1.base, main_#t~mem202#1.offset, main_#t~mem203#1, main_#t~mem204#1.base, main_#t~mem204#1.offset, main_#t~mem205#1.base, main_#t~mem205#1.offset, main_#t~mem206#1.base, main_#t~mem206#1.offset, main_#t~mem207#1.base, main_#t~mem207#1.offset, main_#t~mem208#1.base, main_#t~mem208#1.offset, main_#t~mem209#1, main_#t~mem210#1.base, main_#t~mem210#1.offset, main_#t~mem213#1, main_#t~mem211#1.base, main_#t~mem211#1.offset, main_#t~mem212#1, main_#t~mem214#1.base, main_#t~mem214#1.offset, main_#t~mem215#1.base, main_#t~mem215#1.offset, main_#t~mem216#1, main_#t~post217#1, main_#t~mem218#1.base, main_#t~mem218#1.offset, main_#t~mem219#1.base, main_#t~mem219#1.offset, main_#t~mem220#1.base, main_#t~mem220#1.offset, main_#t~mem221#1.base, main_#t~mem221#1.offset, main_#t~mem222#1.base, main_#t~mem222#1.offset, main_#t~mem223#1.base, main_#t~mem223#1.offset, main_#t~mem224#1.base, main_#t~mem224#1.offset, main_#t~mem225#1.base, main_#t~mem225#1.offset, main_~_hd_head~0#1.base, main_~_hd_head~0#1.offset, main_#t~mem226#1.base, main_#t~mem226#1.offset, main_#t~mem227#1, main_#t~post228#1, main_~_hd_bkt~0#1, main_~_hd_hh_del~0#1.base, main_~_hd_hh_del~0#1.offset, main_#t~mem142#1, main_#t~post143#1, main_#t~mem144#1, main_#t~mem229#1.base, main_#t~mem229#1.offset, main_#t~ite231#1.base, main_#t~ite231#1.offset, main_#t~mem230#1.base, main_#t~mem230#1.offset, main_#t~mem234#1.base, main_#t~mem234#1.offset, main_#t~mem235#1.base, main_#t~mem235#1.offset, main_#t~short236#1, main_#t~mem237#1.base, main_#t~mem237#1.offset, main_#t~mem238#1.base, main_#t~mem238#1.offset, main_#t~mem239#1.base, main_#t~mem239#1.offset, main_#t~mem240#1.base, main_#t~mem240#1.offset, main_#t~mem241#1.base, main_#t~mem241#1.offset, main_#t~mem242#1.base, main_#t~mem242#1.offset, main_#t~mem243#1.base, main_#t~mem243#1.offset, main_#t~mem244#1.base, main_#t~mem244#1.offset, main_#t~mem245#1, main_#t~mem246#1.base, main_#t~mem246#1.offset, main_#t~mem247#1.base, main_#t~mem247#1.offset, main_#t~mem248#1.base, main_#t~mem248#1.offset, main_#t~mem249#1, main_#t~mem250#1.base, main_#t~mem250#1.offset, main_#t~mem251#1.base, main_#t~mem251#1.offset, main_#t~mem252#1.base, main_#t~mem252#1.offset, main_#t~mem253#1.base, main_#t~mem253#1.offset, main_#t~mem254#1.base, main_#t~mem254#1.offset, main_#t~mem255#1, main_#t~mem256#1.base, main_#t~mem256#1.offset, main_#t~mem259#1, main_#t~mem257#1.base, main_#t~mem257#1.offset, main_#t~mem258#1, main_#t~mem260#1.base, main_#t~mem260#1.offset, main_#t~mem261#1.base, main_#t~mem261#1.offset, main_#t~mem262#1, main_#t~post263#1, main_#t~mem264#1.base, main_#t~mem264#1.offset, main_#t~mem265#1.base, main_#t~mem265#1.offset, main_#t~mem266#1.base, main_#t~mem266#1.offset, main_#t~mem267#1.base, main_#t~mem267#1.offset, main_#t~mem268#1.base, main_#t~mem268#1.offset, main_#t~mem269#1.base, main_#t~mem269#1.offset, main_#t~mem270#1.base, main_#t~mem270#1.offset, main_#t~mem271#1.base, main_#t~mem271#1.offset, main_~_hd_head~1#1.base, main_~_hd_head~1#1.offset, main_#t~mem272#1.base, main_#t~mem272#1.offset, main_#t~mem273#1, main_#t~post274#1, main_~_hd_bkt~1#1, main_~_hd_hh_del~1#1.base, main_~_hd_hh_del~1#1.offset, main_#t~ite233#1.base, main_#t~ite233#1.offset, main_#t~mem232#1.base, main_#t~mem232#1.offset, main_~#i~0#1.base, main_~#i~0#1.offset, main_~user~0#1.base, main_~user~0#1.offset, main_~tmp~0#1.base, main_~tmp~0#1.offset, main_~users~0#1.base, main_~users~0#1.offset, main_~temp~0#1.base, main_~temp~0#1.offset;call main_~#i~0#1.base, main_~#i~0#1.offset := #Ultimate.allocOnStack(4);havoc main_~user~0#1.base, main_~user~0#1.offset;havoc main_~tmp~0#1.base, main_~tmp~0#1.offset;main_~users~0#1.base, main_~users~0#1.offset := 0, 0;call write~int(0, main_~#i~0#1.base, main_~#i~0#1.offset, 4); {6832#true} is VALID [2022-02-20 23:27:22,674 INFO L290 TraceCheckUtils]: 2: Hoare triple {6832#true} call main_#t~mem5#1 := read~int(main_~#i~0#1.base, main_~#i~0#1.offset, 4); {6832#true} is VALID [2022-02-20 23:27:22,674 INFO L290 TraceCheckUtils]: 3: Hoare triple {6832#true} assume !!(main_#t~mem5#1 < 1000);havoc main_#t~mem5#1;call main_#t~malloc6#1.base, main_#t~malloc6#1.offset := #Ultimate.allocOnHeap(40);main_~user~0#1.base, main_~user~0#1.offset := main_#t~malloc6#1.base, main_#t~malloc6#1.offset;havoc main_#t~malloc6#1.base, main_#t~malloc6#1.offset; {6832#true} is VALID [2022-02-20 23:27:22,674 INFO L290 TraceCheckUtils]: 4: Hoare triple {6832#true} assume !(main_~user~0#1.base == 0 && main_~user~0#1.offset == 0); {6832#true} is VALID [2022-02-20 23:27:22,674 INFO L290 TraceCheckUtils]: 5: Hoare triple {6832#true} call main_#t~mem7#1 := read~int(main_~#i~0#1.base, main_~#i~0#1.offset, 4);call write~int(main_#t~mem7#1, main_~user~0#1.base, main_~user~0#1.offset, 4);havoc main_#t~mem7#1;call main_#t~mem8#1 := read~int(main_~#i~0#1.base, main_~#i~0#1.offset, 4);call main_#t~mem9#1 := read~int(main_~#i~0#1.base, main_~#i~0#1.offset, 4);call write~int(main_#t~mem8#1 * main_#t~mem9#1, main_~user~0#1.base, 4 + main_~user~0#1.offset, 4);havoc main_#t~mem8#1;havoc main_#t~mem9#1; {6832#true} is VALID [2022-02-20 23:27:22,674 INFO L290 TraceCheckUtils]: 6: Hoare triple {6832#true} havoc main_~_ha_hashv~0#1; {6832#true} is VALID [2022-02-20 23:27:22,674 INFO L290 TraceCheckUtils]: 7: Hoare triple {6832#true} goto; {6832#true} is VALID [2022-02-20 23:27:22,675 INFO L290 TraceCheckUtils]: 8: Hoare triple {6832#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; {6832#true} is VALID [2022-02-20 23:27:22,675 INFO L290 TraceCheckUtils]: 9: Hoare triple {6832#true} assume !(main_~_hj_k~0#1 % 4294967296 >= 12); {6832#true} is VALID [2022-02-20 23:27:22,675 INFO L290 TraceCheckUtils]: 10: Hoare triple {6832#true} main_~_ha_hashv~0#1 := 4 + main_~_ha_hashv~0#1;main_#t~switch22#1 := 11 == main_~_hj_k~0#1; {6832#true} is VALID [2022-02-20 23:27:22,675 INFO L290 TraceCheckUtils]: 11: Hoare triple {6832#true} assume !main_#t~switch22#1; {6832#true} is VALID [2022-02-20 23:27:22,675 INFO L290 TraceCheckUtils]: 12: Hoare triple {6832#true} main_#t~switch22#1 := main_#t~switch22#1 || 10 == main_~_hj_k~0#1; {6832#true} is VALID [2022-02-20 23:27:22,675 INFO L290 TraceCheckUtils]: 13: Hoare triple {6832#true} assume !main_#t~switch22#1; {6832#true} is VALID [2022-02-20 23:27:22,675 INFO L290 TraceCheckUtils]: 14: Hoare triple {6832#true} main_#t~switch22#1 := main_#t~switch22#1 || 9 == main_~_hj_k~0#1; {6832#true} is VALID [2022-02-20 23:27:22,675 INFO L290 TraceCheckUtils]: 15: Hoare triple {6832#true} assume !main_#t~switch22#1; {6832#true} is VALID [2022-02-20 23:27:22,675 INFO L290 TraceCheckUtils]: 16: Hoare triple {6832#true} main_#t~switch22#1 := main_#t~switch22#1 || 8 == main_~_hj_k~0#1; {6832#true} is VALID [2022-02-20 23:27:22,676 INFO L290 TraceCheckUtils]: 17: Hoare triple {6832#true} assume !main_#t~switch22#1; {6832#true} is VALID [2022-02-20 23:27:22,676 INFO L290 TraceCheckUtils]: 18: Hoare triple {6832#true} main_#t~switch22#1 := main_#t~switch22#1 || 7 == main_~_hj_k~0#1; {6832#true} is VALID [2022-02-20 23:27:22,676 INFO L290 TraceCheckUtils]: 19: Hoare triple {6832#true} assume !main_#t~switch22#1; {6832#true} is VALID [2022-02-20 23:27:22,676 INFO L290 TraceCheckUtils]: 20: Hoare triple {6832#true} main_#t~switch22#1 := main_#t~switch22#1 || 6 == main_~_hj_k~0#1; {6832#true} is VALID [2022-02-20 23:27:22,676 INFO L290 TraceCheckUtils]: 21: Hoare triple {6832#true} assume !main_#t~switch22#1; {6832#true} is VALID [2022-02-20 23:27:22,676 INFO L290 TraceCheckUtils]: 22: Hoare triple {6832#true} main_#t~switch22#1 := main_#t~switch22#1 || 5 == main_~_hj_k~0#1; {6832#true} is VALID [2022-02-20 23:27:22,676 INFO L290 TraceCheckUtils]: 23: Hoare triple {6832#true} assume !main_#t~switch22#1; {6832#true} is VALID [2022-02-20 23:27:22,677 INFO L290 TraceCheckUtils]: 24: Hoare triple {6832#true} main_#t~switch22#1 := main_#t~switch22#1 || 4 == main_~_hj_k~0#1; {6832#true} is VALID [2022-02-20 23:27:22,677 INFO L290 TraceCheckUtils]: 25: Hoare triple {6832#true} assume main_#t~switch22#1;call main_#t~mem30#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~mem30#1 % 256);havoc main_#t~mem30#1; {6832#true} is VALID [2022-02-20 23:27:22,677 INFO L290 TraceCheckUtils]: 26: Hoare triple {6832#true} main_#t~switch22#1 := main_#t~switch22#1 || 3 == main_~_hj_k~0#1; {6832#true} is VALID [2022-02-20 23:27:22,677 INFO L290 TraceCheckUtils]: 27: Hoare triple {6832#true} assume main_#t~switch22#1;call main_#t~mem31#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~mem31#1 % 256);havoc main_#t~mem31#1; {6832#true} is VALID [2022-02-20 23:27:22,677 INFO L290 TraceCheckUtils]: 28: Hoare triple {6832#true} main_#t~switch22#1 := main_#t~switch22#1 || 2 == main_~_hj_k~0#1; {6832#true} is VALID [2022-02-20 23:27:22,677 INFO L290 TraceCheckUtils]: 29: Hoare triple {6832#true} assume main_#t~switch22#1;call main_#t~mem32#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~mem32#1 % 256);havoc main_#t~mem32#1; {6832#true} is VALID [2022-02-20 23:27:22,678 INFO L290 TraceCheckUtils]: 30: Hoare triple {6832#true} main_#t~switch22#1 := main_#t~switch22#1 || 1 == main_~_hj_k~0#1; {6832#true} is VALID [2022-02-20 23:27:22,678 INFO L290 TraceCheckUtils]: 31: Hoare triple {6832#true} assume main_#t~switch22#1;call main_#t~mem33#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~mem33#1 % 256;havoc main_#t~mem33#1; {6832#true} is VALID [2022-02-20 23:27:22,678 INFO L290 TraceCheckUtils]: 32: Hoare triple {6832#true} havoc main_#t~switch22#1; {6832#true} is VALID [2022-02-20 23:27:22,678 INFO L290 TraceCheckUtils]: 33: Hoare triple {6832#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)))); {6832#true} is VALID [2022-02-20 23:27:22,678 INFO L290 TraceCheckUtils]: 34: Hoare triple {6832#true} goto; {6832#true} is VALID [2022-02-20 23:27:22,678 INFO L290 TraceCheckUtils]: 35: Hoare triple {6832#true} goto; {6832#true} is VALID [2022-02-20 23:27:22,679 INFO L290 TraceCheckUtils]: 36: Hoare triple {6832#true} goto; {6832#true} is VALID [2022-02-20 23:27:22,679 INFO L290 TraceCheckUtils]: 37: Hoare triple {6832#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); {6832#true} is VALID [2022-02-20 23:27:22,679 INFO L290 TraceCheckUtils]: 38: Hoare triple {6832#true} assume main_~users~0#1.base == 0 && main_~users~0#1.offset == 0;call write~$Pointer$(0, 0, main_~user~0#1.base, 16 + main_~user~0#1.offset, 4);call write~$Pointer$(0, 0, main_~user~0#1.base, 12 + main_~user~0#1.offset, 4); {6832#true} is VALID [2022-02-20 23:27:22,679 INFO L290 TraceCheckUtils]: 39: Hoare triple {6832#true} call main_#t~malloc34#1.base, main_#t~malloc34#1.offset := #Ultimate.allocOnHeap(44);call write~$Pointer$(main_#t~malloc34#1.base, main_#t~malloc34#1.offset, main_~user~0#1.base, 8 + main_~user~0#1.offset, 4);havoc main_#t~malloc34#1.base, main_#t~malloc34#1.offset;call main_#t~mem35#1.base, main_#t~mem35#1.offset := read~$Pointer$(main_~user~0#1.base, 8 + main_~user~0#1.offset, 4); {6832#true} is VALID [2022-02-20 23:27:22,679 INFO L290 TraceCheckUtils]: 40: Hoare triple {6832#true} assume !(main_#t~mem35#1.base == 0 && main_#t~mem35#1.offset == 0);havoc main_#t~mem35#1.base, main_#t~mem35#1.offset;call main_#t~mem36#1.base, main_#t~mem36#1.offset := read~$Pointer$(main_~user~0#1.base, 8 + main_~user~0#1.offset, 4); {6832#true} is VALID [2022-02-20 23:27:22,680 INFO L272 TraceCheckUtils]: 41: Hoare triple {6832#true} call main_#t~memset~res37#1.base, main_#t~memset~res37#1.offset := #Ultimate.C_memset(main_#t~mem36#1.base, main_#t~mem36#1.offset, 0, 44); {6832#true} is VALID [2022-02-20 23:27:22,680 INFO L290 TraceCheckUtils]: 42: Hoare triple {6832#true} #t~loopctr276 := 0; {6832#true} is VALID [2022-02-20 23:27:22,680 INFO L290 TraceCheckUtils]: 43: Hoare triple {6832#true} assume !(#t~loopctr276 % 4294967296 < #amount % 4294967296); {6832#true} is VALID [2022-02-20 23:27:22,680 INFO L290 TraceCheckUtils]: 44: Hoare triple {6832#true} assume #res.base == #ptr.base && #res.offset == #ptr.offset; {6832#true} is VALID [2022-02-20 23:27:22,680 INFO L284 TraceCheckUtils]: 45: Hoare quadruple {6832#true} {6832#true} #903#return; {6832#true} is VALID [2022-02-20 23:27:22,681 INFO L290 TraceCheckUtils]: 46: Hoare triple {6832#true} havoc main_#t~mem36#1.base, main_#t~mem36#1.offset;havoc main_#t~memset~res37#1.base, main_#t~memset~res37#1.offset;call main_#t~mem38#1.base, main_#t~mem38#1.offset := read~$Pointer$(main_~user~0#1.base, 8 + main_~user~0#1.offset, 4);call write~$Pointer$(main_~user~0#1.base, 8 + main_~user~0#1.offset, main_#t~mem38#1.base, 16 + main_#t~mem38#1.offset, 4);havoc main_#t~mem38#1.base, main_#t~mem38#1.offset;call main_#t~mem39#1.base, main_#t~mem39#1.offset := read~$Pointer$(main_~user~0#1.base, 8 + main_~user~0#1.offset, 4);call write~int(32, main_#t~mem39#1.base, 4 + main_#t~mem39#1.offset, 4);havoc main_#t~mem39#1.base, main_#t~mem39#1.offset;call main_#t~mem40#1.base, main_#t~mem40#1.offset := read~$Pointer$(main_~user~0#1.base, 8 + main_~user~0#1.offset, 4);call write~int(5, main_#t~mem40#1.base, 8 + main_#t~mem40#1.offset, 4);havoc main_#t~mem40#1.base, main_#t~mem40#1.offset;call main_#t~mem41#1.base, main_#t~mem41#1.offset := read~$Pointer$(main_~user~0#1.base, 8 + main_~user~0#1.offset, 4);call write~int((if 8 + main_~user~0#1.offset - main_~user~0#1.offset < 0 && 0 != (8 + main_~user~0#1.offset - main_~user~0#1.offset) % 1 then 1 + (8 + main_~user~0#1.offset - main_~user~0#1.offset) / 1 else (8 + main_~user~0#1.offset - main_~user~0#1.offset) / 1), main_#t~mem41#1.base, 20 + main_#t~mem41#1.offset, 4);havoc main_#t~mem41#1.base, main_#t~mem41#1.offset;call main_#t~mem42#1.base, main_#t~mem42#1.offset := read~$Pointer$(main_~user~0#1.base, 8 + main_~user~0#1.offset, 4);call main_#t~malloc43#1.base, main_#t~malloc43#1.offset := #Ultimate.allocOnHeap(384);call write~$Pointer$(main_#t~malloc43#1.base, main_#t~malloc43#1.offset, main_#t~mem42#1.base, main_#t~mem42#1.offset, 4);havoc main_#t~mem42#1.base, main_#t~mem42#1.offset;havoc main_#t~malloc43#1.base, main_#t~malloc43#1.offset;call main_#t~mem44#1.base, main_#t~mem44#1.offset := read~$Pointer$(main_~user~0#1.base, 8 + main_~user~0#1.offset, 4);call write~int(2685476833, main_#t~mem44#1.base, 40 + main_#t~mem44#1.offset, 4);havoc main_#t~mem44#1.base, main_#t~mem44#1.offset;call main_#t~mem45#1.base, main_#t~mem45#1.offset := read~$Pointer$(main_~user~0#1.base, 8 + main_~user~0#1.offset, 4);call main_#t~mem46#1.base, main_#t~mem46#1.offset := read~$Pointer$(main_#t~mem45#1.base, main_#t~mem45#1.offset, 4); {6832#true} is VALID [2022-02-20 23:27:22,681 INFO L290 TraceCheckUtils]: 47: Hoare triple {6832#true} assume !(main_#t~mem46#1.base == 0 && main_#t~mem46#1.offset == 0);havoc main_#t~mem45#1.base, main_#t~mem45#1.offset;havoc main_#t~mem46#1.base, main_#t~mem46#1.offset;call main_#t~mem48#1.base, main_#t~mem48#1.offset := read~$Pointer$(main_~user~0#1.base, 8 + main_~user~0#1.offset, 4);call main_#t~mem49#1.base, main_#t~mem49#1.offset := read~$Pointer$(main_#t~mem48#1.base, main_#t~mem48#1.offset, 4); {6832#true} is VALID [2022-02-20 23:27:22,681 INFO L272 TraceCheckUtils]: 48: Hoare triple {6832#true} call main_#t~memset~res50#1.base, main_#t~memset~res50#1.offset := #Ultimate.C_memset(main_#t~mem49#1.base, main_#t~mem49#1.offset, 0, 384); {6832#true} is VALID [2022-02-20 23:27:22,681 INFO L290 TraceCheckUtils]: 49: Hoare triple {6832#true} #t~loopctr276 := 0; {6832#true} is VALID [2022-02-20 23:27:22,682 INFO L290 TraceCheckUtils]: 50: Hoare triple {6832#true} assume !(#t~loopctr276 % 4294967296 < #amount % 4294967296); {6832#true} is VALID [2022-02-20 23:27:22,682 INFO L290 TraceCheckUtils]: 51: Hoare triple {6832#true} assume #res.base == #ptr.base && #res.offset == #ptr.offset; {6832#true} is VALID [2022-02-20 23:27:22,682 INFO L284 TraceCheckUtils]: 52: Hoare quadruple {6832#true} {6832#true} #905#return; {6832#true} is VALID [2022-02-20 23:27:22,682 INFO L290 TraceCheckUtils]: 53: Hoare triple {6832#true} havoc main_#t~mem48#1.base, main_#t~mem48#1.offset;havoc main_#t~mem49#1.base, main_#t~mem49#1.offset;havoc main_#t~memset~res50#1.base, main_#t~memset~res50#1.offset; {6832#true} is VALID [2022-02-20 23:27:22,682 INFO L290 TraceCheckUtils]: 54: Hoare triple {6832#true} goto; {6832#true} is VALID [2022-02-20 23:27:22,683 INFO L290 TraceCheckUtils]: 55: Hoare triple {6832#true} main_~users~0#1.base, main_~users~0#1.offset := main_~user~0#1.base, main_~user~0#1.offset; {6832#true} is VALID [2022-02-20 23:27:22,683 INFO L290 TraceCheckUtils]: 56: Hoare triple {6832#true} havoc main_~_ha_bkt~0#1;call main_#t~mem59#1.base, main_#t~mem59#1.offset := read~$Pointer$(main_~users~0#1.base, 8 + main_~users~0#1.offset, 4);call main_#t~mem60#1 := read~int(main_#t~mem59#1.base, 12 + main_#t~mem59#1.offset, 4);main_#t~post61#1 := main_#t~mem60#1;call write~int(1 + main_#t~post61#1, main_#t~mem59#1.base, 12 + main_#t~mem59#1.offset, 4);havoc main_#t~mem59#1.base, main_#t~mem59#1.offset;havoc main_#t~mem60#1;havoc main_#t~post61#1; {6832#true} is VALID [2022-02-20 23:27:22,683 INFO L290 TraceCheckUtils]: 57: Hoare triple {6832#true} call main_#t~mem62#1.base, main_#t~mem62#1.offset := read~$Pointer$(main_~users~0#1.base, 8 + main_~users~0#1.offset, 4);call main_#t~mem63#1 := read~int(main_#t~mem62#1.base, 4 + main_#t~mem62#1.offset, 4);main_~_ha_bkt~0#1 := (if 0 == main_~_ha_hashv~0#1 || 0 == main_#t~mem63#1 - 1 then 0 else (if 1 == main_#t~mem63#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~mem63#1 - 1))) else (if 1 == main_~_ha_hashv~0#1 then (if 1 == main_#t~mem63#1 - 1 || 0 == main_#t~mem63#1 - 1 then main_#t~mem63#1 - 1 else (if main_#t~mem63#1 - 1 >= 0 then (main_#t~mem63#1 - 1) % 2 else ~bitwiseAnd(main_~_ha_hashv~0#1, main_#t~mem63#1 - 1))) else ~bitwiseAnd(main_~_ha_hashv~0#1, main_#t~mem63#1 - 1))));havoc main_#t~mem62#1.base, main_#t~mem62#1.offset;havoc main_#t~mem63#1; {6832#true} is VALID [2022-02-20 23:27:22,683 INFO L290 TraceCheckUtils]: 58: Hoare triple {6832#true} goto; {6832#true} is VALID [2022-02-20 23:27:22,683 INFO L290 TraceCheckUtils]: 59: Hoare triple {6832#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.base, main_#t~mem65#1.offset := read~$Pointer$(main_#t~mem64#1.base, main_#t~mem64#1.offset, 4);main_~_ha_head~0#1.base, main_~_ha_head~0#1.offset := main_#t~mem65#1.base, main_#t~mem65#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~mem64#1.base, main_#t~mem64#1.offset;havoc main_#t~mem65#1.base, main_#t~mem65#1.offset;call main_#t~mem66#1 := read~int(main_~_ha_head~0#1.base, 4 + main_~_ha_head~0#1.offset, 4);main_#t~post67#1 := main_#t~mem66#1;call write~int(1 + main_#t~post67#1, main_~_ha_head~0#1.base, 4 + main_~_ha_head~0#1.offset, 4);havoc main_#t~mem66#1;havoc main_#t~post67#1;call main_#t~mem68#1.base, main_#t~mem68#1.offset := read~$Pointer$(main_~_ha_head~0#1.base, main_~_ha_head~0#1.offset, 4);call write~$Pointer$(main_#t~mem68#1.base, main_#t~mem68#1.offset, main_~user~0#1.base, 24 + main_~user~0#1.offset, 4);havoc main_#t~mem68#1.base, main_#t~mem68#1.offset;call write~$Pointer$(0, 0, main_~user~0#1.base, 20 + main_~user~0#1.offset, 4);call main_#t~mem69#1.base, main_#t~mem69#1.offset := read~$Pointer$(main_~_ha_head~0#1.base, main_~_ha_head~0#1.offset, 4); {6832#true} is VALID [2022-02-20 23:27:22,683 INFO L290 TraceCheckUtils]: 60: Hoare triple {6832#true} assume main_#t~mem69#1.base != 0 || main_#t~mem69#1.offset != 0;havoc main_#t~mem69#1.base, main_#t~mem69#1.offset;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_~user~0#1.base, 8 + main_~user~0#1.offset, main_#t~mem70#1.base, 12 + main_#t~mem70#1.offset, 4);havoc main_#t~mem70#1.base, main_#t~mem70#1.offset; {6832#true} is VALID [2022-02-20 23:27:22,684 INFO L290 TraceCheckUtils]: 61: Hoare triple {6832#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~mem72#1 := read~int(main_~_ha_head~0#1.base, 4 + main_~_ha_head~0#1.offset, 4);call main_#t~mem71#1 := read~int(main_~_ha_head~0#1.base, 8 + main_~_ha_head~0#1.offset, 4);main_#t~short75#1 := main_#t~mem72#1 % 4294967296 >= 10 * (1 + main_#t~mem71#1) % 4294967296; {6832#true} is VALID [2022-02-20 23:27:22,684 INFO L290 TraceCheckUtils]: 62: Hoare triple {6832#true} assume main_#t~short75#1;call main_#t~mem73#1.base, main_#t~mem73#1.offset := read~$Pointer$(main_~user~0#1.base, 8 + main_~user~0#1.offset, 4);call main_#t~mem74#1 := read~int(main_#t~mem73#1.base, 36 + main_#t~mem73#1.offset, 4);main_#t~short75#1 := 0 == main_#t~mem74#1 % 4294967296; {6832#true} is VALID [2022-02-20 23:27:22,684 INFO L290 TraceCheckUtils]: 63: Hoare triple {6832#true} assume !main_#t~short75#1;havoc main_#t~mem72#1;havoc main_#t~mem71#1;havoc main_#t~mem73#1.base, main_#t~mem73#1.offset;havoc main_#t~mem74#1;havoc main_#t~short75#1; {6832#true} is VALID [2022-02-20 23:27:22,684 INFO L290 TraceCheckUtils]: 64: Hoare triple {6832#true} goto; {6832#true} is VALID [2022-02-20 23:27:22,684 INFO L290 TraceCheckUtils]: 65: Hoare triple {6832#true} goto; {6832#true} is VALID [2022-02-20 23:27:22,685 INFO L290 TraceCheckUtils]: 66: Hoare triple {6832#true} goto; {6832#true} is VALID [2022-02-20 23:27:22,685 INFO L290 TraceCheckUtils]: 67: Hoare triple {6832#true} goto; {6832#true} is VALID [2022-02-20 23:27:22,685 INFO L290 TraceCheckUtils]: 68: Hoare triple {6832#true} call main_#t~mem3#1 := read~int(main_~#i~0#1.base, main_~#i~0#1.offset, 4);main_#t~post4#1 := main_#t~mem3#1;call write~int(1 + main_#t~post4#1, main_~#i~0#1.base, main_~#i~0#1.offset, 4);havoc main_#t~mem3#1;havoc main_#t~post4#1; {6832#true} is VALID [2022-02-20 23:27:22,685 INFO L290 TraceCheckUtils]: 69: Hoare triple {6832#true} call main_#t~mem5#1 := read~int(main_~#i~0#1.base, main_~#i~0#1.offset, 4); {6832#true} is VALID [2022-02-20 23:27:22,685 INFO L290 TraceCheckUtils]: 70: Hoare triple {6832#true} assume !(main_#t~mem5#1 < 1000);havoc main_#t~mem5#1; {6832#true} is VALID [2022-02-20 23:27:22,687 INFO L290 TraceCheckUtils]: 71: Hoare triple {6832#true} call write~int(0, main_~#i~0#1.base, main_~#i~0#1.offset, 4); {7050#(<= (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:27:22,687 INFO L290 TraceCheckUtils]: 72: Hoare triple {7050#(<= (select (select |#memory_int| |ULTIMATE.start_main_~#i~0#1.base|) |ULTIMATE.start_main_~#i~0#1.offset|) 0)} call main_#t~mem144#1 := read~int(main_~#i~0#1.base, main_~#i~0#1.offset, 4); {7054#(<= |ULTIMATE.start_main_#t~mem144#1| 0)} is VALID [2022-02-20 23:27:22,688 INFO L290 TraceCheckUtils]: 73: Hoare triple {7054#(<= |ULTIMATE.start_main_#t~mem144#1| 0)} assume !(main_#t~mem144#1 < 1000);havoc main_#t~mem144#1; {6833#false} is VALID [2022-02-20 23:27:22,688 INFO L290 TraceCheckUtils]: 74: Hoare triple {6833#false} main_~user~0#1.base, main_~user~0#1.offset := main_~users~0#1.base, main_~users~0#1.offset; {6833#false} is VALID [2022-02-20 23:27:22,688 INFO L290 TraceCheckUtils]: 75: Hoare triple {6833#false} assume !!(main_~user~0#1.base != 0 || main_~user~0#1.offset != 0); {6833#false} is VALID [2022-02-20 23:27:22,688 INFO L290 TraceCheckUtils]: 76: Hoare triple {6833#false} assume !false; {6833#false} is VALID [2022-02-20 23:27:22,688 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-02-20 23:27:22,688 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 23:27:22,689 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 23:27:22,689 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1257624705] [2022-02-20 23:27:22,689 WARN L317 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-02-20 23:27:22,689 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [779553105] [2022-02-20 23:27:22,689 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [779553105] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:27:22,689 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:27:22,689 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-02-20 23:27:22,689 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [816031187] [2022-02-20 23:27:22,689 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:27:22,690 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 17.25) internal successors, (69), 4 states have internal predecessors, (69), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 77 [2022-02-20 23:27:22,690 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:27:22,691 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 17.25) internal successors, (69), 4 states have internal predecessors, (69), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-02-20 23:27:22,762 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 73 edges. 73 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:27:22,762 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-02-20 23:27:22,762 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 23:27:22,762 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-02-20 23:27:22,762 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-02-20 23:27:22,763 INFO L87 Difference]: Start difference. First operand 295 states and 370 transitions. Second operand has 4 states, 4 states have (on average 17.25) internal successors, (69), 4 states have internal predecessors, (69), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-02-20 23:27:23,823 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:27:23,823 INFO L93 Difference]: Finished difference Result 393 states and 500 transitions. [2022-02-20 23:27:23,824 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-02-20 23:27:23,824 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 17.25) internal successors, (69), 4 states have internal predecessors, (69), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 77 [2022-02-20 23:27:23,824 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:27:23,824 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 17.25) internal successors, (69), 4 states have internal predecessors, (69), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-02-20 23:27:23,827 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 346 transitions. [2022-02-20 23:27:23,828 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 17.25) internal successors, (69), 4 states have internal predecessors, (69), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-02-20 23:27:23,830 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 346 transitions. [2022-02-20 23:27:23,830 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 346 transitions. [2022-02-20 23:27:24,127 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 346 edges. 346 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:27:24,136 INFO L225 Difference]: With dead ends: 393 [2022-02-20 23:27:24,136 INFO L226 Difference]: Without dead ends: 389 [2022-02-20 23:27:24,136 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 74 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:27:24,137 INFO L933 BasicCegarLoop]: 218 mSDtfsCounter, 102 mSDsluCounter, 376 mSDsCounter, 0 mSdLazyCounter, 138 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 102 SdHoareTripleChecker+Valid, 594 SdHoareTripleChecker+Invalid, 142 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 138 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-02-20 23:27:24,137 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [102 Valid, 594 Invalid, 142 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 138 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-02-20 23:27:24,138 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 389 states. [2022-02-20 23:27:24,180 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 389 to 297. [2022-02-20 23:27:24,180 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:27:24,181 INFO L82 GeneralOperation]: Start isEquivalent. First operand 389 states. Second operand has 297 states, 291 states have (on average 1.2577319587628866) internal successors, (366), 292 states have internal predecessors, (366), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-02-20 23:27:24,182 INFO L74 IsIncluded]: Start isIncluded. First operand 389 states. Second operand has 297 states, 291 states have (on average 1.2577319587628866) internal successors, (366), 292 states have internal predecessors, (366), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-02-20 23:27:24,183 INFO L87 Difference]: Start difference. First operand 389 states. Second operand has 297 states, 291 states have (on average 1.2577319587628866) internal successors, (366), 292 states have internal predecessors, (366), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-02-20 23:27:24,193 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:27:24,193 INFO L93 Difference]: Finished difference Result 389 states and 496 transitions. [2022-02-20 23:27:24,193 INFO L276 IsEmpty]: Start isEmpty. Operand 389 states and 496 transitions. [2022-02-20 23:27:24,194 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:27:24,194 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:27:24,195 INFO L74 IsIncluded]: Start isIncluded. First operand has 297 states, 291 states have (on average 1.2577319587628866) internal successors, (366), 292 states have internal predecessors, (366), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand 389 states. [2022-02-20 23:27:24,195 INFO L87 Difference]: Start difference. First operand has 297 states, 291 states have (on average 1.2577319587628866) internal successors, (366), 292 states have internal predecessors, (366), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand 389 states. [2022-02-20 23:27:24,206 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:27:24,206 INFO L93 Difference]: Finished difference Result 389 states and 496 transitions. [2022-02-20 23:27:24,206 INFO L276 IsEmpty]: Start isEmpty. Operand 389 states and 496 transitions. [2022-02-20 23:27:24,207 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:27:24,207 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:27:24,207 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:27:24,207 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:27:24,208 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 297 states, 291 states have (on average 1.2577319587628866) internal successors, (366), 292 states have internal predecessors, (366), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-02-20 23:27:24,215 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 297 states to 297 states and 372 transitions. [2022-02-20 23:27:24,215 INFO L78 Accepts]: Start accepts. Automaton has 297 states and 372 transitions. Word has length 77 [2022-02-20 23:27:24,215 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:27:24,215 INFO L470 AbstractCegarLoop]: Abstraction has 297 states and 372 transitions. [2022-02-20 23:27:24,215 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 17.25) internal successors, (69), 4 states have internal predecessors, (69), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-02-20 23:27:24,216 INFO L276 IsEmpty]: Start isEmpty. Operand 297 states and 372 transitions. [2022-02-20 23:27:24,217 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2022-02-20 23:27:24,217 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:27:24,217 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:27:24,244 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-02-20 23:27:24,439 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 23:27:24,440 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 23:27:24,440 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:27:24,440 INFO L85 PathProgramCache]: Analyzing trace with hash -1698389817, now seen corresponding path program 1 times [2022-02-20 23:27:24,440 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 23:27:24,440 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [89644724] [2022-02-20 23:27:24,440 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:27:24,441 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 23:27:24,490 ERROR L252 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-02-20 23:27:24,490 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1295989004] [2022-02-20 23:27:24,491 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:27:24,491 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 23:27:24,491 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 23:27:24,492 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-02-20 23:27:24,506 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-02-20 23:27:25,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:27:25,019 INFO L263 TraceCheckSpWp]: Trace formula consists of 772 conjuncts, 3 conjunts are in the unsatisfiable core [2022-02-20 23:27:25,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:27:25,070 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 23:27:25,306 INFO L290 TraceCheckUtils]: 0: Hoare triple {8648#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); {8648#true} is VALID [2022-02-20 23:27:25,307 INFO L290 TraceCheckUtils]: 1: Hoare triple {8648#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc6#1.base, main_#t~malloc6#1.offset, main_#t~mem7#1, main_#t~mem8#1, main_#t~mem9#1, main_#t~mem11#1, main_#t~mem10#1, main_#t~mem12#1, main_#t~mem13#1, main_#t~mem15#1, main_#t~mem14#1, main_#t~mem16#1, main_#t~mem17#1, main_#t~mem19#1, main_#t~mem18#1, main_#t~mem20#1, main_#t~mem21#1, main_#t~switch22#1, main_#t~mem23#1, main_#t~mem24#1, main_#t~mem25#1, main_#t~mem26#1, main_#t~mem27#1, main_#t~mem28#1, main_#t~mem29#1, main_#t~mem30#1, main_#t~mem31#1, main_#t~mem32#1, main_#t~mem33#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~malloc34#1.base, main_#t~malloc34#1.offset, main_#t~mem35#1.base, main_#t~mem35#1.offset, main_#t~mem36#1.base, main_#t~mem36#1.offset, main_#t~memset~res37#1.base, main_#t~memset~res37#1.offset, main_#t~mem38#1.base, main_#t~mem38#1.offset, main_#t~mem39#1.base, main_#t~mem39#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~malloc43#1.base, main_#t~malloc43#1.offset, main_#t~mem44#1.base, main_#t~mem44#1.offset, main_#t~mem45#1.base, main_#t~mem45#1.offset, main_#t~mem46#1.base, main_#t~mem46#1.offset, main_#t~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~memset~res50#1.base, main_#t~memset~res50#1.offset, main_#t~mem51#1.base, main_#t~mem51#1.offset, main_#t~mem52#1.base, main_#t~mem52#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, main_#t~mem56#1.base, main_#t~mem56#1.offset, main_#t~mem57#1.base, main_#t~mem57#1.offset, main_#t~mem58#1.base, main_#t~mem58#1.offset, main_#t~mem59#1.base, main_#t~mem59#1.offset, main_#t~mem60#1, main_#t~post61#1, main_#t~mem62#1.base, main_#t~mem62#1.offset, main_#t~mem63#1, main_#t~mem64#1.base, main_#t~mem64#1.offset, main_#t~mem65#1.base, main_#t~mem65#1.offset, main_#t~mem66#1, main_#t~post67#1, main_#t~mem68#1.base, main_#t~mem68#1.offset, main_#t~mem69#1.base, main_#t~mem69#1.offset, main_#t~mem70#1.base, main_#t~mem70#1.offset, main_#t~mem72#1, main_#t~mem71#1, main_#t~mem73#1.base, main_#t~mem73#1.offset, main_#t~mem74#1, main_#t~short75#1, main_#t~mem76#1.base, main_#t~mem76#1.offset, main_#t~mem77#1, main_#t~malloc78#1.base, main_#t~malloc78#1.offset, main_#t~mem79#1.base, main_#t~mem79#1.offset, main_#t~mem80#1.base, main_#t~mem80#1.offset, main_#t~mem81#1.base, main_#t~mem81#1.offset, main_#t~mem82#1, main_#t~memset~res83#1.base, main_#t~memset~res83#1.offset, main_#t~mem84#1.base, main_#t~mem84#1.offset, main_#t~mem85#1.base, main_#t~mem85#1.offset, main_#t~mem88#1, main_#t~mem86#1.base, main_#t~mem86#1.offset, main_#t~mem87#1, main_#t~mem89#1.base, main_#t~mem89#1.offset, main_#t~mem92#1, main_#t~mem90#1.base, main_#t~mem90#1.offset, main_#t~mem91#1, main_#t~ite93#1, main_#t~mem94#1.base, main_#t~mem94#1.offset, main_#t~mem98#1.base, main_#t~mem98#1.offset, main_#t~mem99#1.base, main_#t~mem99#1.offset, main_#t~mem100#1.base, main_#t~mem100#1.offset, main_#t~mem101#1.base, main_#t~mem101#1.offset, main_#t~mem104#1, main_#t~mem102#1.base, main_#t~mem102#1.offset, main_#t~mem103#1, main_#t~mem105#1.base, main_#t~mem105#1.offset, main_#t~mem106#1, main_#t~pre107#1, main_#t~mem108#1.base, main_#t~mem108#1.offset, main_#t~mem109#1, main_#t~mem110#1.base, main_#t~mem110#1.offset, main_#t~mem111#1, main_#t~post112#1, main_#t~mem116#1, main_#t~mem114#1, main_#t~mem113#1.base, main_#t~mem113#1.offset, main_#t~mem115#1, main_#t~mem117#1, main_#t~post118#1, main_#t~mem119#1.base, main_#t~mem119#1.offset, main_#t~mem120#1.base, main_#t~mem120#1.offset, main_#t~mem121#1.base, main_#t~mem121#1.offset, main_#t~post95#1, main_#t~mem96#1.base, main_#t~mem96#1.offset, main_#t~mem97#1, main_#t~mem122#1.base, main_#t~mem122#1.offset, main_#t~mem123#1.base, main_#t~mem123#1.offset, main_#t~mem124#1.base, main_#t~mem124#1.offset, main_#t~mem125#1, main_#t~mem126#1.base, main_#t~mem126#1.offset, main_#t~mem127#1, main_#t~post128#1, main_#t~mem129#1.base, main_#t~mem129#1.offset, main_#t~mem130#1.base, main_#t~mem130#1.offset, main_#t~mem131#1.base, main_#t~mem131#1.offset, main_#t~mem132#1.base, main_#t~mem132#1.offset, main_#t~mem135#1, main_#t~mem133#1.base, main_#t~mem133#1.offset, main_#t~mem134#1, main_#t~ite138#1, main_#t~mem136#1.base, main_#t~mem136#1.offset, main_#t~mem137#1, main_#t~mem139#1.base, main_#t~mem139#1.offset, main_#t~mem140#1, main_#t~mem141#1.base, main_#t~mem141#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~mem3#1, main_#t~post4#1, main_#t~mem5#1, main_#t~mem146#1, main_#t~mem145#1, main_#t~mem147#1, main_#t~mem148#1, main_#t~mem150#1, main_#t~mem149#1, main_#t~mem151#1, main_#t~mem152#1, main_#t~mem154#1, main_#t~mem153#1, main_#t~mem155#1, main_#t~mem156#1, main_#t~switch157#1, main_#t~mem158#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_~_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~mem169#1.base, main_#t~mem169#1.offset, main_#t~mem170#1, main_#t~mem171#1.base, main_#t~mem171#1.offset, 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, main_#t~mem179#1, main_#t~mem180#1, main_#t~short181#1, main_#t~mem182#1.base, main_#t~mem182#1.offset, main_#t~ret183#1, main_#t~mem184#1.base, main_#t~mem184#1.offset, main_#t~mem185#1.base, main_#t~mem185#1.offset, main_#t~mem186#1.base, main_#t~mem186#1.offset, main_#t~mem187#1, main_~_hf_bkt~0#1, main_~_hf_hashv~0#1, main_#t~mem188#1.base, main_#t~mem188#1.offset, main_#t~mem189#1.base, main_#t~mem189#1.offset, main_#t~short190#1, main_#t~mem191#1.base, main_#t~mem191#1.offset, main_#t~mem192#1.base, main_#t~mem192#1.offset, main_#t~mem193#1.base, main_#t~mem193#1.offset, main_#t~mem194#1.base, main_#t~mem194#1.offset, main_#t~mem195#1.base, main_#t~mem195#1.offset, main_#t~mem196#1.base, main_#t~mem196#1.offset, main_#t~mem197#1.base, main_#t~mem197#1.offset, main_#t~mem198#1.base, main_#t~mem198#1.offset, main_#t~mem199#1, main_#t~mem200#1.base, main_#t~mem200#1.offset, main_#t~mem201#1.base, main_#t~mem201#1.offset, main_#t~mem202#1.base, main_#t~mem202#1.offset, main_#t~mem203#1, main_#t~mem204#1.base, main_#t~mem204#1.offset, main_#t~mem205#1.base, main_#t~mem205#1.offset, main_#t~mem206#1.base, main_#t~mem206#1.offset, main_#t~mem207#1.base, main_#t~mem207#1.offset, main_#t~mem208#1.base, main_#t~mem208#1.offset, main_#t~mem209#1, main_#t~mem210#1.base, main_#t~mem210#1.offset, main_#t~mem213#1, main_#t~mem211#1.base, main_#t~mem211#1.offset, main_#t~mem212#1, main_#t~mem214#1.base, main_#t~mem214#1.offset, main_#t~mem215#1.base, main_#t~mem215#1.offset, main_#t~mem216#1, main_#t~post217#1, main_#t~mem218#1.base, main_#t~mem218#1.offset, main_#t~mem219#1.base, main_#t~mem219#1.offset, main_#t~mem220#1.base, main_#t~mem220#1.offset, main_#t~mem221#1.base, main_#t~mem221#1.offset, main_#t~mem222#1.base, main_#t~mem222#1.offset, main_#t~mem223#1.base, main_#t~mem223#1.offset, main_#t~mem224#1.base, main_#t~mem224#1.offset, main_#t~mem225#1.base, main_#t~mem225#1.offset, main_~_hd_head~0#1.base, main_~_hd_head~0#1.offset, main_#t~mem226#1.base, main_#t~mem226#1.offset, main_#t~mem227#1, main_#t~post228#1, main_~_hd_bkt~0#1, main_~_hd_hh_del~0#1.base, main_~_hd_hh_del~0#1.offset, main_#t~mem142#1, main_#t~post143#1, main_#t~mem144#1, main_#t~mem229#1.base, main_#t~mem229#1.offset, main_#t~ite231#1.base, main_#t~ite231#1.offset, main_#t~mem230#1.base, main_#t~mem230#1.offset, main_#t~mem234#1.base, main_#t~mem234#1.offset, main_#t~mem235#1.base, main_#t~mem235#1.offset, main_#t~short236#1, main_#t~mem237#1.base, main_#t~mem237#1.offset, main_#t~mem238#1.base, main_#t~mem238#1.offset, main_#t~mem239#1.base, main_#t~mem239#1.offset, main_#t~mem240#1.base, main_#t~mem240#1.offset, main_#t~mem241#1.base, main_#t~mem241#1.offset, main_#t~mem242#1.base, main_#t~mem242#1.offset, main_#t~mem243#1.base, main_#t~mem243#1.offset, main_#t~mem244#1.base, main_#t~mem244#1.offset, main_#t~mem245#1, main_#t~mem246#1.base, main_#t~mem246#1.offset, main_#t~mem247#1.base, main_#t~mem247#1.offset, main_#t~mem248#1.base, main_#t~mem248#1.offset, main_#t~mem249#1, main_#t~mem250#1.base, main_#t~mem250#1.offset, main_#t~mem251#1.base, main_#t~mem251#1.offset, main_#t~mem252#1.base, main_#t~mem252#1.offset, main_#t~mem253#1.base, main_#t~mem253#1.offset, main_#t~mem254#1.base, main_#t~mem254#1.offset, main_#t~mem255#1, main_#t~mem256#1.base, main_#t~mem256#1.offset, main_#t~mem259#1, main_#t~mem257#1.base, main_#t~mem257#1.offset, main_#t~mem258#1, main_#t~mem260#1.base, main_#t~mem260#1.offset, main_#t~mem261#1.base, main_#t~mem261#1.offset, main_#t~mem262#1, main_#t~post263#1, main_#t~mem264#1.base, main_#t~mem264#1.offset, main_#t~mem265#1.base, main_#t~mem265#1.offset, main_#t~mem266#1.base, main_#t~mem266#1.offset, main_#t~mem267#1.base, main_#t~mem267#1.offset, main_#t~mem268#1.base, main_#t~mem268#1.offset, main_#t~mem269#1.base, main_#t~mem269#1.offset, main_#t~mem270#1.base, main_#t~mem270#1.offset, main_#t~mem271#1.base, main_#t~mem271#1.offset, main_~_hd_head~1#1.base, main_~_hd_head~1#1.offset, main_#t~mem272#1.base, main_#t~mem272#1.offset, main_#t~mem273#1, main_#t~post274#1, main_~_hd_bkt~1#1, main_~_hd_hh_del~1#1.base, main_~_hd_hh_del~1#1.offset, main_#t~ite233#1.base, main_#t~ite233#1.offset, main_#t~mem232#1.base, main_#t~mem232#1.offset, main_~#i~0#1.base, main_~#i~0#1.offset, main_~user~0#1.base, main_~user~0#1.offset, main_~tmp~0#1.base, main_~tmp~0#1.offset, main_~users~0#1.base, main_~users~0#1.offset, main_~temp~0#1.base, main_~temp~0#1.offset;call main_~#i~0#1.base, main_~#i~0#1.offset := #Ultimate.allocOnStack(4);havoc main_~user~0#1.base, main_~user~0#1.offset;havoc main_~tmp~0#1.base, main_~tmp~0#1.offset;main_~users~0#1.base, main_~users~0#1.offset := 0, 0;call write~int(0, main_~#i~0#1.base, main_~#i~0#1.offset, 4); {8648#true} is VALID [2022-02-20 23:27:25,307 INFO L290 TraceCheckUtils]: 2: Hoare triple {8648#true} call main_#t~mem5#1 := read~int(main_~#i~0#1.base, main_~#i~0#1.offset, 4); {8648#true} is VALID [2022-02-20 23:27:25,307 INFO L290 TraceCheckUtils]: 3: Hoare triple {8648#true} assume !!(main_#t~mem5#1 < 1000);havoc main_#t~mem5#1;call main_#t~malloc6#1.base, main_#t~malloc6#1.offset := #Ultimate.allocOnHeap(40);main_~user~0#1.base, main_~user~0#1.offset := main_#t~malloc6#1.base, main_#t~malloc6#1.offset;havoc main_#t~malloc6#1.base, main_#t~malloc6#1.offset; {8648#true} is VALID [2022-02-20 23:27:25,307 INFO L290 TraceCheckUtils]: 4: Hoare triple {8648#true} assume !(main_~user~0#1.base == 0 && main_~user~0#1.offset == 0); {8648#true} is VALID [2022-02-20 23:27:25,308 INFO L290 TraceCheckUtils]: 5: Hoare triple {8648#true} call main_#t~mem7#1 := read~int(main_~#i~0#1.base, main_~#i~0#1.offset, 4);call write~int(main_#t~mem7#1, main_~user~0#1.base, main_~user~0#1.offset, 4);havoc main_#t~mem7#1;call main_#t~mem8#1 := read~int(main_~#i~0#1.base, main_~#i~0#1.offset, 4);call main_#t~mem9#1 := read~int(main_~#i~0#1.base, main_~#i~0#1.offset, 4);call write~int(main_#t~mem8#1 * main_#t~mem9#1, main_~user~0#1.base, 4 + main_~user~0#1.offset, 4);havoc main_#t~mem8#1;havoc main_#t~mem9#1; {8648#true} is VALID [2022-02-20 23:27:25,308 INFO L290 TraceCheckUtils]: 6: Hoare triple {8648#true} havoc main_~_ha_hashv~0#1; {8648#true} is VALID [2022-02-20 23:27:25,308 INFO L290 TraceCheckUtils]: 7: Hoare triple {8648#true} goto; {8648#true} is VALID [2022-02-20 23:27:25,308 INFO L290 TraceCheckUtils]: 8: Hoare triple {8648#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; {8648#true} is VALID [2022-02-20 23:27:25,308 INFO L290 TraceCheckUtils]: 9: Hoare triple {8648#true} assume !(main_~_hj_k~0#1 % 4294967296 >= 12); {8648#true} is VALID [2022-02-20 23:27:25,308 INFO L290 TraceCheckUtils]: 10: Hoare triple {8648#true} main_~_ha_hashv~0#1 := 4 + main_~_ha_hashv~0#1;main_#t~switch22#1 := 11 == main_~_hj_k~0#1; {8648#true} is VALID [2022-02-20 23:27:25,309 INFO L290 TraceCheckUtils]: 11: Hoare triple {8648#true} assume !main_#t~switch22#1; {8648#true} is VALID [2022-02-20 23:27:25,309 INFO L290 TraceCheckUtils]: 12: Hoare triple {8648#true} main_#t~switch22#1 := main_#t~switch22#1 || 10 == main_~_hj_k~0#1; {8648#true} is VALID [2022-02-20 23:27:25,309 INFO L290 TraceCheckUtils]: 13: Hoare triple {8648#true} assume !main_#t~switch22#1; {8648#true} is VALID [2022-02-20 23:27:25,309 INFO L290 TraceCheckUtils]: 14: Hoare triple {8648#true} main_#t~switch22#1 := main_#t~switch22#1 || 9 == main_~_hj_k~0#1; {8648#true} is VALID [2022-02-20 23:27:25,309 INFO L290 TraceCheckUtils]: 15: Hoare triple {8648#true} assume !main_#t~switch22#1; {8648#true} is VALID [2022-02-20 23:27:25,310 INFO L290 TraceCheckUtils]: 16: Hoare triple {8648#true} main_#t~switch22#1 := main_#t~switch22#1 || 8 == main_~_hj_k~0#1; {8648#true} is VALID [2022-02-20 23:27:25,310 INFO L290 TraceCheckUtils]: 17: Hoare triple {8648#true} assume !main_#t~switch22#1; {8648#true} is VALID [2022-02-20 23:27:25,310 INFO L290 TraceCheckUtils]: 18: Hoare triple {8648#true} main_#t~switch22#1 := main_#t~switch22#1 || 7 == main_~_hj_k~0#1; {8648#true} is VALID [2022-02-20 23:27:25,310 INFO L290 TraceCheckUtils]: 19: Hoare triple {8648#true} assume !main_#t~switch22#1; {8648#true} is VALID [2022-02-20 23:27:25,310 INFO L290 TraceCheckUtils]: 20: Hoare triple {8648#true} main_#t~switch22#1 := main_#t~switch22#1 || 6 == main_~_hj_k~0#1; {8648#true} is VALID [2022-02-20 23:27:25,310 INFO L290 TraceCheckUtils]: 21: Hoare triple {8648#true} assume !main_#t~switch22#1; {8648#true} is VALID [2022-02-20 23:27:25,311 INFO L290 TraceCheckUtils]: 22: Hoare triple {8648#true} main_#t~switch22#1 := main_#t~switch22#1 || 5 == main_~_hj_k~0#1; {8648#true} is VALID [2022-02-20 23:27:25,311 INFO L290 TraceCheckUtils]: 23: Hoare triple {8648#true} assume !main_#t~switch22#1; {8648#true} is VALID [2022-02-20 23:27:25,311 INFO L290 TraceCheckUtils]: 24: Hoare triple {8648#true} main_#t~switch22#1 := main_#t~switch22#1 || 4 == main_~_hj_k~0#1; {8648#true} is VALID [2022-02-20 23:27:25,311 INFO L290 TraceCheckUtils]: 25: Hoare triple {8648#true} assume main_#t~switch22#1;call main_#t~mem30#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~mem30#1 % 256);havoc main_#t~mem30#1; {8648#true} is VALID [2022-02-20 23:27:25,311 INFO L290 TraceCheckUtils]: 26: Hoare triple {8648#true} main_#t~switch22#1 := main_#t~switch22#1 || 3 == main_~_hj_k~0#1; {8648#true} is VALID [2022-02-20 23:27:25,311 INFO L290 TraceCheckUtils]: 27: Hoare triple {8648#true} assume main_#t~switch22#1;call main_#t~mem31#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~mem31#1 % 256);havoc main_#t~mem31#1; {8648#true} is VALID [2022-02-20 23:27:25,312 INFO L290 TraceCheckUtils]: 28: Hoare triple {8648#true} main_#t~switch22#1 := main_#t~switch22#1 || 2 == main_~_hj_k~0#1; {8648#true} is VALID [2022-02-20 23:27:25,312 INFO L290 TraceCheckUtils]: 29: Hoare triple {8648#true} assume main_#t~switch22#1;call main_#t~mem32#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~mem32#1 % 256);havoc main_#t~mem32#1; {8648#true} is VALID [2022-02-20 23:27:25,312 INFO L290 TraceCheckUtils]: 30: Hoare triple {8648#true} main_#t~switch22#1 := main_#t~switch22#1 || 1 == main_~_hj_k~0#1; {8648#true} is VALID [2022-02-20 23:27:25,312 INFO L290 TraceCheckUtils]: 31: Hoare triple {8648#true} assume main_#t~switch22#1;call main_#t~mem33#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~mem33#1 % 256;havoc main_#t~mem33#1; {8648#true} is VALID [2022-02-20 23:27:25,312 INFO L290 TraceCheckUtils]: 32: Hoare triple {8648#true} havoc main_#t~switch22#1; {8648#true} is VALID [2022-02-20 23:27:25,312 INFO L290 TraceCheckUtils]: 33: Hoare triple {8648#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)))); {8648#true} is VALID [2022-02-20 23:27:25,313 INFO L290 TraceCheckUtils]: 34: Hoare triple {8648#true} goto; {8648#true} is VALID [2022-02-20 23:27:25,313 INFO L290 TraceCheckUtils]: 35: Hoare triple {8648#true} goto; {8648#true} is VALID [2022-02-20 23:27:25,313 INFO L290 TraceCheckUtils]: 36: Hoare triple {8648#true} goto; {8648#true} is VALID [2022-02-20 23:27:25,313 INFO L290 TraceCheckUtils]: 37: Hoare triple {8648#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); {8648#true} is VALID [2022-02-20 23:27:25,313 INFO L290 TraceCheckUtils]: 38: Hoare triple {8648#true} assume main_~users~0#1.base == 0 && main_~users~0#1.offset == 0;call write~$Pointer$(0, 0, main_~user~0#1.base, 16 + main_~user~0#1.offset, 4);call write~$Pointer$(0, 0, main_~user~0#1.base, 12 + main_~user~0#1.offset, 4); {8648#true} is VALID [2022-02-20 23:27:25,314 INFO L290 TraceCheckUtils]: 39: Hoare triple {8648#true} call main_#t~malloc34#1.base, main_#t~malloc34#1.offset := #Ultimate.allocOnHeap(44);call write~$Pointer$(main_#t~malloc34#1.base, main_#t~malloc34#1.offset, main_~user~0#1.base, 8 + main_~user~0#1.offset, 4);havoc main_#t~malloc34#1.base, main_#t~malloc34#1.offset;call main_#t~mem35#1.base, main_#t~mem35#1.offset := read~$Pointer$(main_~user~0#1.base, 8 + main_~user~0#1.offset, 4); {8648#true} is VALID [2022-02-20 23:27:25,314 INFO L290 TraceCheckUtils]: 40: Hoare triple {8648#true} assume !(main_#t~mem35#1.base == 0 && main_#t~mem35#1.offset == 0);havoc main_#t~mem35#1.base, main_#t~mem35#1.offset;call main_#t~mem36#1.base, main_#t~mem36#1.offset := read~$Pointer$(main_~user~0#1.base, 8 + main_~user~0#1.offset, 4); {8648#true} is VALID [2022-02-20 23:27:25,314 INFO L272 TraceCheckUtils]: 41: Hoare triple {8648#true} call main_#t~memset~res37#1.base, main_#t~memset~res37#1.offset := #Ultimate.C_memset(main_#t~mem36#1.base, main_#t~mem36#1.offset, 0, 44); {8648#true} is VALID [2022-02-20 23:27:25,314 INFO L290 TraceCheckUtils]: 42: Hoare triple {8648#true} #t~loopctr276 := 0; {8648#true} is VALID [2022-02-20 23:27:25,314 INFO L290 TraceCheckUtils]: 43: Hoare triple {8648#true} assume !(#t~loopctr276 % 4294967296 < #amount % 4294967296); {8648#true} is VALID [2022-02-20 23:27:25,314 INFO L290 TraceCheckUtils]: 44: Hoare triple {8648#true} assume #res.base == #ptr.base && #res.offset == #ptr.offset; {8648#true} is VALID [2022-02-20 23:27:25,315 INFO L284 TraceCheckUtils]: 45: Hoare quadruple {8648#true} {8648#true} #903#return; {8648#true} is VALID [2022-02-20 23:27:25,315 INFO L290 TraceCheckUtils]: 46: Hoare triple {8648#true} havoc main_#t~mem36#1.base, main_#t~mem36#1.offset;havoc main_#t~memset~res37#1.base, main_#t~memset~res37#1.offset;call main_#t~mem38#1.base, main_#t~mem38#1.offset := read~$Pointer$(main_~user~0#1.base, 8 + main_~user~0#1.offset, 4);call write~$Pointer$(main_~user~0#1.base, 8 + main_~user~0#1.offset, main_#t~mem38#1.base, 16 + main_#t~mem38#1.offset, 4);havoc main_#t~mem38#1.base, main_#t~mem38#1.offset;call main_#t~mem39#1.base, main_#t~mem39#1.offset := read~$Pointer$(main_~user~0#1.base, 8 + main_~user~0#1.offset, 4);call write~int(32, main_#t~mem39#1.base, 4 + main_#t~mem39#1.offset, 4);havoc main_#t~mem39#1.base, main_#t~mem39#1.offset;call main_#t~mem40#1.base, main_#t~mem40#1.offset := read~$Pointer$(main_~user~0#1.base, 8 + main_~user~0#1.offset, 4);call write~int(5, main_#t~mem40#1.base, 8 + main_#t~mem40#1.offset, 4);havoc main_#t~mem40#1.base, main_#t~mem40#1.offset;call main_#t~mem41#1.base, main_#t~mem41#1.offset := read~$Pointer$(main_~user~0#1.base, 8 + main_~user~0#1.offset, 4);call write~int((if 8 + main_~user~0#1.offset - main_~user~0#1.offset < 0 && 0 != (8 + main_~user~0#1.offset - main_~user~0#1.offset) % 1 then 1 + (8 + main_~user~0#1.offset - main_~user~0#1.offset) / 1 else (8 + main_~user~0#1.offset - main_~user~0#1.offset) / 1), main_#t~mem41#1.base, 20 + main_#t~mem41#1.offset, 4);havoc main_#t~mem41#1.base, main_#t~mem41#1.offset;call main_#t~mem42#1.base, main_#t~mem42#1.offset := read~$Pointer$(main_~user~0#1.base, 8 + main_~user~0#1.offset, 4);call main_#t~malloc43#1.base, main_#t~malloc43#1.offset := #Ultimate.allocOnHeap(384);call write~$Pointer$(main_#t~malloc43#1.base, main_#t~malloc43#1.offset, main_#t~mem42#1.base, main_#t~mem42#1.offset, 4);havoc main_#t~mem42#1.base, main_#t~mem42#1.offset;havoc main_#t~malloc43#1.base, main_#t~malloc43#1.offset;call main_#t~mem44#1.base, main_#t~mem44#1.offset := read~$Pointer$(main_~user~0#1.base, 8 + main_~user~0#1.offset, 4);call write~int(2685476833, main_#t~mem44#1.base, 40 + main_#t~mem44#1.offset, 4);havoc main_#t~mem44#1.base, main_#t~mem44#1.offset;call main_#t~mem45#1.base, main_#t~mem45#1.offset := read~$Pointer$(main_~user~0#1.base, 8 + main_~user~0#1.offset, 4);call main_#t~mem46#1.base, main_#t~mem46#1.offset := read~$Pointer$(main_#t~mem45#1.base, main_#t~mem45#1.offset, 4); {8648#true} is VALID [2022-02-20 23:27:25,315 INFO L290 TraceCheckUtils]: 47: Hoare triple {8648#true} assume !(main_#t~mem46#1.base == 0 && main_#t~mem46#1.offset == 0);havoc main_#t~mem45#1.base, main_#t~mem45#1.offset;havoc main_#t~mem46#1.base, main_#t~mem46#1.offset;call main_#t~mem48#1.base, main_#t~mem48#1.offset := read~$Pointer$(main_~user~0#1.base, 8 + main_~user~0#1.offset, 4);call main_#t~mem49#1.base, main_#t~mem49#1.offset := read~$Pointer$(main_#t~mem48#1.base, main_#t~mem48#1.offset, 4); {8648#true} is VALID [2022-02-20 23:27:25,315 INFO L272 TraceCheckUtils]: 48: Hoare triple {8648#true} call main_#t~memset~res50#1.base, main_#t~memset~res50#1.offset := #Ultimate.C_memset(main_#t~mem49#1.base, main_#t~mem49#1.offset, 0, 384); {8648#true} is VALID [2022-02-20 23:27:25,315 INFO L290 TraceCheckUtils]: 49: Hoare triple {8648#true} #t~loopctr276 := 0; {8648#true} is VALID [2022-02-20 23:27:25,316 INFO L290 TraceCheckUtils]: 50: Hoare triple {8648#true} assume !(#t~loopctr276 % 4294967296 < #amount % 4294967296); {8648#true} is VALID [2022-02-20 23:27:25,316 INFO L290 TraceCheckUtils]: 51: Hoare triple {8648#true} assume #res.base == #ptr.base && #res.offset == #ptr.offset; {8648#true} is VALID [2022-02-20 23:27:25,316 INFO L284 TraceCheckUtils]: 52: Hoare quadruple {8648#true} {8648#true} #905#return; {8648#true} is VALID [2022-02-20 23:27:25,316 INFO L290 TraceCheckUtils]: 53: Hoare triple {8648#true} havoc main_#t~mem48#1.base, main_#t~mem48#1.offset;havoc main_#t~mem49#1.base, main_#t~mem49#1.offset;havoc main_#t~memset~res50#1.base, main_#t~memset~res50#1.offset; {8648#true} is VALID [2022-02-20 23:27:25,316 INFO L290 TraceCheckUtils]: 54: Hoare triple {8648#true} goto; {8648#true} is VALID [2022-02-20 23:27:25,316 INFO L290 TraceCheckUtils]: 55: Hoare triple {8648#true} main_~users~0#1.base, main_~users~0#1.offset := main_~user~0#1.base, main_~user~0#1.offset; {8648#true} is VALID [2022-02-20 23:27:25,317 INFO L290 TraceCheckUtils]: 56: Hoare triple {8648#true} havoc main_~_ha_bkt~0#1;call main_#t~mem59#1.base, main_#t~mem59#1.offset := read~$Pointer$(main_~users~0#1.base, 8 + main_~users~0#1.offset, 4);call main_#t~mem60#1 := read~int(main_#t~mem59#1.base, 12 + main_#t~mem59#1.offset, 4);main_#t~post61#1 := main_#t~mem60#1;call write~int(1 + main_#t~post61#1, main_#t~mem59#1.base, 12 + main_#t~mem59#1.offset, 4);havoc main_#t~mem59#1.base, main_#t~mem59#1.offset;havoc main_#t~mem60#1;havoc main_#t~post61#1; {8648#true} is VALID [2022-02-20 23:27:25,317 INFO L290 TraceCheckUtils]: 57: Hoare triple {8648#true} call main_#t~mem62#1.base, main_#t~mem62#1.offset := read~$Pointer$(main_~users~0#1.base, 8 + main_~users~0#1.offset, 4);call main_#t~mem63#1 := read~int(main_#t~mem62#1.base, 4 + main_#t~mem62#1.offset, 4);main_~_ha_bkt~0#1 := (if 0 == main_~_ha_hashv~0#1 || 0 == main_#t~mem63#1 - 1 then 0 else (if 1 == main_#t~mem63#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~mem63#1 - 1))) else (if 1 == main_~_ha_hashv~0#1 then (if 1 == main_#t~mem63#1 - 1 || 0 == main_#t~mem63#1 - 1 then main_#t~mem63#1 - 1 else (if main_#t~mem63#1 - 1 >= 0 then (main_#t~mem63#1 - 1) % 2 else ~bitwiseAnd(main_~_ha_hashv~0#1, main_#t~mem63#1 - 1))) else ~bitwiseAnd(main_~_ha_hashv~0#1, main_#t~mem63#1 - 1))));havoc main_#t~mem62#1.base, main_#t~mem62#1.offset;havoc main_#t~mem63#1; {8648#true} is VALID [2022-02-20 23:27:25,317 INFO L290 TraceCheckUtils]: 58: Hoare triple {8648#true} goto; {8648#true} is VALID [2022-02-20 23:27:25,317 INFO L290 TraceCheckUtils]: 59: Hoare triple {8648#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.base, main_#t~mem65#1.offset := read~$Pointer$(main_#t~mem64#1.base, main_#t~mem64#1.offset, 4);main_~_ha_head~0#1.base, main_~_ha_head~0#1.offset := main_#t~mem65#1.base, main_#t~mem65#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~mem64#1.base, main_#t~mem64#1.offset;havoc main_#t~mem65#1.base, main_#t~mem65#1.offset;call main_#t~mem66#1 := read~int(main_~_ha_head~0#1.base, 4 + main_~_ha_head~0#1.offset, 4);main_#t~post67#1 := main_#t~mem66#1;call write~int(1 + main_#t~post67#1, main_~_ha_head~0#1.base, 4 + main_~_ha_head~0#1.offset, 4);havoc main_#t~mem66#1;havoc main_#t~post67#1;call main_#t~mem68#1.base, main_#t~mem68#1.offset := read~$Pointer$(main_~_ha_head~0#1.base, main_~_ha_head~0#1.offset, 4);call write~$Pointer$(main_#t~mem68#1.base, main_#t~mem68#1.offset, main_~user~0#1.base, 24 + main_~user~0#1.offset, 4);havoc main_#t~mem68#1.base, main_#t~mem68#1.offset;call write~$Pointer$(0, 0, main_~user~0#1.base, 20 + main_~user~0#1.offset, 4);call main_#t~mem69#1.base, main_#t~mem69#1.offset := read~$Pointer$(main_~_ha_head~0#1.base, main_~_ha_head~0#1.offset, 4); {8648#true} is VALID [2022-02-20 23:27:25,317 INFO L290 TraceCheckUtils]: 60: Hoare triple {8648#true} assume main_#t~mem69#1.base != 0 || main_#t~mem69#1.offset != 0;havoc main_#t~mem69#1.base, main_#t~mem69#1.offset;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_~user~0#1.base, 8 + main_~user~0#1.offset, main_#t~mem70#1.base, 12 + main_#t~mem70#1.offset, 4);havoc main_#t~mem70#1.base, main_#t~mem70#1.offset; {8648#true} is VALID [2022-02-20 23:27:25,318 INFO L290 TraceCheckUtils]: 61: Hoare triple {8648#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~mem72#1 := read~int(main_~_ha_head~0#1.base, 4 + main_~_ha_head~0#1.offset, 4);call main_#t~mem71#1 := read~int(main_~_ha_head~0#1.base, 8 + main_~_ha_head~0#1.offset, 4);main_#t~short75#1 := main_#t~mem72#1 % 4294967296 >= 10 * (1 + main_#t~mem71#1) % 4294967296; {8648#true} is VALID [2022-02-20 23:27:25,318 INFO L290 TraceCheckUtils]: 62: Hoare triple {8648#true} assume main_#t~short75#1;call main_#t~mem73#1.base, main_#t~mem73#1.offset := read~$Pointer$(main_~user~0#1.base, 8 + main_~user~0#1.offset, 4);call main_#t~mem74#1 := read~int(main_#t~mem73#1.base, 36 + main_#t~mem73#1.offset, 4);main_#t~short75#1 := 0 == main_#t~mem74#1 % 4294967296; {8648#true} is VALID [2022-02-20 23:27:25,318 INFO L290 TraceCheckUtils]: 63: Hoare triple {8648#true} assume !main_#t~short75#1;havoc main_#t~mem72#1;havoc main_#t~mem71#1;havoc main_#t~mem73#1.base, main_#t~mem73#1.offset;havoc main_#t~mem74#1;havoc main_#t~short75#1; {8648#true} is VALID [2022-02-20 23:27:25,318 INFO L290 TraceCheckUtils]: 64: Hoare triple {8648#true} goto; {8648#true} is VALID [2022-02-20 23:27:25,318 INFO L290 TraceCheckUtils]: 65: Hoare triple {8648#true} goto; {8648#true} is VALID [2022-02-20 23:27:25,318 INFO L290 TraceCheckUtils]: 66: Hoare triple {8648#true} goto; {8648#true} is VALID [2022-02-20 23:27:25,319 INFO L290 TraceCheckUtils]: 67: Hoare triple {8648#true} goto; {8648#true} is VALID [2022-02-20 23:27:25,319 INFO L290 TraceCheckUtils]: 68: Hoare triple {8648#true} call main_#t~mem3#1 := read~int(main_~#i~0#1.base, main_~#i~0#1.offset, 4);main_#t~post4#1 := main_#t~mem3#1;call write~int(1 + main_#t~post4#1, main_~#i~0#1.base, main_~#i~0#1.offset, 4);havoc main_#t~mem3#1;havoc main_#t~post4#1; {8648#true} is VALID [2022-02-20 23:27:25,319 INFO L290 TraceCheckUtils]: 69: Hoare triple {8648#true} call main_#t~mem5#1 := read~int(main_~#i~0#1.base, main_~#i~0#1.offset, 4); {8648#true} is VALID [2022-02-20 23:27:25,319 INFO L290 TraceCheckUtils]: 70: Hoare triple {8648#true} assume !(main_#t~mem5#1 < 1000);havoc main_#t~mem5#1; {8648#true} is VALID [2022-02-20 23:27:25,319 INFO L290 TraceCheckUtils]: 71: Hoare triple {8648#true} call write~int(0, main_~#i~0#1.base, main_~#i~0#1.offset, 4); {8648#true} is VALID [2022-02-20 23:27:25,319 INFO L290 TraceCheckUtils]: 72: Hoare triple {8648#true} call main_#t~mem144#1 := read~int(main_~#i~0#1.base, main_~#i~0#1.offset, 4); {8648#true} is VALID [2022-02-20 23:27:25,320 INFO L290 TraceCheckUtils]: 73: Hoare triple {8648#true} assume !!(main_#t~mem144#1 < 1000);havoc main_#t~mem144#1; {8648#true} is VALID [2022-02-20 23:27:25,320 INFO L290 TraceCheckUtils]: 74: Hoare triple {8648#true} havoc main_~_hf_hashv~0#1; {8648#true} is VALID [2022-02-20 23:27:25,320 INFO L290 TraceCheckUtils]: 75: Hoare triple {8648#true} goto; {8648#true} is VALID [2022-02-20 23:27:25,320 INFO L290 TraceCheckUtils]: 76: Hoare triple {8648#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; {8648#true} is VALID [2022-02-20 23:27:25,320 INFO L290 TraceCheckUtils]: 77: Hoare triple {8648#true} assume !(main_~_hj_k~1#1 % 4294967296 >= 12); {8648#true} is VALID [2022-02-20 23:27:25,321 INFO L290 TraceCheckUtils]: 78: Hoare triple {8648#true} main_~_hf_hashv~0#1 := 4 + main_~_hf_hashv~0#1;main_#t~switch157#1 := 11 == main_~_hj_k~1#1; {8648#true} is VALID [2022-02-20 23:27:25,321 INFO L290 TraceCheckUtils]: 79: Hoare triple {8648#true} assume !main_#t~switch157#1; {8648#true} is VALID [2022-02-20 23:27:25,321 INFO L290 TraceCheckUtils]: 80: Hoare triple {8648#true} main_#t~switch157#1 := main_#t~switch157#1 || 10 == main_~_hj_k~1#1; {8648#true} is VALID [2022-02-20 23:27:25,321 INFO L290 TraceCheckUtils]: 81: Hoare triple {8648#true} assume main_#t~switch157#1;call main_#t~mem159#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~mem159#1 % 256);havoc main_#t~mem159#1; {8648#true} is VALID [2022-02-20 23:27:25,321 INFO L290 TraceCheckUtils]: 82: Hoare triple {8648#true} main_#t~switch157#1 := main_#t~switch157#1 || 9 == main_~_hj_k~1#1; {8648#true} is VALID [2022-02-20 23:27:25,322 INFO L290 TraceCheckUtils]: 83: Hoare triple {8648#true} assume main_#t~switch157#1;call main_#t~mem160#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~mem160#1 % 256);havoc main_#t~mem160#1; {8648#true} is VALID [2022-02-20 23:27:25,322 INFO L290 TraceCheckUtils]: 84: Hoare triple {8648#true} main_#t~switch157#1 := main_#t~switch157#1 || 8 == main_~_hj_k~1#1; {8648#true} is VALID [2022-02-20 23:27:25,322 INFO L290 TraceCheckUtils]: 85: Hoare triple {8648#true} assume main_#t~switch157#1;call main_#t~mem161#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~mem161#1 % 256);havoc main_#t~mem161#1; {8648#true} is VALID [2022-02-20 23:27:25,322 INFO L290 TraceCheckUtils]: 86: Hoare triple {8648#true} main_#t~switch157#1 := main_#t~switch157#1 || 7 == main_~_hj_k~1#1; {8648#true} is VALID [2022-02-20 23:27:25,322 INFO L290 TraceCheckUtils]: 87: Hoare triple {8648#true} assume main_#t~switch157#1;call main_#t~mem162#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~mem162#1 % 256);havoc main_#t~mem162#1; {8648#true} is VALID [2022-02-20 23:27:25,322 INFO L290 TraceCheckUtils]: 88: Hoare triple {8648#true} main_#t~switch157#1 := main_#t~switch157#1 || 6 == main_~_hj_k~1#1; {8648#true} is VALID [2022-02-20 23:27:25,323 INFO L290 TraceCheckUtils]: 89: Hoare triple {8648#true} assume main_#t~switch157#1;call main_#t~mem163#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~mem163#1 % 256);havoc main_#t~mem163#1; {8648#true} is VALID [2022-02-20 23:27:25,323 INFO L290 TraceCheckUtils]: 90: Hoare triple {8648#true} main_#t~switch157#1 := main_#t~switch157#1 || 5 == main_~_hj_k~1#1; {8648#true} is VALID [2022-02-20 23:27:25,323 INFO L290 TraceCheckUtils]: 91: Hoare triple {8648#true} assume main_#t~switch157#1;call main_#t~mem164#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~mem164#1 % 256;havoc main_#t~mem164#1; {8648#true} is VALID [2022-02-20 23:27:25,323 INFO L290 TraceCheckUtils]: 92: Hoare triple {8648#true} main_#t~switch157#1 := main_#t~switch157#1 || 4 == main_~_hj_k~1#1; {8648#true} is VALID [2022-02-20 23:27:25,323 INFO L290 TraceCheckUtils]: 93: Hoare triple {8648#true} assume main_#t~switch157#1;call main_#t~mem165#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~mem165#1 % 256);havoc main_#t~mem165#1; {8648#true} is VALID [2022-02-20 23:27:25,324 INFO L290 TraceCheckUtils]: 94: Hoare triple {8648#true} main_#t~switch157#1 := main_#t~switch157#1 || 3 == main_~_hj_k~1#1; {8648#true} is VALID [2022-02-20 23:27:25,324 INFO L290 TraceCheckUtils]: 95: Hoare triple {8648#true} assume main_#t~switch157#1;call main_#t~mem166#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~mem166#1 % 256);havoc main_#t~mem166#1; {8938#|ULTIMATE.start_main_#t~switch157#1|} is VALID [2022-02-20 23:27:25,325 INFO L290 TraceCheckUtils]: 96: Hoare triple {8938#|ULTIMATE.start_main_#t~switch157#1|} main_#t~switch157#1 := main_#t~switch157#1 || 2 == main_~_hj_k~1#1; {8938#|ULTIMATE.start_main_#t~switch157#1|} is VALID [2022-02-20 23:27:25,325 INFO L290 TraceCheckUtils]: 97: Hoare triple {8938#|ULTIMATE.start_main_#t~switch157#1|} assume !main_#t~switch157#1; {8649#false} is VALID [2022-02-20 23:27:25,325 INFO L290 TraceCheckUtils]: 98: Hoare triple {8649#false} main_#t~switch157#1 := main_#t~switch157#1 || 1 == main_~_hj_k~1#1; {8649#false} is VALID [2022-02-20 23:27:25,325 INFO L290 TraceCheckUtils]: 99: Hoare triple {8649#false} assume main_#t~switch157#1;call main_#t~mem168#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~mem168#1 % 256;havoc main_#t~mem168#1; {8649#false} is VALID [2022-02-20 23:27:25,326 INFO L290 TraceCheckUtils]: 100: Hoare triple {8649#false} havoc main_#t~switch157#1; {8649#false} is VALID [2022-02-20 23:27:25,326 INFO L290 TraceCheckUtils]: 101: Hoare triple {8649#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)))); {8649#false} is VALID [2022-02-20 23:27:25,326 INFO L290 TraceCheckUtils]: 102: Hoare triple {8649#false} goto; {8649#false} is VALID [2022-02-20 23:27:25,326 INFO L290 TraceCheckUtils]: 103: Hoare triple {8649#false} goto; {8649#false} is VALID [2022-02-20 23:27:25,327 INFO L290 TraceCheckUtils]: 104: Hoare triple {8649#false} goto; {8649#false} is VALID [2022-02-20 23:27:25,327 INFO L290 TraceCheckUtils]: 105: Hoare triple {8649#false} main_~tmp~0#1.base, main_~tmp~0#1.offset := 0, 0; {8649#false} is VALID [2022-02-20 23:27:25,327 INFO L290 TraceCheckUtils]: 106: Hoare triple {8649#false} assume !(main_~users~0#1.base != 0 || main_~users~0#1.offset != 0); {8649#false} is VALID [2022-02-20 23:27:25,327 INFO L290 TraceCheckUtils]: 107: Hoare triple {8649#false} goto; {8649#false} is VALID [2022-02-20 23:27:25,327 INFO L290 TraceCheckUtils]: 108: Hoare triple {8649#false} goto; {8649#false} is VALID [2022-02-20 23:27:25,328 INFO L290 TraceCheckUtils]: 109: Hoare triple {8649#false} assume !(main_~tmp~0#1.base != 0 || main_~tmp~0#1.offset != 0); {8649#false} is VALID [2022-02-20 23:27:25,328 INFO L290 TraceCheckUtils]: 110: Hoare triple {8649#false} assume !false; {8649#false} is VALID [2022-02-20 23:27:25,328 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-02-20 23:27:25,328 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 23:27:25,328 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 23:27:25,329 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [89644724] [2022-02-20 23:27:25,329 WARN L317 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-02-20 23:27:25,329 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1295989004] [2022-02-20 23:27:25,329 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1295989004] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:27:25,329 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:27:25,329 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 23:27:25,330 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [138052730] [2022-02-20 23:27:25,330 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:27:25,330 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 34.333333333333336) internal successors, (103), 3 states have internal predecessors, (103), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 111 [2022-02-20 23:27:25,331 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:27:25,331 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 34.333333333333336) internal successors, (103), 3 states have internal predecessors, (103), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-02-20 23:27:25,410 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 107 edges. 107 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:27:25,411 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 23:27:25,411 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 23:27:25,411 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 23:27:25,411 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 23:27:25,412 INFO L87 Difference]: Start difference. First operand 297 states and 372 transitions. Second operand has 3 states, 3 states have (on average 34.333333333333336) internal successors, (103), 3 states have internal predecessors, (103), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-02-20 23:27:25,932 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:27:25,933 INFO L93 Difference]: Finished difference Result 487 states and 631 transitions. [2022-02-20 23:27:25,933 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 23:27:25,933 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 34.333333333333336) internal successors, (103), 3 states have internal predecessors, (103), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 111 [2022-02-20 23:27:25,934 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:27:25,934 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 34.333333333333336) internal successors, (103), 3 states have internal predecessors, (103), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-02-20 23:27:25,937 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 373 transitions. [2022-02-20 23:27:25,937 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 34.333333333333336) internal successors, (103), 3 states have internal predecessors, (103), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-02-20 23:27:25,940 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 373 transitions. [2022-02-20 23:27:25,940 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 373 transitions. [2022-02-20 23:27:26,296 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 373 edges. 373 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:27:26,303 INFO L225 Difference]: With dead ends: 487 [2022-02-20 23:27:26,303 INFO L226 Difference]: Without dead ends: 339 [2022-02-20 23:27:26,304 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 110 GetRequests, 109 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:27:26,305 INFO L933 BasicCegarLoop]: 211 mSDtfsCounter, 8 mSDsluCounter, 194 mSDsCounter, 0 mSdLazyCounter, 44 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 405 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:27:26,307 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [8 Valid, 405 Invalid, 72 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 44 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 23:27:26,308 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 339 states. [2022-02-20 23:27:26,342 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 339 to 337. [2022-02-20 23:27:26,342 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:27:26,343 INFO L82 GeneralOperation]: Start isEquivalent. First operand 339 states. Second operand has 337 states, 331 states have (on average 1.2265861027190332) internal successors, (406), 332 states have internal predecessors, (406), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-02-20 23:27:26,344 INFO L74 IsIncluded]: Start isIncluded. First operand 339 states. Second operand has 337 states, 331 states have (on average 1.2265861027190332) internal successors, (406), 332 states have internal predecessors, (406), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-02-20 23:27:26,345 INFO L87 Difference]: Start difference. First operand 339 states. Second operand has 337 states, 331 states have (on average 1.2265861027190332) internal successors, (406), 332 states have internal predecessors, (406), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-02-20 23:27:26,352 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:27:26,352 INFO L93 Difference]: Finished difference Result 339 states and 414 transitions. [2022-02-20 23:27:26,352 INFO L276 IsEmpty]: Start isEmpty. Operand 339 states and 414 transitions. [2022-02-20 23:27:26,353 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:27:26,354 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:27:26,355 INFO L74 IsIncluded]: Start isIncluded. First operand has 337 states, 331 states have (on average 1.2265861027190332) internal successors, (406), 332 states have internal predecessors, (406), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand 339 states. [2022-02-20 23:27:26,355 INFO L87 Difference]: Start difference. First operand has 337 states, 331 states have (on average 1.2265861027190332) internal successors, (406), 332 states have internal predecessors, (406), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand 339 states. [2022-02-20 23:27:26,363 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:27:26,363 INFO L93 Difference]: Finished difference Result 339 states and 414 transitions. [2022-02-20 23:27:26,363 INFO L276 IsEmpty]: Start isEmpty. Operand 339 states and 414 transitions. [2022-02-20 23:27:26,364 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:27:26,364 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:27:26,364 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:27:26,364 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:27:26,365 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 337 states, 331 states have (on average 1.2265861027190332) internal successors, (406), 332 states have internal predecessors, (406), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-02-20 23:27:26,373 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 337 states to 337 states and 412 transitions. [2022-02-20 23:27:26,374 INFO L78 Accepts]: Start accepts. Automaton has 337 states and 412 transitions. Word has length 111 [2022-02-20 23:27:26,374 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:27:26,374 INFO L470 AbstractCegarLoop]: Abstraction has 337 states and 412 transitions. [2022-02-20 23:27:26,374 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 34.333333333333336) internal successors, (103), 3 states have internal predecessors, (103), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-02-20 23:27:26,374 INFO L276 IsEmpty]: Start isEmpty. Operand 337 states and 412 transitions. [2022-02-20 23:27:26,375 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2022-02-20 23:27:26,376 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:27:26,376 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:27:26,396 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-02-20 23:27:26,583 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 23:27:26,583 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 23:27:26,584 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:27:26,584 INFO L85 PathProgramCache]: Analyzing trace with hash -687272567, now seen corresponding path program 1 times [2022-02-20 23:27:26,584 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 23:27:26,584 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [222915931] [2022-02-20 23:27:26,584 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:27:26,585 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 23:27:26,630 ERROR L252 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-02-20 23:27:26,630 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [879521630] [2022-02-20 23:27:26,630 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:27:26,631 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 23:27:26,631 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 23:27:26,632 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-02-20 23:27:26,635 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-02-20 23:27:27,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:27:27,209 INFO L263 TraceCheckSpWp]: Trace formula consists of 774 conjuncts, 4 conjunts are in the unsatisfiable core [2022-02-20 23:27:27,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:27:27,264 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 23:27:27,491 INFO L290 TraceCheckUtils]: 0: Hoare triple {10605#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); {10605#true} is VALID [2022-02-20 23:27:27,491 INFO L290 TraceCheckUtils]: 1: Hoare triple {10605#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc6#1.base, main_#t~malloc6#1.offset, main_#t~mem7#1, main_#t~mem8#1, main_#t~mem9#1, main_#t~mem11#1, main_#t~mem10#1, main_#t~mem12#1, main_#t~mem13#1, main_#t~mem15#1, main_#t~mem14#1, main_#t~mem16#1, main_#t~mem17#1, main_#t~mem19#1, main_#t~mem18#1, main_#t~mem20#1, main_#t~mem21#1, main_#t~switch22#1, main_#t~mem23#1, main_#t~mem24#1, main_#t~mem25#1, main_#t~mem26#1, main_#t~mem27#1, main_#t~mem28#1, main_#t~mem29#1, main_#t~mem30#1, main_#t~mem31#1, main_#t~mem32#1, main_#t~mem33#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~malloc34#1.base, main_#t~malloc34#1.offset, main_#t~mem35#1.base, main_#t~mem35#1.offset, main_#t~mem36#1.base, main_#t~mem36#1.offset, main_#t~memset~res37#1.base, main_#t~memset~res37#1.offset, main_#t~mem38#1.base, main_#t~mem38#1.offset, main_#t~mem39#1.base, main_#t~mem39#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~malloc43#1.base, main_#t~malloc43#1.offset, main_#t~mem44#1.base, main_#t~mem44#1.offset, main_#t~mem45#1.base, main_#t~mem45#1.offset, main_#t~mem46#1.base, main_#t~mem46#1.offset, main_#t~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~memset~res50#1.base, main_#t~memset~res50#1.offset, main_#t~mem51#1.base, main_#t~mem51#1.offset, main_#t~mem52#1.base, main_#t~mem52#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, main_#t~mem56#1.base, main_#t~mem56#1.offset, main_#t~mem57#1.base, main_#t~mem57#1.offset, main_#t~mem58#1.base, main_#t~mem58#1.offset, main_#t~mem59#1.base, main_#t~mem59#1.offset, main_#t~mem60#1, main_#t~post61#1, main_#t~mem62#1.base, main_#t~mem62#1.offset, main_#t~mem63#1, main_#t~mem64#1.base, main_#t~mem64#1.offset, main_#t~mem65#1.base, main_#t~mem65#1.offset, main_#t~mem66#1, main_#t~post67#1, main_#t~mem68#1.base, main_#t~mem68#1.offset, main_#t~mem69#1.base, main_#t~mem69#1.offset, main_#t~mem70#1.base, main_#t~mem70#1.offset, main_#t~mem72#1, main_#t~mem71#1, main_#t~mem73#1.base, main_#t~mem73#1.offset, main_#t~mem74#1, main_#t~short75#1, main_#t~mem76#1.base, main_#t~mem76#1.offset, main_#t~mem77#1, main_#t~malloc78#1.base, main_#t~malloc78#1.offset, main_#t~mem79#1.base, main_#t~mem79#1.offset, main_#t~mem80#1.base, main_#t~mem80#1.offset, main_#t~mem81#1.base, main_#t~mem81#1.offset, main_#t~mem82#1, main_#t~memset~res83#1.base, main_#t~memset~res83#1.offset, main_#t~mem84#1.base, main_#t~mem84#1.offset, main_#t~mem85#1.base, main_#t~mem85#1.offset, main_#t~mem88#1, main_#t~mem86#1.base, main_#t~mem86#1.offset, main_#t~mem87#1, main_#t~mem89#1.base, main_#t~mem89#1.offset, main_#t~mem92#1, main_#t~mem90#1.base, main_#t~mem90#1.offset, main_#t~mem91#1, main_#t~ite93#1, main_#t~mem94#1.base, main_#t~mem94#1.offset, main_#t~mem98#1.base, main_#t~mem98#1.offset, main_#t~mem99#1.base, main_#t~mem99#1.offset, main_#t~mem100#1.base, main_#t~mem100#1.offset, main_#t~mem101#1.base, main_#t~mem101#1.offset, main_#t~mem104#1, main_#t~mem102#1.base, main_#t~mem102#1.offset, main_#t~mem103#1, main_#t~mem105#1.base, main_#t~mem105#1.offset, main_#t~mem106#1, main_#t~pre107#1, main_#t~mem108#1.base, main_#t~mem108#1.offset, main_#t~mem109#1, main_#t~mem110#1.base, main_#t~mem110#1.offset, main_#t~mem111#1, main_#t~post112#1, main_#t~mem116#1, main_#t~mem114#1, main_#t~mem113#1.base, main_#t~mem113#1.offset, main_#t~mem115#1, main_#t~mem117#1, main_#t~post118#1, main_#t~mem119#1.base, main_#t~mem119#1.offset, main_#t~mem120#1.base, main_#t~mem120#1.offset, main_#t~mem121#1.base, main_#t~mem121#1.offset, main_#t~post95#1, main_#t~mem96#1.base, main_#t~mem96#1.offset, main_#t~mem97#1, main_#t~mem122#1.base, main_#t~mem122#1.offset, main_#t~mem123#1.base, main_#t~mem123#1.offset, main_#t~mem124#1.base, main_#t~mem124#1.offset, main_#t~mem125#1, main_#t~mem126#1.base, main_#t~mem126#1.offset, main_#t~mem127#1, main_#t~post128#1, main_#t~mem129#1.base, main_#t~mem129#1.offset, main_#t~mem130#1.base, main_#t~mem130#1.offset, main_#t~mem131#1.base, main_#t~mem131#1.offset, main_#t~mem132#1.base, main_#t~mem132#1.offset, main_#t~mem135#1, main_#t~mem133#1.base, main_#t~mem133#1.offset, main_#t~mem134#1, main_#t~ite138#1, main_#t~mem136#1.base, main_#t~mem136#1.offset, main_#t~mem137#1, main_#t~mem139#1.base, main_#t~mem139#1.offset, main_#t~mem140#1, main_#t~mem141#1.base, main_#t~mem141#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~mem3#1, main_#t~post4#1, main_#t~mem5#1, main_#t~mem146#1, main_#t~mem145#1, main_#t~mem147#1, main_#t~mem148#1, main_#t~mem150#1, main_#t~mem149#1, main_#t~mem151#1, main_#t~mem152#1, main_#t~mem154#1, main_#t~mem153#1, main_#t~mem155#1, main_#t~mem156#1, main_#t~switch157#1, main_#t~mem158#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_~_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~mem169#1.base, main_#t~mem169#1.offset, main_#t~mem170#1, main_#t~mem171#1.base, main_#t~mem171#1.offset, 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, main_#t~mem179#1, main_#t~mem180#1, main_#t~short181#1, main_#t~mem182#1.base, main_#t~mem182#1.offset, main_#t~ret183#1, main_#t~mem184#1.base, main_#t~mem184#1.offset, main_#t~mem185#1.base, main_#t~mem185#1.offset, main_#t~mem186#1.base, main_#t~mem186#1.offset, main_#t~mem187#1, main_~_hf_bkt~0#1, main_~_hf_hashv~0#1, main_#t~mem188#1.base, main_#t~mem188#1.offset, main_#t~mem189#1.base, main_#t~mem189#1.offset, main_#t~short190#1, main_#t~mem191#1.base, main_#t~mem191#1.offset, main_#t~mem192#1.base, main_#t~mem192#1.offset, main_#t~mem193#1.base, main_#t~mem193#1.offset, main_#t~mem194#1.base, main_#t~mem194#1.offset, main_#t~mem195#1.base, main_#t~mem195#1.offset, main_#t~mem196#1.base, main_#t~mem196#1.offset, main_#t~mem197#1.base, main_#t~mem197#1.offset, main_#t~mem198#1.base, main_#t~mem198#1.offset, main_#t~mem199#1, main_#t~mem200#1.base, main_#t~mem200#1.offset, main_#t~mem201#1.base, main_#t~mem201#1.offset, main_#t~mem202#1.base, main_#t~mem202#1.offset, main_#t~mem203#1, main_#t~mem204#1.base, main_#t~mem204#1.offset, main_#t~mem205#1.base, main_#t~mem205#1.offset, main_#t~mem206#1.base, main_#t~mem206#1.offset, main_#t~mem207#1.base, main_#t~mem207#1.offset, main_#t~mem208#1.base, main_#t~mem208#1.offset, main_#t~mem209#1, main_#t~mem210#1.base, main_#t~mem210#1.offset, main_#t~mem213#1, main_#t~mem211#1.base, main_#t~mem211#1.offset, main_#t~mem212#1, main_#t~mem214#1.base, main_#t~mem214#1.offset, main_#t~mem215#1.base, main_#t~mem215#1.offset, main_#t~mem216#1, main_#t~post217#1, main_#t~mem218#1.base, main_#t~mem218#1.offset, main_#t~mem219#1.base, main_#t~mem219#1.offset, main_#t~mem220#1.base, main_#t~mem220#1.offset, main_#t~mem221#1.base, main_#t~mem221#1.offset, main_#t~mem222#1.base, main_#t~mem222#1.offset, main_#t~mem223#1.base, main_#t~mem223#1.offset, main_#t~mem224#1.base, main_#t~mem224#1.offset, main_#t~mem225#1.base, main_#t~mem225#1.offset, main_~_hd_head~0#1.base, main_~_hd_head~0#1.offset, main_#t~mem226#1.base, main_#t~mem226#1.offset, main_#t~mem227#1, main_#t~post228#1, main_~_hd_bkt~0#1, main_~_hd_hh_del~0#1.base, main_~_hd_hh_del~0#1.offset, main_#t~mem142#1, main_#t~post143#1, main_#t~mem144#1, main_#t~mem229#1.base, main_#t~mem229#1.offset, main_#t~ite231#1.base, main_#t~ite231#1.offset, main_#t~mem230#1.base, main_#t~mem230#1.offset, main_#t~mem234#1.base, main_#t~mem234#1.offset, main_#t~mem235#1.base, main_#t~mem235#1.offset, main_#t~short236#1, main_#t~mem237#1.base, main_#t~mem237#1.offset, main_#t~mem238#1.base, main_#t~mem238#1.offset, main_#t~mem239#1.base, main_#t~mem239#1.offset, main_#t~mem240#1.base, main_#t~mem240#1.offset, main_#t~mem241#1.base, main_#t~mem241#1.offset, main_#t~mem242#1.base, main_#t~mem242#1.offset, main_#t~mem243#1.base, main_#t~mem243#1.offset, main_#t~mem244#1.base, main_#t~mem244#1.offset, main_#t~mem245#1, main_#t~mem246#1.base, main_#t~mem246#1.offset, main_#t~mem247#1.base, main_#t~mem247#1.offset, main_#t~mem248#1.base, main_#t~mem248#1.offset, main_#t~mem249#1, main_#t~mem250#1.base, main_#t~mem250#1.offset, main_#t~mem251#1.base, main_#t~mem251#1.offset, main_#t~mem252#1.base, main_#t~mem252#1.offset, main_#t~mem253#1.base, main_#t~mem253#1.offset, main_#t~mem254#1.base, main_#t~mem254#1.offset, main_#t~mem255#1, main_#t~mem256#1.base, main_#t~mem256#1.offset, main_#t~mem259#1, main_#t~mem257#1.base, main_#t~mem257#1.offset, main_#t~mem258#1, main_#t~mem260#1.base, main_#t~mem260#1.offset, main_#t~mem261#1.base, main_#t~mem261#1.offset, main_#t~mem262#1, main_#t~post263#1, main_#t~mem264#1.base, main_#t~mem264#1.offset, main_#t~mem265#1.base, main_#t~mem265#1.offset, main_#t~mem266#1.base, main_#t~mem266#1.offset, main_#t~mem267#1.base, main_#t~mem267#1.offset, main_#t~mem268#1.base, main_#t~mem268#1.offset, main_#t~mem269#1.base, main_#t~mem269#1.offset, main_#t~mem270#1.base, main_#t~mem270#1.offset, main_#t~mem271#1.base, main_#t~mem271#1.offset, main_~_hd_head~1#1.base, main_~_hd_head~1#1.offset, main_#t~mem272#1.base, main_#t~mem272#1.offset, main_#t~mem273#1, main_#t~post274#1, main_~_hd_bkt~1#1, main_~_hd_hh_del~1#1.base, main_~_hd_hh_del~1#1.offset, main_#t~ite233#1.base, main_#t~ite233#1.offset, main_#t~mem232#1.base, main_#t~mem232#1.offset, main_~#i~0#1.base, main_~#i~0#1.offset, main_~user~0#1.base, main_~user~0#1.offset, main_~tmp~0#1.base, main_~tmp~0#1.offset, main_~users~0#1.base, main_~users~0#1.offset, main_~temp~0#1.base, main_~temp~0#1.offset;call main_~#i~0#1.base, main_~#i~0#1.offset := #Ultimate.allocOnStack(4);havoc main_~user~0#1.base, main_~user~0#1.offset;havoc main_~tmp~0#1.base, main_~tmp~0#1.offset;main_~users~0#1.base, main_~users~0#1.offset := 0, 0;call write~int(0, main_~#i~0#1.base, main_~#i~0#1.offset, 4); {10605#true} is VALID [2022-02-20 23:27:27,491 INFO L290 TraceCheckUtils]: 2: Hoare triple {10605#true} call main_#t~mem5#1 := read~int(main_~#i~0#1.base, main_~#i~0#1.offset, 4); {10605#true} is VALID [2022-02-20 23:27:27,492 INFO L290 TraceCheckUtils]: 3: Hoare triple {10605#true} assume !!(main_#t~mem5#1 < 1000);havoc main_#t~mem5#1;call main_#t~malloc6#1.base, main_#t~malloc6#1.offset := #Ultimate.allocOnHeap(40);main_~user~0#1.base, main_~user~0#1.offset := main_#t~malloc6#1.base, main_#t~malloc6#1.offset;havoc main_#t~malloc6#1.base, main_#t~malloc6#1.offset; {10605#true} is VALID [2022-02-20 23:27:27,492 INFO L290 TraceCheckUtils]: 4: Hoare triple {10605#true} assume !(main_~user~0#1.base == 0 && main_~user~0#1.offset == 0); {10605#true} is VALID [2022-02-20 23:27:27,492 INFO L290 TraceCheckUtils]: 5: Hoare triple {10605#true} call main_#t~mem7#1 := read~int(main_~#i~0#1.base, main_~#i~0#1.offset, 4);call write~int(main_#t~mem7#1, main_~user~0#1.base, main_~user~0#1.offset, 4);havoc main_#t~mem7#1;call main_#t~mem8#1 := read~int(main_~#i~0#1.base, main_~#i~0#1.offset, 4);call main_#t~mem9#1 := read~int(main_~#i~0#1.base, main_~#i~0#1.offset, 4);call write~int(main_#t~mem8#1 * main_#t~mem9#1, main_~user~0#1.base, 4 + main_~user~0#1.offset, 4);havoc main_#t~mem8#1;havoc main_#t~mem9#1; {10605#true} is VALID [2022-02-20 23:27:27,492 INFO L290 TraceCheckUtils]: 6: Hoare triple {10605#true} havoc main_~_ha_hashv~0#1; {10605#true} is VALID [2022-02-20 23:27:27,492 INFO L290 TraceCheckUtils]: 7: Hoare triple {10605#true} goto; {10605#true} is VALID [2022-02-20 23:27:27,492 INFO L290 TraceCheckUtils]: 8: Hoare triple {10605#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; {10605#true} is VALID [2022-02-20 23:27:27,493 INFO L290 TraceCheckUtils]: 9: Hoare triple {10605#true} assume !(main_~_hj_k~0#1 % 4294967296 >= 12); {10605#true} is VALID [2022-02-20 23:27:27,493 INFO L290 TraceCheckUtils]: 10: Hoare triple {10605#true} main_~_ha_hashv~0#1 := 4 + main_~_ha_hashv~0#1;main_#t~switch22#1 := 11 == main_~_hj_k~0#1; {10605#true} is VALID [2022-02-20 23:27:27,493 INFO L290 TraceCheckUtils]: 11: Hoare triple {10605#true} assume !main_#t~switch22#1; {10605#true} is VALID [2022-02-20 23:27:27,493 INFO L290 TraceCheckUtils]: 12: Hoare triple {10605#true} main_#t~switch22#1 := main_#t~switch22#1 || 10 == main_~_hj_k~0#1; {10605#true} is VALID [2022-02-20 23:27:27,493 INFO L290 TraceCheckUtils]: 13: Hoare triple {10605#true} assume !main_#t~switch22#1; {10605#true} is VALID [2022-02-20 23:27:27,493 INFO L290 TraceCheckUtils]: 14: Hoare triple {10605#true} main_#t~switch22#1 := main_#t~switch22#1 || 9 == main_~_hj_k~0#1; {10605#true} is VALID [2022-02-20 23:27:27,494 INFO L290 TraceCheckUtils]: 15: Hoare triple {10605#true} assume !main_#t~switch22#1; {10605#true} is VALID [2022-02-20 23:27:27,494 INFO L290 TraceCheckUtils]: 16: Hoare triple {10605#true} main_#t~switch22#1 := main_#t~switch22#1 || 8 == main_~_hj_k~0#1; {10605#true} is VALID [2022-02-20 23:27:27,494 INFO L290 TraceCheckUtils]: 17: Hoare triple {10605#true} assume !main_#t~switch22#1; {10605#true} is VALID [2022-02-20 23:27:27,494 INFO L290 TraceCheckUtils]: 18: Hoare triple {10605#true} main_#t~switch22#1 := main_#t~switch22#1 || 7 == main_~_hj_k~0#1; {10605#true} is VALID [2022-02-20 23:27:27,494 INFO L290 TraceCheckUtils]: 19: Hoare triple {10605#true} assume !main_#t~switch22#1; {10605#true} is VALID [2022-02-20 23:27:27,494 INFO L290 TraceCheckUtils]: 20: Hoare triple {10605#true} main_#t~switch22#1 := main_#t~switch22#1 || 6 == main_~_hj_k~0#1; {10605#true} is VALID [2022-02-20 23:27:27,494 INFO L290 TraceCheckUtils]: 21: Hoare triple {10605#true} assume !main_#t~switch22#1; {10605#true} is VALID [2022-02-20 23:27:27,494 INFO L290 TraceCheckUtils]: 22: Hoare triple {10605#true} main_#t~switch22#1 := main_#t~switch22#1 || 5 == main_~_hj_k~0#1; {10605#true} is VALID [2022-02-20 23:27:27,494 INFO L290 TraceCheckUtils]: 23: Hoare triple {10605#true} assume !main_#t~switch22#1; {10605#true} is VALID [2022-02-20 23:27:27,495 INFO L290 TraceCheckUtils]: 24: Hoare triple {10605#true} main_#t~switch22#1 := main_#t~switch22#1 || 4 == main_~_hj_k~0#1; {10605#true} is VALID [2022-02-20 23:27:27,495 INFO L290 TraceCheckUtils]: 25: Hoare triple {10605#true} assume main_#t~switch22#1;call main_#t~mem30#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~mem30#1 % 256);havoc main_#t~mem30#1; {10605#true} is VALID [2022-02-20 23:27:27,495 INFO L290 TraceCheckUtils]: 26: Hoare triple {10605#true} main_#t~switch22#1 := main_#t~switch22#1 || 3 == main_~_hj_k~0#1; {10605#true} is VALID [2022-02-20 23:27:27,495 INFO L290 TraceCheckUtils]: 27: Hoare triple {10605#true} assume main_#t~switch22#1;call main_#t~mem31#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~mem31#1 % 256);havoc main_#t~mem31#1; {10605#true} is VALID [2022-02-20 23:27:27,495 INFO L290 TraceCheckUtils]: 28: Hoare triple {10605#true} main_#t~switch22#1 := main_#t~switch22#1 || 2 == main_~_hj_k~0#1; {10605#true} is VALID [2022-02-20 23:27:27,495 INFO L290 TraceCheckUtils]: 29: Hoare triple {10605#true} assume main_#t~switch22#1;call main_#t~mem32#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~mem32#1 % 256);havoc main_#t~mem32#1; {10605#true} is VALID [2022-02-20 23:27:27,496 INFO L290 TraceCheckUtils]: 30: Hoare triple {10605#true} main_#t~switch22#1 := main_#t~switch22#1 || 1 == main_~_hj_k~0#1; {10605#true} is VALID [2022-02-20 23:27:27,496 INFO L290 TraceCheckUtils]: 31: Hoare triple {10605#true} assume main_#t~switch22#1;call main_#t~mem33#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~mem33#1 % 256;havoc main_#t~mem33#1; {10605#true} is VALID [2022-02-20 23:27:27,496 INFO L290 TraceCheckUtils]: 32: Hoare triple {10605#true} havoc main_#t~switch22#1; {10605#true} is VALID [2022-02-20 23:27:27,496 INFO L290 TraceCheckUtils]: 33: Hoare triple {10605#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)))); {10605#true} is VALID [2022-02-20 23:27:27,496 INFO L290 TraceCheckUtils]: 34: Hoare triple {10605#true} goto; {10605#true} is VALID [2022-02-20 23:27:27,496 INFO L290 TraceCheckUtils]: 35: Hoare triple {10605#true} goto; {10605#true} is VALID [2022-02-20 23:27:27,497 INFO L290 TraceCheckUtils]: 36: Hoare triple {10605#true} goto; {10605#true} is VALID [2022-02-20 23:27:27,497 INFO L290 TraceCheckUtils]: 37: Hoare triple {10605#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); {10605#true} is VALID [2022-02-20 23:27:27,497 INFO L290 TraceCheckUtils]: 38: Hoare triple {10605#true} assume main_~users~0#1.base == 0 && main_~users~0#1.offset == 0;call write~$Pointer$(0, 0, main_~user~0#1.base, 16 + main_~user~0#1.offset, 4);call write~$Pointer$(0, 0, main_~user~0#1.base, 12 + main_~user~0#1.offset, 4); {10605#true} is VALID [2022-02-20 23:27:27,497 INFO L290 TraceCheckUtils]: 39: Hoare triple {10605#true} call main_#t~malloc34#1.base, main_#t~malloc34#1.offset := #Ultimate.allocOnHeap(44);call write~$Pointer$(main_#t~malloc34#1.base, main_#t~malloc34#1.offset, main_~user~0#1.base, 8 + main_~user~0#1.offset, 4);havoc main_#t~malloc34#1.base, main_#t~malloc34#1.offset;call main_#t~mem35#1.base, main_#t~mem35#1.offset := read~$Pointer$(main_~user~0#1.base, 8 + main_~user~0#1.offset, 4); {10605#true} is VALID [2022-02-20 23:27:27,497 INFO L290 TraceCheckUtils]: 40: Hoare triple {10605#true} assume !(main_#t~mem35#1.base == 0 && main_#t~mem35#1.offset == 0);havoc main_#t~mem35#1.base, main_#t~mem35#1.offset;call main_#t~mem36#1.base, main_#t~mem36#1.offset := read~$Pointer$(main_~user~0#1.base, 8 + main_~user~0#1.offset, 4); {10605#true} is VALID [2022-02-20 23:27:27,497 INFO L272 TraceCheckUtils]: 41: Hoare triple {10605#true} call main_#t~memset~res37#1.base, main_#t~memset~res37#1.offset := #Ultimate.C_memset(main_#t~mem36#1.base, main_#t~mem36#1.offset, 0, 44); {10605#true} is VALID [2022-02-20 23:27:27,498 INFO L290 TraceCheckUtils]: 42: Hoare triple {10605#true} #t~loopctr276 := 0; {10605#true} is VALID [2022-02-20 23:27:27,498 INFO L290 TraceCheckUtils]: 43: Hoare triple {10605#true} assume !(#t~loopctr276 % 4294967296 < #amount % 4294967296); {10605#true} is VALID [2022-02-20 23:27:27,498 INFO L290 TraceCheckUtils]: 44: Hoare triple {10605#true} assume #res.base == #ptr.base && #res.offset == #ptr.offset; {10605#true} is VALID [2022-02-20 23:27:27,498 INFO L284 TraceCheckUtils]: 45: Hoare quadruple {10605#true} {10605#true} #903#return; {10605#true} is VALID [2022-02-20 23:27:27,498 INFO L290 TraceCheckUtils]: 46: Hoare triple {10605#true} havoc main_#t~mem36#1.base, main_#t~mem36#1.offset;havoc main_#t~memset~res37#1.base, main_#t~memset~res37#1.offset;call main_#t~mem38#1.base, main_#t~mem38#1.offset := read~$Pointer$(main_~user~0#1.base, 8 + main_~user~0#1.offset, 4);call write~$Pointer$(main_~user~0#1.base, 8 + main_~user~0#1.offset, main_#t~mem38#1.base, 16 + main_#t~mem38#1.offset, 4);havoc main_#t~mem38#1.base, main_#t~mem38#1.offset;call main_#t~mem39#1.base, main_#t~mem39#1.offset := read~$Pointer$(main_~user~0#1.base, 8 + main_~user~0#1.offset, 4);call write~int(32, main_#t~mem39#1.base, 4 + main_#t~mem39#1.offset, 4);havoc main_#t~mem39#1.base, main_#t~mem39#1.offset;call main_#t~mem40#1.base, main_#t~mem40#1.offset := read~$Pointer$(main_~user~0#1.base, 8 + main_~user~0#1.offset, 4);call write~int(5, main_#t~mem40#1.base, 8 + main_#t~mem40#1.offset, 4);havoc main_#t~mem40#1.base, main_#t~mem40#1.offset;call main_#t~mem41#1.base, main_#t~mem41#1.offset := read~$Pointer$(main_~user~0#1.base, 8 + main_~user~0#1.offset, 4);call write~int((if 8 + main_~user~0#1.offset - main_~user~0#1.offset < 0 && 0 != (8 + main_~user~0#1.offset - main_~user~0#1.offset) % 1 then 1 + (8 + main_~user~0#1.offset - main_~user~0#1.offset) / 1 else (8 + main_~user~0#1.offset - main_~user~0#1.offset) / 1), main_#t~mem41#1.base, 20 + main_#t~mem41#1.offset, 4);havoc main_#t~mem41#1.base, main_#t~mem41#1.offset;call main_#t~mem42#1.base, main_#t~mem42#1.offset := read~$Pointer$(main_~user~0#1.base, 8 + main_~user~0#1.offset, 4);call main_#t~malloc43#1.base, main_#t~malloc43#1.offset := #Ultimate.allocOnHeap(384);call write~$Pointer$(main_#t~malloc43#1.base, main_#t~malloc43#1.offset, main_#t~mem42#1.base, main_#t~mem42#1.offset, 4);havoc main_#t~mem42#1.base, main_#t~mem42#1.offset;havoc main_#t~malloc43#1.base, main_#t~malloc43#1.offset;call main_#t~mem44#1.base, main_#t~mem44#1.offset := read~$Pointer$(main_~user~0#1.base, 8 + main_~user~0#1.offset, 4);call write~int(2685476833, main_#t~mem44#1.base, 40 + main_#t~mem44#1.offset, 4);havoc main_#t~mem44#1.base, main_#t~mem44#1.offset;call main_#t~mem45#1.base, main_#t~mem45#1.offset := read~$Pointer$(main_~user~0#1.base, 8 + main_~user~0#1.offset, 4);call main_#t~mem46#1.base, main_#t~mem46#1.offset := read~$Pointer$(main_#t~mem45#1.base, main_#t~mem45#1.offset, 4); {10605#true} is VALID [2022-02-20 23:27:27,498 INFO L290 TraceCheckUtils]: 47: Hoare triple {10605#true} assume !(main_#t~mem46#1.base == 0 && main_#t~mem46#1.offset == 0);havoc main_#t~mem45#1.base, main_#t~mem45#1.offset;havoc main_#t~mem46#1.base, main_#t~mem46#1.offset;call main_#t~mem48#1.base, main_#t~mem48#1.offset := read~$Pointer$(main_~user~0#1.base, 8 + main_~user~0#1.offset, 4);call main_#t~mem49#1.base, main_#t~mem49#1.offset := read~$Pointer$(main_#t~mem48#1.base, main_#t~mem48#1.offset, 4); {10605#true} is VALID [2022-02-20 23:27:27,499 INFO L272 TraceCheckUtils]: 48: Hoare triple {10605#true} call main_#t~memset~res50#1.base, main_#t~memset~res50#1.offset := #Ultimate.C_memset(main_#t~mem49#1.base, main_#t~mem49#1.offset, 0, 384); {10605#true} is VALID [2022-02-20 23:27:27,499 INFO L290 TraceCheckUtils]: 49: Hoare triple {10605#true} #t~loopctr276 := 0; {10605#true} is VALID [2022-02-20 23:27:27,499 INFO L290 TraceCheckUtils]: 50: Hoare triple {10605#true} assume !(#t~loopctr276 % 4294967296 < #amount % 4294967296); {10605#true} is VALID [2022-02-20 23:27:27,499 INFO L290 TraceCheckUtils]: 51: Hoare triple {10605#true} assume #res.base == #ptr.base && #res.offset == #ptr.offset; {10605#true} is VALID [2022-02-20 23:27:27,499 INFO L284 TraceCheckUtils]: 52: Hoare quadruple {10605#true} {10605#true} #905#return; {10605#true} is VALID [2022-02-20 23:27:27,499 INFO L290 TraceCheckUtils]: 53: Hoare triple {10605#true} havoc main_#t~mem48#1.base, main_#t~mem48#1.offset;havoc main_#t~mem49#1.base, main_#t~mem49#1.offset;havoc main_#t~memset~res50#1.base, main_#t~memset~res50#1.offset; {10605#true} is VALID [2022-02-20 23:27:27,500 INFO L290 TraceCheckUtils]: 54: Hoare triple {10605#true} goto; {10605#true} is VALID [2022-02-20 23:27:27,500 INFO L290 TraceCheckUtils]: 55: Hoare triple {10605#true} main_~users~0#1.base, main_~users~0#1.offset := main_~user~0#1.base, main_~user~0#1.offset; {10605#true} is VALID [2022-02-20 23:27:27,500 INFO L290 TraceCheckUtils]: 56: Hoare triple {10605#true} havoc main_~_ha_bkt~0#1;call main_#t~mem59#1.base, main_#t~mem59#1.offset := read~$Pointer$(main_~users~0#1.base, 8 + main_~users~0#1.offset, 4);call main_#t~mem60#1 := read~int(main_#t~mem59#1.base, 12 + main_#t~mem59#1.offset, 4);main_#t~post61#1 := main_#t~mem60#1;call write~int(1 + main_#t~post61#1, main_#t~mem59#1.base, 12 + main_#t~mem59#1.offset, 4);havoc main_#t~mem59#1.base, main_#t~mem59#1.offset;havoc main_#t~mem60#1;havoc main_#t~post61#1; {10605#true} is VALID [2022-02-20 23:27:27,500 INFO L290 TraceCheckUtils]: 57: Hoare triple {10605#true} call main_#t~mem62#1.base, main_#t~mem62#1.offset := read~$Pointer$(main_~users~0#1.base, 8 + main_~users~0#1.offset, 4);call main_#t~mem63#1 := read~int(main_#t~mem62#1.base, 4 + main_#t~mem62#1.offset, 4);main_~_ha_bkt~0#1 := (if 0 == main_~_ha_hashv~0#1 || 0 == main_#t~mem63#1 - 1 then 0 else (if 1 == main_#t~mem63#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~mem63#1 - 1))) else (if 1 == main_~_ha_hashv~0#1 then (if 1 == main_#t~mem63#1 - 1 || 0 == main_#t~mem63#1 - 1 then main_#t~mem63#1 - 1 else (if main_#t~mem63#1 - 1 >= 0 then (main_#t~mem63#1 - 1) % 2 else ~bitwiseAnd(main_~_ha_hashv~0#1, main_#t~mem63#1 - 1))) else ~bitwiseAnd(main_~_ha_hashv~0#1, main_#t~mem63#1 - 1))));havoc main_#t~mem62#1.base, main_#t~mem62#1.offset;havoc main_#t~mem63#1; {10605#true} is VALID [2022-02-20 23:27:27,500 INFO L290 TraceCheckUtils]: 58: Hoare triple {10605#true} goto; {10605#true} is VALID [2022-02-20 23:27:27,500 INFO L290 TraceCheckUtils]: 59: Hoare triple {10605#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.base, main_#t~mem65#1.offset := read~$Pointer$(main_#t~mem64#1.base, main_#t~mem64#1.offset, 4);main_~_ha_head~0#1.base, main_~_ha_head~0#1.offset := main_#t~mem65#1.base, main_#t~mem65#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~mem64#1.base, main_#t~mem64#1.offset;havoc main_#t~mem65#1.base, main_#t~mem65#1.offset;call main_#t~mem66#1 := read~int(main_~_ha_head~0#1.base, 4 + main_~_ha_head~0#1.offset, 4);main_#t~post67#1 := main_#t~mem66#1;call write~int(1 + main_#t~post67#1, main_~_ha_head~0#1.base, 4 + main_~_ha_head~0#1.offset, 4);havoc main_#t~mem66#1;havoc main_#t~post67#1;call main_#t~mem68#1.base, main_#t~mem68#1.offset := read~$Pointer$(main_~_ha_head~0#1.base, main_~_ha_head~0#1.offset, 4);call write~$Pointer$(main_#t~mem68#1.base, main_#t~mem68#1.offset, main_~user~0#1.base, 24 + main_~user~0#1.offset, 4);havoc main_#t~mem68#1.base, main_#t~mem68#1.offset;call write~$Pointer$(0, 0, main_~user~0#1.base, 20 + main_~user~0#1.offset, 4);call main_#t~mem69#1.base, main_#t~mem69#1.offset := read~$Pointer$(main_~_ha_head~0#1.base, main_~_ha_head~0#1.offset, 4); {10605#true} is VALID [2022-02-20 23:27:27,501 INFO L290 TraceCheckUtils]: 60: Hoare triple {10605#true} assume main_#t~mem69#1.base != 0 || main_#t~mem69#1.offset != 0;havoc main_#t~mem69#1.base, main_#t~mem69#1.offset;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_~user~0#1.base, 8 + main_~user~0#1.offset, main_#t~mem70#1.base, 12 + main_#t~mem70#1.offset, 4);havoc main_#t~mem70#1.base, main_#t~mem70#1.offset; {10605#true} is VALID [2022-02-20 23:27:27,501 INFO L290 TraceCheckUtils]: 61: Hoare triple {10605#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~mem72#1 := read~int(main_~_ha_head~0#1.base, 4 + main_~_ha_head~0#1.offset, 4);call main_#t~mem71#1 := read~int(main_~_ha_head~0#1.base, 8 + main_~_ha_head~0#1.offset, 4);main_#t~short75#1 := main_#t~mem72#1 % 4294967296 >= 10 * (1 + main_#t~mem71#1) % 4294967296; {10605#true} is VALID [2022-02-20 23:27:27,501 INFO L290 TraceCheckUtils]: 62: Hoare triple {10605#true} assume main_#t~short75#1;call main_#t~mem73#1.base, main_#t~mem73#1.offset := read~$Pointer$(main_~user~0#1.base, 8 + main_~user~0#1.offset, 4);call main_#t~mem74#1 := read~int(main_#t~mem73#1.base, 36 + main_#t~mem73#1.offset, 4);main_#t~short75#1 := 0 == main_#t~mem74#1 % 4294967296; {10605#true} is VALID [2022-02-20 23:27:27,501 INFO L290 TraceCheckUtils]: 63: Hoare triple {10605#true} assume !main_#t~short75#1;havoc main_#t~mem72#1;havoc main_#t~mem71#1;havoc main_#t~mem73#1.base, main_#t~mem73#1.offset;havoc main_#t~mem74#1;havoc main_#t~short75#1; {10605#true} is VALID [2022-02-20 23:27:27,501 INFO L290 TraceCheckUtils]: 64: Hoare triple {10605#true} goto; {10605#true} is VALID [2022-02-20 23:27:27,501 INFO L290 TraceCheckUtils]: 65: Hoare triple {10605#true} goto; {10605#true} is VALID [2022-02-20 23:27:27,502 INFO L290 TraceCheckUtils]: 66: Hoare triple {10605#true} goto; {10605#true} is VALID [2022-02-20 23:27:27,502 INFO L290 TraceCheckUtils]: 67: Hoare triple {10605#true} goto; {10605#true} is VALID [2022-02-20 23:27:27,502 INFO L290 TraceCheckUtils]: 68: Hoare triple {10605#true} call main_#t~mem3#1 := read~int(main_~#i~0#1.base, main_~#i~0#1.offset, 4);main_#t~post4#1 := main_#t~mem3#1;call write~int(1 + main_#t~post4#1, main_~#i~0#1.base, main_~#i~0#1.offset, 4);havoc main_#t~mem3#1;havoc main_#t~post4#1; {10605#true} is VALID [2022-02-20 23:27:27,502 INFO L290 TraceCheckUtils]: 69: Hoare triple {10605#true} call main_#t~mem5#1 := read~int(main_~#i~0#1.base, main_~#i~0#1.offset, 4); {10605#true} is VALID [2022-02-20 23:27:27,502 INFO L290 TraceCheckUtils]: 70: Hoare triple {10605#true} assume !(main_#t~mem5#1 < 1000);havoc main_#t~mem5#1; {10605#true} is VALID [2022-02-20 23:27:27,502 INFO L290 TraceCheckUtils]: 71: Hoare triple {10605#true} call write~int(0, main_~#i~0#1.base, main_~#i~0#1.offset, 4); {10605#true} is VALID [2022-02-20 23:27:27,503 INFO L290 TraceCheckUtils]: 72: Hoare triple {10605#true} call main_#t~mem144#1 := read~int(main_~#i~0#1.base, main_~#i~0#1.offset, 4); {10605#true} is VALID [2022-02-20 23:27:27,503 INFO L290 TraceCheckUtils]: 73: Hoare triple {10605#true} assume !!(main_#t~mem144#1 < 1000);havoc main_#t~mem144#1; {10605#true} is VALID [2022-02-20 23:27:27,503 INFO L290 TraceCheckUtils]: 74: Hoare triple {10605#true} havoc main_~_hf_hashv~0#1; {10605#true} is VALID [2022-02-20 23:27:27,503 INFO L290 TraceCheckUtils]: 75: Hoare triple {10605#true} goto; {10605#true} is VALID [2022-02-20 23:27:27,504 INFO L290 TraceCheckUtils]: 76: Hoare triple {10605#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; {10838#(<= |ULTIMATE.start_main_~_hj_k~1#1| 4)} is VALID [2022-02-20 23:27:27,504 INFO L290 TraceCheckUtils]: 77: Hoare triple {10838#(<= |ULTIMATE.start_main_~_hj_k~1#1| 4)} assume !(main_~_hj_k~1#1 % 4294967296 >= 12); {10838#(<= |ULTIMATE.start_main_~_hj_k~1#1| 4)} is VALID [2022-02-20 23:27:27,505 INFO L290 TraceCheckUtils]: 78: Hoare triple {10838#(<= |ULTIMATE.start_main_~_hj_k~1#1| 4)} main_~_hf_hashv~0#1 := 4 + main_~_hf_hashv~0#1;main_#t~switch157#1 := 11 == main_~_hj_k~1#1; {10838#(<= |ULTIMATE.start_main_~_hj_k~1#1| 4)} is VALID [2022-02-20 23:27:27,505 INFO L290 TraceCheckUtils]: 79: Hoare triple {10838#(<= |ULTIMATE.start_main_~_hj_k~1#1| 4)} assume !main_#t~switch157#1; {10848#(and (<= |ULTIMATE.start_main_~_hj_k~1#1| 4) (not |ULTIMATE.start_main_#t~switch157#1|))} is VALID [2022-02-20 23:27:27,506 INFO L290 TraceCheckUtils]: 80: Hoare triple {10848#(and (<= |ULTIMATE.start_main_~_hj_k~1#1| 4) (not |ULTIMATE.start_main_#t~switch157#1|))} main_#t~switch157#1 := main_#t~switch157#1 || 10 == main_~_hj_k~1#1; {10852#(not |ULTIMATE.start_main_#t~switch157#1|)} is VALID [2022-02-20 23:27:27,506 INFO L290 TraceCheckUtils]: 81: Hoare triple {10852#(not |ULTIMATE.start_main_#t~switch157#1|)} assume main_#t~switch157#1;call main_#t~mem159#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~mem159#1 % 256);havoc main_#t~mem159#1; {10606#false} is VALID [2022-02-20 23:27:27,506 INFO L290 TraceCheckUtils]: 82: Hoare triple {10606#false} main_#t~switch157#1 := main_#t~switch157#1 || 9 == main_~_hj_k~1#1; {10606#false} is VALID [2022-02-20 23:27:27,506 INFO L290 TraceCheckUtils]: 83: Hoare triple {10606#false} assume main_#t~switch157#1;call main_#t~mem160#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~mem160#1 % 256);havoc main_#t~mem160#1; {10606#false} is VALID [2022-02-20 23:27:27,506 INFO L290 TraceCheckUtils]: 84: Hoare triple {10606#false} main_#t~switch157#1 := main_#t~switch157#1 || 8 == main_~_hj_k~1#1; {10606#false} is VALID [2022-02-20 23:27:27,507 INFO L290 TraceCheckUtils]: 85: Hoare triple {10606#false} assume main_#t~switch157#1;call main_#t~mem161#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~mem161#1 % 256);havoc main_#t~mem161#1; {10606#false} is VALID [2022-02-20 23:27:27,507 INFO L290 TraceCheckUtils]: 86: Hoare triple {10606#false} main_#t~switch157#1 := main_#t~switch157#1 || 7 == main_~_hj_k~1#1; {10606#false} is VALID [2022-02-20 23:27:27,507 INFO L290 TraceCheckUtils]: 87: Hoare triple {10606#false} assume main_#t~switch157#1;call main_#t~mem162#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~mem162#1 % 256);havoc main_#t~mem162#1; {10606#false} is VALID [2022-02-20 23:27:27,507 INFO L290 TraceCheckUtils]: 88: Hoare triple {10606#false} main_#t~switch157#1 := main_#t~switch157#1 || 6 == main_~_hj_k~1#1; {10606#false} is VALID [2022-02-20 23:27:27,507 INFO L290 TraceCheckUtils]: 89: Hoare triple {10606#false} assume main_#t~switch157#1;call main_#t~mem163#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~mem163#1 % 256);havoc main_#t~mem163#1; {10606#false} is VALID [2022-02-20 23:27:27,507 INFO L290 TraceCheckUtils]: 90: Hoare triple {10606#false} main_#t~switch157#1 := main_#t~switch157#1 || 5 == main_~_hj_k~1#1; {10606#false} is VALID [2022-02-20 23:27:27,508 INFO L290 TraceCheckUtils]: 91: Hoare triple {10606#false} assume main_#t~switch157#1;call main_#t~mem164#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~mem164#1 % 256;havoc main_#t~mem164#1; {10606#false} is VALID [2022-02-20 23:27:27,508 INFO L290 TraceCheckUtils]: 92: Hoare triple {10606#false} main_#t~switch157#1 := main_#t~switch157#1 || 4 == main_~_hj_k~1#1; {10606#false} is VALID [2022-02-20 23:27:27,508 INFO L290 TraceCheckUtils]: 93: Hoare triple {10606#false} assume main_#t~switch157#1;call main_#t~mem165#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~mem165#1 % 256);havoc main_#t~mem165#1; {10606#false} is VALID [2022-02-20 23:27:27,508 INFO L290 TraceCheckUtils]: 94: Hoare triple {10606#false} main_#t~switch157#1 := main_#t~switch157#1 || 3 == main_~_hj_k~1#1; {10606#false} is VALID [2022-02-20 23:27:27,508 INFO L290 TraceCheckUtils]: 95: Hoare triple {10606#false} assume main_#t~switch157#1;call main_#t~mem166#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~mem166#1 % 256);havoc main_#t~mem166#1; {10606#false} is VALID [2022-02-20 23:27:27,508 INFO L290 TraceCheckUtils]: 96: Hoare triple {10606#false} main_#t~switch157#1 := main_#t~switch157#1 || 2 == main_~_hj_k~1#1; {10606#false} is VALID [2022-02-20 23:27:27,509 INFO L290 TraceCheckUtils]: 97: Hoare triple {10606#false} assume main_#t~switch157#1;call main_#t~mem167#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~mem167#1 % 256);havoc main_#t~mem167#1; {10606#false} is VALID [2022-02-20 23:27:27,509 INFO L290 TraceCheckUtils]: 98: Hoare triple {10606#false} main_#t~switch157#1 := main_#t~switch157#1 || 1 == main_~_hj_k~1#1; {10606#false} is VALID [2022-02-20 23:27:27,509 INFO L290 TraceCheckUtils]: 99: Hoare triple {10606#false} assume main_#t~switch157#1;call main_#t~mem168#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~mem168#1 % 256;havoc main_#t~mem168#1; {10606#false} is VALID [2022-02-20 23:27:27,509 INFO L290 TraceCheckUtils]: 100: Hoare triple {10606#false} havoc main_#t~switch157#1; {10606#false} is VALID [2022-02-20 23:27:27,509 INFO L290 TraceCheckUtils]: 101: Hoare triple {10606#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)))); {10606#false} is VALID [2022-02-20 23:27:27,509 INFO L290 TraceCheckUtils]: 102: Hoare triple {10606#false} goto; {10606#false} is VALID [2022-02-20 23:27:27,509 INFO L290 TraceCheckUtils]: 103: Hoare triple {10606#false} goto; {10606#false} is VALID [2022-02-20 23:27:27,509 INFO L290 TraceCheckUtils]: 104: Hoare triple {10606#false} goto; {10606#false} is VALID [2022-02-20 23:27:27,509 INFO L290 TraceCheckUtils]: 105: Hoare triple {10606#false} main_~tmp~0#1.base, main_~tmp~0#1.offset := 0, 0; {10606#false} is VALID [2022-02-20 23:27:27,509 INFO L290 TraceCheckUtils]: 106: Hoare triple {10606#false} assume !(main_~users~0#1.base != 0 || main_~users~0#1.offset != 0); {10606#false} is VALID [2022-02-20 23:27:27,509 INFO L290 TraceCheckUtils]: 107: Hoare triple {10606#false} goto; {10606#false} is VALID [2022-02-20 23:27:27,510 INFO L290 TraceCheckUtils]: 108: Hoare triple {10606#false} goto; {10606#false} is VALID [2022-02-20 23:27:27,510 INFO L290 TraceCheckUtils]: 109: Hoare triple {10606#false} assume !(main_~tmp~0#1.base != 0 || main_~tmp~0#1.offset != 0); {10606#false} is VALID [2022-02-20 23:27:27,510 INFO L290 TraceCheckUtils]: 110: Hoare triple {10606#false} assume !false; {10606#false} is VALID [2022-02-20 23:27:27,510 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-02-20 23:27:27,510 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 23:27:27,511 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 23:27:27,511 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [222915931] [2022-02-20 23:27:27,511 WARN L317 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-02-20 23:27:27,511 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [879521630] [2022-02-20 23:27:27,511 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [879521630] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:27:27,511 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:27:27,512 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-02-20 23:27:27,512 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [916490865] [2022-02-20 23:27:27,512 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:27:27,513 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 20.6) internal successors, (103), 5 states have internal predecessors, (103), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 111 [2022-02-20 23:27:27,513 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:27:27,513 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 20.6) internal successors, (103), 5 states have internal predecessors, (103), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-02-20 23:27:27,596 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 107 edges. 107 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:27:27,596 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-20 23:27:27,596 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 23:27:27,596 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-20 23:27:27,596 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-02-20 23:27:27,597 INFO L87 Difference]: Start difference. First operand 337 states and 412 transitions. Second operand has 5 states, 5 states have (on average 20.6) internal successors, (103), 5 states have internal predecessors, (103), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-02-20 23:27:28,263 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:27:28,264 INFO L93 Difference]: Finished difference Result 502 states and 626 transitions. [2022-02-20 23:27:28,264 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-02-20 23:27:28,264 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 20.6) internal successors, (103), 5 states have internal predecessors, (103), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 111 [2022-02-20 23:27:28,265 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:27:28,265 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 20.6) internal successors, (103), 5 states have internal predecessors, (103), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-02-20 23:27:28,268 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 351 transitions. [2022-02-20 23:27:28,269 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 20.6) internal successors, (103), 5 states have internal predecessors, (103), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-02-20 23:27:28,272 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 351 transitions. [2022-02-20 23:27:28,272 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 351 transitions. [2022-02-20 23:27:28,601 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 351 edges. 351 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:27:28,607 INFO L225 Difference]: With dead ends: 502 [2022-02-20 23:27:28,607 INFO L226 Difference]: Without dead ends: 314 [2022-02-20 23:27:28,608 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 110 GetRequests, 107 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-02-20 23:27:28,608 INFO L933 BasicCegarLoop]: 207 mSDtfsCounter, 108 mSDsluCounter, 315 mSDsCounter, 0 mSdLazyCounter, 42 mSolverCounterSat, 35 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 108 SdHoareTripleChecker+Valid, 522 SdHoareTripleChecker+Invalid, 77 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 42 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-20 23:27:28,609 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [108 Valid, 522 Invalid, 77 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [35 Valid, 42 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-20 23:27:28,609 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 314 states. [2022-02-20 23:27:28,659 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 314 to 309. [2022-02-20 23:27:28,660 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:27:28,661 INFO L82 GeneralOperation]: Start isEquivalent. First operand 314 states. Second operand has 309 states, 303 states have (on average 1.2013201320132014) internal successors, (364), 304 states have internal predecessors, (364), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-02-20 23:27:28,661 INFO L74 IsIncluded]: Start isIncluded. First operand 314 states. Second operand has 309 states, 303 states have (on average 1.2013201320132014) internal successors, (364), 304 states have internal predecessors, (364), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-02-20 23:27:28,662 INFO L87 Difference]: Start difference. First operand 314 states. Second operand has 309 states, 303 states have (on average 1.2013201320132014) internal successors, (364), 304 states have internal predecessors, (364), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-02-20 23:27:28,669 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:27:28,669 INFO L93 Difference]: Finished difference Result 314 states and 375 transitions. [2022-02-20 23:27:28,669 INFO L276 IsEmpty]: Start isEmpty. Operand 314 states and 375 transitions. [2022-02-20 23:27:28,670 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:27:28,670 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:27:28,671 INFO L74 IsIncluded]: Start isIncluded. First operand has 309 states, 303 states have (on average 1.2013201320132014) internal successors, (364), 304 states have internal predecessors, (364), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand 314 states. [2022-02-20 23:27:28,672 INFO L87 Difference]: Start difference. First operand has 309 states, 303 states have (on average 1.2013201320132014) internal successors, (364), 304 states have internal predecessors, (364), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand 314 states. [2022-02-20 23:27:28,678 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:27:28,678 INFO L93 Difference]: Finished difference Result 314 states and 375 transitions. [2022-02-20 23:27:28,679 INFO L276 IsEmpty]: Start isEmpty. Operand 314 states and 375 transitions. [2022-02-20 23:27:28,679 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:27:28,679 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:27:28,679 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:27:28,680 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:27:28,680 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 309 states, 303 states have (on average 1.2013201320132014) internal successors, (364), 304 states have internal predecessors, (364), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-02-20 23:27:28,687 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 309 states to 309 states and 370 transitions. [2022-02-20 23:27:28,687 INFO L78 Accepts]: Start accepts. Automaton has 309 states and 370 transitions. Word has length 111 [2022-02-20 23:27:28,688 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:27:28,688 INFO L470 AbstractCegarLoop]: Abstraction has 309 states and 370 transitions. [2022-02-20 23:27:28,688 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 20.6) internal successors, (103), 5 states have internal predecessors, (103), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-02-20 23:27:28,688 INFO L276 IsEmpty]: Start isEmpty. Operand 309 states and 370 transitions. [2022-02-20 23:27:28,689 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2022-02-20 23:27:28,689 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:27:28,689 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:27:28,718 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-02-20 23:27:28,911 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 23:27:28,911 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 23:27:28,912 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:27:28,912 INFO L85 PathProgramCache]: Analyzing trace with hash -1844881027, now seen corresponding path program 1 times [2022-02-20 23:27:28,912 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 23:27:28,912 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1087229213] [2022-02-20 23:27:28,912 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:27:28,912 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 23:27:28,956 ERROR L252 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-02-20 23:27:28,957 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [257784494] [2022-02-20 23:27:28,957 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:27:28,957 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 23:27:28,957 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 23:27:28,958 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-02-20 23:27:28,966 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-02-20 23:27:29,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:27:29,474 INFO L263 TraceCheckSpWp]: Trace formula consists of 762 conjuncts, 5 conjunts are in the unsatisfiable core [2022-02-20 23:27:29,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:27:29,536 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 23:27:29,848 INFO L290 TraceCheckUtils]: 0: Hoare triple {12504#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); {12504#true} is VALID [2022-02-20 23:27:29,848 INFO L290 TraceCheckUtils]: 1: Hoare triple {12504#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc6#1.base, main_#t~malloc6#1.offset, main_#t~mem7#1, main_#t~mem8#1, main_#t~mem9#1, main_#t~mem11#1, main_#t~mem10#1, main_#t~mem12#1, main_#t~mem13#1, main_#t~mem15#1, main_#t~mem14#1, main_#t~mem16#1, main_#t~mem17#1, main_#t~mem19#1, main_#t~mem18#1, main_#t~mem20#1, main_#t~mem21#1, main_#t~switch22#1, main_#t~mem23#1, main_#t~mem24#1, main_#t~mem25#1, main_#t~mem26#1, main_#t~mem27#1, main_#t~mem28#1, main_#t~mem29#1, main_#t~mem30#1, main_#t~mem31#1, main_#t~mem32#1, main_#t~mem33#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~malloc34#1.base, main_#t~malloc34#1.offset, main_#t~mem35#1.base, main_#t~mem35#1.offset, main_#t~mem36#1.base, main_#t~mem36#1.offset, main_#t~memset~res37#1.base, main_#t~memset~res37#1.offset, main_#t~mem38#1.base, main_#t~mem38#1.offset, main_#t~mem39#1.base, main_#t~mem39#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~malloc43#1.base, main_#t~malloc43#1.offset, main_#t~mem44#1.base, main_#t~mem44#1.offset, main_#t~mem45#1.base, main_#t~mem45#1.offset, main_#t~mem46#1.base, main_#t~mem46#1.offset, main_#t~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~memset~res50#1.base, main_#t~memset~res50#1.offset, main_#t~mem51#1.base, main_#t~mem51#1.offset, main_#t~mem52#1.base, main_#t~mem52#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, main_#t~mem56#1.base, main_#t~mem56#1.offset, main_#t~mem57#1.base, main_#t~mem57#1.offset, main_#t~mem58#1.base, main_#t~mem58#1.offset, main_#t~mem59#1.base, main_#t~mem59#1.offset, main_#t~mem60#1, main_#t~post61#1, main_#t~mem62#1.base, main_#t~mem62#1.offset, main_#t~mem63#1, main_#t~mem64#1.base, main_#t~mem64#1.offset, main_#t~mem65#1.base, main_#t~mem65#1.offset, main_#t~mem66#1, main_#t~post67#1, main_#t~mem68#1.base, main_#t~mem68#1.offset, main_#t~mem69#1.base, main_#t~mem69#1.offset, main_#t~mem70#1.base, main_#t~mem70#1.offset, main_#t~mem72#1, main_#t~mem71#1, main_#t~mem73#1.base, main_#t~mem73#1.offset, main_#t~mem74#1, main_#t~short75#1, main_#t~mem76#1.base, main_#t~mem76#1.offset, main_#t~mem77#1, main_#t~malloc78#1.base, main_#t~malloc78#1.offset, main_#t~mem79#1.base, main_#t~mem79#1.offset, main_#t~mem80#1.base, main_#t~mem80#1.offset, main_#t~mem81#1.base, main_#t~mem81#1.offset, main_#t~mem82#1, main_#t~memset~res83#1.base, main_#t~memset~res83#1.offset, main_#t~mem84#1.base, main_#t~mem84#1.offset, main_#t~mem85#1.base, main_#t~mem85#1.offset, main_#t~mem88#1, main_#t~mem86#1.base, main_#t~mem86#1.offset, main_#t~mem87#1, main_#t~mem89#1.base, main_#t~mem89#1.offset, main_#t~mem92#1, main_#t~mem90#1.base, main_#t~mem90#1.offset, main_#t~mem91#1, main_#t~ite93#1, main_#t~mem94#1.base, main_#t~mem94#1.offset, main_#t~mem98#1.base, main_#t~mem98#1.offset, main_#t~mem99#1.base, main_#t~mem99#1.offset, main_#t~mem100#1.base, main_#t~mem100#1.offset, main_#t~mem101#1.base, main_#t~mem101#1.offset, main_#t~mem104#1, main_#t~mem102#1.base, main_#t~mem102#1.offset, main_#t~mem103#1, main_#t~mem105#1.base, main_#t~mem105#1.offset, main_#t~mem106#1, main_#t~pre107#1, main_#t~mem108#1.base, main_#t~mem108#1.offset, main_#t~mem109#1, main_#t~mem110#1.base, main_#t~mem110#1.offset, main_#t~mem111#1, main_#t~post112#1, main_#t~mem116#1, main_#t~mem114#1, main_#t~mem113#1.base, main_#t~mem113#1.offset, main_#t~mem115#1, main_#t~mem117#1, main_#t~post118#1, main_#t~mem119#1.base, main_#t~mem119#1.offset, main_#t~mem120#1.base, main_#t~mem120#1.offset, main_#t~mem121#1.base, main_#t~mem121#1.offset, main_#t~post95#1, main_#t~mem96#1.base, main_#t~mem96#1.offset, main_#t~mem97#1, main_#t~mem122#1.base, main_#t~mem122#1.offset, main_#t~mem123#1.base, main_#t~mem123#1.offset, main_#t~mem124#1.base, main_#t~mem124#1.offset, main_#t~mem125#1, main_#t~mem126#1.base, main_#t~mem126#1.offset, main_#t~mem127#1, main_#t~post128#1, main_#t~mem129#1.base, main_#t~mem129#1.offset, main_#t~mem130#1.base, main_#t~mem130#1.offset, main_#t~mem131#1.base, main_#t~mem131#1.offset, main_#t~mem132#1.base, main_#t~mem132#1.offset, main_#t~mem135#1, main_#t~mem133#1.base, main_#t~mem133#1.offset, main_#t~mem134#1, main_#t~ite138#1, main_#t~mem136#1.base, main_#t~mem136#1.offset, main_#t~mem137#1, main_#t~mem139#1.base, main_#t~mem139#1.offset, main_#t~mem140#1, main_#t~mem141#1.base, main_#t~mem141#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~mem3#1, main_#t~post4#1, main_#t~mem5#1, main_#t~mem146#1, main_#t~mem145#1, main_#t~mem147#1, main_#t~mem148#1, main_#t~mem150#1, main_#t~mem149#1, main_#t~mem151#1, main_#t~mem152#1, main_#t~mem154#1, main_#t~mem153#1, main_#t~mem155#1, main_#t~mem156#1, main_#t~switch157#1, main_#t~mem158#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_~_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~mem169#1.base, main_#t~mem169#1.offset, main_#t~mem170#1, main_#t~mem171#1.base, main_#t~mem171#1.offset, 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, main_#t~mem179#1, main_#t~mem180#1, main_#t~short181#1, main_#t~mem182#1.base, main_#t~mem182#1.offset, main_#t~ret183#1, main_#t~mem184#1.base, main_#t~mem184#1.offset, main_#t~mem185#1.base, main_#t~mem185#1.offset, main_#t~mem186#1.base, main_#t~mem186#1.offset, main_#t~mem187#1, main_~_hf_bkt~0#1, main_~_hf_hashv~0#1, main_#t~mem188#1.base, main_#t~mem188#1.offset, main_#t~mem189#1.base, main_#t~mem189#1.offset, main_#t~short190#1, main_#t~mem191#1.base, main_#t~mem191#1.offset, main_#t~mem192#1.base, main_#t~mem192#1.offset, main_#t~mem193#1.base, main_#t~mem193#1.offset, main_#t~mem194#1.base, main_#t~mem194#1.offset, main_#t~mem195#1.base, main_#t~mem195#1.offset, main_#t~mem196#1.base, main_#t~mem196#1.offset, main_#t~mem197#1.base, main_#t~mem197#1.offset, main_#t~mem198#1.base, main_#t~mem198#1.offset, main_#t~mem199#1, main_#t~mem200#1.base, main_#t~mem200#1.offset, main_#t~mem201#1.base, main_#t~mem201#1.offset, main_#t~mem202#1.base, main_#t~mem202#1.offset, main_#t~mem203#1, main_#t~mem204#1.base, main_#t~mem204#1.offset, main_#t~mem205#1.base, main_#t~mem205#1.offset, main_#t~mem206#1.base, main_#t~mem206#1.offset, main_#t~mem207#1.base, main_#t~mem207#1.offset, main_#t~mem208#1.base, main_#t~mem208#1.offset, main_#t~mem209#1, main_#t~mem210#1.base, main_#t~mem210#1.offset, main_#t~mem213#1, main_#t~mem211#1.base, main_#t~mem211#1.offset, main_#t~mem212#1, main_#t~mem214#1.base, main_#t~mem214#1.offset, main_#t~mem215#1.base, main_#t~mem215#1.offset, main_#t~mem216#1, main_#t~post217#1, main_#t~mem218#1.base, main_#t~mem218#1.offset, main_#t~mem219#1.base, main_#t~mem219#1.offset, main_#t~mem220#1.base, main_#t~mem220#1.offset, main_#t~mem221#1.base, main_#t~mem221#1.offset, main_#t~mem222#1.base, main_#t~mem222#1.offset, main_#t~mem223#1.base, main_#t~mem223#1.offset, main_#t~mem224#1.base, main_#t~mem224#1.offset, main_#t~mem225#1.base, main_#t~mem225#1.offset, main_~_hd_head~0#1.base, main_~_hd_head~0#1.offset, main_#t~mem226#1.base, main_#t~mem226#1.offset, main_#t~mem227#1, main_#t~post228#1, main_~_hd_bkt~0#1, main_~_hd_hh_del~0#1.base, main_~_hd_hh_del~0#1.offset, main_#t~mem142#1, main_#t~post143#1, main_#t~mem144#1, main_#t~mem229#1.base, main_#t~mem229#1.offset, main_#t~ite231#1.base, main_#t~ite231#1.offset, main_#t~mem230#1.base, main_#t~mem230#1.offset, main_#t~mem234#1.base, main_#t~mem234#1.offset, main_#t~mem235#1.base, main_#t~mem235#1.offset, main_#t~short236#1, main_#t~mem237#1.base, main_#t~mem237#1.offset, main_#t~mem238#1.base, main_#t~mem238#1.offset, main_#t~mem239#1.base, main_#t~mem239#1.offset, main_#t~mem240#1.base, main_#t~mem240#1.offset, main_#t~mem241#1.base, main_#t~mem241#1.offset, main_#t~mem242#1.base, main_#t~mem242#1.offset, main_#t~mem243#1.base, main_#t~mem243#1.offset, main_#t~mem244#1.base, main_#t~mem244#1.offset, main_#t~mem245#1, main_#t~mem246#1.base, main_#t~mem246#1.offset, main_#t~mem247#1.base, main_#t~mem247#1.offset, main_#t~mem248#1.base, main_#t~mem248#1.offset, main_#t~mem249#1, main_#t~mem250#1.base, main_#t~mem250#1.offset, main_#t~mem251#1.base, main_#t~mem251#1.offset, main_#t~mem252#1.base, main_#t~mem252#1.offset, main_#t~mem253#1.base, main_#t~mem253#1.offset, main_#t~mem254#1.base, main_#t~mem254#1.offset, main_#t~mem255#1, main_#t~mem256#1.base, main_#t~mem256#1.offset, main_#t~mem259#1, main_#t~mem257#1.base, main_#t~mem257#1.offset, main_#t~mem258#1, main_#t~mem260#1.base, main_#t~mem260#1.offset, main_#t~mem261#1.base, main_#t~mem261#1.offset, main_#t~mem262#1, main_#t~post263#1, main_#t~mem264#1.base, main_#t~mem264#1.offset, main_#t~mem265#1.base, main_#t~mem265#1.offset, main_#t~mem266#1.base, main_#t~mem266#1.offset, main_#t~mem267#1.base, main_#t~mem267#1.offset, main_#t~mem268#1.base, main_#t~mem268#1.offset, main_#t~mem269#1.base, main_#t~mem269#1.offset, main_#t~mem270#1.base, main_#t~mem270#1.offset, main_#t~mem271#1.base, main_#t~mem271#1.offset, main_~_hd_head~1#1.base, main_~_hd_head~1#1.offset, main_#t~mem272#1.base, main_#t~mem272#1.offset, main_#t~mem273#1, main_#t~post274#1, main_~_hd_bkt~1#1, main_~_hd_hh_del~1#1.base, main_~_hd_hh_del~1#1.offset, main_#t~ite233#1.base, main_#t~ite233#1.offset, main_#t~mem232#1.base, main_#t~mem232#1.offset, main_~#i~0#1.base, main_~#i~0#1.offset, main_~user~0#1.base, main_~user~0#1.offset, main_~tmp~0#1.base, main_~tmp~0#1.offset, main_~users~0#1.base, main_~users~0#1.offset, main_~temp~0#1.base, main_~temp~0#1.offset;call main_~#i~0#1.base, main_~#i~0#1.offset := #Ultimate.allocOnStack(4);havoc main_~user~0#1.base, main_~user~0#1.offset;havoc main_~tmp~0#1.base, main_~tmp~0#1.offset;main_~users~0#1.base, main_~users~0#1.offset := 0, 0;call write~int(0, main_~#i~0#1.base, main_~#i~0#1.offset, 4); {12504#true} is VALID [2022-02-20 23:27:29,849 INFO L290 TraceCheckUtils]: 2: Hoare triple {12504#true} call main_#t~mem5#1 := read~int(main_~#i~0#1.base, main_~#i~0#1.offset, 4); {12504#true} is VALID [2022-02-20 23:27:29,852 INFO L290 TraceCheckUtils]: 3: Hoare triple {12504#true} assume !!(main_#t~mem5#1 < 1000);havoc main_#t~mem5#1;call main_#t~malloc6#1.base, main_#t~malloc6#1.offset := #Ultimate.allocOnHeap(40);main_~user~0#1.base, main_~user~0#1.offset := main_#t~malloc6#1.base, main_#t~malloc6#1.offset;havoc main_#t~malloc6#1.base, main_#t~malloc6#1.offset; {12518#(not (= |ULTIMATE.start_main_~user~0#1.base| 0))} is VALID [2022-02-20 23:27:29,853 INFO L290 TraceCheckUtils]: 4: Hoare triple {12518#(not (= |ULTIMATE.start_main_~user~0#1.base| 0))} assume !(main_~user~0#1.base == 0 && main_~user~0#1.offset == 0); {12518#(not (= |ULTIMATE.start_main_~user~0#1.base| 0))} is VALID [2022-02-20 23:27:29,853 INFO L290 TraceCheckUtils]: 5: Hoare triple {12518#(not (= |ULTIMATE.start_main_~user~0#1.base| 0))} call main_#t~mem7#1 := read~int(main_~#i~0#1.base, main_~#i~0#1.offset, 4);call write~int(main_#t~mem7#1, main_~user~0#1.base, main_~user~0#1.offset, 4);havoc main_#t~mem7#1;call main_#t~mem8#1 := read~int(main_~#i~0#1.base, main_~#i~0#1.offset, 4);call main_#t~mem9#1 := read~int(main_~#i~0#1.base, main_~#i~0#1.offset, 4);call write~int(main_#t~mem8#1 * main_#t~mem9#1, main_~user~0#1.base, 4 + main_~user~0#1.offset, 4);havoc main_#t~mem8#1;havoc main_#t~mem9#1; {12518#(not (= |ULTIMATE.start_main_~user~0#1.base| 0))} is VALID [2022-02-20 23:27:29,853 INFO L290 TraceCheckUtils]: 6: Hoare triple {12518#(not (= |ULTIMATE.start_main_~user~0#1.base| 0))} havoc main_~_ha_hashv~0#1; {12518#(not (= |ULTIMATE.start_main_~user~0#1.base| 0))} is VALID [2022-02-20 23:27:29,854 INFO L290 TraceCheckUtils]: 7: Hoare triple {12518#(not (= |ULTIMATE.start_main_~user~0#1.base| 0))} goto; {12518#(not (= |ULTIMATE.start_main_~user~0#1.base| 0))} is VALID [2022-02-20 23:27:29,856 INFO L290 TraceCheckUtils]: 8: Hoare triple {12518#(not (= |ULTIMATE.start_main_~user~0#1.base| 0))} havoc main_~_hj_i~0#1;havoc main_~_hj_j~0#1;havoc main_~_hj_k~0#1;main_~_hj_key~0#1.base, main_~_hj_key~0#1.offset := main_~user~0#1.base, main_~user~0#1.offset;main_~_ha_hashv~0#1 := 4276993775;main_~_hj_j~0#1 := 2654435769;main_~_hj_i~0#1 := main_~_hj_j~0#1;main_~_hj_k~0#1 := 4; {12518#(not (= |ULTIMATE.start_main_~user~0#1.base| 0))} is VALID [2022-02-20 23:27:29,857 INFO L290 TraceCheckUtils]: 9: Hoare triple {12518#(not (= |ULTIMATE.start_main_~user~0#1.base| 0))} assume !(main_~_hj_k~0#1 % 4294967296 >= 12); {12518#(not (= |ULTIMATE.start_main_~user~0#1.base| 0))} is VALID [2022-02-20 23:27:29,857 INFO L290 TraceCheckUtils]: 10: Hoare triple {12518#(not (= |ULTIMATE.start_main_~user~0#1.base| 0))} main_~_ha_hashv~0#1 := 4 + main_~_ha_hashv~0#1;main_#t~switch22#1 := 11 == main_~_hj_k~0#1; {12518#(not (= |ULTIMATE.start_main_~user~0#1.base| 0))} is VALID [2022-02-20 23:27:29,866 INFO L290 TraceCheckUtils]: 11: Hoare triple {12518#(not (= |ULTIMATE.start_main_~user~0#1.base| 0))} assume !main_#t~switch22#1; {12518#(not (= |ULTIMATE.start_main_~user~0#1.base| 0))} is VALID [2022-02-20 23:27:29,867 INFO L290 TraceCheckUtils]: 12: Hoare triple {12518#(not (= |ULTIMATE.start_main_~user~0#1.base| 0))} main_#t~switch22#1 := main_#t~switch22#1 || 10 == main_~_hj_k~0#1; {12518#(not (= |ULTIMATE.start_main_~user~0#1.base| 0))} is VALID [2022-02-20 23:27:29,867 INFO L290 TraceCheckUtils]: 13: Hoare triple {12518#(not (= |ULTIMATE.start_main_~user~0#1.base| 0))} assume !main_#t~switch22#1; {12518#(not (= |ULTIMATE.start_main_~user~0#1.base| 0))} is VALID [2022-02-20 23:27:29,868 INFO L290 TraceCheckUtils]: 14: Hoare triple {12518#(not (= |ULTIMATE.start_main_~user~0#1.base| 0))} main_#t~switch22#1 := main_#t~switch22#1 || 9 == main_~_hj_k~0#1; {12518#(not (= |ULTIMATE.start_main_~user~0#1.base| 0))} is VALID [2022-02-20 23:27:29,868 INFO L290 TraceCheckUtils]: 15: Hoare triple {12518#(not (= |ULTIMATE.start_main_~user~0#1.base| 0))} assume !main_#t~switch22#1; {12518#(not (= |ULTIMATE.start_main_~user~0#1.base| 0))} is VALID [2022-02-20 23:27:29,869 INFO L290 TraceCheckUtils]: 16: Hoare triple {12518#(not (= |ULTIMATE.start_main_~user~0#1.base| 0))} main_#t~switch22#1 := main_#t~switch22#1 || 8 == main_~_hj_k~0#1; {12518#(not (= |ULTIMATE.start_main_~user~0#1.base| 0))} is VALID [2022-02-20 23:27:29,869 INFO L290 TraceCheckUtils]: 17: Hoare triple {12518#(not (= |ULTIMATE.start_main_~user~0#1.base| 0))} assume !main_#t~switch22#1; {12518#(not (= |ULTIMATE.start_main_~user~0#1.base| 0))} is VALID [2022-02-20 23:27:29,869 INFO L290 TraceCheckUtils]: 18: Hoare triple {12518#(not (= |ULTIMATE.start_main_~user~0#1.base| 0))} main_#t~switch22#1 := main_#t~switch22#1 || 7 == main_~_hj_k~0#1; {12518#(not (= |ULTIMATE.start_main_~user~0#1.base| 0))} is VALID [2022-02-20 23:27:29,870 INFO L290 TraceCheckUtils]: 19: Hoare triple {12518#(not (= |ULTIMATE.start_main_~user~0#1.base| 0))} assume !main_#t~switch22#1; {12518#(not (= |ULTIMATE.start_main_~user~0#1.base| 0))} is VALID [2022-02-20 23:27:29,870 INFO L290 TraceCheckUtils]: 20: Hoare triple {12518#(not (= |ULTIMATE.start_main_~user~0#1.base| 0))} main_#t~switch22#1 := main_#t~switch22#1 || 6 == main_~_hj_k~0#1; {12518#(not (= |ULTIMATE.start_main_~user~0#1.base| 0))} is VALID [2022-02-20 23:27:29,870 INFO L290 TraceCheckUtils]: 21: Hoare triple {12518#(not (= |ULTIMATE.start_main_~user~0#1.base| 0))} assume !main_#t~switch22#1; {12518#(not (= |ULTIMATE.start_main_~user~0#1.base| 0))} is VALID [2022-02-20 23:27:29,870 INFO L290 TraceCheckUtils]: 22: Hoare triple {12518#(not (= |ULTIMATE.start_main_~user~0#1.base| 0))} main_#t~switch22#1 := main_#t~switch22#1 || 5 == main_~_hj_k~0#1; {12518#(not (= |ULTIMATE.start_main_~user~0#1.base| 0))} is VALID [2022-02-20 23:27:29,871 INFO L290 TraceCheckUtils]: 23: Hoare triple {12518#(not (= |ULTIMATE.start_main_~user~0#1.base| 0))} assume !main_#t~switch22#1; {12518#(not (= |ULTIMATE.start_main_~user~0#1.base| 0))} is VALID [2022-02-20 23:27:29,871 INFO L290 TraceCheckUtils]: 24: Hoare triple {12518#(not (= |ULTIMATE.start_main_~user~0#1.base| 0))} main_#t~switch22#1 := main_#t~switch22#1 || 4 == main_~_hj_k~0#1; {12518#(not (= |ULTIMATE.start_main_~user~0#1.base| 0))} is VALID [2022-02-20 23:27:29,871 INFO L290 TraceCheckUtils]: 25: Hoare triple {12518#(not (= |ULTIMATE.start_main_~user~0#1.base| 0))} assume main_#t~switch22#1;call main_#t~mem30#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~mem30#1 % 256);havoc main_#t~mem30#1; {12518#(not (= |ULTIMATE.start_main_~user~0#1.base| 0))} is VALID [2022-02-20 23:27:29,872 INFO L290 TraceCheckUtils]: 26: Hoare triple {12518#(not (= |ULTIMATE.start_main_~user~0#1.base| 0))} main_#t~switch22#1 := main_#t~switch22#1 || 3 == main_~_hj_k~0#1; {12518#(not (= |ULTIMATE.start_main_~user~0#1.base| 0))} is VALID [2022-02-20 23:27:29,872 INFO L290 TraceCheckUtils]: 27: Hoare triple {12518#(not (= |ULTIMATE.start_main_~user~0#1.base| 0))} assume main_#t~switch22#1;call main_#t~mem31#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~mem31#1 % 256);havoc main_#t~mem31#1; {12518#(not (= |ULTIMATE.start_main_~user~0#1.base| 0))} is VALID [2022-02-20 23:27:29,872 INFO L290 TraceCheckUtils]: 28: Hoare triple {12518#(not (= |ULTIMATE.start_main_~user~0#1.base| 0))} main_#t~switch22#1 := main_#t~switch22#1 || 2 == main_~_hj_k~0#1; {12518#(not (= |ULTIMATE.start_main_~user~0#1.base| 0))} is VALID [2022-02-20 23:27:29,873 INFO L290 TraceCheckUtils]: 29: Hoare triple {12518#(not (= |ULTIMATE.start_main_~user~0#1.base| 0))} assume main_#t~switch22#1;call main_#t~mem32#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~mem32#1 % 256);havoc main_#t~mem32#1; {12518#(not (= |ULTIMATE.start_main_~user~0#1.base| 0))} is VALID [2022-02-20 23:27:29,873 INFO L290 TraceCheckUtils]: 30: Hoare triple {12518#(not (= |ULTIMATE.start_main_~user~0#1.base| 0))} main_#t~switch22#1 := main_#t~switch22#1 || 1 == main_~_hj_k~0#1; {12518#(not (= |ULTIMATE.start_main_~user~0#1.base| 0))} is VALID [2022-02-20 23:27:29,873 INFO L290 TraceCheckUtils]: 31: Hoare triple {12518#(not (= |ULTIMATE.start_main_~user~0#1.base| 0))} assume main_#t~switch22#1;call main_#t~mem33#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~mem33#1 % 256;havoc main_#t~mem33#1; {12518#(not (= |ULTIMATE.start_main_~user~0#1.base| 0))} is VALID [2022-02-20 23:27:29,874 INFO L290 TraceCheckUtils]: 32: Hoare triple {12518#(not (= |ULTIMATE.start_main_~user~0#1.base| 0))} havoc main_#t~switch22#1; {12518#(not (= |ULTIMATE.start_main_~user~0#1.base| 0))} is VALID [2022-02-20 23:27:29,874 INFO L290 TraceCheckUtils]: 33: Hoare triple {12518#(not (= |ULTIMATE.start_main_~user~0#1.base| 0))} main_~_hj_i~0#1 := main_~_hj_i~0#1 - main_~_hj_j~0#1;main_~_hj_i~0#1 := main_~_hj_i~0#1 - main_~_ha_hashv~0#1;main_~_hj_i~0#1 := (if (1 == main_~_hj_i~0#1 || 0 == main_~_hj_i~0#1) && (1 == main_~_ha_hashv~0#1 / 8192 || 0 == main_~_ha_hashv~0#1 / 8192) then (if main_~_hj_i~0#1 == main_~_ha_hashv~0#1 / 8192 then 0 else 1) else (if 0 == main_~_hj_i~0#1 then main_~_ha_hashv~0#1 / 8192 else (if 0 == main_~_ha_hashv~0#1 / 8192 then main_~_hj_i~0#1 else ~bitwiseXOr(main_~_hj_i~0#1, main_~_ha_hashv~0#1 / 8192))));main_~_hj_j~0#1 := main_~_hj_j~0#1 - main_~_ha_hashv~0#1;main_~_hj_j~0#1 := main_~_hj_j~0#1 - main_~_hj_i~0#1;main_~_hj_j~0#1 := (if (1 == main_~_hj_j~0#1 || 0 == main_~_hj_j~0#1) && (1 == 256 * main_~_hj_i~0#1 || 0 == 256 * main_~_hj_i~0#1) then (if main_~_hj_j~0#1 == 256 * main_~_hj_i~0#1 then 0 else 1) else (if 0 == main_~_hj_j~0#1 then 256 * main_~_hj_i~0#1 else (if 0 == 256 * main_~_hj_i~0#1 then main_~_hj_j~0#1 else ~bitwiseXOr(main_~_hj_j~0#1, 256 * main_~_hj_i~0#1))));main_~_ha_hashv~0#1 := main_~_ha_hashv~0#1 - main_~_hj_i~0#1;main_~_ha_hashv~0#1 := main_~_ha_hashv~0#1 - main_~_hj_j~0#1;main_~_ha_hashv~0#1 := (if (1 == main_~_ha_hashv~0#1 || 0 == main_~_ha_hashv~0#1) && (1 == main_~_hj_j~0#1 / 8192 || 0 == main_~_hj_j~0#1 / 8192) then (if main_~_ha_hashv~0#1 == main_~_hj_j~0#1 / 8192 then 0 else 1) else (if 0 == main_~_ha_hashv~0#1 then main_~_hj_j~0#1 / 8192 else (if 0 == main_~_hj_j~0#1 / 8192 then main_~_ha_hashv~0#1 else ~bitwiseXOr(main_~_ha_hashv~0#1, main_~_hj_j~0#1 / 8192))));main_~_hj_i~0#1 := main_~_hj_i~0#1 - main_~_hj_j~0#1;main_~_hj_i~0#1 := main_~_hj_i~0#1 - main_~_ha_hashv~0#1;main_~_hj_i~0#1 := (if (1 == main_~_hj_i~0#1 || 0 == main_~_hj_i~0#1) && (1 == main_~_ha_hashv~0#1 / 4096 || 0 == main_~_ha_hashv~0#1 / 4096) then (if main_~_hj_i~0#1 == main_~_ha_hashv~0#1 / 4096 then 0 else 1) else (if 0 == main_~_hj_i~0#1 then main_~_ha_hashv~0#1 / 4096 else (if 0 == main_~_ha_hashv~0#1 / 4096 then main_~_hj_i~0#1 else ~bitwiseXOr(main_~_hj_i~0#1, main_~_ha_hashv~0#1 / 4096))));main_~_hj_j~0#1 := main_~_hj_j~0#1 - main_~_ha_hashv~0#1;main_~_hj_j~0#1 := main_~_hj_j~0#1 - main_~_hj_i~0#1;main_~_hj_j~0#1 := (if (1 == main_~_hj_j~0#1 || 0 == main_~_hj_j~0#1) && (1 == 65536 * main_~_hj_i~0#1 || 0 == 65536 * main_~_hj_i~0#1) then (if main_~_hj_j~0#1 == 65536 * main_~_hj_i~0#1 then 0 else 1) else (if 0 == main_~_hj_j~0#1 then 65536 * main_~_hj_i~0#1 else (if 0 == 65536 * main_~_hj_i~0#1 then main_~_hj_j~0#1 else ~bitwiseXOr(main_~_hj_j~0#1, 65536 * main_~_hj_i~0#1))));main_~_ha_hashv~0#1 := main_~_ha_hashv~0#1 - main_~_hj_i~0#1;main_~_ha_hashv~0#1 := main_~_ha_hashv~0#1 - main_~_hj_j~0#1;main_~_ha_hashv~0#1 := (if (1 == main_~_ha_hashv~0#1 || 0 == main_~_ha_hashv~0#1) && (1 == main_~_hj_j~0#1 / 32 || 0 == main_~_hj_j~0#1 / 32) then (if main_~_ha_hashv~0#1 == main_~_hj_j~0#1 / 32 then 0 else 1) else (if 0 == main_~_ha_hashv~0#1 then main_~_hj_j~0#1 / 32 else (if 0 == main_~_hj_j~0#1 / 32 then main_~_ha_hashv~0#1 else ~bitwiseXOr(main_~_ha_hashv~0#1, main_~_hj_j~0#1 / 32))));main_~_hj_i~0#1 := main_~_hj_i~0#1 - main_~_hj_j~0#1;main_~_hj_i~0#1 := main_~_hj_i~0#1 - main_~_ha_hashv~0#1;main_~_hj_i~0#1 := (if (1 == main_~_hj_i~0#1 || 0 == main_~_hj_i~0#1) && (1 == main_~_ha_hashv~0#1 / 8 || 0 == main_~_ha_hashv~0#1 / 8) then (if main_~_hj_i~0#1 == main_~_ha_hashv~0#1 / 8 then 0 else 1) else (if 0 == main_~_hj_i~0#1 then main_~_ha_hashv~0#1 / 8 else (if 0 == main_~_ha_hashv~0#1 / 8 then main_~_hj_i~0#1 else ~bitwiseXOr(main_~_hj_i~0#1, main_~_ha_hashv~0#1 / 8))));main_~_hj_j~0#1 := main_~_hj_j~0#1 - main_~_ha_hashv~0#1;main_~_hj_j~0#1 := main_~_hj_j~0#1 - main_~_hj_i~0#1;main_~_hj_j~0#1 := (if (1 == main_~_hj_j~0#1 || 0 == main_~_hj_j~0#1) && (1 == 1024 * main_~_hj_i~0#1 || 0 == 1024 * main_~_hj_i~0#1) then (if main_~_hj_j~0#1 == 1024 * main_~_hj_i~0#1 then 0 else 1) else (if 0 == main_~_hj_j~0#1 then 1024 * main_~_hj_i~0#1 else (if 0 == 1024 * main_~_hj_i~0#1 then main_~_hj_j~0#1 else ~bitwiseXOr(main_~_hj_j~0#1, 1024 * main_~_hj_i~0#1))));main_~_ha_hashv~0#1 := main_~_ha_hashv~0#1 - main_~_hj_i~0#1;main_~_ha_hashv~0#1 := main_~_ha_hashv~0#1 - main_~_hj_j~0#1;main_~_ha_hashv~0#1 := (if (1 == main_~_ha_hashv~0#1 || 0 == main_~_ha_hashv~0#1) && (1 == main_~_hj_j~0#1 / 32768 || 0 == main_~_hj_j~0#1 / 32768) then (if main_~_ha_hashv~0#1 == main_~_hj_j~0#1 / 32768 then 0 else 1) else (if 0 == main_~_ha_hashv~0#1 then main_~_hj_j~0#1 / 32768 else (if 0 == main_~_hj_j~0#1 / 32768 then main_~_ha_hashv~0#1 else ~bitwiseXOr(main_~_ha_hashv~0#1, main_~_hj_j~0#1 / 32768)))); {12518#(not (= |ULTIMATE.start_main_~user~0#1.base| 0))} is VALID [2022-02-20 23:27:29,874 INFO L290 TraceCheckUtils]: 34: Hoare triple {12518#(not (= |ULTIMATE.start_main_~user~0#1.base| 0))} goto; {12518#(not (= |ULTIMATE.start_main_~user~0#1.base| 0))} is VALID [2022-02-20 23:27:29,875 INFO L290 TraceCheckUtils]: 35: Hoare triple {12518#(not (= |ULTIMATE.start_main_~user~0#1.base| 0))} goto; {12518#(not (= |ULTIMATE.start_main_~user~0#1.base| 0))} is VALID [2022-02-20 23:27:29,875 INFO L290 TraceCheckUtils]: 36: Hoare triple {12518#(not (= |ULTIMATE.start_main_~user~0#1.base| 0))} goto; {12518#(not (= |ULTIMATE.start_main_~user~0#1.base| 0))} is VALID [2022-02-20 23:27:29,875 INFO L290 TraceCheckUtils]: 37: Hoare triple {12518#(not (= |ULTIMATE.start_main_~user~0#1.base| 0))} call write~int(main_~_ha_hashv~0#1, main_~user~0#1.base, 36 + main_~user~0#1.offset, 4);call write~$Pointer$(main_~user~0#1.base, main_~user~0#1.offset, main_~user~0#1.base, 28 + main_~user~0#1.offset, 4);call write~int(4, main_~user~0#1.base, 32 + main_~user~0#1.offset, 4); {12518#(not (= |ULTIMATE.start_main_~user~0#1.base| 0))} is VALID [2022-02-20 23:27:29,876 INFO L290 TraceCheckUtils]: 38: Hoare triple {12518#(not (= |ULTIMATE.start_main_~user~0#1.base| 0))} assume main_~users~0#1.base == 0 && main_~users~0#1.offset == 0;call write~$Pointer$(0, 0, main_~user~0#1.base, 16 + main_~user~0#1.offset, 4);call write~$Pointer$(0, 0, main_~user~0#1.base, 12 + main_~user~0#1.offset, 4); {12518#(not (= |ULTIMATE.start_main_~user~0#1.base| 0))} is VALID [2022-02-20 23:27:29,876 INFO L290 TraceCheckUtils]: 39: Hoare triple {12518#(not (= |ULTIMATE.start_main_~user~0#1.base| 0))} call main_#t~malloc34#1.base, main_#t~malloc34#1.offset := #Ultimate.allocOnHeap(44);call write~$Pointer$(main_#t~malloc34#1.base, main_#t~malloc34#1.offset, main_~user~0#1.base, 8 + main_~user~0#1.offset, 4);havoc main_#t~malloc34#1.base, main_#t~malloc34#1.offset;call main_#t~mem35#1.base, main_#t~mem35#1.offset := read~$Pointer$(main_~user~0#1.base, 8 + main_~user~0#1.offset, 4); {12518#(not (= |ULTIMATE.start_main_~user~0#1.base| 0))} is VALID [2022-02-20 23:27:29,876 INFO L290 TraceCheckUtils]: 40: Hoare triple {12518#(not (= |ULTIMATE.start_main_~user~0#1.base| 0))} assume !(main_#t~mem35#1.base == 0 && main_#t~mem35#1.offset == 0);havoc main_#t~mem35#1.base, main_#t~mem35#1.offset;call main_#t~mem36#1.base, main_#t~mem36#1.offset := read~$Pointer$(main_~user~0#1.base, 8 + main_~user~0#1.offset, 4); {12518#(not (= |ULTIMATE.start_main_~user~0#1.base| 0))} is VALID [2022-02-20 23:27:29,876 INFO L272 TraceCheckUtils]: 41: Hoare triple {12518#(not (= |ULTIMATE.start_main_~user~0#1.base| 0))} call main_#t~memset~res37#1.base, main_#t~memset~res37#1.offset := #Ultimate.C_memset(main_#t~mem36#1.base, main_#t~mem36#1.offset, 0, 44); {12504#true} is VALID [2022-02-20 23:27:29,876 INFO L290 TraceCheckUtils]: 42: Hoare triple {12504#true} #t~loopctr276 := 0; {12504#true} is VALID [2022-02-20 23:27:29,876 INFO L290 TraceCheckUtils]: 43: Hoare triple {12504#true} assume !(#t~loopctr276 % 4294967296 < #amount % 4294967296); {12504#true} is VALID [2022-02-20 23:27:29,877 INFO L290 TraceCheckUtils]: 44: Hoare triple {12504#true} assume #res.base == #ptr.base && #res.offset == #ptr.offset; {12504#true} is VALID [2022-02-20 23:27:29,877 INFO L284 TraceCheckUtils]: 45: Hoare quadruple {12504#true} {12518#(not (= |ULTIMATE.start_main_~user~0#1.base| 0))} #903#return; {12518#(not (= |ULTIMATE.start_main_~user~0#1.base| 0))} is VALID [2022-02-20 23:27:29,878 INFO L290 TraceCheckUtils]: 46: Hoare triple {12518#(not (= |ULTIMATE.start_main_~user~0#1.base| 0))} havoc main_#t~mem36#1.base, main_#t~mem36#1.offset;havoc main_#t~memset~res37#1.base, main_#t~memset~res37#1.offset;call main_#t~mem38#1.base, main_#t~mem38#1.offset := read~$Pointer$(main_~user~0#1.base, 8 + main_~user~0#1.offset, 4);call write~$Pointer$(main_~user~0#1.base, 8 + main_~user~0#1.offset, main_#t~mem38#1.base, 16 + main_#t~mem38#1.offset, 4);havoc main_#t~mem38#1.base, main_#t~mem38#1.offset;call main_#t~mem39#1.base, main_#t~mem39#1.offset := read~$Pointer$(main_~user~0#1.base, 8 + main_~user~0#1.offset, 4);call write~int(32, main_#t~mem39#1.base, 4 + main_#t~mem39#1.offset, 4);havoc main_#t~mem39#1.base, main_#t~mem39#1.offset;call main_#t~mem40#1.base, main_#t~mem40#1.offset := read~$Pointer$(main_~user~0#1.base, 8 + main_~user~0#1.offset, 4);call write~int(5, main_#t~mem40#1.base, 8 + main_#t~mem40#1.offset, 4);havoc main_#t~mem40#1.base, main_#t~mem40#1.offset;call main_#t~mem41#1.base, main_#t~mem41#1.offset := read~$Pointer$(main_~user~0#1.base, 8 + main_~user~0#1.offset, 4);call write~int((if 8 + main_~user~0#1.offset - main_~user~0#1.offset < 0 && 0 != (8 + main_~user~0#1.offset - main_~user~0#1.offset) % 1 then 1 + (8 + main_~user~0#1.offset - main_~user~0#1.offset) / 1 else (8 + main_~user~0#1.offset - main_~user~0#1.offset) / 1), main_#t~mem41#1.base, 20 + main_#t~mem41#1.offset, 4);havoc main_#t~mem41#1.base, main_#t~mem41#1.offset;call main_#t~mem42#1.base, main_#t~mem42#1.offset := read~$Pointer$(main_~user~0#1.base, 8 + main_~user~0#1.offset, 4);call main_#t~malloc43#1.base, main_#t~malloc43#1.offset := #Ultimate.allocOnHeap(384);call write~$Pointer$(main_#t~malloc43#1.base, main_#t~malloc43#1.offset, main_#t~mem42#1.base, main_#t~mem42#1.offset, 4);havoc main_#t~mem42#1.base, main_#t~mem42#1.offset;havoc main_#t~malloc43#1.base, main_#t~malloc43#1.offset;call main_#t~mem44#1.base, main_#t~mem44#1.offset := read~$Pointer$(main_~user~0#1.base, 8 + main_~user~0#1.offset, 4);call write~int(2685476833, main_#t~mem44#1.base, 40 + main_#t~mem44#1.offset, 4);havoc main_#t~mem44#1.base, main_#t~mem44#1.offset;call main_#t~mem45#1.base, main_#t~mem45#1.offset := read~$Pointer$(main_~user~0#1.base, 8 + main_~user~0#1.offset, 4);call main_#t~mem46#1.base, main_#t~mem46#1.offset := read~$Pointer$(main_#t~mem45#1.base, main_#t~mem45#1.offset, 4); {12518#(not (= |ULTIMATE.start_main_~user~0#1.base| 0))} is VALID [2022-02-20 23:27:29,878 INFO L290 TraceCheckUtils]: 47: Hoare triple {12518#(not (= |ULTIMATE.start_main_~user~0#1.base| 0))} assume !(main_#t~mem46#1.base == 0 && main_#t~mem46#1.offset == 0);havoc main_#t~mem45#1.base, main_#t~mem45#1.offset;havoc main_#t~mem46#1.base, main_#t~mem46#1.offset;call main_#t~mem48#1.base, main_#t~mem48#1.offset := read~$Pointer$(main_~user~0#1.base, 8 + main_~user~0#1.offset, 4);call main_#t~mem49#1.base, main_#t~mem49#1.offset := read~$Pointer$(main_#t~mem48#1.base, main_#t~mem48#1.offset, 4); {12518#(not (= |ULTIMATE.start_main_~user~0#1.base| 0))} is VALID [2022-02-20 23:27:29,878 INFO L272 TraceCheckUtils]: 48: Hoare triple {12518#(not (= |ULTIMATE.start_main_~user~0#1.base| 0))} call main_#t~memset~res50#1.base, main_#t~memset~res50#1.offset := #Ultimate.C_memset(main_#t~mem49#1.base, main_#t~mem49#1.offset, 0, 384); {12504#true} is VALID [2022-02-20 23:27:29,878 INFO L290 TraceCheckUtils]: 49: Hoare triple {12504#true} #t~loopctr276 := 0; {12504#true} is VALID [2022-02-20 23:27:29,878 INFO L290 TraceCheckUtils]: 50: Hoare triple {12504#true} assume !(#t~loopctr276 % 4294967296 < #amount % 4294967296); {12504#true} is VALID [2022-02-20 23:27:29,878 INFO L290 TraceCheckUtils]: 51: Hoare triple {12504#true} assume #res.base == #ptr.base && #res.offset == #ptr.offset; {12504#true} is VALID [2022-02-20 23:27:29,879 INFO L284 TraceCheckUtils]: 52: Hoare quadruple {12504#true} {12518#(not (= |ULTIMATE.start_main_~user~0#1.base| 0))} #905#return; {12518#(not (= |ULTIMATE.start_main_~user~0#1.base| 0))} is VALID [2022-02-20 23:27:29,880 INFO L290 TraceCheckUtils]: 53: Hoare triple {12518#(not (= |ULTIMATE.start_main_~user~0#1.base| 0))} havoc main_#t~mem48#1.base, main_#t~mem48#1.offset;havoc main_#t~mem49#1.base, main_#t~mem49#1.offset;havoc main_#t~memset~res50#1.base, main_#t~memset~res50#1.offset; {12518#(not (= |ULTIMATE.start_main_~user~0#1.base| 0))} is VALID [2022-02-20 23:27:29,880 INFO L290 TraceCheckUtils]: 54: Hoare triple {12518#(not (= |ULTIMATE.start_main_~user~0#1.base| 0))} goto; {12518#(not (= |ULTIMATE.start_main_~user~0#1.base| 0))} is VALID [2022-02-20 23:27:29,880 INFO L290 TraceCheckUtils]: 55: Hoare triple {12518#(not (= |ULTIMATE.start_main_~user~0#1.base| 0))} main_~users~0#1.base, main_~users~0#1.offset := main_~user~0#1.base, main_~user~0#1.offset; {12675#(not (= |ULTIMATE.start_main_~users~0#1.base| 0))} is VALID [2022-02-20 23:27:29,881 INFO L290 TraceCheckUtils]: 56: Hoare triple {12675#(not (= |ULTIMATE.start_main_~users~0#1.base| 0))} havoc main_~_ha_bkt~0#1;call main_#t~mem59#1.base, main_#t~mem59#1.offset := read~$Pointer$(main_~users~0#1.base, 8 + main_~users~0#1.offset, 4);call main_#t~mem60#1 := read~int(main_#t~mem59#1.base, 12 + main_#t~mem59#1.offset, 4);main_#t~post61#1 := main_#t~mem60#1;call write~int(1 + main_#t~post61#1, main_#t~mem59#1.base, 12 + main_#t~mem59#1.offset, 4);havoc main_#t~mem59#1.base, main_#t~mem59#1.offset;havoc main_#t~mem60#1;havoc main_#t~post61#1; {12675#(not (= |ULTIMATE.start_main_~users~0#1.base| 0))} is VALID [2022-02-20 23:27:29,881 INFO L290 TraceCheckUtils]: 57: Hoare triple {12675#(not (= |ULTIMATE.start_main_~users~0#1.base| 0))} call main_#t~mem62#1.base, main_#t~mem62#1.offset := read~$Pointer$(main_~users~0#1.base, 8 + main_~users~0#1.offset, 4);call main_#t~mem63#1 := read~int(main_#t~mem62#1.base, 4 + main_#t~mem62#1.offset, 4);main_~_ha_bkt~0#1 := (if 0 == main_~_ha_hashv~0#1 || 0 == main_#t~mem63#1 - 1 then 0 else (if 1 == main_#t~mem63#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~mem63#1 - 1))) else (if 1 == main_~_ha_hashv~0#1 then (if 1 == main_#t~mem63#1 - 1 || 0 == main_#t~mem63#1 - 1 then main_#t~mem63#1 - 1 else (if main_#t~mem63#1 - 1 >= 0 then (main_#t~mem63#1 - 1) % 2 else ~bitwiseAnd(main_~_ha_hashv~0#1, main_#t~mem63#1 - 1))) else ~bitwiseAnd(main_~_ha_hashv~0#1, main_#t~mem63#1 - 1))));havoc main_#t~mem62#1.base, main_#t~mem62#1.offset;havoc main_#t~mem63#1; {12675#(not (= |ULTIMATE.start_main_~users~0#1.base| 0))} is VALID [2022-02-20 23:27:29,881 INFO L290 TraceCheckUtils]: 58: Hoare triple {12675#(not (= |ULTIMATE.start_main_~users~0#1.base| 0))} goto; {12675#(not (= |ULTIMATE.start_main_~users~0#1.base| 0))} is VALID [2022-02-20 23:27:29,882 INFO L290 TraceCheckUtils]: 59: Hoare triple {12675#(not (= |ULTIMATE.start_main_~users~0#1.base| 0))} call main_#t~mem64#1.base, main_#t~mem64#1.offset := read~$Pointer$(main_~users~0#1.base, 8 + main_~users~0#1.offset, 4);call main_#t~mem65#1.base, main_#t~mem65#1.offset := read~$Pointer$(main_#t~mem64#1.base, main_#t~mem64#1.offset, 4);main_~_ha_head~0#1.base, main_~_ha_head~0#1.offset := main_#t~mem65#1.base, main_#t~mem65#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~mem64#1.base, main_#t~mem64#1.offset;havoc main_#t~mem65#1.base, main_#t~mem65#1.offset;call main_#t~mem66#1 := read~int(main_~_ha_head~0#1.base, 4 + main_~_ha_head~0#1.offset, 4);main_#t~post67#1 := main_#t~mem66#1;call write~int(1 + main_#t~post67#1, main_~_ha_head~0#1.base, 4 + main_~_ha_head~0#1.offset, 4);havoc main_#t~mem66#1;havoc main_#t~post67#1;call main_#t~mem68#1.base, main_#t~mem68#1.offset := read~$Pointer$(main_~_ha_head~0#1.base, main_~_ha_head~0#1.offset, 4);call write~$Pointer$(main_#t~mem68#1.base, main_#t~mem68#1.offset, main_~user~0#1.base, 24 + main_~user~0#1.offset, 4);havoc main_#t~mem68#1.base, main_#t~mem68#1.offset;call write~$Pointer$(0, 0, main_~user~0#1.base, 20 + main_~user~0#1.offset, 4);call main_#t~mem69#1.base, main_#t~mem69#1.offset := read~$Pointer$(main_~_ha_head~0#1.base, main_~_ha_head~0#1.offset, 4); {12675#(not (= |ULTIMATE.start_main_~users~0#1.base| 0))} is VALID [2022-02-20 23:27:29,882 INFO L290 TraceCheckUtils]: 60: Hoare triple {12675#(not (= |ULTIMATE.start_main_~users~0#1.base| 0))} assume main_#t~mem69#1.base != 0 || main_#t~mem69#1.offset != 0;havoc main_#t~mem69#1.base, main_#t~mem69#1.offset;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_~user~0#1.base, 8 + main_~user~0#1.offset, main_#t~mem70#1.base, 12 + main_#t~mem70#1.offset, 4);havoc main_#t~mem70#1.base, main_#t~mem70#1.offset; {12675#(not (= |ULTIMATE.start_main_~users~0#1.base| 0))} is VALID [2022-02-20 23:27:29,882 INFO L290 TraceCheckUtils]: 61: Hoare triple {12675#(not (= |ULTIMATE.start_main_~users~0#1.base| 0))} call write~$Pointer$(main_~user~0#1.base, 8 + main_~user~0#1.offset, main_~_ha_head~0#1.base, main_~_ha_head~0#1.offset, 4);call main_#t~mem72#1 := read~int(main_~_ha_head~0#1.base, 4 + main_~_ha_head~0#1.offset, 4);call main_#t~mem71#1 := read~int(main_~_ha_head~0#1.base, 8 + main_~_ha_head~0#1.offset, 4);main_#t~short75#1 := main_#t~mem72#1 % 4294967296 >= 10 * (1 + main_#t~mem71#1) % 4294967296; {12675#(not (= |ULTIMATE.start_main_~users~0#1.base| 0))} is VALID [2022-02-20 23:27:29,882 INFO L290 TraceCheckUtils]: 62: Hoare triple {12675#(not (= |ULTIMATE.start_main_~users~0#1.base| 0))} assume main_#t~short75#1;call main_#t~mem73#1.base, main_#t~mem73#1.offset := read~$Pointer$(main_~user~0#1.base, 8 + main_~user~0#1.offset, 4);call main_#t~mem74#1 := read~int(main_#t~mem73#1.base, 36 + main_#t~mem73#1.offset, 4);main_#t~short75#1 := 0 == main_#t~mem74#1 % 4294967296; {12675#(not (= |ULTIMATE.start_main_~users~0#1.base| 0))} is VALID [2022-02-20 23:27:29,883 INFO L290 TraceCheckUtils]: 63: Hoare triple {12675#(not (= |ULTIMATE.start_main_~users~0#1.base| 0))} assume !main_#t~short75#1;havoc main_#t~mem72#1;havoc main_#t~mem71#1;havoc main_#t~mem73#1.base, main_#t~mem73#1.offset;havoc main_#t~mem74#1;havoc main_#t~short75#1; {12675#(not (= |ULTIMATE.start_main_~users~0#1.base| 0))} is VALID [2022-02-20 23:27:29,883 INFO L290 TraceCheckUtils]: 64: Hoare triple {12675#(not (= |ULTIMATE.start_main_~users~0#1.base| 0))} goto; {12675#(not (= |ULTIMATE.start_main_~users~0#1.base| 0))} is VALID [2022-02-20 23:27:29,883 INFO L290 TraceCheckUtils]: 65: Hoare triple {12675#(not (= |ULTIMATE.start_main_~users~0#1.base| 0))} goto; {12675#(not (= |ULTIMATE.start_main_~users~0#1.base| 0))} is VALID [2022-02-20 23:27:29,884 INFO L290 TraceCheckUtils]: 66: Hoare triple {12675#(not (= |ULTIMATE.start_main_~users~0#1.base| 0))} goto; {12675#(not (= |ULTIMATE.start_main_~users~0#1.base| 0))} is VALID [2022-02-20 23:27:29,884 INFO L290 TraceCheckUtils]: 67: Hoare triple {12675#(not (= |ULTIMATE.start_main_~users~0#1.base| 0))} goto; {12675#(not (= |ULTIMATE.start_main_~users~0#1.base| 0))} is VALID [2022-02-20 23:27:29,884 INFO L290 TraceCheckUtils]: 68: Hoare triple {12675#(not (= |ULTIMATE.start_main_~users~0#1.base| 0))} call main_#t~mem3#1 := read~int(main_~#i~0#1.base, main_~#i~0#1.offset, 4);main_#t~post4#1 := main_#t~mem3#1;call write~int(1 + main_#t~post4#1, main_~#i~0#1.base, main_~#i~0#1.offset, 4);havoc main_#t~mem3#1;havoc main_#t~post4#1; {12675#(not (= |ULTIMATE.start_main_~users~0#1.base| 0))} is VALID [2022-02-20 23:27:29,885 INFO L290 TraceCheckUtils]: 69: Hoare triple {12675#(not (= |ULTIMATE.start_main_~users~0#1.base| 0))} call main_#t~mem5#1 := read~int(main_~#i~0#1.base, main_~#i~0#1.offset, 4); {12675#(not (= |ULTIMATE.start_main_~users~0#1.base| 0))} is VALID [2022-02-20 23:27:29,885 INFO L290 TraceCheckUtils]: 70: Hoare triple {12675#(not (= |ULTIMATE.start_main_~users~0#1.base| 0))} assume !(main_#t~mem5#1 < 1000);havoc main_#t~mem5#1; {12675#(not (= |ULTIMATE.start_main_~users~0#1.base| 0))} is VALID [2022-02-20 23:27:29,885 INFO L290 TraceCheckUtils]: 71: Hoare triple {12675#(not (= |ULTIMATE.start_main_~users~0#1.base| 0))} call write~int(0, main_~#i~0#1.base, main_~#i~0#1.offset, 4); {12675#(not (= |ULTIMATE.start_main_~users~0#1.base| 0))} is VALID [2022-02-20 23:27:29,886 INFO L290 TraceCheckUtils]: 72: Hoare triple {12675#(not (= |ULTIMATE.start_main_~users~0#1.base| 0))} call main_#t~mem144#1 := read~int(main_~#i~0#1.base, main_~#i~0#1.offset, 4); {12675#(not (= |ULTIMATE.start_main_~users~0#1.base| 0))} is VALID [2022-02-20 23:27:29,886 INFO L290 TraceCheckUtils]: 73: Hoare triple {12675#(not (= |ULTIMATE.start_main_~users~0#1.base| 0))} assume !!(main_#t~mem144#1 < 1000);havoc main_#t~mem144#1; {12675#(not (= |ULTIMATE.start_main_~users~0#1.base| 0))} is VALID [2022-02-20 23:27:29,886 INFO L290 TraceCheckUtils]: 74: Hoare triple {12675#(not (= |ULTIMATE.start_main_~users~0#1.base| 0))} havoc main_~_hf_hashv~0#1; {12675#(not (= |ULTIMATE.start_main_~users~0#1.base| 0))} is VALID [2022-02-20 23:27:29,887 INFO L290 TraceCheckUtils]: 75: Hoare triple {12675#(not (= |ULTIMATE.start_main_~users~0#1.base| 0))} goto; {12675#(not (= |ULTIMATE.start_main_~users~0#1.base| 0))} is VALID [2022-02-20 23:27:29,887 INFO L290 TraceCheckUtils]: 76: Hoare triple {12675#(not (= |ULTIMATE.start_main_~users~0#1.base| 0))} 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; {12675#(not (= |ULTIMATE.start_main_~users~0#1.base| 0))} is VALID [2022-02-20 23:27:29,887 INFO L290 TraceCheckUtils]: 77: Hoare triple {12675#(not (= |ULTIMATE.start_main_~users~0#1.base| 0))} assume !(main_~_hj_k~1#1 % 4294967296 >= 12); {12675#(not (= |ULTIMATE.start_main_~users~0#1.base| 0))} is VALID [2022-02-20 23:27:29,887 INFO L290 TraceCheckUtils]: 78: Hoare triple {12675#(not (= |ULTIMATE.start_main_~users~0#1.base| 0))} main_~_hf_hashv~0#1 := 4 + main_~_hf_hashv~0#1;main_#t~switch157#1 := 11 == main_~_hj_k~1#1; {12675#(not (= |ULTIMATE.start_main_~users~0#1.base| 0))} is VALID [2022-02-20 23:27:29,888 INFO L290 TraceCheckUtils]: 79: Hoare triple {12675#(not (= |ULTIMATE.start_main_~users~0#1.base| 0))} assume !main_#t~switch157#1; {12675#(not (= |ULTIMATE.start_main_~users~0#1.base| 0))} is VALID [2022-02-20 23:27:29,888 INFO L290 TraceCheckUtils]: 80: Hoare triple {12675#(not (= |ULTIMATE.start_main_~users~0#1.base| 0))} main_#t~switch157#1 := main_#t~switch157#1 || 10 == main_~_hj_k~1#1; {12675#(not (= |ULTIMATE.start_main_~users~0#1.base| 0))} is VALID [2022-02-20 23:27:29,888 INFO L290 TraceCheckUtils]: 81: Hoare triple {12675#(not (= |ULTIMATE.start_main_~users~0#1.base| 0))} assume !main_#t~switch157#1; {12675#(not (= |ULTIMATE.start_main_~users~0#1.base| 0))} is VALID [2022-02-20 23:27:29,889 INFO L290 TraceCheckUtils]: 82: Hoare triple {12675#(not (= |ULTIMATE.start_main_~users~0#1.base| 0))} main_#t~switch157#1 := main_#t~switch157#1 || 9 == main_~_hj_k~1#1; {12675#(not (= |ULTIMATE.start_main_~users~0#1.base| 0))} is VALID [2022-02-20 23:27:29,889 INFO L290 TraceCheckUtils]: 83: Hoare triple {12675#(not (= |ULTIMATE.start_main_~users~0#1.base| 0))} assume !main_#t~switch157#1; {12675#(not (= |ULTIMATE.start_main_~users~0#1.base| 0))} is VALID [2022-02-20 23:27:29,889 INFO L290 TraceCheckUtils]: 84: Hoare triple {12675#(not (= |ULTIMATE.start_main_~users~0#1.base| 0))} main_#t~switch157#1 := main_#t~switch157#1 || 8 == main_~_hj_k~1#1; {12675#(not (= |ULTIMATE.start_main_~users~0#1.base| 0))} is VALID [2022-02-20 23:27:29,890 INFO L290 TraceCheckUtils]: 85: Hoare triple {12675#(not (= |ULTIMATE.start_main_~users~0#1.base| 0))} assume !main_#t~switch157#1; {12675#(not (= |ULTIMATE.start_main_~users~0#1.base| 0))} is VALID [2022-02-20 23:27:29,890 INFO L290 TraceCheckUtils]: 86: Hoare triple {12675#(not (= |ULTIMATE.start_main_~users~0#1.base| 0))} main_#t~switch157#1 := main_#t~switch157#1 || 7 == main_~_hj_k~1#1; {12675#(not (= |ULTIMATE.start_main_~users~0#1.base| 0))} is VALID [2022-02-20 23:27:29,890 INFO L290 TraceCheckUtils]: 87: Hoare triple {12675#(not (= |ULTIMATE.start_main_~users~0#1.base| 0))} assume !main_#t~switch157#1; {12675#(not (= |ULTIMATE.start_main_~users~0#1.base| 0))} is VALID [2022-02-20 23:27:29,891 INFO L290 TraceCheckUtils]: 88: Hoare triple {12675#(not (= |ULTIMATE.start_main_~users~0#1.base| 0))} main_#t~switch157#1 := main_#t~switch157#1 || 6 == main_~_hj_k~1#1; {12675#(not (= |ULTIMATE.start_main_~users~0#1.base| 0))} is VALID [2022-02-20 23:27:29,891 INFO L290 TraceCheckUtils]: 89: Hoare triple {12675#(not (= |ULTIMATE.start_main_~users~0#1.base| 0))} assume !main_#t~switch157#1; {12675#(not (= |ULTIMATE.start_main_~users~0#1.base| 0))} is VALID [2022-02-20 23:27:29,891 INFO L290 TraceCheckUtils]: 90: Hoare triple {12675#(not (= |ULTIMATE.start_main_~users~0#1.base| 0))} main_#t~switch157#1 := main_#t~switch157#1 || 5 == main_~_hj_k~1#1; {12675#(not (= |ULTIMATE.start_main_~users~0#1.base| 0))} is VALID [2022-02-20 23:27:29,892 INFO L290 TraceCheckUtils]: 91: Hoare triple {12675#(not (= |ULTIMATE.start_main_~users~0#1.base| 0))} assume !main_#t~switch157#1; {12675#(not (= |ULTIMATE.start_main_~users~0#1.base| 0))} is VALID [2022-02-20 23:27:29,892 INFO L290 TraceCheckUtils]: 92: Hoare triple {12675#(not (= |ULTIMATE.start_main_~users~0#1.base| 0))} main_#t~switch157#1 := main_#t~switch157#1 || 4 == main_~_hj_k~1#1; {12675#(not (= |ULTIMATE.start_main_~users~0#1.base| 0))} is VALID [2022-02-20 23:27:29,892 INFO L290 TraceCheckUtils]: 93: Hoare triple {12675#(not (= |ULTIMATE.start_main_~users~0#1.base| 0))} assume main_#t~switch157#1;call main_#t~mem165#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~mem165#1 % 256);havoc main_#t~mem165#1; {12675#(not (= |ULTIMATE.start_main_~users~0#1.base| 0))} is VALID [2022-02-20 23:27:29,892 INFO L290 TraceCheckUtils]: 94: Hoare triple {12675#(not (= |ULTIMATE.start_main_~users~0#1.base| 0))} main_#t~switch157#1 := main_#t~switch157#1 || 3 == main_~_hj_k~1#1; {12675#(not (= |ULTIMATE.start_main_~users~0#1.base| 0))} is VALID [2022-02-20 23:27:29,893 INFO L290 TraceCheckUtils]: 95: Hoare triple {12675#(not (= |ULTIMATE.start_main_~users~0#1.base| 0))} assume main_#t~switch157#1;call main_#t~mem166#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~mem166#1 % 256);havoc main_#t~mem166#1; {12675#(not (= |ULTIMATE.start_main_~users~0#1.base| 0))} is VALID [2022-02-20 23:27:29,893 INFO L290 TraceCheckUtils]: 96: Hoare triple {12675#(not (= |ULTIMATE.start_main_~users~0#1.base| 0))} main_#t~switch157#1 := main_#t~switch157#1 || 2 == main_~_hj_k~1#1; {12675#(not (= |ULTIMATE.start_main_~users~0#1.base| 0))} is VALID [2022-02-20 23:27:29,893 INFO L290 TraceCheckUtils]: 97: Hoare triple {12675#(not (= |ULTIMATE.start_main_~users~0#1.base| 0))} assume main_#t~switch157#1;call main_#t~mem167#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~mem167#1 % 256);havoc main_#t~mem167#1; {12675#(not (= |ULTIMATE.start_main_~users~0#1.base| 0))} is VALID [2022-02-20 23:27:29,894 INFO L290 TraceCheckUtils]: 98: Hoare triple {12675#(not (= |ULTIMATE.start_main_~users~0#1.base| 0))} main_#t~switch157#1 := main_#t~switch157#1 || 1 == main_~_hj_k~1#1; {12675#(not (= |ULTIMATE.start_main_~users~0#1.base| 0))} is VALID [2022-02-20 23:27:29,894 INFO L290 TraceCheckUtils]: 99: Hoare triple {12675#(not (= |ULTIMATE.start_main_~users~0#1.base| 0))} assume main_#t~switch157#1;call main_#t~mem168#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~mem168#1 % 256;havoc main_#t~mem168#1; {12675#(not (= |ULTIMATE.start_main_~users~0#1.base| 0))} is VALID [2022-02-20 23:27:29,894 INFO L290 TraceCheckUtils]: 100: Hoare triple {12675#(not (= |ULTIMATE.start_main_~users~0#1.base| 0))} havoc main_#t~switch157#1; {12675#(not (= |ULTIMATE.start_main_~users~0#1.base| 0))} is VALID [2022-02-20 23:27:29,895 INFO L290 TraceCheckUtils]: 101: Hoare triple {12675#(not (= |ULTIMATE.start_main_~users~0#1.base| 0))} 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)))); {12675#(not (= |ULTIMATE.start_main_~users~0#1.base| 0))} is VALID [2022-02-20 23:27:29,895 INFO L290 TraceCheckUtils]: 102: Hoare triple {12675#(not (= |ULTIMATE.start_main_~users~0#1.base| 0))} goto; {12675#(not (= |ULTIMATE.start_main_~users~0#1.base| 0))} is VALID [2022-02-20 23:27:29,895 INFO L290 TraceCheckUtils]: 103: Hoare triple {12675#(not (= |ULTIMATE.start_main_~users~0#1.base| 0))} goto; {12675#(not (= |ULTIMATE.start_main_~users~0#1.base| 0))} is VALID [2022-02-20 23:27:29,896 INFO L290 TraceCheckUtils]: 104: Hoare triple {12675#(not (= |ULTIMATE.start_main_~users~0#1.base| 0))} goto; {12675#(not (= |ULTIMATE.start_main_~users~0#1.base| 0))} is VALID [2022-02-20 23:27:29,896 INFO L290 TraceCheckUtils]: 105: Hoare triple {12675#(not (= |ULTIMATE.start_main_~users~0#1.base| 0))} main_~tmp~0#1.base, main_~tmp~0#1.offset := 0, 0; {12675#(not (= |ULTIMATE.start_main_~users~0#1.base| 0))} is VALID [2022-02-20 23:27:29,896 INFO L290 TraceCheckUtils]: 106: Hoare triple {12675#(not (= |ULTIMATE.start_main_~users~0#1.base| 0))} assume !(main_~users~0#1.base != 0 || main_~users~0#1.offset != 0); {12505#false} is VALID [2022-02-20 23:27:29,896 INFO L290 TraceCheckUtils]: 107: Hoare triple {12505#false} goto; {12505#false} is VALID [2022-02-20 23:27:29,896 INFO L290 TraceCheckUtils]: 108: Hoare triple {12505#false} goto; {12505#false} is VALID [2022-02-20 23:27:29,896 INFO L290 TraceCheckUtils]: 109: Hoare triple {12505#false} assume !(main_~tmp~0#1.base != 0 || main_~tmp~0#1.offset != 0); {12505#false} is VALID [2022-02-20 23:27:29,897 INFO L290 TraceCheckUtils]: 110: Hoare triple {12505#false} assume !false; {12505#false} is VALID [2022-02-20 23:27:29,897 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-02-20 23:27:29,897 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 23:27:29,897 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 23:27:29,897 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1087229213] [2022-02-20 23:27:29,897 WARN L317 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-02-20 23:27:29,897 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [257784494] [2022-02-20 23:27:29,897 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [257784494] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:27:29,897 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:27:29,897 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-02-20 23:27:29,898 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [624725938] [2022-02-20 23:27:29,898 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:27:29,898 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 26.0) internal successors, (104), 4 states have internal predecessors, (104), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 111 [2022-02-20 23:27:29,898 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:27:29,898 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 26.0) internal successors, (104), 4 states have internal predecessors, (104), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-02-20 23:27:29,981 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 108 edges. 108 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:27:29,981 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-02-20 23:27:29,981 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 23:27:29,982 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-02-20 23:27:29,982 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-02-20 23:27:29,982 INFO L87 Difference]: Start difference. First operand 309 states and 370 transitions. Second operand has 4 states, 4 states have (on average 26.0) internal successors, (104), 4 states have internal predecessors, (104), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-02-20 23:27:30,897 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:27:30,898 INFO L93 Difference]: Finished difference Result 661 states and 798 transitions. [2022-02-20 23:27:30,898 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-02-20 23:27:30,898 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 26.0) internal successors, (104), 4 states have internal predecessors, (104), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 111 [2022-02-20 23:27:30,899 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:27:30,900 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 26.0) internal successors, (104), 4 states have internal predecessors, (104), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-02-20 23:27:30,907 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 592 transitions. [2022-02-20 23:27:30,907 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 26.0) internal successors, (104), 4 states have internal predecessors, (104), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-02-20 23:27:30,911 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 592 transitions. [2022-02-20 23:27:30,911 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 592 transitions. [2022-02-20 23:27:31,450 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 592 edges. 592 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:27:31,459 INFO L225 Difference]: With dead ends: 661 [2022-02-20 23:27:31,459 INFO L226 Difference]: Without dead ends: 400 [2022-02-20 23:27:31,460 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 112 GetRequests, 109 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:27:31,460 INFO L933 BasicCegarLoop]: 223 mSDtfsCounter, 410 mSDsluCounter, 152 mSDsCounter, 0 mSdLazyCounter, 79 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 410 SdHoareTripleChecker+Valid, 375 SdHoareTripleChecker+Invalid, 85 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 79 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-02-20 23:27:31,461 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [410 Valid, 375 Invalid, 85 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 79 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-02-20 23:27:31,461 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 400 states. [2022-02-20 23:27:31,525 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 400 to 393. [2022-02-20 23:27:31,525 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:27:31,526 INFO L82 GeneralOperation]: Start isEquivalent. First operand 400 states. Second operand has 393 states, 387 states have (on average 1.2093023255813953) internal successors, (468), 388 states have internal predecessors, (468), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-02-20 23:27:31,526 INFO L74 IsIncluded]: Start isIncluded. First operand 400 states. Second operand has 393 states, 387 states have (on average 1.2093023255813953) internal successors, (468), 388 states have internal predecessors, (468), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-02-20 23:27:31,527 INFO L87 Difference]: Start difference. First operand 400 states. Second operand has 393 states, 387 states have (on average 1.2093023255813953) internal successors, (468), 388 states have internal predecessors, (468), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-02-20 23:27:31,539 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:27:31,539 INFO L93 Difference]: Finished difference Result 400 states and 479 transitions. [2022-02-20 23:27:31,540 INFO L276 IsEmpty]: Start isEmpty. Operand 400 states and 479 transitions. [2022-02-20 23:27:31,540 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:27:31,540 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:27:31,541 INFO L74 IsIncluded]: Start isIncluded. First operand has 393 states, 387 states have (on average 1.2093023255813953) internal successors, (468), 388 states have internal predecessors, (468), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand 400 states. [2022-02-20 23:27:31,542 INFO L87 Difference]: Start difference. First operand has 393 states, 387 states have (on average 1.2093023255813953) internal successors, (468), 388 states have internal predecessors, (468), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand 400 states. [2022-02-20 23:27:31,553 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:27:31,553 INFO L93 Difference]: Finished difference Result 400 states and 479 transitions. [2022-02-20 23:27:31,554 INFO L276 IsEmpty]: Start isEmpty. Operand 400 states and 479 transitions. [2022-02-20 23:27:31,554 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:27:31,554 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:27:31,554 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:27:31,554 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:27:31,555 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 393 states, 387 states have (on average 1.2093023255813953) internal successors, (468), 388 states have internal predecessors, (468), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-02-20 23:27:31,567 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 393 states to 393 states and 474 transitions. [2022-02-20 23:27:31,568 INFO L78 Accepts]: Start accepts. Automaton has 393 states and 474 transitions. Word has length 111 [2022-02-20 23:27:31,568 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:27:31,568 INFO L470 AbstractCegarLoop]: Abstraction has 393 states and 474 transitions. [2022-02-20 23:27:31,568 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 26.0) internal successors, (104), 4 states have internal predecessors, (104), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-02-20 23:27:31,568 INFO L276 IsEmpty]: Start isEmpty. Operand 393 states and 474 transitions. [2022-02-20 23:27:31,569 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2022-02-20 23:27:31,569 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:27:31,569 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:27:31,599 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2022-02-20 23:27:31,795 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 23:27:31,795 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 23:27:31,796 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:27:31,796 INFO L85 PathProgramCache]: Analyzing trace with hash 473252787, now seen corresponding path program 1 times [2022-02-20 23:27:31,796 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 23:27:31,796 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1738025273] [2022-02-20 23:27:31,796 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:27:31,796 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 23:27:31,849 ERROR L252 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-02-20 23:27:31,850 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2099864399] [2022-02-20 23:27:31,855 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:27:31,855 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 23:27:31,855 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 23:27:31,856 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-02-20 23:27:31,858 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process