/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-178dd20 [2021-01-07 00:08:14,962 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-01-07 00:08:14,965 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-01-07 00:08:15,002 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-01-07 00:08:15,002 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-01-07 00:08:15,004 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-01-07 00:08:15,006 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-01-07 00:08:15,008 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-01-07 00:08:15,011 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-01-07 00:08:15,012 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-01-07 00:08:15,014 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-01-07 00:08:15,015 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-01-07 00:08:15,016 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-01-07 00:08:15,017 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-01-07 00:08:15,019 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-01-07 00:08:15,020 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-01-07 00:08:15,021 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-01-07 00:08:15,023 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-01-07 00:08:15,025 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-01-07 00:08:15,028 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-01-07 00:08:15,030 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-01-07 00:08:15,031 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-01-07 00:08:15,044 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-01-07 00:08:15,045 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-01-07 00:08:15,049 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-01-07 00:08:15,049 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-01-07 00:08:15,049 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-01-07 00:08:15,051 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-01-07 00:08:15,051 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-01-07 00:08:15,052 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-01-07 00:08:15,053 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-01-07 00:08:15,054 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-01-07 00:08:15,055 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-01-07 00:08:15,056 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-01-07 00:08:15,057 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-01-07 00:08:15,057 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-01-07 00:08:15,058 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-01-07 00:08:15,059 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-01-07 00:08:15,059 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-01-07 00:08:15,060 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-01-07 00:08:15,061 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-01-07 00:08:15,067 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2021-01-07 00:08:15,125 INFO L113 SettingsManager]: Loading preferences was successful [2021-01-07 00:08:15,125 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-01-07 00:08:15,129 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-01-07 00:08:15,129 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-01-07 00:08:15,129 INFO L138 SettingsManager]: * Use SBE=true [2021-01-07 00:08:15,130 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-01-07 00:08:15,131 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-01-07 00:08:15,131 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-01-07 00:08:15,132 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-01-07 00:08:15,132 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-01-07 00:08:15,133 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-01-07 00:08:15,133 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-01-07 00:08:15,133 INFO L138 SettingsManager]: * Use constant arrays=true [2021-01-07 00:08:15,133 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-01-07 00:08:15,133 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-01-07 00:08:15,134 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-01-07 00:08:15,134 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-01-07 00:08:15,134 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-01-07 00:08:15,134 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-01-07 00:08:15,135 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-01-07 00:08:15,135 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-01-07 00:08:15,136 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-01-07 00:08:15,136 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-01-07 00:08:15,137 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-01-07 00:08:15,137 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-01-07 00:08:15,137 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 [2021-01-07 00:08:15,573 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-01-07 00:08:15,603 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-01-07 00:08:15,607 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-01-07 00:08:15,608 INFO L271 PluginConnector]: Initializing CDTParser... [2021-01-07 00:08:15,609 INFO L275 PluginConnector]: CDTParser initialized [2021-01-07 00:08:15,610 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 [2021-01-07 00:08:15,702 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/data/9cbb81061/c2afbf5c98e647f1b5a2a071d3b88d6b/FLAGf9eb27623 [2021-01-07 00:08:16,768 INFO L306 CDTParser]: Found 1 translation units. [2021-01-07 00:08:16,769 INFO L160 CDTParser]: Scanning /storage/repos/ultimate-bitabs/releaseScripts/default/sv-benchmarks/c/aws-c-common/aws_hash_table_clear_harness.i [2021-01-07 00:08:16,836 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/data/9cbb81061/c2afbf5c98e647f1b5a2a071d3b88d6b/FLAGf9eb27623 [2021-01-07 00:08:17,198 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/data/9cbb81061/c2afbf5c98e647f1b5a2a071d3b88d6b [2021-01-07 00:08:17,202 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-01-07 00:08:17,206 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-01-07 00:08:17,210 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-01-07 00:08:17,210 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-01-07 00:08:17,215 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-01-07 00:08:17,215 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.01 12:08:17" (1/1) ... [2021-01-07 00:08:17,218 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4b925e01 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.01 12:08:17, skipping insertion in model container [2021-01-07 00:08:17,218 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.01 12:08:17" (1/1) ... [2021-01-07 00:08:17,227 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-01-07 00:08:17,452 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-01-07 00:08:17,904 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] [2021-01-07 00:08:17,916 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] [2021-01-07 00:08:17,950 WARN L612 FunctionHandler]: implicit declaration of function __builtin_uaddl_overflow [2021-01-07 00:08:17,958 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]]]] [2021-01-07 00:08:19,303 WARN L1512 CHandler]: Possible shadowing of function index [2021-01-07 00:08:19,307 WARN L1512 CHandler]: Possible shadowing of function index [2021-01-07 00:08:19,308 WARN L1512 CHandler]: Possible shadowing of function index [2021-01-07 00:08:19,309 WARN L1512 CHandler]: Possible shadowing of function index [2021-01-07 00:08:19,311 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,] [2021-01-07 00:08:19,330 WARN L1512 CHandler]: Possible shadowing of function index [2021-01-07 00:08:19,331 WARN L1512 CHandler]: Possible shadowing of function index [2021-01-07 00:08:19,333 WARN L1512 CHandler]: Possible shadowing of function index [2021-01-07 00:08:19,334 WARN L1512 CHandler]: Possible shadowing of function index left hand side expression in assignment: address: IdentifierExpression[~val,] [2021-01-07 00:08:19,337 WARN L1512 CHandler]: Possible shadowing of function index [2021-01-07 00:08:19,339 WARN L1512 CHandler]: Possible shadowing of function index [2021-01-07 00:08:19,340 WARN L1512 CHandler]: Possible shadowing of function index [2021-01-07 00:08:19,341 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]]] [2021-01-07 00:08:20,022 WARN L612 FunctionHandler]: implicit declaration of function __atomic_load_n [2021-01-07 00:08:20,024 WARN L612 FunctionHandler]: implicit declaration of function __atomic_store_n [2021-01-07 00:08:20,025 WARN L612 FunctionHandler]: implicit declaration of function __atomic_exchange_n [2021-01-07 00:08:20,027 WARN L612 FunctionHandler]: implicit declaration of function __atomic_compare_exchange_n [2021-01-07 00:08:20,029 WARN L612 FunctionHandler]: implicit declaration of function __atomic_fetch_add [2021-01-07 00:08:20,031 WARN L612 FunctionHandler]: implicit declaration of function __atomic_fetch_sub [2021-01-07 00:08:20,032 WARN L612 FunctionHandler]: implicit declaration of function __atomic_fetch_or [2021-01-07 00:08:20,033 WARN L612 FunctionHandler]: implicit declaration of function __atomic_fetch_and [2021-01-07 00:08:20,033 WARN L612 FunctionHandler]: implicit declaration of function __atomic_fetch_xor [2021-01-07 00:08:20,034 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]]]]] [2021-01-07 00:08:20,326 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,] [2021-01-07 00:08:20,763 WARN L1512 CHandler]: Possible shadowing of function index [2021-01-07 00:08:20,764 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,] [2021-01-07 00:08:20,801 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,] [2021-01-07 00:08:20,802 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,] [2021-01-07 00:08:20,812 WARN L1512 CHandler]: Possible shadowing of function index [2021-01-07 00:08:20,813 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]]]] [2021-01-07 00:08:20,836 WARN L1512 CHandler]: Possible shadowing of function index [2021-01-07 00:08:20,838 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]]]]]] [2021-01-07 00:08:20,839 WARN L1512 CHandler]: Possible shadowing of function index left hand side expression in assignment: lhs: VariableLHS[~index~3,] [2021-01-07 00:08:20,839 WARN L1512 CHandler]: Possible shadowing of function index [2021-01-07 00:08:20,840 WARN L1512 CHandler]: Possible shadowing of function index [2021-01-07 00:08:20,840 WARN L1512 CHandler]: Possible shadowing of function index [2021-01-07 00:08:20,841 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]]]] [2021-01-07 00:08:20,889 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-01-07 00:08:20,928 INFO L203 MainTranslator]: Completed pre-run [2021-01-07 00:08:20,945 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] [2021-01-07 00:08:20,946 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] [2021-01-07 00:08:20,949 WARN L612 FunctionHandler]: implicit declaration of function __builtin_uaddl_overflow [2021-01-07 00:08:20,950 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]]]] [2021-01-07 00:08:21,034 WARN L1512 CHandler]: Possible shadowing of function index [2021-01-07 00:08:21,035 WARN L1512 CHandler]: Possible shadowing of function index [2021-01-07 00:08:21,035 WARN L1512 CHandler]: Possible shadowing of function index [2021-01-07 00:08:21,036 WARN L1512 CHandler]: Possible shadowing of function index [2021-01-07 00:08:21,039 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,] [2021-01-07 00:08:21,055 WARN L1512 CHandler]: Possible shadowing of function index [2021-01-07 00:08:21,059 WARN L1512 CHandler]: Possible shadowing of function index [2021-01-07 00:08:21,061 WARN L1512 CHandler]: Possible shadowing of function index [2021-01-07 00:08:21,062 WARN L1512 CHandler]: Possible shadowing of function index left hand side expression in assignment: address: IdentifierExpression[~val,] [2021-01-07 00:08:21,063 WARN L1512 CHandler]: Possible shadowing of function index [2021-01-07 00:08:21,064 WARN L1512 CHandler]: Possible shadowing of function index [2021-01-07 00:08:21,065 WARN L1512 CHandler]: Possible shadowing of function index [2021-01-07 00:08:21,065 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]]] [2021-01-07 00:08:21,136 WARN L612 FunctionHandler]: implicit declaration of function __atomic_load_n [2021-01-07 00:08:21,138 WARN L612 FunctionHandler]: implicit declaration of function __atomic_store_n [2021-01-07 00:08:21,140 WARN L612 FunctionHandler]: implicit declaration of function __atomic_exchange_n [2021-01-07 00:08:21,141 WARN L612 FunctionHandler]: implicit declaration of function __atomic_compare_exchange_n [2021-01-07 00:08:21,142 WARN L612 FunctionHandler]: implicit declaration of function __atomic_fetch_add [2021-01-07 00:08:21,213 WARN L612 FunctionHandler]: implicit declaration of function __atomic_fetch_sub [2021-01-07 00:08:21,215 WARN L612 FunctionHandler]: implicit declaration of function __atomic_fetch_or [2021-01-07 00:08:21,216 WARN L612 FunctionHandler]: implicit declaration of function __atomic_fetch_and [2021-01-07 00:08:21,217 WARN L612 FunctionHandler]: implicit declaration of function __atomic_fetch_xor [2021-01-07 00:08:21,217 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]]]]] [2021-01-07 00:08:21,278 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,] [2021-01-07 00:08:21,508 WARN L1512 CHandler]: Possible shadowing of function index [2021-01-07 00:08:21,509 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,] [2021-01-07 00:08:21,522 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,] [2021-01-07 00:08:21,524 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,] [2021-01-07 00:08:21,528 WARN L1512 CHandler]: Possible shadowing of function index [2021-01-07 00:08:21,529 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]]]] [2021-01-07 00:08:21,550 WARN L1512 CHandler]: Possible shadowing of function index [2021-01-07 00:08:21,551 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]]]]]] [2021-01-07 00:08:21,552 WARN L1512 CHandler]: Possible shadowing of function index left hand side expression in assignment: lhs: VariableLHS[~index~3,] [2021-01-07 00:08:21,553 WARN L1512 CHandler]: Possible shadowing of function index [2021-01-07 00:08:21,553 WARN L1512 CHandler]: Possible shadowing of function index [2021-01-07 00:08:21,554 WARN L1512 CHandler]: Possible shadowing of function index [2021-01-07 00:08:21,554 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]]]] [2021-01-07 00:08:21,588 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-01-07 00:08:23,079 INFO L208 MainTranslator]: Completed translation [2021-01-07 00:08:23,079 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.01 12:08:23 WrapperNode [2021-01-07 00:08:23,079 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-01-07 00:08:23,081 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-01-07 00:08:23,081 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-01-07 00:08:23,081 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-01-07 00:08:23,089 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.01 12:08:23" (1/1) ... [2021-01-07 00:08:23,260 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.01 12:08:23" (1/1) ... [2021-01-07 00:08:23,380 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-01-07 00:08:23,382 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-01-07 00:08:23,382 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-01-07 00:08:23,382 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-01-07 00:08:23,395 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.01 12:08:23" (1/1) ... [2021-01-07 00:08:23,396 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.01 12:08:23" (1/1) ... [2021-01-07 00:08:23,416 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.01 12:08:23" (1/1) ... [2021-01-07 00:08:23,417 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.01 12:08:23" (1/1) ... [2021-01-07 00:08:23,482 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.01 12:08:23" (1/1) ... [2021-01-07 00:08:23,491 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.01 12:08:23" (1/1) ... [2021-01-07 00:08:23,506 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.01 12:08:23" (1/1) ... [2021-01-07 00:08:23,533 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-01-07 00:08:23,534 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-01-07 00:08:23,534 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-01-07 00:08:23,535 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-01-07 00:08:23,536 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.01 12:08:23" (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 [2021-01-07 00:08:23,659 INFO L130 BoogieDeclarations]: Found specification of procedure read~real [2021-01-07 00:08:23,659 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2021-01-07 00:08:23,659 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2021-01-07 00:08:23,660 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2021-01-07 00:08:23,660 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-01-07 00:08:23,660 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-01-07 00:08:23,660 INFO L130 BoogieDeclarations]: Found specification of procedure __builtin_uaddl_overflow [2021-01-07 00:08:23,660 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-01-07 00:08:23,660 INFO L130 BoogieDeclarations]: Found specification of procedure __builtin_umull_overflow [2021-01-07 00:08:23,661 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2021-01-07 00:08:23,661 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-01-07 00:08:23,661 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-01-07 00:08:23,661 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2021-01-07 00:08:23,661 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-01-07 00:08:33,952 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-01-07 00:08:33,952 INFO L299 CfgBuilder]: Removed 126 assume(true) statements. [2021-01-07 00:08:33,954 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.01 12:08:33 BoogieIcfgContainer [2021-01-07 00:08:33,954 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-01-07 00:08:33,967 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-01-07 00:08:33,967 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-01-07 00:08:33,972 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-01-07 00:08:33,974 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.01 12:08:17" (1/3) ... [2021-01-07 00:08:33,975 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7045bc9e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.01 12:08:33, skipping insertion in model container [2021-01-07 00:08:33,975 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.01 12:08:23" (2/3) ... [2021-01-07 00:08:33,976 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7045bc9e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.01 12:08:33, skipping insertion in model container [2021-01-07 00:08:33,976 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.01 12:08:33" (3/3) ... [2021-01-07 00:08:33,977 INFO L111 eAbstractionObserver]: Analyzing ICFG aws_hash_table_clear_harness.i [2021-01-07 00:08:33,984 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-01-07 00:08:33,990 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 5 error locations. [2021-01-07 00:08:34,009 INFO L253 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2021-01-07 00:08:34,035 INFO L377 AbstractCegarLoop]: Interprodecural is true [2021-01-07 00:08:34,035 INFO L378 AbstractCegarLoop]: Hoare is true [2021-01-07 00:08:34,036 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2021-01-07 00:08:34,036 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2021-01-07 00:08:34,036 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-01-07 00:08:34,036 INFO L382 AbstractCegarLoop]: Difference is false [2021-01-07 00:08:34,036 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-01-07 00:08:34,036 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2021-01-07 00:08:34,054 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states. [2021-01-07 00:08:34,062 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2021-01-07 00:08:34,062 INFO L414 BasicCegarLoop]: Found error trace [2021-01-07 00:08:34,063 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] [2021-01-07 00:08:34,063 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]=== [2021-01-07 00:08:34,069 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-07 00:08:34,069 INFO L82 PathProgramCache]: Analyzing trace with hash -662474665, now seen corresponding path program 1 times [2021-01-07 00:08:34,078 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-07 00:08:34,078 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [650100238] [2021-01-07 00:08:34,078 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-07 00:08:34,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 00:08:34,915 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-07 00:08:34,915 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [650100238] [2021-01-07 00:08:34,916 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-07 00:08:34,917 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-01-07 00:08:34,918 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [764050224] [2021-01-07 00:08:34,923 INFO L461 AbstractCegarLoop]: Interpolant automaton has 2 states [2021-01-07 00:08:34,923 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-07 00:08:34,938 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2021-01-07 00:08:34,939 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2021-01-07 00:08:34,941 INFO L87 Difference]: Start difference. First operand 130 states. Second operand 2 states. [2021-01-07 00:08:34,975 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-07 00:08:34,976 INFO L93 Difference]: Finished difference Result 256 states and 341 transitions. [2021-01-07 00:08:34,976 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-01-07 00:08:34,977 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 57 [2021-01-07 00:08:34,978 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-07 00:08:34,989 INFO L225 Difference]: With dead ends: 256 [2021-01-07 00:08:34,989 INFO L226 Difference]: Without dead ends: 124 [2021-01-07 00:08:34,993 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 [2021-01-07 00:08:35,013 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124 states. [2021-01-07 00:08:35,036 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124 to 124. [2021-01-07 00:08:35,038 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 124 states. [2021-01-07 00:08:35,041 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 148 transitions. [2021-01-07 00:08:35,042 INFO L78 Accepts]: Start accepts. Automaton has 124 states and 148 transitions. Word has length 57 [2021-01-07 00:08:35,043 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-07 00:08:35,043 INFO L481 AbstractCegarLoop]: Abstraction has 124 states and 148 transitions. [2021-01-07 00:08:35,043 INFO L482 AbstractCegarLoop]: Interpolant automaton has 2 states. [2021-01-07 00:08:35,043 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 148 transitions. [2021-01-07 00:08:35,045 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2021-01-07 00:08:35,045 INFO L414 BasicCegarLoop]: Found error trace [2021-01-07 00:08:35,046 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] [2021-01-07 00:08:35,046 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-01-07 00:08:35,046 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]=== [2021-01-07 00:08:35,047 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-07 00:08:35,047 INFO L82 PathProgramCache]: Analyzing trace with hash -683098601, now seen corresponding path program 1 times [2021-01-07 00:08:35,047 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-07 00:08:35,048 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1510112067] [2021-01-07 00:08:35,048 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-07 00:08:35,188 ERROR L270 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-01-07 00:08:35,188 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1706137579] [2021-01-07 00:08:35,188 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 [2021-01-07 00:08:37,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 00:08:37,072 INFO L263 TraceCheckSpWp]: Trace formula consists of 2498 conjuncts, 2 conjunts are in the unsatisfiable core [2021-01-07 00:08:37,091 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-01-07 00:08:37,225 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-07 00:08:37,225 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1510112067] [2021-01-07 00:08:37,226 WARN L332 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2021-01-07 00:08:37,226 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1706137579] [2021-01-07 00:08:37,226 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-07 00:08:37,226 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-07 00:08:37,227 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1091240478] [2021-01-07 00:08:37,228 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-07 00:08:37,228 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-07 00:08:37,229 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-07 00:08:37,230 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-07 00:08:37,230 INFO L87 Difference]: Start difference. First operand 124 states and 148 transitions. Second operand 3 states. [2021-01-07 00:08:37,279 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-07 00:08:37,279 INFO L93 Difference]: Finished difference Result 173 states and 204 transitions. [2021-01-07 00:08:37,280 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-07 00:08:37,280 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 57 [2021-01-07 00:08:37,281 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-07 00:08:37,283 INFO L225 Difference]: With dead ends: 173 [2021-01-07 00:08:37,283 INFO L226 Difference]: Without dead ends: 125 [2021-01-07 00:08:37,285 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 [2021-01-07 00:08:37,286 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states. [2021-01-07 00:08:37,297 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 125. [2021-01-07 00:08:37,298 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 125 states. [2021-01-07 00:08:37,300 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 149 transitions. [2021-01-07 00:08:37,301 INFO L78 Accepts]: Start accepts. Automaton has 125 states and 149 transitions. Word has length 57 [2021-01-07 00:08:37,301 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-07 00:08:37,302 INFO L481 AbstractCegarLoop]: Abstraction has 125 states and 149 transitions. [2021-01-07 00:08:37,302 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-07 00:08:37,302 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 149 transitions. [2021-01-07 00:08:37,304 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2021-01-07 00:08:37,304 INFO L414 BasicCegarLoop]: Found error trace [2021-01-07 00:08:37,305 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] [2021-01-07 00:08:37,520 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable1 [2021-01-07 00:08:37,521 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]=== [2021-01-07 00:08:37,522 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-07 00:08:37,523 INFO L82 PathProgramCache]: Analyzing trace with hash 1091908761, now seen corresponding path program 1 times [2021-01-07 00:08:37,523 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-07 00:08:37,524 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1320518884] [2021-01-07 00:08:37,524 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-07 00:08:37,637 ERROR L270 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-01-07 00:08:37,638 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2316579] [2021-01-07 00:08:37,638 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 [2021-01-07 00:08:39,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 00:08:39,597 INFO L263 TraceCheckSpWp]: Trace formula consists of 2503 conjuncts, 18 conjunts are in the unsatisfiable core [2021-01-07 00:08:39,605 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-01-07 00:08:39,786 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-07 00:08:39,787 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1320518884] [2021-01-07 00:08:39,787 WARN L332 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2021-01-07 00:08:39,787 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2316579] [2021-01-07 00:08:39,787 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-07 00:08:39,787 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-01-07 00:08:39,788 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1077795317] [2021-01-07 00:08:39,788 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-01-07 00:08:39,789 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-07 00:08:39,790 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-01-07 00:08:39,790 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-01-07 00:08:39,790 INFO L87 Difference]: Start difference. First operand 125 states and 149 transitions. Second operand 5 states. [2021-01-07 00:08:39,980 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-07 00:08:39,980 INFO L93 Difference]: Finished difference Result 125 states and 149 transitions. [2021-01-07 00:08:39,981 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-01-07 00:08:39,981 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 57 [2021-01-07 00:08:39,982 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-07 00:08:39,984 INFO L225 Difference]: With dead ends: 125 [2021-01-07 00:08:39,984 INFO L226 Difference]: Without dead ends: 123 [2021-01-07 00:08:39,985 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 [2021-01-07 00:08:39,986 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2021-01-07 00:08:39,996 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 123. [2021-01-07 00:08:39,996 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 123 states. [2021-01-07 00:08:39,998 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 147 transitions. [2021-01-07 00:08:39,998 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 147 transitions. Word has length 57 [2021-01-07 00:08:39,999 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-07 00:08:39,999 INFO L481 AbstractCegarLoop]: Abstraction has 123 states and 147 transitions. [2021-01-07 00:08:39,999 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2021-01-07 00:08:39,999 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 147 transitions. [2021-01-07 00:08:40,001 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2021-01-07 00:08:40,002 INFO L414 BasicCegarLoop]: Found error trace [2021-01-07 00:08:40,002 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] [2021-01-07 00:08:40,216 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-01-07 00:08:40,217 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]=== [2021-01-07 00:08:40,217 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-07 00:08:40,217 INFO L82 PathProgramCache]: Analyzing trace with hash 1352431387, now seen corresponding path program 1 times [2021-01-07 00:08:40,218 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-07 00:08:40,218 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1822852178] [2021-01-07 00:08:40,218 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-07 00:08:40,375 ERROR L270 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-01-07 00:08:40,378 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [585062669] [2021-01-07 00:08:40,378 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 [2021-01-07 00:08:42,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 00:08:42,385 INFO L263 TraceCheckSpWp]: Trace formula consists of 2512 conjuncts, 20 conjunts are in the unsatisfiable core [2021-01-07 00:08:42,393 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-01-07 00:08:42,551 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-07 00:08:42,552 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1822852178] [2021-01-07 00:08:42,552 WARN L332 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2021-01-07 00:08:42,552 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [585062669] [2021-01-07 00:08:42,552 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-07 00:08:42,553 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-01-07 00:08:42,553 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1141438186] [2021-01-07 00:08:42,553 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-01-07 00:08:42,554 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-07 00:08:42,554 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-01-07 00:08:42,554 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-01-07 00:08:42,555 INFO L87 Difference]: Start difference. First operand 123 states and 147 transitions. Second operand 6 states. [2021-01-07 00:08:42,934 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-07 00:08:42,934 INFO L93 Difference]: Finished difference Result 234 states and 274 transitions. [2021-01-07 00:08:42,935 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-01-07 00:08:42,935 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 59 [2021-01-07 00:08:42,936 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-07 00:08:42,937 INFO L225 Difference]: With dead ends: 234 [2021-01-07 00:08:42,937 INFO L226 Difference]: Without dead ends: 143 [2021-01-07 00:08:42,939 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 54 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2021-01-07 00:08:42,940 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 143 states. [2021-01-07 00:08:42,949 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 143 to 123. [2021-01-07 00:08:42,949 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 123 states. [2021-01-07 00:08:42,950 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 145 transitions. [2021-01-07 00:08:42,950 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 145 transitions. Word has length 59 [2021-01-07 00:08:42,951 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-07 00:08:42,951 INFO L481 AbstractCegarLoop]: Abstraction has 123 states and 145 transitions. [2021-01-07 00:08:42,951 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2021-01-07 00:08:42,951 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 145 transitions. [2021-01-07 00:08:42,953 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2021-01-07 00:08:42,953 INFO L414 BasicCegarLoop]: Found error trace [2021-01-07 00:08:42,953 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] [2021-01-07 00:08:43,168 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-01-07 00:08:43,169 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]=== [2021-01-07 00:08:43,170 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-07 00:08:43,171 INFO L82 PathProgramCache]: Analyzing trace with hash -1755526949, now seen corresponding path program 1 times [2021-01-07 00:08:43,171 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-07 00:08:43,172 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1285845930] [2021-01-07 00:08:43,172 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-07 00:08:43,315 ERROR L270 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-01-07 00:08:43,316 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1313682722] [2021-01-07 00:08:43,317 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 [2021-01-07 00:08:45,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 00:08:45,283 INFO L263 TraceCheckSpWp]: Trace formula consists of 2554 conjuncts, 23 conjunts are in the unsatisfiable core [2021-01-07 00:08:45,290 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-01-07 00:08:45,416 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-07 00:08:45,507 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-07 00:08:45,510 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-07 00:08:45,512 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-01-07 00:08:45,562 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 [2021-01-07 00:08:45,564 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-07 00:08:45,572 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 [2021-01-07 00:08:45,575 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-01-07 00:08:45,608 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 00:08:45,616 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 [2021-01-07 00:08:45,619 INFO L547 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-01-07 00:08:45,626 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 [2021-01-07 00:08:45,628 INFO L547 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-01-07 00:08:45,640 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 00:08:45,641 INFO L547 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 2 xjuncts. [2021-01-07 00:08:45,641 INFO L244 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:47, output treesize:9 [2021-01-07 00:08:45,719 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-07 00:08:45,720 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1285845930] [2021-01-07 00:08:45,720 WARN L332 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2021-01-07 00:08:45,720 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1313682722] [2021-01-07 00:08:45,720 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-07 00:08:45,720 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-01-07 00:08:45,721 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2018459529] [2021-01-07 00:08:45,721 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-01-07 00:08:45,721 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-07 00:08:45,722 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-01-07 00:08:45,722 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-01-07 00:08:45,723 INFO L87 Difference]: Start difference. First operand 123 states and 145 transitions. Second operand 5 states. [2021-01-07 00:08:50,041 WARN L197 SmtUtils]: Spent 106.00 ms on a formula simplification that was a NOOP. DAG size: 25 [2021-01-07 00:08:50,188 WARN L197 SmtUtils]: Spent 128.00 ms on a formula simplification that was a NOOP. DAG size: 32 [2021-01-07 00:08:51,070 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-07 00:08:51,070 INFO L93 Difference]: Finished difference Result 329 states and 388 transitions. [2021-01-07 00:08:51,071 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-01-07 00:08:51,072 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 63 [2021-01-07 00:08:51,072 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-07 00:08:51,073 INFO L225 Difference]: With dead ends: 329 [2021-01-07 00:08:51,074 INFO L226 Difference]: Without dead ends: 240 [2021-01-07 00:08:51,075 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 59 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2021-01-07 00:08:51,075 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 240 states. [2021-01-07 00:08:51,086 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 240 to 135. [2021-01-07 00:08:51,087 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 135 states. [2021-01-07 00:08:51,087 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 159 transitions. [2021-01-07 00:08:51,088 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 159 transitions. Word has length 63 [2021-01-07 00:08:51,088 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-07 00:08:51,088 INFO L481 AbstractCegarLoop]: Abstraction has 135 states and 159 transitions. [2021-01-07 00:08:51,088 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2021-01-07 00:08:51,088 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 159 transitions. [2021-01-07 00:08:51,090 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2021-01-07 00:08:51,090 INFO L414 BasicCegarLoop]: Found error trace [2021-01-07 00:08:51,090 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] [2021-01-07 00:08:51,302 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-01-07 00:08:51,303 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]=== [2021-01-07 00:08:51,304 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-07 00:08:51,304 INFO L82 PathProgramCache]: Analyzing trace with hash -352097637, now seen corresponding path program 1 times [2021-01-07 00:08:51,305 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-07 00:08:51,305 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1696741891] [2021-01-07 00:08:51,306 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-07 00:08:51,416 ERROR L270 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-01-07 00:08:51,417 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [389375355] [2021-01-07 00:08:51,417 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 [2021-01-07 00:08:53,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 00:08:53,330 INFO L263 TraceCheckSpWp]: Trace formula consists of 2544 conjuncts, 3 conjunts are in the unsatisfiable core [2021-01-07 00:08:53,335 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-01-07 00:08:53,462 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-07 00:08:53,463 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1696741891] [2021-01-07 00:08:53,463 WARN L332 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2021-01-07 00:08:53,463 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [389375355] [2021-01-07 00:08:53,464 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-07 00:08:53,464 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-01-07 00:08:53,464 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [692543450] [2021-01-07 00:08:53,465 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-07 00:08:53,465 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-07 00:08:53,465 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-07 00:08:53,472 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-01-07 00:08:53,473 INFO L87 Difference]: Start difference. First operand 135 states and 159 transitions. Second operand 4 states. [2021-01-07 00:08:53,654 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-07 00:08:53,655 INFO L93 Difference]: Finished difference Result 235 states and 274 transitions. [2021-01-07 00:08:53,655 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-01-07 00:08:53,656 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 63 [2021-01-07 00:08:53,656 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-07 00:08:53,657 INFO L225 Difference]: With dead ends: 235 [2021-01-07 00:08:53,657 INFO L226 Difference]: Without dead ends: 131 [2021-01-07 00:08:53,662 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 [2021-01-07 00:08:53,663 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states. [2021-01-07 00:08:53,676 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 127. [2021-01-07 00:08:53,676 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 127 states. [2021-01-07 00:08:53,677 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 143 transitions. [2021-01-07 00:08:53,677 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 143 transitions. Word has length 63 [2021-01-07 00:08:53,677 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-07 00:08:53,677 INFO L481 AbstractCegarLoop]: Abstraction has 127 states and 143 transitions. [2021-01-07 00:08:53,678 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-07 00:08:53,678 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 143 transitions. [2021-01-07 00:08:53,679 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2021-01-07 00:08:53,679 INFO L414 BasicCegarLoop]: Found error trace [2021-01-07 00:08:53,679 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] [2021-01-07 00:08:53,892 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2021-01-07 00:08:53,893 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]=== [2021-01-07 00:08:53,893 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-07 00:08:53,894 INFO L82 PathProgramCache]: Analyzing trace with hash -1312374044, now seen corresponding path program 1 times [2021-01-07 00:08:53,894 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-07 00:08:53,895 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1286714849] [2021-01-07 00:08:53,895 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-07 00:08:53,990 ERROR L270 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-01-07 00:08:53,991 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [101610201] [2021-01-07 00:08:53,991 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 [2021-01-07 00:08:56,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 00:08:56,130 INFO L263 TraceCheckSpWp]: Trace formula consists of 2604 conjuncts, 17 conjunts are in the unsatisfiable core [2021-01-07 00:08:56,135 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-01-07 00:08:56,197 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-07 00:08:56,279 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-07 00:08:56,281 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1286714849] [2021-01-07 00:08:56,281 WARN L332 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2021-01-07 00:08:56,281 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [101610201] [2021-01-07 00:08:56,281 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-07 00:08:56,281 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-01-07 00:08:56,282 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1645248061] [2021-01-07 00:08:56,283 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-07 00:08:56,283 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-07 00:08:56,283 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-07 00:08:56,284 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-01-07 00:08:56,284 INFO L87 Difference]: Start difference. First operand 127 states and 143 transitions. Second operand 4 states. [2021-01-07 00:08:56,401 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-07 00:08:56,401 INFO L93 Difference]: Finished difference Result 232 states and 260 transitions. [2021-01-07 00:08:56,402 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-01-07 00:08:56,402 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 65 [2021-01-07 00:08:56,403 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-07 00:08:56,404 INFO L225 Difference]: With dead ends: 232 [2021-01-07 00:08:56,404 INFO L226 Difference]: Without dead ends: 127 [2021-01-07 00:08:56,409 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 [2021-01-07 00:08:56,410 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2021-01-07 00:08:56,426 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 127. [2021-01-07 00:08:56,426 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 127 states. [2021-01-07 00:08:56,427 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 141 transitions. [2021-01-07 00:08:56,427 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 141 transitions. Word has length 65 [2021-01-07 00:08:56,428 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-07 00:08:56,428 INFO L481 AbstractCegarLoop]: Abstraction has 127 states and 141 transitions. [2021-01-07 00:08:56,428 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-07 00:08:56,429 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 141 transitions. [2021-01-07 00:08:56,439 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2021-01-07 00:08:56,439 INFO L414 BasicCegarLoop]: Found error trace [2021-01-07 00:08:56,440 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] [2021-01-07 00:08:56,654 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,7 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-01-07 00:08:56,655 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]=== [2021-01-07 00:08:56,656 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-07 00:08:56,656 INFO L82 PathProgramCache]: Analyzing trace with hash -108050539, now seen corresponding path program 1 times [2021-01-07 00:08:56,657 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-07 00:08:56,657 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1410304737] [2021-01-07 00:08:56,657 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-07 00:08:56,795 ERROR L270 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-01-07 00:08:56,796 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1344890976] [2021-01-07 00:08:56,796 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 [2021-01-07 00:09:01,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 00:09:01,721 INFO L263 TraceCheckSpWp]: Trace formula consists of 2677 conjuncts, 142 conjunts are in the unsatisfiable core [2021-01-07 00:09:01,730 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-01-07 00:09:01,764 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 [2021-01-07 00:09:01,765 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-07 00:09:01,797 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 00:09:01,799 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-01-07 00:09:01,800 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:19, output treesize:18 [2021-01-07 00:09:02,374 WARN L197 SmtUtils]: Spent 484.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 51 [2021-01-07 00:09:02,375 INFO L348 Elim1Store]: treesize reduction 45, result has 71.3 percent of original size [2021-01-07 00:09:02,376 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 [2021-01-07 00:09:02,387 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-07 00:09:02,393 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-07 00:09:02,398 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-07 00:09:02,580 WARN L197 SmtUtils]: Spent 181.00 ms on a formula simplification. DAG size of input: 38 DAG size of output: 32 [2021-01-07 00:09:02,582 INFO L625 ElimStorePlain]: treesize reduction 12, result has 80.0 percent of original size [2021-01-07 00:09:02,586 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. [2021-01-07 00:09:02,587 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:57, output treesize:48 [2021-01-07 00:09:03,209 WARN L197 SmtUtils]: Spent 430.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 49 [2021-01-07 00:09:03,210 INFO L348 Elim1Store]: treesize reduction 24, result has 82.0 percent of original size [2021-01-07 00:09:03,210 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 [2021-01-07 00:09:03,220 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-07 00:09:03,415 WARN L197 SmtUtils]: Spent 194.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 33 [2021-01-07 00:09:03,416 INFO L625 ElimStorePlain]: treesize reduction 26, result has 65.8 percent of original size [2021-01-07 00:09:03,419 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. [2021-01-07 00:09:03,420 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:56, output treesize:50 [2021-01-07 00:09:03,591 WARN L197 SmtUtils]: Spent 149.00 ms on a formula simplification. DAG size of input: 35 DAG size of output: 31 [2021-01-07 00:09:03,727 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 00:09:03,728 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 [2021-01-07 00:09:03,736 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-07 00:09:03,883 WARN L197 SmtUtils]: Spent 146.00 ms on a formula simplification. DAG size of input: 36 DAG size of output: 28 [2021-01-07 00:09:03,884 INFO L625 ElimStorePlain]: treesize reduction 16, result has 71.9 percent of original size [2021-01-07 00:09:03,892 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. [2021-01-07 00:09:03,892 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:51, output treesize:41 [2021-01-07 00:09:04,090 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-07 00:09:04,248 WARN L197 SmtUtils]: Spent 152.00 ms on a formula simplification that was a NOOP. DAG size: 49 [2021-01-07 00:09:04,249 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 00:09:04,249 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 7 case distinctions, treesize of input 27 treesize of output 112 [2021-01-07 00:09:04,257 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-07 00:09:04,561 WARN L197 SmtUtils]: Spent 303.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 44 [2021-01-07 00:09:04,562 INFO L625 ElimStorePlain]: treesize reduction 42, result has 62.8 percent of original size [2021-01-07 00:09:04,568 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2021-01-07 00:09:04,572 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2021-01-07 00:09:04,574 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-01-07 00:09:04,576 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-01-07 00:09:04,578 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 8 disjuncts [2021-01-07 00:09:04,583 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2021-01-07 00:09:04,587 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-01-07 00:09:04,591 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 8 disjuncts [2021-01-07 00:09:04,608 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-01-07 00:09:04,610 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2021-01-07 00:09:04,614 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2021-01-07 00:09:04,620 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. [2021-01-07 00:09:04,620 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:56, output treesize:71 [2021-01-07 00:09:04,626 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2021-01-07 00:09:04,638 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2021-01-07 00:09:04,642 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-01-07 00:09:04,644 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-01-07 00:09:04,646 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 8 disjuncts [2021-01-07 00:09:04,649 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2021-01-07 00:09:04,653 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-01-07 00:09:04,656 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 8 disjuncts [2021-01-07 00:09:04,669 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-01-07 00:09:04,670 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2021-01-07 00:09:04,671 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2021-01-07 00:09:04,817 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2021-01-07 00:09:04,819 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2021-01-07 00:09:04,821 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-01-07 00:09:04,823 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-01-07 00:09:04,825 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2021-01-07 00:09:04,826 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2021-01-07 00:09:04,827 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2021-01-07 00:09:04,829 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 13 disjuncts [2021-01-07 00:09:04,834 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2021-01-07 00:09:04,836 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-01-07 00:09:04,839 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2021-01-07 00:09:04,841 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 13 disjuncts [2021-01-07 00:09:04,867 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2021-01-07 00:09:04,869 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2021-01-07 00:09:04,872 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-01-07 00:09:04,874 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 12 disjuncts [2021-01-07 00:09:04,907 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-07 00:09:04,986 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 00:09:04,986 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 41 [2021-01-07 00:09:04,991 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-07 00:09:05,017 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-07 00:09:05,220 WARN L197 SmtUtils]: Spent 103.00 ms on a formula simplification that was a NOOP. DAG size: 38 [2021-01-07 00:09:05,221 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 00:09:05,221 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 5 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 6 case distinctions, treesize of input 32 treesize of output 95 [2021-01-07 00:09:05,230 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-01-07 00:09:05,253 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-07 00:09:05,288 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 00:09:05,288 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 41 [2021-01-07 00:09:05,293 INFO L547 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-01-07 00:09:06,055 WARN L197 SmtUtils]: Spent 761.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 55 [2021-01-07 00:09:06,056 INFO L625 ElimStorePlain]: treesize reduction 78, result has 71.4 percent of original size [2021-01-07 00:09:06,078 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 [2021-01-07 00:09:06,080 INFO L547 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-01-07 00:09:06,096 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 [2021-01-07 00:09:06,098 INFO L547 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2021-01-07 00:09:06,114 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 [2021-01-07 00:09:06,115 INFO L547 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2021-01-07 00:09:06,428 WARN L197 SmtUtils]: Spent 312.00 ms on a formula simplification that was a NOOP. DAG size: 53 [2021-01-07 00:09:06,428 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 00:09:06,452 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 [2021-01-07 00:09:06,453 INFO L547 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2021-01-07 00:09:06,470 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 [2021-01-07 00:09:06,471 INFO L547 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2021-01-07 00:09:06,488 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 [2021-01-07 00:09:06,489 INFO L547 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2021-01-07 00:09:06,789 WARN L197 SmtUtils]: Spent 299.00 ms on a formula simplification that was a NOOP. DAG size: 51 [2021-01-07 00:09:06,790 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 00:09:06,799 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-01-07 00:09:06,806 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2021-01-07 00:09:06,807 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 9 disjuncts [2021-01-07 00:09:06,827 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. [2021-01-07 00:09:06,827 INFO L244 ElimStorePlain]: Needed 10 recursive calls to eliminate 8 variables, input treesize:237, output treesize:162 [2021-01-07 00:09:06,840 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2021-01-07 00:09:06,842 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-01-07 00:09:06,844 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 9 disjuncts [2021-01-07 00:09:09,665 WARN L197 SmtUtils]: Spent 2.77 s on a formula simplification. DAG size of input: 79 DAG size of output: 61 [2021-01-07 00:09:09,685 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2021-01-07 00:09:09,686 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-01-07 00:09:09,688 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 9 disjuncts [2021-01-07 00:09:10,412 WARN L197 SmtUtils]: Spent 639.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 60 [2021-01-07 00:09:10,553 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2021-01-07 00:09:10,555 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-01-07 00:09:10,557 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 9 disjuncts [2021-01-07 00:09:10,724 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2021-01-07 00:09:10,726 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-01-07 00:09:10,728 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 9 disjuncts [2021-01-07 00:09:10,943 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2021-01-07 00:09:10,944 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-01-07 00:09:10,946 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 9 disjuncts [2021-01-07 00:09:11,140 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2021-01-07 00:09:11,141 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-01-07 00:09:11,143 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 9 disjuncts [2021-01-07 00:09:11,271 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2021-01-07 00:09:11,273 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-01-07 00:09:11,274 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 9 disjuncts [2021-01-07 00:09:11,491 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2021-01-07 00:09:11,493 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-01-07 00:09:11,495 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 9 disjuncts [2021-01-07 00:09:11,695 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2021-01-07 00:09:11,697 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-01-07 00:09:11,698 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 9 disjuncts [2021-01-07 00:09:12,283 WARN L197 SmtUtils]: Spent 487.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 64 [2021-01-07 00:09:12,339 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 9, 1] term [2021-01-07 00:09:12,340 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-01-07 00:09:12,346 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-07 00:09:12,357 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-07 00:09:12,366 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-07 00:09:12,377 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-07 00:09:12,385 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 9, 1] term [2021-01-07 00:09:12,385 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-01-07 00:09:12,465 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 00:09:12,465 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 [2021-01-07 00:09:12,467 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 3, 2, 1] term [2021-01-07 00:09:12,468 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2021-01-07 00:09:12,470 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2021-01-07 00:09:13,058 WARN L197 SmtUtils]: Spent 587.00 ms on a formula simplification. DAG size of input: 103 DAG size of output: 89 [2021-01-07 00:09:13,059 INFO L625 ElimStorePlain]: treesize reduction 62, result has 77.1 percent of original size [2021-01-07 00:09:13,080 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-07 00:09:13,092 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 [2021-01-07 00:09:13,096 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-01-07 00:09:13,317 WARN L197 SmtUtils]: Spent 220.00 ms on a formula simplification that was a NOOP. DAG size: 84 [2021-01-07 00:09:13,317 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 00:09:13,389 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 00:09:13,390 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 [2021-01-07 00:09:13,392 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 3, 2, 1] term [2021-01-07 00:09:13,393 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2021-01-07 00:09:13,397 INFO L547 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 2 xjuncts. [2021-01-07 00:09:13,966 WARN L197 SmtUtils]: Spent 568.00 ms on a formula simplification. DAG size of input: 94 DAG size of output: 80 [2021-01-07 00:09:13,967 INFO L625 ElimStorePlain]: treesize reduction 62, result has 75.7 percent of original size [2021-01-07 00:09:13,987 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-07 00:09:13,989 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 [2021-01-07 00:09:13,991 INFO L547 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-01-07 00:09:14,259 WARN L197 SmtUtils]: Spent 267.00 ms on a formula simplification that was a NOOP. DAG size: 73 [2021-01-07 00:09:14,260 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 00:09:14,272 INFO L547 ElimStorePlain]: Start of recursive call 1: 12 dim-0 vars, 4 dim-2 vars, End of recursive call: 6 dim-0 vars, and 2 xjuncts. [2021-01-07 00:09:14,272 INFO L244 ElimStorePlain]: Needed 5 recursive calls to eliminate 16 variables, input treesize:217, output treesize:133 [2021-01-07 00:09:14,613 WARN L197 SmtUtils]: Spent 208.00 ms on a formula simplification that was a NOOP. DAG size: 60 [2021-01-07 00:09:15,011 WARN L197 SmtUtils]: Spent 213.00 ms on a formula simplification that was a NOOP. DAG size: 63 [2021-01-07 00:09:15,033 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-07 00:09:15,044 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-07 00:09:15,056 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 9, 1] term [2021-01-07 00:09:15,057 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-01-07 00:09:15,095 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-07 00:09:15,103 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 48 [2021-01-07 00:09:15,106 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-07 00:09:15,377 WARN L197 SmtUtils]: Spent 270.00 ms on a formula simplification that was a NOOP. DAG size: 83 [2021-01-07 00:09:15,378 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 00:09:15,397 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-07 00:09:15,398 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 [2021-01-07 00:09:15,400 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-01-07 00:09:15,634 WARN L197 SmtUtils]: Spent 233.00 ms on a formula simplification that was a NOOP. DAG size: 81 [2021-01-07 00:09:15,635 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 00:09:15,655 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-07 00:09:15,661 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 [2021-01-07 00:09:15,665 INFO L547 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-01-07 00:09:15,879 WARN L197 SmtUtils]: Spent 213.00 ms on a formula simplification that was a NOOP. DAG size: 75 [2021-01-07 00:09:15,880 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 00:09:15,897 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-07 00:09:15,898 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 [2021-01-07 00:09:15,901 INFO L547 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-01-07 00:09:16,106 WARN L197 SmtUtils]: Spent 204.00 ms on a formula simplification that was a NOOP. DAG size: 69 [2021-01-07 00:09:16,106 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 00:09:16,120 INFO L547 ElimStorePlain]: Start of recursive call 1: 10 dim-0 vars, 4 dim-2 vars, End of recursive call: 6 dim-0 vars, and 2 xjuncts. [2021-01-07 00:09:16,121 INFO L244 ElimStorePlain]: Needed 5 recursive calls to eliminate 14 variables, input treesize:211, output treesize:133 [2021-01-07 00:09:16,425 WARN L197 SmtUtils]: Spent 166.00 ms on a formula simplification that was a NOOP. DAG size: 64 [2021-01-07 00:09:16,442 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-07 00:09:16,452 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-07 00:09:16,463 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-07 00:09:16,512 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-07 00:09:16,519 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-07 00:09:16,626 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 00:09:16,626 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 5 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 5 case distinctions, treesize of input 26 treesize of output 56 [2021-01-07 00:09:16,632 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2021-01-07 00:09:16,633 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-01-07 00:09:16,633 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-07 00:09:16,639 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-07 00:09:16,679 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-07 00:09:16,682 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-07 00:09:16,778 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 00:09:16,779 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 3 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 7 case distinctions, treesize of input 26 treesize of output 72 [2021-01-07 00:09:16,785 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2021-01-07 00:09:16,788 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-01-07 00:09:16,791 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-07 00:09:16,796 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-01-07 00:09:16,974 WARN L197 SmtUtils]: Spent 177.00 ms on a formula simplification that was a NOOP. DAG size: 60 [2021-01-07 00:09:16,975 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 00:09:16,980 INFO L547 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2021-01-07 00:09:16,980 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 7 variables, input treesize:151, output treesize:95 [2021-01-07 00:09:17,146 WARN L197 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 29 DAG size of output: 25 [2021-01-07 00:09:17,169 INFO L443 ElimStorePlain]: Different costs {2=[|v_#memory_$Pointer$.base_44|], 6=[|v_#memory_$Pointer$.offset_44|]} [2021-01-07 00:09:17,179 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 [2021-01-07 00:09:17,181 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-07 00:09:17,234 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 00:09:17,246 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-07 00:09:17,249 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-07 00:09:17,251 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 [2021-01-07 00:09:17,253 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-01-07 00:09:17,293 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 00:09:17,296 INFO L547 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-01-07 00:09:17,297 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:80, output treesize:37 [2021-01-07 00:09:17,648 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 [2021-01-07 00:09:17,650 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-07 00:09:17,678 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 00:09:17,680 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. [2021-01-07 00:09:17,680 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:48, output treesize:33 [2021-01-07 00:09:17,803 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-07 00:09:17,807 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-01-07 00:09:17,808 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-01-07 00:09:17,810 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-01-07 00:09:17,811 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-01-07 00:09:17,812 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2021-01-07 00:09:17,829 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-07 00:09:17,835 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 [2021-01-07 00:09:17,840 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-07 00:09:17,850 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-07 00:09:17,851 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 [2021-01-07 00:09:17,857 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-01-07 00:09:17,903 INFO L625 ElimStorePlain]: treesize reduction 12, result has 36.8 percent of original size [2021-01-07 00:09:17,906 INFO L547 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-01-07 00:09:17,906 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:69, output treesize:1 [2021-01-07 00:09:18,090 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-07 00:09:18,091 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1410304737] [2021-01-07 00:09:18,091 WARN L332 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2021-01-07 00:09:18,091 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1344890976] [2021-01-07 00:09:18,091 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-07 00:09:18,092 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2021-01-07 00:09:18,092 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [717137479] [2021-01-07 00:09:18,092 INFO L461 AbstractCegarLoop]: Interpolant automaton has 19 states [2021-01-07 00:09:18,093 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-07 00:09:18,093 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2021-01-07 00:09:18,094 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=293, Unknown=0, NotChecked=0, Total=342 [2021-01-07 00:09:18,094 INFO L87 Difference]: Start difference. First operand 127 states and 141 transitions. Second operand 19 states. [2021-01-07 00:09:34,169 WARN L197 SmtUtils]: Spent 3.10 s on a formula simplification. DAG size of input: 66 DAG size of output: 66 [2021-01-07 00:09:34,676 WARN L197 SmtUtils]: Spent 351.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 65 [2021-01-07 00:09:35,656 WARN L197 SmtUtils]: Spent 548.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 74 [2021-01-07 00:09:36,484 WARN L197 SmtUtils]: Spent 543.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 70 [2021-01-07 00:09:37,225 WARN L197 SmtUtils]: Spent 592.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 73 [2021-01-07 00:09:37,966 WARN L197 SmtUtils]: Spent 501.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 74 [2021-01-07 00:09:38,527 WARN L197 SmtUtils]: Spent 131.00 ms on a formula simplification that was a NOOP. DAG size: 52 [2021-01-07 00:09:38,986 WARN L197 SmtUtils]: Spent 167.00 ms on a formula simplification that was a NOOP. DAG size: 62 [2021-01-07 00:09:39,235 WARN L197 SmtUtils]: Spent 176.00 ms on a formula simplification that was a NOOP. DAG size: 63 [2021-01-07 00:09:42,643 WARN L197 SmtUtils]: Spent 147.00 ms on a formula simplification that was a NOOP. DAG size: 58 [2021-01-07 00:09:42,942 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-07 00:09:42,943 INFO L93 Difference]: Finished difference Result 259 states and 287 transitions. [2021-01-07 00:09:42,944 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2021-01-07 00:09:42,944 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 70 [2021-01-07 00:09:42,945 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-07 00:09:42,946 INFO L225 Difference]: With dead ends: 259 [2021-01-07 00:09:42,946 INFO L226 Difference]: Without dead ends: 209 [2021-01-07 00:09:42,947 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 45 SyntacticMatches, 7 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 225 ImplicationChecksByTransitivity, 14.6s TimeCoverageRelationStatistics Valid=144, Invalid=786, Unknown=0, NotChecked=0, Total=930 [2021-01-07 00:09:42,948 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 209 states. [2021-01-07 00:09:42,961 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 209 to 149. [2021-01-07 00:09:42,961 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 149 states. [2021-01-07 00:09:42,962 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 149 states to 149 states and 164 transitions. [2021-01-07 00:09:42,962 INFO L78 Accepts]: Start accepts. Automaton has 149 states and 164 transitions. Word has length 70 [2021-01-07 00:09:42,963 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-07 00:09:42,963 INFO L481 AbstractCegarLoop]: Abstraction has 149 states and 164 transitions. [2021-01-07 00:09:42,963 INFO L482 AbstractCegarLoop]: Interpolant automaton has 19 states. [2021-01-07 00:09:42,963 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states and 164 transitions. [2021-01-07 00:09:42,964 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2021-01-07 00:09:42,964 INFO L414 BasicCegarLoop]: Found error trace [2021-01-07 00:09:42,964 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] [2021-01-07 00:09:43,178 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,8 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-01-07 00:09:43,179 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]=== [2021-01-07 00:09:43,180 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-07 00:09:43,180 INFO L82 PathProgramCache]: Analyzing trace with hash -809650413, now seen corresponding path program 1 times [2021-01-07 00:09:43,181 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-07 00:09:43,181 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1839438317] [2021-01-07 00:09:43,182 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-07 00:09:43,308 ERROR L270 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-01-07 00:09:43,309 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1071164500] [2021-01-07 00:09:43,309 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