/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -tc config/AutomizerReach.xml -s config/svcomp-Reach-64bit-Automizer_Default.epf -i ../sv-benchmarks/c/aws-c-common/aws_hash_table_clear_harness.i -------------------------------------------------------------------------------- This is Ultimate 0.2.1-bitabs-dcfa08f [2020-12-23 14:14:19,920 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-12-23 14:14:19,923 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-12-23 14:14:19,962 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-12-23 14:14:19,963 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-12-23 14:14:19,964 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-12-23 14:14:19,966 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-12-23 14:14:19,968 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-12-23 14:14:19,971 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-12-23 14:14:19,972 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-12-23 14:14:19,973 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-12-23 14:14:19,974 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-12-23 14:14:19,975 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-12-23 14:14:19,976 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-12-23 14:14:19,978 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-12-23 14:14:19,979 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-12-23 14:14:20,003 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-12-23 14:14:20,004 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-12-23 14:14:20,009 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-12-23 14:14:20,011 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-12-23 14:14:20,013 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-12-23 14:14:20,014 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-12-23 14:14:20,016 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-12-23 14:14:20,017 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-12-23 14:14:20,020 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-12-23 14:14:20,021 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-12-23 14:14:20,021 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-12-23 14:14:20,022 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-12-23 14:14:20,023 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-12-23 14:14:20,024 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-12-23 14:14:20,024 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-12-23 14:14:20,025 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-12-23 14:14:20,026 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-12-23 14:14:20,027 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-12-23 14:14:20,028 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-12-23 14:14:20,029 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-12-23 14:14:20,030 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-12-23 14:14:20,030 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-12-23 14:14:20,030 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-12-23 14:14:20,031 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-12-23 14:14:20,032 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-12-23 14:14:20,034 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2020-12-23 14:14:20,064 INFO L113 SettingsManager]: Loading preferences was successful [2020-12-23 14:14:20,064 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-12-23 14:14:20,066 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-12-23 14:14:20,067 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-12-23 14:14:20,067 INFO L138 SettingsManager]: * Use SBE=true [2020-12-23 14:14:20,067 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-12-23 14:14:20,068 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-12-23 14:14:20,068 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-12-23 14:14:20,068 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-12-23 14:14:20,069 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-12-23 14:14:20,069 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-12-23 14:14:20,069 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-12-23 14:14:20,070 INFO L138 SettingsManager]: * Use constant arrays=true [2020-12-23 14:14:20,070 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-12-23 14:14:20,070 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-12-23 14:14:20,071 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-12-23 14:14:20,071 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-12-23 14:14:20,071 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-12-23 14:14:20,072 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-12-23 14:14:20,072 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-12-23 14:14:20,073 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-12-23 14:14:20,073 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-12-23 14:14:20,073 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-12-23 14:14:20,074 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-12-23 14:14:20,074 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-12-23 14:14:20,074 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-bitabs/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 [2020-12-23 14:14:20,473 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-12-23 14:14:20,506 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-12-23 14:14:20,510 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-12-23 14:14:20,511 INFO L271 PluginConnector]: Initializing CDTParser... [2020-12-23 14:14:20,512 INFO L275 PluginConnector]: CDTParser initialized [2020-12-23 14:14:20,513 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/aws-c-common/aws_hash_table_clear_harness.i [2020-12-23 14:14:20,599 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/data/e97be4ea0/fe2efb4605704813b93ed2cf1e2a7122/FLAG1f53beb07 [2020-12-23 14:14:21,746 INFO L306 CDTParser]: Found 1 translation units. [2020-12-23 14:14:21,747 INFO L160 CDTParser]: Scanning /storage/repos/ultimate-bitabs/releaseScripts/default/sv-benchmarks/c/aws-c-common/aws_hash_table_clear_harness.i [2020-12-23 14:14:21,804 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/data/e97be4ea0/fe2efb4605704813b93ed2cf1e2a7122/FLAG1f53beb07 [2020-12-23 14:14:22,101 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/data/e97be4ea0/fe2efb4605704813b93ed2cf1e2a7122 [2020-12-23 14:14:22,105 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-12-23 14:14:22,107 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2020-12-23 14:14:22,109 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-12-23 14:14:22,110 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-12-23 14:14:22,120 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-12-23 14:14:22,121 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.12 02:14:22" (1/1) ... [2020-12-23 14:14:22,125 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@536df623 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 02:14:22, skipping insertion in model container [2020-12-23 14:14:22,126 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.12 02:14:22" (1/1) ... [2020-12-23 14:14:22,135 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-12-23 14:14:22,340 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-12-23 14:14:22,709 WARN L226 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-bitabs/releaseScripts/default/sv-benchmarks/c/aws-c-common/aws_hash_table_clear_harness.i[4494,4507] [2020-12-23 14:14:22,719 WARN L226 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-bitabs/releaseScripts/default/sv-benchmarks/c/aws-c-common/aws_hash_table_clear_harness.i[4554,4567] [2020-12-23 14:14:22,751 WARN L612 FunctionHandler]: implicit declaration of function __builtin_uaddl_overflow [2020-12-23 14:14:22,760 WARN L612 FunctionHandler]: implicit declaration of function __builtin_umull_overflow left hand side expression in assignment: lhs: VariableLHS[~i~0,] left hand side expression in assignment: address: IdentifierExpression[~r,] left hand side expression in assignment: address: IdentifierExpression[~r,] left hand side expression in assignment: address: IdentifierExpression[~r,] left hand side expression in assignment: address: IdentifierExpression[~r,] left hand side expression in assignment: address: IdentifierExpression[~result,] left hand side expression in assignment: address: IdentifierExpression[~result,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~list,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[20],StructAccessExpression[IdentifierExpression[~list,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~list,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[8],StructAccessExpression[IdentifierExpression[~list,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~list,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[16],StructAccessExpression[IdentifierExpression[~list,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~list,],base],StructAccessExpression[IdentifierExpression[~list,],offset]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~list,],base],StructAccessExpression[IdentifierExpression[~list,],offset]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~list,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[16],StructAccessExpression[IdentifierExpression[~list,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~list,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[12],StructAccessExpression[IdentifierExpression[~list,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~list,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[20],StructAccessExpression[IdentifierExpression[~list,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~list,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[12],StructAccessExpression[IdentifierExpression[~list,],offset]]]] [2020-12-23 14:14:24,263 WARN L1512 CHandler]: Possible shadowing of function index [2020-12-23 14:14:24,265 WARN L1512 CHandler]: Possible shadowing of function index [2020-12-23 14:14:24,266 WARN L1512 CHandler]: Possible shadowing of function index [2020-12-23 14:14:24,267 WARN L1512 CHandler]: Possible shadowing of function index [2020-12-23 14:14:24,268 WARN L1512 CHandler]: Possible shadowing of function index left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~list,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[12],StructAccessExpression[IdentifierExpression[~list,],offset]]]] left hand side expression in assignment: address: IdentifierExpression[~list_a,] left hand side expression in assignment: address: IdentifierExpression[~list_b,] [2020-12-23 14:14:24,290 WARN L1512 CHandler]: Possible shadowing of function index [2020-12-23 14:14:24,291 WARN L1512 CHandler]: Possible shadowing of function index [2020-12-23 14:14:24,294 WARN L1512 CHandler]: Possible shadowing of function index [2020-12-23 14:14:24,295 WARN L1512 CHandler]: Possible shadowing of function index left hand side expression in assignment: address: IdentifierExpression[~val,] [2020-12-23 14:14:24,298 WARN L1512 CHandler]: Possible shadowing of function index [2020-12-23 14:14:24,300 WARN L1512 CHandler]: Possible shadowing of function index [2020-12-23 14:14:24,301 WARN L1512 CHandler]: Possible shadowing of function index [2020-12-23 14:14:24,302 WARN L1512 CHandler]: Possible shadowing of function index left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~ret_storage~0,],base],StructAccessExpression[IdentifierExpression[~ret_storage~0,],offset]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~ret_storage~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[1],StructAccessExpression[IdentifierExpression[~ret_storage~0,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~ret_storage~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[2],StructAccessExpression[IdentifierExpression[~ret_storage~0,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~ret_storage~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[3],StructAccessExpression[IdentifierExpression[~ret_storage~0,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~ret_storage~1,],base],StructAccessExpression[IdentifierExpression[~ret_storage~1,],offset]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~ret_storage~1,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[1],StructAccessExpression[IdentifierExpression[~ret_storage~1,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~ret_storage~1,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[2],StructAccessExpression[IdentifierExpression[~ret_storage~1,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~ret_storage~1,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[3],StructAccessExpression[IdentifierExpression[~ret_storage~1,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~ret_storage~1,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[4],StructAccessExpression[IdentifierExpression[~ret_storage~1,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~ret_storage~1,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[5],StructAccessExpression[IdentifierExpression[~ret_storage~1,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~ret_storage~1,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[6],StructAccessExpression[IdentifierExpression[~ret_storage~1,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~ret_storage~1,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[7],StructAccessExpression[IdentifierExpression[~ret_storage~1,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~head_reaches_tail~0,] left hand side expression in assignment: lhs: VariableLHS[~temp~0,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~list,],base],StructAccessExpression[IdentifierExpression[~list,],offset]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~list,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[8],StructAccessExpression[IdentifierExpression[~list,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~list,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[24],StructAccessExpression[IdentifierExpression[~list,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~list,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[16],StructAccessExpression[IdentifierExpression[~list,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~to_add,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[8],StructAccessExpression[IdentifierExpression[~to_add,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~to_add,],base],StructAccessExpression[IdentifierExpression[~to_add,],offset]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem332,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[8],StructAccessExpression[IdentifierExpression[#t~mem332,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~after,],base],StructAccessExpression[IdentifierExpression[~after,],offset]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem343,],base],StructAccessExpression[IdentifierExpression[#t~mem343,],offset]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem344,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[8],StructAccessExpression[IdentifierExpression[#t~mem344,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[StructAccessExpression[IdentifierExpression[~tmp~1,],prev],base],StructAccessExpression[StructAccessExpression[IdentifierExpression[~tmp~1,],prev],offset]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[StructAccessExpression[IdentifierExpression[~tmp~1,],next],base],BinaryExpression[ARITHPLUS,IntegerLiteral[8],StructAccessExpression[StructAccessExpression[IdentifierExpression[~tmp~1,],next],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~tmp~1,] left hand side expression in assignment: address: IdentifierExpression[~a,] left hand side expression in assignment: address: IdentifierExpression[~b,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~to_add,],base],StructAccessExpression[IdentifierExpression[~to_add,],offset]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~to_add,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[8],StructAccessExpression[IdentifierExpression[~to_add,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem355,],base],StructAccessExpression[IdentifierExpression[#t~mem355,],offset]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~before,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[8],StructAccessExpression[IdentifierExpression[~before,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem362,],base],StructAccessExpression[IdentifierExpression[#t~mem362,],offset]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem364,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[8],StructAccessExpression[IdentifierExpression[#t~mem364,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~a,],base],StructAccessExpression[IdentifierExpression[~a,],offset]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem408,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[8],StructAccessExpression[IdentifierExpression[#t~mem408,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~a,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[24],StructAccessExpression[IdentifierExpression[~a,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem410,],base],StructAccessExpression[IdentifierExpression[#t~mem410,],offset]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~b,],base],StructAccessExpression[IdentifierExpression[~b,],offset]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem411,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[8],StructAccessExpression[IdentifierExpression[#t~mem411,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~b,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[24],StructAccessExpression[IdentifierExpression[~b,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem412,],base],StructAccessExpression[IdentifierExpression[#t~mem412,],offset]]] left hand side expression in assignment: address: IdentifierExpression[~var,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~var,],base],StructAccessExpression[IdentifierExpression[~var,],offset]]] [2020-12-23 14:14:25,205 WARN L612 FunctionHandler]: implicit declaration of function __atomic_load_n [2020-12-23 14:14:25,208 WARN L612 FunctionHandler]: implicit declaration of function __atomic_store_n [2020-12-23 14:14:25,210 WARN L612 FunctionHandler]: implicit declaration of function __atomic_exchange_n [2020-12-23 14:14:25,212 WARN L612 FunctionHandler]: implicit declaration of function __atomic_compare_exchange_n [2020-12-23 14:14:25,215 WARN L612 FunctionHandler]: implicit declaration of function __atomic_fetch_add [2020-12-23 14:14:25,216 WARN L612 FunctionHandler]: implicit declaration of function __atomic_fetch_sub [2020-12-23 14:14:25,217 WARN L612 FunctionHandler]: implicit declaration of function __atomic_fetch_or [2020-12-23 14:14:25,231 WARN L612 FunctionHandler]: implicit declaration of function __atomic_fetch_and [2020-12-23 14:14:25,232 WARN L612 FunctionHandler]: implicit declaration of function __atomic_fetch_xor [2020-12-23 14:14:25,232 WARN L612 FunctionHandler]: implicit declaration of function __atomic_thread_fence left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~buf,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[16],StructAccessExpression[IdentifierExpression[~buf,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~buf,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[4],StructAccessExpression[IdentifierExpression[~buf,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~ring_buf,],base],StructAccessExpression[IdentifierExpression[~ring_buf,],offset]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~ring_buf,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[8],StructAccessExpression[IdentifierExpression[~ring_buf,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~ring_buf,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[32],StructAccessExpression[IdentifierExpression[~ring_buf,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~buf,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[4],StructAccessExpression[IdentifierExpression[~buf,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~buf,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[16],StructAccessExpression[IdentifierExpression[~buf,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~cursor,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[4],StructAccessExpression[IdentifierExpression[~cursor,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~list,],base],StructAccessExpression[IdentifierExpression[~list,],offset]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~list,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[20],StructAccessExpression[IdentifierExpression[~list,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~list,],base],StructAccessExpression[IdentifierExpression[~list,],offset]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~list,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[8],StructAccessExpression[IdentifierExpression[~list,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~list,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[16],StructAccessExpression[IdentifierExpression[~list,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~curr~0,],base],StructAccessExpression[IdentifierExpression[~curr~0,],offset]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~node~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[8],StructAccessExpression[IdentifierExpression[~node~0,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~curr~0,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~curr~0,],base],StructAccessExpression[IdentifierExpression[~curr~0,],offset]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~list,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[24],StructAccessExpression[IdentifierExpression[~list,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~queue,],base],StructAccessExpression[IdentifierExpression[~queue,],offset]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~impl~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[40],StructAccessExpression[IdentifierExpression[~impl~0,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~map,],base],StructAccessExpression[IdentifierExpression[~map,],offset]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem539,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[16],StructAccessExpression[IdentifierExpression[#t~mem539,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem542,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[24],StructAccessExpression[IdentifierExpression[#t~mem542,],offset]]]] left hand side expression in assignment: address: IdentifierExpression[~rval,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~str~0,],base],StructAccessExpression[IdentifierExpression[~str~0,],offset]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~str~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[8],StructAccessExpression[IdentifierExpression[~str~0,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~str~0,],base],BinaryExpression[ARITHPLUS,BinaryExpression[ARITHPLUS,IntegerLiteral[12],StructAccessExpression[IdentifierExpression[~str~0,],offset]],BinaryExpression[ARITHMOD,IdentifierExpression[~len,],IntegerLiteral[4294967296]]]]] [2020-12-23 14:14:25,587 WARN L612 FunctionHandler]: implicit declaration of function __builtin_va_copy left hand side expression in assignment: lhs: VariableLHS[~allocation~0,] left hand side expression in assignment: lhs: VariableLHS[~alloc_size~1,] left hand side expression in assignment: address: IdentifierExpression[~out_ptr~0,] left hand side expression in assignment: address: IdentifierExpression[~ptr,] left hand side expression in assignment: address: IdentifierExpression[~ptr,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~storage,],base],StructAccessExpression[IdentifierExpression[~storage,],offset]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~storage,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[4],StructAccessExpression[IdentifierExpression[~storage,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~tl_last_error~0,GLOBAL] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~d~0,],base],BinaryExpression[ARITHPLUS,StructAccessExpression[IdentifierExpression[~d~0,],offset],BinaryExpression[ARITHMUL,IntegerLiteral[8],BinaryExpression[ARITHMOD,IdentifierExpression[~i~6,],IntegerLiteral[4294967296]]]]]] left hand side expression in assignment: lhs: VariableLHS[~c~2,] left hand side expression in assignment: lhs: VariableLHS[~b~0,] left hand side expression in assignment: lhs: VariableLHS[~a~0,] left hand side expression in assignment: lhs: VariableLHS[~c~3,] left hand side expression in assignment: lhs: VariableLHS[~b~1,] left hand side expression in assignment: lhs: VariableLHS[~a~1,] left hand side expression in assignment: address: IdentifierExpression[~pc,] left hand side expression in assignment: address: IdentifierExpression[~pb,] left hand side expression in assignment: lhs: VariableLHS[~c~4,] left hand side expression in assignment: lhs: VariableLHS[~b~2,] left hand side expression in assignment: lhs: VariableLHS[~a~2,] left hand side expression in assignment: lhs: StructLHS[VariableLHS[~u~0,],ptr] left hand side expression in assignment: lhs: VariableLHS[~c~5,] left hand side expression in assignment: lhs: VariableLHS[~b~3,] left hand side expression in assignment: lhs: VariableLHS[~a~3,] left hand side expression in assignment: lhs: StructLHS[VariableLHS[~u~1,],ptr] left hand side expression in assignment: address: IdentifierExpression[~pc,] left hand side expression in assignment: address: IdentifierExpression[~pb,] left hand side expression in assignment: address: IdentifierExpression[~pc,] left hand side expression in assignment: address: IdentifierExpression[~pb,] left hand side expression in assignment: address: IdentifierExpression[~pc,] left hand side expression in assignment: address: IdentifierExpression[~pb,] left hand side expression in assignment: address: IdentifierExpression[~pc,] left hand side expression in assignment: address: IdentifierExpression[~pb,] left hand side expression in assignment: lhs: VariableLHS[~c~6,] left hand side expression in assignment: lhs: VariableLHS[~b~4,] left hand side expression in assignment: lhs: VariableLHS[~a~4,] left hand side expression in assignment: lhs: StructLHS[VariableLHS[~u~2,],ptr] left hand side expression in assignment: lhs: VariableLHS[~hash_code~0,] [2020-12-23 14:14:26,208 WARN L1512 CHandler]: Possible shadowing of function index [2020-12-23 14:14:26,210 WARN L1512 CHandler]: Possible shadowing of function index left hand side expression in assignment: address: IdentifierExpression[~state~3,] left hand side expression in assignment: lhs: VariableLHS[~min_size~0,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~template,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[40],StructAccessExpression[IdentifierExpression[~template,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~template,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[48],StructAccessExpression[IdentifierExpression[~template,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~template,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[48],StructAccessExpression[IdentifierExpression[~template,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~template,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[52],StructAccessExpression[IdentifierExpression[~template,],offset]]]] left hand side expression in assignment: lhs: StructLHS[VariableLHS[~template~0,],hash_fn] left hand side expression in assignment: lhs: StructLHS[VariableLHS[~template~0,],equals_fn] left hand side expression in assignment: lhs: StructLHS[VariableLHS[~template~0,],destroy_key_fn] left hand side expression in assignment: lhs: StructLHS[VariableLHS[~template~0,],destroy_value_fn] left hand side expression in assignment: lhs: StructLHS[VariableLHS[~template~0,],alloc] left hand side expression in assignment: lhs: StructLHS[VariableLHS[~template~0,],entry_count] left hand side expression in assignment: lhs: StructLHS[VariableLHS[~template~0,],max_load_factor] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~map,],base],StructAccessExpression[IdentifierExpression[~map,],offset]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~map,],base],StructAccessExpression[IdentifierExpression[~map,],offset]]] left hand side expression in assignment: address: IdentifierExpression[~a,] left hand side expression in assignment: address: IdentifierExpression[~b,] left hand side expression in assignment: address: IdentifierExpression[~to,] left hand side expression in assignment: address: IdentifierExpression[~p_probe_idx,] left hand side expression in assignment: address: IdentifierExpression[~p_entry,] left hand side expression in assignment: address: IdentifierExpression[~p_probe_idx,] left hand side expression in assignment: address: IdentifierExpression[~p_entry,] [2020-12-23 14:14:26,268 WARN L1512 CHandler]: Possible shadowing of function index left hand side expression in assignment: lhs: VariableLHS[~entry~1,] left hand side expression in assignment: lhs: VariableLHS[~rv~0,] left hand side expression in assignment: lhs: VariableLHS[~rv~0,] [2020-12-23 14:14:26,274 WARN L1512 CHandler]: Possible shadowing of function index left hand side expression in assignment: lhs: VariableLHS[~rv~0,] left hand side expression in assignment: address: IdentifierExpression[~p_entry,] left hand side expression in assignment: address: IdentifierExpression[~p_probe_idx,] left hand side expression in assignment: address: IdentifierExpression[~p_elem,] left hand side expression in assignment: address: IdentifierExpression[~p_elem,] [2020-12-23 14:14:26,289 WARN L1512 CHandler]: Possible shadowing of function index [2020-12-23 14:14:26,290 WARN L1512 CHandler]: Possible shadowing of function index left hand side expression in assignment: lhs: VariableLHS[~rval~11,] left hand side expression in assignment: address: IdentifierExpression[~victim~0,] left hand side expression in assignment: lhs: VariableLHS[~entry,] left hand side expression in assignment: lhs: VariableLHS[~probe_idx,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~map,],base],StructAccessExpression[IdentifierExpression[~map,],offset]]] left hand side expression in assignment: lhs: VariableLHS[~was_created,] left hand side expression in assignment: address: IdentifierExpression[~p_elem,] left hand side expression in assignment: address: IdentifierExpression[~was_created,] left hand side expression in assignment: lhs: VariableLHS[~rv~2,] left hand side expression in assignment: lhs: VariableLHS[~state~6,] left hand side expression in assignment: lhs: VariableLHS[~probe_idx~1,] left hand side expression in assignment: lhs: StructLHS[StructLHS[VariableLHS[~new_entry~0,],element],key] left hand side expression in assignment: lhs: StructLHS[StructLHS[VariableLHS[~new_entry~0,],element],value] left hand side expression in assignment: lhs: StructLHS[VariableLHS[~new_entry~0,],hash_code] left hand side expression in assignment: lhs: VariableLHS[~entry~4,] left hand side expression in assignment: address: IdentifierExpression[~p_elem,] left hand side expression in assignment: address: IdentifierExpression[~was_created,] left hand side expression in assignment: lhs: VariableLHS[~was_created,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~p_elem~0,],base],StructAccessExpression[IdentifierExpression[~p_elem~0,],offset]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~p_elem~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[8],StructAccessExpression[IdentifierExpression[~p_elem~0,],offset]]]] [2020-12-23 14:14:26,321 WARN L1512 CHandler]: Possible shadowing of function index [2020-12-23 14:14:26,324 WARN L1512 CHandler]: Possible shadowing of function index left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~state,],base],BinaryExpression[ARITHPLUS,BinaryExpression[ARITHPLUS,IntegerLiteral[64],StructAccessExpression[IdentifierExpression[~state,],offset]],BinaryExpression[ARITHMUL,IntegerLiteral[24],BinaryExpression[ARITHMOD,IdentifierExpression[~index~3,],IntegerLiteral[4294967296]]]]]] [2020-12-23 14:14:26,325 WARN L1512 CHandler]: Possible shadowing of function index left hand side expression in assignment: lhs: VariableLHS[~index~3,] [2020-12-23 14:14:26,326 WARN L1512 CHandler]: Possible shadowing of function index [2020-12-23 14:14:26,327 WARN L1512 CHandler]: Possible shadowing of function index [2020-12-23 14:14:26,327 WARN L1512 CHandler]: Possible shadowing of function index [2020-12-23 14:14:26,330 WARN L1512 CHandler]: Possible shadowing of function index left hand side expression in assignment: lhs: VariableLHS[~was_present,] left hand side expression in assignment: address: IdentifierExpression[~was_present,] left hand side expression in assignment: address: IdentifierExpression[~was_present,] left hand side expression in assignment: address: IdentifierExpression[~p_value,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~iter,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[8],StructAccessExpression[IdentifierExpression[~iter,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~iter,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[24],StructAccessExpression[IdentifierExpression[~iter,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~iter,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[32],StructAccessExpression[IdentifierExpression[~iter,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~iter,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[8],StructAccessExpression[IdentifierExpression[~iter,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~iter,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[16],StructAccessExpression[IdentifierExpression[~iter,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~iter,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[24],StructAccessExpression[IdentifierExpression[~iter,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~iter,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[32],StructAccessExpression[IdentifierExpression[~iter,],offset]]]] left hand side expression in assignment: lhs: StructLHS[VariableLHS[~iter~1,],map] left hand side expression in assignment: lhs: StructLHS[VariableLHS[~iter~1,],limit] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~iter,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[32],StructAccessExpression[IdentifierExpression[~iter,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~state~13,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[44],StructAccessExpression[IdentifierExpression[~state~13,],offset]]]] [2020-12-23 14:14:26,423 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-12-23 14:14:26,493 INFO L203 MainTranslator]: Completed pre-run [2020-12-23 14:14:26,533 WARN L226 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-bitabs/releaseScripts/default/sv-benchmarks/c/aws-c-common/aws_hash_table_clear_harness.i[4494,4507] [2020-12-23 14:14:26,534 WARN L226 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-bitabs/releaseScripts/default/sv-benchmarks/c/aws-c-common/aws_hash_table_clear_harness.i[4554,4567] [2020-12-23 14:14:26,536 WARN L612 FunctionHandler]: implicit declaration of function __builtin_uaddl_overflow [2020-12-23 14:14:26,544 WARN L612 FunctionHandler]: implicit declaration of function __builtin_umull_overflow left hand side expression in assignment: lhs: VariableLHS[~i~0,] left hand side expression in assignment: address: IdentifierExpression[~r,] left hand side expression in assignment: address: IdentifierExpression[~r,] left hand side expression in assignment: address: IdentifierExpression[~r,] left hand side expression in assignment: address: IdentifierExpression[~r,] left hand side expression in assignment: address: IdentifierExpression[~result,] left hand side expression in assignment: address: IdentifierExpression[~result,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~list,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[20],StructAccessExpression[IdentifierExpression[~list,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~list,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[8],StructAccessExpression[IdentifierExpression[~list,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~list,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[16],StructAccessExpression[IdentifierExpression[~list,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~list,],base],StructAccessExpression[IdentifierExpression[~list,],offset]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~list,],base],StructAccessExpression[IdentifierExpression[~list,],offset]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~list,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[16],StructAccessExpression[IdentifierExpression[~list,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~list,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[12],StructAccessExpression[IdentifierExpression[~list,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~list,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[20],StructAccessExpression[IdentifierExpression[~list,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~list,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[12],StructAccessExpression[IdentifierExpression[~list,],offset]]]] [2020-12-23 14:14:26,648 WARN L1512 CHandler]: Possible shadowing of function index [2020-12-23 14:14:26,648 WARN L1512 CHandler]: Possible shadowing of function index [2020-12-23 14:14:26,649 WARN L1512 CHandler]: Possible shadowing of function index [2020-12-23 14:14:26,649 WARN L1512 CHandler]: Possible shadowing of function index [2020-12-23 14:14:26,650 WARN L1512 CHandler]: Possible shadowing of function index left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~list,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[12],StructAccessExpression[IdentifierExpression[~list,],offset]]]] left hand side expression in assignment: address: IdentifierExpression[~list_a,] left hand side expression in assignment: address: IdentifierExpression[~list_b,] [2020-12-23 14:14:26,664 WARN L1512 CHandler]: Possible shadowing of function index [2020-12-23 14:14:26,665 WARN L1512 CHandler]: Possible shadowing of function index [2020-12-23 14:14:26,666 WARN L1512 CHandler]: Possible shadowing of function index [2020-12-23 14:14:26,670 WARN L1512 CHandler]: Possible shadowing of function index left hand side expression in assignment: address: IdentifierExpression[~val,] [2020-12-23 14:14:26,673 WARN L1512 CHandler]: Possible shadowing of function index [2020-12-23 14:14:26,676 WARN L1512 CHandler]: Possible shadowing of function index [2020-12-23 14:14:26,677 WARN L1512 CHandler]: Possible shadowing of function index [2020-12-23 14:14:26,677 WARN L1512 CHandler]: Possible shadowing of function index left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~ret_storage~0,],base],StructAccessExpression[IdentifierExpression[~ret_storage~0,],offset]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~ret_storage~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[1],StructAccessExpression[IdentifierExpression[~ret_storage~0,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~ret_storage~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[2],StructAccessExpression[IdentifierExpression[~ret_storage~0,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~ret_storage~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[3],StructAccessExpression[IdentifierExpression[~ret_storage~0,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~ret_storage~1,],base],StructAccessExpression[IdentifierExpression[~ret_storage~1,],offset]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~ret_storage~1,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[1],StructAccessExpression[IdentifierExpression[~ret_storage~1,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~ret_storage~1,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[2],StructAccessExpression[IdentifierExpression[~ret_storage~1,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~ret_storage~1,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[3],StructAccessExpression[IdentifierExpression[~ret_storage~1,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~ret_storage~1,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[4],StructAccessExpression[IdentifierExpression[~ret_storage~1,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~ret_storage~1,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[5],StructAccessExpression[IdentifierExpression[~ret_storage~1,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~ret_storage~1,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[6],StructAccessExpression[IdentifierExpression[~ret_storage~1,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~ret_storage~1,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[7],StructAccessExpression[IdentifierExpression[~ret_storage~1,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~head_reaches_tail~0,] left hand side expression in assignment: lhs: VariableLHS[~temp~0,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~list,],base],StructAccessExpression[IdentifierExpression[~list,],offset]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~list,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[8],StructAccessExpression[IdentifierExpression[~list,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~list,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[24],StructAccessExpression[IdentifierExpression[~list,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~list,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[16],StructAccessExpression[IdentifierExpression[~list,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~to_add,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[8],StructAccessExpression[IdentifierExpression[~to_add,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~to_add,],base],StructAccessExpression[IdentifierExpression[~to_add,],offset]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem345,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[8],StructAccessExpression[IdentifierExpression[#t~mem345,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~after,],base],StructAccessExpression[IdentifierExpression[~after,],offset]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem356,],base],StructAccessExpression[IdentifierExpression[#t~mem356,],offset]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem357,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[8],StructAccessExpression[IdentifierExpression[#t~mem357,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem358,],base],StructAccessExpression[IdentifierExpression[#t~mem358,],offset]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem359,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[8],StructAccessExpression[IdentifierExpression[#t~mem359,],offset]]]] left hand side expression in assignment: address: IdentifierExpression[~#tmp~1,] left hand side expression in assignment: address: IdentifierExpression[~a,] left hand side expression in assignment: address: IdentifierExpression[~b,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~to_add,],base],StructAccessExpression[IdentifierExpression[~to_add,],offset]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~to_add,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[8],StructAccessExpression[IdentifierExpression[~to_add,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem372,],base],StructAccessExpression[IdentifierExpression[#t~mem372,],offset]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~before,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[8],StructAccessExpression[IdentifierExpression[~before,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem379,],base],StructAccessExpression[IdentifierExpression[#t~mem379,],offset]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem381,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[8],StructAccessExpression[IdentifierExpression[#t~mem381,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~a,],base],StructAccessExpression[IdentifierExpression[~a,],offset]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem425,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[8],StructAccessExpression[IdentifierExpression[#t~mem425,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~a,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[24],StructAccessExpression[IdentifierExpression[~a,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem427,],base],StructAccessExpression[IdentifierExpression[#t~mem427,],offset]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~b,],base],StructAccessExpression[IdentifierExpression[~b,],offset]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem428,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[8],StructAccessExpression[IdentifierExpression[#t~mem428,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~b,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[24],StructAccessExpression[IdentifierExpression[~b,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem429,],base],StructAccessExpression[IdentifierExpression[#t~mem429,],offset]]] left hand side expression in assignment: address: IdentifierExpression[~var,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~var,],base],StructAccessExpression[IdentifierExpression[~var,],offset]]] [2020-12-23 14:14:26,731 WARN L612 FunctionHandler]: implicit declaration of function __atomic_load_n [2020-12-23 14:14:26,732 WARN L612 FunctionHandler]: implicit declaration of function __atomic_store_n [2020-12-23 14:14:26,733 WARN L612 FunctionHandler]: implicit declaration of function __atomic_exchange_n [2020-12-23 14:14:26,734 WARN L612 FunctionHandler]: implicit declaration of function __atomic_compare_exchange_n [2020-12-23 14:14:26,735 WARN L612 FunctionHandler]: implicit declaration of function __atomic_fetch_add [2020-12-23 14:14:26,736 WARN L612 FunctionHandler]: implicit declaration of function __atomic_fetch_sub [2020-12-23 14:14:26,736 WARN L612 FunctionHandler]: implicit declaration of function __atomic_fetch_or [2020-12-23 14:14:26,737 WARN L612 FunctionHandler]: implicit declaration of function __atomic_fetch_and [2020-12-23 14:14:26,737 WARN L612 FunctionHandler]: implicit declaration of function __atomic_fetch_xor [2020-12-23 14:14:26,738 WARN L612 FunctionHandler]: implicit declaration of function __atomic_thread_fence left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~buf,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[16],StructAccessExpression[IdentifierExpression[~buf,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~buf,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[4],StructAccessExpression[IdentifierExpression[~buf,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~ring_buf,],base],StructAccessExpression[IdentifierExpression[~ring_buf,],offset]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~ring_buf,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[8],StructAccessExpression[IdentifierExpression[~ring_buf,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~ring_buf,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[32],StructAccessExpression[IdentifierExpression[~ring_buf,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~buf,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[4],StructAccessExpression[IdentifierExpression[~buf,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~buf,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[16],StructAccessExpression[IdentifierExpression[~buf,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~cursor,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[4],StructAccessExpression[IdentifierExpression[~cursor,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~list,],base],StructAccessExpression[IdentifierExpression[~list,],offset]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~list,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[20],StructAccessExpression[IdentifierExpression[~list,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~list,],base],StructAccessExpression[IdentifierExpression[~list,],offset]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~list,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[8],StructAccessExpression[IdentifierExpression[~list,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~list,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[16],StructAccessExpression[IdentifierExpression[~list,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~curr~0,],base],StructAccessExpression[IdentifierExpression[~curr~0,],offset]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~node~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[8],StructAccessExpression[IdentifierExpression[~node~0,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~curr~0,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~curr~0,],base],StructAccessExpression[IdentifierExpression[~curr~0,],offset]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~list,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[24],StructAccessExpression[IdentifierExpression[~list,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~queue,],base],StructAccessExpression[IdentifierExpression[~queue,],offset]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~impl~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[40],StructAccessExpression[IdentifierExpression[~impl~0,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~map,],base],StructAccessExpression[IdentifierExpression[~map,],offset]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem557,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[16],StructAccessExpression[IdentifierExpression[#t~mem557,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem560,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[24],StructAccessExpression[IdentifierExpression[#t~mem560,],offset]]]] left hand side expression in assignment: address: IdentifierExpression[~rval,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~str~0,],base],StructAccessExpression[IdentifierExpression[~str~0,],offset]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~str~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[8],StructAccessExpression[IdentifierExpression[~str~0,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~str~0,],base],BinaryExpression[ARITHPLUS,BinaryExpression[ARITHPLUS,IntegerLiteral[12],StructAccessExpression[IdentifierExpression[~str~0,],offset]],BinaryExpression[ARITHMOD,IdentifierExpression[~len,],IntegerLiteral[4294967296]]]]] [2020-12-23 14:14:26,869 WARN L612 FunctionHandler]: implicit declaration of function __builtin_va_copy left hand side expression in assignment: lhs: VariableLHS[~allocation~0,] left hand side expression in assignment: lhs: VariableLHS[~alloc_size~1,] left hand side expression in assignment: address: IdentifierExpression[~out_ptr~0,] left hand side expression in assignment: address: IdentifierExpression[~ptr,] left hand side expression in assignment: address: IdentifierExpression[~ptr,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~storage,],base],StructAccessExpression[IdentifierExpression[~storage,],offset]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~storage,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[4],StructAccessExpression[IdentifierExpression[~storage,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~tl_last_error~0,GLOBAL] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~d~0,],base],BinaryExpression[ARITHPLUS,StructAccessExpression[IdentifierExpression[~d~0,],offset],BinaryExpression[ARITHMUL,IntegerLiteral[8],BinaryExpression[ARITHMOD,IdentifierExpression[~i~6,],IntegerLiteral[4294967296]]]]]] left hand side expression in assignment: lhs: VariableLHS[~c~2,] left hand side expression in assignment: lhs: VariableLHS[~b~0,] left hand side expression in assignment: lhs: VariableLHS[~a~0,] left hand side expression in assignment: lhs: VariableLHS[~c~3,] left hand side expression in assignment: lhs: VariableLHS[~b~1,] left hand side expression in assignment: lhs: VariableLHS[~a~1,] left hand side expression in assignment: address: IdentifierExpression[~pc,] left hand side expression in assignment: address: IdentifierExpression[~pb,] left hand side expression in assignment: lhs: VariableLHS[~c~4,] left hand side expression in assignment: lhs: VariableLHS[~b~2,] left hand side expression in assignment: lhs: VariableLHS[~a~2,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~#u~0,],base],StructAccessExpression[IdentifierExpression[~#u~0,],offset]]] left hand side expression in assignment: lhs: VariableLHS[~c~5,] left hand side expression in assignment: lhs: VariableLHS[~b~3,] left hand side expression in assignment: lhs: VariableLHS[~a~3,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~#u~1,],base],StructAccessExpression[IdentifierExpression[~#u~1,],offset]]] left hand side expression in assignment: address: IdentifierExpression[~pc,] left hand side expression in assignment: address: IdentifierExpression[~pb,] left hand side expression in assignment: address: IdentifierExpression[~pc,] left hand side expression in assignment: address: IdentifierExpression[~pb,] left hand side expression in assignment: address: IdentifierExpression[~pc,] left hand side expression in assignment: address: IdentifierExpression[~pb,] left hand side expression in assignment: address: IdentifierExpression[~pc,] left hand side expression in assignment: address: IdentifierExpression[~pb,] left hand side expression in assignment: lhs: VariableLHS[~c~6,] left hand side expression in assignment: lhs: VariableLHS[~b~4,] left hand side expression in assignment: lhs: VariableLHS[~a~4,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~#u~2,],base],StructAccessExpression[IdentifierExpression[~#u~2,],offset]]] left hand side expression in assignment: lhs: VariableLHS[~hash_code~0,] [2020-12-23 14:14:27,053 WARN L1512 CHandler]: Possible shadowing of function index [2020-12-23 14:14:27,054 WARN L1512 CHandler]: Possible shadowing of function index left hand side expression in assignment: address: IdentifierExpression[~state~3,] left hand side expression in assignment: lhs: VariableLHS[~min_size~0,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~template,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[40],StructAccessExpression[IdentifierExpression[~template,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~template,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[48],StructAccessExpression[IdentifierExpression[~template,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~template,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[48],StructAccessExpression[IdentifierExpression[~template,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~template,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[52],StructAccessExpression[IdentifierExpression[~template,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~#template~0,],base],StructAccessExpression[IdentifierExpression[~#template~0,],offset]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~#template~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[8],StructAccessExpression[IdentifierExpression[~#template~0,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~#template~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[16],StructAccessExpression[IdentifierExpression[~#template~0,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~#template~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[24],StructAccessExpression[IdentifierExpression[~#template~0,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~#template~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[32],StructAccessExpression[IdentifierExpression[~#template~0,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~#template~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[44],StructAccessExpression[IdentifierExpression[~#template~0,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~#template~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[56],StructAccessExpression[IdentifierExpression[~#template~0,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~map,],base],StructAccessExpression[IdentifierExpression[~map,],offset]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~map,],base],StructAccessExpression[IdentifierExpression[~map,],offset]]] left hand side expression in assignment: address: IdentifierExpression[~a,] left hand side expression in assignment: address: IdentifierExpression[~b,] left hand side expression in assignment: address: IdentifierExpression[~to,] left hand side expression in assignment: address: IdentifierExpression[~p_probe_idx,] left hand side expression in assignment: address: IdentifierExpression[~p_entry,] left hand side expression in assignment: address: IdentifierExpression[~p_probe_idx,] left hand side expression in assignment: address: IdentifierExpression[~p_entry,] [2020-12-23 14:14:27,070 WARN L1512 CHandler]: Possible shadowing of function index left hand side expression in assignment: lhs: VariableLHS[~entry~1,] left hand side expression in assignment: lhs: VariableLHS[~rv~0,] left hand side expression in assignment: lhs: VariableLHS[~rv~0,] [2020-12-23 14:14:27,072 WARN L1512 CHandler]: Possible shadowing of function index left hand side expression in assignment: lhs: VariableLHS[~rv~0,] left hand side expression in assignment: address: IdentifierExpression[~p_entry,] left hand side expression in assignment: address: IdentifierExpression[~p_probe_idx,] left hand side expression in assignment: address: IdentifierExpression[~p_elem,] left hand side expression in assignment: address: IdentifierExpression[~p_elem,] [2020-12-23 14:14:27,077 WARN L1512 CHandler]: Possible shadowing of function index [2020-12-23 14:14:27,078 WARN L1512 CHandler]: Possible shadowing of function index left hand side expression in assignment: lhs: VariableLHS[~rval~11,] left hand side expression in assignment: address: IdentifierExpression[~victim~0,] left hand side expression in assignment: address: IdentifierExpression[~#entry,] left hand side expression in assignment: lhs: VariableLHS[~probe_idx,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~map,],base],StructAccessExpression[IdentifierExpression[~map,],offset]]] left hand side expression in assignment: lhs: VariableLHS[~was_created,] left hand side expression in assignment: address: IdentifierExpression[~p_elem,] left hand side expression in assignment: address: IdentifierExpression[~was_created,] left hand side expression in assignment: lhs: VariableLHS[~rv~2,] left hand side expression in assignment: lhs: VariableLHS[~state~6,] left hand side expression in assignment: address: IdentifierExpression[~#probe_idx~1,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~#new_entry~0,],base],StructAccessExpression[IdentifierExpression[~#new_entry~0,],offset]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~#new_entry~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[8],StructAccessExpression[IdentifierExpression[~#new_entry~0,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~#new_entry~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[16],StructAccessExpression[IdentifierExpression[~#new_entry~0,],offset]]]] left hand side expression in assignment: address: IdentifierExpression[~#entry~4,] left hand side expression in assignment: address: IdentifierExpression[~p_elem,] left hand side expression in assignment: address: IdentifierExpression[~was_created,] left hand side expression in assignment: lhs: VariableLHS[~was_created,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem1298,],base],StructAccessExpression[IdentifierExpression[#t~mem1298,],offset]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem1299,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[8],StructAccessExpression[IdentifierExpression[#t~mem1299,],offset]]]] [2020-12-23 14:14:27,101 WARN L1512 CHandler]: Possible shadowing of function index [2020-12-23 14:14:27,102 WARN L1512 CHandler]: Possible shadowing of function index left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~state,],base],BinaryExpression[ARITHPLUS,BinaryExpression[ARITHPLUS,IntegerLiteral[64],StructAccessExpression[IdentifierExpression[~state,],offset]],BinaryExpression[ARITHMUL,IntegerLiteral[24],BinaryExpression[ARITHMOD,IdentifierExpression[~index~3,],IntegerLiteral[4294967296]]]]]] [2020-12-23 14:14:27,103 WARN L1512 CHandler]: Possible shadowing of function index left hand side expression in assignment: lhs: VariableLHS[~index~3,] [2020-12-23 14:14:27,104 WARN L1512 CHandler]: Possible shadowing of function index [2020-12-23 14:14:27,104 WARN L1512 CHandler]: Possible shadowing of function index [2020-12-23 14:14:27,105 WARN L1512 CHandler]: Possible shadowing of function index [2020-12-23 14:14:27,106 WARN L1512 CHandler]: Possible shadowing of function index left hand side expression in assignment: lhs: VariableLHS[~was_present,] left hand side expression in assignment: address: IdentifierExpression[~was_present,] left hand side expression in assignment: address: IdentifierExpression[~was_present,] left hand side expression in assignment: address: IdentifierExpression[~p_value,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~iter,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[8],StructAccessExpression[IdentifierExpression[~iter,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~iter,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[24],StructAccessExpression[IdentifierExpression[~iter,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~iter,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[32],StructAccessExpression[IdentifierExpression[~iter,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~iter,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[8],StructAccessExpression[IdentifierExpression[~iter,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~iter,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[16],StructAccessExpression[IdentifierExpression[~iter,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~iter,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[24],StructAccessExpression[IdentifierExpression[~iter,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~iter,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[32],StructAccessExpression[IdentifierExpression[~iter,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~#iter~1,],base],StructAccessExpression[IdentifierExpression[~#iter~1,],offset]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~#iter~1,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[28],StructAccessExpression[IdentifierExpression[~#iter~1,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~iter,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[32],StructAccessExpression[IdentifierExpression[~iter,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~state~13,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[44],StructAccessExpression[IdentifierExpression[~state~13,],offset]]]] [2020-12-23 14:14:27,136 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-12-23 14:14:28,282 INFO L208 MainTranslator]: Completed translation [2020-12-23 14:14:28,283 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 02:14:28 WrapperNode [2020-12-23 14:14:28,283 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-12-23 14:14:28,285 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-12-23 14:14:28,285 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-12-23 14:14:28,285 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-12-23 14:14:28,294 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 02:14:28" (1/1) ... [2020-12-23 14:14:28,451 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 02:14:28" (1/1) ... [2020-12-23 14:14:28,634 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-12-23 14:14:28,636 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-12-23 14:14:28,636 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-12-23 14:14:28,637 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-12-23 14:14:28,649 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 02:14:28" (1/1) ... [2020-12-23 14:14:28,651 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 02:14:28" (1/1) ... [2020-12-23 14:14:28,689 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 02:14:28" (1/1) ... [2020-12-23 14:14:28,690 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 02:14:28" (1/1) ... [2020-12-23 14:14:28,764 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 02:14:28" (1/1) ... [2020-12-23 14:14:28,772 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 02:14:28" (1/1) ... [2020-12-23 14:14:28,786 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 02:14:28" (1/1) ... [2020-12-23 14:14:28,809 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-12-23 14:14:28,810 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-12-23 14:14:28,811 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-12-23 14:14:28,811 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-12-23 14:14:28,814 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 02:14:28" (1/1) ... No working directory specified, using /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-12-23 14:14:28,971 INFO L130 BoogieDeclarations]: Found specification of procedure read~real [2020-12-23 14:14:28,973 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2020-12-23 14:14:28,973 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2020-12-23 14:14:28,974 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2020-12-23 14:14:28,975 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-12-23 14:14:28,975 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-12-23 14:14:28,975 INFO L130 BoogieDeclarations]: Found specification of procedure __builtin_uaddl_overflow [2020-12-23 14:14:28,975 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-12-23 14:14:28,976 INFO L130 BoogieDeclarations]: Found specification of procedure __builtin_umull_overflow [2020-12-23 14:14:28,976 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2020-12-23 14:14:28,976 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-12-23 14:14:28,976 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-12-23 14:14:28,976 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2020-12-23 14:14:28,978 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2020-12-23 14:14:39,772 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-12-23 14:14:39,772 INFO L299 CfgBuilder]: Removed 126 assume(true) statements. [2020-12-23 14:14:39,775 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.12 02:14:39 BoogieIcfgContainer [2020-12-23 14:14:39,776 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-12-23 14:14:39,778 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-12-23 14:14:39,778 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-12-23 14:14:39,782 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-12-23 14:14:39,783 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.12 02:14:22" (1/3) ... [2020-12-23 14:14:39,784 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@623fd44d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.12 02:14:39, skipping insertion in model container [2020-12-23 14:14:39,785 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 02:14:28" (2/3) ... [2020-12-23 14:14:39,785 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@623fd44d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.12 02:14:39, skipping insertion in model container [2020-12-23 14:14:39,785 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.12 02:14:39" (3/3) ... [2020-12-23 14:14:39,787 INFO L111 eAbstractionObserver]: Analyzing ICFG aws_hash_table_clear_harness.i [2020-12-23 14:14:39,797 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-12-23 14:14:39,804 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 5 error locations. [2020-12-23 14:14:39,829 INFO L253 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2020-12-23 14:14:39,865 INFO L377 AbstractCegarLoop]: Interprodecural is true [2020-12-23 14:14:39,866 INFO L378 AbstractCegarLoop]: Hoare is true [2020-12-23 14:14:39,866 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-12-23 14:14:39,866 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-12-23 14:14:39,866 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-12-23 14:14:39,866 INFO L382 AbstractCegarLoop]: Difference is false [2020-12-23 14:14:39,866 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-12-23 14:14:39,866 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-12-23 14:14:39,890 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states. [2020-12-23 14:14:39,901 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2020-12-23 14:14:39,901 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 14:14:39,902 INFO L422 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] [2020-12-23 14:14:39,903 INFO L429 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 14:14:39,910 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 14:14:39,911 INFO L82 PathProgramCache]: Analyzing trace with hash -662474665, now seen corresponding path program 1 times [2020-12-23 14:14:39,924 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 14:14:39,924 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2066342092] [2020-12-23 14:14:39,924 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 14:14:40,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 14:14:40,980 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-23 14:14:40,981 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2066342092] [2020-12-23 14:14:40,982 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 14:14:40,982 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-12-23 14:14:40,984 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [983310919] [2020-12-23 14:14:40,990 INFO L461 AbstractCegarLoop]: Interpolant automaton has 2 states [2020-12-23 14:14:40,991 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 14:14:41,008 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2020-12-23 14:14:41,010 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2020-12-23 14:14:41,012 INFO L87 Difference]: Start difference. First operand 130 states. Second operand 2 states. [2020-12-23 14:14:41,055 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 14:14:41,055 INFO L93 Difference]: Finished difference Result 256 states and 341 transitions. [2020-12-23 14:14:41,055 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2020-12-23 14:14:41,057 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 57 [2020-12-23 14:14:41,058 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 14:14:41,071 INFO L225 Difference]: With dead ends: 256 [2020-12-23 14:14:41,072 INFO L226 Difference]: Without dead ends: 124 [2020-12-23 14:14:41,077 INFO L677 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 [2020-12-23 14:14:41,102 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124 states. [2020-12-23 14:14:41,129 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124 to 124. [2020-12-23 14:14:41,130 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 124 states. [2020-12-23 14:14:41,133 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 148 transitions. [2020-12-23 14:14:41,135 INFO L78 Accepts]: Start accepts. Automaton has 124 states and 148 transitions. Word has length 57 [2020-12-23 14:14:41,136 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 14:14:41,136 INFO L481 AbstractCegarLoop]: Abstraction has 124 states and 148 transitions. [2020-12-23 14:14:41,136 INFO L482 AbstractCegarLoop]: Interpolant automaton has 2 states. [2020-12-23 14:14:41,136 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 148 transitions. [2020-12-23 14:14:41,139 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2020-12-23 14:14:41,139 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 14:14:41,139 INFO L422 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] [2020-12-23 14:14:41,140 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-12-23 14:14:41,140 INFO L429 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 14:14:41,141 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 14:14:41,142 INFO L82 PathProgramCache]: Analyzing trace with hash -683098601, now seen corresponding path program 1 times [2020-12-23 14:14:41,142 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 14:14:41,142 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [728337314] [2020-12-23 14:14:41,143 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 14:14:41,298 ERROR L270 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2020-12-23 14:14:41,298 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1163422658] [2020-12-23 14:14:41,299 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-23 14:14:42,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 14:14:42,961 INFO L263 TraceCheckSpWp]: Trace formula consists of 2498 conjuncts, 2 conjunts are in the unsatisfiable core [2020-12-23 14:14:42,984 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-23 14:14:43,146 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-23 14:14:43,147 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [728337314] [2020-12-23 14:14:43,148 WARN L332 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2020-12-23 14:14:43,148 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1163422658] [2020-12-23 14:14:43,149 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 14:14:43,149 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-23 14:14:43,149 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1624177748] [2020-12-23 14:14:43,154 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-23 14:14:43,155 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 14:14:43,170 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-23 14:14:43,171 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-23 14:14:43,171 INFO L87 Difference]: Start difference. First operand 124 states and 148 transitions. Second operand 3 states. [2020-12-23 14:14:43,215 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 14:14:43,215 INFO L93 Difference]: Finished difference Result 173 states and 204 transitions. [2020-12-23 14:14:43,216 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-23 14:14:43,216 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 57 [2020-12-23 14:14:43,216 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 14:14:43,218 INFO L225 Difference]: With dead ends: 173 [2020-12-23 14:14:43,218 INFO L226 Difference]: Without dead ends: 125 [2020-12-23 14:14:43,220 INFO L677 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 [2020-12-23 14:14:43,222 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states. [2020-12-23 14:14:43,233 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 125. [2020-12-23 14:14:43,233 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 125 states. [2020-12-23 14:14:43,235 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 149 transitions. [2020-12-23 14:14:43,236 INFO L78 Accepts]: Start accepts. Automaton has 125 states and 149 transitions. Word has length 57 [2020-12-23 14:14:43,236 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 14:14:43,236 INFO L481 AbstractCegarLoop]: Abstraction has 125 states and 149 transitions. [2020-12-23 14:14:43,237 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-23 14:14:43,237 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 149 transitions. [2020-12-23 14:14:43,239 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2020-12-23 14:14:43,239 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 14:14:43,239 INFO L422 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] [2020-12-23 14:14:43,452 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable1 [2020-12-23 14:14:43,454 INFO L429 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 14:14:43,455 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 14:14:43,456 INFO L82 PathProgramCache]: Analyzing trace with hash 1091908761, now seen corresponding path program 1 times [2020-12-23 14:14:43,456 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 14:14:43,456 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [981977728] [2020-12-23 14:14:43,457 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 14:14:43,578 ERROR L270 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2020-12-23 14:14:43,578 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [32694755] [2020-12-23 14:14:43,579 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-23 14:14:44,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 14:14:44,828 INFO L263 TraceCheckSpWp]: Trace formula consists of 2503 conjuncts, 18 conjunts are in the unsatisfiable core [2020-12-23 14:14:44,841 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-23 14:14:44,953 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-23 14:14:44,953 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [981977728] [2020-12-23 14:14:44,954 WARN L332 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2020-12-23 14:14:44,954 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [32694755] [2020-12-23 14:14:44,954 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 14:14:44,954 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-12-23 14:14:44,955 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1902667435] [2020-12-23 14:14:44,955 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-12-23 14:14:44,955 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 14:14:44,956 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-12-23 14:14:44,956 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-12-23 14:14:44,957 INFO L87 Difference]: Start difference. First operand 125 states and 149 transitions. Second operand 5 states. [2020-12-23 14:14:45,081 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 14:14:45,081 INFO L93 Difference]: Finished difference Result 125 states and 149 transitions. [2020-12-23 14:14:45,082 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-12-23 14:14:45,082 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 57 [2020-12-23 14:14:45,084 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 14:14:45,085 INFO L225 Difference]: With dead ends: 125 [2020-12-23 14:14:45,085 INFO L226 Difference]: Without dead ends: 123 [2020-12-23 14:14:45,086 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 53 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2020-12-23 14:14:45,090 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2020-12-23 14:14:45,109 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 123. [2020-12-23 14:14:45,109 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 123 states. [2020-12-23 14:14:45,110 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 147 transitions. [2020-12-23 14:14:45,111 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 147 transitions. Word has length 57 [2020-12-23 14:14:45,115 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 14:14:45,115 INFO L481 AbstractCegarLoop]: Abstraction has 123 states and 147 transitions. [2020-12-23 14:14:45,115 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-12-23 14:14:45,115 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 147 transitions. [2020-12-23 14:14:45,119 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2020-12-23 14:14:45,120 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 14:14:45,120 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 14:14:45,334 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-23 14:14:45,335 INFO L429 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 14:14:45,336 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 14:14:45,337 INFO L82 PathProgramCache]: Analyzing trace with hash 1352431387, now seen corresponding path program 1 times [2020-12-23 14:14:45,337 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 14:14:45,338 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1415888794] [2020-12-23 14:14:45,338 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 14:14:45,511 ERROR L270 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2020-12-23 14:14:45,511 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [107279326] [2020-12-23 14:14:45,512 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-23 14:14:46,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 14:14:46,806 INFO L263 TraceCheckSpWp]: Trace formula consists of 2512 conjuncts, 20 conjunts are in the unsatisfiable core [2020-12-23 14:14:46,812 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-23 14:14:46,948 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-23 14:14:46,948 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1415888794] [2020-12-23 14:14:46,949 WARN L332 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2020-12-23 14:14:46,949 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [107279326] [2020-12-23 14:14:46,949 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 14:14:46,949 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-12-23 14:14:46,950 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1276375326] [2020-12-23 14:14:46,956 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-12-23 14:14:46,957 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 14:14:46,957 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-12-23 14:14:46,958 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2020-12-23 14:14:46,958 INFO L87 Difference]: Start difference. First operand 123 states and 147 transitions. Second operand 6 states. [2020-12-23 14:14:47,237 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 14:14:47,237 INFO L93 Difference]: Finished difference Result 234 states and 274 transitions. [2020-12-23 14:14:47,238 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-12-23 14:14:47,238 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 59 [2020-12-23 14:14:47,238 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 14:14:47,240 INFO L225 Difference]: With dead ends: 234 [2020-12-23 14:14:47,240 INFO L226 Difference]: Without dead ends: 143 [2020-12-23 14:14:47,241 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 54 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2020-12-23 14:14:47,242 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 143 states. [2020-12-23 14:14:47,249 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 143 to 123. [2020-12-23 14:14:47,249 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 123 states. [2020-12-23 14:14:47,250 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 145 transitions. [2020-12-23 14:14:47,250 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 145 transitions. Word has length 59 [2020-12-23 14:14:47,250 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 14:14:47,250 INFO L481 AbstractCegarLoop]: Abstraction has 123 states and 145 transitions. [2020-12-23 14:14:47,250 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-12-23 14:14:47,251 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 145 transitions. [2020-12-23 14:14:47,253 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2020-12-23 14:14:47,253 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 14:14:47,254 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 14:14:47,468 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-23 14:14:47,469 INFO L429 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 14:14:47,470 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 14:14:47,470 INFO L82 PathProgramCache]: Analyzing trace with hash -1755526949, now seen corresponding path program 1 times [2020-12-23 14:14:47,470 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 14:14:47,470 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1175620917] [2020-12-23 14:14:47,471 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 14:14:47,613 ERROR L270 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2020-12-23 14:14:47,613 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2005280347] [2020-12-23 14:14:47,614 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-23 14:14:48,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 14:14:48,922 INFO L263 TraceCheckSpWp]: Trace formula consists of 2554 conjuncts, 23 conjunts are in the unsatisfiable core [2020-12-23 14:14:48,937 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-23 14:14:49,007 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-23 14:14:49,066 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-23 14:14:49,068 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-23 14:14:49,070 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-23 14:14:49,117 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 8 [2020-12-23 14:14:49,119 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-23 14:14:49,125 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2020-12-23 14:14:49,127 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-12-23 14:14:49,149 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 14:14:49,155 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2020-12-23 14:14:49,157 INFO L547 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2020-12-23 14:14:49,162 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 8 [2020-12-23 14:14:49,163 INFO L547 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2020-12-23 14:14:49,170 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 14:14:49,172 INFO L547 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 2 xjuncts. [2020-12-23 14:14:49,172 INFO L244 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:47, output treesize:9 [2020-12-23 14:14:49,234 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-23 14:14:49,235 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1175620917] [2020-12-23 14:14:49,235 WARN L332 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2020-12-23 14:14:49,235 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2005280347] [2020-12-23 14:14:49,236 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 14:14:49,236 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-12-23 14:14:49,236 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [60270074] [2020-12-23 14:14:49,236 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-12-23 14:14:49,237 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 14:14:49,237 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-12-23 14:14:49,237 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-12-23 14:14:49,238 INFO L87 Difference]: Start difference. First operand 123 states and 145 transitions. Second operand 5 states. [2020-12-23 14:14:54,369 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 14:14:54,370 INFO L93 Difference]: Finished difference Result 329 states and 388 transitions. [2020-12-23 14:14:54,370 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-12-23 14:14:54,371 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 63 [2020-12-23 14:14:54,371 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 14:14:54,373 INFO L225 Difference]: With dead ends: 329 [2020-12-23 14:14:54,373 INFO L226 Difference]: Without dead ends: 240 [2020-12-23 14:14:54,375 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 59 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2020-12-23 14:14:54,376 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 240 states. [2020-12-23 14:14:54,385 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 240 to 135. [2020-12-23 14:14:54,386 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 135 states. [2020-12-23 14:14:54,386 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 159 transitions. [2020-12-23 14:14:54,387 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 159 transitions. Word has length 63 [2020-12-23 14:14:54,387 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 14:14:54,387 INFO L481 AbstractCegarLoop]: Abstraction has 135 states and 159 transitions. [2020-12-23 14:14:54,387 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-12-23 14:14:54,387 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 159 transitions. [2020-12-23 14:14:54,388 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2020-12-23 14:14:54,388 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 14:14:54,389 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 14:14:54,601 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-23 14:14:54,603 INFO L429 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 14:14:54,603 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 14:14:54,604 INFO L82 PathProgramCache]: Analyzing trace with hash -352097637, now seen corresponding path program 1 times [2020-12-23 14:14:54,604 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 14:14:54,604 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1520389087] [2020-12-23 14:14:54,605 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 14:14:54,724 ERROR L270 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2020-12-23 14:14:54,724 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1459675624] [2020-12-23 14:14:54,724 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-23 14:14:55,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 14:14:56,000 INFO L263 TraceCheckSpWp]: Trace formula consists of 2544 conjuncts, 3 conjunts are in the unsatisfiable core [2020-12-23 14:14:56,005 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-23 14:14:56,087 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-23 14:14:56,088 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1520389087] [2020-12-23 14:14:56,088 WARN L332 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2020-12-23 14:14:56,088 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1459675624] [2020-12-23 14:14:56,088 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 14:14:56,089 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-12-23 14:14:56,089 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [398916992] [2020-12-23 14:14:56,089 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-23 14:14:56,090 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 14:14:56,090 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-23 14:14:56,091 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-23 14:14:56,091 INFO L87 Difference]: Start difference. First operand 135 states and 159 transitions. Second operand 4 states. [2020-12-23 14:14:56,259 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 14:14:56,260 INFO L93 Difference]: Finished difference Result 235 states and 274 transitions. [2020-12-23 14:14:56,261 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-12-23 14:14:56,261 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 63 [2020-12-23 14:14:56,262 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 14:14:56,263 INFO L225 Difference]: With dead ends: 235 [2020-12-23 14:14:56,263 INFO L226 Difference]: Without dead ends: 131 [2020-12-23 14:14:56,264 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 60 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-12-23 14:14:56,265 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states. [2020-12-23 14:14:56,288 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 127. [2020-12-23 14:14:56,289 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 127 states. [2020-12-23 14:14:56,294 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 143 transitions. [2020-12-23 14:14:56,294 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 143 transitions. Word has length 63 [2020-12-23 14:14:56,295 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 14:14:56,295 INFO L481 AbstractCegarLoop]: Abstraction has 127 states and 143 transitions. [2020-12-23 14:14:56,295 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-23 14:14:56,295 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 143 transitions. [2020-12-23 14:14:56,296 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2020-12-23 14:14:56,297 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 14:14:56,297 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 14:14:56,515 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2020-12-23 14:14:56,516 INFO L429 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 14:14:56,517 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 14:14:56,518 INFO L82 PathProgramCache]: Analyzing trace with hash -1312374044, now seen corresponding path program 1 times [2020-12-23 14:14:56,518 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 14:14:56,519 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [987298796] [2020-12-23 14:14:56,519 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 14:14:56,644 ERROR L270 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2020-12-23 14:14:56,645 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1524492412] [2020-12-23 14:14:56,645 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-23 14:14:57,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 14:14:58,010 INFO L263 TraceCheckSpWp]: Trace formula consists of 2604 conjuncts, 17 conjunts are in the unsatisfiable core [2020-12-23 14:14:58,020 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-23 14:14:58,079 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-23 14:14:58,142 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-23 14:14:58,142 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [987298796] [2020-12-23 14:14:58,142 WARN L332 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2020-12-23 14:14:58,145 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1524492412] [2020-12-23 14:14:58,146 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 14:14:58,146 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-12-23 14:14:58,148 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1435506283] [2020-12-23 14:14:58,151 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-23 14:14:58,151 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 14:14:58,152 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-23 14:14:58,152 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-23 14:14:58,152 INFO L87 Difference]: Start difference. First operand 127 states and 143 transitions. Second operand 4 states. [2020-12-23 14:14:58,267 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 14:14:58,267 INFO L93 Difference]: Finished difference Result 232 states and 260 transitions. [2020-12-23 14:14:58,268 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-12-23 14:14:58,268 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 65 [2020-12-23 14:14:58,269 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 14:14:58,270 INFO L225 Difference]: With dead ends: 232 [2020-12-23 14:14:58,270 INFO L226 Difference]: Without dead ends: 127 [2020-12-23 14:14:58,272 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 62 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-12-23 14:14:58,274 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2020-12-23 14:14:58,288 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 127. [2020-12-23 14:14:58,289 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 127 states. [2020-12-23 14:14:58,289 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 141 transitions. [2020-12-23 14:14:58,289 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 141 transitions. Word has length 65 [2020-12-23 14:14:58,290 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 14:14:58,290 INFO L481 AbstractCegarLoop]: Abstraction has 127 states and 141 transitions. [2020-12-23 14:14:58,290 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-23 14:14:58,290 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 141 transitions. [2020-12-23 14:14:58,299 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2020-12-23 14:14:58,299 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 14:14:58,299 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 14:14:58,500 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,7 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-23 14:14:58,501 INFO L429 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 14:14:58,502 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 14:14:58,502 INFO L82 PathProgramCache]: Analyzing trace with hash -108050539, now seen corresponding path program 1 times [2020-12-23 14:14:58,502 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 14:14:58,503 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [127884872] [2020-12-23 14:14:58,503 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 14:14:58,631 ERROR L270 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2020-12-23 14:14:58,631 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2131661824] [2020-12-23 14:14:58,631 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-23 14:15:02,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 14:15:02,358 INFO L263 TraceCheckSpWp]: Trace formula consists of 2677 conjuncts, 138 conjunts are in the unsatisfiable core [2020-12-23 14:15:02,377 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-23 14:15:02,404 INFO L382 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 [2020-12-23 14:15:02,405 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-23 14:15:02,425 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 14:15:02,427 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-12-23 14:15:02,428 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:19, output treesize:18 [2020-12-23 14:15:02,808 WARN L197 SmtUtils]: Spent 296.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 51 [2020-12-23 14:15:02,809 INFO L348 Elim1Store]: treesize reduction 45, result has 71.3 percent of original size [2020-12-23 14:15:02,810 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 11 case distinctions, treesize of input 45 treesize of output 141 [2020-12-23 14:15:02,817 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-23 14:15:02,824 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-23 14:15:02,829 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-23 14:15:02,952 WARN L197 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 39 DAG size of output: 33 [2020-12-23 14:15:02,953 INFO L625 ElimStorePlain]: treesize reduction 12, result has 81.0 percent of original size [2020-12-23 14:15:02,955 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-12-23 14:15:02,956 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:60, output treesize:51 [2020-12-23 14:15:03,397 WARN L197 SmtUtils]: Spent 270.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 49 [2020-12-23 14:15:03,398 INFO L348 Elim1Store]: treesize reduction 24, result has 82.0 percent of original size [2020-12-23 14:15:03,398 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 3 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 11 case distinctions, treesize of input 32 treesize of output 129 [2020-12-23 14:15:03,411 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-23 14:15:03,547 WARN L197 SmtUtils]: Spent 135.00 ms on a formula simplification. DAG size of input: 44 DAG size of output: 34 [2020-12-23 14:15:03,548 INFO L625 ElimStorePlain]: treesize reduction 26, result has 67.1 percent of original size [2020-12-23 14:15:03,553 INFO L547 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2020-12-23 14:15:03,553 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:59, output treesize:53 [2020-12-23 14:15:03,690 WARN L197 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 36 DAG size of output: 32 [2020-12-23 14:15:03,791 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 14:15:03,792 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 27 treesize of output 71 [2020-12-23 14:15:03,808 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-23 14:15:03,910 WARN L197 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 37 DAG size of output: 29 [2020-12-23 14:15:03,910 INFO L625 ElimStorePlain]: treesize reduction 16, result has 73.3 percent of original size [2020-12-23 14:15:03,916 INFO L547 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2020-12-23 14:15:03,916 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:54, output treesize:44 [2020-12-23 14:15:04,090 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-12-23 14:15:04,099 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-12-23 14:15:04,179 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 14:15:04,180 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 27 treesize of output 98 [2020-12-23 14:15:04,189 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-23 14:15:04,365 WARN L197 SmtUtils]: Spent 175.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 41 [2020-12-23 14:15:04,366 INFO L625 ElimStorePlain]: treesize reduction 36, result has 64.7 percent of original size [2020-12-23 14:15:04,370 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-23 14:15:04,372 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-23 14:15:04,373 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-12-23 14:15:04,374 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-23 14:15:04,376 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2020-12-23 14:15:04,379 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-23 14:15:04,380 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-12-23 14:15:04,385 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-23 14:15:04,388 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-23 14:15:04,389 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2020-12-23 14:15:04,396 INFO L547 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2020-12-23 14:15:04,397 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:59, output treesize:66 [2020-12-23 14:15:04,400 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-23 14:15:04,402 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-23 14:15:04,405 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-12-23 14:15:04,409 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-23 14:15:04,412 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2020-12-23 14:15:04,418 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-23 14:15:04,419 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-12-23 14:15:04,427 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-23 14:15:04,432 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-23 14:15:04,434 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2020-12-23 14:15:04,547 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-23 14:15:04,549 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-23 14:15:04,551 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-12-23 14:15:04,552 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-23 14:15:04,554 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2020-12-23 14:15:04,555 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-12-23 14:15:04,556 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2020-12-23 14:15:04,558 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 12 disjuncts [2020-12-23 14:15:04,564 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-23 14:15:04,566 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-23 14:15:04,568 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2020-12-23 14:15:04,569 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 12 disjuncts [2020-12-23 14:15:04,593 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-12-23 14:15:04,596 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-23 14:15:04,597 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-12-23 14:15:04,600 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 11 disjuncts [2020-12-23 14:15:04,626 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-12-23 14:15:04,631 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-12-23 14:15:04,806 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 14:15:04,807 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 4 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 8 case distinctions, treesize of input 32 treesize of output 117 [2020-12-23 14:15:04,813 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-23 14:15:04,832 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-12-23 14:15:04,839 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-12-23 14:15:04,919 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 14:15:04,920 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 27 treesize of output 63 [2020-12-23 14:15:04,923 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-12-23 14:15:04,935 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-12-23 14:15:04,942 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-12-23 14:15:05,000 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 14:15:05,000 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 27 treesize of output 63 [2020-12-23 14:15:05,003 INFO L547 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2020-12-23 14:15:05,496 WARN L197 SmtUtils]: Spent 492.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 54 [2020-12-23 14:15:05,496 INFO L625 ElimStorePlain]: treesize reduction 44, result has 82.0 percent of original size [2020-12-23 14:15:05,514 INFO L382 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 [2020-12-23 14:15:05,515 INFO L547 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2020-12-23 14:15:05,527 INFO L382 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 [2020-12-23 14:15:05,528 INFO L547 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2020-12-23 14:15:05,542 INFO L382 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 [2020-12-23 14:15:05,542 INFO L547 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2020-12-23 14:15:05,744 WARN L197 SmtUtils]: Spent 201.00 ms on a formula simplification that was a NOOP. DAG size: 52 [2020-12-23 14:15:05,745 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 14:15:05,758 INFO L382 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 [2020-12-23 14:15:05,759 INFO L547 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2020-12-23 14:15:05,771 INFO L382 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 [2020-12-23 14:15:05,772 INFO L547 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2020-12-23 14:15:05,784 INFO L382 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 [2020-12-23 14:15:05,785 INFO L547 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2020-12-23 14:15:05,999 WARN L197 SmtUtils]: Spent 212.00 ms on a formula simplification that was a NOOP. DAG size: 50 [2020-12-23 14:15:05,999 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 14:15:06,013 INFO L547 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-1 vars, 2 dim-2 vars, End of recursive call: 10 dim-0 vars, and 3 xjuncts. [2020-12-23 14:15:06,014 INFO L244 ElimStorePlain]: Needed 10 recursive calls to eliminate 8 variables, input treesize:222, output treesize:167 [2020-12-23 14:15:06,311 WARN L197 SmtUtils]: Spent 251.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 36 [2020-12-23 14:15:06,759 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 14:15:06,760 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 50 treesize of output 64 [2020-12-23 14:15:06,763 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 3, 2, 1] term [2020-12-23 14:15:06,764 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-12-23 14:15:06,766 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2020-12-23 14:15:06,937 WARN L197 SmtUtils]: Spent 171.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 52 [2020-12-23 14:15:06,938 INFO L625 ElimStorePlain]: treesize reduction 62, result has 61.5 percent of original size [2020-12-23 14:15:06,951 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-12-23 14:15:06,953 INFO L382 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 29 treesize of output 24 [2020-12-23 14:15:06,954 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-12-23 14:15:07,026 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 14:15:07,031 INFO L547 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 2 dim-2 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2020-12-23 14:15:07,032 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 8 variables, input treesize:107, output treesize:65 [2020-12-23 14:15:07,285 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-12-23 14:15:07,287 INFO L382 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 58 treesize of output 44 [2020-12-23 14:15:07,289 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-23 14:15:07,366 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 14:15:07,377 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-12-23 14:15:07,379 INFO L382 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 40 [2020-12-23 14:15:07,384 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-12-23 14:15:07,456 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 14:15:07,461 INFO L547 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 2 dim-2 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2020-12-23 14:15:07,461 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 7 variables, input treesize:104, output treesize:68 [2020-12-23 14:15:07,605 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-12-23 14:15:07,613 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-12-23 14:15:07,618 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-12-23 14:15:07,676 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 14:15:07,677 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 4 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 6 case distinctions, treesize of input 26 treesize of output 64 [2020-12-23 14:15:07,679 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-23 14:15:07,729 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 14:15:07,731 INFO L547 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-12-23 14:15:07,731 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:79, output treesize:50 [2020-12-23 14:15:07,825 INFO L443 ElimStorePlain]: Different costs {2=[|v_#memory_$Pointer$.base_44|], 6=[|v_#memory_$Pointer$.offset_44|]} [2020-12-23 14:15:07,832 INFO L382 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 51 treesize of output 31 [2020-12-23 14:15:07,833 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-23 14:15:07,869 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 14:15:07,877 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-12-23 14:15:07,880 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-12-23 14:15:07,882 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 30 [2020-12-23 14:15:07,884 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-12-23 14:15:07,914 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 14:15:07,918 INFO L547 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-12-23 14:15:07,918 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:80, output treesize:37 [2020-12-23 14:15:08,180 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 22 [2020-12-23 14:15:08,182 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-23 14:15:08,202 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 14:15:08,204 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-12-23 14:15:08,204 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:48, output treesize:33 [2020-12-23 14:15:08,295 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-23 14:15:08,298 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-23 14:15:08,300 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-23 14:15:08,302 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-23 14:15:08,303 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-23 14:15:08,304 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-23 14:15:08,316 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-12-23 14:15:08,320 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 15 [2020-12-23 14:15:08,323 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-23 14:15:08,329 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-12-23 14:15:08,330 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 12 [2020-12-23 14:15:08,334 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-12-23 14:15:08,360 INFO L625 ElimStorePlain]: treesize reduction 12, result has 36.8 percent of original size [2020-12-23 14:15:08,362 INFO L547 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-12-23 14:15:08,363 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:69, output treesize:1 [2020-12-23 14:15:08,487 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-23 14:15:08,488 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [127884872] [2020-12-23 14:15:08,488 WARN L332 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2020-12-23 14:15:08,488 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2131661824] [2020-12-23 14:15:08,488 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 14:15:08,488 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2020-12-23 14:15:08,489 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [385726439] [2020-12-23 14:15:08,489 INFO L461 AbstractCegarLoop]: Interpolant automaton has 19 states [2020-12-23 14:15:08,490 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 14:15:08,490 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2020-12-23 14:15:08,490 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=293, Unknown=0, NotChecked=0, Total=342 [2020-12-23 14:15:08,491 INFO L87 Difference]: Start difference. First operand 127 states and 141 transitions. Second operand 19 states. [2020-12-23 14:15:23,339 WARN L197 SmtUtils]: Spent 110.00 ms on a formula simplification that was a NOOP. DAG size: 62 [2020-12-23 14:15:23,546 WARN L197 SmtUtils]: Spent 142.00 ms on a formula simplification that was a NOOP. DAG size: 63 [2020-12-23 14:15:24,960 WARN L197 SmtUtils]: Spent 131.00 ms on a formula simplification that was a NOOP. DAG size: 58 [2020-12-23 14:15:25,334 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 14:15:25,334 INFO L93 Difference]: Finished difference Result 259 states and 287 transitions. [2020-12-23 14:15:25,336 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2020-12-23 14:15:25,336 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 70 [2020-12-23 14:15:25,336 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 14:15:25,338 INFO L225 Difference]: With dead ends: 259 [2020-12-23 14:15:25,338 INFO L226 Difference]: Without dead ends: 209 [2020-12-23 14:15:25,339 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 52 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 183 ImplicationChecksByTransitivity, 3.1s TimeCoverageRelationStatistics Valid=144, Invalid=786, Unknown=0, NotChecked=0, Total=930 [2020-12-23 14:15:25,340 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 209 states. [2020-12-23 14:15:25,356 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 209 to 149. [2020-12-23 14:15:25,356 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 149 states. [2020-12-23 14:15:25,358 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 149 states to 149 states and 164 transitions. [2020-12-23 14:15:25,358 INFO L78 Accepts]: Start accepts. Automaton has 149 states and 164 transitions. Word has length 70 [2020-12-23 14:15:25,359 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 14:15:25,359 INFO L481 AbstractCegarLoop]: Abstraction has 149 states and 164 transitions. [2020-12-23 14:15:25,359 INFO L482 AbstractCegarLoop]: Interpolant automaton has 19 states. [2020-12-23 14:15:25,359 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states and 164 transitions. [2020-12-23 14:15:25,360 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2020-12-23 14:15:25,360 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 14:15:25,360 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 14:15:25,574 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,8 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-23 14:15:25,576 INFO L429 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 14:15:25,577 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 14:15:25,577 INFO L82 PathProgramCache]: Analyzing trace with hash -809650413, now seen corresponding path program 1 times [2020-12-23 14:15:25,578 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 14:15:25,578 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1783653004] [2020-12-23 14:15:25,578 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 14:15:25,716 ERROR L270 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2020-12-23 14:15:25,716 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1605950282] [2020-12-23 14:15:25,716 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true