/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_byte_buf_secure_zero_harness.i -------------------------------------------------------------------------------- This is Ultimate 0.2.1-bitabs-178dd20 [2021-01-07 00:06:24,676 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-01-07 00:06:24,679 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-01-07 00:06:24,738 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-01-07 00:06:24,739 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-01-07 00:06:24,744 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-01-07 00:06:24,747 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-01-07 00:06:24,753 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-01-07 00:06:24,757 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-01-07 00:06:24,763 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-01-07 00:06:24,768 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-01-07 00:06:24,769 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-01-07 00:06:24,770 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-01-07 00:06:24,773 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-01-07 00:06:24,775 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-01-07 00:06:24,777 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-01-07 00:06:24,778 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-01-07 00:06:24,782 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-01-07 00:06:24,804 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-01-07 00:06:24,811 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-01-07 00:06:24,814 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-01-07 00:06:24,816 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-01-07 00:06:24,818 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-01-07 00:06:24,821 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-01-07 00:06:24,831 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-01-07 00:06:24,831 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-01-07 00:06:24,832 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-01-07 00:06:24,834 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-01-07 00:06:24,835 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-01-07 00:06:24,836 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-01-07 00:06:24,836 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-01-07 00:06:24,837 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-01-07 00:06:24,839 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-01-07 00:06:24,840 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-01-07 00:06:24,841 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-01-07 00:06:24,842 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-01-07 00:06:24,842 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-01-07 00:06:24,850 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-01-07 00:06:24,850 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-01-07 00:06:24,851 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-01-07 00:06:24,852 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-01-07 00:06:24,858 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:06:24,915 INFO L113 SettingsManager]: Loading preferences was successful [2021-01-07 00:06:24,916 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-01-07 00:06:24,921 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-01-07 00:06:24,922 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-01-07 00:06:24,922 INFO L138 SettingsManager]: * Use SBE=true [2021-01-07 00:06:24,922 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-01-07 00:06:24,922 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-01-07 00:06:24,923 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-01-07 00:06:24,923 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-01-07 00:06:24,924 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-01-07 00:06:24,925 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-01-07 00:06:24,926 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-01-07 00:06:24,926 INFO L138 SettingsManager]: * Use constant arrays=true [2021-01-07 00:06:24,926 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-01-07 00:06:24,926 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-01-07 00:06:24,926 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-01-07 00:06:24,927 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-01-07 00:06:24,927 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-01-07 00:06:24,927 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-01-07 00:06:24,927 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-01-07 00:06:24,928 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-01-07 00:06:24,928 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-01-07 00:06:24,928 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-01-07 00:06:24,928 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-01-07 00:06:24,929 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-01-07 00:06:24,929 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:06:25,397 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-01-07 00:06:25,430 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-01-07 00:06:25,434 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-01-07 00:06:25,436 INFO L271 PluginConnector]: Initializing CDTParser... [2021-01-07 00:06:25,437 INFO L275 PluginConnector]: CDTParser initialized [2021-01-07 00:06:25,438 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/aws-c-common/aws_byte_buf_secure_zero_harness.i [2021-01-07 00:06:25,538 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/data/c56f85f56/e84aaa69853a42ae873b6487198bb29a/FLAG124189d59 [2021-01-07 00:06:26,710 INFO L306 CDTParser]: Found 1 translation units. [2021-01-07 00:06:26,711 INFO L160 CDTParser]: Scanning /storage/repos/ultimate-bitabs/releaseScripts/default/sv-benchmarks/c/aws-c-common/aws_byte_buf_secure_zero_harness.i [2021-01-07 00:06:26,753 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/data/c56f85f56/e84aaa69853a42ae873b6487198bb29a/FLAG124189d59 [2021-01-07 00:06:27,030 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/data/c56f85f56/e84aaa69853a42ae873b6487198bb29a [2021-01-07 00:06:27,033 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-01-07 00:06:27,035 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-01-07 00:06:27,037 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-01-07 00:06:27,038 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-01-07 00:06:27,042 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-01-07 00:06:27,043 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.01 12:06:27" (1/1) ... [2021-01-07 00:06:27,044 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@56ba2d02 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.01 12:06:27, skipping insertion in model container [2021-01-07 00:06:27,044 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.01 12:06:27" (1/1) ... [2021-01-07 00:06:27,058 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-01-07 00:06:27,169 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-01-07 00:06:27,467 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_byte_buf_secure_zero_harness.i[4498,4511] [2021-01-07 00:06:27,476 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_byte_buf_secure_zero_harness.i[4558,4571] [2021-01-07 00:06:27,503 WARN L612 FunctionHandler]: implicit declaration of function __builtin_uaddl_overflow [2021-01-07 00:06:27,510 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:06:28,607 WARN L1512 CHandler]: Possible shadowing of function index [2021-01-07 00:06:28,609 WARN L1512 CHandler]: Possible shadowing of function index [2021-01-07 00:06:28,609 WARN L1512 CHandler]: Possible shadowing of function index [2021-01-07 00:06:28,610 WARN L1512 CHandler]: Possible shadowing of function index [2021-01-07 00:06:28,612 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:06:28,633 WARN L1512 CHandler]: Possible shadowing of function index [2021-01-07 00:06:28,634 WARN L1512 CHandler]: Possible shadowing of function index [2021-01-07 00:06:28,637 WARN L1512 CHandler]: Possible shadowing of function index [2021-01-07 00:06:28,638 WARN L1512 CHandler]: Possible shadowing of function index left hand side expression in assignment: address: IdentifierExpression[~val,] 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~mem306,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[8],StructAccessExpression[IdentifierExpression[#t~mem306,],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~mem317,],base],StructAccessExpression[IdentifierExpression[#t~mem317,],offset]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem318,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[8],StructAccessExpression[IdentifierExpression[#t~mem318,],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~mem329,],base],StructAccessExpression[IdentifierExpression[#t~mem329,],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~mem336,],base],StructAccessExpression[IdentifierExpression[#t~mem336,],offset]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem338,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[8],StructAccessExpression[IdentifierExpression[#t~mem338,],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~mem382,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[8],StructAccessExpression[IdentifierExpression[#t~mem382,],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~mem384,],base],StructAccessExpression[IdentifierExpression[#t~mem384,],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~mem385,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[8],StructAccessExpression[IdentifierExpression[#t~mem385,],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~mem386,],base],StructAccessExpression[IdentifierExpression[#t~mem386,],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:06:29,159 WARN L612 FunctionHandler]: implicit declaration of function __atomic_load_n [2021-01-07 00:06:29,162 WARN L612 FunctionHandler]: implicit declaration of function __atomic_store_n [2021-01-07 00:06:29,165 WARN L612 FunctionHandler]: implicit declaration of function __atomic_exchange_n [2021-01-07 00:06:29,168 WARN L612 FunctionHandler]: implicit declaration of function __atomic_compare_exchange_n [2021-01-07 00:06:29,179 WARN L612 FunctionHandler]: implicit declaration of function __atomic_fetch_add [2021-01-07 00:06:29,183 WARN L612 FunctionHandler]: implicit declaration of function __atomic_fetch_sub [2021-01-07 00:06:29,184 WARN L612 FunctionHandler]: implicit declaration of function __atomic_fetch_or [2021-01-07 00:06:29,187 WARN L612 FunctionHandler]: implicit declaration of function __atomic_fetch_and [2021-01-07 00:06:29,191 WARN L612 FunctionHandler]: implicit declaration of function __atomic_fetch_xor [2021-01-07 00:06:29,193 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[#t~mem509,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[16],StructAccessExpression[IdentifierExpression[#t~mem509,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem512,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[24],StructAccessExpression[IdentifierExpression[#t~mem512,],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:06:29,375 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[~sp~0,],base],BinaryExpression[ARITHPLUS,StructAccessExpression[IdentifierExpression[~sp~0,],offset],IfThenElseExpression[BinaryExpression[COMPLEQ,BinaryExpression[ARITHMOD,BinaryExpression[ARITHMOD,IdentifierExpression[~i~6,],IntegerLiteral[18446744073709551616]],IntegerLiteral[18446744073709551616]],IntegerLiteral[9223372036854775807]],BinaryExpression[ARITHMOD,BinaryExpression[ARITHMOD,IdentifierExpression[~i~6,],IntegerLiteral[18446744073709551616]],IntegerLiteral[18446744073709551616]],BinaryExpression[ARITHMINUS,BinaryExpression[ARITHMOD,BinaryExpression[ARITHMOD,IdentifierExpression[~i~6,],IntegerLiteral[18446744073709551616]],IntegerLiteral[18446744073709551616]],IntegerLiteral[18446744073709551616]]]]]] 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],StructAccessExpression[IdentifierExpression[~buf,],offset]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~buf,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[12],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[~dest,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[16],StructAccessExpression[IdentifierExpression[~dest,],offset]]]] left hand side expression in assignment: address: IdentifierExpression[~dest,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~dest,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[16],StructAccessExpression[IdentifierExpression[~dest,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~dest,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[4],StructAccessExpression[IdentifierExpression[~dest,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~buf,],base],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[~buf,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[4],StructAccessExpression[IdentifierExpression[~buf,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~buf,],base],StructAccessExpression[IdentifierExpression[~buf,],offset]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~buf,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[12],StructAccessExpression[IdentifierExpression[~buf,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~buf,],base],StructAccessExpression[IdentifierExpression[~buf,],offset]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~dest,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[4],StructAccessExpression[IdentifierExpression[~dest,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~dest,],base],StructAccessExpression[IdentifierExpression[~dest,],offset]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~dest,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[12],StructAccessExpression[IdentifierExpression[~dest,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~dest,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[16],StructAccessExpression[IdentifierExpression[~dest,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~first_run~0,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~substr,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[4],StructAccessExpression[IdentifierExpression[~substr,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~substr,],base],StructAccessExpression[IdentifierExpression[~substr,],offset]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~substr,],base],StructAccessExpression[IdentifierExpression[~substr,],offset]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~substr,],base],StructAccessExpression[IdentifierExpression[~substr,],offset]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem865,],base],BinaryExpression[ARITHPLUS,StructAccessExpression[IdentifierExpression[#t~mem865,],offset],BinaryExpression[ARITHMOD,BinaryExpression[ARITHPLUS,IdentifierExpression[#t~mem864,],IdentifierExpression[~i~12,]],IntegerLiteral[4294967296]]]]] left hand side expression in assignment: lhs: VariableLHS[~new_capacity~0,] left hand side expression in assignment: lhs: VariableLHS[~new_capacity~0,] left hand side expression in assignment: lhs: VariableLHS[~new_buffer~0,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~to,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[4],StructAccessExpression[IdentifierExpression[~to,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~to,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[12],StructAccessExpression[IdentifierExpression[~to,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~buffer,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[12],StructAccessExpression[IdentifierExpression[~buffer,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~comparison_length~0,] left hand side expression in assignment: lhs: StructLHS[VariableLHS[~buf~0,],len] left hand side expression in assignment: lhs: StructLHS[VariableLHS[~buf~0,],capacity] left hand side expression in assignment: lhs: StructLHS[VariableLHS[~buf~0,],buffer] left hand side expression in assignment: lhs: StructLHS[VariableLHS[~buf~0,],allocator] left hand side expression in assignment: lhs: StructLHS[VariableLHS[~buf~1,],buffer] left hand side expression in assignment: lhs: StructLHS[VariableLHS[~buf~1,],len] left hand side expression in assignment: lhs: StructLHS[VariableLHS[~buf~1,],capacity] left hand side expression in assignment: lhs: StructLHS[VariableLHS[~buf~1,],allocator] left hand side expression in assignment: lhs: StructLHS[VariableLHS[~buf~2,],buffer] left hand side expression in assignment: lhs: StructLHS[VariableLHS[~buf~2,],len] left hand side expression in assignment: lhs: StructLHS[VariableLHS[~buf~2,],capacity] left hand side expression in assignment: lhs: StructLHS[VariableLHS[~buf~2,],allocator] left hand side expression in assignment: lhs: StructLHS[VariableLHS[~cur~0,],ptr] left hand side expression in assignment: lhs: StructLHS[VariableLHS[~cur~0,],len] left hand side expression in assignment: lhs: StructLHS[VariableLHS[~cur~1,],ptr] left hand side expression in assignment: lhs: StructLHS[VariableLHS[~cur~1,],len] left hand side expression in assignment: lhs: StructLHS[VariableLHS[~cur~2,],ptr] left hand side expression in assignment: lhs: StructLHS[VariableLHS[~cur~2,],len] [2021-01-07 00:06:29,535 WARN L1512 CHandler]: Possible shadowing of function index [2021-01-07 00:06:29,536 WARN L1512 CHandler]: Possible shadowing of function index left hand side expression in assignment: lhs: VariableLHS[~combined_mask~0,] left hand side expression in assignment: lhs: VariableLHS[~combined_mask~0,] left hand side expression in assignment: lhs: StructLHS[VariableLHS[~rv~6,],ptr] left hand side expression in assignment: lhs: StructLHS[VariableLHS[~rv~6,],len] left hand side expression in assignment: lhs: StructLHS[VariableLHS[~rv~6,],ptr] left hand side expression in assignment: lhs: StructLHS[VariableLHS[~rv~6,],len] left hand side expression in assignment: lhs: VariableLHS[~len,] ----Is the binary operator a bitwise operator? true 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[~cursor,],base],StructAccessExpression[IdentifierExpression[~cursor,],offset]]] left hand side expression in assignment: lhs: StructLHS[VariableLHS[~rv~7,],ptr] left hand side expression in assignment: lhs: StructLHS[VariableLHS[~rv~7,],len] left hand side expression in assignment: lhs: StructLHS[VariableLHS[~rv~7,],ptr] left hand side expression in assignment: lhs: StructLHS[VariableLHS[~rv~7,],len] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~dest,],base],StructAccessExpression[IdentifierExpression[~dest,],offset]]] left hand side expression in assignment: address: IdentifierExpression[~var,] left hand side expression in assignment: address: IdentifierExpression[~var,] left hand side expression in assignment: address: IdentifierExpression[~var,] left hand side expression in assignment: address: IdentifierExpression[~var,] left hand side expression in assignment: address: IdentifierExpression[~var,] left hand side expression in assignment: address: IdentifierExpression[~output,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~output,],base],StructAccessExpression[IdentifierExpression[~output,],offset]]] left hand side expression in assignment: lhs: VariableLHS[~x,] left hand side expression in assignment: lhs: VariableLHS[~x,] left hand side expression in assignment: lhs: VariableLHS[~x,] left hand side expression in assignment: lhs: VariableLHS[~x,] left hand side expression in assignment: lhs: VariableLHS[~x,] [2021-01-07 00:06:29,613 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-01-07 00:06:29,696 INFO L203 MainTranslator]: Completed pre-run [2021-01-07 00:06:29,735 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_byte_buf_secure_zero_harness.i[4498,4511] [2021-01-07 00:06:29,736 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_byte_buf_secure_zero_harness.i[4558,4571] [2021-01-07 00:06:29,741 WARN L612 FunctionHandler]: implicit declaration of function __builtin_uaddl_overflow [2021-01-07 00:06:29,742 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:06:29,815 WARN L1512 CHandler]: Possible shadowing of function index [2021-01-07 00:06:29,816 WARN L1512 CHandler]: Possible shadowing of function index [2021-01-07 00:06:29,816 WARN L1512 CHandler]: Possible shadowing of function index [2021-01-07 00:06:29,820 WARN L1512 CHandler]: Possible shadowing of function index [2021-01-07 00:06:29,821 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:06:29,838 WARN L1512 CHandler]: Possible shadowing of function index [2021-01-07 00:06:29,839 WARN L1512 CHandler]: Possible shadowing of function index [2021-01-07 00:06:29,848 WARN L1512 CHandler]: Possible shadowing of function index [2021-01-07 00:06:29,850 WARN L1512 CHandler]: Possible shadowing of function index left hand side expression in assignment: address: IdentifierExpression[~val,] 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~mem319,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[8],StructAccessExpression[IdentifierExpression[#t~mem319,],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~mem330,],base],StructAccessExpression[IdentifierExpression[#t~mem330,],offset]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem331,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[8],StructAccessExpression[IdentifierExpression[#t~mem331,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem332,],base],StructAccessExpression[IdentifierExpression[#t~mem332,],offset]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem333,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[8],StructAccessExpression[IdentifierExpression[#t~mem333,],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~mem346,],base],StructAccessExpression[IdentifierExpression[#t~mem346,],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~mem353,],base],StructAccessExpression[IdentifierExpression[#t~mem353,],offset]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem355,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[8],StructAccessExpression[IdentifierExpression[#t~mem355,],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~mem399,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[8],StructAccessExpression[IdentifierExpression[#t~mem399,],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~mem401,],base],StructAccessExpression[IdentifierExpression[#t~mem401,],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~mem402,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[8],StructAccessExpression[IdentifierExpression[#t~mem402,],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~mem403,],base],StructAccessExpression[IdentifierExpression[#t~mem403,],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:06:29,927 WARN L612 FunctionHandler]: implicit declaration of function __atomic_load_n [2021-01-07 00:06:29,928 WARN L612 FunctionHandler]: implicit declaration of function __atomic_store_n [2021-01-07 00:06:29,929 WARN L612 FunctionHandler]: implicit declaration of function __atomic_exchange_n [2021-01-07 00:06:29,930 WARN L612 FunctionHandler]: implicit declaration of function __atomic_compare_exchange_n [2021-01-07 00:06:29,932 WARN L612 FunctionHandler]: implicit declaration of function __atomic_fetch_add [2021-01-07 00:06:29,933 WARN L612 FunctionHandler]: implicit declaration of function __atomic_fetch_sub [2021-01-07 00:06:29,933 WARN L612 FunctionHandler]: implicit declaration of function __atomic_fetch_or [2021-01-07 00:06:29,934 WARN L612 FunctionHandler]: implicit declaration of function __atomic_fetch_and [2021-01-07 00:06:29,935 WARN L612 FunctionHandler]: implicit declaration of function __atomic_fetch_xor [2021-01-07 00:06:29,935 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[#t~mem526,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[16],StructAccessExpression[IdentifierExpression[#t~mem526,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem529,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[24],StructAccessExpression[IdentifierExpression[#t~mem529,],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:06:29,996 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[~sp~0,],base],BinaryExpression[ARITHPLUS,StructAccessExpression[IdentifierExpression[~sp~0,],offset],IfThenElseExpression[BinaryExpression[COMPLEQ,BinaryExpression[ARITHMOD,BinaryExpression[ARITHMOD,IdentifierExpression[~i~6,],IntegerLiteral[18446744073709551616]],IntegerLiteral[18446744073709551616]],IntegerLiteral[9223372036854775807]],BinaryExpression[ARITHMOD,BinaryExpression[ARITHMOD,IdentifierExpression[~i~6,],IntegerLiteral[18446744073709551616]],IntegerLiteral[18446744073709551616]],BinaryExpression[ARITHMINUS,BinaryExpression[ARITHMOD,BinaryExpression[ARITHMOD,IdentifierExpression[~i~6,],IntegerLiteral[18446744073709551616]],IntegerLiteral[18446744073709551616]],IntegerLiteral[18446744073709551616]]]]]] 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],StructAccessExpression[IdentifierExpression[~buf,],offset]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~buf,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[12],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[~dest,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[16],StructAccessExpression[IdentifierExpression[~dest,],offset]]]] left hand side expression in assignment: address: IdentifierExpression[~dest,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~dest,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[16],StructAccessExpression[IdentifierExpression[~dest,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~dest,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[4],StructAccessExpression[IdentifierExpression[~dest,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~buf,],base],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[~buf,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[4],StructAccessExpression[IdentifierExpression[~buf,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~buf,],base],StructAccessExpression[IdentifierExpression[~buf,],offset]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~buf,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[12],StructAccessExpression[IdentifierExpression[~buf,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~buf,],base],StructAccessExpression[IdentifierExpression[~buf,],offset]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~dest,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[4],StructAccessExpression[IdentifierExpression[~dest,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~dest,],base],StructAccessExpression[IdentifierExpression[~dest,],offset]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~dest,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[12],StructAccessExpression[IdentifierExpression[~dest,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~dest,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[16],StructAccessExpression[IdentifierExpression[~dest,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~first_run~0,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~substr,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[4],StructAccessExpression[IdentifierExpression[~substr,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~substr,],base],StructAccessExpression[IdentifierExpression[~substr,],offset]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~substr,],base],StructAccessExpression[IdentifierExpression[~substr,],offset]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~substr,],base],StructAccessExpression[IdentifierExpression[~substr,],offset]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem896,],base],BinaryExpression[ARITHPLUS,StructAccessExpression[IdentifierExpression[#t~mem896,],offset],BinaryExpression[ARITHMOD,BinaryExpression[ARITHPLUS,IdentifierExpression[#t~mem895,],IdentifierExpression[~i~12,]],IntegerLiteral[4294967296]]]]] left hand side expression in assignment: lhs: VariableLHS[~new_capacity~0,] left hand side expression in assignment: lhs: VariableLHS[~new_capacity~0,] left hand side expression in assignment: lhs: VariableLHS[~new_buffer~0,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~to,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[4],StructAccessExpression[IdentifierExpression[~to,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~to,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[12],StructAccessExpression[IdentifierExpression[~to,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~buffer,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[12],StructAccessExpression[IdentifierExpression[~buffer,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~comparison_length~0,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~#buf~0,],base],StructAccessExpression[IdentifierExpression[~#buf~0,],offset]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~#buf~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[12],StructAccessExpression[IdentifierExpression[~#buf~0,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~#buf~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[4],StructAccessExpression[IdentifierExpression[~#buf~0,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~#buf~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[16],StructAccessExpression[IdentifierExpression[~#buf~0,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~#buf~1,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[4],StructAccessExpression[IdentifierExpression[~#buf~1,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~#buf~1,],base],StructAccessExpression[IdentifierExpression[~#buf~1,],offset]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~#buf~1,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[12],StructAccessExpression[IdentifierExpression[~#buf~1,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~#buf~1,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[16],StructAccessExpression[IdentifierExpression[~#buf~1,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~#buf~2,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[4],StructAccessExpression[IdentifierExpression[~#buf~2,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~#buf~2,],base],StructAccessExpression[IdentifierExpression[~#buf~2,],offset]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~#buf~2,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[12],StructAccessExpression[IdentifierExpression[~#buf~2,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~#buf~2,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[16],StructAccessExpression[IdentifierExpression[~#buf~2,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~#cur~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[4],StructAccessExpression[IdentifierExpression[~#cur~0,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~#cur~0,],base],StructAccessExpression[IdentifierExpression[~#cur~0,],offset]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~#cur~1,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[4],StructAccessExpression[IdentifierExpression[~#cur~1,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~#cur~1,],base],StructAccessExpression[IdentifierExpression[~#cur~1,],offset]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~#cur~2,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[4],StructAccessExpression[IdentifierExpression[~#cur~2,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~#cur~2,],base],StructAccessExpression[IdentifierExpression[~#cur~2,],offset]]] [2021-01-07 00:06:30,123 WARN L1512 CHandler]: Possible shadowing of function index [2021-01-07 00:06:30,124 WARN L1512 CHandler]: Possible shadowing of function index left hand side expression in assignment: lhs: VariableLHS[~combined_mask~0,] left hand side expression in assignment: lhs: VariableLHS[~combined_mask~0,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~#rv~6,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[4],StructAccessExpression[IdentifierExpression[~#rv~6,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~#rv~6,],base],StructAccessExpression[IdentifierExpression[~#rv~6,],offset]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~#rv~6,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[4],StructAccessExpression[IdentifierExpression[~#rv~6,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~#rv~6,],base],StructAccessExpression[IdentifierExpression[~#rv~6,],offset]]] left hand side expression in assignment: lhs: VariableLHS[~len,] ----Is the binary operator a bitwise operator? true 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[~cursor,],base],StructAccessExpression[IdentifierExpression[~cursor,],offset]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~#rv~7,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[4],StructAccessExpression[IdentifierExpression[~#rv~7,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~#rv~7,],base],StructAccessExpression[IdentifierExpression[~#rv~7,],offset]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~#rv~7,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[4],StructAccessExpression[IdentifierExpression[~#rv~7,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~#rv~7,],base],StructAccessExpression[IdentifierExpression[~#rv~7,],offset]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~dest,],base],StructAccessExpression[IdentifierExpression[~dest,],offset]]] left hand side expression in assignment: address: IdentifierExpression[~var,] left hand side expression in assignment: address: IdentifierExpression[~var,] left hand side expression in assignment: address: IdentifierExpression[~var,] left hand side expression in assignment: address: IdentifierExpression[~var,] left hand side expression in assignment: address: IdentifierExpression[~var,] left hand side expression in assignment: address: IdentifierExpression[~output,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~output,],base],StructAccessExpression[IdentifierExpression[~output,],offset]]] left hand side expression in assignment: address: IdentifierExpression[~#x,] left hand side expression in assignment: address: IdentifierExpression[~#x,] left hand side expression in assignment: address: IdentifierExpression[~#x,] left hand side expression in assignment: address: IdentifierExpression[~#x,] left hand side expression in assignment: address: IdentifierExpression[~#x,] [2021-01-07 00:06:30,235 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-01-07 00:06:31,261 INFO L208 MainTranslator]: Completed translation [2021-01-07 00:06:31,262 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.01 12:06:31 WrapperNode [2021-01-07 00:06:31,262 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-01-07 00:06:31,263 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-01-07 00:06:31,264 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-01-07 00:06:31,264 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-01-07 00:06:31,273 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:06:31" (1/1) ... [2021-01-07 00:06:31,422 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:06:31" (1/1) ... [2021-01-07 00:06:31,579 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-01-07 00:06:31,581 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-01-07 00:06:31,581 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-01-07 00:06:31,581 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-01-07 00:06:31,593 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.01 12:06:31" (1/1) ... [2021-01-07 00:06:31,594 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.01 12:06:31" (1/1) ... [2021-01-07 00:06:31,619 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.01 12:06:31" (1/1) ... [2021-01-07 00:06:31,620 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.01 12:06:31" (1/1) ... [2021-01-07 00:06:31,698 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.01 12:06:31" (1/1) ... [2021-01-07 00:06:31,706 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.01 12:06:31" (1/1) ... [2021-01-07 00:06:31,719 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.01 12:06:31" (1/1) ... [2021-01-07 00:06:31,737 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-01-07 00:06:31,738 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-01-07 00:06:31,738 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-01-07 00:06:31,738 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-01-07 00:06:31,739 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.01 12:06:31" (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:06:31,923 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-01-07 00:06:31,923 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2021-01-07 00:06:31,924 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2021-01-07 00:06:31,924 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2021-01-07 00:06:31,924 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-01-07 00:06:31,924 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-01-07 00:06:31,924 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-01-07 00:06:31,924 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2021-01-07 00:06:31,925 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2021-01-07 00:06:31,925 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-01-07 00:06:31,925 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-01-07 00:06:42,256 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-01-07 00:06:42,256 INFO L299 CfgBuilder]: Removed 59 assume(true) statements. [2021-01-07 00:06:42,258 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.01 12:06:42 BoogieIcfgContainer [2021-01-07 00:06:42,259 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-01-07 00:06:42,261 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-01-07 00:06:42,261 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-01-07 00:06:42,265 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-01-07 00:06:42,265 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.01 12:06:27" (1/3) ... [2021-01-07 00:06:42,267 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@572b1de1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.01 12:06:42, skipping insertion in model container [2021-01-07 00:06:42,267 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.01 12:06:31" (2/3) ... [2021-01-07 00:06:42,267 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@572b1de1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.01 12:06:42, skipping insertion in model container [2021-01-07 00:06:42,267 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.01 12:06:42" (3/3) ... [2021-01-07 00:06:42,269 INFO L111 eAbstractionObserver]: Analyzing ICFG aws_byte_buf_secure_zero_harness.i [2021-01-07 00:06:42,277 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-01-07 00:06:42,284 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 4 error locations. [2021-01-07 00:06:42,307 INFO L253 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2021-01-07 00:06:42,340 INFO L377 AbstractCegarLoop]: Interprodecural is true [2021-01-07 00:06:42,340 INFO L378 AbstractCegarLoop]: Hoare is true [2021-01-07 00:06:42,340 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2021-01-07 00:06:42,340 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2021-01-07 00:06:42,341 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-01-07 00:06:42,341 INFO L382 AbstractCegarLoop]: Difference is false [2021-01-07 00:06:42,341 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-01-07 00:06:42,341 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2021-01-07 00:06:42,363 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states. [2021-01-07 00:06:42,371 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2021-01-07 00:06:42,371 INFO L414 BasicCegarLoop]: Found error trace [2021-01-07 00:06:42,372 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] [2021-01-07 00:06:42,373 INFO L429 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-07 00:06:42,380 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-07 00:06:42,380 INFO L82 PathProgramCache]: Analyzing trace with hash -158234594, now seen corresponding path program 1 times [2021-01-07 00:06:42,392 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-07 00:06:42,392 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1732009657] [2021-01-07 00:06:42,393 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-07 00:06:43,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 00:06:43,322 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:06:43,323 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1732009657] [2021-01-07 00:06:43,325 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-07 00:06:43,326 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-01-07 00:06:43,327 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2046251134] [2021-01-07 00:06:43,332 INFO L461 AbstractCegarLoop]: Interpolant automaton has 2 states [2021-01-07 00:06:43,332 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-07 00:06:43,352 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2021-01-07 00:06:43,359 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2021-01-07 00:06:43,362 INFO L87 Difference]: Start difference. First operand 113 states. Second operand 2 states. [2021-01-07 00:06:43,429 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-07 00:06:43,429 INFO L93 Difference]: Finished difference Result 222 states and 307 transitions. [2021-01-07 00:06:43,429 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-01-07 00:06:43,431 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 29 [2021-01-07 00:06:43,431 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-07 00:06:43,442 INFO L225 Difference]: With dead ends: 222 [2021-01-07 00:06:43,442 INFO L226 Difference]: Without dead ends: 108 [2021-01-07 00:06:43,446 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:06:43,467 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2021-01-07 00:06:43,491 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 108. [2021-01-07 00:06:43,493 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 108 states. [2021-01-07 00:06:43,495 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 140 transitions. [2021-01-07 00:06:43,498 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 140 transitions. Word has length 29 [2021-01-07 00:06:43,498 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-07 00:06:43,498 INFO L481 AbstractCegarLoop]: Abstraction has 108 states and 140 transitions. [2021-01-07 00:06:43,498 INFO L482 AbstractCegarLoop]: Interpolant automaton has 2 states. [2021-01-07 00:06:43,498 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 140 transitions. [2021-01-07 00:06:43,500 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2021-01-07 00:06:43,500 INFO L414 BasicCegarLoop]: Found error trace [2021-01-07 00:06:43,500 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] [2021-01-07 00:06:43,501 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-01-07 00:06:43,501 INFO L429 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-07 00:06:43,502 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-07 00:06:43,502 INFO L82 PathProgramCache]: Analyzing trace with hash -4552034, now seen corresponding path program 1 times [2021-01-07 00:06:43,502 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-07 00:06:43,503 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1687070061] [2021-01-07 00:06:43,503 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-07 00:06:43,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 00:06:43,953 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:06:43,958 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1687070061] [2021-01-07 00:06:43,959 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-07 00:06:43,959 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-01-07 00:06:43,959 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1505491489] [2021-01-07 00:06:43,967 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-07 00:06:43,968 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-07 00:06:43,969 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-07 00:06:43,969 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-01-07 00:06:43,970 INFO L87 Difference]: Start difference. First operand 108 states and 140 transitions. Second operand 4 states. [2021-01-07 00:06:44,095 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-07 00:06:44,095 INFO L93 Difference]: Finished difference Result 190 states and 246 transitions. [2021-01-07 00:06:44,096 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-01-07 00:06:44,096 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 29 [2021-01-07 00:06:44,097 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-07 00:06:44,098 INFO L225 Difference]: With dead ends: 190 [2021-01-07 00:06:44,098 INFO L226 Difference]: Without dead ends: 108 [2021-01-07 00:06:44,100 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-01-07 00:06:44,101 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2021-01-07 00:06:44,110 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 108. [2021-01-07 00:06:44,111 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 108 states. [2021-01-07 00:06:44,112 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 137 transitions. [2021-01-07 00:06:44,112 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 137 transitions. Word has length 29 [2021-01-07 00:06:44,113 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-07 00:06:44,113 INFO L481 AbstractCegarLoop]: Abstraction has 108 states and 137 transitions. [2021-01-07 00:06:44,113 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-07 00:06:44,113 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 137 transitions. [2021-01-07 00:06:44,114 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2021-01-07 00:06:44,115 INFO L414 BasicCegarLoop]: Found error trace [2021-01-07 00:06:44,115 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] [2021-01-07 00:06:44,115 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-01-07 00:06:44,116 INFO L429 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-07 00:06:44,116 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-07 00:06:44,116 INFO L82 PathProgramCache]: Analyzing trace with hash 1058096316, now seen corresponding path program 1 times [2021-01-07 00:06:44,117 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-07 00:06:44,117 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1929225791] [2021-01-07 00:06:44,117 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-07 00:06:44,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 00:06:44,581 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:06:44,582 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1929225791] [2021-01-07 00:06:44,582 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-07 00:06:44,582 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-01-07 00:06:44,582 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1466655780] [2021-01-07 00:06:44,584 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-07 00:06:44,585 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-07 00:06:44,596 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-07 00:06:44,597 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-01-07 00:06:44,597 INFO L87 Difference]: Start difference. First operand 108 states and 137 transitions. Second operand 4 states. [2021-01-07 00:06:44,838 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-07 00:06:44,839 INFO L93 Difference]: Finished difference Result 231 states and 298 transitions. [2021-01-07 00:06:44,839 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-01-07 00:06:44,840 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 41 [2021-01-07 00:06:44,840 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-07 00:06:44,842 INFO L225 Difference]: With dead ends: 231 [2021-01-07 00:06:44,842 INFO L226 Difference]: Without dead ends: 148 [2021-01-07 00:06:44,843 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-01-07 00:06:44,844 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 148 states. [2021-01-07 00:06:44,854 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 148 to 116. [2021-01-07 00:06:44,855 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 116 states. [2021-01-07 00:06:44,856 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 145 transitions. [2021-01-07 00:06:44,856 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 145 transitions. Word has length 41 [2021-01-07 00:06:44,857 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-07 00:06:44,857 INFO L481 AbstractCegarLoop]: Abstraction has 116 states and 145 transitions. [2021-01-07 00:06:44,857 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-07 00:06:44,857 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 145 transitions. [2021-01-07 00:06:44,858 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2021-01-07 00:06:44,859 INFO L414 BasicCegarLoop]: Found error trace [2021-01-07 00:06:44,859 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] [2021-01-07 00:06:44,859 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-01-07 00:06:44,859 INFO L429 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-07 00:06:44,860 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-07 00:06:44,860 INFO L82 PathProgramCache]: Analyzing trace with hash 996056702, now seen corresponding path program 1 times [2021-01-07 00:06:44,861 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-07 00:06:44,861 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [124479774] [2021-01-07 00:06:44,861 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-07 00:06:45,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 00:06:45,250 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:06:45,250 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [124479774] [2021-01-07 00:06:45,250 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-07 00:06:45,250 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-01-07 00:06:45,251 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [960694926] [2021-01-07 00:06:45,252 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-01-07 00:06:45,252 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-07 00:06:45,254 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-01-07 00:06:45,254 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-01-07 00:06:45,255 INFO L87 Difference]: Start difference. First operand 116 states and 145 transitions. Second operand 5 states. [2021-01-07 00:06:45,388 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-07 00:06:45,388 INFO L93 Difference]: Finished difference Result 156 states and 191 transitions. [2021-01-07 00:06:45,389 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-01-07 00:06:45,389 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 41 [2021-01-07 00:06:45,389 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-07 00:06:45,393 INFO L225 Difference]: With dead ends: 156 [2021-01-07 00:06:45,393 INFO L226 Difference]: Without dead ends: 116 [2021-01-07 00:06:45,395 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2021-01-07 00:06:45,398 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2021-01-07 00:06:45,419 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 116. [2021-01-07 00:06:45,419 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 116 states. [2021-01-07 00:06:45,422 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 144 transitions. [2021-01-07 00:06:45,423 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 144 transitions. Word has length 41 [2021-01-07 00:06:45,424 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-07 00:06:45,424 INFO L481 AbstractCegarLoop]: Abstraction has 116 states and 144 transitions. [2021-01-07 00:06:45,424 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2021-01-07 00:06:45,425 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 144 transitions. [2021-01-07 00:06:45,428 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2021-01-07 00:06:45,428 INFO L414 BasicCegarLoop]: Found error trace [2021-01-07 00:06:45,428 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] [2021-01-07 00:06:45,428 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-01-07 00:06:45,429 INFO L429 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-07 00:06:45,429 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-07 00:06:45,429 INFO L82 PathProgramCache]: Analyzing trace with hash 1931250963, now seen corresponding path program 1 times [2021-01-07 00:06:45,430 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-07 00:06:45,430 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1257256229] [2021-01-07 00:06:45,430 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-07 00:06:45,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 00:06:46,236 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:06:46,236 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1257256229] [2021-01-07 00:06:46,236 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-07 00:06:46,236 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-01-07 00:06:46,237 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1841445110] [2021-01-07 00:06:46,237 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-01-07 00:06:46,237 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-07 00:06:46,238 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-01-07 00:06:46,238 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-01-07 00:06:46,239 INFO L87 Difference]: Start difference. First operand 116 states and 144 transitions. Second operand 6 states. [2021-01-07 00:06:46,628 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-07 00:06:46,629 INFO L93 Difference]: Finished difference Result 184 states and 221 transitions. [2021-01-07 00:06:46,630 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-01-07 00:06:46,631 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 47 [2021-01-07 00:06:46,636 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-07 00:06:46,637 INFO L225 Difference]: With dead ends: 184 [2021-01-07 00:06:46,638 INFO L226 Difference]: Without dead ends: 180 [2021-01-07 00:06:46,638 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2021-01-07 00:06:46,642 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 180 states. [2021-01-07 00:06:46,658 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 180 to 124. [2021-01-07 00:06:46,658 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 124 states. [2021-01-07 00:06:46,659 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 152 transitions. [2021-01-07 00:06:46,659 INFO L78 Accepts]: Start accepts. Automaton has 124 states and 152 transitions. Word has length 47 [2021-01-07 00:06:46,659 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-07 00:06:46,659 INFO L481 AbstractCegarLoop]: Abstraction has 124 states and 152 transitions. [2021-01-07 00:06:46,659 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2021-01-07 00:06:46,660 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 152 transitions. [2021-01-07 00:06:46,664 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2021-01-07 00:06:46,664 INFO L414 BasicCegarLoop]: Found error trace [2021-01-07 00:06:46,665 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] [2021-01-07 00:06:46,665 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-01-07 00:06:46,668 INFO L429 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-07 00:06:46,669 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-07 00:06:46,669 INFO L82 PathProgramCache]: Analyzing trace with hash 1524322635, now seen corresponding path program 1 times [2021-01-07 00:06:46,669 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-07 00:06:46,670 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1524049440] [2021-01-07 00:06:46,670 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-07 00:06:47,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 00:06:47,395 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:06:47,396 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1524049440] [2021-01-07 00:06:47,396 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-07 00:06:47,396 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-01-07 00:06:47,397 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [828519200] [2021-01-07 00:06:47,397 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-01-07 00:06:47,397 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-07 00:06:47,398 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-01-07 00:06:47,398 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-01-07 00:06:47,398 INFO L87 Difference]: Start difference. First operand 124 states and 152 transitions. Second operand 5 states. [2021-01-07 00:06:49,861 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-07 00:06:49,861 INFO L93 Difference]: Finished difference Result 177 states and 213 transitions. [2021-01-07 00:06:49,862 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-01-07 00:06:49,863 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 51 [2021-01-07 00:06:49,863 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-07 00:06:49,864 INFO L225 Difference]: With dead ends: 177 [2021-01-07 00:06:49,864 INFO L226 Difference]: Without dead ends: 131 [2021-01-07 00:06:49,865 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2021-01-07 00:06:49,866 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states. [2021-01-07 00:06:49,871 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 126. [2021-01-07 00:06:49,871 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 126 states. [2021-01-07 00:06:49,872 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 154 transitions. [2021-01-07 00:06:49,872 INFO L78 Accepts]: Start accepts. Automaton has 126 states and 154 transitions. Word has length 51 [2021-01-07 00:06:49,873 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-07 00:06:49,873 INFO L481 AbstractCegarLoop]: Abstraction has 126 states and 154 transitions. [2021-01-07 00:06:49,873 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2021-01-07 00:06:49,873 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 154 transitions. [2021-01-07 00:06:49,874 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2021-01-07 00:06:49,874 INFO L414 BasicCegarLoop]: Found error trace [2021-01-07 00:06:49,874 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] [2021-01-07 00:06:49,875 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-01-07 00:06:49,875 INFO L429 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-07 00:06:49,875 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-07 00:06:49,875 INFO L82 PathProgramCache]: Analyzing trace with hash -2090586291, now seen corresponding path program 1 times [2021-01-07 00:06:49,876 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-07 00:06:49,876 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [562653505] [2021-01-07 00:06:49,876 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-07 00:06:54,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 00:06:54,879 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:06:54,879 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [562653505] [2021-01-07 00:06:54,880 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-07 00:06:54,880 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-01-07 00:06:54,880 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1948182452] [2021-01-07 00:06:54,880 INFO L461 AbstractCegarLoop]: Interpolant automaton has 9 states [2021-01-07 00:06:54,881 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-07 00:06:54,881 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-01-07 00:06:54,881 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2021-01-07 00:06:54,882 INFO L87 Difference]: Start difference. First operand 126 states and 154 transitions. Second operand 9 states. [2021-01-07 00:06:59,905 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-07 00:06:59,906 INFO L93 Difference]: Finished difference Result 249 states and 305 transitions. [2021-01-07 00:06:59,906 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-01-07 00:06:59,907 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 51 [2021-01-07 00:06:59,907 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-07 00:06:59,908 INFO L225 Difference]: With dead ends: 249 [2021-01-07 00:06:59,908 INFO L226 Difference]: Without dead ends: 150 [2021-01-07 00:06:59,910 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=80, Invalid=160, Unknown=0, NotChecked=0, Total=240 [2021-01-07 00:06:59,910 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 150 states. [2021-01-07 00:06:59,916 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 150 to 122. [2021-01-07 00:06:59,916 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 122 states. [2021-01-07 00:06:59,917 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 148 transitions. [2021-01-07 00:06:59,917 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 148 transitions. Word has length 51 [2021-01-07 00:06:59,917 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-07 00:06:59,917 INFO L481 AbstractCegarLoop]: Abstraction has 122 states and 148 transitions. [2021-01-07 00:06:59,917 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2021-01-07 00:06:59,917 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 148 transitions. [2021-01-07 00:06:59,918 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2021-01-07 00:06:59,919 INFO L414 BasicCegarLoop]: Found error trace [2021-01-07 00:06:59,919 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:06:59,919 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-01-07 00:06:59,919 INFO L429 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-07 00:06:59,920 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-07 00:06:59,920 INFO L82 PathProgramCache]: Analyzing trace with hash -122386677, now seen corresponding path program 1 times [2021-01-07 00:06:59,920 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-07 00:06:59,920 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1763679110] [2021-01-07 00:06:59,921 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-07 00:07:00,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 00:07:00,727 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:07:00,727 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1763679110] [2021-01-07 00:07:00,728 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-07 00:07:00,728 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-01-07 00:07:00,728 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [215018518] [2021-01-07 00:07:00,729 INFO L461 AbstractCegarLoop]: Interpolant automaton has 10 states [2021-01-07 00:07:00,729 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-07 00:07:00,730 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-01-07 00:07:00,730 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2021-01-07 00:07:00,730 INFO L87 Difference]: Start difference. First operand 122 states and 148 transitions. Second operand 10 states. [2021-01-07 00:07:09,415 WARN L197 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 23 DAG size of output: 22 [2021-01-07 00:07:10,916 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-07 00:07:10,916 INFO L93 Difference]: Finished difference Result 361 states and 446 transitions. [2021-01-07 00:07:10,917 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2021-01-07 00:07:10,918 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 59 [2021-01-07 00:07:10,918 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-07 00:07:10,920 INFO L225 Difference]: With dead ends: 361 [2021-01-07 00:07:10,920 INFO L226 Difference]: Without dead ends: 256 [2021-01-07 00:07:10,921 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=89, Invalid=217, Unknown=0, NotChecked=0, Total=306 [2021-01-07 00:07:10,922 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 256 states. [2021-01-07 00:07:10,930 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 256 to 145. [2021-01-07 00:07:10,930 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 145 states. [2021-01-07 00:07:10,931 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145 states to 145 states and 175 transitions. [2021-01-07 00:07:10,931 INFO L78 Accepts]: Start accepts. Automaton has 145 states and 175 transitions. Word has length 59 [2021-01-07 00:07:10,931 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-07 00:07:10,931 INFO L481 AbstractCegarLoop]: Abstraction has 145 states and 175 transitions. [2021-01-07 00:07:10,931 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2021-01-07 00:07:10,932 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 175 transitions. [2021-01-07 00:07:10,933 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2021-01-07 00:07:10,933 INFO L414 BasicCegarLoop]: Found error trace [2021-01-07 00:07:10,933 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:07:10,933 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-01-07 00:07:10,934 INFO L429 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-07 00:07:10,934 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-07 00:07:10,934 INFO L82 PathProgramCache]: Analyzing trace with hash 1263816717, now seen corresponding path program 1 times [2021-01-07 00:07:10,935 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-07 00:07:10,935 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1996588031] [2021-01-07 00:07:10,935 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-07 00:07:11,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 00:07:11,614 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:07:11,614 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1996588031] [2021-01-07 00:07:11,615 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-07 00:07:11,615 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-01-07 00:07:11,615 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [909918484] [2021-01-07 00:07:11,615 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-01-07 00:07:11,616 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-07 00:07:11,616 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-01-07 00:07:11,616 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2021-01-07 00:07:11,617 INFO L87 Difference]: Start difference. First operand 145 states and 175 transitions. Second operand 7 states. [2021-01-07 00:07:12,102 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-07 00:07:12,103 INFO L93 Difference]: Finished difference Result 291 states and 342 transitions. [2021-01-07 00:07:12,104 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-01-07 00:07:12,104 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 59 [2021-01-07 00:07:12,104 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-07 00:07:12,105 INFO L225 Difference]: With dead ends: 291 [2021-01-07 00:07:12,105 INFO L226 Difference]: Without dead ends: 174 [2021-01-07 00:07:12,106 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2021-01-07 00:07:12,107 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 174 states. [2021-01-07 00:07:12,113 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 174 to 145. [2021-01-07 00:07:12,113 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 145 states. [2021-01-07 00:07:12,114 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145 states to 145 states and 172 transitions. [2021-01-07 00:07:12,114 INFO L78 Accepts]: Start accepts. Automaton has 145 states and 172 transitions. Word has length 59 [2021-01-07 00:07:12,114 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-07 00:07:12,114 INFO L481 AbstractCegarLoop]: Abstraction has 145 states and 172 transitions. [2021-01-07 00:07:12,114 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2021-01-07 00:07:12,115 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 172 transitions. [2021-01-07 00:07:12,115 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2021-01-07 00:07:12,115 INFO L414 BasicCegarLoop]: Found error trace [2021-01-07 00:07:12,116 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:07:12,116 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-01-07 00:07:12,116 INFO L429 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-07 00:07:12,116 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-07 00:07:12,116 INFO L82 PathProgramCache]: Analyzing trace with hash 907824687, now seen corresponding path program 1 times [2021-01-07 00:07:12,117 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-07 00:07:12,117 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1921412079] [2021-01-07 00:07:12,117 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-07 00:07:12,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 00:07:12,640 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:07:12,640 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1921412079] [2021-01-07 00:07:12,641 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-07 00:07:12,641 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-01-07 00:07:12,641 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [212396787] [2021-01-07 00:07:12,641 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-01-07 00:07:12,642 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-07 00:07:12,642 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-01-07 00:07:12,642 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-01-07 00:07:12,643 INFO L87 Difference]: Start difference. First operand 145 states and 172 transitions. Second operand 5 states. [2021-01-07 00:07:15,275 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-07 00:07:15,275 INFO L93 Difference]: Finished difference Result 371 states and 438 transitions. [2021-01-07 00:07:15,277 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-01-07 00:07:15,277 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 63 [2021-01-07 00:07:15,277 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-07 00:07:15,279 INFO L225 Difference]: With dead ends: 371 [2021-01-07 00:07:15,279 INFO L226 Difference]: Without dead ends: 251 [2021-01-07 00:07:15,280 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2021-01-07 00:07:15,280 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 251 states. [2021-01-07 00:07:15,288 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 251 to 159. [2021-01-07 00:07:15,288 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 159 states. [2021-01-07 00:07:15,289 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 159 states to 159 states and 185 transitions. [2021-01-07 00:07:15,289 INFO L78 Accepts]: Start accepts. Automaton has 159 states and 185 transitions. Word has length 63 [2021-01-07 00:07:15,289 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-07 00:07:15,289 INFO L481 AbstractCegarLoop]: Abstraction has 159 states and 185 transitions. [2021-01-07 00:07:15,289 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2021-01-07 00:07:15,290 INFO L276 IsEmpty]: Start isEmpty. Operand 159 states and 185 transitions. [2021-01-07 00:07:15,290 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2021-01-07 00:07:15,290 INFO L414 BasicCegarLoop]: Found error trace [2021-01-07 00:07:15,291 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:07:15,291 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-01-07 00:07:15,291 INFO L429 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-07 00:07:15,291 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-07 00:07:15,292 INFO L82 PathProgramCache]: Analyzing trace with hash 1291837935, now seen corresponding path program 1 times [2021-01-07 00:07:15,292 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-07 00:07:15,292 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1373637199] [2021-01-07 00:07:15,292 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-07 00:07:15,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 00:07:15,514 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:07:15,514 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1373637199] [2021-01-07 00:07:15,514 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-07 00:07:15,515 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-01-07 00:07:15,515 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1003394143] [2021-01-07 00:07:15,515 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-07 00:07:15,515 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-07 00:07:15,516 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-07 00:07:15,516 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-01-07 00:07:15,516 INFO L87 Difference]: Start difference. First operand 159 states and 185 transitions. Second operand 4 states. [2021-01-07 00:07:15,734 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-07 00:07:15,734 INFO L93 Difference]: Finished difference Result 289 states and 336 transitions. [2021-01-07 00:07:15,735 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-01-07 00:07:15,735 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 63 [2021-01-07 00:07:15,736 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-07 00:07:15,737 INFO L225 Difference]: With dead ends: 289 [2021-01-07 00:07:15,737 INFO L226 Difference]: Without dead ends: 143 [2021-01-07 00:07:15,738 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-01-07 00:07:15,738 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 143 states. [2021-01-07 00:07:15,745 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 143 to 134. [2021-01-07 00:07:15,746 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 134 states. [2021-01-07 00:07:15,747 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 151 transitions. [2021-01-07 00:07:15,747 INFO L78 Accepts]: Start accepts. Automaton has 134 states and 151 transitions. Word has length 63 [2021-01-07 00:07:15,748 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-07 00:07:15,748 INFO L481 AbstractCegarLoop]: Abstraction has 134 states and 151 transitions. [2021-01-07 00:07:15,748 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-07 00:07:15,749 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 151 transitions. [2021-01-07 00:07:15,749 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2021-01-07 00:07:15,749 INFO L414 BasicCegarLoop]: Found error trace [2021-01-07 00:07:15,750 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:07:15,752 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-01-07 00:07:15,752 INFO L429 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-07 00:07:15,752 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-07 00:07:15,752 INFO L82 PathProgramCache]: Analyzing trace with hash 354357871, now seen corresponding path program 1 times [2021-01-07 00:07:15,753 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-07 00:07:15,753 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [207017579] [2021-01-07 00:07:15,753 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-07 00:07:16,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 00:07:16,559 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:07:16,560 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [207017579] [2021-01-07 00:07:16,560 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-07 00:07:16,560 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-01-07 00:07:16,560 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [322270995] [2021-01-07 00:07:16,561 INFO L461 AbstractCegarLoop]: Interpolant automaton has 10 states [2021-01-07 00:07:16,561 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-07 00:07:16,561 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-01-07 00:07:16,562 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2021-01-07 00:07:16,562 INFO L87 Difference]: Start difference. First operand 134 states and 151 transitions. Second operand 10 states. [2021-01-07 00:07:21,996 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-07 00:07:21,996 INFO L93 Difference]: Finished difference Result 353 states and 399 transitions. [2021-01-07 00:07:21,997 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-01-07 00:07:21,998 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 63 [2021-01-07 00:07:21,998 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-07 00:07:22,002 INFO L225 Difference]: With dead ends: 353 [2021-01-07 00:07:22,002 INFO L226 Difference]: Without dead ends: 259 [2021-01-07 00:07:22,003 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=98, Invalid=244, Unknown=0, NotChecked=0, Total=342 [2021-01-07 00:07:22,004 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 259 states. [2021-01-07 00:07:22,016 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 259 to 208. [2021-01-07 00:07:22,016 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 208 states. [2021-01-07 00:07:22,017 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 208 states to 208 states and 235 transitions. [2021-01-07 00:07:22,017 INFO L78 Accepts]: Start accepts. Automaton has 208 states and 235 transitions. Word has length 63 [2021-01-07 00:07:22,017 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-07 00:07:22,017 INFO L481 AbstractCegarLoop]: Abstraction has 208 states and 235 transitions. [2021-01-07 00:07:22,018 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2021-01-07 00:07:22,018 INFO L276 IsEmpty]: Start isEmpty. Operand 208 states and 235 transitions. [2021-01-07 00:07:22,024 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2021-01-07 00:07:22,025 INFO L414 BasicCegarLoop]: Found error trace [2021-01-07 00:07:22,025 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:07:22,025 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2021-01-07 00:07:22,025 INFO L429 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-07 00:07:22,026 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-07 00:07:22,026 INFO L82 PathProgramCache]: Analyzing trace with hash 213809261, now seen corresponding path program 1 times [2021-01-07 00:07:22,026 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-07 00:07:22,026 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [552457370] [2021-01-07 00:07:22,026 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-07 00:07:27,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 00:07:27,625 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:07:27,626 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [552457370] [2021-01-07 00:07:27,626 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-07 00:07:27,626 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-01-07 00:07:27,626 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [11565418] [2021-01-07 00:07:27,627 INFO L461 AbstractCegarLoop]: Interpolant automaton has 8 states [2021-01-07 00:07:27,628 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-07 00:07:27,629 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-01-07 00:07:27,630 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2021-01-07 00:07:27,630 INFO L87 Difference]: Start difference. First operand 208 states and 235 transitions. Second operand 8 states. [2021-01-07 00:07:30,143 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-07 00:07:30,144 INFO L93 Difference]: Finished difference Result 411 states and 467 transitions. [2021-01-07 00:07:30,145 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-01-07 00:07:30,145 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 63 [2021-01-07 00:07:30,146 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-07 00:07:30,150 INFO L225 Difference]: With dead ends: 411 [2021-01-07 00:07:30,150 INFO L226 Difference]: Without dead ends: 291 [2021-01-07 00:07:30,150 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=41, Invalid=69, Unknown=0, NotChecked=0, Total=110 [2021-01-07 00:07:30,151 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 291 states. [2021-01-07 00:07:30,162 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 291 to 208. [2021-01-07 00:07:30,162 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 208 states. [2021-01-07 00:07:30,163 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 208 states to 208 states and 233 transitions. [2021-01-07 00:07:30,163 INFO L78 Accepts]: Start accepts. Automaton has 208 states and 233 transitions. Word has length 63 [2021-01-07 00:07:30,163 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-07 00:07:30,163 INFO L481 AbstractCegarLoop]: Abstraction has 208 states and 233 transitions. [2021-01-07 00:07:30,164 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2021-01-07 00:07:30,164 INFO L276 IsEmpty]: Start isEmpty. Operand 208 states and 233 transitions. [2021-01-07 00:07:30,164 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2021-01-07 00:07:30,165 INFO L414 BasicCegarLoop]: Found error trace [2021-01-07 00:07:30,165 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] [2021-01-07 00:07:30,165 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2021-01-07 00:07:30,165 INFO L429 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-07 00:07:30,165 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-07 00:07:30,166 INFO L82 PathProgramCache]: Analyzing trace with hash 694910338, now seen corresponding path program 1 times [2021-01-07 00:07:30,166 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-07 00:07:30,166 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1851518849] [2021-01-07 00:07:30,166 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-07 00:07:34,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 00:07:35,350 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:07:35,352 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1851518849] [2021-01-07 00:07:35,352 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-07 00:07:35,352 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-01-07 00:07:35,352 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [411753967] [2021-01-07 00:07:35,353 INFO L461 AbstractCegarLoop]: Interpolant automaton has 8 states [2021-01-07 00:07:35,353 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-07 00:07:35,354 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-01-07 00:07:35,354 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2021-01-07 00:07:35,354 INFO L87 Difference]: Start difference. First operand 208 states and 233 transitions. Second operand 8 states. [2021-01-07 00:07:40,656 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-07 00:07:40,656 INFO L93 Difference]: Finished difference Result 410 states and 463 transitions. [2021-01-07 00:07:40,658 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-01-07 00:07:40,658 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 69 [2021-01-07 00:07:40,658 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-07 00:07:40,659 INFO L225 Difference]: With dead ends: 410 [2021-01-07 00:07:40,659 INFO L226 Difference]: Without dead ends: 282 [2021-01-07 00:07:40,660 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=86, Invalid=186, Unknown=0, NotChecked=0, Total=272 [2021-01-07 00:07:40,661 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 282 states. [2021-01-07 00:07:40,672 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 282 to 208. [2021-01-07 00:07:40,672 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 208 states. [2021-01-07 00:07:40,673 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 208 states to 208 states and 231 transitions. [2021-01-07 00:07:40,674 INFO L78 Accepts]: Start accepts. Automaton has 208 states and 231 transitions. Word has length 69 [2021-01-07 00:07:40,674 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-07 00:07:40,674 INFO L481 AbstractCegarLoop]: Abstraction has 208 states and 231 transitions. [2021-01-07 00:07:40,674 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2021-01-07 00:07:40,674 INFO L276 IsEmpty]: Start isEmpty. Operand 208 states and 231 transitions. [2021-01-07 00:07:40,675 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2021-01-07 00:07:40,675 INFO L414 BasicCegarLoop]: Found error trace [2021-01-07 00:07:40,675 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:07:40,675 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2021-01-07 00:07:40,676 INFO L429 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-07 00:07:40,676 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-07 00:07:40,676 INFO L82 PathProgramCache]: Analyzing trace with hash 448544190, now seen corresponding path program 1 times [2021-01-07 00:07:40,676 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-07 00:07:40,677 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [197220616] [2021-01-07 00:07:40,677 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-07 00:07:40,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 00:07:41,190 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:07:41,196 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [197220616] [2021-01-07 00:07:41,196 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-07 00:07:41,196 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-07 00:07:41,197 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1711949795] [2021-01-07 00:07:41,197 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-07 00:07:41,197 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-07 00:07:41,198 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-07 00:07:41,198 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-07 00:07:41,198 INFO L87 Difference]: Start difference. First operand 208 states and 231 transitions. Second operand 3 states. [2021-01-07 00:07:41,242 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-07 00:07:41,242 INFO L93 Difference]: Finished difference Result 292 states and 326 transitions. [2021-01-07 00:07:41,244 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-07 00:07:41,245 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 70 [2021-01-07 00:07:41,245 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-07 00:07:41,246 INFO L225 Difference]: With dead ends: 292 [2021-01-07 00:07:41,246 INFO L226 Difference]: Without dead ends: 164 [2021-01-07 00:07:41,249 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 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:07:41,250 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 164 states. [2021-01-07 00:07:41,260 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 164 to 152. [2021-01-07 00:07:41,260 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 152 states. [2021-01-07 00:07:41,261 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152 states to 152 states and 166 transitions. [2021-01-07 00:07:41,262 INFO L78 Accepts]: Start accepts. Automaton has 152 states and 166 transitions. Word has length 70 [2021-01-07 00:07:41,262 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-07 00:07:41,262 INFO L481 AbstractCegarLoop]: Abstraction has 152 states and 166 transitions. [2021-01-07 00:07:41,262 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-07 00:07:41,263 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 166 transitions. [2021-01-07 00:07:41,264 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2021-01-07 00:07:41,264 INFO L414 BasicCegarLoop]: Found error trace [2021-01-07 00:07:41,264 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, 1, 1] [2021-01-07 00:07:41,264 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2021-01-07 00:07:41,265 INFO L429 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-07 00:07:41,265 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-07 00:07:41,265 INFO L82 PathProgramCache]: Analyzing trace with hash 484257116, now seen corresponding path program 1 times [2021-01-07 00:07:41,266 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-07 00:07:41,269 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2121384838] [2021-01-07 00:07:41,270 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-07 00:07:49,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 00:07:51,446 WARN L197 SmtUtils]: Spent 733.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 74 [2021-01-07 00:07:51,816 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-07 00:07:51,817 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2121384838] [2021-01-07 00:07:51,817 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [277388058] [2021-01-07 00:07:51,817 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:07:53,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 00:07:53,284 INFO L263 TraceCheckSpWp]: Trace formula consists of 2910 conjuncts, 74 conjunts are in the unsatisfiable core [2021-01-07 00:07:53,301 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-01-07 00:07:53,835 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 13 treesize of output 9 [2021-01-07 00:07:53,837 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-07 00:07:53,855 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 00:07:53,858 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-01-07 00:07:53,858 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:22, output treesize:15 [2021-01-07 00:07:54,685 INFO L173 IndexEqualityManager]: detected equality via solver [2021-01-07 00:07:54,688 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 9 [2021-01-07 00:07:54,692 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-07 00:07:54,715 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 00:07:54,716 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-01-07 00:07:54,717 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:34, output treesize:21 [2021-01-07 00:07:55,059 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2021-01-07 00:07:55,125 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2021-01-07 00:07:55,153 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-07 00:07:55,156 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-07 00:07:55,178 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2021-01-07 00:07:55,197 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2021-01-07 00:07:55,218 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2021-01-07 00:07:55,246 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-07 00:07:55,265 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2021-01-07 00:07:55,278 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2021-01-07 00:07:55,290 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2021-01-07 00:07:55,308 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2021-01-07 00:07:55,339 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2021-01-07 00:07:55,352 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-07 00:07:55,354 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-07 00:07:55,365 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2021-01-07 00:07:55,375 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2021-01-07 00:07:55,392 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2021-01-07 00:07:55,403 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-07 00:07:55,424 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2021-01-07 00:07:55,438 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2021-01-07 00:07:55,471 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2021-01-07 00:07:55,482 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2021-01-07 00:07:55,493 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2021-01-07 00:07:55,506 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-07 00:07:55,507 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-07 00:07:55,515 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2021-01-07 00:07:55,524 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2021-01-07 00:07:55,537 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2021-01-07 00:07:55,549 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-07 00:07:55,560 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2021-01-07 00:07:55,572 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2021-01-07 00:07:55,582 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2021-01-07 00:07:55,592 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2021-01-07 00:07:55,601 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2021-01-07 00:07:55,613 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-07 00:07:55,614 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-07 00:07:55,627 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2021-01-07 00:07:55,637 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2021-01-07 00:07:55,649 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2021-01-07 00:07:55,661 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-07 00:07:55,669 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2021-01-07 00:07:55,680 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2021-01-07 00:07:55,692 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2021-01-07 00:07:55,703 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2021-01-07 00:07:55,711 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2021-01-07 00:07:55,720 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-01-07 00:07:55,722 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-07 00:07:55,730 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-07 00:07:55,738 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2021-01-07 00:07:55,749 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2021-01-07 00:07:55,761 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2021-01-07 00:07:55,772 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-07 00:07:55,780 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-07 00:07:55,787 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2021-01-07 00:07:55,796 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2021-01-07 00:07:55,807 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2021-01-07 00:07:55,817 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2021-01-07 00:07:55,826 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2021-01-07 00:07:55,870 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-07 00:07:55,887 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 32 treesize of output 31 [2021-01-07 00:07:55,890 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-07 00:07:55,910 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-07 00:07:55,926 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 31 treesize of output 30 [2021-01-07 00:07:55,928 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-01-07 00:07:55,944 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-07 00:07:55,958 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 30 treesize of output 29 [2021-01-07 00:07:55,960 INFO L547 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-01-07 00:07:55,976 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-07 00:07:55,985 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 33 treesize of output 32 [2021-01-07 00:07:55,988 INFO L547 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-01-07 00:07:56,662 WARN L197 SmtUtils]: Spent 672.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 70 [2021-01-07 00:07:56,665 INFO L625 ElimStorePlain]: treesize reduction 24, result has 88.8 percent of original size [2021-01-07 00:07:56,752 INFO L547 ElimStorePlain]: Start of recursive call 1: 11 dim-0 vars, 1 dim-2 vars, End of recursive call: 16 dim-0 vars, and 4 xjuncts. [2021-01-07 00:07:56,753 INFO L244 ElimStorePlain]: Needed 5 recursive calls to eliminate 12 variables, input treesize:231, output treesize:331 [2021-01-07 00:08:01,555 WARN L197 SmtUtils]: Spent 2.31 s on a formula simplification. DAG size of input: 109 DAG size of output: 64 [2021-01-07 00:08:01,938 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-07 00:08:02,006 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-07 00:08:02,010 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-07 00:08:02,026 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 79 treesize of output 57 [2021-01-07 00:08:02,030 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-07 00:08:02,046 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-07 00:08:02,050 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-07 00:08:02,062 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 76 treesize of output 54 [2021-01-07 00:08:02,065 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-01-07 00:08:02,277 WARN L197 SmtUtils]: Spent 211.00 ms on a formula simplification that was a NOOP. DAG size: 62 [2021-01-07 00:08:02,278 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 00:08:02,300 INFO L547 ElimStorePlain]: Start of recursive call 1: 8 dim-0 vars, 1 dim-2 vars, End of recursive call: 8 dim-0 vars, and 2 xjuncts. [2021-01-07 00:08:02,300 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 9 variables, input treesize:184, output treesize:176 [2021-01-07 00:08:02,754 WARN L197 SmtUtils]: Spent 212.00 ms on a formula simplification that was a NOOP. DAG size: 66 [2021-01-07 00:08:03,394 WARN L197 SmtUtils]: Spent 268.00 ms on a formula simplification that was a NOOP. DAG size: 68 [2021-01-07 00:08:03,465 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-07 00:08:03,466 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-01-07 00:08:03,466 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15] total 28 [2021-01-07 00:08:03,467 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1558826002] [2021-01-07 00:08:03,467 INFO L461 AbstractCegarLoop]: Interpolant automaton has 28 states [2021-01-07 00:08:03,467 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-07 00:08:03,468 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2021-01-07 00:08:03,469 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=81, Invalid=674, Unknown=1, NotChecked=0, Total=756 [2021-01-07 00:08:03,469 INFO L87 Difference]: Start difference. First operand 152 states and 166 transitions. Second operand 28 states. [2021-01-07 00:08:25,074 WARN L197 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 27 DAG size of output: 26 [2021-01-07 00:08:25,328 WARN L197 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 29 DAG size of output: 28 [2021-01-07 00:08:25,860 WARN L197 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 38 DAG size of output: 37 [2021-01-07 00:08:26,245 WARN L197 SmtUtils]: Spent 292.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 51 [2021-01-07 00:08:26,561 WARN L197 SmtUtils]: Spent 187.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 48 [2021-01-07 00:08:27,051 WARN L197 SmtUtils]: Spent 142.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 46 [2021-01-07 00:08:27,431 WARN L197 SmtUtils]: Spent 225.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 55 [2021-01-07 00:08:29,952 WARN L197 SmtUtils]: Spent 345.00 ms on a formula simplification. DAG size of input: 122 DAG size of output: 57 [2021-01-07 00:08:48,772 WARN L197 SmtUtils]: Spent 16.62 s on a formula simplification. DAG size of input: 162 DAG size of output: 100 [2021-01-07 00:09:07,896 WARN L197 SmtUtils]: Spent 14.83 s on a formula simplification. DAG size of input: 165 DAG size of output: 104 [2021-01-07 00:09:25,149 WARN L197 SmtUtils]: Spent 17.13 s on a formula simplification. DAG size of input: 179 DAG size of output: 104 [2021-01-07 00:09:42,879 WARN L197 SmtUtils]: Spent 15.31 s on a formula simplification. DAG size of input: 174 DAG size of output: 104 [2021-01-07 00:10:00,137 WARN L197 SmtUtils]: Spent 10.89 s on a formula simplification. DAG size of input: 152 DAG size of output: 95 [2021-01-07 00:10:13,383 WARN L197 SmtUtils]: Spent 10.88 s on a formula simplification. DAG size of input: 154 DAG size of output: 97 [2021-01-07 00:10:13,927 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-07 00:10:13,927 INFO L93 Difference]: Finished difference Result 212 states and 232 transitions. [2021-01-07 00:10:13,932 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2021-01-07 00:10:13,933 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 72 [2021-01-07 00:10:13,933 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-07 00:10:13,934 INFO L225 Difference]: With dead ends: 212 [2021-01-07 00:10:13,934 INFO L226 Difference]: Without dead ends: 146 [2021-01-07 00:10:13,935 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 60 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 290 ImplicationChecksByTransitivity, 113.9s TimeCoverageRelationStatistics Valid=446, Invalid=1526, Unknown=8, NotChecked=0, Total=1980 [2021-01-07 00:10:13,936 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146 states. [2021-01-07 00:10:13,946 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146 to 141. [2021-01-07 00:10:13,946 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 141 states. [2021-01-07 00:10:13,947 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 152 transitions. [2021-01-07 00:10:13,947 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 152 transitions. Word has length 72 [2021-01-07 00:10:13,947 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-07 00:10:13,947 INFO L481 AbstractCegarLoop]: Abstraction has 141 states and 152 transitions. [2021-01-07 00:10:13,948 INFO L482 AbstractCegarLoop]: Interpolant automaton has 28 states. [2021-01-07 00:10:13,948 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 152 transitions. [2021-01-07 00:10:13,948 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2021-01-07 00:10:13,948 INFO L414 BasicCegarLoop]: Found error trace [2021-01-07 00:10:13,949 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, 1, 1] [2021-01-07 00:10:14,162 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2021-01-07 00:10:14,163 INFO L429 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-07 00:10:14,164 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-07 00:10:14,164 INFO L82 PathProgramCache]: Analyzing trace with hash -268694696, now seen corresponding path program 1 times [2021-01-07 00:10:14,164 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-07 00:10:14,165 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1901341584] [2021-01-07 00:10:14,165 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-07 00:10:14,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 00:10:14,840 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-01-07 00:10:14,841 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1901341584] [2021-01-07 00:10:14,841 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-07 00:10:14,841 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-01-07 00:10:14,841 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [174607397] [2021-01-07 00:10:14,842 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-01-07 00:10:14,842 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-07 00:10:14,842 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-01-07 00:10:14,843 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-01-07 00:10:14,843 INFO L87 Difference]: Start difference. First operand 141 states and 152 transitions. Second operand 5 states.