/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_reserve_harness.i -------------------------------------------------------------------------------- This is Ultimate 0.2.1-bitabs-dcfa08f [2020-12-23 14:12:21,131 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-12-23 14:12:21,133 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-12-23 14:12:21,168 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-12-23 14:12:21,169 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-12-23 14:12:21,170 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-12-23 14:12:21,172 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-12-23 14:12:21,174 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-12-23 14:12:21,177 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-12-23 14:12:21,178 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-12-23 14:12:21,179 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-12-23 14:12:21,181 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-12-23 14:12:21,181 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-12-23 14:12:21,182 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-12-23 14:12:21,184 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-12-23 14:12:21,185 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-12-23 14:12:21,186 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-12-23 14:12:21,187 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-12-23 14:12:21,189 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-12-23 14:12:21,191 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-12-23 14:12:21,193 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-12-23 14:12:21,195 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-12-23 14:12:21,196 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-12-23 14:12:21,197 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-12-23 14:12:21,210 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-12-23 14:12:21,211 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-12-23 14:12:21,211 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-12-23 14:12:21,214 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-12-23 14:12:21,215 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-12-23 14:12:21,216 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-12-23 14:12:21,216 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-12-23 14:12:21,221 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-12-23 14:12:21,222 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-12-23 14:12:21,223 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-12-23 14:12:21,225 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-12-23 14:12:21,225 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-12-23 14:12:21,226 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-12-23 14:12:21,227 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-12-23 14:12:21,230 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-12-23 14:12:21,234 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-12-23 14:12:21,235 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-12-23 14:12:21,236 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2020-12-23 14:12:21,291 INFO L113 SettingsManager]: Loading preferences was successful [2020-12-23 14:12:21,294 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-12-23 14:12:21,296 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-12-23 14:12:21,298 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-12-23 14:12:21,298 INFO L138 SettingsManager]: * Use SBE=true [2020-12-23 14:12:21,298 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-12-23 14:12:21,298 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-12-23 14:12:21,298 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-12-23 14:12:21,299 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-12-23 14:12:21,299 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-12-23 14:12:21,299 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-12-23 14:12:21,299 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-12-23 14:12:21,299 INFO L138 SettingsManager]: * Use constant arrays=true [2020-12-23 14:12:21,300 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-12-23 14:12:21,300 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-12-23 14:12:21,300 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-12-23 14:12:21,300 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-12-23 14:12:21,300 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-12-23 14:12:21,301 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-12-23 14:12:21,301 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-12-23 14:12:21,302 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-12-23 14:12:21,302 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-12-23 14:12:21,303 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-12-23 14:12:21,303 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-12-23 14:12:21,303 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-12-23 14:12:21,303 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release [2020-12-23 14:12:21,655 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-12-23 14:12:21,683 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-12-23 14:12:21,686 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-12-23 14:12:21,688 INFO L271 PluginConnector]: Initializing CDTParser... [2020-12-23 14:12:21,688 INFO L275 PluginConnector]: CDTParser initialized [2020-12-23 14:12:21,689 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_reserve_harness.i [2020-12-23 14:12:21,777 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/data/90f112de2/ffcf46603c184a70b4c26f6b16f25de8/FLAG52e61c86e [2020-12-23 14:12:22,898 INFO L306 CDTParser]: Found 1 translation units. [2020-12-23 14:12:22,898 INFO L160 CDTParser]: Scanning /storage/repos/ultimate-bitabs/releaseScripts/default/sv-benchmarks/c/aws-c-common/aws_byte_buf_reserve_harness.i [2020-12-23 14:12:22,944 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/data/90f112de2/ffcf46603c184a70b4c26f6b16f25de8/FLAG52e61c86e [2020-12-23 14:12:23,276 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/data/90f112de2/ffcf46603c184a70b4c26f6b16f25de8 [2020-12-23 14:12:23,278 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-12-23 14:12:23,283 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2020-12-23 14:12:23,286 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-12-23 14:12:23,286 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-12-23 14:12:23,293 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-12-23 14:12:23,294 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.12 02:12:23" (1/1) ... [2020-12-23 14:12:23,296 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@c3c8f5d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 02:12:23, skipping insertion in model container [2020-12-23 14:12:23,297 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.12 02:12:23" (1/1) ... [2020-12-23 14:12:23,305 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-12-23 14:12:23,484 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-12-23 14:12:23,768 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_reserve_harness.i[4494,4507] [2020-12-23 14:12:23,776 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_reserve_harness.i[4554,4567] [2020-12-23 14:12:23,799 WARN L612 FunctionHandler]: implicit declaration of function __builtin_uaddl_overflow [2020-12-23 14:12:23,814 WARN L612 FunctionHandler]: implicit declaration of function __builtin_umull_overflow left hand side expression in assignment: lhs: VariableLHS[~i~0,] left hand side expression in assignment: address: IdentifierExpression[~r,] left hand side expression in assignment: address: IdentifierExpression[~r,] left hand side expression in assignment: address: IdentifierExpression[~r,] left hand side expression in assignment: address: IdentifierExpression[~r,] left hand side expression in assignment: address: IdentifierExpression[~result,] left hand side expression in assignment: address: IdentifierExpression[~result,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~list,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[20],StructAccessExpression[IdentifierExpression[~list,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~list,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[8],StructAccessExpression[IdentifierExpression[~list,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~list,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[16],StructAccessExpression[IdentifierExpression[~list,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~list,],base],StructAccessExpression[IdentifierExpression[~list,],offset]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~list,],base],StructAccessExpression[IdentifierExpression[~list,],offset]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~list,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[16],StructAccessExpression[IdentifierExpression[~list,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~list,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[12],StructAccessExpression[IdentifierExpression[~list,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~list,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[20],StructAccessExpression[IdentifierExpression[~list,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~list,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[12],StructAccessExpression[IdentifierExpression[~list,],offset]]]] [2020-12-23 14:12:24,593 WARN L1512 CHandler]: Possible shadowing of function index [2020-12-23 14:12:24,594 WARN L1512 CHandler]: Possible shadowing of function index [2020-12-23 14:12:24,595 WARN L1512 CHandler]: Possible shadowing of function index [2020-12-23 14:12:24,595 WARN L1512 CHandler]: Possible shadowing of function index [2020-12-23 14:12:24,597 WARN L1512 CHandler]: Possible shadowing of function index left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~list,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[12],StructAccessExpression[IdentifierExpression[~list,],offset]]]] left hand side expression in assignment: address: IdentifierExpression[~list_a,] left hand side expression in assignment: address: IdentifierExpression[~list_b,] [2020-12-23 14:12:24,613 WARN L1512 CHandler]: Possible shadowing of function index [2020-12-23 14:12:24,613 WARN L1512 CHandler]: Possible shadowing of function index [2020-12-23 14:12:24,615 WARN L1512 CHandler]: Possible shadowing of function index [2020-12-23 14:12:24,616 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]]] [2020-12-23 14:12:24,979 WARN L612 FunctionHandler]: implicit declaration of function __atomic_load_n [2020-12-23 14:12:24,981 WARN L612 FunctionHandler]: implicit declaration of function __atomic_store_n [2020-12-23 14:12:24,982 WARN L612 FunctionHandler]: implicit declaration of function __atomic_exchange_n [2020-12-23 14:12:24,983 WARN L612 FunctionHandler]: implicit declaration of function __atomic_compare_exchange_n [2020-12-23 14:12:24,985 WARN L612 FunctionHandler]: implicit declaration of function __atomic_fetch_add [2020-12-23 14:12:24,985 WARN L612 FunctionHandler]: implicit declaration of function __atomic_fetch_sub [2020-12-23 14:12:24,986 WARN L612 FunctionHandler]: implicit declaration of function __atomic_fetch_or [2020-12-23 14:12:24,987 WARN L612 FunctionHandler]: implicit declaration of function __atomic_fetch_and [2020-12-23 14:12:24,988 WARN L612 FunctionHandler]: implicit declaration of function __atomic_fetch_xor [2020-12-23 14:12:24,988 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]]]]] [2020-12-23 14:12:25,137 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] [2020-12-23 14:12:25,172 WARN L1512 CHandler]: Possible shadowing of function index [2020-12-23 14:12:25,173 WARN L1512 CHandler]: Possible shadowing of function index left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~dst,],base],BinaryExpression[ARITHPLUS,StructAccessExpression[IdentifierExpression[~dst,],offset],BinaryExpression[ARITHMOD,IdentifierExpression[~index~0,],IntegerLiteral[4294967296]]]]] 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~mem867,],base],BinaryExpression[ARITHPLUS,StructAccessExpression[IdentifierExpression[#t~mem867,],offset],BinaryExpression[ARITHMOD,BinaryExpression[ARITHPLUS,IdentifierExpression[#t~mem866,],IdentifierExpression[~i~11,]],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] [2020-12-23 14:12:25,316 WARN L1512 CHandler]: Possible shadowing of function index [2020-12-23 14:12:25,317 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,] [2020-12-23 14:12:25,384 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-12-23 14:12:25,456 INFO L203 MainTranslator]: Completed pre-run [2020-12-23 14:12:25,474 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_reserve_harness.i[4494,4507] [2020-12-23 14:12:25,475 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_reserve_harness.i[4554,4567] [2020-12-23 14:12:25,476 WARN L612 FunctionHandler]: implicit declaration of function __builtin_uaddl_overflow [2020-12-23 14:12:25,477 WARN L612 FunctionHandler]: implicit declaration of function __builtin_umull_overflow left hand side expression in assignment: lhs: VariableLHS[~i~0,] left hand side expression in assignment: address: IdentifierExpression[~r,] left hand side expression in assignment: address: IdentifierExpression[~r,] left hand side expression in assignment: address: IdentifierExpression[~r,] left hand side expression in assignment: address: IdentifierExpression[~r,] left hand side expression in assignment: address: IdentifierExpression[~result,] left hand side expression in assignment: address: IdentifierExpression[~result,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~list,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[20],StructAccessExpression[IdentifierExpression[~list,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~list,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[8],StructAccessExpression[IdentifierExpression[~list,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~list,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[16],StructAccessExpression[IdentifierExpression[~list,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~list,],base],StructAccessExpression[IdentifierExpression[~list,],offset]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~list,],base],StructAccessExpression[IdentifierExpression[~list,],offset]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~list,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[16],StructAccessExpression[IdentifierExpression[~list,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~list,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[12],StructAccessExpression[IdentifierExpression[~list,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~list,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[20],StructAccessExpression[IdentifierExpression[~list,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~list,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[12],StructAccessExpression[IdentifierExpression[~list,],offset]]]] [2020-12-23 14:12:25,518 WARN L1512 CHandler]: Possible shadowing of function index [2020-12-23 14:12:25,519 WARN L1512 CHandler]: Possible shadowing of function index [2020-12-23 14:12:25,519 WARN L1512 CHandler]: Possible shadowing of function index [2020-12-23 14:12:25,520 WARN L1512 CHandler]: Possible shadowing of function index [2020-12-23 14:12:25,520 WARN L1512 CHandler]: Possible shadowing of function index left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~list,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[12],StructAccessExpression[IdentifierExpression[~list,],offset]]]] left hand side expression in assignment: address: IdentifierExpression[~list_a,] left hand side expression in assignment: address: IdentifierExpression[~list_b,] [2020-12-23 14:12:25,528 WARN L1512 CHandler]: Possible shadowing of function index [2020-12-23 14:12:25,528 WARN L1512 CHandler]: Possible shadowing of function index [2020-12-23 14:12:25,529 WARN L1512 CHandler]: Possible shadowing of function index [2020-12-23 14:12:25,530 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]]] [2020-12-23 14:12:25,573 WARN L612 FunctionHandler]: implicit declaration of function __atomic_load_n [2020-12-23 14:12:25,574 WARN L612 FunctionHandler]: implicit declaration of function __atomic_store_n [2020-12-23 14:12:25,574 WARN L612 FunctionHandler]: implicit declaration of function __atomic_exchange_n [2020-12-23 14:12:25,575 WARN L612 FunctionHandler]: implicit declaration of function __atomic_compare_exchange_n [2020-12-23 14:12:25,576 WARN L612 FunctionHandler]: implicit declaration of function __atomic_fetch_add [2020-12-23 14:12:25,577 WARN L612 FunctionHandler]: implicit declaration of function __atomic_fetch_sub [2020-12-23 14:12:25,578 WARN L612 FunctionHandler]: implicit declaration of function __atomic_fetch_or [2020-12-23 14:12:25,578 WARN L612 FunctionHandler]: implicit declaration of function __atomic_fetch_and [2020-12-23 14:12:25,579 WARN L612 FunctionHandler]: implicit declaration of function __atomic_fetch_xor [2020-12-23 14:12:25,579 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]]]]] [2020-12-23 14:12:25,608 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] [2020-12-23 14:12:25,625 WARN L1512 CHandler]: Possible shadowing of function index [2020-12-23 14:12:25,625 WARN L1512 CHandler]: Possible shadowing of function index left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~dst,],base],BinaryExpression[ARITHPLUS,StructAccessExpression[IdentifierExpression[~dst,],offset],BinaryExpression[ARITHMOD,IdentifierExpression[~index~0,],IntegerLiteral[4294967296]]]]] 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~mem898,],base],BinaryExpression[ARITHPLUS,StructAccessExpression[IdentifierExpression[#t~mem898,],offset],BinaryExpression[ARITHMOD,BinaryExpression[ARITHPLUS,IdentifierExpression[#t~mem897,],IdentifierExpression[~i~11,]],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]]] [2020-12-23 14:12:25,680 WARN L1512 CHandler]: Possible shadowing of function index [2020-12-23 14:12:25,681 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,] [2020-12-23 14:12:25,715 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-12-23 14:12:26,724 INFO L208 MainTranslator]: Completed translation [2020-12-23 14:12:26,724 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 02:12:26 WrapperNode [2020-12-23 14:12:26,725 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-12-23 14:12:26,726 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-12-23 14:12:26,726 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-12-23 14:12:26,726 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-12-23 14:12:26,734 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 02:12:26" (1/1) ... [2020-12-23 14:12:26,870 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 02:12:26" (1/1) ... [2020-12-23 14:12:26,990 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-12-23 14:12:26,991 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-12-23 14:12:26,992 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-12-23 14:12:26,992 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-12-23 14:12:27,001 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 02:12:26" (1/1) ... [2020-12-23 14:12:27,002 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 02:12:26" (1/1) ... [2020-12-23 14:12:27,012 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 02:12:26" (1/1) ... [2020-12-23 14:12:27,012 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 02:12:26" (1/1) ... [2020-12-23 14:12:27,066 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 02:12:26" (1/1) ... [2020-12-23 14:12:27,076 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 02:12:26" (1/1) ... [2020-12-23 14:12:27,092 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 02:12:26" (1/1) ... [2020-12-23 14:12:27,128 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-12-23 14:12:27,129 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-12-23 14:12:27,129 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-12-23 14:12:27,129 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-12-23 14:12:27,130 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 02:12:26" (1/1) ... No working directory specified, using /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-12-23 14:12:27,263 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-12-23 14:12:27,263 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2020-12-23 14:12:27,263 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2020-12-23 14:12:27,263 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2020-12-23 14:12:27,263 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-12-23 14:12:27,264 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-12-23 14:12:27,264 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-12-23 14:12:27,265 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2020-12-23 14:12:27,265 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2020-12-23 14:12:27,265 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-12-23 14:12:27,265 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2020-12-23 14:12:36,597 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-12-23 14:12:36,597 INFO L299 CfgBuilder]: Removed 102 assume(true) statements. [2020-12-23 14:12:36,599 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.12 02:12:36 BoogieIcfgContainer [2020-12-23 14:12:36,599 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-12-23 14:12:36,601 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-12-23 14:12:36,601 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-12-23 14:12:36,605 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-12-23 14:12:36,605 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.12 02:12:23" (1/3) ... [2020-12-23 14:12:36,606 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2178c642 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.12 02:12:36, skipping insertion in model container [2020-12-23 14:12:36,606 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 02:12:26" (2/3) ... [2020-12-23 14:12:36,606 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2178c642 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.12 02:12:36, skipping insertion in model container [2020-12-23 14:12:36,606 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.12 02:12:36" (3/3) ... [2020-12-23 14:12:36,608 INFO L111 eAbstractionObserver]: Analyzing ICFG aws_byte_buf_reserve_harness.i [2020-12-23 14:12:36,614 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-12-23 14:12:36,621 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 10 error locations. [2020-12-23 14:12:36,640 INFO L253 AbstractCegarLoop]: Starting to check reachability of 10 error locations. [2020-12-23 14:12:36,668 INFO L377 AbstractCegarLoop]: Interprodecural is true [2020-12-23 14:12:36,669 INFO L378 AbstractCegarLoop]: Hoare is true [2020-12-23 14:12:36,669 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-12-23 14:12:36,669 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-12-23 14:12:36,669 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-12-23 14:12:36,669 INFO L382 AbstractCegarLoop]: Difference is false [2020-12-23 14:12:36,670 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-12-23 14:12:36,670 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-12-23 14:12:36,691 INFO L276 IsEmpty]: Start isEmpty. Operand 201 states. [2020-12-23 14:12:36,698 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-12-23 14:12:36,699 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 14:12:36,699 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] [2020-12-23 14:12:36,700 INFO L429 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 14:12:36,706 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 14:12:36,706 INFO L82 PathProgramCache]: Analyzing trace with hash -478674777, now seen corresponding path program 1 times [2020-12-23 14:12:36,716 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 14:12:36,716 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [339953259] [2020-12-23 14:12:36,716 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 14:12:37,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 14:12:37,473 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-23 14:12:37,474 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [339953259] [2020-12-23 14:12:37,476 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 14:12:37,476 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-12-23 14:12:37,477 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [272833183] [2020-12-23 14:12:37,494 INFO L461 AbstractCegarLoop]: Interpolant automaton has 2 states [2020-12-23 14:12:37,497 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 14:12:37,515 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2020-12-23 14:12:37,522 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2020-12-23 14:12:37,525 INFO L87 Difference]: Start difference. First operand 201 states. Second operand 2 states. [2020-12-23 14:12:37,567 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 14:12:37,568 INFO L93 Difference]: Finished difference Result 395 states and 553 transitions. [2020-12-23 14:12:37,568 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2020-12-23 14:12:37,569 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 22 [2020-12-23 14:12:37,570 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 14:12:37,583 INFO L225 Difference]: With dead ends: 395 [2020-12-23 14:12:37,583 INFO L226 Difference]: Without dead ends: 194 [2020-12-23 14:12:37,587 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2020-12-23 14:12:37,607 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 194 states. [2020-12-23 14:12:37,636 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 194 to 194. [2020-12-23 14:12:37,637 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 194 states. [2020-12-23 14:12:37,640 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 194 states to 194 states and 249 transitions. [2020-12-23 14:12:37,642 INFO L78 Accepts]: Start accepts. Automaton has 194 states and 249 transitions. Word has length 22 [2020-12-23 14:12:37,642 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 14:12:37,642 INFO L481 AbstractCegarLoop]: Abstraction has 194 states and 249 transitions. [2020-12-23 14:12:37,642 INFO L482 AbstractCegarLoop]: Interpolant automaton has 2 states. [2020-12-23 14:12:37,643 INFO L276 IsEmpty]: Start isEmpty. Operand 194 states and 249 transitions. [2020-12-23 14:12:37,644 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-12-23 14:12:37,644 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 14:12:37,644 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] [2020-12-23 14:12:37,644 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-12-23 14:12:37,645 INFO L429 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 14:12:37,645 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 14:12:37,645 INFO L82 PathProgramCache]: Analyzing trace with hash -2067022679, now seen corresponding path program 1 times [2020-12-23 14:12:37,646 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 14:12:37,646 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [767814393] [2020-12-23 14:12:37,646 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 14:12:37,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 14:12:38,113 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-23 14:12:38,120 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [767814393] [2020-12-23 14:12:38,120 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 14:12:38,120 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-12-23 14:12:38,120 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [367998876] [2020-12-23 14:12:38,122 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-23 14:12:38,122 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 14:12:38,124 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-23 14:12:38,124 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-23 14:12:38,124 INFO L87 Difference]: Start difference. First operand 194 states and 249 transitions. Second operand 4 states. [2020-12-23 14:12:38,332 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 14:12:38,332 INFO L93 Difference]: Finished difference Result 365 states and 467 transitions. [2020-12-23 14:12:38,334 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-12-23 14:12:38,334 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 22 [2020-12-23 14:12:38,335 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 14:12:38,340 INFO L225 Difference]: With dead ends: 365 [2020-12-23 14:12:38,340 INFO L226 Difference]: Without dead ends: 194 [2020-12-23 14:12:38,345 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 [2020-12-23 14:12:38,349 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 194 states. [2020-12-23 14:12:38,377 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 194 to 194. [2020-12-23 14:12:38,378 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 194 states. [2020-12-23 14:12:38,380 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 194 states to 194 states and 247 transitions. [2020-12-23 14:12:38,381 INFO L78 Accepts]: Start accepts. Automaton has 194 states and 247 transitions. Word has length 22 [2020-12-23 14:12:38,381 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 14:12:38,381 INFO L481 AbstractCegarLoop]: Abstraction has 194 states and 247 transitions. [2020-12-23 14:12:38,381 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-23 14:12:38,381 INFO L276 IsEmpty]: Start isEmpty. Operand 194 states and 247 transitions. [2020-12-23 14:12:38,384 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-12-23 14:12:38,384 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 14:12:38,384 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] [2020-12-23 14:12:38,385 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-12-23 14:12:38,385 INFO L429 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 14:12:38,385 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 14:12:38,386 INFO L82 PathProgramCache]: Analyzing trace with hash 921090108, now seen corresponding path program 1 times [2020-12-23 14:12:38,386 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 14:12:38,387 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [144704416] [2020-12-23 14:12:38,388 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 14:12:38,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 14:12:38,709 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-23 14:12:38,711 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [144704416] [2020-12-23 14:12:38,711 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 14:12:38,711 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-12-23 14:12:38,711 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1684878950] [2020-12-23 14:12:38,712 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-23 14:12:38,713 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 14:12:38,717 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-23 14:12:38,718 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-23 14:12:38,718 INFO L87 Difference]: Start difference. First operand 194 states and 247 transitions. Second operand 4 states. [2020-12-23 14:12:38,980 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 14:12:38,980 INFO L93 Difference]: Finished difference Result 506 states and 663 transitions. [2020-12-23 14:12:38,981 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-12-23 14:12:38,981 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 28 [2020-12-23 14:12:38,982 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 14:12:38,984 INFO L225 Difference]: With dead ends: 506 [2020-12-23 14:12:38,984 INFO L226 Difference]: Without dead ends: 326 [2020-12-23 14:12:38,986 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 [2020-12-23 14:12:38,990 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 326 states. [2020-12-23 14:12:39,013 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 326 to 206. [2020-12-23 14:12:39,014 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 206 states. [2020-12-23 14:12:39,015 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 206 states to 206 states and 259 transitions. [2020-12-23 14:12:39,015 INFO L78 Accepts]: Start accepts. Automaton has 206 states and 259 transitions. Word has length 28 [2020-12-23 14:12:39,015 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 14:12:39,015 INFO L481 AbstractCegarLoop]: Abstraction has 206 states and 259 transitions. [2020-12-23 14:12:39,016 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-23 14:12:39,016 INFO L276 IsEmpty]: Start isEmpty. Operand 206 states and 259 transitions. [2020-12-23 14:12:39,019 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-12-23 14:12:39,019 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 14:12:39,019 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] [2020-12-23 14:12:39,020 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-12-23 14:12:39,020 INFO L429 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 14:12:39,021 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 14:12:39,021 INFO L82 PathProgramCache]: Analyzing trace with hash -99978246, now seen corresponding path program 1 times [2020-12-23 14:12:39,021 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 14:12:39,022 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1956952077] [2020-12-23 14:12:39,022 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 14:12:39,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 14:12:39,397 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-23 14:12:39,398 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1956952077] [2020-12-23 14:12:39,398 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 14:12:39,398 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-12-23 14:12:39,398 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [517412181] [2020-12-23 14:12:39,399 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-23 14:12:39,399 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 14:12:39,400 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-23 14:12:39,400 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-23 14:12:39,400 INFO L87 Difference]: Start difference. First operand 206 states and 259 transitions. Second operand 4 states. [2020-12-23 14:12:39,648 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 14:12:39,649 INFO L93 Difference]: Finished difference Result 448 states and 571 transitions. [2020-12-23 14:12:39,649 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-12-23 14:12:39,649 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 28 [2020-12-23 14:12:39,650 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 14:12:39,652 INFO L225 Difference]: With dead ends: 448 [2020-12-23 14:12:39,652 INFO L226 Difference]: Without dead ends: 266 [2020-12-23 14:12:39,653 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 [2020-12-23 14:12:39,653 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 266 states. [2020-12-23 14:12:39,663 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 266 to 218. [2020-12-23 14:12:39,664 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 218 states. [2020-12-23 14:12:39,665 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 218 states to 218 states and 271 transitions. [2020-12-23 14:12:39,665 INFO L78 Accepts]: Start accepts. Automaton has 218 states and 271 transitions. Word has length 28 [2020-12-23 14:12:39,665 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 14:12:39,665 INFO L481 AbstractCegarLoop]: Abstraction has 218 states and 271 transitions. [2020-12-23 14:12:39,666 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-23 14:12:39,666 INFO L276 IsEmpty]: Start isEmpty. Operand 218 states and 271 transitions. [2020-12-23 14:12:39,671 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-12-23 14:12:39,672 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 14:12:39,672 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] [2020-12-23 14:12:39,672 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-12-23 14:12:39,673 INFO L429 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 14:12:39,673 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 14:12:39,674 INFO L82 PathProgramCache]: Analyzing trace with hash -1379732482, now seen corresponding path program 1 times [2020-12-23 14:12:39,674 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 14:12:39,674 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [324686495] [2020-12-23 14:12:39,674 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 14:12:40,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 14:12:40,358 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-23 14:12:40,358 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [324686495] [2020-12-23 14:12:40,358 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 14:12:40,359 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-12-23 14:12:40,359 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [732291566] [2020-12-23 14:12:40,359 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-12-23 14:12:40,360 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 14:12:40,360 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-12-23 14:12:40,360 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-12-23 14:12:40,361 INFO L87 Difference]: Start difference. First operand 218 states and 271 transitions. Second operand 5 states. [2020-12-23 14:12:40,479 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 14:12:40,482 INFO L93 Difference]: Finished difference Result 464 states and 555 transitions. [2020-12-23 14:12:40,483 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-12-23 14:12:40,483 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 28 [2020-12-23 14:12:40,485 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 14:12:40,487 INFO L225 Difference]: With dead ends: 464 [2020-12-23 14:12:40,487 INFO L226 Difference]: Without dead ends: 411 [2020-12-23 14:12:40,488 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 [2020-12-23 14:12:40,489 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 411 states. [2020-12-23 14:12:40,494 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 411 to 220. [2020-12-23 14:12:40,495 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 220 states. [2020-12-23 14:12:40,495 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 220 states to 220 states and 273 transitions. [2020-12-23 14:12:40,496 INFO L78 Accepts]: Start accepts. Automaton has 220 states and 273 transitions. Word has length 28 [2020-12-23 14:12:40,496 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 14:12:40,496 INFO L481 AbstractCegarLoop]: Abstraction has 220 states and 273 transitions. [2020-12-23 14:12:40,497 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-12-23 14:12:40,497 INFO L276 IsEmpty]: Start isEmpty. Operand 220 states and 273 transitions. [2020-12-23 14:12:40,498 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2020-12-23 14:12:40,498 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 14:12:40,498 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] [2020-12-23 14:12:40,498 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-12-23 14:12:40,498 INFO L429 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 14:12:40,499 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 14:12:40,499 INFO L82 PathProgramCache]: Analyzing trace with hash 1583060967, now seen corresponding path program 1 times [2020-12-23 14:12:40,499 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 14:12:40,499 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [400259910] [2020-12-23 14:12:40,500 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 14:12:40,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 14:12:40,777 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-23 14:12:40,777 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [400259910] [2020-12-23 14:12:40,777 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 14:12:40,777 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-12-23 14:12:40,778 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1913019585] [2020-12-23 14:12:40,778 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-12-23 14:12:40,778 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 14:12:40,779 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-12-23 14:12:40,779 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-12-23 14:12:40,779 INFO L87 Difference]: Start difference. First operand 220 states and 273 transitions. Second operand 5 states. [2020-12-23 14:12:40,925 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 14:12:40,925 INFO L93 Difference]: Finished difference Result 386 states and 477 transitions. [2020-12-23 14:12:40,926 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-12-23 14:12:40,926 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 36 [2020-12-23 14:12:40,926 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 14:12:40,928 INFO L225 Difference]: With dead ends: 386 [2020-12-23 14:12:40,928 INFO L226 Difference]: Without dead ends: 220 [2020-12-23 14:12:40,928 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2020-12-23 14:12:40,929 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 220 states. [2020-12-23 14:12:40,934 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 220 to 220. [2020-12-23 14:12:40,934 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 220 states. [2020-12-23 14:12:40,935 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 220 states to 220 states and 269 transitions. [2020-12-23 14:12:40,935 INFO L78 Accepts]: Start accepts. Automaton has 220 states and 269 transitions. Word has length 36 [2020-12-23 14:12:40,936 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 14:12:40,936 INFO L481 AbstractCegarLoop]: Abstraction has 220 states and 269 transitions. [2020-12-23 14:12:40,936 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-12-23 14:12:40,936 INFO L276 IsEmpty]: Start isEmpty. Operand 220 states and 269 transitions. [2020-12-23 14:12:40,937 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2020-12-23 14:12:40,937 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 14:12:40,937 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] [2020-12-23 14:12:40,937 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-12-23 14:12:40,938 INFO L429 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 14:12:40,938 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 14:12:40,938 INFO L82 PathProgramCache]: Analyzing trace with hash 443924828, now seen corresponding path program 1 times [2020-12-23 14:12:40,938 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 14:12:40,939 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1260851478] [2020-12-23 14:12:40,939 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 14:12:41,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 14:12:41,396 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-23 14:12:41,397 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1260851478] [2020-12-23 14:12:41,397 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 14:12:41,397 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-12-23 14:12:41,397 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1874360772] [2020-12-23 14:12:41,397 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-12-23 14:12:41,398 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 14:12:41,398 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-12-23 14:12:41,398 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2020-12-23 14:12:41,398 INFO L87 Difference]: Start difference. First operand 220 states and 269 transitions. Second operand 6 states. [2020-12-23 14:12:41,802 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 14:12:41,802 INFO L93 Difference]: Finished difference Result 359 states and 426 transitions. [2020-12-23 14:12:41,803 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-12-23 14:12:41,803 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 38 [2020-12-23 14:12:41,803 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 14:12:41,805 INFO L225 Difference]: With dead ends: 359 [2020-12-23 14:12:41,805 INFO L226 Difference]: Without dead ends: 351 [2020-12-23 14:12:41,806 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2020-12-23 14:12:41,806 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 351 states. [2020-12-23 14:12:41,813 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 351 to 236. [2020-12-23 14:12:41,813 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 236 states. [2020-12-23 14:12:41,814 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 236 states to 236 states and 285 transitions. [2020-12-23 14:12:41,815 INFO L78 Accepts]: Start accepts. Automaton has 236 states and 285 transitions. Word has length 38 [2020-12-23 14:12:41,815 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 14:12:41,815 INFO L481 AbstractCegarLoop]: Abstraction has 236 states and 285 transitions. [2020-12-23 14:12:41,815 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-12-23 14:12:41,815 INFO L276 IsEmpty]: Start isEmpty. Operand 236 states and 285 transitions. [2020-12-23 14:12:41,816 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2020-12-23 14:12:41,816 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 14:12:41,816 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] [2020-12-23 14:12:41,817 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-12-23 14:12:41,817 INFO L429 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 14:12:41,817 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 14:12:41,817 INFO L82 PathProgramCache]: Analyzing trace with hash 1410139390, now seen corresponding path program 1 times [2020-12-23 14:12:41,817 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 14:12:41,818 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [37089173] [2020-12-23 14:12:41,818 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 14:12:45,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 14:12:45,516 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-23 14:12:45,516 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [37089173] [2020-12-23 14:12:45,517 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 14:12:45,517 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-12-23 14:12:45,517 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1734929919] [2020-12-23 14:12:45,517 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-12-23 14:12:45,518 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 14:12:45,518 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-12-23 14:12:45,518 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-12-23 14:12:45,519 INFO L87 Difference]: Start difference. First operand 236 states and 285 transitions. Second operand 5 states. [2020-12-23 14:12:48,165 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 14:12:48,166 INFO L93 Difference]: Finished difference Result 335 states and 398 transitions. [2020-12-23 14:12:48,167 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-12-23 14:12:48,167 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 40 [2020-12-23 14:12:48,167 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 14:12:48,169 INFO L225 Difference]: With dead ends: 335 [2020-12-23 14:12:48,169 INFO L226 Difference]: Without dead ends: 333 [2020-12-23 14:12:48,170 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2020-12-23 14:12:48,171 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 333 states. [2020-12-23 14:12:48,184 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 333 to 306. [2020-12-23 14:12:48,185 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 306 states. [2020-12-23 14:12:48,186 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 306 states to 306 states and 374 transitions. [2020-12-23 14:12:48,186 INFO L78 Accepts]: Start accepts. Automaton has 306 states and 374 transitions. Word has length 40 [2020-12-23 14:12:48,187 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 14:12:48,187 INFO L481 AbstractCegarLoop]: Abstraction has 306 states and 374 transitions. [2020-12-23 14:12:48,187 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-12-23 14:12:48,187 INFO L276 IsEmpty]: Start isEmpty. Operand 306 states and 374 transitions. [2020-12-23 14:12:48,188 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2020-12-23 14:12:48,188 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 14:12:48,188 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] [2020-12-23 14:12:48,188 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-12-23 14:12:48,189 INFO L429 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 14:12:48,189 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 14:12:48,189 INFO L82 PathProgramCache]: Analyzing trace with hash -2065569472, now seen corresponding path program 1 times [2020-12-23 14:12:48,189 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 14:12:48,190 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [584097702] [2020-12-23 14:12:48,190 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 14:12:48,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 14:12:48,610 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-23 14:12:48,611 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [584097702] [2020-12-23 14:12:48,611 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 14:12:48,611 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-12-23 14:12:48,612 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [488752611] [2020-12-23 14:12:48,612 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-23 14:12:48,612 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 14:12:48,613 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-23 14:12:48,613 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-23 14:12:48,613 INFO L87 Difference]: Start difference. First operand 306 states and 374 transitions. Second operand 4 states. [2020-12-23 14:12:51,092 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 14:12:51,093 INFO L93 Difference]: Finished difference Result 330 states and 393 transitions. [2020-12-23 14:12:51,093 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-12-23 14:12:51,094 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 42 [2020-12-23 14:12:51,094 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 14:12:51,096 INFO L225 Difference]: With dead ends: 330 [2020-12-23 14:12:51,096 INFO L226 Difference]: Without dead ends: 328 [2020-12-23 14:12:51,096 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 [2020-12-23 14:12:51,097 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 328 states. [2020-12-23 14:12:51,108 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 328 to 308. [2020-12-23 14:12:51,109 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 308 states. [2020-12-23 14:12:51,110 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 308 states to 308 states and 376 transitions. [2020-12-23 14:12:51,110 INFO L78 Accepts]: Start accepts. Automaton has 308 states and 376 transitions. Word has length 42 [2020-12-23 14:12:51,111 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 14:12:51,111 INFO L481 AbstractCegarLoop]: Abstraction has 308 states and 376 transitions. [2020-12-23 14:12:51,111 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-23 14:12:51,111 INFO L276 IsEmpty]: Start isEmpty. Operand 308 states and 376 transitions. [2020-12-23 14:12:51,112 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2020-12-23 14:12:51,112 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 14:12:51,112 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] [2020-12-23 14:12:51,112 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-12-23 14:12:51,112 INFO L429 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 14:12:51,113 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 14:12:51,113 INFO L82 PathProgramCache]: Analyzing trace with hash -1894660332, now seen corresponding path program 1 times [2020-12-23 14:12:51,113 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 14:12:51,113 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [863521625] [2020-12-23 14:12:51,113 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 14:12:51,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 14:12:51,541 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-23 14:12:51,541 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [863521625] [2020-12-23 14:12:51,541 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 14:12:51,542 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-12-23 14:12:51,542 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1610056031] [2020-12-23 14:12:51,542 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-12-23 14:12:51,542 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 14:12:51,543 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-12-23 14:12:51,543 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-12-23 14:12:51,543 INFO L87 Difference]: Start difference. First operand 308 states and 376 transitions. Second operand 5 states. [2020-12-23 14:12:56,494 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 14:12:56,494 INFO L93 Difference]: Finished difference Result 857 states and 1045 transitions. [2020-12-23 14:12:56,495 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-12-23 14:12:56,495 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 42 [2020-12-23 14:12:56,496 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 14:12:56,499 INFO L225 Difference]: With dead ends: 857 [2020-12-23 14:12:56,499 INFO L226 Difference]: Without dead ends: 570 [2020-12-23 14:12:56,499 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2020-12-23 14:12:56,500 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 570 states. [2020-12-23 14:12:56,514 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 570 to 332. [2020-12-23 14:12:56,515 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 332 states. [2020-12-23 14:12:56,516 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 332 states to 332 states and 400 transitions. [2020-12-23 14:12:56,516 INFO L78 Accepts]: Start accepts. Automaton has 332 states and 400 transitions. Word has length 42 [2020-12-23 14:12:56,516 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 14:12:56,517 INFO L481 AbstractCegarLoop]: Abstraction has 332 states and 400 transitions. [2020-12-23 14:12:56,517 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-12-23 14:12:56,517 INFO L276 IsEmpty]: Start isEmpty. Operand 332 states and 400 transitions. [2020-12-23 14:12:56,517 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2020-12-23 14:12:56,517 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 14:12:56,518 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] [2020-12-23 14:12:56,518 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2020-12-23 14:12:56,518 INFO L429 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 14:12:56,518 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 14:12:56,519 INFO L82 PathProgramCache]: Analyzing trace with hash -1214601962, now seen corresponding path program 1 times [2020-12-23 14:12:56,519 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 14:12:56,519 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1271219995] [2020-12-23 14:12:56,519 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 14:13:00,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 14:13:01,036 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-23 14:13:01,037 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1271219995] [2020-12-23 14:13:01,037 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 14:13:01,037 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-12-23 14:13:01,037 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1251004426] [2020-12-23 14:13:01,038 INFO L461 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-12-23 14:13:01,038 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 14:13:01,038 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-12-23 14:13:01,039 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2020-12-23 14:13:01,039 INFO L87 Difference]: Start difference. First operand 332 states and 400 transitions. Second operand 12 states. [2020-12-23 14:13:07,174 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 14:13:07,175 INFO L93 Difference]: Finished difference Result 759 states and 900 transitions. [2020-12-23 14:13:07,175 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2020-12-23 14:13:07,175 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 42 [2020-12-23 14:13:07,176 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 14:13:07,179 INFO L225 Difference]: With dead ends: 759 [2020-12-23 14:13:07,179 INFO L226 Difference]: Without dead ends: 713 [2020-12-23 14:13:07,180 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 73 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=181, Invalid=371, Unknown=0, NotChecked=0, Total=552 [2020-12-23 14:13:07,181 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 713 states. [2020-12-23 14:13:07,204 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 713 to 515. [2020-12-23 14:13:07,204 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 515 states. [2020-12-23 14:13:07,207 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 515 states to 515 states and 630 transitions. [2020-12-23 14:13:07,207 INFO L78 Accepts]: Start accepts. Automaton has 515 states and 630 transitions. Word has length 42 [2020-12-23 14:13:07,208 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 14:13:07,208 INFO L481 AbstractCegarLoop]: Abstraction has 515 states and 630 transitions. [2020-12-23 14:13:07,208 INFO L482 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-12-23 14:13:07,208 INFO L276 IsEmpty]: Start isEmpty. Operand 515 states and 630 transitions. [2020-12-23 14:13:07,210 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2020-12-23 14:13:07,210 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 14:13:07,210 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] [2020-12-23 14:13:07,210 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2020-12-23 14:13:07,211 INFO L429 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 14:13:07,211 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 14:13:07,211 INFO L82 PathProgramCache]: Analyzing trace with hash -956436524, now seen corresponding path program 1 times [2020-12-23 14:13:07,211 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 14:13:07,212 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [649529813] [2020-12-23 14:13:07,212 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 14:13:07,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 14:13:07,767 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-23 14:13:07,767 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [649529813] [2020-12-23 14:13:07,767 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 14:13:07,767 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-12-23 14:13:07,767 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [97895832] [2020-12-23 14:13:07,768 INFO L461 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-12-23 14:13:07,768 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 14:13:07,768 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-12-23 14:13:07,769 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2020-12-23 14:13:07,769 INFO L87 Difference]: Start difference. First operand 515 states and 630 transitions. Second operand 9 states. [2020-12-23 14:13:16,283 WARN L197 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 21 DAG size of output: 21 [2020-12-23 14:13:18,773 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 14:13:18,773 INFO L93 Difference]: Finished difference Result 953 states and 1160 transitions. [2020-12-23 14:13:18,774 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2020-12-23 14:13:18,775 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 42 [2020-12-23 14:13:18,775 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 14:13:18,780 INFO L225 Difference]: With dead ends: 953 [2020-12-23 14:13:18,780 INFO L226 Difference]: Without dead ends: 923 [2020-12-23 14:13:18,781 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=91, Invalid=215, Unknown=0, NotChecked=0, Total=306 [2020-12-23 14:13:18,782 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 923 states. [2020-12-23 14:13:18,810 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 923 to 657. [2020-12-23 14:13:18,810 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 657 states. [2020-12-23 14:13:18,813 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 657 states to 657 states and 808 transitions. [2020-12-23 14:13:18,813 INFO L78 Accepts]: Start accepts. Automaton has 657 states and 808 transitions. Word has length 42 [2020-12-23 14:13:18,813 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 14:13:18,813 INFO L481 AbstractCegarLoop]: Abstraction has 657 states and 808 transitions. [2020-12-23 14:13:18,813 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-12-23 14:13:18,813 INFO L276 IsEmpty]: Start isEmpty. Operand 657 states and 808 transitions. [2020-12-23 14:13:18,814 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2020-12-23 14:13:18,814 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 14:13:18,814 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] [2020-12-23 14:13:18,814 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2020-12-23 14:13:18,815 INFO L429 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 14:13:18,815 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 14:13:18,815 INFO L82 PathProgramCache]: Analyzing trace with hash 1647355152, now seen corresponding path program 1 times [2020-12-23 14:13:18,815 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 14:13:18,816 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [227554374] [2020-12-23 14:13:18,816 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 14:13:19,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 14:13:19,499 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-23 14:13:19,499 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [227554374] [2020-12-23 14:13:19,499 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 14:13:19,499 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-12-23 14:13:19,500 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [642205033] [2020-12-23 14:13:19,500 INFO L461 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-12-23 14:13:19,500 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 14:13:19,501 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-12-23 14:13:19,501 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2020-12-23 14:13:19,501 INFO L87 Difference]: Start difference. First operand 657 states and 808 transitions. Second operand 10 states. [2020-12-23 14:13:25,556 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 14:13:25,556 INFO L93 Difference]: Finished difference Result 761 states and 915 transitions. [2020-12-23 14:13:25,557 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-12-23 14:13:25,557 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 42 [2020-12-23 14:13:25,557 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 14:13:25,561 INFO L225 Difference]: With dead ends: 761 [2020-12-23 14:13:25,561 INFO L226 Difference]: Without dead ends: 738 [2020-12-23 14:13:25,562 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=85, Invalid=187, Unknown=0, NotChecked=0, Total=272 [2020-12-23 14:13:25,563 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 738 states. [2020-12-23 14:13:25,592 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 738 to 664. [2020-12-23 14:13:25,592 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 664 states. [2020-12-23 14:13:25,594 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 664 states to 664 states and 816 transitions. [2020-12-23 14:13:25,594 INFO L78 Accepts]: Start accepts. Automaton has 664 states and 816 transitions. Word has length 42 [2020-12-23 14:13:25,595 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 14:13:25,595 INFO L481 AbstractCegarLoop]: Abstraction has 664 states and 816 transitions. [2020-12-23 14:13:25,595 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-12-23 14:13:25,595 INFO L276 IsEmpty]: Start isEmpty. Operand 664 states and 816 transitions. [2020-12-23 14:13:25,596 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2020-12-23 14:13:25,596 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 14:13:25,596 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] [2020-12-23 14:13:25,596 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2020-12-23 14:13:25,596 INFO L429 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 14:13:25,597 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 14:13:25,597 INFO L82 PathProgramCache]: Analyzing trace with hash -1967553774, now seen corresponding path program 1 times [2020-12-23 14:13:25,597 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 14:13:25,597 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [601408726] [2020-12-23 14:13:25,597 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 14:13:25,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 14:13:25,968 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-23 14:13:25,969 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [601408726] [2020-12-23 14:13:25,970 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 14:13:25,970 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-12-23 14:13:25,970 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1177302277] [2020-12-23 14:13:25,970 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-12-23 14:13:25,970 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 14:13:25,971 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-12-23 14:13:25,971 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-12-23 14:13:25,971 INFO L87 Difference]: Start difference. First operand 664 states and 816 transitions. Second operand 5 states. [2020-12-23 14:13:28,843 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 14:13:28,844 INFO L93 Difference]: Finished difference Result 1587 states and 1953 transitions. [2020-12-23 14:13:28,845 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-12-23 14:13:28,845 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 42 [2020-12-23 14:13:28,845 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 14:13:28,850 INFO L225 Difference]: With dead ends: 1587 [2020-12-23 14:13:28,850 INFO L226 Difference]: Without dead ends: 1003 [2020-12-23 14:13:28,852 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2020-12-23 14:13:28,854 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1003 states. [2020-12-23 14:13:28,883 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1003 to 664. [2020-12-23 14:13:28,884 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 664 states. [2020-12-23 14:13:28,886 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 664 states to 664 states and 800 transitions. [2020-12-23 14:13:28,886 INFO L78 Accepts]: Start accepts. Automaton has 664 states and 800 transitions. Word has length 42 [2020-12-23 14:13:28,886 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 14:13:28,887 INFO L481 AbstractCegarLoop]: Abstraction has 664 states and 800 transitions. [2020-12-23 14:13:28,887 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-12-23 14:13:28,887 INFO L276 IsEmpty]: Start isEmpty. Operand 664 states and 800 transitions. [2020-12-23 14:13:28,887 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2020-12-23 14:13:28,887 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 14:13:28,888 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] [2020-12-23 14:13:28,888 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2020-12-23 14:13:28,888 INFO L429 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 14:13:28,888 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 14:13:28,889 INFO L82 PathProgramCache]: Analyzing trace with hash -617529557, now seen corresponding path program 1 times [2020-12-23 14:13:28,890 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 14:13:28,892 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1974252211] [2020-12-23 14:13:28,893 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 14:13:29,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 14:13:29,324 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-23 14:13:29,325 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1974252211] [2020-12-23 14:13:29,325 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 14:13:29,325 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-12-23 14:13:29,325 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1897154674] [2020-12-23 14:13:29,326 INFO L461 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-12-23 14:13:29,326 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 14:13:29,327 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-12-23 14:13:29,327 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2020-12-23 14:13:29,327 INFO L87 Difference]: Start difference. First operand 664 states and 800 transitions. Second operand 8 states. [2020-12-23 14:13:30,776 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 14:13:30,776 INFO L93 Difference]: Finished difference Result 1080 states and 1283 transitions. [2020-12-23 14:13:30,778 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2020-12-23 14:13:30,778 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 44 [2020-12-23 14:13:30,778 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 14:13:30,783 INFO L225 Difference]: With dead ends: 1080 [2020-12-23 14:13:30,783 INFO L226 Difference]: Without dead ends: 1072 [2020-12-23 14:13:30,784 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=83, Invalid=223, Unknown=0, NotChecked=0, Total=306 [2020-12-23 14:13:30,785 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1072 states. [2020-12-23 14:13:30,817 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1072 to 686. [2020-12-23 14:13:30,817 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 686 states. [2020-12-23 14:13:30,819 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 686 states to 686 states and 822 transitions. [2020-12-23 14:13:30,820 INFO L78 Accepts]: Start accepts. Automaton has 686 states and 822 transitions. Word has length 44 [2020-12-23 14:13:30,820 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 14:13:30,820 INFO L481 AbstractCegarLoop]: Abstraction has 686 states and 822 transitions. [2020-12-23 14:13:30,820 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-12-23 14:13:30,820 INFO L276 IsEmpty]: Start isEmpty. Operand 686 states and 822 transitions. [2020-12-23 14:13:30,821 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2020-12-23 14:13:30,821 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 14:13:30,821 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] [2020-12-23 14:13:30,821 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2020-12-23 14:13:30,821 INFO L429 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 14:13:30,822 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 14:13:30,822 INFO L82 PathProgramCache]: Analyzing trace with hash -1426876183, now seen corresponding path program 1 times [2020-12-23 14:13:30,822 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 14:13:30,822 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1277222437] [2020-12-23 14:13:30,822 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 14:13:31,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 14:13:31,752 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-23 14:13:31,754 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1277222437] [2020-12-23 14:13:31,756 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 14:13:31,756 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-12-23 14:13:31,758 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1341484441] [2020-12-23 14:13:31,758 INFO L461 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-12-23 14:13:31,758 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 14:13:31,759 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-12-23 14:13:31,760 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2020-12-23 14:13:31,760 INFO L87 Difference]: Start difference. First operand 686 states and 822 transitions. Second operand 11 states. [2020-12-23 14:13:39,533 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 14:13:39,533 INFO L93 Difference]: Finished difference Result 2062 states and 2442 transitions. [2020-12-23 14:13:39,535 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2020-12-23 14:13:39,535 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 44 [2020-12-23 14:13:39,535 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 14:13:39,541 INFO L225 Difference]: With dead ends: 2062 [2020-12-23 14:13:39,541 INFO L226 Difference]: Without dead ends: 1435 [2020-12-23 14:13:39,543 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 129 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=164, Invalid=486, Unknown=0, NotChecked=0, Total=650 [2020-12-23 14:13:39,544 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1435 states. [2020-12-23 14:13:39,582 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1435 to 885. [2020-12-23 14:13:39,583 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 885 states. [2020-12-23 14:13:39,585 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 885 states to 885 states and 1070 transitions. [2020-12-23 14:13:39,585 INFO L78 Accepts]: Start accepts. Automaton has 885 states and 1070 transitions. Word has length 44 [2020-12-23 14:13:39,586 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 14:13:39,586 INFO L481 AbstractCegarLoop]: Abstraction has 885 states and 1070 transitions. [2020-12-23 14:13:39,586 INFO L482 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-12-23 14:13:39,586 INFO L276 IsEmpty]: Start isEmpty. Operand 885 states and 1070 transitions. [2020-12-23 14:13:39,587 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2020-12-23 14:13:39,587 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 14:13:39,587 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] [2020-12-23 14:13:39,587 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2020-12-23 14:13:39,587 INFO L429 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 14:13:39,588 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 14:13:39,588 INFO L82 PathProgramCache]: Analyzing trace with hash -1379270491, now seen corresponding path program 1 times [2020-12-23 14:13:39,588 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 14:13:39,588 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [90849693] [2020-12-23 14:13:39,588 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 14:13:41,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 14:13:42,246 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-23 14:13:42,247 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [90849693] [2020-12-23 14:13:42,248 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 14:13:42,248 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-12-23 14:13:42,248 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2007478379] [2020-12-23 14:13:42,248 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-12-23 14:13:42,249 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 14:13:42,249 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-12-23 14:13:42,250 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-12-23 14:13:42,250 INFO L87 Difference]: Start difference. First operand 885 states and 1070 transitions. Second operand 5 states. [2020-12-23 14:13:44,886 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 14:13:44,887 INFO L93 Difference]: Finished difference Result 905 states and 1085 transitions. [2020-12-23 14:13:44,888 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-12-23 14:13:44,888 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 45 [2020-12-23 14:13:44,888 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 14:13:44,892 INFO L225 Difference]: With dead ends: 905 [2020-12-23 14:13:44,892 INFO L226 Difference]: Without dead ends: 903 [2020-12-23 14:13:44,892 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2020-12-23 14:13:44,894 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 903 states. [2020-12-23 14:13:44,932 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 903 to 888. [2020-12-23 14:13:44,933 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 888 states. [2020-12-23 14:13:44,935 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 888 states to 888 states and 1073 transitions. [2020-12-23 14:13:44,935 INFO L78 Accepts]: Start accepts. Automaton has 888 states and 1073 transitions. Word has length 45 [2020-12-23 14:13:44,935 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 14:13:44,935 INFO L481 AbstractCegarLoop]: Abstraction has 888 states and 1073 transitions. [2020-12-23 14:13:44,935 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-12-23 14:13:44,935 INFO L276 IsEmpty]: Start isEmpty. Operand 888 states and 1073 transitions. [2020-12-23 14:13:44,936 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2020-12-23 14:13:44,936 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 14:13:44,936 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] [2020-12-23 14:13:44,937 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2020-12-23 14:13:44,937 INFO L429 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 14:13:44,937 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 14:13:44,937 INFO L82 PathProgramCache]: Analyzing trace with hash 362256074, now seen corresponding path program 1 times [2020-12-23 14:13:44,938 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 14:13:44,938 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1296283331] [2020-12-23 14:13:44,938 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 14:13:45,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 14:13:45,389 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-23 14:13:45,389 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1296283331] [2020-12-23 14:13:45,390 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 14:13:45,390 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-12-23 14:13:45,390 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [520066210] [2020-12-23 14:13:45,390 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-12-23 14:13:45,391 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 14:13:45,391 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-12-23 14:13:45,391 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2020-12-23 14:13:45,391 INFO L87 Difference]: Start difference. First operand 888 states and 1073 transitions. Second operand 7 states. [2020-12-23 14:13:46,224 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 14:13:46,224 INFO L93 Difference]: Finished difference Result 1724 states and 2071 transitions. [2020-12-23 14:13:46,226 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-12-23 14:13:46,226 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 46 [2020-12-23 14:13:46,226 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 14:13:46,232 INFO L225 Difference]: With dead ends: 1724 [2020-12-23 14:13:46,232 INFO L226 Difference]: Without dead ends: 1227 [2020-12-23 14:13:46,234 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2020-12-23 14:13:46,235 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1227 states. [2020-12-23 14:13:46,281 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1227 to 888. [2020-12-23 14:13:46,281 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 888 states. [2020-12-23 14:13:46,284 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 888 states to 888 states and 1070 transitions. [2020-12-23 14:13:46,284 INFO L78 Accepts]: Start accepts. Automaton has 888 states and 1070 transitions. Word has length 46 [2020-12-23 14:13:46,285 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 14:13:46,285 INFO L481 AbstractCegarLoop]: Abstraction has 888 states and 1070 transitions. [2020-12-23 14:13:46,285 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-12-23 14:13:46,285 INFO L276 IsEmpty]: Start isEmpty. Operand 888 states and 1070 transitions. [2020-12-23 14:13:46,286 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2020-12-23 14:13:46,286 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 14:13:46,286 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] [2020-12-23 14:13:46,287 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2020-12-23 14:13:46,287 INFO L429 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 14:13:46,287 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 14:13:46,287 INFO L82 PathProgramCache]: Analyzing trace with hash 50966821, now seen corresponding path program 1 times [2020-12-23 14:13:46,288 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 14:13:46,288 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [176841476] [2020-12-23 14:13:46,288 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 14:13:50,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 14:13:50,648 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-23 14:13:50,648 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [176841476] [2020-12-23 14:13:50,648 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 14:13:50,649 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-12-23 14:13:50,649 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1877084737] [2020-12-23 14:13:50,649 INFO L461 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-12-23 14:13:50,649 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 14:13:50,650 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-12-23 14:13:50,650 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2020-12-23 14:13:50,650 INFO L87 Difference]: Start difference. First operand 888 states and 1070 transitions. Second operand 10 states. [2020-12-23 14:13:58,619 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 14:13:58,620 INFO L93 Difference]: Finished difference Result 1005 states and 1187 transitions. [2020-12-23 14:13:58,621 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-12-23 14:13:58,621 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 48 [2020-12-23 14:13:58,621 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 14:13:58,626 INFO L225 Difference]: With dead ends: 1005 [2020-12-23 14:13:58,626 INFO L226 Difference]: Without dead ends: 968 [2020-12-23 14:13:58,627 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=70, Invalid=140, Unknown=0, NotChecked=0, Total=210 [2020-12-23 14:13:58,628 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 968 states. [2020-12-23 14:13:58,682 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 968 to 888. [2020-12-23 14:13:58,682 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 888 states. [2020-12-23 14:13:58,684 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 888 states to 888 states and 1069 transitions. [2020-12-23 14:13:58,684 INFO L78 Accepts]: Start accepts. Automaton has 888 states and 1069 transitions. Word has length 48 [2020-12-23 14:13:58,685 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 14:13:58,685 INFO L481 AbstractCegarLoop]: Abstraction has 888 states and 1069 transitions. [2020-12-23 14:13:58,685 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-12-23 14:13:58,685 INFO L276 IsEmpty]: Start isEmpty. Operand 888 states and 1069 transitions. [2020-12-23 14:13:58,686 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2020-12-23 14:13:58,686 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 14:13:58,686 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] [2020-12-23 14:13:58,686 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2020-12-23 14:13:58,686 INFO L429 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 14:13:58,687 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 14:13:58,687 INFO L82 PathProgramCache]: Analyzing trace with hash -1382043361, now seen corresponding path program 1 times [2020-12-23 14:13:58,687 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 14:13:58,687 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [239743924] [2020-12-23 14:13:58,687 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 14:13:58,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 14:13:59,434 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-23 14:13:59,435 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [239743924] [2020-12-23 14:13:59,435 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 14:13:59,435 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-12-23 14:13:59,435 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [767206193] [2020-12-23 14:13:59,436 INFO L461 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-12-23 14:13:59,436 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 14:13:59,436 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-12-23 14:13:59,436 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2020-12-23 14:13:59,437 INFO L87 Difference]: Start difference. First operand 888 states and 1069 transitions. Second operand 11 states. [2020-12-23 14:14:07,356 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 14:14:07,356 INFO L93 Difference]: Finished difference Result 1716 states and 2015 transitions. [2020-12-23 14:14:07,357 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2020-12-23 14:14:07,358 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 48 [2020-12-23 14:14:07,358 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 14:14:07,365 INFO L225 Difference]: With dead ends: 1716 [2020-12-23 14:14:07,365 INFO L226 Difference]: Without dead ends: 1677 [2020-12-23 14:14:07,367 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 71 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=135, Invalid=327, Unknown=0, NotChecked=0, Total=462 [2020-12-23 14:14:07,371 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1677 states. [2020-12-23 14:14:07,463 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1677 to 1082. [2020-12-23 14:14:07,463 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1082 states. [2020-12-23 14:14:07,466 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1082 states to 1082 states and 1302 transitions. [2020-12-23 14:14:07,466 INFO L78 Accepts]: Start accepts. Automaton has 1082 states and 1302 transitions. Word has length 48 [2020-12-23 14:14:07,466 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 14:14:07,466 INFO L481 AbstractCegarLoop]: Abstraction has 1082 states and 1302 transitions. [2020-12-23 14:14:07,466 INFO L482 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-12-23 14:14:07,466 INFO L276 IsEmpty]: Start isEmpty. Operand 1082 states and 1302 transitions. [2020-12-23 14:14:07,470 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2020-12-23 14:14:07,470 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 14:14:07,470 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] [2020-12-23 14:14:07,470 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2020-12-23 14:14:07,470 INFO L429 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 14:14:07,471 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 14:14:07,471 INFO L82 PathProgramCache]: Analyzing trace with hash -1359411107, now seen corresponding path program 1 times [2020-12-23 14:14:07,471 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 14:14:07,471 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1808272818] [2020-12-23 14:14:07,471 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 14:14:11,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 14:14:12,116 WARN L197 SmtUtils]: Spent 135.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 33 [2020-12-23 14:14:12,282 WARN L197 SmtUtils]: Spent 133.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 33 [2020-12-23 14:14:12,723 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-23 14:14:12,724 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1808272818] [2020-12-23 14:14:12,724 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 14:14:12,724 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-12-23 14:14:12,724 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [486466780] [2020-12-23 14:14:12,725 INFO L461 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-12-23 14:14:12,725 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 14:14:12,726 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-12-23 14:14:12,726 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2020-12-23 14:14:12,726 INFO L87 Difference]: Start difference. First operand 1082 states and 1302 transitions. Second operand 11 states. [2020-12-23 14:14:24,106 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 14:14:24,106 INFO L93 Difference]: Finished difference Result 1183 states and 1397 transitions. [2020-12-23 14:14:24,108 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-12-23 14:14:24,108 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 48 [2020-12-23 14:14:24,108 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 14:14:24,113 INFO L225 Difference]: With dead ends: 1183 [2020-12-23 14:14:24,113 INFO L226 Difference]: Without dead ends: 1162 [2020-12-23 14:14:24,114 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=94, Invalid=212, Unknown=0, NotChecked=0, Total=306 [2020-12-23 14:14:24,116 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1162 states. [2020-12-23 14:14:24,166 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1162 to 929. [2020-12-23 14:14:24,167 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 929 states. [2020-12-23 14:14:24,169 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 929 states to 929 states and 1114 transitions. [2020-12-23 14:14:24,170 INFO L78 Accepts]: Start accepts. Automaton has 929 states and 1114 transitions. Word has length 48 [2020-12-23 14:14:24,170 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 14:14:24,170 INFO L481 AbstractCegarLoop]: Abstraction has 929 states and 1114 transitions. [2020-12-23 14:14:24,170 INFO L482 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-12-23 14:14:24,170 INFO L276 IsEmpty]: Start isEmpty. Operand 929 states and 1114 transitions. [2020-12-23 14:14:24,171 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2020-12-23 14:14:24,171 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 14:14:24,171 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] [2020-12-23 14:14:24,172 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2020-12-23 14:14:24,172 INFO L429 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 14:14:24,172 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 14:14:24,172 INFO L82 PathProgramCache]: Analyzing trace with hash 1402306347, now seen corresponding path program 1 times [2020-12-23 14:14:24,172 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 14:14:24,173 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1867850654] [2020-12-23 14:14:24,173 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 14:14:24,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 14:14:24,372 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-23 14:14:24,373 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1867850654] [2020-12-23 14:14:24,373 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 14:14:24,373 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-12-23 14:14:24,373 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1671205770] [2020-12-23 14:14:24,374 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-23 14:14:24,374 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 14:14:24,374 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-23 14:14:24,375 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-23 14:14:24,375 INFO L87 Difference]: Start difference. First operand 929 states and 1114 transitions. Second operand 4 states. [2020-12-23 14:14:24,846 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 14:14:24,846 INFO L93 Difference]: Finished difference Result 1457 states and 1730 transitions. [2020-12-23 14:14:24,848 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-12-23 14:14:24,848 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 48 [2020-12-23 14:14:24,849 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 14:14:24,851 INFO L225 Difference]: With dead ends: 1457 [2020-12-23 14:14:24,851 INFO L226 Difference]: Without dead ends: 614 [2020-12-23 14:14:24,853 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 [2020-12-23 14:14:24,854 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 614 states. [2020-12-23 14:14:24,880 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 614 to 554. [2020-12-23 14:14:24,880 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 554 states. [2020-12-23 14:14:24,882 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 554 states to 554 states and 649 transitions. [2020-12-23 14:14:24,882 INFO L78 Accepts]: Start accepts. Automaton has 554 states and 649 transitions. Word has length 48 [2020-12-23 14:14:24,882 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 14:14:24,882 INFO L481 AbstractCegarLoop]: Abstraction has 554 states and 649 transitions. [2020-12-23 14:14:24,882 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-23 14:14:24,882 INFO L276 IsEmpty]: Start isEmpty. Operand 554 states and 649 transitions. [2020-12-23 14:14:24,883 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2020-12-23 14:14:24,883 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 14:14:24,883 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] [2020-12-23 14:14:24,883 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2020-12-23 14:14:24,884 INFO L429 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 14:14:24,884 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 14:14:24,884 INFO L82 PathProgramCache]: Analyzing trace with hash -691020488, now seen corresponding path program 1 times [2020-12-23 14:14:24,884 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 14:14:24,884 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [953920137] [2020-12-23 14:14:24,885 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 14:14:25,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 14:14:25,605 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-23 14:14:25,605 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [953920137] [2020-12-23 14:14:25,605 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 14:14:25,605 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-12-23 14:14:25,606 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1493309805] [2020-12-23 14:14:25,606 INFO L461 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-12-23 14:14:25,606 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 14:14:25,606 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-12-23 14:14:25,607 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2020-12-23 14:14:25,607 INFO L87 Difference]: Start difference. First operand 554 states and 649 transitions. Second operand 10 states. [2020-12-23 14:14:35,523 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 14:14:35,523 INFO L93 Difference]: Finished difference Result 896 states and 1018 transitions. [2020-12-23 14:14:35,525 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2020-12-23 14:14:35,525 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 50 [2020-12-23 14:14:35,526 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 14:14:35,528 INFO L225 Difference]: With dead ends: 896 [2020-12-23 14:14:35,529 INFO L226 Difference]: Without dead ends: 874 [2020-12-23 14:14:35,529 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 63 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=107, Invalid=313, Unknown=0, NotChecked=0, Total=420 [2020-12-23 14:14:35,530 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 874 states. [2020-12-23 14:14:35,565 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 874 to 700. [2020-12-23 14:14:35,565 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 700 states. [2020-12-23 14:14:35,566 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 700 states to 700 states and 826 transitions. [2020-12-23 14:14:35,567 INFO L78 Accepts]: Start accepts. Automaton has 700 states and 826 transitions. Word has length 50 [2020-12-23 14:14:35,567 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 14:14:35,567 INFO L481 AbstractCegarLoop]: Abstraction has 700 states and 826 transitions. [2020-12-23 14:14:35,567 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-12-23 14:14:35,567 INFO L276 IsEmpty]: Start isEmpty. Operand 700 states and 826 transitions. [2020-12-23 14:14:35,568 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2020-12-23 14:14:35,568 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 14:14:35,568 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] [2020-12-23 14:14:35,568 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2020-12-23 14:14:35,569 INFO L429 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 14:14:35,569 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 14:14:35,569 INFO L82 PathProgramCache]: Analyzing trace with hash -416260874, now seen corresponding path program 1 times [2020-12-23 14:14:35,569 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 14:14:35,570 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [840588195] [2020-12-23 14:14:35,570 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 14:14:39,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 14:14:40,505 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-23 14:14:40,505 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [840588195] [2020-12-23 14:14:40,505 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 14:14:40,505 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-12-23 14:14:40,506 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [753732737] [2020-12-23 14:14:40,506 INFO L461 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-12-23 14:14:40,506 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 14:14:40,507 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-12-23 14:14:40,507 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=110, Unknown=0, NotChecked=0, Total=132 [2020-12-23 14:14:40,507 INFO L87 Difference]: Start difference. First operand 700 states and 826 transitions. Second operand 12 states. [2020-12-23 14:14:50,402 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 14:14:50,402 INFO L93 Difference]: Finished difference Result 1054 states and 1226 transitions. [2020-12-23 14:14:50,405 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2020-12-23 14:14:50,405 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 50 [2020-12-23 14:14:50,405 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 14:14:50,410 INFO L225 Difference]: With dead ends: 1054 [2020-12-23 14:14:50,410 INFO L226 Difference]: Without dead ends: 1052 [2020-12-23 14:14:50,411 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 536 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=489, Invalid=1673, Unknown=0, NotChecked=0, Total=2162 [2020-12-23 14:14:50,412 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1052 states. [2020-12-23 14:14:50,454 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1052 to 694. [2020-12-23 14:14:50,454 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 694 states. [2020-12-23 14:14:50,455 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 694 states to 694 states and 819 transitions. [2020-12-23 14:14:50,456 INFO L78 Accepts]: Start accepts. Automaton has 694 states and 819 transitions. Word has length 50 [2020-12-23 14:14:50,456 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 14:14:50,456 INFO L481 AbstractCegarLoop]: Abstraction has 694 states and 819 transitions. [2020-12-23 14:14:50,456 INFO L482 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-12-23 14:14:50,456 INFO L276 IsEmpty]: Start isEmpty. Operand 694 states and 819 transitions. [2020-12-23 14:14:50,457 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2020-12-23 14:14:50,457 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 14:14:50,457 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] [2020-12-23 14:14:50,457 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2020-12-23 14:14:50,458 INFO L429 AbstractCegarLoop]: === Iteration 25 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 14:14:50,458 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 14:14:50,458 INFO L82 PathProgramCache]: Analyzing trace with hash 2069653261, now seen corresponding path program 1 times [2020-12-23 14:14:50,458 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 14:14:50,459 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1520273410] [2020-12-23 14:14:50,459 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 14:14:50,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 14:14:50,714 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-23 14:14:50,715 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1520273410] [2020-12-23 14:14:50,715 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 14:14:50,715 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-12-23 14:14:50,715 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1953351613] [2020-12-23 14:14:50,716 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-23 14:14:50,716 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 14:14:50,716 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-23 14:14:50,717 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-23 14:14:50,717 INFO L87 Difference]: Start difference. First operand 694 states and 819 transitions. Second operand 4 states. [2020-12-23 14:14:53,031 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 14:14:53,031 INFO L93 Difference]: Finished difference Result 694 states and 819 transitions. [2020-12-23 14:14:53,034 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-12-23 14:14:53,034 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 50 [2020-12-23 14:14:53,034 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 14:14:53,037 INFO L225 Difference]: With dead ends: 694 [2020-12-23 14:14:53,037 INFO L226 Difference]: Without dead ends: 603 [2020-12-23 14:14:53,037 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-23 14:14:53,038 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 603 states. [2020-12-23 14:14:53,056 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 603 to 391. [2020-12-23 14:14:53,056 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 391 states. [2020-12-23 14:14:53,057 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 391 states to 391 states and 453 transitions. [2020-12-23 14:14:53,057 INFO L78 Accepts]: Start accepts. Automaton has 391 states and 453 transitions. Word has length 50 [2020-12-23 14:14:53,058 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 14:14:53,058 INFO L481 AbstractCegarLoop]: Abstraction has 391 states and 453 transitions. [2020-12-23 14:14:53,058 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-23 14:14:53,058 INFO L276 IsEmpty]: Start isEmpty. Operand 391 states and 453 transitions. [2020-12-23 14:14:53,058 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2020-12-23 14:14:53,058 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 14:14:53,059 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] [2020-12-23 14:14:53,059 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2020-12-23 14:14:53,059 INFO L429 AbstractCegarLoop]: === Iteration 26 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 14:14:53,059 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 14:14:53,060 INFO L82 PathProgramCache]: Analyzing trace with hash 805278079, now seen corresponding path program 1 times [2020-12-23 14:14:53,060 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 14:14:53,060 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [487759229] [2020-12-23 14:14:53,060 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 14:14:53,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 14:14:53,745 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-23 14:14:53,745 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [487759229] [2020-12-23 14:14:53,745 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 14:14:53,746 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-12-23 14:14:53,746 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1856548712] [2020-12-23 14:14:53,746 INFO L461 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-12-23 14:14:53,747 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 14:14:53,747 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-12-23 14:14:53,747 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2020-12-23 14:14:53,748 INFO L87 Difference]: Start difference. First operand 391 states and 453 transitions. Second operand 10 states. [2020-12-23 14:15:03,388 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 14:15:03,389 INFO L93 Difference]: Finished difference Result 924 states and 1051 transitions. [2020-12-23 14:15:03,391 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2020-12-23 14:15:03,391 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 52 [2020-12-23 14:15:03,392 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 14:15:03,394 INFO L225 Difference]: With dead ends: 924 [2020-12-23 14:15:03,394 INFO L226 Difference]: Without dead ends: 635 [2020-12-23 14:15:03,395 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 78 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=111, Invalid=351, Unknown=0, NotChecked=0, Total=462 [2020-12-23 14:15:03,396 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 635 states. [2020-12-23 14:15:03,419 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 635 to 418. [2020-12-23 14:15:03,419 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 418 states. [2020-12-23 14:15:03,419 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 418 states to 418 states and 488 transitions. [2020-12-23 14:15:03,420 INFO L78 Accepts]: Start accepts. Automaton has 418 states and 488 transitions. Word has length 52 [2020-12-23 14:15:03,420 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 14:15:03,420 INFO L481 AbstractCegarLoop]: Abstraction has 418 states and 488 transitions. [2020-12-23 14:15:03,420 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-12-23 14:15:03,420 INFO L276 IsEmpty]: Start isEmpty. Operand 418 states and 488 transitions. [2020-12-23 14:15:03,421 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2020-12-23 14:15:03,421 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 14:15:03,421 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] [2020-12-23 14:15:03,421 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2020-12-23 14:15:03,421 INFO L429 AbstractCegarLoop]: === Iteration 27 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 14:15:03,422 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 14:15:03,422 INFO L82 PathProgramCache]: Analyzing trace with hash -296896692, now seen corresponding path program 1 times [2020-12-23 14:15:03,422 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 14:15:03,422 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1542856254] [2020-12-23 14:15:03,422 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 14:15:07,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 14:15:07,973 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-23 14:15:07,973 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1542856254] [2020-12-23 14:15:07,974 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 14:15:07,974 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-12-23 14:15:07,974 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [141555060] [2020-12-23 14:15:07,974 INFO L461 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-12-23 14:15:07,974 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 14:15:07,975 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-12-23 14:15:07,975 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2020-12-23 14:15:07,975 INFO L87 Difference]: Start difference. First operand 418 states and 488 transitions. Second operand 8 states. [2020-12-23 14:15:12,977 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 14:15:12,977 INFO L93 Difference]: Finished difference Result 831 states and 970 transitions. [2020-12-23 14:15:12,979 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-12-23 14:15:12,980 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 52 [2020-12-23 14:15:12,980 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 14:15:12,982 INFO L225 Difference]: With dead ends: 831 [2020-12-23 14:15:12,982 INFO L226 Difference]: Without dead ends: 418 [2020-12-23 14:15:12,983 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2020-12-23 14:15:12,984 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 418 states. [2020-12-23 14:15:13,006 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 418 to 418. [2020-12-23 14:15:13,006 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 418 states. [2020-12-23 14:15:13,007 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 418 states to 418 states and 487 transitions. [2020-12-23 14:15:13,007 INFO L78 Accepts]: Start accepts. Automaton has 418 states and 487 transitions. Word has length 52 [2020-12-23 14:15:13,007 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 14:15:13,007 INFO L481 AbstractCegarLoop]: Abstraction has 418 states and 487 transitions. [2020-12-23 14:15:13,008 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-12-23 14:15:13,008 INFO L276 IsEmpty]: Start isEmpty. Operand 418 states and 487 transitions. [2020-12-23 14:15:13,008 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2020-12-23 14:15:13,008 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 14:15:13,008 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] [2020-12-23 14:15:13,009 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2020-12-23 14:15:13,009 INFO L429 AbstractCegarLoop]: === Iteration 28 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 14:15:13,009 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 14:15:13,009 INFO L82 PathProgramCache]: Analyzing trace with hash 342661961, now seen corresponding path program 1 times [2020-12-23 14:15:13,009 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 14:15:13,010 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [428892896] [2020-12-23 14:15:13,010 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 14:15:17,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 14:15:17,845 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-23 14:15:17,845 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [428892896] [2020-12-23 14:15:17,845 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 14:15:17,845 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-12-23 14:15:17,845 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [592912983] [2020-12-23 14:15:17,846 INFO L461 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-12-23 14:15:17,846 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 14:15:17,846 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-12-23 14:15:17,847 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2020-12-23 14:15:17,847 INFO L87 Difference]: Start difference. First operand 418 states and 487 transitions. Second operand 8 states. [2020-12-23 14:15:23,940 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 14:15:23,940 INFO L93 Difference]: Finished difference Result 661 states and 749 transitions. [2020-12-23 14:15:23,943 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2020-12-23 14:15:23,943 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 53 [2020-12-23 14:15:23,943 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 14:15:23,945 INFO L225 Difference]: With dead ends: 661 [2020-12-23 14:15:23,945 INFO L226 Difference]: Without dead ends: 344 [2020-12-23 14:15:23,946 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=101, Invalid=205, Unknown=0, NotChecked=0, Total=306 [2020-12-23 14:15:23,946 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 344 states. [2020-12-23 14:15:23,961 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 344 to 292. [2020-12-23 14:15:23,961 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 292 states. [2020-12-23 14:15:23,962 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 292 states to 292 states and 334 transitions. [2020-12-23 14:15:23,962 INFO L78 Accepts]: Start accepts. Automaton has 292 states and 334 transitions. Word has length 53 [2020-12-23 14:15:23,963 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 14:15:23,963 INFO L481 AbstractCegarLoop]: Abstraction has 292 states and 334 transitions. [2020-12-23 14:15:23,963 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-12-23 14:15:23,963 INFO L276 IsEmpty]: Start isEmpty. Operand 292 states and 334 transitions. [2020-12-23 14:15:23,963 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2020-12-23 14:15:23,963 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 14:15:23,964 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 14:15:23,964 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2020-12-23 14:15:23,964 INFO L429 AbstractCegarLoop]: === Iteration 29 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 14:15:23,964 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 14:15:23,965 INFO L82 PathProgramCache]: Analyzing trace with hash -1272493813, now seen corresponding path program 1 times [2020-12-23 14:15:23,965 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 14:15:23,965 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2079783148] [2020-12-23 14:15:23,965 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 14:15:24,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 14:15:24,818 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-23 14:15:24,819 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2079783148] [2020-12-23 14:15:24,819 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 14:15:24,819 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-12-23 14:15:24,819 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [648182481] [2020-12-23 14:15:24,820 INFO L461 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-12-23 14:15:24,820 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 14:15:24,820 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-12-23 14:15:24,820 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2020-12-23 14:15:24,821 INFO L87 Difference]: Start difference. First operand 292 states and 334 transitions. Second operand 11 states. [2020-12-23 14:15:32,320 WARN L197 SmtUtils]: Spent 111.00 ms on a formula simplification that was a NOOP. DAG size: 38 [2020-12-23 14:15:35,387 WARN L197 SmtUtils]: Spent 105.00 ms on a formula simplification that was a NOOP. DAG size: 32 [2020-12-23 14:15:36,980 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 14:15:36,980 INFO L93 Difference]: Finished difference Result 860 states and 967 transitions. [2020-12-23 14:15:36,984 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2020-12-23 14:15:36,985 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 59 [2020-12-23 14:15:36,985 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 14:15:36,988 INFO L225 Difference]: With dead ends: 860 [2020-12-23 14:15:36,988 INFO L226 Difference]: Without dead ends: 614 [2020-12-23 14:15:36,989 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 163 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=195, Invalid=617, Unknown=0, NotChecked=0, Total=812 [2020-12-23 14:15:36,990 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 614 states. [2020-12-23 14:15:37,007 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 614 to 367. [2020-12-23 14:15:37,007 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 367 states. [2020-12-23 14:15:37,008 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 367 states to 367 states and 425 transitions. [2020-12-23 14:15:37,008 INFO L78 Accepts]: Start accepts. Automaton has 367 states and 425 transitions. Word has length 59 [2020-12-23 14:15:37,008 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 14:15:37,008 INFO L481 AbstractCegarLoop]: Abstraction has 367 states and 425 transitions. [2020-12-23 14:15:37,008 INFO L482 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-12-23 14:15:37,008 INFO L276 IsEmpty]: Start isEmpty. Operand 367 states and 425 transitions. [2020-12-23 14:15:37,009 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2020-12-23 14:15:37,009 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 14:15:37,009 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 14:15:37,009 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2020-12-23 14:15:37,009 INFO L429 AbstractCegarLoop]: === Iteration 30 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 14:15:37,010 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 14:15:37,010 INFO L82 PathProgramCache]: Analyzing trace with hash 1920298712, now seen corresponding path program 1 times [2020-12-23 14:15:37,010 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 14:15:37,010 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1594215349] [2020-12-23 14:15:37,010 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 14:15:42,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 14:15:42,734 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-23 14:15:42,735 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1594215349] [2020-12-23 14:15:42,735 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 14:15:42,735 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-12-23 14:15:42,735 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1037866869] [2020-12-23 14:15:42,736 INFO L461 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-12-23 14:15:42,736 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 14:15:42,736 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-12-23 14:15:42,737 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2020-12-23 14:15:42,737 INFO L87 Difference]: Start difference. First operand 367 states and 425 transitions. Second operand 9 states. [2020-12-23 14:15:51,570 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 14:15:51,570 INFO L93 Difference]: Finished difference Result 771 states and 886 transitions. [2020-12-23 14:15:51,574 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2020-12-23 14:15:51,574 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 59 [2020-12-23 14:15:51,574 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 14:15:51,577 INFO L225 Difference]: With dead ends: 771 [2020-12-23 14:15:51,577 INFO L226 Difference]: Without dead ends: 486 [2020-12-23 14:15:51,578 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=110, Invalid=232, Unknown=0, NotChecked=0, Total=342 [2020-12-23 14:15:51,579 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 486 states. [2020-12-23 14:15:51,620 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 486 to 406. [2020-12-23 14:15:51,620 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 406 states. [2020-12-23 14:15:51,621 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 406 states to 406 states and 471 transitions. [2020-12-23 14:15:51,621 INFO L78 Accepts]: Start accepts. Automaton has 406 states and 471 transitions. Word has length 59 [2020-12-23 14:15:51,621 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 14:15:51,622 INFO L481 AbstractCegarLoop]: Abstraction has 406 states and 471 transitions. [2020-12-23 14:15:51,622 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-12-23 14:15:51,622 INFO L276 IsEmpty]: Start isEmpty. Operand 406 states and 471 transitions. [2020-12-23 14:15:51,622 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2020-12-23 14:15:51,623 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 14:15:51,623 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 14:15:51,623 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2020-12-23 14:15:51,623 INFO L429 AbstractCegarLoop]: === Iteration 31 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 14:15:51,624 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 14:15:51,624 INFO L82 PathProgramCache]: Analyzing trace with hash 1769466451, now seen corresponding path program 1 times [2020-12-23 14:15:51,624 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 14:15:51,624 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1739942297] [2020-12-23 14:15:51,624 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 14:15:51,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 14:15:52,000 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-23 14:15:52,000 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1739942297] [2020-12-23 14:15:52,000 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 14:15:52,001 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-12-23 14:15:52,001 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [448289908] [2020-12-23 14:15:52,001 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-12-23 14:15:52,001 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 14:15:52,002 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-12-23 14:15:52,002 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2020-12-23 14:15:52,002 INFO L87 Difference]: Start difference. First operand 406 states and 471 transitions. Second operand 7 states. [2020-12-23 14:15:53,076 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 14:15:53,077 INFO L93 Difference]: Finished difference Result 820 states and 947 transitions. [2020-12-23 14:15:53,081 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-12-23 14:15:53,081 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 63 [2020-12-23 14:15:53,081 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 14:15:53,083 INFO L225 Difference]: With dead ends: 820 [2020-12-23 14:15:53,084 INFO L226 Difference]: Without dead ends: 478 [2020-12-23 14:15:53,084 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2020-12-23 14:15:53,085 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 478 states. [2020-12-23 14:15:53,109 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 478 to 392. [2020-12-23 14:15:53,110 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 392 states. [2020-12-23 14:15:53,110 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 392 states to 392 states and 452 transitions. [2020-12-23 14:15:53,111 INFO L78 Accepts]: Start accepts. Automaton has 392 states and 452 transitions. Word has length 63 [2020-12-23 14:15:53,111 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 14:15:53,111 INFO L481 AbstractCegarLoop]: Abstraction has 392 states and 452 transitions. [2020-12-23 14:15:53,111 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-12-23 14:15:53,111 INFO L276 IsEmpty]: Start isEmpty. Operand 392 states and 452 transitions. [2020-12-23 14:15:53,112 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2020-12-23 14:15:53,112 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 14:15:53,112 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 14:15:53,112 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2020-12-23 14:15:53,113 INFO L429 AbstractCegarLoop]: === Iteration 32 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 14:15:53,113 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 14:15:53,113 INFO L82 PathProgramCache]: Analyzing trace with hash -1044654306, now seen corresponding path program 1 times [2020-12-23 14:15:53,113 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 14:15:53,113 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1076932785] [2020-12-23 14:15:53,114 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 14:15:57,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 14:15:58,128 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-23 14:15:58,128 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1076932785] [2020-12-23 14:15:58,128 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 14:15:58,129 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-12-23 14:15:58,129 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [164173268] [2020-12-23 14:15:58,129 INFO L461 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-12-23 14:15:58,129 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 14:15:58,130 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-12-23 14:15:58,130 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2020-12-23 14:15:58,130 INFO L87 Difference]: Start difference. First operand 392 states and 452 transitions. Second operand 11 states. [2020-12-23 14:16:02,131 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 14:16:02,131 INFO L93 Difference]: Finished difference Result 535 states and 601 transitions. [2020-12-23 14:16:02,136 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-12-23 14:16:02,136 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 65 [2020-12-23 14:16:02,136 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 14:16:02,138 INFO L225 Difference]: With dead ends: 535 [2020-12-23 14:16:02,139 INFO L226 Difference]: Without dead ends: 456 [2020-12-23 14:16:02,139 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=75, Invalid=165, Unknown=0, NotChecked=0, Total=240 [2020-12-23 14:16:02,140 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 456 states. [2020-12-23 14:16:02,160 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 456 to 388. [2020-12-23 14:16:02,161 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 388 states. [2020-12-23 14:16:02,162 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 388 states to 388 states and 445 transitions. [2020-12-23 14:16:02,162 INFO L78 Accepts]: Start accepts. Automaton has 388 states and 445 transitions. Word has length 65 [2020-12-23 14:16:02,163 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 14:16:02,163 INFO L481 AbstractCegarLoop]: Abstraction has 388 states and 445 transitions. [2020-12-23 14:16:02,163 INFO L482 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-12-23 14:16:02,163 INFO L276 IsEmpty]: Start isEmpty. Operand 388 states and 445 transitions. [2020-12-23 14:16:02,164 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2020-12-23 14:16:02,164 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 14:16:02,164 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 14:16:02,164 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2020-12-23 14:16:02,164 INFO L429 AbstractCegarLoop]: === Iteration 33 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 14:16:02,165 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 14:16:02,165 INFO L82 PathProgramCache]: Analyzing trace with hash 1817302808, now seen corresponding path program 1 times [2020-12-23 14:16:02,165 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 14:16:02,165 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1886231580] [2020-12-23 14:16:02,165 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 14:16:02,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 14:16:02,824 WARN L197 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 21 DAG size of output: 10 [2020-12-23 14:16:03,241 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-23 14:16:03,241 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1886231580] [2020-12-23 14:16:03,241 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 14:16:03,242 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-12-23 14:16:03,242 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [528853409] [2020-12-23 14:16:03,242 INFO L461 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-12-23 14:16:03,242 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 14:16:03,243 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-12-23 14:16:03,243 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2020-12-23 14:16:03,243 INFO L87 Difference]: Start difference. First operand 388 states and 445 transitions. Second operand 12 states.