./Ultimate.py --spec ../sv-benchmarks/c/properties/no-overflow.prp --file ../sv-benchmarks/c/uthash-2.0.2/uthash_BER_test7-1.i --full-output -ea --architecture 32bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version 03d7b7b3 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -ea -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/uthash-2.0.2/uthash_BER_test7-1.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! overflow) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 3d4f4fa5c64db6e2d1986e03259021eba4df8a22df3a334e78927feece513264 --- Real Ultimate output --- This is Ultimate 0.2.2-dev-03d7b7b [2022-02-21 03:13:18,906 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-02-21 03:13:18,907 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-02-21 03:13:18,927 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-02-21 03:13:18,928 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-02-21 03:13:18,929 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-02-21 03:13:18,930 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-02-21 03:13:18,931 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-02-21 03:13:18,932 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-02-21 03:13:18,933 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-02-21 03:13:18,933 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-02-21 03:13:18,934 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-02-21 03:13:18,934 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-02-21 03:13:18,935 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-02-21 03:13:18,936 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-02-21 03:13:18,937 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-02-21 03:13:18,937 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-02-21 03:13:18,938 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-02-21 03:13:18,939 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-02-21 03:13:18,951 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-02-21 03:13:18,952 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-02-21 03:13:18,953 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-02-21 03:13:18,954 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-02-21 03:13:18,955 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-02-21 03:13:18,962 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-02-21 03:13:18,962 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-02-21 03:13:18,962 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-02-21 03:13:18,963 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-02-21 03:13:18,964 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-02-21 03:13:18,964 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-02-21 03:13:18,965 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-02-21 03:13:18,965 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-02-21 03:13:18,966 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-02-21 03:13:18,966 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-02-21 03:13:18,967 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-02-21 03:13:18,967 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-02-21 03:13:18,967 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-02-21 03:13:18,968 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-02-21 03:13:18,968 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-02-21 03:13:18,968 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-02-21 03:13:18,969 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-02-21 03:13:18,970 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf [2022-02-21 03:13:18,989 INFO L113 SettingsManager]: Loading preferences was successful [2022-02-21 03:13:18,990 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-02-21 03:13:18,990 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-02-21 03:13:18,990 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-02-21 03:13:18,991 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-02-21 03:13:18,991 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-02-21 03:13:18,991 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-02-21 03:13:18,993 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-02-21 03:13:18,993 INFO L138 SettingsManager]: * Use SBE=true [2022-02-21 03:13:18,993 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-02-21 03:13:18,993 INFO L138 SettingsManager]: * sizeof long=4 [2022-02-21 03:13:18,993 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-02-21 03:13:18,994 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-02-21 03:13:18,994 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-02-21 03:13:18,994 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-02-21 03:13:18,994 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-02-21 03:13:18,994 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-02-21 03:13:18,994 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-02-21 03:13:18,994 INFO L138 SettingsManager]: * Check absence of signed integer overflows=true [2022-02-21 03:13:18,995 INFO L138 SettingsManager]: * sizeof long double=12 [2022-02-21 03:13:18,995 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-02-21 03:13:18,995 INFO L138 SettingsManager]: * Use constant arrays=true [2022-02-21 03:13:18,995 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-02-21 03:13:18,995 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-02-21 03:13:18,996 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-02-21 03:13:18,996 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-02-21 03:13:18,996 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-21 03:13:18,996 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-02-21 03:13:18,996 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-02-21 03:13:18,996 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-02-21 03:13:18,997 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-02-21 03:13:18,997 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-02-21 03:13:18,997 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-02-21 03:13:18,997 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! overflow) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 3d4f4fa5c64db6e2d1986e03259021eba4df8a22df3a334e78927feece513264 [2022-02-21 03:13:19,199 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-02-21 03:13:19,227 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-02-21 03:13:19,229 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-02-21 03:13:19,229 INFO L271 PluginConnector]: Initializing CDTParser... [2022-02-21 03:13:19,230 INFO L275 PluginConnector]: CDTParser initialized [2022-02-21 03:13:19,231 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/uthash-2.0.2/uthash_BER_test7-1.i [2022-02-21 03:13:19,275 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/94682fe8d/8e5a52eec0fd4610a3e40880a859a6b9/FLAG36db84b41 [2022-02-21 03:13:19,756 INFO L306 CDTParser]: Found 1 translation units. [2022-02-21 03:13:19,756 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_BER_test7-1.i [2022-02-21 03:13:19,770 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/94682fe8d/8e5a52eec0fd4610a3e40880a859a6b9/FLAG36db84b41 [2022-02-21 03:13:20,041 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/94682fe8d/8e5a52eec0fd4610a3e40880a859a6b9 [2022-02-21 03:13:20,044 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-02-21 03:13:20,044 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-02-21 03:13:20,045 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-02-21 03:13:20,045 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-02-21 03:13:20,051 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-02-21 03:13:20,066 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.02 03:13:20" (1/1) ... [2022-02-21 03:13:20,067 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7538b979 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:13:20, skipping insertion in model container [2022-02-21 03:13:20,067 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.02 03:13:20" (1/1) ... [2022-02-21 03:13:20,072 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-02-21 03:13:20,119 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-21 03:13:20,407 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_BER_test7-1.i[33021,33034] [2022-02-21 03:13:20,530 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_BER_test7-1.i[44124,44137] [2022-02-21 03:13:20,543 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_BER_test7-1.i[44245,44258] [2022-02-21 03:13:20,548 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-21 03:13:20,556 INFO L203 MainTranslator]: Completed pre-run [2022-02-21 03:13:20,581 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_BER_test7-1.i[33021,33034] [2022-02-21 03:13:20,634 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_BER_test7-1.i[44124,44137] [2022-02-21 03:13:20,635 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_BER_test7-1.i[44245,44258] [2022-02-21 03:13:20,640 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-21 03:13:20,667 INFO L208 MainTranslator]: Completed translation [2022-02-21 03:13:20,667 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:13:20 WrapperNode [2022-02-21 03:13:20,668 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-02-21 03:13:20,668 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-02-21 03:13:20,669 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-02-21 03:13:20,669 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-02-21 03:13:20,673 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:13:20" (1/1) ... [2022-02-21 03:13:20,716 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:13:20" (1/1) ... [2022-02-21 03:13:20,803 INFO L137 Inliner]: procedures = 176, calls = 277, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 1002 [2022-02-21 03:13:20,803 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-02-21 03:13:20,804 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-02-21 03:13:20,804 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-02-21 03:13:20,804 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-02-21 03:13:20,847 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:13:20" (1/1) ... [2022-02-21 03:13:20,847 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:13:20" (1/1) ... [2022-02-21 03:13:20,852 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:13:20" (1/1) ... [2022-02-21 03:13:20,852 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:13:20" (1/1) ... [2022-02-21 03:13:20,925 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:13:20" (1/1) ... [2022-02-21 03:13:20,933 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:13:20" (1/1) ... [2022-02-21 03:13:20,946 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:13:20" (1/1) ... [2022-02-21 03:13:20,957 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-02-21 03:13:20,962 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-02-21 03:13:20,963 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-02-21 03:13:20,964 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-02-21 03:13:20,965 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:13:20" (1/1) ... [2022-02-21 03:13:20,970 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-21 03:13:20,977 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:13:20,989 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-02-21 03:13:21,006 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-02-21 03:13:21,018 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-02-21 03:13:21,018 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-02-21 03:13:21,019 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset [2022-02-21 03:13:21,019 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset [2022-02-21 03:13:21,019 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-02-21 03:13:21,019 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-02-21 03:13:21,020 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-02-21 03:13:21,020 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-02-21 03:13:21,020 INFO L130 BoogieDeclarations]: Found specification of procedure memcmp [2022-02-21 03:13:21,020 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-02-21 03:13:21,020 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-02-21 03:13:21,020 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-02-21 03:13:21,020 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-02-21 03:13:21,021 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-02-21 03:13:21,231 INFO L234 CfgBuilder]: Building ICFG [2022-02-21 03:13:21,232 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-02-21 03:13:22,836 INFO L275 CfgBuilder]: Performing block encoding [2022-02-21 03:13:22,845 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-02-21 03:13:22,846 INFO L299 CfgBuilder]: Removed 63 assume(true) statements. [2022-02-21 03:13:22,847 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.02 03:13:22 BoogieIcfgContainer [2022-02-21 03:13:22,848 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-02-21 03:13:22,849 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-02-21 03:13:22,849 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-02-21 03:13:22,851 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-02-21 03:13:22,852 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 21.02 03:13:20" (1/3) ... [2022-02-21 03:13:22,852 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@22841493 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.02 03:13:22, skipping insertion in model container [2022-02-21 03:13:22,852 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:13:20" (2/3) ... [2022-02-21 03:13:22,852 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@22841493 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.02 03:13:22, skipping insertion in model container [2022-02-21 03:13:22,853 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.02 03:13:22" (3/3) ... [2022-02-21 03:13:22,853 INFO L111 eAbstractionObserver]: Analyzing ICFG uthash_BER_test7-1.i [2022-02-21 03:13:22,857 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-02-21 03:13:22,857 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 6 error locations. [2022-02-21 03:13:22,886 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-02-21 03:13:22,890 INFO L339 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mLoopAccelerationTechnique=FAST_UPR [2022-02-21 03:13:22,891 INFO L340 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2022-02-21 03:13:22,907 INFO L276 IsEmpty]: Start isEmpty. Operand has 194 states, 183 states have (on average 1.7049180327868851) internal successors, (312), 189 states have internal predecessors, (312), 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-21 03:13:22,909 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2022-02-21 03:13:22,909 INFO L506 BasicCegarLoop]: Found error trace [2022-02-21 03:13:22,910 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2022-02-21 03:13:22,910 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2022-02-21 03:13:22,913 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:13:22,914 INFO L85 PathProgramCache]: Analyzing trace with hash 552713999, now seen corresponding path program 1 times [2022-02-21 03:13:22,919 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:13:22,920 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1132491247] [2022-02-21 03:13:22,920 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:13:22,921 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:13:22,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:13:23,054 INFO L290 TraceCheckUtils]: 0: Hoare triple {197#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); {197#true} is VALID [2022-02-21 03:13:23,055 INFO L290 TraceCheckUtils]: 1: Hoare triple {197#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_~#i~0#1.base, main_~#i~0#1.offset, main_~user~0#1.base, main_~user~0#1.offset, main_~tmp~0#1.base, main_~tmp~0#1.offset, main_~users~0#1.base, main_~users~0#1.offset;call main_~#i~0#1.base, main_~#i~0#1.offset := #Ultimate.allocOnStack(4);havoc main_~user~0#1.base, main_~user~0#1.offset;havoc main_~tmp~0#1.base, main_~tmp~0#1.offset;main_~users~0#1.base, main_~users~0#1.offset := 0, 0;call write~int(0, main_~#i~0#1.base, main_~#i~0#1.offset, 4); {197#true} is VALID [2022-02-21 03:13:23,055 INFO L290 TraceCheckUtils]: 2: Hoare triple {197#true} call main_#t~mem5#1 := read~int(main_~#i~0#1.base, main_~#i~0#1.offset, 4); {197#true} is VALID [2022-02-21 03:13:23,055 INFO L290 TraceCheckUtils]: 3: Hoare triple {197#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; {197#true} is VALID [2022-02-21 03:13:23,056 INFO L290 TraceCheckUtils]: 4: Hoare triple {197#true} assume main_~user~0#1.base == 0 && main_~user~0#1.offset == 0;assume false; {198#false} is VALID [2022-02-21 03:13:23,056 INFO L290 TraceCheckUtils]: 5: Hoare triple {198#false} 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); {198#false} is VALID [2022-02-21 03:13:23,057 INFO L290 TraceCheckUtils]: 6: Hoare triple {198#false} assume !(main_#t~mem8#1 * main_#t~mem9#1 <= 2147483647); {198#false} is VALID [2022-02-21 03:13:23,057 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-21 03:13:23,058 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 03:13:23,058 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1132491247] [2022-02-21 03:13:23,058 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1132491247] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-21 03:13:23,058 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-21 03:13:23,059 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-02-21 03:13:23,060 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1425960870] [2022-02-21 03:13:23,060 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-21 03:13:23,078 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2022-02-21 03:13:23,079 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-21 03:13:23,081 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 2 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:13:23,089 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 7 edges. 7 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:13:23,089 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-02-21 03:13:23,089 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 03:13:23,117 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-02-21 03:13:23,118 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-02-21 03:13:23,122 INFO L87 Difference]: Start difference. First operand has 194 states, 183 states have (on average 1.7049180327868851) internal successors, (312), 189 states have internal predecessors, (312), 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 3.5) internal successors, (7), 2 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:13:23,571 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:13:23,571 INFO L93 Difference]: Finished difference Result 385 states and 633 transitions. [2022-02-21 03:13:23,571 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-02-21 03:13:23,572 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2022-02-21 03:13:23,572 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-21 03:13:23,573 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:13:23,587 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 633 transitions. [2022-02-21 03:13:23,588 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:13:23,597 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 633 transitions. [2022-02-21 03:13:23,598 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states and 633 transitions. [2022-02-21 03:13:24,184 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 633 edges. 633 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:13:24,200 INFO L225 Difference]: With dead ends: 385 [2022-02-21 03:13:24,200 INFO L226 Difference]: Without dead ends: 187 [2022-02-21 03:13:24,205 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-02-21 03:13:24,208 INFO L933 BasicCegarLoop]: 248 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, 248 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-21 03:13:24,209 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 248 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-21 03:13:24,226 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 187 states. [2022-02-21 03:13:24,247 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 187 to 187. [2022-02-21 03:13:24,248 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 03:13:24,250 INFO L82 GeneralOperation]: Start isEquivalent. First operand 187 states. Second operand has 187 states, 177 states have (on average 1.3333333333333333) internal successors, (236), 182 states have internal predecessors, (236), 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-21 03:13:24,252 INFO L74 IsIncluded]: Start isIncluded. First operand 187 states. Second operand has 187 states, 177 states have (on average 1.3333333333333333) internal successors, (236), 182 states have internal predecessors, (236), 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-21 03:13:24,252 INFO L87 Difference]: Start difference. First operand 187 states. Second operand has 187 states, 177 states have (on average 1.3333333333333333) internal successors, (236), 182 states have internal predecessors, (236), 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-21 03:13:24,265 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:13:24,265 INFO L93 Difference]: Finished difference Result 187 states and 242 transitions. [2022-02-21 03:13:24,265 INFO L276 IsEmpty]: Start isEmpty. Operand 187 states and 242 transitions. [2022-02-21 03:13:24,267 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:13:24,267 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:13:24,268 INFO L74 IsIncluded]: Start isIncluded. First operand has 187 states, 177 states have (on average 1.3333333333333333) internal successors, (236), 182 states have internal predecessors, (236), 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 187 states. [2022-02-21 03:13:24,269 INFO L87 Difference]: Start difference. First operand has 187 states, 177 states have (on average 1.3333333333333333) internal successors, (236), 182 states have internal predecessors, (236), 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 187 states. [2022-02-21 03:13:24,277 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:13:24,278 INFO L93 Difference]: Finished difference Result 187 states and 242 transitions. [2022-02-21 03:13:24,278 INFO L276 IsEmpty]: Start isEmpty. Operand 187 states and 242 transitions. [2022-02-21 03:13:24,279 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:13:24,280 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:13:24,280 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 03:13:24,280 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 03:13:24,281 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 187 states, 177 states have (on average 1.3333333333333333) internal successors, (236), 182 states have internal predecessors, (236), 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-21 03:13:24,288 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 187 states to 187 states and 242 transitions. [2022-02-21 03:13:24,290 INFO L78 Accepts]: Start accepts. Automaton has 187 states and 242 transitions. Word has length 7 [2022-02-21 03:13:24,290 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-21 03:13:24,291 INFO L470 AbstractCegarLoop]: Abstraction has 187 states and 242 transitions. [2022-02-21 03:13:24,291 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:13:24,291 INFO L276 IsEmpty]: Start isEmpty. Operand 187 states and 242 transitions. [2022-02-21 03:13:24,292 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2022-02-21 03:13:24,292 INFO L506 BasicCegarLoop]: Found error trace [2022-02-21 03:13:24,292 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2022-02-21 03:13:24,293 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-02-21 03:13:24,293 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2022-02-21 03:13:24,294 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:13:24,294 INFO L85 PathProgramCache]: Analyzing trace with hash 552715921, now seen corresponding path program 1 times [2022-02-21 03:13:24,294 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:13:24,294 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [975837470] [2022-02-21 03:13:24,295 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:13:24,295 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:13:24,329 ERROR L252 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-02-21 03:13:24,329 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2141359976] [2022-02-21 03:13:24,330 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:13:24,330 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-21 03:13:24,330 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:13:24,363 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-02-21 03:13:24,391 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-02-21 03:13:24,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:13:24,504 INFO L263 TraceCheckSpWp]: Trace formula consists of 82 conjuncts, 15 conjunts are in the unsatisfiable core [2022-02-21 03:13:24,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:13:24,541 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 03:13:24,661 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 6 treesize of output 5 [2022-02-21 03:13:24,667 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-02-21 03:13:24,725 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-02-21 03:13:24,726 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-02-21 03:13:24,873 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-21 03:13:24,878 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 10 [2022-02-21 03:13:24,906 INFO L290 TraceCheckUtils]: 0: Hoare triple {1247#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); {1247#true} is VALID [2022-02-21 03:13:24,908 INFO L290 TraceCheckUtils]: 1: Hoare triple {1247#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_~#i~0#1.base, main_~#i~0#1.offset, main_~user~0#1.base, main_~user~0#1.offset, main_~tmp~0#1.base, main_~tmp~0#1.offset, main_~users~0#1.base, main_~users~0#1.offset;call main_~#i~0#1.base, main_~#i~0#1.offset := #Ultimate.allocOnStack(4);havoc main_~user~0#1.base, main_~user~0#1.offset;havoc main_~tmp~0#1.base, main_~tmp~0#1.offset;main_~users~0#1.base, main_~users~0#1.offset := 0, 0;call write~int(0, main_~#i~0#1.base, main_~#i~0#1.offset, 4); {1255#(and (= (select (select |#memory_int| |ULTIMATE.start_main_~#i~0#1.base|) |ULTIMATE.start_main_~#i~0#1.offset|) 0) (= (select |#valid| |ULTIMATE.start_main_~#i~0#1.base|) 1))} is VALID [2022-02-21 03:13:24,908 INFO L290 TraceCheckUtils]: 2: Hoare triple {1255#(and (= (select (select |#memory_int| |ULTIMATE.start_main_~#i~0#1.base|) |ULTIMATE.start_main_~#i~0#1.offset|) 0) (= (select |#valid| |ULTIMATE.start_main_~#i~0#1.base|) 1))} call main_#t~mem5#1 := read~int(main_~#i~0#1.base, main_~#i~0#1.offset, 4); {1255#(and (= (select (select |#memory_int| |ULTIMATE.start_main_~#i~0#1.base|) |ULTIMATE.start_main_~#i~0#1.offset|) 0) (= (select |#valid| |ULTIMATE.start_main_~#i~0#1.base|) 1))} is VALID [2022-02-21 03:13:24,909 INFO L290 TraceCheckUtils]: 3: Hoare triple {1255#(and (= (select (select |#memory_int| |ULTIMATE.start_main_~#i~0#1.base|) |ULTIMATE.start_main_~#i~0#1.offset|) 0) (= (select |#valid| |ULTIMATE.start_main_~#i~0#1.base|) 1))} 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; {1262#(and (= (select (select |#memory_int| |ULTIMATE.start_main_~#i~0#1.base|) |ULTIMATE.start_main_~#i~0#1.offset|) 0) (not (= |ULTIMATE.start_main_~user~0#1.base| |ULTIMATE.start_main_~#i~0#1.base|)))} is VALID [2022-02-21 03:13:24,910 INFO L290 TraceCheckUtils]: 4: Hoare triple {1262#(and (= (select (select |#memory_int| |ULTIMATE.start_main_~#i~0#1.base|) |ULTIMATE.start_main_~#i~0#1.offset|) 0) (not (= |ULTIMATE.start_main_~user~0#1.base| |ULTIMATE.start_main_~#i~0#1.base|)))} assume !(main_~user~0#1.base == 0 && main_~user~0#1.offset == 0); {1262#(and (= (select (select |#memory_int| |ULTIMATE.start_main_~#i~0#1.base|) |ULTIMATE.start_main_~#i~0#1.offset|) 0) (not (= |ULTIMATE.start_main_~user~0#1.base| |ULTIMATE.start_main_~#i~0#1.base|)))} is VALID [2022-02-21 03:13:24,911 INFO L290 TraceCheckUtils]: 5: Hoare triple {1262#(and (= (select (select |#memory_int| |ULTIMATE.start_main_~#i~0#1.base|) |ULTIMATE.start_main_~#i~0#1.offset|) 0) (not (= |ULTIMATE.start_main_~user~0#1.base| |ULTIMATE.start_main_~#i~0#1.base|)))} call main_#t~mem7#1 := read~int(main_~#i~0#1.base, main_~#i~0#1.offset, 4);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); {1269#(and (= |ULTIMATE.start_main_#t~mem9#1| 0) (= |ULTIMATE.start_main_#t~mem9#1| |ULTIMATE.start_main_#t~mem8#1|))} is VALID [2022-02-21 03:13:24,912 INFO L290 TraceCheckUtils]: 6: Hoare triple {1269#(and (= |ULTIMATE.start_main_#t~mem9#1| 0) (= |ULTIMATE.start_main_#t~mem9#1| |ULTIMATE.start_main_#t~mem8#1|))} assume !(main_#t~mem8#1 * main_#t~mem9#1 <= 2147483647); {1248#false} is VALID [2022-02-21 03:13:24,912 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-21 03:13:24,912 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-21 03:13:24,913 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 03:13:24,913 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [975837470] [2022-02-21 03:13:24,913 WARN L317 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-02-21 03:13:24,914 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2141359976] [2022-02-21 03:13:24,914 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2141359976] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-21 03:13:24,914 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-21 03:13:24,914 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-02-21 03:13:24,915 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [240674548] [2022-02-21 03:13:24,915 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-21 03:13:24,916 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 1.75) internal successors, (7), 5 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2022-02-21 03:13:24,916 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-21 03:13:24,916 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 5 states, 4 states have (on average 1.75) internal successors, (7), 5 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:13:24,923 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 7 edges. 7 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:13:24,924 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-21 03:13:24,924 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 03:13:24,925 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-21 03:13:24,925 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-02-21 03:13:24,925 INFO L87 Difference]: Start difference. First operand 187 states and 242 transitions. Second operand has 5 states, 4 states have (on average 1.75) internal successors, (7), 5 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:13:26,757 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:13:26,757 INFO L93 Difference]: Finished difference Result 306 states and 400 transitions. [2022-02-21 03:13:26,757 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-02-21 03:13:26,758 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 1.75) internal successors, (7), 5 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2022-02-21 03:13:26,758 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-21 03:13:26,758 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 4 states have (on average 1.75) internal successors, (7), 5 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:13:26,782 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 400 transitions. [2022-02-21 03:13:26,783 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 4 states have (on average 1.75) internal successors, (7), 5 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:13:26,789 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 400 transitions. [2022-02-21 03:13:26,790 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 400 transitions. [2022-02-21 03:13:27,076 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 400 edges. 400 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:13:27,086 INFO L225 Difference]: With dead ends: 306 [2022-02-21 03:13:27,086 INFO L226 Difference]: Without dead ends: 304 [2022-02-21 03:13:27,097 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-02-21 03:13:27,099 INFO L933 BasicCegarLoop]: 203 mSDtfsCounter, 188 mSDsluCounter, 519 mSDsCounter, 0 mSdLazyCounter, 285 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 188 SdHoareTripleChecker+Valid, 722 SdHoareTripleChecker+Invalid, 300 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 285 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-02-21 03:13:27,099 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [188 Valid, 722 Invalid, 300 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 285 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-02-21 03:13:27,100 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 304 states. [2022-02-21 03:13:27,110 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 304 to 193. [2022-02-21 03:13:27,110 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 03:13:27,111 INFO L82 GeneralOperation]: Start isEquivalent. First operand 304 states. Second operand has 193 states, 183 states have (on average 1.3278688524590163) internal successors, (243), 188 states have internal predecessors, (243), 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-21 03:13:27,112 INFO L74 IsIncluded]: Start isIncluded. First operand 304 states. Second operand has 193 states, 183 states have (on average 1.3278688524590163) internal successors, (243), 188 states have internal predecessors, (243), 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-21 03:13:27,112 INFO L87 Difference]: Start difference. First operand 304 states. Second operand has 193 states, 183 states have (on average 1.3278688524590163) internal successors, (243), 188 states have internal predecessors, (243), 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-21 03:13:27,121 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:13:27,122 INFO L93 Difference]: Finished difference Result 304 states and 398 transitions. [2022-02-21 03:13:27,122 INFO L276 IsEmpty]: Start isEmpty. Operand 304 states and 398 transitions. [2022-02-21 03:13:27,128 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:13:27,129 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:13:27,130 INFO L74 IsIncluded]: Start isIncluded. First operand has 193 states, 183 states have (on average 1.3278688524590163) internal successors, (243), 188 states have internal predecessors, (243), 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 304 states. [2022-02-21 03:13:27,132 INFO L87 Difference]: Start difference. First operand has 193 states, 183 states have (on average 1.3278688524590163) internal successors, (243), 188 states have internal predecessors, (243), 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 304 states. [2022-02-21 03:13:27,145 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:13:27,145 INFO L93 Difference]: Finished difference Result 304 states and 398 transitions. [2022-02-21 03:13:27,146 INFO L276 IsEmpty]: Start isEmpty. Operand 304 states and 398 transitions. [2022-02-21 03:13:27,146 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:13:27,147 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:13:27,147 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 03:13:27,149 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 03:13:27,150 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 193 states, 183 states have (on average 1.3278688524590163) internal successors, (243), 188 states have internal predecessors, (243), 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-21 03:13:27,165 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 193 states to 193 states and 249 transitions. [2022-02-21 03:13:27,165 INFO L78 Accepts]: Start accepts. Automaton has 193 states and 249 transitions. Word has length 7 [2022-02-21 03:13:27,166 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-21 03:13:27,166 INFO L470 AbstractCegarLoop]: Abstraction has 193 states and 249 transitions. [2022-02-21 03:13:27,166 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 1.75) internal successors, (7), 5 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:13:27,166 INFO L276 IsEmpty]: Start isEmpty. Operand 193 states and 249 transitions. [2022-02-21 03:13:27,167 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2022-02-21 03:13:27,167 INFO L506 BasicCegarLoop]: Found error trace [2022-02-21 03:13:27,167 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-21 03:13:27,192 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2022-02-21 03:13:27,368 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-21 03:13:27,368 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2022-02-21 03:13:27,369 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:13:27,369 INFO L85 PathProgramCache]: Analyzing trace with hash -385089840, now seen corresponding path program 1 times [2022-02-21 03:13:27,369 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:13:27,369 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1813068257] [2022-02-21 03:13:27,369 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:13:27,369 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:13:27,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:13:27,445 INFO L290 TraceCheckUtils]: 0: Hoare triple {2471#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); {2471#true} is VALID [2022-02-21 03:13:27,446 INFO L290 TraceCheckUtils]: 1: Hoare triple {2471#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_~#i~0#1.base, main_~#i~0#1.offset, main_~user~0#1.base, main_~user~0#1.offset, main_~tmp~0#1.base, main_~tmp~0#1.offset, main_~users~0#1.base, main_~users~0#1.offset;call main_~#i~0#1.base, main_~#i~0#1.offset := #Ultimate.allocOnStack(4);havoc main_~user~0#1.base, main_~user~0#1.offset;havoc main_~tmp~0#1.base, main_~tmp~0#1.offset;main_~users~0#1.base, main_~users~0#1.offset := 0, 0;call write~int(0, main_~#i~0#1.base, main_~#i~0#1.offset, 4); {2473#(= (select (select |#memory_int| |ULTIMATE.start_main_~#i~0#1.base|) |ULTIMATE.start_main_~#i~0#1.offset|) 0)} is VALID [2022-02-21 03:13:27,447 INFO L290 TraceCheckUtils]: 2: Hoare triple {2473#(= (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); {2474#(= |ULTIMATE.start_main_#t~mem5#1| 0)} is VALID [2022-02-21 03:13:27,448 INFO L290 TraceCheckUtils]: 3: Hoare triple {2474#(= |ULTIMATE.start_main_#t~mem5#1| 0)} assume !(main_#t~mem5#1 < 1000);havoc main_#t~mem5#1; {2472#false} is VALID [2022-02-21 03:13:27,448 INFO L290 TraceCheckUtils]: 4: Hoare triple {2472#false} call write~int(0, main_~#i~0#1.base, main_~#i~0#1.offset, 4); {2472#false} is VALID [2022-02-21 03:13:27,448 INFO L290 TraceCheckUtils]: 5: Hoare triple {2472#false} call main_#t~mem144#1 := read~int(main_~#i~0#1.base, main_~#i~0#1.offset, 4); {2472#false} is VALID [2022-02-21 03:13:27,449 INFO L290 TraceCheckUtils]: 6: Hoare triple {2472#false} assume !!(main_#t~mem144#1 < 1000);havoc main_#t~mem144#1; {2472#false} is VALID [2022-02-21 03:13:27,449 INFO L290 TraceCheckUtils]: 7: Hoare triple {2472#false} havoc main_~_hf_hashv~0#1; {2472#false} is VALID [2022-02-21 03:13:27,449 INFO L290 TraceCheckUtils]: 8: Hoare triple {2472#false} goto; {2472#false} is VALID [2022-02-21 03:13:27,449 INFO L290 TraceCheckUtils]: 9: Hoare triple {2472#false} havoc main_~_hj_i~1#1;havoc main_~_hj_j~1#1;havoc main_~_hj_k~1#1;main_~_hj_key~1#1.base, main_~_hj_key~1#1.offset := main_~#i~0#1.base, main_~#i~0#1.offset;main_~_hf_hashv~0#1 := 4276993775;main_~_hj_j~1#1 := 2654435769;main_~_hj_i~1#1 := main_~_hj_j~1#1;main_~_hj_k~1#1 := 4; {2472#false} is VALID [2022-02-21 03:13:27,450 INFO L290 TraceCheckUtils]: 10: Hoare triple {2472#false} assume !(main_~_hj_k~1#1 % 4294967296 >= 12); {2472#false} is VALID [2022-02-21 03:13:27,450 INFO L290 TraceCheckUtils]: 11: Hoare triple {2472#false} main_~_hf_hashv~0#1 := 4 + main_~_hf_hashv~0#1;main_#t~switch157#1 := 11 == main_~_hj_k~1#1; {2472#false} is VALID [2022-02-21 03:13:27,450 INFO L290 TraceCheckUtils]: 12: Hoare triple {2472#false} assume main_#t~switch157#1;call main_#t~mem158#1 := read~int(main_~_hj_key~1#1.base, 10 + main_~_hj_key~1#1.offset, 1);main_~_hf_hashv~0#1 := main_~_hf_hashv~0#1 + 16777216 * (main_#t~mem158#1 % 256);havoc main_#t~mem158#1; {2472#false} is VALID [2022-02-21 03:13:27,450 INFO L290 TraceCheckUtils]: 13: Hoare triple {2472#false} main_#t~switch157#1 := main_#t~switch157#1 || 10 == main_~_hj_k~1#1; {2472#false} is VALID [2022-02-21 03:13:27,450 INFO L290 TraceCheckUtils]: 14: Hoare triple {2472#false} assume !main_#t~switch157#1; {2472#false} is VALID [2022-02-21 03:13:27,451 INFO L290 TraceCheckUtils]: 15: Hoare triple {2472#false} main_#t~switch157#1 := main_#t~switch157#1 || 9 == main_~_hj_k~1#1; {2472#false} is VALID [2022-02-21 03:13:27,451 INFO L290 TraceCheckUtils]: 16: Hoare triple {2472#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; {2472#false} is VALID [2022-02-21 03:13:27,451 INFO L290 TraceCheckUtils]: 17: Hoare triple {2472#false} main_#t~switch157#1 := main_#t~switch157#1 || 8 == main_~_hj_k~1#1; {2472#false} is VALID [2022-02-21 03:13:27,451 INFO L290 TraceCheckUtils]: 18: Hoare triple {2472#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; {2472#false} is VALID [2022-02-21 03:13:27,452 INFO L290 TraceCheckUtils]: 19: Hoare triple {2472#false} main_#t~switch157#1 := main_#t~switch157#1 || 7 == main_~_hj_k~1#1; {2472#false} is VALID [2022-02-21 03:13:27,452 INFO L290 TraceCheckUtils]: 20: Hoare triple {2472#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; {2472#false} is VALID [2022-02-21 03:13:27,452 INFO L290 TraceCheckUtils]: 21: Hoare triple {2472#false} main_#t~switch157#1 := main_#t~switch157#1 || 6 == main_~_hj_k~1#1; {2472#false} is VALID [2022-02-21 03:13:27,452 INFO L290 TraceCheckUtils]: 22: Hoare triple {2472#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; {2472#false} is VALID [2022-02-21 03:13:27,453 INFO L290 TraceCheckUtils]: 23: Hoare triple {2472#false} main_#t~switch157#1 := main_#t~switch157#1 || 5 == main_~_hj_k~1#1; {2472#false} is VALID [2022-02-21 03:13:27,453 INFO L290 TraceCheckUtils]: 24: Hoare triple {2472#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; {2472#false} is VALID [2022-02-21 03:13:27,453 INFO L290 TraceCheckUtils]: 25: Hoare triple {2472#false} main_#t~switch157#1 := main_#t~switch157#1 || 4 == main_~_hj_k~1#1; {2472#false} is VALID [2022-02-21 03:13:27,453 INFO L290 TraceCheckUtils]: 26: Hoare triple {2472#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; {2472#false} is VALID [2022-02-21 03:13:27,454 INFO L290 TraceCheckUtils]: 27: Hoare triple {2472#false} main_#t~switch157#1 := main_#t~switch157#1 || 3 == main_~_hj_k~1#1; {2472#false} is VALID [2022-02-21 03:13:27,454 INFO L290 TraceCheckUtils]: 28: Hoare triple {2472#false} assume !main_#t~switch157#1; {2472#false} is VALID [2022-02-21 03:13:27,454 INFO L290 TraceCheckUtils]: 29: Hoare triple {2472#false} main_#t~switch157#1 := main_#t~switch157#1 || 2 == main_~_hj_k~1#1; {2472#false} is VALID [2022-02-21 03:13:27,454 INFO L290 TraceCheckUtils]: 30: Hoare triple {2472#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; {2472#false} is VALID [2022-02-21 03:13:27,454 INFO L290 TraceCheckUtils]: 31: Hoare triple {2472#false} main_#t~switch157#1 := main_#t~switch157#1 || 1 == main_~_hj_k~1#1; {2472#false} is VALID [2022-02-21 03:13:27,455 INFO L290 TraceCheckUtils]: 32: Hoare triple {2472#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; {2472#false} is VALID [2022-02-21 03:13:27,455 INFO L290 TraceCheckUtils]: 33: Hoare triple {2472#false} havoc main_#t~switch157#1; {2472#false} is VALID [2022-02-21 03:13:27,456 INFO L290 TraceCheckUtils]: 34: Hoare triple {2472#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)))); {2472#false} is VALID [2022-02-21 03:13:27,456 INFO L290 TraceCheckUtils]: 35: Hoare triple {2472#false} goto; {2472#false} is VALID [2022-02-21 03:13:27,456 INFO L290 TraceCheckUtils]: 36: Hoare triple {2472#false} goto; {2472#false} is VALID [2022-02-21 03:13:27,456 INFO L290 TraceCheckUtils]: 37: Hoare triple {2472#false} goto; {2472#false} is VALID [2022-02-21 03:13:27,457 INFO L290 TraceCheckUtils]: 38: Hoare triple {2472#false} main_~tmp~0#1.base, main_~tmp~0#1.offset := 0, 0; {2472#false} is VALID [2022-02-21 03:13:27,457 INFO L290 TraceCheckUtils]: 39: Hoare triple {2472#false} assume !(main_~users~0#1.base != 0 || main_~users~0#1.offset != 0); {2472#false} is VALID [2022-02-21 03:13:27,457 INFO L290 TraceCheckUtils]: 40: Hoare triple {2472#false} goto; {2472#false} is VALID [2022-02-21 03:13:27,457 INFO L290 TraceCheckUtils]: 41: Hoare triple {2472#false} goto; {2472#false} is VALID [2022-02-21 03:13:27,457 INFO L290 TraceCheckUtils]: 42: Hoare triple {2472#false} assume main_~tmp~0#1.base != 0 || main_~tmp~0#1.offset != 0; {2472#false} is VALID [2022-02-21 03:13:27,458 INFO L290 TraceCheckUtils]: 43: Hoare triple {2472#false} main_~_hd_hh_del~0#1.base, main_~_hd_hh_del~0#1.offset := main_~tmp~0#1.base, 8 + main_~tmp~0#1.offset;call main_#t~mem188#1.base, main_#t~mem188#1.offset := read~$Pointer$(main_~_hd_hh_del~0#1.base, 4 + main_~_hd_hh_del~0#1.offset, 4);main_#t~short190#1 := main_#t~mem188#1.base == 0 && main_#t~mem188#1.offset == 0; {2472#false} is VALID [2022-02-21 03:13:27,458 INFO L290 TraceCheckUtils]: 44: Hoare triple {2472#false} assume main_#t~short190#1;call main_#t~mem189#1.base, main_#t~mem189#1.offset := read~$Pointer$(main_~_hd_hh_del~0#1.base, 8 + main_~_hd_hh_del~0#1.offset, 4);main_#t~short190#1 := main_#t~mem189#1.base == 0 && main_#t~mem189#1.offset == 0; {2472#false} is VALID [2022-02-21 03:13:27,458 INFO L290 TraceCheckUtils]: 45: Hoare triple {2472#false} assume main_#t~short190#1;havoc main_#t~mem188#1.base, main_#t~mem188#1.offset;havoc main_#t~mem189#1.base, main_#t~mem189#1.offset;havoc main_#t~short190#1;call main_#t~mem191#1.base, main_#t~mem191#1.offset := read~$Pointer$(main_~users~0#1.base, 8 + main_~users~0#1.offset, 4);call main_#t~mem192#1.base, main_#t~mem192#1.offset := read~$Pointer$(main_#t~mem191#1.base, main_#t~mem191#1.offset, 4);call ULTIMATE.dealloc(main_#t~mem192#1.base, main_#t~mem192#1.offset);havoc main_#t~mem191#1.base, main_#t~mem191#1.offset;havoc main_#t~mem192#1.base, main_#t~mem192#1.offset;call main_#t~mem193#1.base, main_#t~mem193#1.offset := read~$Pointer$(main_~users~0#1.base, 8 + main_~users~0#1.offset, 4);call ULTIMATE.dealloc(main_#t~mem193#1.base, main_#t~mem193#1.offset);havoc main_#t~mem193#1.base, main_#t~mem193#1.offset;main_~users~0#1.base, main_~users~0#1.offset := 0, 0; {2472#false} is VALID [2022-02-21 03:13:27,458 INFO L290 TraceCheckUtils]: 46: Hoare triple {2472#false} goto; {2472#false} is VALID [2022-02-21 03:13:27,459 INFO L290 TraceCheckUtils]: 47: Hoare triple {2472#false} call ULTIMATE.dealloc(main_~tmp~0#1.base, main_~tmp~0#1.offset); {2472#false} is VALID [2022-02-21 03:13:27,459 INFO L290 TraceCheckUtils]: 48: Hoare triple {2472#false} call main_#t~mem142#1 := read~int(main_~#i~0#1.base, main_~#i~0#1.offset, 4);main_#t~post143#1 := main_#t~mem142#1; {2472#false} is VALID [2022-02-21 03:13:27,459 INFO L290 TraceCheckUtils]: 49: Hoare triple {2472#false} assume !(1 + main_#t~post143#1 <= 2147483647); {2472#false} is VALID [2022-02-21 03:13:27,459 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-21 03:13:27,460 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 03:13:27,460 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1813068257] [2022-02-21 03:13:27,460 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1813068257] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-21 03:13:27,460 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-21 03:13:27,460 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-02-21 03:13:27,461 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1160955549] [2022-02-21 03:13:27,461 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-21 03:13:27,461 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.5) internal successors, (50), 4 states have internal predecessors, (50), 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 50 [2022-02-21 03:13:27,462 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-21 03:13:27,462 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 12.5) internal successors, (50), 4 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:13:27,513 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 50 edges. 50 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:13:27,514 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-02-21 03:13:27,514 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 03:13:27,515 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-02-21 03:13:27,515 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-02-21 03:13:27,515 INFO L87 Difference]: Start difference. First operand 193 states and 249 transitions. Second operand has 4 states, 4 states have (on average 12.5) internal successors, (50), 4 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:13:28,813 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:13:28,814 INFO L93 Difference]: Finished difference Result 355 states and 462 transitions. [2022-02-21 03:13:28,814 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-02-21 03:13:28,814 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.5) internal successors, (50), 4 states have internal predecessors, (50), 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 50 [2022-02-21 03:13:28,814 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-21 03:13:28,814 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 12.5) internal successors, (50), 4 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:13:28,819 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 462 transitions. [2022-02-21 03:13:28,819 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 12.5) internal successors, (50), 4 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:13:28,838 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 462 transitions. [2022-02-21 03:13:28,839 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 462 transitions. [2022-02-21 03:13:29,179 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 462 edges. 462 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:13:29,183 INFO L225 Difference]: With dead ends: 355 [2022-02-21 03:13:29,183 INFO L226 Difference]: Without dead ends: 270 [2022-02-21 03:13:29,184 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-02-21 03:13:29,184 INFO L933 BasicCegarLoop]: 223 mSDtfsCounter, 99 mSDsluCounter, 384 mSDsCounter, 0 mSdLazyCounter, 142 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 99 SdHoareTripleChecker+Valid, 607 SdHoareTripleChecker+Invalid, 145 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 142 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-02-21 03:13:29,185 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [99 Valid, 607 Invalid, 145 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 142 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-02-21 03:13:29,185 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 270 states. [2022-02-21 03:13:29,196 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 270 to 193. [2022-02-21 03:13:29,196 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 03:13:29,197 INFO L82 GeneralOperation]: Start isEquivalent. First operand 270 states. Second operand has 193 states, 183 states have (on average 1.3224043715846994) internal successors, (242), 188 states have internal predecessors, (242), 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-21 03:13:29,198 INFO L74 IsIncluded]: Start isIncluded. First operand 270 states. Second operand has 193 states, 183 states have (on average 1.3224043715846994) internal successors, (242), 188 states have internal predecessors, (242), 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-21 03:13:29,198 INFO L87 Difference]: Start difference. First operand 270 states. Second operand has 193 states, 183 states have (on average 1.3224043715846994) internal successors, (242), 188 states have internal predecessors, (242), 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-21 03:13:29,203 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:13:29,203 INFO L93 Difference]: Finished difference Result 270 states and 349 transitions. [2022-02-21 03:13:29,203 INFO L276 IsEmpty]: Start isEmpty. Operand 270 states and 349 transitions. [2022-02-21 03:13:29,204 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:13:29,204 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:13:29,204 INFO L74 IsIncluded]: Start isIncluded. First operand has 193 states, 183 states have (on average 1.3224043715846994) internal successors, (242), 188 states have internal predecessors, (242), 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 270 states. [2022-02-21 03:13:29,205 INFO L87 Difference]: Start difference. First operand has 193 states, 183 states have (on average 1.3224043715846994) internal successors, (242), 188 states have internal predecessors, (242), 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 270 states. [2022-02-21 03:13:29,210 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:13:29,210 INFO L93 Difference]: Finished difference Result 270 states and 349 transitions. [2022-02-21 03:13:29,210 INFO L276 IsEmpty]: Start isEmpty. Operand 270 states and 349 transitions. [2022-02-21 03:13:29,210 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:13:29,210 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:13:29,210 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 03:13:29,210 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 03:13:29,211 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 193 states, 183 states have (on average 1.3224043715846994) internal successors, (242), 188 states have internal predecessors, (242), 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-21 03:13:29,214 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 193 states to 193 states and 248 transitions. [2022-02-21 03:13:29,215 INFO L78 Accepts]: Start accepts. Automaton has 193 states and 248 transitions. Word has length 50 [2022-02-21 03:13:29,215 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-21 03:13:29,215 INFO L470 AbstractCegarLoop]: Abstraction has 193 states and 248 transitions. [2022-02-21 03:13:29,215 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.5) internal successors, (50), 4 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:13:29,215 INFO L276 IsEmpty]: Start isEmpty. Operand 193 states and 248 transitions. [2022-02-21 03:13:29,216 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2022-02-21 03:13:29,216 INFO L506 BasicCegarLoop]: Found error trace [2022-02-21 03:13:29,216 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-21 03:13:29,216 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-02-21 03:13:29,217 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2022-02-21 03:13:29,217 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:13:29,217 INFO L85 PathProgramCache]: Analyzing trace with hash 305892652, now seen corresponding path program 1 times [2022-02-21 03:13:29,217 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:13:29,218 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1128446854] [2022-02-21 03:13:29,218 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:13:29,218 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:13:29,335 ERROR L252 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-02-21 03:13:29,336 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [330113131] [2022-02-21 03:13:29,336 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:13:29,336 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-21 03:13:29,337 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:13:29,338 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-02-21 03:13:29,339 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-02-21 03:13:29,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:13:29,789 INFO L263 TraceCheckSpWp]: Trace formula consists of 1536 conjuncts, 3 conjunts are in the unsatisfiable core [2022-02-21 03:13:29,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:13:29,825 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 03:13:29,938 INFO L290 TraceCheckUtils]: 0: Hoare triple {3659#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); {3659#true} is VALID [2022-02-21 03:13:29,938 INFO L290 TraceCheckUtils]: 1: Hoare triple {3659#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_~#i~0#1.base, main_~#i~0#1.offset, main_~user~0#1.base, main_~user~0#1.offset, main_~tmp~0#1.base, main_~tmp~0#1.offset, main_~users~0#1.base, main_~users~0#1.offset;call main_~#i~0#1.base, main_~#i~0#1.offset := #Ultimate.allocOnStack(4);havoc main_~user~0#1.base, main_~user~0#1.offset;havoc main_~tmp~0#1.base, main_~tmp~0#1.offset;main_~users~0#1.base, main_~users~0#1.offset := 0, 0;call write~int(0, main_~#i~0#1.base, main_~#i~0#1.offset, 4); {3659#true} is VALID [2022-02-21 03:13:29,939 INFO L290 TraceCheckUtils]: 2: Hoare triple {3659#true} call main_#t~mem5#1 := read~int(main_~#i~0#1.base, main_~#i~0#1.offset, 4); {3659#true} is VALID [2022-02-21 03:13:29,939 INFO L290 TraceCheckUtils]: 3: Hoare triple {3659#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; {3659#true} is VALID [2022-02-21 03:13:29,939 INFO L290 TraceCheckUtils]: 4: Hoare triple {3659#true} assume !(main_~user~0#1.base == 0 && main_~user~0#1.offset == 0); {3659#true} is VALID [2022-02-21 03:13:29,939 INFO L290 TraceCheckUtils]: 5: Hoare triple {3659#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); {3659#true} is VALID [2022-02-21 03:13:29,940 INFO L290 TraceCheckUtils]: 6: Hoare triple {3659#true} assume main_#t~mem8#1 * main_#t~mem9#1 <= 2147483647; {3659#true} is VALID [2022-02-21 03:13:29,941 INFO L290 TraceCheckUtils]: 7: Hoare triple {3659#true} assume main_#t~mem8#1 * main_#t~mem9#1 >= -2147483648;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; {3659#true} is VALID [2022-02-21 03:13:29,941 INFO L290 TraceCheckUtils]: 8: Hoare triple {3659#true} havoc main_~_ha_hashv~0#1; {3659#true} is VALID [2022-02-21 03:13:29,941 INFO L290 TraceCheckUtils]: 9: Hoare triple {3659#true} goto; {3659#true} is VALID [2022-02-21 03:13:29,942 INFO L290 TraceCheckUtils]: 10: Hoare triple {3659#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; {3659#true} is VALID [2022-02-21 03:13:29,946 INFO L290 TraceCheckUtils]: 11: Hoare triple {3659#true} assume !(main_~_hj_k~0#1 % 4294967296 >= 12); {3659#true} is VALID [2022-02-21 03:13:29,947 INFO L290 TraceCheckUtils]: 12: Hoare triple {3659#true} main_~_ha_hashv~0#1 := 4 + main_~_ha_hashv~0#1;main_#t~switch22#1 := 11 == main_~_hj_k~0#1; {3659#true} is VALID [2022-02-21 03:13:29,947 INFO L290 TraceCheckUtils]: 13: Hoare triple {3659#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; {3659#true} is VALID [2022-02-21 03:13:29,948 INFO L290 TraceCheckUtils]: 14: Hoare triple {3659#true} main_#t~switch22#1 := main_#t~switch22#1 || 10 == main_~_hj_k~0#1; {3659#true} is VALID [2022-02-21 03:13:29,952 INFO L290 TraceCheckUtils]: 15: Hoare triple {3659#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; {3659#true} is VALID [2022-02-21 03:13:29,953 INFO L290 TraceCheckUtils]: 16: Hoare triple {3659#true} main_#t~switch22#1 := main_#t~switch22#1 || 9 == main_~_hj_k~0#1; {3659#true} is VALID [2022-02-21 03:13:29,953 INFO L290 TraceCheckUtils]: 17: Hoare triple {3659#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; {3659#true} is VALID [2022-02-21 03:13:29,953 INFO L290 TraceCheckUtils]: 18: Hoare triple {3659#true} main_#t~switch22#1 := main_#t~switch22#1 || 8 == main_~_hj_k~0#1; {3659#true} is VALID [2022-02-21 03:13:29,953 INFO L290 TraceCheckUtils]: 19: Hoare triple {3659#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; {3659#true} is VALID [2022-02-21 03:13:29,953 INFO L290 TraceCheckUtils]: 20: Hoare triple {3659#true} main_#t~switch22#1 := main_#t~switch22#1 || 7 == main_~_hj_k~0#1; {3659#true} is VALID [2022-02-21 03:13:29,958 INFO L290 TraceCheckUtils]: 21: Hoare triple {3659#true} 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; {3659#true} is VALID [2022-02-21 03:13:29,959 INFO L290 TraceCheckUtils]: 22: Hoare triple {3659#true} main_#t~switch22#1 := main_#t~switch22#1 || 6 == main_~_hj_k~0#1; {3659#true} is VALID [2022-02-21 03:13:29,959 INFO L290 TraceCheckUtils]: 23: Hoare triple {3659#true} 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; {3659#true} is VALID [2022-02-21 03:13:29,959 INFO L290 TraceCheckUtils]: 24: Hoare triple {3659#true} main_#t~switch22#1 := main_#t~switch22#1 || 5 == main_~_hj_k~0#1; {3659#true} is VALID [2022-02-21 03:13:29,959 INFO L290 TraceCheckUtils]: 25: Hoare triple {3659#true} 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; {3659#true} is VALID [2022-02-21 03:13:29,959 INFO L290 TraceCheckUtils]: 26: Hoare triple {3659#true} main_#t~switch22#1 := main_#t~switch22#1 || 4 == main_~_hj_k~0#1; {3659#true} is VALID [2022-02-21 03:13:29,960 INFO L290 TraceCheckUtils]: 27: Hoare triple {3659#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; {3745#|ULTIMATE.start_main_#t~switch22#1|} is VALID [2022-02-21 03:13:29,960 INFO L290 TraceCheckUtils]: 28: Hoare triple {3745#|ULTIMATE.start_main_#t~switch22#1|} main_#t~switch22#1 := main_#t~switch22#1 || 3 == main_~_hj_k~0#1; {3745#|ULTIMATE.start_main_#t~switch22#1|} is VALID [2022-02-21 03:13:29,961 INFO L290 TraceCheckUtils]: 29: Hoare triple {3745#|ULTIMATE.start_main_#t~switch22#1|} assume !main_#t~switch22#1; {3660#false} is VALID [2022-02-21 03:13:29,962 INFO L290 TraceCheckUtils]: 30: Hoare triple {3660#false} main_#t~switch22#1 := main_#t~switch22#1 || 2 == main_~_hj_k~0#1; {3660#false} is VALID [2022-02-21 03:13:29,962 INFO L290 TraceCheckUtils]: 31: Hoare triple {3660#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; {3660#false} is VALID [2022-02-21 03:13:29,962 INFO L290 TraceCheckUtils]: 32: Hoare triple {3660#false} main_#t~switch22#1 := main_#t~switch22#1 || 1 == main_~_hj_k~0#1; {3660#false} is VALID [2022-02-21 03:13:29,962 INFO L290 TraceCheckUtils]: 33: Hoare triple {3660#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; {3660#false} is VALID [2022-02-21 03:13:29,963 INFO L290 TraceCheckUtils]: 34: Hoare triple {3660#false} havoc main_#t~switch22#1; {3660#false} is VALID [2022-02-21 03:13:29,963 INFO L290 TraceCheckUtils]: 35: Hoare triple {3660#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)))); {3660#false} is VALID [2022-02-21 03:13:29,963 INFO L290 TraceCheckUtils]: 36: Hoare triple {3660#false} goto; {3660#false} is VALID [2022-02-21 03:13:29,963 INFO L290 TraceCheckUtils]: 37: Hoare triple {3660#false} goto; {3660#false} is VALID [2022-02-21 03:13:29,964 INFO L290 TraceCheckUtils]: 38: Hoare triple {3660#false} goto; {3660#false} is VALID [2022-02-21 03:13:29,964 INFO L290 TraceCheckUtils]: 39: Hoare triple {3660#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); {3660#false} is VALID [2022-02-21 03:13:29,964 INFO L290 TraceCheckUtils]: 40: Hoare triple {3660#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; {3660#false} is VALID [2022-02-21 03:13:29,965 INFO L290 TraceCheckUtils]: 41: Hoare triple {3660#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; {3660#false} is VALID [2022-02-21 03:13:29,968 INFO L290 TraceCheckUtils]: 42: Hoare triple {3660#false} goto; {3660#false} is VALID [2022-02-21 03:13:29,968 INFO L290 TraceCheckUtils]: 43: Hoare triple {3660#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; {3660#false} is VALID [2022-02-21 03:13:29,968 INFO L290 TraceCheckUtils]: 44: Hoare triple {3660#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; {3660#false} is VALID [2022-02-21 03:13:29,968 INFO L290 TraceCheckUtils]: 45: Hoare triple {3660#false} goto; {3660#false} is VALID [2022-02-21 03:13:29,969 INFO L290 TraceCheckUtils]: 46: Hoare triple {3660#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); {3660#false} is VALID [2022-02-21 03:13:29,969 INFO L290 TraceCheckUtils]: 47: Hoare triple {3660#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; {3660#false} is VALID [2022-02-21 03:13:29,970 INFO L290 TraceCheckUtils]: 48: Hoare triple {3660#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; {3660#false} is VALID [2022-02-21 03:13:29,970 INFO L290 TraceCheckUtils]: 49: Hoare triple {3660#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; {3660#false} is VALID [2022-02-21 03:13:29,970 INFO L290 TraceCheckUtils]: 50: Hoare triple {3660#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; {3660#false} is VALID [2022-02-21 03:13:29,971 INFO L290 TraceCheckUtils]: 51: Hoare triple {3660#false} goto; {3660#false} is VALID [2022-02-21 03:13:29,972 INFO L290 TraceCheckUtils]: 52: Hoare triple {3660#false} goto; {3660#false} is VALID [2022-02-21 03:13:29,972 INFO L290 TraceCheckUtils]: 53: Hoare triple {3660#false} goto; {3660#false} is VALID [2022-02-21 03:13:29,972 INFO L290 TraceCheckUtils]: 54: Hoare triple {3660#false} goto; {3660#false} is VALID [2022-02-21 03:13:29,972 INFO L290 TraceCheckUtils]: 55: Hoare triple {3660#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; {3660#false} is VALID [2022-02-21 03:13:29,972 INFO L290 TraceCheckUtils]: 56: Hoare triple {3660#false} assume !(1 + main_#t~post4#1 <= 2147483647); {3660#false} is VALID [2022-02-21 03:13:29,973 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-21 03:13:29,973 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-21 03:13:29,973 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 03:13:29,984 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1128446854] [2022-02-21 03:13:29,984 WARN L317 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-02-21 03:13:29,984 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [330113131] [2022-02-21 03:13:29,984 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [330113131] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-21 03:13:29,984 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-21 03:13:29,984 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-21 03:13:29,985 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2036109108] [2022-02-21 03:13:29,985 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-21 03:13:29,985 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 19.0) internal successors, (57), 3 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 57 [2022-02-21 03:13:29,985 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-21 03:13:29,986 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 19.0) internal successors, (57), 3 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:13:30,028 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 57 edges. 57 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:13:30,029 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-21 03:13:30,029 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 03:13:30,030 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-21 03:13:30,030 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-21 03:13:30,030 INFO L87 Difference]: Start difference. First operand 193 states and 248 transitions. Second operand has 3 states, 3 states have (on average 19.0) internal successors, (57), 3 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:13:30,475 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:13:30,475 INFO L93 Difference]: Finished difference Result 399 states and 519 transitions. [2022-02-21 03:13:30,475 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-21 03:13:30,476 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 19.0) internal successors, (57), 3 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 57 [2022-02-21 03:13:30,476 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-21 03:13:30,476 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 19.0) internal successors, (57), 3 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:13:30,480 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 513 transitions. [2022-02-21 03:13:30,481 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 19.0) internal successors, (57), 3 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:13:30,485 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 513 transitions. [2022-02-21 03:13:30,485 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 513 transitions. [2022-02-21 03:13:30,834 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 513 edges. 513 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:13:30,837 INFO L225 Difference]: With dead ends: 399 [2022-02-21 03:13:30,837 INFO L226 Difference]: Without dead ends: 214 [2022-02-21 03:13:30,838 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 55 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-21 03:13:30,838 INFO L933 BasicCegarLoop]: 222 mSDtfsCounter, 9 mSDsluCounter, 207 mSDsCounter, 0 mSdLazyCounter, 44 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 429 SdHoareTripleChecker+Invalid, 72 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 44 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-21 03:13:30,839 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [9 Valid, 429 Invalid, 72 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 44 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-21 03:13:30,839 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 214 states. [2022-02-21 03:13:30,845 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 214 to 213. [2022-02-21 03:13:30,845 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 03:13:30,846 INFO L82 GeneralOperation]: Start isEquivalent. First operand 214 states. Second operand has 213 states, 203 states have (on average 1.29064039408867) internal successors, (262), 208 states have internal predecessors, (262), 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-21 03:13:30,846 INFO L74 IsIncluded]: Start isIncluded. First operand 214 states. Second operand has 213 states, 203 states have (on average 1.29064039408867) internal successors, (262), 208 states have internal predecessors, (262), 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-21 03:13:30,847 INFO L87 Difference]: Start difference. First operand 214 states. Second operand has 213 states, 203 states have (on average 1.29064039408867) internal successors, (262), 208 states have internal predecessors, (262), 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-21 03:13:30,850 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:13:30,850 INFO L93 Difference]: Finished difference Result 214 states and 269 transitions. [2022-02-21 03:13:30,851 INFO L276 IsEmpty]: Start isEmpty. Operand 214 states and 269 transitions. [2022-02-21 03:13:30,851 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:13:30,851 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:13:30,852 INFO L74 IsIncluded]: Start isIncluded. First operand has 213 states, 203 states have (on average 1.29064039408867) internal successors, (262), 208 states have internal predecessors, (262), 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 214 states. [2022-02-21 03:13:30,852 INFO L87 Difference]: Start difference. First operand has 213 states, 203 states have (on average 1.29064039408867) internal successors, (262), 208 states have internal predecessors, (262), 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 214 states. [2022-02-21 03:13:30,855 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:13:30,855 INFO L93 Difference]: Finished difference Result 214 states and 269 transitions. [2022-02-21 03:13:30,855 INFO L276 IsEmpty]: Start isEmpty. Operand 214 states and 269 transitions. [2022-02-21 03:13:30,856 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:13:30,856 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:13:30,856 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 03:13:30,856 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 03:13:30,857 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 213 states, 203 states have (on average 1.29064039408867) internal successors, (262), 208 states have internal predecessors, (262), 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-21 03:13:30,860 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 213 states to 213 states and 268 transitions. [2022-02-21 03:13:30,860 INFO L78 Accepts]: Start accepts. Automaton has 213 states and 268 transitions. Word has length 57 [2022-02-21 03:13:30,860 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-21 03:13:30,860 INFO L470 AbstractCegarLoop]: Abstraction has 213 states and 268 transitions. [2022-02-21 03:13:30,860 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 19.0) internal successors, (57), 3 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:13:30,861 INFO L276 IsEmpty]: Start isEmpty. Operand 213 states and 268 transitions. [2022-02-21 03:13:30,861 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2022-02-21 03:13:30,863 INFO L506 BasicCegarLoop]: Found error trace [2022-02-21 03:13:30,863 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-21 03:13:30,889 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-02-21 03:13:31,076 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable3 [2022-02-21 03:13:31,077 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2022-02-21 03:13:31,077 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:13:31,078 INFO L85 PathProgramCache]: Analyzing trace with hash 815365742, now seen corresponding path program 1 times [2022-02-21 03:13:31,078 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:13:31,078 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1836000236] [2022-02-21 03:13:31,079 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:13:31,079 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:13:31,188 ERROR L252 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-02-21 03:13:31,191 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [709778871] [2022-02-21 03:13:31,191 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:13:31,192 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-21 03:13:31,192 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:13:31,193 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-02-21 03:13:31,194 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-02-21 03:13:31,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:13:31,688 INFO L263 TraceCheckSpWp]: Trace formula consists of 1538 conjuncts, 3 conjunts are in the unsatisfiable core [2022-02-21 03:13:31,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:13:31,715 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 03:13:31,839 INFO L290 TraceCheckUtils]: 0: Hoare triple {4970#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); {4970#true} is VALID [2022-02-21 03:13:31,839 INFO L290 TraceCheckUtils]: 1: Hoare triple {4970#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_~#i~0#1.base, main_~#i~0#1.offset, main_~user~0#1.base, main_~user~0#1.offset, main_~tmp~0#1.base, main_~tmp~0#1.offset, main_~users~0#1.base, main_~users~0#1.offset;call main_~#i~0#1.base, main_~#i~0#1.offset := #Ultimate.allocOnStack(4);havoc main_~user~0#1.base, main_~user~0#1.offset;havoc main_~tmp~0#1.base, main_~tmp~0#1.offset;main_~users~0#1.base, main_~users~0#1.offset := 0, 0;call write~int(0, main_~#i~0#1.base, main_~#i~0#1.offset, 4); {4970#true} is VALID [2022-02-21 03:13:31,839 INFO L290 TraceCheckUtils]: 2: Hoare triple {4970#true} call main_#t~mem5#1 := read~int(main_~#i~0#1.base, main_~#i~0#1.offset, 4); {4970#true} is VALID [2022-02-21 03:13:31,839 INFO L290 TraceCheckUtils]: 3: Hoare triple {4970#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; {4970#true} is VALID [2022-02-21 03:13:31,840 INFO L290 TraceCheckUtils]: 4: Hoare triple {4970#true} assume !(main_~user~0#1.base == 0 && main_~user~0#1.offset == 0); {4970#true} is VALID [2022-02-21 03:13:31,840 INFO L290 TraceCheckUtils]: 5: Hoare triple {4970#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); {4970#true} is VALID [2022-02-21 03:13:31,840 INFO L290 TraceCheckUtils]: 6: Hoare triple {4970#true} assume main_#t~mem8#1 * main_#t~mem9#1 <= 2147483647; {4970#true} is VALID [2022-02-21 03:13:31,840 INFO L290 TraceCheckUtils]: 7: Hoare triple {4970#true} assume main_#t~mem8#1 * main_#t~mem9#1 >= -2147483648;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; {4970#true} is VALID [2022-02-21 03:13:31,840 INFO L290 TraceCheckUtils]: 8: Hoare triple {4970#true} havoc main_~_ha_hashv~0#1; {4970#true} is VALID [2022-02-21 03:13:31,840 INFO L290 TraceCheckUtils]: 9: Hoare triple {4970#true} goto; {4970#true} is VALID [2022-02-21 03:13:31,845 INFO L290 TraceCheckUtils]: 10: Hoare triple {4970#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; {5005#(<= |ULTIMATE.start_main_~_hj_k~0#1| 4)} is VALID [2022-02-21 03:13:31,846 INFO L290 TraceCheckUtils]: 11: Hoare triple {5005#(<= |ULTIMATE.start_main_~_hj_k~0#1| 4)} assume !(main_~_hj_k~0#1 % 4294967296 >= 12); {5005#(<= |ULTIMATE.start_main_~_hj_k~0#1| 4)} is VALID [2022-02-21 03:13:31,846 INFO L290 TraceCheckUtils]: 12: Hoare triple {5005#(<= |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; {5012#(not |ULTIMATE.start_main_#t~switch22#1|)} is VALID [2022-02-21 03:13:31,846 INFO L290 TraceCheckUtils]: 13: Hoare triple {5012#(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; {4971#false} is VALID [2022-02-21 03:13:31,846 INFO L290 TraceCheckUtils]: 14: Hoare triple {4971#false} main_#t~switch22#1 := main_#t~switch22#1 || 10 == main_~_hj_k~0#1; {4971#false} is VALID [2022-02-21 03:13:31,847 INFO L290 TraceCheckUtils]: 15: Hoare triple {4971#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; {4971#false} is VALID [2022-02-21 03:13:31,847 INFO L290 TraceCheckUtils]: 16: Hoare triple {4971#false} main_#t~switch22#1 := main_#t~switch22#1 || 9 == main_~_hj_k~0#1; {4971#false} is VALID [2022-02-21 03:13:31,847 INFO L290 TraceCheckUtils]: 17: Hoare triple {4971#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; {4971#false} is VALID [2022-02-21 03:13:31,847 INFO L290 TraceCheckUtils]: 18: Hoare triple {4971#false} main_#t~switch22#1 := main_#t~switch22#1 || 8 == main_~_hj_k~0#1; {4971#false} is VALID [2022-02-21 03:13:31,847 INFO L290 TraceCheckUtils]: 19: Hoare triple {4971#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; {4971#false} is VALID [2022-02-21 03:13:31,847 INFO L290 TraceCheckUtils]: 20: Hoare triple {4971#false} main_#t~switch22#1 := main_#t~switch22#1 || 7 == main_~_hj_k~0#1; {4971#false} is VALID [2022-02-21 03:13:31,847 INFO L290 TraceCheckUtils]: 21: Hoare triple {4971#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; {4971#false} is VALID [2022-02-21 03:13:31,848 INFO L290 TraceCheckUtils]: 22: Hoare triple {4971#false} main_#t~switch22#1 := main_#t~switch22#1 || 6 == main_~_hj_k~0#1; {4971#false} is VALID [2022-02-21 03:13:31,848 INFO L290 TraceCheckUtils]: 23: Hoare triple {4971#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; {4971#false} is VALID [2022-02-21 03:13:31,848 INFO L290 TraceCheckUtils]: 24: Hoare triple {4971#false} main_#t~switch22#1 := main_#t~switch22#1 || 5 == main_~_hj_k~0#1; {4971#false} is VALID [2022-02-21 03:13:31,848 INFO L290 TraceCheckUtils]: 25: Hoare triple {4971#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; {4971#false} is VALID [2022-02-21 03:13:31,848 INFO L290 TraceCheckUtils]: 26: Hoare triple {4971#false} main_#t~switch22#1 := main_#t~switch22#1 || 4 == main_~_hj_k~0#1; {4971#false} is VALID [2022-02-21 03:13:31,848 INFO L290 TraceCheckUtils]: 27: Hoare triple {4971#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; {4971#false} is VALID [2022-02-21 03:13:31,848 INFO L290 TraceCheckUtils]: 28: Hoare triple {4971#false} main_#t~switch22#1 := main_#t~switch22#1 || 3 == main_~_hj_k~0#1; {4971#false} is VALID [2022-02-21 03:13:31,849 INFO L290 TraceCheckUtils]: 29: Hoare triple {4971#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; {4971#false} is VALID [2022-02-21 03:13:31,849 INFO L290 TraceCheckUtils]: 30: Hoare triple {4971#false} main_#t~switch22#1 := main_#t~switch22#1 || 2 == main_~_hj_k~0#1; {4971#false} is VALID [2022-02-21 03:13:31,849 INFO L290 TraceCheckUtils]: 31: Hoare triple {4971#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; {4971#false} is VALID [2022-02-21 03:13:31,849 INFO L290 TraceCheckUtils]: 32: Hoare triple {4971#false} main_#t~switch22#1 := main_#t~switch22#1 || 1 == main_~_hj_k~0#1; {4971#false} is VALID [2022-02-21 03:13:31,849 INFO L290 TraceCheckUtils]: 33: Hoare triple {4971#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; {4971#false} is VALID [2022-02-21 03:13:31,849 INFO L290 TraceCheckUtils]: 34: Hoare triple {4971#false} havoc main_#t~switch22#1; {4971#false} is VALID [2022-02-21 03:13:31,849 INFO L290 TraceCheckUtils]: 35: Hoare triple {4971#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)))); {4971#false} is VALID [2022-02-21 03:13:31,850 INFO L290 TraceCheckUtils]: 36: Hoare triple {4971#false} goto; {4971#false} is VALID [2022-02-21 03:13:31,850 INFO L290 TraceCheckUtils]: 37: Hoare triple {4971#false} goto; {4971#false} is VALID [2022-02-21 03:13:31,850 INFO L290 TraceCheckUtils]: 38: Hoare triple {4971#false} goto; {4971#false} is VALID [2022-02-21 03:13:31,850 INFO L290 TraceCheckUtils]: 39: Hoare triple {4971#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); {4971#false} is VALID [2022-02-21 03:13:31,850 INFO L290 TraceCheckUtils]: 40: Hoare triple {4971#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; {4971#false} is VALID [2022-02-21 03:13:31,850 INFO L290 TraceCheckUtils]: 41: Hoare triple {4971#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; {4971#false} is VALID [2022-02-21 03:13:31,851 INFO L290 TraceCheckUtils]: 42: Hoare triple {4971#false} goto; {4971#false} is VALID [2022-02-21 03:13:31,851 INFO L290 TraceCheckUtils]: 43: Hoare triple {4971#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; {4971#false} is VALID [2022-02-21 03:13:31,851 INFO L290 TraceCheckUtils]: 44: Hoare triple {4971#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; {4971#false} is VALID [2022-02-21 03:13:31,851 INFO L290 TraceCheckUtils]: 45: Hoare triple {4971#false} goto; {4971#false} is VALID [2022-02-21 03:13:31,851 INFO L290 TraceCheckUtils]: 46: Hoare triple {4971#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); {4971#false} is VALID [2022-02-21 03:13:31,851 INFO L290 TraceCheckUtils]: 47: Hoare triple {4971#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; {4971#false} is VALID [2022-02-21 03:13:31,851 INFO L290 TraceCheckUtils]: 48: Hoare triple {4971#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; {4971#false} is VALID [2022-02-21 03:13:31,852 INFO L290 TraceCheckUtils]: 49: Hoare triple {4971#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; {4971#false} is VALID [2022-02-21 03:13:31,852 INFO L290 TraceCheckUtils]: 50: Hoare triple {4971#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; {4971#false} is VALID [2022-02-21 03:13:31,852 INFO L290 TraceCheckUtils]: 51: Hoare triple {4971#false} goto; {4971#false} is VALID [2022-02-21 03:13:31,852 INFO L290 TraceCheckUtils]: 52: Hoare triple {4971#false} goto; {4971#false} is VALID [2022-02-21 03:13:31,852 INFO L290 TraceCheckUtils]: 53: Hoare triple {4971#false} goto; {4971#false} is VALID [2022-02-21 03:13:31,852 INFO L290 TraceCheckUtils]: 54: Hoare triple {4971#false} goto; {4971#false} is VALID [2022-02-21 03:13:31,852 INFO L290 TraceCheckUtils]: 55: Hoare triple {4971#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; {4971#false} is VALID [2022-02-21 03:13:31,853 INFO L290 TraceCheckUtils]: 56: Hoare triple {4971#false} assume !(1 + main_#t~post4#1 <= 2147483647); {4971#false} is VALID [2022-02-21 03:13:31,853 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-21 03:13:31,853 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-21 03:13:31,853 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 03:13:31,853 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1836000236] [2022-02-21 03:13:31,853 WARN L317 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-02-21 03:13:31,854 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [709778871] [2022-02-21 03:13:31,854 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [709778871] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-21 03:13:31,854 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-21 03:13:31,854 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-02-21 03:13:31,854 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [544452566] [2022-02-21 03:13:31,854 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-21 03:13:31,855 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 14.25) internal successors, (57), 4 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 57 [2022-02-21 03:13:31,856 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-21 03:13:31,856 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 14.25) internal successors, (57), 4 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:13:31,895 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 57 edges. 57 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:13:31,896 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-02-21 03:13:31,896 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 03:13:31,896 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-02-21 03:13:31,896 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-02-21 03:13:31,896 INFO L87 Difference]: Start difference. First operand 213 states and 268 transitions. Second operand has 4 states, 4 states have (on average 14.25) internal successors, (57), 4 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:13:32,458 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:13:32,459 INFO L93 Difference]: Finished difference Result 408 states and 518 transitions. [2022-02-21 03:13:32,459 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-02-21 03:13:32,459 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 14.25) internal successors, (57), 4 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 57 [2022-02-21 03:13:32,459 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-21 03:13:32,459 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 14.25) internal successors, (57), 4 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:13:32,462 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 495 transitions. [2022-02-21 03:13:32,462 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 14.25) internal successors, (57), 4 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:13:32,465 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 495 transitions. [2022-02-21 03:13:32,465 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 495 transitions. [2022-02-21 03:13:32,874 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 495 edges. 495 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:13:32,876 INFO L225 Difference]: With dead ends: 408 [2022-02-21 03:13:32,876 INFO L226 Difference]: Without dead ends: 203 [2022-02-21 03:13:32,877 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 54 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-02-21 03:13:32,877 INFO L933 BasicCegarLoop]: 224 mSDtfsCounter, 220 mSDsluCounter, 229 mSDsCounter, 0 mSdLazyCounter, 42 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 223 SdHoareTripleChecker+Valid, 453 SdHoareTripleChecker+Invalid, 66 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 42 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-21 03:13:32,878 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [223 Valid, 453 Invalid, 66 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 42 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-21 03:13:32,878 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 203 states. [2022-02-21 03:13:32,906 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 203 to 199. [2022-02-21 03:13:32,906 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 03:13:32,907 INFO L82 GeneralOperation]: Start isEquivalent. First operand 203 states. Second operand has 199 states, 189 states have (on average 1.2751322751322751) internal successors, (241), 194 states have internal predecessors, (241), 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-21 03:13:32,907 INFO L74 IsIncluded]: Start isIncluded. First operand 203 states. Second operand has 199 states, 189 states have (on average 1.2751322751322751) internal successors, (241), 194 states have internal predecessors, (241), 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-21 03:13:32,908 INFO L87 Difference]: Start difference. First operand 203 states. Second operand has 199 states, 189 states have (on average 1.2751322751322751) internal successors, (241), 194 states have internal predecessors, (241), 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-21 03:13:32,911 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:13:32,912 INFO L93 Difference]: Finished difference Result 203 states and 251 transitions. [2022-02-21 03:13:32,912 INFO L276 IsEmpty]: Start isEmpty. Operand 203 states and 251 transitions. [2022-02-21 03:13:32,912 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:13:32,912 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:13:32,913 INFO L74 IsIncluded]: Start isIncluded. First operand has 199 states, 189 states have (on average 1.2751322751322751) internal successors, (241), 194 states have internal predecessors, (241), 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 203 states. [2022-02-21 03:13:32,913 INFO L87 Difference]: Start difference. First operand has 199 states, 189 states have (on average 1.2751322751322751) internal successors, (241), 194 states have internal predecessors, (241), 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 203 states. [2022-02-21 03:13:32,916 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:13:32,917 INFO L93 Difference]: Finished difference Result 203 states and 251 transitions. [2022-02-21 03:13:32,917 INFO L276 IsEmpty]: Start isEmpty. Operand 203 states and 251 transitions. [2022-02-21 03:13:32,917 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:13:32,918 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:13:32,918 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 03:13:32,918 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 03:13:32,918 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 199 states, 189 states have (on average 1.2751322751322751) internal successors, (241), 194 states have internal predecessors, (241), 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-21 03:13:32,921 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 199 states to 199 states and 247 transitions. [2022-02-21 03:13:32,921 INFO L78 Accepts]: Start accepts. Automaton has 199 states and 247 transitions. Word has length 57 [2022-02-21 03:13:32,923 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-21 03:13:32,923 INFO L470 AbstractCegarLoop]: Abstraction has 199 states and 247 transitions. [2022-02-21 03:13:32,923 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.25) internal successors, (57), 4 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:13:32,923 INFO L276 IsEmpty]: Start isEmpty. Operand 199 states and 247 transitions. [2022-02-21 03:13:32,924 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2022-02-21 03:13:32,924 INFO L506 BasicCegarLoop]: Found error trace [2022-02-21 03:13:32,924 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-21 03:13:32,943 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-02-21 03:13:33,143 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-21 03:13:33,143 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2022-02-21 03:13:33,144 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:13:33,144 INFO L85 PathProgramCache]: Analyzing trace with hash -1455665376, now seen corresponding path program 1 times [2022-02-21 03:13:33,144 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:13:33,144 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1062720668] [2022-02-21 03:13:33,144 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:13:33,144 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:13:33,236 ERROR L252 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-02-21 03:13:33,239 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1355980573] [2022-02-21 03:13:33,239 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:13:33,239 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-21 03:13:33,239 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:13:33,240 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-02-21 03:13:33,255 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-02-21 03:13:33,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:13:33,879 INFO L263 TraceCheckSpWp]: Trace formula consists of 1524 conjuncts, 5 conjunts are in the unsatisfiable core [2022-02-21 03:13:33,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:13:33,935 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 03:13:34,195 INFO L290 TraceCheckUtils]: 0: Hoare triple {6260#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); {6260#true} is VALID [2022-02-21 03:13:34,196 INFO L290 TraceCheckUtils]: 1: Hoare triple {6260#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_~#i~0#1.base, main_~#i~0#1.offset, main_~user~0#1.base, main_~user~0#1.offset, main_~tmp~0#1.base, main_~tmp~0#1.offset, main_~users~0#1.base, main_~users~0#1.offset;call main_~#i~0#1.base, main_~#i~0#1.offset := #Ultimate.allocOnStack(4);havoc main_~user~0#1.base, main_~user~0#1.offset;havoc main_~tmp~0#1.base, main_~tmp~0#1.offset;main_~users~0#1.base, main_~users~0#1.offset := 0, 0;call write~int(0, main_~#i~0#1.base, main_~#i~0#1.offset, 4); {6268#(and (= |ULTIMATE.start_main_~users~0#1.offset| 0) (= |ULTIMATE.start_main_~users~0#1.base| 0))} is VALID [2022-02-21 03:13:34,197 INFO L290 TraceCheckUtils]: 2: Hoare triple {6268#(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); {6268#(and (= |ULTIMATE.start_main_~users~0#1.offset| 0) (= |ULTIMATE.start_main_~users~0#1.base| 0))} is VALID [2022-02-21 03:13:34,200 INFO L290 TraceCheckUtils]: 3: Hoare triple {6268#(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; {6268#(and (= |ULTIMATE.start_main_~users~0#1.offset| 0) (= |ULTIMATE.start_main_~users~0#1.base| 0))} is VALID [2022-02-21 03:13:34,200 INFO L290 TraceCheckUtils]: 4: Hoare triple {6268#(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); {6268#(and (= |ULTIMATE.start_main_~users~0#1.offset| 0) (= |ULTIMATE.start_main_~users~0#1.base| 0))} is VALID [2022-02-21 03:13:34,201 INFO L290 TraceCheckUtils]: 5: Hoare triple {6268#(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); {6268#(and (= |ULTIMATE.start_main_~users~0#1.offset| 0) (= |ULTIMATE.start_main_~users~0#1.base| 0))} is VALID [2022-02-21 03:13:34,201 INFO L290 TraceCheckUtils]: 6: Hoare triple {6268#(and (= |ULTIMATE.start_main_~users~0#1.offset| 0) (= |ULTIMATE.start_main_~users~0#1.base| 0))} assume main_#t~mem8#1 * main_#t~mem9#1 <= 2147483647; {6268#(and (= |ULTIMATE.start_main_~users~0#1.offset| 0) (= |ULTIMATE.start_main_~users~0#1.base| 0))} is VALID [2022-02-21 03:13:34,202 INFO L290 TraceCheckUtils]: 7: Hoare triple {6268#(and (= |ULTIMATE.start_main_~users~0#1.offset| 0) (= |ULTIMATE.start_main_~users~0#1.base| 0))} assume main_#t~mem8#1 * main_#t~mem9#1 >= -2147483648;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; {6268#(and (= |ULTIMATE.start_main_~users~0#1.offset| 0) (= |ULTIMATE.start_main_~users~0#1.base| 0))} is VALID [2022-02-21 03:13:34,202 INFO L290 TraceCheckUtils]: 8: Hoare triple {6268#(and (= |ULTIMATE.start_main_~users~0#1.offset| 0) (= |ULTIMATE.start_main_~users~0#1.base| 0))} havoc main_~_ha_hashv~0#1; {6268#(and (= |ULTIMATE.start_main_~users~0#1.offset| 0) (= |ULTIMATE.start_main_~users~0#1.base| 0))} is VALID [2022-02-21 03:13:34,203 INFO L290 TraceCheckUtils]: 9: Hoare triple {6268#(and (= |ULTIMATE.start_main_~users~0#1.offset| 0) (= |ULTIMATE.start_main_~users~0#1.base| 0))} goto; {6268#(and (= |ULTIMATE.start_main_~users~0#1.offset| 0) (= |ULTIMATE.start_main_~users~0#1.base| 0))} is VALID [2022-02-21 03:13:34,203 INFO L290 TraceCheckUtils]: 10: Hoare triple {6268#(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; {6268#(and (= |ULTIMATE.start_main_~users~0#1.offset| 0) (= |ULTIMATE.start_main_~users~0#1.base| 0))} is VALID [2022-02-21 03:13:34,204 INFO L290 TraceCheckUtils]: 11: Hoare triple {6268#(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); {6268#(and (= |ULTIMATE.start_main_~users~0#1.offset| 0) (= |ULTIMATE.start_main_~users~0#1.base| 0))} is VALID [2022-02-21 03:13:34,204 INFO L290 TraceCheckUtils]: 12: Hoare triple {6268#(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; {6268#(and (= |ULTIMATE.start_main_~users~0#1.offset| 0) (= |ULTIMATE.start_main_~users~0#1.base| 0))} is VALID [2022-02-21 03:13:34,205 INFO L290 TraceCheckUtils]: 13: Hoare triple {6268#(and (= |ULTIMATE.start_main_~users~0#1.offset| 0) (= |ULTIMATE.start_main_~users~0#1.base| 0))} assume !main_#t~switch22#1; {6268#(and (= |ULTIMATE.start_main_~users~0#1.offset| 0) (= |ULTIMATE.start_main_~users~0#1.base| 0))} is VALID [2022-02-21 03:13:34,206 INFO L290 TraceCheckUtils]: 14: Hoare triple {6268#(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; {6268#(and (= |ULTIMATE.start_main_~users~0#1.offset| 0) (= |ULTIMATE.start_main_~users~0#1.base| 0))} is VALID [2022-02-21 03:13:34,206 INFO L290 TraceCheckUtils]: 15: Hoare triple {6268#(and (= |ULTIMATE.start_main_~users~0#1.offset| 0) (= |ULTIMATE.start_main_~users~0#1.base| 0))} assume !main_#t~switch22#1; {6268#(and (= |ULTIMATE.start_main_~users~0#1.offset| 0) (= |ULTIMATE.start_main_~users~0#1.base| 0))} is VALID [2022-02-21 03:13:34,207 INFO L290 TraceCheckUtils]: 16: Hoare triple {6268#(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; {6268#(and (= |ULTIMATE.start_main_~users~0#1.offset| 0) (= |ULTIMATE.start_main_~users~0#1.base| 0))} is VALID [2022-02-21 03:13:34,207 INFO L290 TraceCheckUtils]: 17: Hoare triple {6268#(and (= |ULTIMATE.start_main_~users~0#1.offset| 0) (= |ULTIMATE.start_main_~users~0#1.base| 0))} assume !main_#t~switch22#1; {6268#(and (= |ULTIMATE.start_main_~users~0#1.offset| 0) (= |ULTIMATE.start_main_~users~0#1.base| 0))} is VALID [2022-02-21 03:13:34,208 INFO L290 TraceCheckUtils]: 18: Hoare triple {6268#(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; {6268#(and (= |ULTIMATE.start_main_~users~0#1.offset| 0) (= |ULTIMATE.start_main_~users~0#1.base| 0))} is VALID [2022-02-21 03:13:34,208 INFO L290 TraceCheckUtils]: 19: Hoare triple {6268#(and (= |ULTIMATE.start_main_~users~0#1.offset| 0) (= |ULTIMATE.start_main_~users~0#1.base| 0))} assume !main_#t~switch22#1; {6268#(and (= |ULTIMATE.start_main_~users~0#1.offset| 0) (= |ULTIMATE.start_main_~users~0#1.base| 0))} is VALID [2022-02-21 03:13:34,208 INFO L290 TraceCheckUtils]: 20: Hoare triple {6268#(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; {6268#(and (= |ULTIMATE.start_main_~users~0#1.offset| 0) (= |ULTIMATE.start_main_~users~0#1.base| 0))} is VALID [2022-02-21 03:13:34,209 INFO L290 TraceCheckUtils]: 21: Hoare triple {6268#(and (= |ULTIMATE.start_main_~users~0#1.offset| 0) (= |ULTIMATE.start_main_~users~0#1.base| 0))} assume !main_#t~switch22#1; {6268#(and (= |ULTIMATE.start_main_~users~0#1.offset| 0) (= |ULTIMATE.start_main_~users~0#1.base| 0))} is VALID [2022-02-21 03:13:34,209 INFO L290 TraceCheckUtils]: 22: Hoare triple {6268#(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; {6268#(and (= |ULTIMATE.start_main_~users~0#1.offset| 0) (= |ULTIMATE.start_main_~users~0#1.base| 0))} is VALID [2022-02-21 03:13:34,209 INFO L290 TraceCheckUtils]: 23: Hoare triple {6268#(and (= |ULTIMATE.start_main_~users~0#1.offset| 0) (= |ULTIMATE.start_main_~users~0#1.base| 0))} assume !main_#t~switch22#1; {6268#(and (= |ULTIMATE.start_main_~users~0#1.offset| 0) (= |ULTIMATE.start_main_~users~0#1.base| 0))} is VALID [2022-02-21 03:13:34,210 INFO L290 TraceCheckUtils]: 24: Hoare triple {6268#(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; {6268#(and (= |ULTIMATE.start_main_~users~0#1.offset| 0) (= |ULTIMATE.start_main_~users~0#1.base| 0))} is VALID [2022-02-21 03:13:34,211 INFO L290 TraceCheckUtils]: 25: Hoare triple {6268#(and (= |ULTIMATE.start_main_~users~0#1.offset| 0) (= |ULTIMATE.start_main_~users~0#1.base| 0))} assume !main_#t~switch22#1; {6268#(and (= |ULTIMATE.start_main_~users~0#1.offset| 0) (= |ULTIMATE.start_main_~users~0#1.base| 0))} is VALID [2022-02-21 03:13:34,214 INFO L290 TraceCheckUtils]: 26: Hoare triple {6268#(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; {6268#(and (= |ULTIMATE.start_main_~users~0#1.offset| 0) (= |ULTIMATE.start_main_~users~0#1.base| 0))} is VALID [2022-02-21 03:13:34,215 INFO L290 TraceCheckUtils]: 27: Hoare triple {6268#(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; {6268#(and (= |ULTIMATE.start_main_~users~0#1.offset| 0) (= |ULTIMATE.start_main_~users~0#1.base| 0))} is VALID [2022-02-21 03:13:34,215 INFO L290 TraceCheckUtils]: 28: Hoare triple {6268#(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; {6268#(and (= |ULTIMATE.start_main_~users~0#1.offset| 0) (= |ULTIMATE.start_main_~users~0#1.base| 0))} is VALID [2022-02-21 03:13:34,216 INFO L290 TraceCheckUtils]: 29: Hoare triple {6268#(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; {6268#(and (= |ULTIMATE.start_main_~users~0#1.offset| 0) (= |ULTIMATE.start_main_~users~0#1.base| 0))} is VALID [2022-02-21 03:13:34,216 INFO L290 TraceCheckUtils]: 30: Hoare triple {6268#(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; {6268#(and (= |ULTIMATE.start_main_~users~0#1.offset| 0) (= |ULTIMATE.start_main_~users~0#1.base| 0))} is VALID [2022-02-21 03:13:34,217 INFO L290 TraceCheckUtils]: 31: Hoare triple {6268#(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; {6268#(and (= |ULTIMATE.start_main_~users~0#1.offset| 0) (= |ULTIMATE.start_main_~users~0#1.base| 0))} is VALID [2022-02-21 03:13:34,217 INFO L290 TraceCheckUtils]: 32: Hoare triple {6268#(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; {6268#(and (= |ULTIMATE.start_main_~users~0#1.offset| 0) (= |ULTIMATE.start_main_~users~0#1.base| 0))} is VALID [2022-02-21 03:13:34,218 INFO L290 TraceCheckUtils]: 33: Hoare triple {6268#(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; {6268#(and (= |ULTIMATE.start_main_~users~0#1.offset| 0) (= |ULTIMATE.start_main_~users~0#1.base| 0))} is VALID [2022-02-21 03:13:34,218 INFO L290 TraceCheckUtils]: 34: Hoare triple {6268#(and (= |ULTIMATE.start_main_~users~0#1.offset| 0) (= |ULTIMATE.start_main_~users~0#1.base| 0))} havoc main_#t~switch22#1; {6268#(and (= |ULTIMATE.start_main_~users~0#1.offset| 0) (= |ULTIMATE.start_main_~users~0#1.base| 0))} is VALID [2022-02-21 03:13:34,220 INFO L290 TraceCheckUtils]: 35: Hoare triple {6268#(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)))); {6268#(and (= |ULTIMATE.start_main_~users~0#1.offset| 0) (= |ULTIMATE.start_main_~users~0#1.base| 0))} is VALID [2022-02-21 03:13:34,220 INFO L290 TraceCheckUtils]: 36: Hoare triple {6268#(and (= |ULTIMATE.start_main_~users~0#1.offset| 0) (= |ULTIMATE.start_main_~users~0#1.base| 0))} goto; {6268#(and (= |ULTIMATE.start_main_~users~0#1.offset| 0) (= |ULTIMATE.start_main_~users~0#1.base| 0))} is VALID [2022-02-21 03:13:34,220 INFO L290 TraceCheckUtils]: 37: Hoare triple {6268#(and (= |ULTIMATE.start_main_~users~0#1.offset| 0) (= |ULTIMATE.start_main_~users~0#1.base| 0))} goto; {6268#(and (= |ULTIMATE.start_main_~users~0#1.offset| 0) (= |ULTIMATE.start_main_~users~0#1.base| 0))} is VALID [2022-02-21 03:13:34,221 INFO L290 TraceCheckUtils]: 38: Hoare triple {6268#(and (= |ULTIMATE.start_main_~users~0#1.offset| 0) (= |ULTIMATE.start_main_~users~0#1.base| 0))} goto; {6268#(and (= |ULTIMATE.start_main_~users~0#1.offset| 0) (= |ULTIMATE.start_main_~users~0#1.base| 0))} is VALID [2022-02-21 03:13:34,222 INFO L290 TraceCheckUtils]: 39: Hoare triple {6268#(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); {6268#(and (= |ULTIMATE.start_main_~users~0#1.offset| 0) (= |ULTIMATE.start_main_~users~0#1.base| 0))} is VALID [2022-02-21 03:13:34,222 INFO L290 TraceCheckUtils]: 40: Hoare triple {6268#(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; {6261#false} is VALID [2022-02-21 03:13:34,222 INFO L290 TraceCheckUtils]: 41: Hoare triple {6261#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; {6261#false} is VALID [2022-02-21 03:13:34,222 INFO L290 TraceCheckUtils]: 42: Hoare triple {6261#false} goto; {6261#false} is VALID [2022-02-21 03:13:34,223 INFO L290 TraceCheckUtils]: 43: Hoare triple {6261#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; {6261#false} is VALID [2022-02-21 03:13:34,223 INFO L290 TraceCheckUtils]: 44: Hoare triple {6261#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; {6261#false} is VALID [2022-02-21 03:13:34,223 INFO L290 TraceCheckUtils]: 45: Hoare triple {6261#false} goto; {6261#false} is VALID [2022-02-21 03:13:34,223 INFO L290 TraceCheckUtils]: 46: Hoare triple {6261#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); {6261#false} is VALID [2022-02-21 03:13:34,223 INFO L290 TraceCheckUtils]: 47: Hoare triple {6261#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; {6261#false} is VALID [2022-02-21 03:13:34,223 INFO L290 TraceCheckUtils]: 48: Hoare triple {6261#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; {6261#false} is VALID [2022-02-21 03:13:34,223 INFO L290 TraceCheckUtils]: 49: Hoare triple {6261#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; {6261#false} is VALID [2022-02-21 03:13:34,224 INFO L290 TraceCheckUtils]: 50: Hoare triple {6261#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; {6261#false} is VALID [2022-02-21 03:13:34,224 INFO L290 TraceCheckUtils]: 51: Hoare triple {6261#false} goto; {6261#false} is VALID [2022-02-21 03:13:34,224 INFO L290 TraceCheckUtils]: 52: Hoare triple {6261#false} goto; {6261#false} is VALID [2022-02-21 03:13:34,224 INFO L290 TraceCheckUtils]: 53: Hoare triple {6261#false} goto; {6261#false} is VALID [2022-02-21 03:13:34,225 INFO L290 TraceCheckUtils]: 54: Hoare triple {6261#false} goto; {6261#false} is VALID [2022-02-21 03:13:34,225 INFO L290 TraceCheckUtils]: 55: Hoare triple {6261#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; {6261#false} is VALID [2022-02-21 03:13:34,225 INFO L290 TraceCheckUtils]: 56: Hoare triple {6261#false} assume !(1 + main_#t~post4#1 <= 2147483647); {6261#false} is VALID [2022-02-21 03:13:34,225 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-21 03:13:34,225 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-21 03:13:34,226 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 03:13:34,226 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1062720668] [2022-02-21 03:13:34,226 WARN L317 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-02-21 03:13:34,226 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1355980573] [2022-02-21 03:13:34,226 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1355980573] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-21 03:13:34,227 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-21 03:13:34,228 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-21 03:13:34,228 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [321359878] [2022-02-21 03:13:34,228 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-21 03:13:34,229 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 19.0) internal successors, (57), 3 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 57 [2022-02-21 03:13:34,229 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-21 03:13:34,230 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 19.0) internal successors, (57), 3 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:13:34,300 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 57 edges. 57 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:13:34,300 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-21 03:13:34,300 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 03:13:34,301 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-21 03:13:34,302 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-21 03:13:34,302 INFO L87 Difference]: Start difference. First operand 199 states and 247 transitions. Second operand has 3 states, 3 states have (on average 19.0) internal successors, (57), 3 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:13:34,948 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:13:34,948 INFO L93 Difference]: Finished difference Result 499 states and 622 transitions. [2022-02-21 03:13:34,948 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-21 03:13:34,949 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 19.0) internal successors, (57), 3 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 57 [2022-02-21 03:13:34,949 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-21 03:13:34,949 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 19.0) internal successors, (57), 3 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:13:34,953 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 604 transitions. [2022-02-21 03:13:34,953 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 19.0) internal successors, (57), 3 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:13:34,957 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 604 transitions. [2022-02-21 03:13:34,958 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 604 transitions. [2022-02-21 03:13:35,464 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 604 edges. 604 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:13:35,468 INFO L225 Difference]: With dead ends: 499 [2022-02-21 03:13:35,468 INFO L226 Difference]: Without dead ends: 308 [2022-02-21 03:13:35,469 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 55 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-21 03:13:35,471 INFO L933 BasicCegarLoop]: 275 mSDtfsCounter, 99 mSDsluCounter, 204 mSDsCounter, 0 mSdLazyCounter, 29 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 101 SdHoareTripleChecker+Valid, 479 SdHoareTripleChecker+Invalid, 34 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 29 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-21 03:13:35,471 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [101 Valid, 479 Invalid, 34 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 29 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-21 03:13:35,472 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 308 states. [2022-02-21 03:13:35,492 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 308 to 305. [2022-02-21 03:13:35,492 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 03:13:35,493 INFO L82 GeneralOperation]: Start isEquivalent. First operand 308 states. Second operand has 305 states, 295 states have (on average 1.2677966101694915) internal successors, (374), 300 states have internal predecessors, (374), 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-21 03:13:35,493 INFO L74 IsIncluded]: Start isIncluded. First operand 308 states. Second operand has 305 states, 295 states have (on average 1.2677966101694915) internal successors, (374), 300 states have internal predecessors, (374), 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-21 03:13:35,494 INFO L87 Difference]: Start difference. First operand 308 states. Second operand has 305 states, 295 states have (on average 1.2677966101694915) internal successors, (374), 300 states have internal predecessors, (374), 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-21 03:13:35,498 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:13:35,498 INFO L93 Difference]: Finished difference Result 308 states and 381 transitions. [2022-02-21 03:13:35,499 INFO L276 IsEmpty]: Start isEmpty. Operand 308 states and 381 transitions. [2022-02-21 03:13:35,499 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:13:35,499 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:13:35,500 INFO L74 IsIncluded]: Start isIncluded. First operand has 305 states, 295 states have (on average 1.2677966101694915) internal successors, (374), 300 states have internal predecessors, (374), 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 308 states. [2022-02-21 03:13:35,500 INFO L87 Difference]: Start difference. First operand has 305 states, 295 states have (on average 1.2677966101694915) internal successors, (374), 300 states have internal predecessors, (374), 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 308 states. [2022-02-21 03:13:35,505 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:13:35,505 INFO L93 Difference]: Finished difference Result 308 states and 381 transitions. [2022-02-21 03:13:35,505 INFO L276 IsEmpty]: Start isEmpty. Operand 308 states and 381 transitions. [2022-02-21 03:13:35,505 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:13:35,506 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:13:35,506 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 03:13:35,506 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 03:13:35,506 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 305 states, 295 states have (on average 1.2677966101694915) internal successors, (374), 300 states have internal predecessors, (374), 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-21 03:13:35,511 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 305 states to 305 states and 380 transitions. [2022-02-21 03:13:35,511 INFO L78 Accepts]: Start accepts. Automaton has 305 states and 380 transitions. Word has length 57 [2022-02-21 03:13:35,511 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-21 03:13:35,511 INFO L470 AbstractCegarLoop]: Abstraction has 305 states and 380 transitions. [2022-02-21 03:13:35,511 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 19.0) internal successors, (57), 3 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:13:35,512 INFO L276 IsEmpty]: Start isEmpty. Operand 305 states and 380 transitions. [2022-02-21 03:13:35,513 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2022-02-21 03:13:35,513 INFO L506 BasicCegarLoop]: Found error trace [2022-02-21 03:13:35,513 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-21 03:13:35,536 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2022-02-21 03:13:35,732 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-21 03:13:35,732 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2022-02-21 03:13:35,733 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:13:35,733 INFO L85 PathProgramCache]: Analyzing trace with hash 984432562, now seen corresponding path program 1 times [2022-02-21 03:13:35,733 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:13:35,733 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1270805178] [2022-02-21 03:13:35,733 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:13:35,733 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:13:35,785 ERROR L252 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-02-21 03:13:35,793 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1472686597] [2022-02-21 03:13:35,793 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:13:35,793 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-21 03:13:35,793 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:13:35,807 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-02-21 03:13:35,808 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-02-21 03:13:36,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:13:36,242 INFO L263 TraceCheckSpWp]: Trace formula consists of 661 conjuncts, 161 conjunts are in the unsatisfiable core [2022-02-21 03:13:36,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:13:36,285 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 03:13:36,338 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-02-21 03:13:36,344 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 6 treesize of output 5 [2022-02-21 03:13:36,395 INFO L356 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-02-21 03:13:36,395 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2022-02-21 03:13:36,461 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-02-21 03:13:36,510 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-02-21 03:13:37,145 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-02-21 03:13:37,178 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-02-21 03:13:37,233 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-02-21 03:13:37,244 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-02-21 03:13:37,256 INFO L356 Elim1Store]: treesize reduction 8, result has 72.4 percent of original size [2022-02-21 03:13:37,257 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 22 treesize of output 30 [2022-02-21 03:13:37,484 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3